Self-organization is an important characteristic for multi-agent systems. However developing self-organization multi-agent systems in a repeated and effective way is still a great challenge. It is well known that desi...
详细信息
Self-organization is an important characteristic for multi-agent systems. However developing self-organization multi-agent systems in a repeated and effective way is still a great challenge. It is well known that design patterns are the practice and knowledge about solutions for recurring problems, and reusing design pattern can significantly improve the software development quality and efficiency. On the other hand, current self-organization applications are still lack of effective way to handle the unpredicted environment and changing user requirements. In this paper, we take policy as the basic principle for self-organization multi-agent systems to solve this problem, and propose a policy based design pattern for the self-organization multi-agent systems.
An automatic method for answering repeated questions based on semantic question patterns is proposed in this paper. the semantic question pattern used is a generalized representation of a group of questions with both ...
详细信息
An automatic method for answering repeated questions based on semantic question patterns is proposed in this paper. the semantic question pattern used is a generalized representation of a group of questions with both similar structure and relevant semantics. Specifically, it consists of semantic annotations (or constraints) for the variable components in the pattern and hence enhances the semantic representation and greatly reduces the ambiguity of a question instance when asked by a user using such pattern. the proposed method consists of three major steps: structure processing, similar pattern matching and filtering, question similarity evaluation and answer retrieval. Preliminary experiments show that the precision of acquisition of the best answer to a new question can be more than 90% on our testing dataset.
One of the essential but formidable tasks in cloud computing is to detect malicious attacks and their types. A cloud provider's constraints or inability in monitoring its employees, and lack of transparency, may m...
详细信息
One of the essential but formidable tasks in cloud computing is to detect malicious attacks and their types. A cloud provider's constraints or inability in monitoring its employees, and lack of transparency, may make the detection process even harder. We found these insiders' activities form similar pattern in the monitoring systems as some other cyber attacks because these also uses huge computer resources. In this paper we first provide a brief overview on the importance of monitoring insiders' activities through a literature survey on cloud computing security. then, we observe some of the real life insiders' activities that can be detected from the performance data in a hypervisor and its guest operating systems. Rule based learning is successfully used for identification of these activities in this research. We further observe that some of these insiders' activities can on occasions turn into a malicious insider's attack, and thus, need constant monitoring in the cloud environment.
Ever-growing test data volume and test power dissipation poses significant cost and security challenges in testing core-based system-on-chip (SoC). In this paper, a test pattern recombination technique is proposed to ...
详细信息
Ever-growing test data volume and test power dissipation poses significant cost and security challenges in testing core-based system-on-chip (SoC). In this paper, a test pattern recombination technique is proposed to improve test data compression and decrease scan test power dissipation. the proposed technique first analyzes the entropy of a test set, which is used to determine the maximum compression ratio, and then divides the test set into a group of patterns that are used as scan slices for scan test based on multi-scan chains. the probability of the compatibility between the patterns in every vector is calculated, according to which the patterns of each test vector are recombined so that the patterns with high compatible probability are placed closely. Finally, for all the test vectors in a test set, a unified arrangement order for their patterns is determined based on the goal that the test set can be compressed and the scan test power dissipation can be decreased to advantage. the proposed scheme is applied to ISCAS89 test benchmarks and their MinTest test sets are used. the experimental results show that compared to the recently presented scheme, the proposed technique can effectively ensure a high data compression ratio and reduce shift power dissipation during testing.
In many real-life applications (e.g., in aircraft maintenance), we need to estimate the probability of failure of a complex system (such as an aircraft as a whole or one of its subsystems). Complex systems are usually...
详细信息
In many real-life applications (e.g., in aircraft maintenance), we need to estimate the probability of failure of a complex system (such as an aircraft as a whole or one of its subsystems). Complex systems are usually built with redundancy allowing them to withstand the failure of a small number of components. In this paper, we assume that we know the structure of the system, and, as a result, for each possible set of failed components, we can tell whether this set will lead to a system failure. In some cases, for each component A, we know the probability P(A) of its failure;in other cases, however, we only know the lower and upper bounds P(A) and P¯(A) for this probability. Sometimes, we only have expert estimates for these probabilities, estimates that can be described as fuzzy numbers. Usually, it is assumed that failures of different components are independent events, but sometimes, we know that they are dependent - in which case we usually do not have any specific information about their correlation. Our objective is to use all this information to estimate the probability of failure of the entire the complex system. In this paper, we describe methods for such estimation.
In this paper we propose the SPARE C++ Library as a flexible tool for solving data driven modelling problems,where the domain space is not necessary constrained to be the set of real valued *** possibility to face Pat...
详细信息
ISBN:
(纸本)9781612848334
In this paper we propose the SPARE C++ Library as a flexible tool for solving data driven modelling problems,where the domain space is not necessary constrained to be the set of real valued *** possibility to face patternrecognition problems directly on structured domains (multimedia data,strings,graphs) is fundamental to the effective solution of many interesting applications in the field of content based retrieval and Knowledge *** an instance of this particular characteristic of SPARE,we considered a clustering problem defined in the string domain,focusing on the problem of cluster representation in data domains where only a dissimilarity measure can be *** this aim we propose to adopt the MinSOD (Minimum Sum of Distances) defined as the element of a cluster minimizing the sum of dissimilarities from all the other elements in the considered *** the precise computation of the MinSOD have a high computational cost,we propose a suboptimal procedure consisting in computingthe representative of the cluster considering only a reduced pool of samples,instead of the whole set of objects in the *** have carried out some tests in order to ascertain the sensitivity of the clustering procedure with respect to the number of samples in the pool used to compute the *** show a good robustness of the proposed *** implementation is available as part of the SPARE library,published as an open source project.
Geomagnetic precursor is one of many earthquake precursors, which have better effects on earthquake prediction, while the diurnal variation anomaly of geomagnetic precursor Z component is an important one in short-imp...
详细信息
the dimensionality and the amount of data that need to be processed when intensive data streams are classified may occur prohibitively large. the aim of this paper is to analyze Johnson-Linden-strauss type random proj...
详细信息
ISBN:
(纸本)9783642132070
the dimensionality and the amount of data that need to be processed when intensive data streams are classified may occur prohibitively large. the aim of this paper is to analyze Johnson-Linden-strauss type random projections as an approach to dimensionality reduction in pattern classification based on K-nearest neighbors search. We show that in-class data clustering allows us to retain accuracy recognition rates obtained in the original high-dimensional space also after transformation to a lower dimension.
Location Fingerprinting methods are an alternative to accurate localization of mobile sensors and actuators in indoor environments, which learn a radio map for a given scenario and use this information for recognizing...
详细信息
We consider patternrecognition problem when classes and their labels are linearly structured (or ordered). We propose the loss function based on the squared differences between the true and the predicted class labels...
详细信息
ISBN:
(纸本)9783642132070
We consider patternrecognition problem when classes and their labels are linearly structured (or ordered). We propose the loss function based on the squared differences between the true and the predicted class labels. the optimal Bayes classifier is derived and then estimated by the recursive kernel estimator. Its consistency is established theoretically. Its RBF-like realization of the classifier is also proposed together with a recursive learning algorithm, which is well suited for on-line applications. the proposed approach was tested in real life example involving classification of moving vehicles.
暂无评论