Forward Analysis and Model Checking for Trace Bounded WSTS

We investigate a subclass of well-structured transition systems (WSTS), the bounded---in the sense of Ginsburg and Spanier (Trans. AMS 1964)---complete deterministic ones, which we claim provide an adequate basis for the study of forward analyses as developed by Finkel and Goubault-Larrecq (Logic. Meth. Comput. Sci. 2012). Indeed, we prove that, unlike other conditions considered previously for the termination of forward analysis, boundedness is decidable. Boundedness turns out to be a valuable restriction for WSTS verification, as we show that it further allows to decide all $\omega$-regular properties on the set of infinite traces of the system

An Intelligent Tutoring System for Cloud Computing

Intelligent tutoring system (ITS) is a computer system which aims to provide immediate and customized or reactions to learners, usually without the intervention of human teacher's instructions. Secretariats professional to have the common goal of learning a meaningful and effective manner through the use of a variety of computing technologies enabled. There are many examples of professional Secretariats used in both formal education and in professional settings that have proven their capabilities. There is a close relationship between private lessons intelligent, cognitive learning and design theories; and there are ongoing to improve the effectiveness of ITS research. And it aims to find a solution to the problem of over-reliance on students' teachers for quality education. The program aims to provide access to high-quality education to every student, and therefore the reform of the education system as a whole. In this paper, we will use Intelligent Tutoring System Builder (ITSB) to build an education system on cloud computing in terms of the concept of cloud computing and components and how to take advantage of cloud computing in the field

The Parametric Ordinal-Recursive Complexity of Post Embedding Problems

Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds. We refine the construction of Chambart and Schnoebelen (LICS 2008) and prove parametric lower bounds depending on the size of the alphabet.Comment: 16 + vii page

On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems

We prove a general finite convergence theorem for "upward-guarded" fixpoint expressions over a well-quasi-ordered set. This has immediate applications in regular model checking of well-structured systems, where a main issue is the eventual convergence of fixpoint computations. In particular, we are able to directly obtain several new decidability results on lossy channel systems.Comment: 16 page

Reachability of Communicating Timed Processes

We study the reachability problem for communicating timed processes, both in discrete and dense time. Our model comprises automata with local timing constraints communicating over unbounded FIFO channels. Each automaton can only access its set of local clocks; all clocks evolve at the same rate. Our main contribution is a complete characterization of decidable and undecidable communication topologies, for both discrete and dense time. We also obtain complexity results, by showing that communicating timed processes are at least as hard as Petri nets; in the discrete time, we also show equivalence with Petri nets. Our results follow from mutual topology-preserving reductions between timed automata and (untimed) counter automata.Comment: Extended versio

Modeling and control of a novel FES driven assisted cycling mechanism

Functional Electrical Stimulation (FES) driven cycling using single muscle group, the quadriceps, is achieved using PID controller with a novel assisting mechanism represented by a flywheel with an electrical clutch. This mechanism is useful for disabled individuals whose muscles are weak and unable to push a fix-geared flywheel. The flywheel is engaged and disengaged by the clutch when necessary to assist or retard the cycling without imposing additional load on the person's leg muscle. A comparison between this new mechanism and a previously proposed method show positive results of the new mechanism towards reducing the number of muscle stimulation which leads to delay muscle fatigue and consequently promoting prolonged FES driven cycling for paralyzed people

Planning a Family:priorities and concerns in rural Tanzanmia

A fertility survey using qualitative and quantitative techniques described a high fertility setting (TFR 5.8) in southern Tanzania where family planning use was 16%. Current use was influenced by rising parity, educational level, age of last born child, breastfeeding status, a\ud preference for longer than the mean birth interval (32 months), not being related to the household head, and living in a house with a tin roof. Three principal concerns amongst women were outlined from the findings. First, that there is a large unmet need for family planning services in the area particularly among teenagers for whom it is associated with induced abortion. Second, that family planning is being used predominantly for spacing but fears\ud associated with it often curtail effective use. Third, that service provision is perceived to be lacking in two main areas — regularity of supply, and addressing rumours and fears associated with family planning. Reproductive health interventions in the area should ultimately be more\ud widespread and, in particular, abortion is highlighted as an urgent issue for further research.\ud The potential for a fast and positive impact is high, given the simplicity of the perceived needs of\ud women from this study. (Afr J Reprod Health 2004; 8[2]:111-123)\u