In this paper, the dynamic allocation of camera resources for moving objects is presented as a model of partial constraint satisfaction problem. The purpose of the camera allocation is described as some simple constraint. The solution is reflexively searched in order to decide the allocation of each camera. The search neighborhood of the solution is limited to the partial solution for each came...

Let A be an array. The partial sum problem concerns the design of a data structure for implementing the following operations. The operation update(j, x) has the effect A[j] ← A[j]+x , and the query operation sum(j) returns the partial sum ∑j i=1 A[i] . Our interest centers upon the optimal efficiency with which sequences of such operations can be performed, and we derive new upper and lower bou...

Reconfigurable systems using FPGAs are of growing interest for the design and implementation of software defined radio transceivers. By reconfiguring a FPGA, its hardware resources can be reused and shared to provide multiple functionalities on a single device. This paper investigates power savings by means of partial reconfiguration for implementing two link adaptation algorithms. These algori...

This paper studies necessary conditions of weak efficiency of a constrained vector minimization problem with equality and inequality constraints in real linear spaces. These results are obtained under generalized convexity conditions through new alternative theorems and given in linear operator rules form. We present a relaxed subconvexlikeness and generalized subconvexlikeness, and likewise, d...

Foreknowledge about the demands of an upcoming trial may be exploited to optimize behavioural responses. In the current study we systematically investigated the benefits of partial foreknowledge--that is, when some but not all aspects of a future trial are known in advance. For this we used an ocular motor paradigm with horizontal prosaccades and antisaccades. Predictable sequences were used to...

A procedure for deriving analytic partial derivatives of the Lambert problem is presented. Using the universal, cosine based Lambert formulation; first order partial derivatives of the velocities with respect to the positions and times are developed. Taking advantage of inherent symmetries and intermediate variables, the derivatives are expressed in a computationally efficient form. The added c...

A new family of numerical schemes for inhomogeneous parabolic partial differential equations is developed utilizing diagonal Padé schemes combined with positivity–preserving Padé schemes as damping devices. We also develop a split version of the algorithm using partial fraction decomposition to address difficulties with accuracy and computational efficiency in solving and to implement the algor...

The aim of the paper is to study efficeient of inference process using clustered partial decision rules. Partial decision rules are constructed by greedy algorithm. They are clustered with Agglomerative Hierarchical Clustering (AHC) algorithm. We study how exact and partial decision rules clustered by AHC algorithm influence on inference process in knowledge base. Clusters of rules are a way of...

This paper describes an algorithm that determines the minimal sets of variables that determine the values of a discrete partial function. The Apriori-like algorithm is based on the dual hereditary property of determining sets. Experimental results are provided that demonstrate the efficiency of the algorithm for functions with up to 24 variables. The dependency of the number of minimal determin...

Partial-inversion compilers generate programs which compute some unknown inputs of given programs from a given output and the rest of inputs whose values are already given. In this paper, we propose a partial-inversion compiler of constructor term rewriting systems. The compiler automatically generates a conditional term rewriting system, and then unravels it to an unconditional system. To impr...