Applied Mechanics and Materials Vols. 571-572

Abstract: The concept of information entropy is applied to evaluation for anti-interference performance of velocity and distance measurement in DS/FH hybrid spread spectrum TT&C (Tracking, Telemetry & Command) system, establishing an evaluation model where the entropy loss degree is used as an index under the rule of information, and analyzing the impact on the index from the changing of interference parameters. The feasibility of using entropy loss degree as an evaluation index was verified by simulation.

Abstract: Recent industry research shows that the existing layout configuration can not satisfy complex manufacturing of many production types. New layout strategy, especially distributed layout received more attention, has the potential to cope with demand interference. This paper attempts to use the method of resource element (RE) to consider equipment production capacity to design weighted distributed layout. Give a more explicit description of unique and common processing ability of devices and parts processing requirements. Considering the weights between REs and make more relevant REs adjacent, using genetic algorithm to construct RE-based weighted distributed layout, minimizing the total weighted minimum distance between REs to minimize material transportation costs.

Abstract: Association rule mining is one of the most important and well researched techniques of data mining, the key procedure of the association rule mining is to find frequent itemsets , the frequent itemsets are easily obtained by maximum frequent itemsets. so finding maximum frequent itemsets is one of the most important strategies of association data mining. Algorithms of mining maximum frequent itemsets based on compression matrix are introduced in this paper. It mainly obtains all maximum frequent itemsets by simply removing a set of rows and columns of transaction matrix, which is easily programmed recursive algorithm. The new algorithm optimizes the known association rule mining algorithms based on matrix given by some researchers in recent years, which greatly reduces the temporal complexity and spatial complexity, and highly promotes the efficiency of association rule mining.

Abstract: A secret sharing scheme on access structure is proposed basing on the Lagrange interpolation, in which any extra information for each qualified subset is not needed, and each participant only needs to keep one shadow. Besides, the proposed scheme can be used to share multi-secret. Compared to the existing schemes, the proposed scheme is more simple, and easy to be applied in practice.

Abstract: Florian Böhl et al. introduced tag-based signature schemes in 2013. We focus on their SIS-based tag-based signature scheme in lattice-based cryptography. Without aggregation techniques in lattice-based signatures, their tag-based signature has long signature length. We use the technique of lattice basis delegation with fixed dimension to shorten the signature length. Compared with the original scheme, our scheme’s signature is one-half length, at the price of security proof in the random oracle model.

Abstract: In this paper, an identity-based conditional proxy re-encryption (PRE) scheme is proposed, where a delegator provides a re-encryption key satisfying one condition to a semi-trusted proxy who can convert a ciphertext encrypted under the delegator’s public key into one that can be decrypted using the delegatee’s private key. We address the identity-based proxy re-encryption scheme, where the delegator and the delegatee request keys from a trusted party known as a key generator center (KGC), who generates private keys for delegator and delegatee based on their identities. Meanwhile, the identity-based conditional proxy re-encryption scheme satisfies the properties of PRE including unidirectionality, non-interactivity and multi-hop. Additionally, the identity-based conditional proxy re-encryption scheme is efficient in terms of both the communication cost and the computing cost, and can realize security secret sharing in cloud computing environments.

Abstract: In the cloud storage system, the server is no longer trusted, which is different from the traditional storage system. Therefore, it is necessary for data owners to encrypt data before outsourcing it for sharing. Simultaneously, the enforcement of access policies and support of policies updates becomes one of the most challenging issues. Ciphertext-policy attribute-based encryption (CP-ABE) is an appropriate solution to this issue. However, it comes with a new obstacle which is the attribute and user revocation. In this paper, we propose a fine-grained access control scheme with efficient revocation based on CP-ABE approach. In the proposed scheme, we not only realize an efficient and immediate revocation, but also eliminate some burden of computational overhead. The analysis results indicate that the proposed scheme is efficient and secure for access control in cloud storage systems.

Abstract: The integrity and fidelity of digital evidence are very important in live forensics. Previous research has studied the uncertainty of live forensics based on different memory snapshots. However, this kind of method is not effective in practice. In fact, memory images are usually acquired by using forensics tools instead of using snapshots. Therefore, the integrity and fidelity of live evidence should be evaluated during the acquisition process. In this paper, we give a new viewpoint that memory acquisition can be regarded as a measurement of memory data. From this viewpoint, we evaluate the integrity and fidelity of live evidence in the process of physical memory acquisition. Firstly, several definitions about memory acquisition measure error are introduced to describe the trusty. Then, we analyze the experimental error and propose some suggestions on how to reduce it. A novel method is also developed to calculate the system error in detail. The results of a case study on Windows 7 and VMware virtual machine show that the experimental error has good accuracy and precision, which demonstrate the efficacy of the proposed reducing methods. The system error is also evaluated, that is, it accounts for the whole error from 30% to 50%. Last, a method is proposed to calculate changes or error of system process.

Abstract: In MANET, MSWCA is a typical algorithm in clustering algorithms with consideration on motion-correlativity. Aiming at MSWCA’s problem that “it only considers on intra-cluster stability, and neglects the inter-cluster stability”, a MANET-based stable clustering algorithm (MSCA) was proposed. Firstly, MSCA clustering algorithm and its cluster maintenance scheme were designed. Secondly, the theoretical quantitative analyses on average variation frequency of clusters and clustering overheads were conducted. The results show that MSCA can improve cluster stability and reduce clustering overheads.

Abstract: Retracted paper: This paper proposes a new framework of combining reinforcement learning with cloud computing digital library. Unified self-learning algorithms, which includes reinforcement learning, artificial intelligence and etc, have led to many essential advances. Given the current status of highly-available models, analysts urgently desire the deployment of write-ahead logging. In this paper we examine how DNS can be applied to the investigation of superblocks, and introduce the reinforcement learning to improve the quality of current cloud computing digital library. The experimental results show that the method works more efficiency.