The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Nowadays, Twitter has become an effective media to communicate as the increasing number of its user. The interaction or relation formed in Twitter could be represented into a graph and calculated using centrality measurement method. Centrality measurement can be used as parameter to determine the popularity or leverage level of an actor towards other actor. The value of centrality measurement is a...
The goal of ensemble construction with several classifiers is to achieve better generalization ability over individual classifiers. An ensemble method produces diverse classifiers and combines their decisions for ensemble's decision. A number of methods have been investigated for constructing ensemble in which some of them train classifiers with the generated patterns. This study investigates a decision...
This paper discusses the scheduling problem for reentrant medical devices testing process. Firstly, while a formal Petri Net (PN) model is built by analyzing scheduling constraints and its optimization objectives, system stability and other system properties are additionally discussed. Secondly, a feasible scheduling solution is calculated based on the PN model and its scheduling constraints; its...
Several dictionary-based input test data compression methods have been proposed for intellectual property (IP) cores testing. To increase the utilization of the dictionary entries some methods are based on the correction of some bits before the loading of the entries into the scan chains. The coordinates of the bits that should be corrected are sent by the automatic test equipment (ATE), hence, the...
This paper discusses the increasing interest in performing End to End testing on modern protection systems. There are many and varied approaches to this test method, from simplistic to overly complex. What is really required and what really makes this test method valuable? What are the technical challenges and how to resolve them? These and other questions are answered. This paper makes a comparison...
Functionally dependent (FD) mappings permeate software systems and impose constraints on designs for verification. This paper develops concepts for accommodating FD relations in combinatorial test designs and derives rules to determine combinatorial coverage for FD factors. FD equivalence class factors are introduced to assess coverage of expected results classes before test case generation. Examples...
The problem of quickest detection of an anomalous process among M processes is considered. At each time, a subset of the processes can be observed, and the observations follow two different distributions, depending on whether the process is normal or abnormal. The objective is a sequential search strategy that minimizes the expected detection time subject to an error probability constraint. This problem...
The verification and validation (V&V) of conceptual model is very important to VV&A of simulation weapons system of systems (WSOS). On the basis of making a summary of WSOS simulation practice, this paper proposed a kind of (V&V) method for conceptual model based on expert method, and proved the method in application.
Along with the development of electronic and intelligence in the world's stock market advances, the accumulation of the stock data grows larger over time. It is of great concern on the ways to find the hidden rules of information in the mass of data. Given the background above, this paper explores the methods of data mining by using the combination of Decision tree algorithm and Clustering algorithm...
The ability to detect change-points in a dynamic network or a time series of graphs is an increasingly important task in many applications of the emerging discipline of graph signal processing. This paper formulates change-point detection as a hypothesis testing problem in terms of Stochastic Block Model time series. We analyze two classes of scan statistics, based on distinct underlying locality...
We consider the dynamic search of a target located in one of K cells. At each time, one cell is searched, and the search result is subject to false alarms. The objective is a policy that governs the sequential selection of the cells to minimize the error probability of detecting the whereabouts of the target within a fixed time horizon. We show that the optimal search policy is myopic in nature with...
We consider the problem of quickest localization of anomaly in a resource-constrained cyber network consisting of multiple components. Due to resource constraints, only one component can be probed at each time. The observations are random realizations drawn from two different distributions depending on whether the component is normal or anomalous. Components are assigned priorities. Components with...
In order to detect image spam effectively, we propose a method based on a K-labels propagation model (KLPM) in this paper. Specifically, the speeded up robust features (SURF) of each image are extracted firstly. Then to standardize the features of each image, an improved means clustering algorithm is used to cluster these features and get the information of M cluster centers. Finally, after being...
The paper is divided into two parts. Part 1 describes the activities in International Commission on Illumination (CIE) on the development of new colour rendering indices (CRI). Methods for conducting psychophysical experiment for assessing colour fidelity of sources are given in Part 2. It is envisaged that the methods proposed will be followed by the labs worldwide to generate new data to test different...
Basis-path coverage testing is a kind of logic-coverage testing and is based on graph theory and vector theory. Because the combination between path and business logic hasn't been considered, non-executable paths could be generated after executing the Basis-path algorithm. This generation model defines the non-executable path-segment and presents sub-model for acquisition of potential non-executable...
Bayesian networks have become a very popular model used to represent probabilistic medical knowledge bases. On the other hand the medical knowledge mostly contains fuzzy relationships among patients, diseases, symptoms and examination and assessment results. In this paper, we present a framework, which will enable us to assess the efficacy of treatment in the presence of imprecise and incomplete information...
In constraint-based program testing, symbolic execution is a technique which allows to generate test data exercising a given execution path, selected within the program to be tested. Applied to a set of paths covering a sufficient part of the code under test, this technique permits to generate automatically adequate test sets for units of code. As databases are ubiquitous in software, generalizing...
A virtual-metrology-based (VM-based) baseline-predictive-maintenance (BPM) scheme was proposed by the authors recently. By applying the BPM scheme, fault diagnosis and prognosis can be accomplished and the requirement of massive historical failure data can also be released. The accuracy of the BPM scheme highly depends on the correctness of the baseline models in the BPM scheme. The samples of creating...
This paper proposes a cryptographic key establishment method based on set of images shared by sender and receiver. The method is simple, fast and secure. We call it CryptoStego. Possible key sizes are virtually limitless. Proposed method is implemented in C programming language. The implementation is compared with (A)RC4 stream cipher, by comparing CPU time and memory occupation by both algorithms...
A hypothesis testing problem with communication constraints is studied, in which two nodes interactively communicate with each other in q rounds to perform a simple binary hypothesis testing on whether the observed random sequences at the nodes are generated independently or not. The optimal tradeoff between the communication rates in q rounds interaction and the testing performance measured by the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.