Non-deterministic Evaluation Research Articles

Nondeterministic Evaluation Mechanism for User Recruitment in Mobile Crowd-Sensing

Based on the Internet of Behavior (IoB), mobile crowd-sensing (MCS) utilizes the Internet of Things (IoT) to recruit users by analyzing behavioral patterns. MCS is widely used in numerous large-scale and complex monitoring services, but it cannot provide stable and high-quality services due to nondeterministic user mobility and behaviors, which has a vital impact on recruiting high-quality users. In this article, a stochastic semi-algebraic hybrid system (SSAHS) model is constructed to characterize the user mobility and behaviors of the MCS systems. Based on the definition of probabilistic path and task execution rate, a nondeterministic evaluation mechanism is proposed to measure nondeterministic user mobility and behaviors and to give the probability of the user completing the MCS task under the specified time bound and space conditions. The greater the probability is, the higher the quality of the user. Furthermore, a user recruitment scheme based on a nondeterministic evaluation mechanism (NUR) is developed. The NUR employs historical user data to predict user mobility and behaviors; high-quality users are recruited to quickly upload reliable sensing data. We conduct simulation experiments based on a real-world user trace dataset, Geolife.The results show that compared with competing recruitment strategies, NUR achieves a higher quality of service for the same MCS sensing tasks.

A non-deterministic evaluation on SLA in Cloud markets

A non-deterministic evaluation on SLA in Cloud markets

Sublist assertions for listless and lazy evaluation

This paper introduces a new logical form, called the sublist assertion, and shows its many uses for list processing, especially listless and lazy evaluation, features that are traditionally absent in programming languages such as Prolog. The basic technique involves the use of one or more sublist assertions for specifying the elements of a list-valued function, and also a new form of list-matching and unification for iterating over the elements of a list. A sublist assertion can take one of two forms: f (terms) ⊒ expression f (terms) ⊒ list :- condition When multiple sublist assertions define some given function f, the corresponding lists defined by their bodies are appended together; hence the order of sublist assertions is significant. Three types of goals are provided, each with a different operational effect: (i) f( terms) = answer defines answer to be list of all elements, and corresponds to eager evaluation; (ii) f( terms) ⊒ [answer] defines answer to be an element of the resulting list, and corresponds to listless evaluation, where intermediate lists are avoided; (iii) f( terms) ⊒ answer defines answer to be the list of all elements, but the elements are generated by lazy evaluation. The paper also discusses a novel list pattern, [ x t ], meaning that x is an element of the matching list and t is the remainder. It is shown that this facilitates clear, concise, and efficient list operations. The integration of the sublist assertion with relational assertions is also discussed, as it provides a way to define a listof operation (analogous to bagof) and also offers the benefits of lazy, nondeterministic evaluation.

Nondeterministic three-valued logic: Isotonic and guarded truth-functions

Nondeterministic programs occurring in recently developed programming languages define nondeterminate partial functions. Formulas (Boolean expressions) of such nondeterministic languages are interpreted by a nonempty subset of {T (“true”), F (“false”), U (“undefined)}. As a semantic basis for the propositional part of a corresponding nondeterministic three-valued logic we study the notion of a truth-function over {T, F, U} which is computable by a nondeterministic evaluation procedure. The main result is that these truth-functions are precisely the functions satisfying four basic properties, called\( \subseteq \)-isotonic,\( \subseteq \)−-isotonic, hereditarily guarded, and hereditarily guard-using, and that a function satisfies these properties iff it is explicitly definable (in a certain normal form) from “if..then..else..fi”, binary choice, and constants.