摘要：This paper presents a practical concurrency control mechanism - ObjectLockingin OODBMS. Object-Locking can schedule transactions, each of themcan be considered as a sequence of high level operations defined on classes. Bythe properties of parallelity and coatativity between high level operations,proper lock modes for each operation are desigued and the compatibility matrixis constructed. With these lock modes, phatoms are kept away from databasesand a high degree of concurrency is achieved.

摘要：In recent years, cloud sync（hronization） services such as GoogleDrive and Dropbox have provided Internet users with convenient and reliable data storing/sharing functionality. The cloud synchronization mechanism （in particular, how to deliver the user-side data updates to the cloud） plays a critical role in cloud sync services because it greatly affects the cloud operation cost （in terms of sync traffic） and user experience （in terms of sync delay）. By comprehensively measuring tens of popular cloud sync services, we find that their cloud sync mechanisms differ greatly in sync performance and design granularity. Quite surprisingly, some very popular services （like GoogleDrive and 115 SyncDisk） utilize a quite coarse-grained cloud sync mechanism that may lead to severe traffic overuse. For example, updating 1-MB data may sometimes result in 260-MB sync traffic. In this paper, we conduct a comparative study of various cloud sync mechanisms by analyzing their respective pros and cons under different situations, unravel the pathological processes for their traffic overuse problems, and finally provide insights/solutions for better choosing/designing a cloud sync service.

摘要：System analysts often use software fault prediction models to identify fault-prone modules during the design phase of the software development life cycle. The models help predict faulty modules based on the software metrics that are input to the models. In this study, we consider 20 types of metrics to develop a model using an extreme learning machine associated with various kernel methods. We evaluate the effectiveness of the mode using a proposed framework based on the cost and efficiency in the testing phases. The evaluation process is carried out by considering case studies for 30 object-oriented software systems. Experimental results demonstrate that the application of a fault prediction model is suitable for projects with the percentage of faulty classes below a certain threshold, which depends on the efficiency of fault identification(low: 47.28%; median: 39.24%; high: 25.72%). We consider nine feature selection techniques to remove the irrelevant metrics and to select the best set of source code metrics for fault prediction.

摘要：The database auto-design is an important problem in database *** this paper we propose some new ideas and an approach called“logic approach”to implement the database *** a relational scheme and a set of the functional dependencies for the relation we can obtain all of the functional dependencies and key for the relation and determine the normal form the relation satisfies.

摘要：New challenges including how to share information on heterogeneous devices appear in data-intensive pervasive computing environments. Data integration is a practical approach to these applications. Dealing with inconsistencies is one of the important problems in data integration. In this paper we motivate the problem of data inconsistency solution for data integration in pervasive environments. We define data qualit~ criteria and expense quality criteria for data sources to solve data inconsistency. In our solution, firstly, data sources needing high expense to obtain data from them are discarded by using expense quality criteria and utility function. Since it is difficult to obtain the actual quality of data sources in pervasive computing environment, we introduce fuzzy multi-attribute group decision making approach to selecting the appropriate data sources. The experimental results show that our solution has ideal effectiveness.

摘要：A multi-bit antifuse-type one-time programmable （OTP） memory is designed, which has a smaller area and a shorter programming time compared with the conventional single-bit antifuse-type OTP memory. While the conventional antifuse-type OTP memory can store a bit per cell, a proposed OTP memory can store two consecutive bits per cell through a data compression technique. The 1 kbit OTP memory designed with Magnachip 0.18 μm CMOS （complementary metal-oxide semiconductor） process is 34% smaller than the conventional single-bit antifuse-type OTP memory since the sizes of cell array and row decoder are reduced. And the programming time of the proposed OTP memory is nearly 50% smaller than that of the conventional counterpart since two consecutive bytes can be compressed and programmed into eight OTP cells at once. The layout area is 214 μm× 327 μ,, and the read current is simulated to be 30.4 μA.

摘要：The configuration space is a fundamental concept that is widely used in algorithmic robotics. Many applications in robotics, computer-aided design, and related areas can be reduced to computational problems in terms of configuration spaces. In this paper, we survey some of our recent work on solving two important challenges related to configuration spaces： ~ how to efficiently compute an approximate representation of high-dimensional configuration spaces; and how to efficiently perform geometric proximity and motion planning queries （n high-dimensional configuration spaces. We present new configuration space construction algorithms based on machine learning and geometric approximation techniques. These algorithms perform collision queries on many configuration samples. The collision query results are used to compute an approximate representation for the configuration space, which quickly converges to the exact configuration space. We also present parallel GPU-based algorithms to accelerate the performance of optimization and search computations in configuration spaces. In particular, we design efficient GPU-based parallel k-nearest neighbor and parallel collision detection algorithms and use these algorithms to accelerate motion planning.

摘要：The unified modeling language(UML) is one of the most commonly used modeling languages in the software *** simplifies the complex process of design by providing a set of graphical notations,which helps express the objectoriented analysis and design of software *** UML is applicable to different types of systems,domains,methods,and processes,it cannot express certain problem domain ***,many extensions to UML have been *** this paper,we propose a framework for integrating the UML extensions and then use the framework to propose an integrated unified modeling language-graphical(iUML-g) ***-g integrates the existing UML extensions into one integrated *** includes an integrated diagram for UML class,sequence,and use case *** proposed approach is evaluated using a case *** proposed iUML-g is capable of modeling systems that use different domains.

摘要：This paper presents a method for correspondence. This technique works by two recognizing images with steps： reference keypoint flat objects based on global keypoint structure selection and structure projection. The using of global keypoint structure is an extension of an orderless bag-of-features image representation, which is utilized by the proposed matching technique for computation efficiency. Specifically, our proposed method excels in the dataset of images containing ＂flat objects＂ such as CD covers, books, newspaper. The efficiency and accuracy of our proposed method has been tested on a database of nature pictures with flat objects and other kind of objects. The result shows our method works well in both occasions.

摘要：As technology advances, there is a considerable gap between the congestion model used in global routing and the routing resource consumption in detailed routing. The new factors contributing to congestion include local pin access paths, vias, and various design rules. In this paper, we propose a practical congestion model with measurement of the impact of design rules, and resources consumed by vias and local pin access paths. The model is compatible with path search algorithms commonly used in global routing. Validated by full-flow routing, this congestion model correlates better with real resource consumption situation in detailed routing, compared with previous work. It leads to better solution quality and shorter runtime of detailed routing when it is used in the layer assignment phase of global routing stage.