摘要：Geo Agents, a multi agent system that processes distributed geospatial information and geospatial service was presented. Firstly, the requirement for distributed geographical information process was discussed, and the architecture of Geo Agents was introduced. Then in depth discussions were raised on agent system implementation, such as the basic agent, agent advertising, message passing, and collaborating. An example was also given to explain the problem solving process.

摘要：An approach to camera location determination based on the perspective projection geometry of three points is proposed, which is simple and straightforward. No rigid restrictions are placed on the original positional and orientational relationships between the camera and the mark. Experimental results verify the feasibility of the proposed approach.

摘要：A new algorithm for the solution of under constraint graph in sketch drawing is put forward. The directed process of constraint graph is completed by picking concealed constraints of adjacent entities in sketch of few or no dimensions. In this paper, the priority of concealed constraint is given by the different constraint types and constructing orders, and some more priority concealed constraints are forced into obvious ones by the need number of constraint for every node in constraint solution process.

摘要：Machine learning (ML) has been widely used todesign and develop new materials owing to its low computational cost and powerful predictive capabilities. In recentyears, the shortcomings of ML in materials science have gradually emerged, with a primary concern being the scarcity ofdata. It is challenging to build reliable and accurate ML modelsusing limited data. Moreover, the small sample size problemwill remain long-standing in materials science because of theslow accumulation of material data. Therefore, it is importantto review and categorize strategies for small-sample learningfor the development of ML in materials science. This reviewsystematically sorts the research progress of small-samplelearning strategies in materials science, including ensemblelearning, unsupervised learning, active learning, and transferlearning. The directions for future research are proposed, including few-shot learning, and virtual sample *** importantly, we emphasize the significance of embedding material domain knowledge into ML and elaborate on thebasic idea for implementing this strategy.

摘要：With the explosion of information nowadays, applying data storage safety requirements has become a new challenge, especially in high data available cluster environments. With the emergence of Storage Area Networks （SANs）, storage can be network-based and consolidated, and mass data movements via Fiber Channels （FCs） can be of very high speed. Based on these features, this paper introduces a dual-node storage cluster designed for remote mirroring as a concurrent data replication method to protect data during system failures. This design takes full advantage of a SAN system＇s benefits, and it adopts a synchronous protocol to guarantee a fully up-to-date data copy on the remote site. By developing a Linux kernel module to control the I/O flow and by using the technologies of software Logic Unit Number （LUN） masking, background online resynchronization and a self-management daemon, we have achieved a reliable mirroring system with the characteristics of server-free data replication, fault tolerance, online disaster recovery and high performance. In this study, we implemented the design in a remote mirror subsystem built on a software Fiber Channel Storage Area Network （FC-SAN） system.

摘要：Many websites use verification codes to prevent users from using the machine automatically to register,login,malicious vote or irrigate but it brought great burden to the enterprises involved in internet marketing as entering the verification code *** the verification code security system needs the identification method as the corresponding testing *** propose an anisotropic heat kernel equation group which can generate a heat source scale space during the kernel evolution based on infinite heat source axiom,design a multi-step anisotropic verification code identification algorithm which includes core procedure of building anisotropic heat kernel,settingwave energy information parameters,combing outverification codccharacters and corresponding peripheral procedure of gray scaling,binarizing,denoising,normalizing,segmenting and identifying,give out the detail criterion and parameter *** test show the anisotropic heat kernel identification algorithm can be used on many kinds of verification code including text characters,mathematical,Chinese,voice,3D,programming,video,advertising,it has a higher rate of 25%and 50%than neural network and context matching algorithm separately for Yahoo site,49%and 60%for Captcha site,20%and 52%for Baidu site,60%and 65%for 3DTakers site,40%,and 51%.for MDP site.

摘要：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.

摘要：A novel nanoscale MOSFET with a source/drain-to-gate non-overlapped and high-k spacer structure has been demonstrated to reduce the gate leakage current for the first *** gate leakage behaviour of the novel MOSFET structure has been investigated with the help of a compact analytical model and Sentaurus simulation. A fringing gate electric field through the dielectric spacer induces an inversion layer in the non-overlap region to act as an extended S/D（source/drain） *** is found that an optimal source/drain-to-gate non-overlapped and high-A：spacer structure has reduced the gate leakage current to a great extent as compared to those of an overlapped ***,the proposed structure had improved off current,subthreshold slope and drain induced barrier lowering（DIBL） *** is concluded that this structure solves the problem of high leakage current without introducing extra series resistance.

摘要：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.

摘要：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.