Harnessing Blockchain to Address Plasma Donation Network Challenges

Plasma therapy is an extensively used treatment for critically unwell patients.For this procedure,a legitimate plasma donor who can continue to supply plasma after healing is needed.However,significant dangers are associated with supply management,such as the ambiguous provenance of plasma and the spread of infected or subpar blood into medicinal fabrication.Also,from an ideological standpoint,less powerful people may be exploited throughout the contribution process.Moreover,there is a danger to the logistics system because there are now just some plasma shippers.This research intends to investigate the blockchain-based solution for blood plasma to facilitate authentic plasma transfer.Blockchain parameters,including electronic identification,chain code,and certified ledgers,have the potential to exert a substantial,profound influence on the distribution and implementation process of blood banks.To understand the practical ramifications of blockchain,the current study provides a proof of concept approach that aims to simulate the procedural code of modern plasma distribution ecosystems using a blockchain-based architecture.The agent-based modeling used in the testing and evaluation mimics the supply chain to assess the blockchain’s feasibility,advantages,and constraints for the plasma.

Apriori and N-gram Based Chinese Text Feature Extraction Method

A feature extraction, which means extracting the representative words from a text, is an important issue in text mining field. This paper presented a new Apriori and N-gram based Chinese text feature extraction method, and analyzed its correctness and performance. Our method solves the question that the exist extraction methods cannot find the frequent words with arbitrary length in Chinese texts. The experimental results show this method is feasible.

Verifiably Encrypted Signatures Without Random Oracles

Verifiably encrypted signatures are employed when a signer wants to sign a message for a verifier but does not want the verifier to possess his signature on the message until some certain requirements of his are satisfied. This paper presented new verifiably encrypted signatures from bilinear pairings. The proposed signatures share the properties of simplicity and efficiency with existing verifiably encrypted signature schemes. To support the proposed scheme, it also exhibited security proofs that do not use random oracle assumption. For existential unforgeability, there exist tight security reductions from the proposed verifiably encrypted signature scheme to a strong but reasonable computational assumption.

Mobile Robot Hierarchical Simultaneous Localization and Mapping Using Monocular Vision

A hierarchical mobile robot simultaneous localization and mapping (SLAM) method that allows us to obtain accurate maps was presented. The local map level is composed of a set of local metric feature maps that are guaranteed to be statistically independent. The global level is a topological graph whose arcs are labeled with the relative location between local maps. An estimation of these relative locations is maintained with local map alignment algorithm, and more accurate estimation is calculated through a global minimization procedure using the loop closure constraint. The local map is built with Rao-Blackwellised particle filter (RBPF), where the particle filter is used to extending the path posterior by sampling new poses. The landmark position estimation and update is implemented through extended Kalman filter (EKF). Monocular vision mounted on the robot tracks the 3D natural point landmarks, which are structured with matching scale invariant feature transform (SIFT) feature pairs. The matching for multi-dimension SIFT features is implemented with a KD-tree in the time cost of O(lbN). Experiment results on Pioneer mobile robot in a real indoor environment show the superior performance of our proposed method.

Towards On-line Automated Semantic Scoring of English-Chinese Translation

Described and exemplified a semantic scoring system of students' on-line English-Chinese translation. To achieve accurate assessment, the system adopted a comprehensive method which combines semantic scoring with keyword matching scoring. Four kinds of words-verbs, adjectives, adverbs and "the rest" including nouns, pronouns, idioms, prepositions, etc., are identified after parsing. The system treats different words tagged with different part of speech differently. Then it calculated the semantic similarity between these words of the standard versions and those of students' translations by the distinctive differences of the semantic features of these words with the aid of HowNet. The first semantic feature of verbs and the last semantic features of adjectives and adverbs are calculated. "The rest" is scored by keyword matching. The experiment results show that the semantic scoring system is applicable in fulfilling the task of scoring students' on-line English-Chinese translations.

A Multiobjective Optimization Algorithm for QoS-Aware Path Selection in DiffServ and MPLS Networks

A multiobjective quality of service (QoS) routing algorithm was proposed and used as the QoS-aware path selection approach in differentiated services and multi-protocol label switching (DiffServ-MPLS) networks. It simultaneously optimizes multiple QoS objectives by a genetic algorithm in conjunction with concept of Pareto dominance. The simulation demonstrates that the proposed algorithm is capable of discovering a set of QoS-based near optimal paths within in a few iterations. In addition, the simulation results also show the scalability of the algorithm with increasing number of network nodes.

Formalization of Fault Analysis and a New Approach of Fault Detection

