Applied Mechanics and Materials Vols. 543-547

Abstract: Based on design thinking of web services network resources, this paper treated the organization and management of web resources as the purpose and built the mathematical model and algorithm of web network resources service. It designed the spiritual home network ideological and political education network system according to model and algorithm. Spiritual home network system achieved three functions. In order to improve the efficiency of network services, this paper matched the service of spiritual home and finally got a simple web service interface. Finally, the paper compared the service system in this paper with the general service system. The service system designed in this paper can search the service needed in a shorter time. Its accuracy is higher than general service system.

Abstract: With the development of information technology, education office modernization is faced with many opportunities. How to use modern information technology to improve the efficiency and quality of university archives, and achieve ideal results of optimization is today's hot topic. This article first carries on the contrast analysis of the current archives management mode. Through the comparison, we use J2EE framework to establish the network information system of university archives based on the components and level of J2EE, and use MVC structure to realize network business logic, control logic and classification of data display logic. And through the black/white box test and logic coverage, it verifies the stability and operability. The results show that the university archives network information system has high operability. The best load information system should be maintained up to 350 users.

Abstract: At the vital phase of universitys transforming from denotation expansion in quantity to connotation promotion in quality, in the design of modern university system, attention should be paid to the stakeholders rights and interests, especially teachers living state and teaching quality, and students individual needs and discourse power, so as to motivate the innovation vitality of the two principal parts teachers and students. From this perspective, it is a brand-new attempt to establish a new-type university system based on the technology of information and network.

Abstract: In this paper, using the variational principle of multiple two functions establishes the extremal function model of new media Internet network nodes, and the integration of Internet resources is realized by INON network node overlapping technology and P2P technology. Through the integration of Internet moral education resources in colleges, this paper carries out statistics the failure rate of computer resources, when the statistical number is 1000, the failure rate will reach the lowest, and its value is 0.2; when the statistical number is 6000, the failure rate will reach the highest, its value is 1.6. The simulation experiment has been the time curve of Internet moral education resources integration, when a number is 3000 and 4000, the required time is relatively large, and the other number required time is relatively small, which is consistent with the theory, so as to verify the reliability of multiple two variational algorithm and model.

Abstract: The collected massive data during the breeding process usually cost plenty of human power. Therefore, it is urgent to create highly-efficient specific breeding data analysis software to assist breeders to screen fine varieties. For this reason, this paper developed a breeding data management analysis system by taking MyEclipse as development tool, which covers various statistical analysis techniques. In the development process of each algorithm module, JNI technology is adopted to realize Java-called DLL and complete algorithm call, improving the execution efficiency of a large number of arithmetical operations. This paper introduced Java-called DLL by aid of JNI technology in One-Way ANOVA in details and the parameter passing between Java and C++ and how to realize Java-called DLL in the operating system without C++ operating environment. Through the above-mentioned call, the advantages of C++ and Java are comprehensively considered, which not only lightens the burden of Java virtual machine and avoids the repeatability, but also improves the efficiency of arithmetical operation and the utilization rate of codes.

Abstract: It is important to ensure the integrity of the aggregation result and quality of communication among node in wireless sensor network in the condition of high-efficient privacy-preserving data aggregation mechanism. In this paper, we propose a method based on reputation model to solve this problem. During the process of data aggregation, the cluster head node will choose the node with max reputation value as collaborative node to accomplish the aggregation process. To show the efficacy and efficiency of this method, we present the simulation results. The simulation results show that our method iE-CPDA(enforced Integrity Energy-efficient Cluster-based Privacy-preserving Data Aggregation) has less communication and computation and higher accuracy than iCPDA.

Abstract: Recently, understanding and modeling human behavior have attracted increasing interests. In this paper, we provide some statistical research on human behavior in Web surfing during special stage called Flash Crowd (FC). Approximate entropy is used to find out the FC stage. We quantify behavior patterns by interval time between two consecutive request behaviors. Kolmogorov-Smirnov statistical test is used to estimate the appropriate probability distribution function of interval time. The results show that the request behavior patterns varied in different stages.

Abstract: Node Localization technology is one of key technologies in wireless sensor network. DV-Hop localization algorithm is a kind of range-free algorithm. In this paper, an improved DV-Hop algorithm aiming to enhance localization accuracy is proposed. To enhance localization accuracy, average per-hop distance is replaced by corrected value of global average per-hop distance and global average per-hop error. When calculating hop distance, unknown nodes use corresponding average per-hop distance expression according to different hop value. Comparison with DV-Hop algorithm, simulation results show that the improved DV-Hop algorithm can reduce the localization error and enhance the accuracy of sensor nodes localization more effectively.

Abstract: According to the problem that traditional metric methods for software structure cannot reflect the structural features of software system on macro-view, the definition of Radiation Degree is presented based on software network that directed and weighted firstly, and the structural complexity of each node and the overall complexity of the system are measured by evaluating the outward Radiation Degree and inward Radiation Degree of the node. Secondly, because inward Radiation Degree and outward Radiation Degree are different reflection of structural features, Ratio of Radiation Cycle is presented to find the nodes have both high inward Radiation Degree and outward Radiation Degree. This method is detection for defects in software structure that can find the dangerous nodes in structure in time and provide guides during developing or maintaining of software system.

Abstract: Data-parallel and task-parallel methods are the basic methods frequently used for algorithm design in parallel computing. Data-parallel method as name means is used for partition data to be processed into some small blocks considering storage and computing capacity such as memory size of a computation node, node number to take part in parallel computing and total data size, and etc. On the other hand, data dispensing strategy is an important problem carefully considered to increase the efficiency of computation. According to the characteristics of analysis of digital terrain, petri nets is introduced to describe the parallel relationships within data partitions based on data granularity model considering two kinds of computing modes, shared memory and distributed memory respectively, and corresponding scheduling algorithms are proposed for load balance. The experimental results show that our method is very usable to data partition and dispensation, in particular to distributed memory mode.