Both preference logics and preference representation in logic programming are concerned with reasoning about preferences on combinatorial domains, yet little research has been published using preference axioms in logi...
详细信息
Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a...
详细信息
ISBN:
(纸本)9781849195379
Answer set programming (ASP) has become an important tool for knowledge representation and reasoning. Inconsistency processing in ASP provides a way for reasoning of inconsistent knowledge. In this paper, we present a minimal principle based method to process inconsistency in ASP. The method is able to ensure maximum retention of certain knowledge by removing the fewest defeasible rules preferentially. Then, we propose corresponding algorithms for simple logic programs and extended logic programs, and analyze the complexity of our method. After that, we compare this method with related work. Finally, we conclude and indicate the prospect of the further research.
keys are very important for data management. Due to the hierarchical and flexible structure of XML, mining keys from XML data is a more complex and difficult task than from relational databases. In this paper, we stud...
详细信息
Controls, especially effficiency controls on dynamical processes, have become major challenges in many complex systems. We study an important dynamical process, random walk, due to its wide range of applications for m...
详细信息
Controls, especially effficiency controls on dynamical processes, have become major challenges in many complex systems. We study an important dynamical process, random walk, due to its wide range of applications for modeling the transporting or searching process. For lack of control methods for random walks in various structures, a control technique is presented for a class of weighted treelike scale-free networks with a deep trap at a hub node. The weighted networks are obtained from original models by introducing a weight parameter. We compute analytically the mean first passage time (MFPT) as an indicator for quantitatively measurinM the et^ciency of the random walk process. The results show that the MFPT increases exponentially with the network size, and the exponent varies with the weight parameter. The MFPT, therefore, can be controlled by the weight parameter to behave superlinearly, linearly, or sublinearly with the system size. This work provides further useful insights into controllinM eftlciency in scale-free complex networks.
Skeleton has very important applications in objects expression, data compression, computer vision and animation. In the discrete space, the basic skeleton algorithms have two categories: one is thinning, the other is ...
详细信息
In real active noise control (ANC)applications,the following situations frequently occur, one isthat disturbances only present at the error sensor and havelowcorrelation with reference signal, the other is thatthere i...
详细信息
ISBN:
(纸本)9780909882037
In real active noise control (ANC)applications,the following situations frequently occur, one isthat disturbances only present at the error sensor and havelowcorrelation with reference signal, the other is thatthere is no enough space or ideal position for locating the reference sensor to satisfy causality condition. Thusthe residual noise after feedforward control can be seen as uncorrelated narrowband disturbancesin these situationsand ahybrid adaptive feedforward and feedback structure is often utilized to cope with this *** efforts have been paid to improve the performance of the hybrid ANC system, nevertheless, few interests are concerned about the combination method between the feedforward and feedback structure. After investigating the conventional combination method of hybrid feedforward and feedback system, this paper introduces analternate combination method for hybrid ANC systemwhich featuresthat itavoidsthe coupling between the feedforward and feedback structures and both structures are concatenated to attenuate the ambient noise. Simulations are carried out to validatethe effectiveness of the introduced methodfor ANCwith uncorrelated narrowband disturbances.
In this paper, we present a tree-like blood vessels based on the region growing algorithm and level sets methodfor computing centerlines for both 2D and 3D shape analysis. Consider the tree-like vascular structure, we...
详细信息
To segment medical images with distribution shifts, domain generalization (DG) has emerged as a promising setting to train models on source domains that can generalize to unseen target domains. Existing DG methods are...
详细信息
In Internet of vehicles, vehicular edge computing(VEC) as a new paradigm can effectively accomplish various tasks. Due to limited computing resources of the roadside units(RSUs), computing ability of vehicles can be a...
详细信息
In Internet of vehicles, vehicular edge computing(VEC) as a new paradigm can effectively accomplish various tasks. Due to limited computing resources of the roadside units(RSUs), computing ability of vehicles can be a powerful supplement to computing resources. Then the task to be processed in data center can be offloaded to the vehicles by the RSUs. Due to mobility of the vehicles, the tasks will be migrated among the RSUs. How to effectively offload multiple tasks to the vehicles for processing is a challenging problem. A mobility-aware multi-task migration and offloading scheme for Internet of vehicles is presented and analyzed. Considering the coupling between migration and offloading, the joint migration and offloading optimization problem is formulated. The problem is a NP-hard problem and it is very hard to be solved by the conventional methods. To tackle the difficult problem, the idea of alternating optimization and divide and conquer is introduced. The problem can be decoupled into two sub-problems: computing resource allocation problem and vehicle node selection problem. If the vehicle node selection is given, the problem can be solved based on Lagrange function. And if the allocation of computing resource is given, the problem turns into a 0-1 integer programming problem, and the linear relaxation of branch bound algorithm is introduced to solve it. Then the optimization value is obtained through continuous iteration. Simulation results show that the proposed algorithm can effectively improve system performance.
Data augmentation is an important technique for enhancing machine learning performance. In this study, we propose a novel generative data augmentation method for named entity recognition, which addresses the challenge...
详细信息
暂无评论