Earticle

Advancements in information and communication technologies have made it easier to forge printed documents these days. Forgery of printed document could have serious repercussions including financial losses, so maintaining the reliability of valuable documents is one that is timely and necessary. The document authentication approach in this study is one that involves tracing of the origin of a document through its contents. The approach explores viability of embedding certain information on printed documents for authentication purposes. Such information could be extracted from the content of documents, which can be divided into two: the context, which includes the text, figures and shapes and the visual attributes of the document, such as its color and design. In short, this study presents a practical and secure method to prevent the forgery of important documents. The proposed method makes use of the public key infrastructure (PKI) and Quick Response (QR) code and the cryptographic hash algorithm shows robustness to printing or scanning noise. The method also makes use of the unique tracking numbers such as device serial numbers, and timestamps enhance the security. To test the feasibility of the method several experiments were perform and the experimental results showed significant improvement in printed document authentication.

To provide unlinkability for wireless sensor network, Jiang et al. proposed an efficient two factor user authentication scheme. The scheme provides some good aspects for wireless sensor network. However, this paper shows that Jiang et al.’s scheme has some security weaknesses and proposes an enhanced scheme to remove the weaknesses in Jiang et al.’s scheme. The proposed scheme does not use verification table and synchronized values between communication parties. It provides user anonymity and un-traceability by adopting dynamic identifier depending on each session dependent random number and time stamps. Comparing with the other authentication schemes, the proposed scheme is more secure while maintaining efficiency.

The Information Industry Ecological Security is a combination of security and dynamic development. This paper analyzes the evolution mechanism of Information Industry Ecological Security from the perspective of evolution driving force, evolution process and so on using the theories and methods of Ecology and Synergetics systematically, and take China’s Information Industry Ecological Security as an example of empirical research, then provided a range of effective policy suggestions for relevant Chinese government departments to control and guide China's Information Industry Ecological Security.

The security of node ID assignment scheme is the foundation of solving security problems in structured P2P systems. However, existing researches on the node ID assignment mechanism present one or more following problems: (1) Schemes just only focused on individual attack, but did not comprehensively analyze the security requirements of node ID assignment mechanism. (2) Schemes needed complex certificate management or met key escrow problem. (3) Almost all existing schemes required a trusted center to act as the single signer of node IDs, but it is very hard to find an absolutely trusted node in structured P2P system. As a result, none of existing schemes can prevent the single signer from being compromised or launching active attack. This paper firstly designs a threshold signature scheme based on secret sharing and certificateless public key cryptosystem without paring (CL-PKC-without-P). Based on that, it proposes a node ID assignment protocol which eliminates the three problems listed above. Using secret sharing technology, this protocol is able to resist the active attacks launching by less than t signer, where t is the threshold value. The results of analysis and simulation show that this protocol is more secure, efficient and scalable.

At present, it has become a hot issue to provide a multi-representation mechanism and build multi-scale spatial databases in the field of GIS. Meanwhile, an inevitable problem is how to evaluate and preserve the consistency of multi-scale spatial data. In this paper, we introduce the concepts of homonymous points and homonymous entities based on innate characteristics of spatial data and put forward a seamless constraint model of multi-scale representation of geographic information that involves time, geometry, spatial relations and semantic characteristics. According to this model, a consistency assessment method has been implemented by computing similarities between vector data at three different scales. The main contributions of this paper are the proposal of a consistency constraint model and assessment system of multi-scale spatial data.

TigerSHARC 201 link interface is a very efficient double data rate protocol. However, its inconsecutive characteristic of clock adds great difficulty for FPGA implementation when transmission rate is too high. In this paper, with specially-designed clock tree, ingenious rate decreasing strategy, plus proper control on FPGA place & routing processing, 8 group link transceivers with data rate over 500MB/s per lane were designed successfully on Xilinx Virtex6 XC6VLX130. Besides, no sophistic IOSERDES component was utilized. Whole design was completed via Verilog RTL code and Xilinx user constrained file. Presented design also has experienced harsh environment test, proved its efficiency and reliability.

Grid resource scheduling policies directly affect the performance of the grid, so the grid resource scheduling algorithm for grid research has become a hot spot. In this paper, based on grid heterogeneity to resource scheduling of load balancing, effective resource utilization and minimize task sets the span of time (Makespan) as the goal, propose a heuristic grid resource scheduling algorithm based on Group of Task and Secondary Distribution, the basic idea is dividing the set of tasks into two groups by using the standard deviation, the one is long tasks group, another is short tasks group .The longest task in long tasks group will be allocated to the worst performance to execute, the rest can be done in the same manner. Tasks in short tasks group will be executed by the Min-Min algorithm , and then through secondary dispatch ideas to make the grid system to quickly reach each resource load balancing , improving resource utilization efficiency and minimizing the task set time span. Finally, the simulation model benchmark Braun et al. demonstrates the effectiveness of the algorithm.

As an open source cloud storage scheme, HDFS is used by more and more large enterprises and researchers, and is actually applied to many cloud computing systems to deal with huge amounts of data. HDFS has many advantages, but there are some problems such as NameNode single point of failure, small file problem, hot issues, etc. For HDFS hot issues, this paper proposes a dynamic Replication mechanism of HDFS hot file based on cloud storage（HDFS-DRM）. The mechanism includes a Replication of the dynamic adjustment mechanism and adding, deleting duplicate node selection mechanism in two parts, by increasing the NameNode, BlockMap parameters, it records the number of reading requests of each file in a certain period of time to decide whether to increase or decrease the number of copies. The mechanism presents a replica placement method based on stage historical information and node load and selects the appropriate node to add or delete copies of documents to improve the utilization efficiency of the data node storage space effectively. Experimental results show that, HDFS - DRM in hot files case, compared to native HDFS file system access latency is significantly reduced, HDFS-DRM can solve the hot issues successfully.