Advanced Materials Research Vols. 756-759

Abstract: This paper reviews the network distance education teaching mode, Using the computer education as an example, the analysis of the computer aided teaching method the results in the application of quantitative and qualitative analysis method. Make a certain university 2005 freshmen do level test, according to the principle of no significant difference will be divided into a whole new N. Randomly selected two whole (62) for the test group to participate in university computer teaching reform. At the same time, select the other two whole (62) as the reference object for regular teaching. Period, and the two groups of students in four tests, and the four scores on the quantitative analysis; The network distance education in computer aided teaching experience of teachers and students class separately carried on the interview, At the same time, to student's online autonomous learning time and content monitoring and statistics, and student test scores were compared.

Abstract: With the continuous improvement of university library network safety requirements, this paper studies encryption and decryption algorithm analyzing advanced encryption standard AES of the computer, substitution and replacement operation in encryption and decryption process, and key expansion mathematical model. The detailed design of the mathematical modeling process of the algorithm is given, and the whole mathematical modeling process is more thoroughly analyzed. According to the model, library network encryption application is completed. Verified by computer simulation technology, the mathematical model has a good robustness and achieved good results.

Abstract: In this paper, Applying the theory of Nevanlinna, we investigated uniqueness problem of difference polynomial of meromorphic functions and obtained uniqueness theorems of meromorphic functions , which Extended and improved the results of literature [5].

Abstract: Optimization problems are always the hot issues in various research fields. The aim of this paper is to find the optimal value of the bivariable nonlinear function by means of the improved fruit fly optimization algorithm (G-FOA). Some better results are obtained. Compared with other algorithms, G-FOA is concise, can quickly find the global optimum with the high accuracy and without falling into local extremum. These advantages make the algorithm has good robustness and applicability.

Abstract: The similar sentences in multi-document set are combined into one class, and each class is one sub-topic. Describing the sub-topics from the perspective of understanding makes the multi-document summarization become the one with greater coverage and less redundancy. This paper presents a sub-topic segmentation method based on maximum tree algorithm. And based on sentences similarity matrix, maximum tree is calculated, as well as the sub-topic segmentation is realized through the analysis of the different communities for the sub-topic. The experiment shows that the method achieves the desired result.

Abstract: This paper describes a cycle in which organizational learning and software development serve each other, presents the concept of organizational learning cycle method. Experience in a real software development project has led us to identify several key challenges for software design and development through organizational learning. A discussion of these challenges presents steps taken toward addressing them, as well as barriers remaining.

Abstract: With the development and popularization of intranet/Extranet and Internet, it provides vast development space for manufacturing industry. The computer support cooperative work such as collaborative design and collaborative manufacturing based on web is presented under the background. Computer Support Cooperative Work (CSCW) is defined that in the environment supported by computer technology, a groupware cooperatively work to accomplish a common task. The paper is focus on the construction of CSCW system and group collaborative work mode in CSCW. The group collaborative model of CSCW should be intensified further to abstract the features of group collaboration and direct the research on collaborative work technology.

Abstract: [Purpos] In order to address the problem of pricing public infrastructure project based on the binary tree model. [Metho] By the real option binary tree model. [Conclusion This article makes a pricing research on public infrastructure projects to. At the same time, this article makes policy recommendations for the investment powers and the government respectively.

Abstract: State spaces of Stochastic Petri Nets (SPN) are exponent explosion based on subordinate models quantities, it is feasible to solve state space explosion. This article introduces basic theories of SPN performance equivalence simplification, integrates the real workflow of sanction management, constructs workflow model based on SPN comparatively, further more, simplifies the model by equivalence simplification theories, reduces models complexity, solves the model performance quantity analysis effective.

Abstract: An increasing attention has been recently devoted to uncovering community structure in directed graphs which widely exist in real-world complex networks such as social networks, citation networks, World Wide Web, email networks, etc. A two-stage framework for detecting clusters is an effective way for clustering directed graphs while the first stage is to symmetrize the directed graph using some similarity measures. Any state-of-the-art clustering algorithms for undirected graphs can be leveraged in the second stage. Hence, both stages are important to the effectiveness of the clustering result. However, existing symmetrization methods only consider about the direction of edges but ignore the weights of nodes. In this paper, we first attempt to connect link analysis in directed graph clustering. This connection not only takes into consideration the directionality of edges but also uses node ranking scores such as authority and hub score to explicitly capture in-link and out-link similarity. We also demonstrate the generality of our proposed method by showing that existing state-of-the-art symmetrization methods can be derived from our method. Empirical validation shows that our method can find communities effectively in real world networks.