Dynamic voltage scaling (DVS) algorithms save energy by scaling down the processor frequency when the processor is not fully loaded. Many algorithms have been proposed for periodic and aperiodic task models but none support the canonical sporadic task model. A DVS algorithm, called DVSST, is presented that can be used with sporadic tasks in conjunction with preemptive EDF scheduling. The algori...

Building upon the known generalized-quantifier-based first-order characterization of LOGCFL, we lay the groundwork for a deeper investigation. Specifically, we examine subclasses of LOGCFL arising from varying the arity and nesting of groupoidal quantifiers. Our work extends the elaborate theory relating monoidal quantifiers to NC and its subclasses. In the absence of the BIT predicate, we reso...

Background & aim: Considering the important role of exclusive breastfeeding in the first six months of birth and its relation with sociocultural beliefs, this study was conducted to explore the factors affecting exclusive breastfeeding in the first six months of birth in women residing in Neyshabour, Iran. Methods:</stro...

The general view of descriptive research as a lower level form of inquiry has influenced some researchers conducting qualitative research to claim methods they are really not using and not to claim the method they are using: namely, qualitative description. Qualitative descriptive studies have as their goal a comprehensive summary of events in the everyday terms of those events. Researchers con...

As summarized in Table A1, this appendix provides a detailed description of the research method used to test the proposed hypotheses. The first major step was to collect observational and trace data from online communities. The observational data supported creation of a descriptive model of online community formation. The trace data encompasses the first 12 to 15 months of communication in 28 o...

We describe our development and use of DescriptiveEnvironment (DE). This is a program to aid researchers in Finite Model Theory and students of logic to automatically generate examples, counterexamples of conjectures, reductions between problems, and visualizations of structures and queries. DescriptiveEnvironment is available for free use under an ISC license at http://www.cs.umass.edu/∼immerm...

Our starting point is the observation that if graphs in a class C have low descriptive complexity, then the isomorphism problem for C is solvable by a fast parallel algorithm. More precisely, we prove that if every graph in C is definable in a finite-variable first order logic with counting quantifiers within logarithmic quantifier depth, then Graph Isomorphism for C is in TC1 ⊆ NC2. If no coun...

Data languages are an extension of timed languages, as defined by R. Alur and D. L. Dill, proposed by P. Bouyer, A. Petit and D. Thérien to provide a suitable theoretical framework, comparable to the formal languages theory. A class of data languages, naturally called recognizable data languages, can be defined in an equivalent way by automata, finite monoids and logic formulas. The aim of this...

In this paper, we consider the canonical sporadic task model with the system-wide energy management problem. Our solution uses a generalized power model, in which the static power and the dynamic power are considered. We present a static solution to schedule the sporadic task set, assuming worstcase execution time for each sporadic tasks release, and propose a dynamic solution to reclaim the sl...

The concept of hairpin structures in formal languages is motivated from the biocomputing and bioinformatics fields. Hairpin (-free) DNA structures have numerous applications to DNA computing and molecular genetics in general. A word is called hairpin-free if it cannot be written in the form , with certain additional conditions, for an involution (a function with the property that equals the ide...