摘要：Argumentation (abduction) is widely applied in artificial intelligence (AI) and law reasoning. However, the problem of how to perform argumentation in disjunctive logic programming (DLP) is still *** addition, a unifying semantic framework is required for incorporating various semantics for DLP. An argumentation-theoretic framework for DLP by taking the disjuncts of negative literals as abducibles is presented. This semantics not only is a simple and intuitive framework for performing argumentation and abduction in DLP, but also provides a unifying framework for many key semantics of disjunctive logic programs. In particular, it is shown that the EGCWA, well-founded model and disjunctive stable models can all be embedded into this semantics.

摘要：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 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 μm, and the read current is simulated to be 30.4 μA.

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

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

摘要：We discuss the P-V criticality and phase transition in the extended phase space of Born-Infeld AdS(BIAdS) black hole surrounded by quintessence dark energy, where the cosmological constant Λ is identified with the thermodynamical pressure P. Comparing with Van der Waals(VdW)-like SBH/LBH phase transition of Born-Infeld AdS(BI-AdS) black hole, we find that the BI-AdS black hole surrounded by quintessence dark energy possesses lower critical temperature because of parameter a > 0, even disappears since the parameter a taking enough large values leads to Tc ≤ 0. Moreover, the interesting thermodynamic phenomenon of reentrant phase transition(RPT) are also observed,and the quintessence dark energy plays a similar role in this RPT.

摘要：Quantum-dot cellular automata (QCA) based on cryptography is a new paradigm in the field of nanotechnology. The overall performance of QCA is high compared to traditional complementary metal-oxide semiconductor (CMOS) technology. To achieve data security during nanocommunication, a cryptography-based application is proposed. The devised circuit encrypts the input data and passes it to an output channel through a nanorouter cum data path selector, where the data is decrypted back to its original form. The results along with theoretical implication prove the accuracy of the circuit. Power dissipation and circuit complexity of the circuit have been analyzed.

摘要：The configuration space is a fundamental conc ept 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:(1) how to efficiently compute an approximate representation of high-dimensional configuration spaces; and(2) how to efficiently perform geometric proximity and motion planning queries in 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.

摘要：Many research issues have been raised in Application Layer Multicasting(ALM),such as group management,security,integrity of data,link stress,link stretch,load balancing,fault tolerance and scalability,because of the shifting of the multicast protocol from the IP layer to the application *** address these issues many protocols have evolved by changing their topology *** this paper,the POSET protocol stack is proposed,which consists of three layers,such as communication control,POSET cube,and content *** novelty of this paper is the lattice-based data distribution with POSET cube *** results have been compared with the existing NICE and Narada *** experimental results show that the proposed POSET protocol improves throughput between 7.14%and 40%and decreases the delay between 7.69%and 25%,compared to the existing NICE protocol.

摘要：This article presents a general form of the estimator for identifying dispersion effects from unreplicated two-level factorial experiments,and shows that the widely used estimators such as the BH,MH,and AMH estimators are all special cases of the proposed one,designated as the G *** unbiased condition of the G estimator is proved,and a lower bound of variance of the G estimator is provided.A simulation based on a realistic design illustrates the variation of the variance and MSE(mean square error) of the G estimator on different *** estimator may be more flexible and has better performance than other methods such as the BH and MH estimators by appropriately selecting the coefficients.