Substitution permutation network (SPN) is one important structure of block cipher cryptosystems. Prior work has shown different fault analyses on SPN. The formalization of fault analysis of both attack and protect on SPN have been given. The overhead and time tolerance of fault detection have been discussed. The pseudo-blinding method to detect fault attack is introduced, and the balance of the security, overhead and time tolerance based on the evaluation could be made.

An On-line Assessment System for English-Chinese Translation

On-line assessment of English-Chinese translation is a challenging task as it involves natural language processing.YanFa,an on-line assessment system for English-Chinese translation,is a pilot research project into scoring student's translation on-line.Based on the theory of translation equivalence,an algorithm called "conceptual similarity matching" was developed.YanFa can assess students' translation on-line timely,generate test papers automatically,offer standard versions of translation,and the scores of each sentence to students.The evaluation proves that YanFa is practical compared with the scores given by experts.

The Cooperative Multi-agent Learning with Random Reward Values

This paper investigated how to learn the optimal action policies in cooperative multi-agent systems if the agents’ rewards are random variables, and proposed a general two-stage learning algorithm for cooperative multi-(agent) decision processes. The algorithm first calculates the averaged immediate rewards, and considers these learned rewards as the agents’ immediate action rewards to learn the optimal action policies. It is proved that the learning algorithm can find the optimal policies in stochastic environment. Extending the algorithm to stochastic Markov decision processes was also discussed.

Two-Phase Algorithm for Multi-warehouse and Multi-task Based Logistics Delivery

To a scaled logistic company, assigning is an important part of logistic, and further development will make the optimized assigning of multi-warehouse and multi-task possible. This paper provided a two-phase multi-warehouse and multi-task based algorithm which has two phases. In the first phase, it combines sweep algorithm, saving algorithm and virtual task point to present a method. And in the second phase it provides an algorithm for the arrangement of goods loading which is based on the constraints of time-window and attributes of goods and vehicle. It uses the computing results of the first phase to form more detailed delivery scheme based on the constraints of time-window and attributes of vehicle and goods.

EBAKE-SE: A novel ECC-based authenticated key exchange between industrial IoT devices using secure element

Industrial IoT(IIoT)aims to enhance services provided by various industries,such as manufacturing and product processing.IIoT suffers from various challenges,and security is one of the key challenge among those challenges.Authentication and access control are two notable challenges for any IIoT based industrial deployment.Any IoT based Industry 4.0 enterprise designs networks between hundreds of tiny devices such as sensors,actuators,fog devices and gateways.Thus,articulating a secure authentication protocol between sensing devices or a sensing device and user devices is an essential step in IoT security.In this paper,first,we present cryptanalysis for the certificate-based scheme proposed for a similar environment by Das et al.and prove that their scheme is vulnerable to various traditional attacks such as device anonymity,MITM,and DoS.We then put forward an interdevice authentication scheme using an ECC(Elliptic Curve Cryptography)that is highly secure and lightweight compared to other existing schemes for a similar environment.Furthermore,we set forth a formal security analysis using the random oracle-based ROR model and informal security analysis over the Doleve-Yao channel.In this paper,we present comparison of the proposed scheme with existing schemes based on communication cost,computation cost and security index to prove that the proposed EBAKE-SE is highly efficient,reliable,and trustworthy compared to other existing schemes for an inter-device authentication.At long last,we present an implementation for the proposed EBAKE-SE using MQTT protocol.

Automatic Diagnosis of Polycystic Ovarian Syndrome Using Wrapper Methodology with Deep Learning Techniques

One of the significant health issues affecting women that impacts their fertility and results in serious health concerns is Polycystic ovarian syndrome(PCOS).Consequently,timely screening of polycystic ovarian syndrome can help in the process of recovery.Finding a method to aid doctors in this procedure was crucial due to the difficulties in detecting this condition.This research aimed to determine whether it is possible to optimize the detection of PCOS utilizing Deep Learning algorithms and methodologies.Additionally,feature selection methods that produce the most important subset of features can speed up calculation and enhance the effectiveness of classifiers.In this research,the tri-stage wrapper method is used because it reduces the computation time.The proposed study for the Automatic diagnosis of PCOS contains preprocessing,data normalization,feature selection,and classification.A dataset with 39 characteristics,including metabolism,neuroimaging,hormones,and biochemical information for 541 subjects,was employed in this scenario.To start,this research pre-processed the information.Next for feature selection,a tri-stage wrapper method such as Mutual Information,ReliefF,Chi-Square,and Xvariance is used.Then,various classification methods are tested and trained.Deep learning techniques including convolutional neural network(CNN),multi-layer perceptron(MLP),Recurrent neural network(RNN),and Bi long short-term memory(Bi-LSTM)are utilized for categorization.The experimental finding demonstrates that with effective feature extraction process using tri stage wrapper method+CNN delivers the highest precision(97%),high accuracy(98.67%),and recall(89%)when compared with other machine learning algorithms.

