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

Zero-Reachability in Probabilistic Multi-Counter Automata

We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter systems. We identify the undecidable variants of the problems, and then we concentrate on the remaining two cases. In the first case, when we are interested in the probability of all runs that visit zero in some counter, we show that the qualitative zero-reachability is decidable in time which is polynomial in the size of a given pMC and doubly exponential in the number of counters. Further, we show that the probability of all zero-reaching runs can be effectively approximated up to an arbitrarily small given error epsilon > 0 in time which is polynomial in log(epsilon), exponential in the size of a given pMC, and doubly exponential in the number of counters. In the second case, we are interested in the probability of all runs that visit zero in some counter different from the last counter. Here we show that the qualitative zero-reachability is decidable and SquareRootSum-hard, and the probability of all zero-reaching runs can be effectively approximated up to an arbitrarily small given error epsilon > 0 (these result applies to pMC satisfying a suitable technical condition that can be verified in polynomial time). The proof techniques invented in the second case allow to construct counterexamples for some classical results about ergodicity in stochastic Petri nets.Comment: 20 page

Analytical Investigation of Higher Education Quality Improvement by Using Six Sigma Approach

For over two decades in India, the technical industry's unique selling proposition (USP), with its wide infrastructure of technical institutes, has been capable of supplying best-in-class engineers. But recently, this claim does not hold water. According to the All India Council for Technical Education (AICTE), about 2.6 lakh mechanical engineers graduate every year in India. But the real count of industry ready mechanical engineers is approximately 7%. Hence, there is a need to assess the quality of engineering education in India to reduce the flaws in higher education. The purpose of the paper is to identify the various defects associated with technical education and eliminate those defects using various quality tools. This research is based on the six sigma technique, which is used to assess the quality criteria proposed by the National Board of Accreditation India (NBA). The proposed model is then applied to a typical tier II Indian engineering college located in south India. Six Sigma has two main methodologies: DMAIC and DFSS. The DMAIC (Define, Measure, Analyze, Improve, and Control) methodology is implemented for existing systems, whereas DFSS (Design for Six Sigma) is for assuring quality in new products. In this project, the conclusion is driven by the DMAIC methodology. Various statistical and non-statistical tools are employed in this research. The tools used are CTS-CTQ, SIPOC, Pareto chart, normal process capability analysis, one-way ANOVA, Ishikawa diagram, FMEA, RCBD, and SPC chart. All the statistical processes are done using Minitab analytical software. From the results, it is identified that the factors that have a risk priority number (RPN) greater than 300 need improvement, such as versatility in program curriculum, laboratories and workshops, and credibility among universities. Six Sigma can be achieved by developing proper strategies for mitigating these defects. Doi: 10.28991/HIJ-2022-03-02-07 Full Text: PD

On The Experience Of The Arab Open University With The Standard Deviation Method

The Arab Open University (AOU) has adopted the standard deviation method (SDM) as a grading system in replacement of a fixed scale. Adopting SDM was intended to remedy a problem that has resulted from discrepancies between AOU's graduation requirements and those of its partner, UK Open University. This paper aims mainly at investigating whether SDM has served the purpose for which it was selected. A data set of the final letter grades of students enrolled in 18 licensed courses from UK-OU at Kuwait branch was used. These letter grades were analyzed in comparison with the letter grades that would have been assigned to students had the fixed grading scale been utilized. The results of the comparative analysis revealed that SDM resulted in benefiting 39.4% of all students and lowering the letter grades of 10.4% of the students. Despite its positive results, SDM has not contributed significantly to remedying the problem in question. Thus, a case for withholding the D grade while continuing with using SDM was presented

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

Hybrid Method for Digits Recognition using Fixed-Frame Scores and Derived Pitch

This paper presents a procedure of frame normalization based on the traditional dynamic time warping (DTW) using the LPC coefficients. The redefined method is called as the DTW frame-fixing method (DTW-FF), it works by normalizing the word frames of the input against the reference frames. The enthusiasm to this study is due to neural network limitation that entails a fix number of input nodes for when processing multiple inputs in parallel. Due to this problem, this research is initiated to reduce the amount of computation and complexity in a neural network by reducing the number of inputs into the network. In this study, dynamic warping process is used, in which local distance scores of the warping path are fixed and collected so that their scores are of equal number of frames. Also studied in this paper is the consideration of pitch as a contributing feature to the speech recognition. Results showed a good performance and improvement when using pitch along with DTW-FF feature. The convergence rate between using the steepest gradient descent is also compared to another method namely conjugate gradient method. Convergence rate is also improved when conjugate gradient method is introduced in the back-propagation algorithm

Interprocedural Reachability for Flat Integer Programs

We study programs with integer data, procedure calls and arbitrary call graphs. We show that, whenever the guards and updates are given by octagonal relations, the reachability problem along control flow paths within some language w1* ... wd* over program statements is decidable in Nexptime. To achieve this upper bound, we combine a program transformation into the same class of programs but without procedures, with an Np-completeness result for the reachability problem of procedure-less programs. Besides the program, the expression w1* ... wd* is also mapped onto an expression of a similar form but this time over the transformed program statements. Several arguments involving context-free grammars and their generative process enable us to give tight bounds on the size of the resulting expression. The currently existing gap between Np-hard and Nexptime can be closed to Np-complete when a certain parameter of the analysis is assumed to be constant.Comment: 38 pages, 1 figur

Dispersible formulation of artemether/lumefantrine: specifically developed for infants and young children

Infants and children under five years of age are the most vulnerable to malaria with over 1,700 deaths per day from malaria in this group. However, until recently, there were no WHO-endorsed paediatric anti-malarial formulations available

Assessing Site Selection of College Student Housing : Commuting Efficiency across Time

Universities around the world are promoting walking for their students because it provides many health and environmental benefits at the personal as well as the community level. This paper aims to help universities, city planners and housing investors in the process of efficient site selection for future student housing projects, by analyzing off-campus students’ commuting habits and travel time preferences to and from the university campuses. An online survey is operated to collect responses of students (n= 527) from two Jordanian universities located within the city of Irbid (N-Jordan). Results indicate that the mean value for students’ longest preferred one-way walking duration is 17.04± 8.25 minutes for the whole sample. A statistically significant negative correlation is found between students’ longest preferred one-way walking duration and age. The percentage of students who would accept this duration was represented in a formula in order to calculate the accumulated walking potential of varied sites around university campuses. The paper presented a local scenario using GIS mapping where this process was implemented to evaluate prospect vacant sites' walking potential around Yarmouk University, Irbid, Jordan