Applied Mechanics and Materials Vols. 571-572

Abstract: Workflow management has been a hot issue in both academic and industrial research. Deadline assignment is of great significance in workflow management. In order to avoid deadline violation, this paper presents an approach to the schedulability analysis of workflow system modeled in p-time Petri nets by separating timing properties from other behavior properties. The analysis of behavioral properties is conducted based on the reachability graph of the underlying p-Time Petri net, whereas timing constraints are checked in term of absolute and relative firing domains. Our technique is based on a concept called clock-stamped state class (CS-class) and temporal logic. With the reachability graph generated based on CS-class, we can directly compute the end-to-end time delay in workflow execution. We have identified a class of well-structured p-time Petri nets such that their reachability can be easy analyzed and temporal behavior can be easy analyzed by time reachability tree logical.

Abstract: Some technical measures should be taken for software protection in addition to the laws and regulations. Software encryption is a commonly used method. The main methods of software encryption are introduced here firstly, and the characteristics of different methods are given. Then the idea of encryption card based on computer system bus is put forward. The design of logical circuit for the concrete realization is shown and the key detection process is described. The key is generated by the port address dynamically with the encryption card. There are several key with multi port. The encryption card is difficult to decrypt and is with good stability, high reliability.

Abstract: Traditional Fuzzing is simple and easy to deploy but inefficient due to different inputs usually execute the redundant path. In this paper, we put forward a binary-oriented Fuzzing technique based on input format analysis and dynamic taint analysis, which can detect vulnerability more efficient than traditional Fuzzing method. We implemented a prototype system called Smart and Directed Fuzz (SDFuzz), which first searches the locations where interested functions are called, then uses dynamic taint analysis technique to classify input data into safety-related data and safety-unrelated data, finally mutates safety-related data to direct the test procedure. The evaluation shows that our method can be used to detect vulnerabilities in binary software efficiently.

Abstract: The rising of the cloud computing and the generation of GIS cloud will promote the development mode of server and client into a new high tide, and with the popularity of intelligent mobile phones and plate computer, mobile will not only the development trend but also the trend of the development of IT, and then the development of intelligent mobile phone for the mobile GIS development will be the future GIS development of one of the main trend. So in our study, we considered how to explore the future wisdom campus mobile end GIS product, from this view, so we choose the system which is today's popular Windows Phone operating , and basing on the the wisdom campus, and design mobile Phone campus GIS system.Our research and development process choose the Microsoft Visual Studio 2010 as development platform, we using c # language for development, and choose ArcGIS Server10 as GIS service server, design and develope the Windows Phone mobile Phone about the mobile Phone campus GIS system. The whole system mainly consists of campus news module, course arrangement module, map query module, my diary module, recent weather modules, the system will convenience users’ campus life, which is also a very meaningful exploration and attempt for the intelligent campus.

Abstract: Despite many automatic vulnerability detection approaches have been well documented, existing solutions for discovering software vulnerabilities in binary software are still difficult and time consuming. In this paper we present an approach based on random programming that works to quickly discover vulnerability in programmable binary software. By extracting the code snippets for special features and fixed API usages, we can get a set of original functional templates, and then we randomize the mutable factors in those templates. After that we reasonably make combination of those templates to produce final test templates. Finally, by concretizing the random factors we execute those test templates and monitor the software be tested to discover vulnerabilities. By template programming we can produce more reasonable test case, which makes our approach more effective than other solutions.

Abstract: Android platform is not implemented Tibetan localization currently. Tibetan glyphs superimposed incorrect. This paper researched Android system source code and Tibetan text features, elaborated Tibetan localized operating on Android system. The main contents include downloaded and compiled Android4.1 source, added the Tibetan language settings options, modified the ICU4C module, added Tibetan font, translated into Tibetan language, solved the problem of Tibetan superposition display, added Tibetan input method, etc. The implementation of the Android platform Tibetan localization is the foundation for Tibetan Localization on Android devices.

Abstract: With the rapid spread of network communication technology, the demand of reliability of the network service system is higher and higher for various industries. Any service failure will bring huge loss to the enterprise or individuals. So HA cluster system is increasingly favored by people as an important means of disaster. In this context, this paper analyzed the characteristics and role of HA cluster and the existing HA cluster software. Finally, in terms of optimization of the cluster mode scheme, disk filter way and the monitoring mode program, the corresponding software design scheme selection was put forward.

Abstract: We explored the subtree matching problem of probabilistic XML documents: finding the matches of an XML query tree over a probabilistic XML document, using the canonical tree edit distance as a similarity measure between subtrees. Probabilistic XML is a probability distribution model capturing uncertainty of both value and structure. Query over probabilistic XML documents is difficult: an naivie algorithm has exponential complexity by directly compute the tree edit distance between the query tree and each certain XML tree represented by the probabilistic XML document. Based on the method of tree edit distance computation over certain XML subtrees, we defined a minimum-solution to the edit distance computation, which means the minimum cost to translate the query tree to the probabilistic XML tree. Furthermore, we developed an algorithm---ASM (Algorithm of Subtree Matching) to compute the minimum solution. Finally, we proved the complexity of ASM is linear in the size of the probabilistic XML document.

Abstract: Index is indispensable in database system to speeding up data access. Commonly used indexes in main memory databases are B+-Tree, T-Tree and their variants. Cost model of main memory database are more complex than disk-oriental database, and relatively little work has been done on this area. This paper establishes a cost model for B+-Tree and CSB+-Tree, analyzes their main performance factors. We perform several experiment evaluations on the cost model.

Abstract: Database security is the protection of the database date, which can prevent the leakage, alteration, destruction of the information caused by the unauthorized user use the database .Those protective measures usually include: authentication, access control, access control, database backup and recovery, and security auditing.