Reasoning about memory aliasing and mutation in software verification is a hard problem. This especially true for systems using SMT-based automated theorem provers. Memory reasoning SMT typically requires nontrivial amount of manual effort to specify heap invariants, as well extensive alias from the solver. In this paper, we present hybrid approach that combines linear types with reasoning. We ...

This paper investigates the dissipativity analysis of large-scale networked systems with linear time-invariant dynamics. The system is composed a large number subsystems whose connections are arbitrary, and each subsystem can have different A sufficient necessary condition for strict derived, which takes advantage block-diagonal structure parameter matrix sparseness characteristics interconnect...

0

the growth in demand for electric power and the rapid increase in fuel costs, in whole of theworld need to discover new energy resources for electricity production. among of the nonconventionalresources, wind and solar energy, is known as the most promising deviceselectricity production in the future. in this thesis, we study follows to long-term generationscheduling of power systems in the pre...

in this paper, we describe our implementation of an interior point algorithm for large scale systems. first we identify system with small and medium methods convex optimization, then we use interior point method for identification. finally we offer an interior point method that uses nonlinear cost function and see that we achieve a good trade-off between error and cpu time. actually, in this pa...

Unit commitment (UC) problem tries to schedule output power of generation units to meet the system demand for the next several hours at minimum cost. UC adds a time dimension to the economic dispatch problem with the additional choice of turning generators to be on or off.  In this paper, in order to improve both the exploitation and exploration abilities of the firefly algorithm (FA), a new mo...