1,188,889 Hits in 7.5 sec

System T, call-by-value and the minimum problem

Loïc Colson, Daniel Fredholm
1998 Theoretical Computer Science  
It is shown that for Giidels system T, evaluated call-by-value, if an algorithm computes a non-trivial binary function (where trivial means constant or projection plus constant), then the time-complexity  ...  This is in contrast to the call-by-name case. As a corollary, it follows that there is no algorithm in this setting which computes the minimumfunction in time-complexity O(min).  ...  System T in call-by-value The types of system T are given by the following inductive definition: l N is a type (the type of natural numbers). l If T and U are types, then T -+ U is a type.  ... 
doi:10.1016/s0304-3975(98)00011-5 fatcat:igtoqvgfj5b73hmlng4i4bibfq

On finite-time control of inner systems

1999 Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251)  
It is well known that non-minimum phase zeros of dynamical systems restrict the achievable performance of closed-loop transfer functions.  ...  In this paper it is shown that the Hankel singular values of the inner factor of the system transfer function provide relevant information for achievable (finite time) performance of the controlled process  ...  A second and frequently applied approach is what is called standardization of the problem.  ... 
doi:10.1109/acc.1999.786149 fatcat:jsygxivptjbupm53llwjy2r56y

The general σ all-ones problem for trees

Xueliang Li, Chao Wang, Xiaoyan Zhang
2008 Discrete Applied Mathematics  
X is called a solution to the problem. When C = ∅, this problem is the so-called all-ones problem.  ...  The first one is good for counting the number of solutions if solutions do exist, and the second one is good for solving the minimum all-ones problem.  ...  Acknowledgment The authors are very grateful to the referees for their helpful comments and suggestions, which helped to improve the presentation of the paper.  ... 
doi:10.1016/j.dam.2007.08.042 fatcat:xnb36ymrwfcydmalygg43axipe

Minimum Energy Control Of Positive Time-Varying Linear Systems

Tadeusz Kaczorek
2015 Acta Mechanica et Automatica  
The minimum energy control problem for the positive time-varying linear systems is formulated and solved. Sufficient conditions for the existence of solution to the problem are established.  ...  A procedure for solving of the problem is proposed and illustrated by a numerical example.  ...  The controllability and minimum energy control problem of fractional discrete-time linear systems has been investigated by Klamka (2010) .  ... 
doi:10.1515/ama-2015-0036 fatcat:hbi42fmp6zcbvdejjsdjuosvqi

Page 457 of Annals of Economic and Social Measurement Vol. 1, Issue 4 [page]

