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.
In the context of music indexation, it would be useful to have a precise information about the number of sources performing; a source is a solo voice or an isolated instrument which produces a single note at any time. This correspondence discusses the automatic distinction between monophonic music excerpts, where only one source is present, and polyphonic ones. Our method is based on the analysis...
This paper presents a theoretical and practical novel approach for computing the probability density function underlying a set of observations. The estimator we propose is an extension of the conventional Parzen Rosenblatt method that leads to a very specific interval-valued estimation of the density. Within this approach, we make use of the convenient representation of a set of usual (summative)...
This paper studies the problem of coverage management with two emerging formalisms in simulation based validation, namely formal specification of test points and the use of inline temporal assertions. We present methods for checking whether a test-bench with inline assertion covers a set of formal test points. This is particularly useful in developing verification IPs for standard on-chip protocols...
In embedded systems, Application Specific Instruction Set Processors (ASIPs) are used commonly with the aim to get high performance without losing flexibility. A crucial operation required during ASIP synthesis (in particular, selection of custom instructions) as well as code generation for ASIPs is identifying portions of an application program that can be executed by custom functional units (CFUs)...
Different method calls may have different contributions to the precision of the final application when abstracted into the call strings. The existing call string based pointer analysis algorithms do not consider such contribution difference and hence often can not achieve best cost-effectiveness. To solve the problem, this paper firstly proposes a contribution-based call stack abstraction method which...
The goal of Information Extraction is to automatically generate structured pieces of information from the relevant information contained in text documents. Machine Learning techniques have been applied to reduce the cost of Information Extraction system adaptation. However, elements of human supervision strongly bias the learning process. Unsupervised learning approaches can avoid these biases. In...
The extended finite state machine (EFSM) is an extension of the finite state machine, which creates input and output parameters, context variables, operations and predicates. It is applied widely in the fields of software engineering since there are many tools that support software development activities based on the EFSM models. However, the theoretical foundation of EFSM is not yet well-developed...
Service process usually needs to be tailored for reuse because of change of context. In this paper, we present a mining approach to mining process change sequences based on different context using partial derivatives of the factors affecting the change context, thus finding the best feasible sequence.
Web service discovery is a mechanism which facilitates an access to the Web service descriptions. UDDI facilitates the discovery based on the service functionality through keyword and category matching. Such discovery techniques do not consider the semantics and user context as they are too syntactic in nature. In this paper, we propose a well formed functional semantics to describe an operation of...
Mining frequent closed itemsets provides complete and condensed information for frequent pattern mining. Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we first present a general methodology to identify closed itemsets over data streams, using concept lattice theory. Using this methodology, we then proposed a...
Random key graphs form a class of random graphs naturally associated with the random key predistribution scheme of Eschenauer and Gligor. We compute the clustering coefficients of random key graphs, and then compare them with Erdos-Renyi graphs in the many node regime when the expected average degrees are asymptotically equivalent. On the parameter range of practical relevance in wireless sensor networks,...
In this paper we present the design of a decentralized vision-based object search system that can be used for elder care in a smart environment. In our approach, each autonomous search agent maintains separate estimates of the probability density function (PDF) of the object location and makes independent decisions about its search process. Asynchronous cooperative search is achieved by transmitting...
Global asymptotic stabilization for a class of nonlinear systems is addressed. The dynamics of these systems are composed of a linear part to which is added some nonlinearities which satisfy two different sector bound conditions depending wether the state is closed or distant from the origin. The approach described here is based on the uniting of control Lyapunov functions as introduced in. The stabilization...
We discuss a conceptually new extension of our previous works in which we proposed a concept of a consensus reaching support system based on a new, gradual notion of consensus devised in the framework of fuzzy preference relations and a fuzzy majority. Here, first of all, we propose the use of action rules as a tool to generate some advice as to the further running of discussion in the group. Moreover,...
In this paper we study a class of subsets of self-affine carpets which are indexed by fibre-coding, but their limiting frequencies have nonlinear relation. We obtain their Hausdorff dimension spectrum and give the necessary and sufficient conditions of these fractal sets to be s-set.
Divide-and-conquer is essential to address state explosion in model checking. Traditionally, an over-approximate context is required when verifying each individual component in a system. This may cause state explosion for the intermediate results as well as inefficiency for abstraction refinement. This paper presents an opposite approach, a coordinated reachability analysis method, that constructs...
We present a system to extract definitions from a term using the Web. Definitions are organized according to a typology and its context. The structural and functional design is described; emphasizing its relevant components: the extractor of definitional context to candidates using the Yahoo!'s BOSS API; the extractor of definitional contexts and a clustering module based on textual energy as a measure...
The role of context for better decision-making has been a topic of significant research effort over the years. Context-aware systems are able to adapt their operations to the current context without explicit user intervention and thus aim at increasing usability and effectiveness by taking environmental context into account. These systems exploit information about the context of use, such as the location,...
The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allows to symbolically representing array updates. In this paper we present combinatory array logic, CAL, using a small, but powerful core of combinators, and reduce it to the theory of uninterpreted functions. CAL allows expressing properties...
In this paper, we address the problem of self-adaptation in internet-scale service-oriented systems. Services need to adapt by selecting the best neighboring services solely based on local, limited information. In such complex systems, the global significance of the various selection parameters dynamically changes. We introduce a novel metric measuring the distribution and potential impact of service...
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.