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.
Mobile crowd sourcing (MCS) has grown to be a powerful computation paradigm to harness human power to solve real-world problems. Many commercial MCS platforms have arisen, enabling various novel applications. As crowd workers can be unreliable, a critical issue of these platforms is quality control. Many task assignment approaches have been proposed to increase the quality of crowd sourced tasks by...
In the composite service which runs for a long time under the heterogeneous and loose-coupled circumstance, the failure of service tends to occur. The transaction and recovery mechanism is urgently needed in order to guarantee the end-to-end QoS of the workflow and satisfy the user requirement. In this paper we address the composite service recovery issue in the way of substitution with the consideration...
In this paper we study the multi-robot deployment problem under hard temporal constraints. After proposing a model for this task, we consider the simplest deployment algorithm and we analyze the relationship between three fundamental parameters, the temporal deadline, the probability of success, and the number of robots. Because an exact analysis of even the simplest algorithm is computationally intractable,...
This paper presented an improved (1+ε)-randomized approximation algorithm proposed by Ostrovsky. The running time of the improved algorithm is equation, where d,n denote the dimension and the number of the input points respectively, and α(<1) represents the separated coefficient. The successful probability is equation. Compared to the original algorithm, the improved algorithm runs more efficiency.
Multi-State System (MSS) is mathematical model of investigated object in reliability analysis. MSS allows present the investigated object in more detail than traditional Binary-State System. The importance analysis allows MSS reliability estimation depending on the system structure and its components states. Importance measures quantify the criticality of a particular component. They have been widely...
Large enterprises have been relying on parallel database management systems (PDBMS) to process their ever-increasing data volume and complex queries. Business intelligence tools used by enterprises frequently generate a large number of outer joins and require high performance from the underlying database systems. A common type of outer joins in business applications is the small-large table outer...
Rivest, Shamir and Adleman (RSA) encryption algorithm is one of the most widely used and popular public-key cryptosystem. The main step in this algorithm is modular exponentiation which can be done by a sequence of modular multiplication. Thus, modular multiplication is the major factor, in many cryptosystems, e.g. the RSA Two-Key system and in the proposed digital signature standard DSS. One of the...
The output feedback H∞ control is addressed for a class of continuous-time Markov jump linear systems with the Markov process taking values in an infinite countable set S. We consider that only an output and the jump parameters are available to the controller. Via a certain bounded real lemma, together with some extensions of Schur complements and of the projection lemma, a theorem which characterizes...
The following three problems concerning random graphs can be solved in (log n)O(1) expected time using linearly many processors: (1) finding the lexicographically first maximal independent set, (2) coloring the vertices using a number of colors that is almost surely within twice the chromatic number, and (3) finding a Hamiltonian circuit.
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.