1972 Annals of Economic and Social Measurement  
The statement of the problem and of the discrete version of the minimum principle are as follows: Problem Given a system described by the vector difference equation* (3.4) x(t + 1) — x(t) = fi(x(t), u(  ...  The appropriate theoretical tool is the so-called discrete minimum principle, which is the extension of Pontryagin’s maximum principle for continuous time systems (see reference 5), to discrete-time systems  ... 

Page 805 of Automation and Remote Control Vol. 24, Issue 7 [page]

1963 Automation and Remote Control  
If EVCF up = up(t, Zp) secures the minimum value of the J(u) integral (6), i.e., if it is a MVCF, then, for every t and z(t) (tj St = t,), its coordinates satisfy the functional inequal- ities , z, = —  ...  function u = u(t, z) identically satisfy, with respect to t and z(t), the following system of functional equations in A-parametric form: H = Af?  ... 

An Algorithm for the Calculation of the Dwell Time Constraint for Switched ℋ∞ Filters

Zsolt Horváth, András Edelmayer
2018 Acta Universitatis Sapientiae Electrical and Mechanical Engineering  
The problem formulation is based on multiple Lyapunov functions and is expressed through a special form of linear matrix inequalities (LMIs), which include a nonlinear term of the dwell time.  ...  This paper presents a numerical algorithm for determining the minimum dwell time constraint for switched linear ℋ∞ fault detection filters.  ...  Solve the LMIs in (11) as a feasibility problem by the MATLAB function feasp [22] , which returns both the scalar value of as a measure of the feasibility and the feasibility decision vector xfeas; 4.  ... 
doi:10.2478/auseme-2018-0001 fatcat:cj347alffze7tj2vxjurnkc4y4

Automatic Firewall Rule Generator for Network Intrusion Detection System based on Multiple Minimum Support

S. Nithya, C. Jayakumar
2016 Indian Journal of Science and Technology  
Methods: Mining association rules based on single minimum support approach suffers from the dilemma known as 'rare item problem' it requires multiple scans of database which increase the load and time  ...  Findings: To create a model of current user behavior from the dataset the probability will be compute with threshold value and the alarm will be raised accordingly.  ...  By using the Figure 3 MMSP algorithm the number of false alarms is reduced by generating real time rules for firewall and the minimum support values reduces the 'rule missing' and 'rule explosion' problems  ... 
doi:10.17485/ijst/2016/v9i41/86987 fatcat:5mbxdsxdjfcanbs7ddnhtpv2a4

Pomiary emisji zaburzeń elektromagnetycznych od kolejowych pojazdów szynowych pracujących w trakcji wielokrotnej

2019 Przeglad Elektrotechniczny  
The problem formulation is based on multiple Lyapunov functions and is expressed through a special form of linear matrix inequities (LMIs), which include a nonlinear term with the dwell time.  ...  This paper presents an algorithm for determining the minimum dwell time constraint for switched linear fault detection filters.  ...  Conflicts of Interest The authors declare that there are no conflicts of interest regarding the publication of this paper. Authors  ... 
doi:10.15199/48.2019.03.03 fatcat:csr6kou2qnas5elj5y7amatclq

On the Application of Particle Swarm Optimization in Minimum Time Launch Vehicle Trajectory Optimization Problem

Aditya Chowdhury , Vishnu G Nair Aditya Chowdhury , Vishnu G Nair
2017 International Journal of Mechanical and Production Engineering Research and Development  
The PSO algorithm proposed by Kennedy and Eberhart, in 1995 proved to be one of the best candidates, for solving stochastic problems.  ...  The launch vehicle trajectory is generally optimized, to meet the target by minimum fuel, minimum control or minimum time.  ...  ACKNOWLEDGMENT The authors would like to acknowledge the support obtained from Manipal Institute of Technology, Manipal University for the successful completion of this research work.  ... 
doi:10.24247/ijmperdoct201736 fatcat:e6dnbwxggzcptbyqfeb64poz5e


Nicoleta-Maria MIHUT
2012 Fiabilitate şi Durabilitate  
Most of the systems of electric action are non-linear systems, including the continuous transportsystems with band, that could be brought by linearization and negligence at the linear system.  ...  For the linearisableaction systems described by state equations, there are two consecrated calculation methods of the optimaltrajectory of the system, the variational calculation and the Euler-Lagrange  ...  Any element u(t), oh set U providing the system evolution in the initial conditions in the final conditions by respecting the properties of controllability, tangibility and observability is called an admitted  ... 
doaj:2d07f467f92741298443fd470e327974 fatcat:45vkkjqa3zb53dwaos7fxsejeu

Particle Swarms in Statistical Physics [chapter]

Andrei Bautu, Elena Bautu
2009 Particle Swarm Optimization  
The systems are usually characterized by a very large number of variables and the limited possibilities for observing the properties of the components of the system.  ...  This is known as the Thomson problem and it is included in Stephen Smale's famous list of 18 unsolved mathematical problems to be solved in the 21 st century.  ...  Any configuration with minimum potential energy is called a "ground state" of the system.  ... 
doi:10.5772/6741 fatcat:ixllvujaxvdbpjpeawf6tz6rgi

Continuity of the Value Function in Sparse Optimal Control [article]

Takuya Ikeda, Masaaki Nagahara
2014 arXiv   pre-print
From these properties, we prove the continuity of the value function of the sparse optimal control problem by verifying that of the L1-optimal control problem.  ...  We prove the continuity of the value function of the sparse optimal control problem. The sparse optimal control is a control whose support is minimum among all admissible controls.  ...  For the system (S), we call a control admissible if it steers a given initiate state ξ ∈ R n to the origin at fixed final time T > 0 and is constrained in magnitude by u ∞ ≤ 1.  ... 
arXiv:1412.5707v1 fatcat:2p2wgg23gjbz7igcdayolmqjjm

Linear Quadratic Regulator Procedure and Symmetric Root Locus Relationship Analysis

Mariela Alexandrova, Nasko Atanasov, Ivan Grigorov, Ivelina Zlateva
2017 International Journal of Engineering Research and Science  
It is proven and analytical evidences is also presented that by using SRL synthesis method and further application of LQR method guarantees stability, minimum phase and gain margins of the closed loop  ...  system.  ...  and Synthesis of Algorithms and Systems for Adaptive Observation, Filtration and Control", ДН997-НП/09.05.2017.  ... 
doi:10.25125/engineering-journal-ijoer-nov-2017-7 fatcat:hxhsaqdb6favvk33i5eterpqgy

Optimal prioritized channel allocation in cellular mobile systems

Kun-Nyeong Chang, Dongwoo Kim
2001 Computers & Operations Research  
In cellular mobile systems, a new channel should be assigned by the new base when a call enters an adjacent cell.  ...  Scope and purpose Channel allocation is one of the most important problems in the design of cellular mobile systems.  ...  For each case of tra$c loads, we assume that R and R#5 channels are, respectively, available in the system, where R is the minimum number of channels required to satisfy GOS for new calls when only minimum  ... 
doi:10.1016/s0305-0548(99)00121-5 fatcat:7slxyy5wvvdkbiryhfgljz5fji
« Previous Showing results 1 — 15 out of 1,188,889 results