Isaac is a programing language for geometric reasoning intended for controlling mobile robots, currently under development at NMSU. Due to the application area, handling input and output (in particular, sensor input and actuator output) in a manner consistent with the language as a whole is particularly important in this language. In this paper, we discuss the mechanisms employed by Isaac to pr...

[ABSTRACT] The paper presents a data–driven execution model, CHEM, for a temporal logic programing language, Chronolog. An intermediate virtual machine is proposed, which is granulated at clause argument level to exploit argument parallelism through unification. Context–parallelism, inherent in temporal logic programs, is exploited through dynamic tagging approach typically used in dataflow com...

We use the duality of linear programing to obtain exact formulas of competitive ratio for the semi-online preemptive scheduling on three and four machines. We use the linear programs from [5]. Namely we consider the online scheduling and the semi-online scheduling with known sum of processing times. We solve the linear programs symbolically by examining all basic solution candidates. All soluti...

abstract water pricing is a policy instrument for improving water efficiency, reducing water demand, management of the irrigation systems and recovering costs. the underlying principle of water pricing is that it should reflect the opportunity cost of water. in this study, parametric mathematical programming approache were used to estimate the willingness of farmers to pay for groundwater under...

In the current state-of-art beat tracker, it is common that a specific algorithm do the best on particular kind of audio. For example, the algorithm based on two-fold dynamic programing have sequential 1 st place on time-varying-tempo MAZ dataset of MIREX audio beat tracking. This study proposed a tempogram-sensing-vector (TSV) method to be adaptive to time-varying-tempo and stable-tempo excerp...

The target approach to reactor synthesis tries to determine an upper bound for the performance of a chemical reactor network as measured by its objective function (such as yield or reactor volume). This leads to an optimal control formulation in which the residence time distribution and the micromixing function are the control variables. The optimal control problem is solved using a gradient ba...

In this paper an exact penalty line search is introduced for solving constrained nonlinear programing. By this method it is possible to solve some problems with combining penalty method and SQP method, and in any iteration for producing new stepone can uses linear search and solves unconstrained optimization by exact penalty function. In this method a linear programming subproblem with trust ar...

Our work is in the area of automated verification of software properties in modern programing languages. We present three papers related to various aspects of our research field: a modular pointer and effect analysis for object oriented programs, a precise and efficient typestate analysis, and a precise, parametric array content analysis. We discuss their contributions as well as their shortcom...

Let K be a totally real number field with Galois closure L. We prove that if f ∈ Q[x1, . . . , xn] is a sum of m squares in K[x1, . . . , xn], then f is a sum of 4m · 2[L:Q]+1 ([L : Q] + 1 2 ) squares in Q[x1, . . . , xn]. Moreover, our argument is constructive and generalizes to the case of commutative K-algebras. This result gives a partial resolution to a question of Sturmfels on the algebra...