An Adaptive Scheme for Neighbor Discovery in Mobile Ad Hoc Networks

The neighbor knowledge in mobile ad hoc networks is important information. However, the accuracy of neighbor knowledge is paid in terms of energy consumption. In traditional schemes for neighbor discovery, a mobile node uses fixed period to send HELLO messages to notify its existence. An adaptive scheme was proposed. The objective is that when mobile nodes are distributed sparsely or move slowly, fewer HELLO messages are needed to achieve reasonable accuracy, while in a mutable network where nodes are dense or move quickly, they can adaptively send more HELLO messages to ensure the accuracy. Simulation results show that the adaptive scheme achieves the objective and performs effectively.

Two Modifications on IKE Protocol with Pre-shared Key Authentication

This paper proposed two modifications on IKE protocol with pre-shared key authentication. The first modification can improve its immunity against DDoS attack by authenticating the initiator before the responder generates the computation-intensive Diffie-Hellman public value. The second modification can improve its efficiency when the attack on messages occurs because it can detect the attack quickly by replacing the centralized authentication in origical IKE protocol with immediate authentication. In addition, the two modifications can be integrated into one protocol compactly.

Formalization of P Systems by Maude

Rewriting logic is a unified model of concurrency, which provides a formal commo n framework of well-known models of concurrent systems. A new formal method of t he specification and execution of P systems using rewriting logic was proposed. The powerful tool Ma ude 2.0 is used to implement this specification. In order to present the general ideas in a concr ete case study, a simple and classical example from the literature is adopted to present how to formally spe cify and execute a P system.

Buffer Overflow Detection on Binary Code

Most solutions for detecting buffer overflow are based on source code. But the requirement tor source code is not always practical especially for business software. A new approach was presented to detect statically the potential buffer overflow vulnerabilities in the binary code of software. The binary code was translated into assembly code without the lose of the information of string operation functions. The feature code abstract graph was constructed to generate more accurate constraint statements, and analyze the assembly code using the method of integer range constraint. After getting the elementary report on suspicious code where buffer overflows possibly happen, the control flow sensitive analysis using program dependence graph was done to decrease the rate of false positive. A prototype was implemented which demonstrates the feasibility and efficiency of the new approach.

Web Page Watermarking for Tamper-Proof

This paper proposed a watermarking algorithm for tamper-proof of web pages. For a web page, it generates a watermark consisting of a sequence of Space and Tab. The wa termark is then embedded into the web page after each word and each line. When a watermarked web page is tampered, the extracted watermark can detect and locate the modifications to the web page. Besides, the framework of watermarked Web Server system was given. Compared with traditional digital signature methods, this watermarking method is more transparent in that there is no necessary to detach the watermark before displaying web pages. The e xperimental results show that the proposed scheme is an effective tool for tamper-proof of web pages.

An Efficient Provable Secure ID-Based Proxy Signature Scheme Based on CDH Assumption

Identity-based proxy signature enables an entity to delegate its signing rights to another entity in identity-based cryptosystem settings. However, few existing scheme has been proved secure in a formalized model, or acquired optimized performance. To achieve the goals of both proven security and high efficiency, this paper proposed an efficient identity-based proxy signature scheme. The scheme is constructed from bilinear pairing and proved secure in the random oracle model, using the oracle replay attack technique introduced by Pointehval and Stern. The analysis shows that the scheme needs less computation costs and has a shorter signature than the other schemes.

Secure Authentication of WLAN Based on Elliptic Curve Cryptosystem

The security of wireless local area network （WI.AN） becomes a bottleneck for its further applications. At present, many standard organizations and manufacturers of WLAN try to solve this problem. However, owing to the serious secure leak in IEEES02.11 standards, it is impossible to utterly solve the problem by simply adding some remedies. Based on the analysis on the security mechanism of WLAN and the latest techniques of WI.AN security, a solution to WLAN security was presented. The solution makes preparation for the further combination of WLAN and Internet.

The Braid-Based Bit Commitment Protocol

With recent advances of quantum computanon, new threats key cryptosystems. In order to build more secure bit commitment schemes, this paper gave a survey of the new coming braid-based cryptography and then brought forward the first braid-based bit commitment protocol. The security proof manifests that the proposed protocol is computationally binding and information-theoretically hiding. Furthermore, the proposed protocol is also invulnerable to currently known quantum attacks.