The paper investigates the closed-loop stability issue of finite-precision realizations for digital controllers implemented in floating-point arithmetic. Unlike the existing methods which only address the effect of th...
详细信息
The paper investigates the closed-loop stability issue of finite-precision realizations for digital controllers implemented in floating-point arithmetic. Unlike the existing methods which only address the effect of the mantissa bits in floating-point format to the sensitivity of closed-loop stability, the sensitivity of closed-loop stability is analyzed with respect to both the mantissa and exponent bits of floating-point format. A comp.tationally tractable finite word length (FWL) closed-loop stability measure is defined, and the optimal controller realization problem is posed as searching for a floating-point realization that maximizes the proposed measure. A numerical optimization approach is adopted to solve for the resulting optimization problem. Simulation results show that the proposed design procedure yields comp.tationally efficient controller realizations with enhanced FWL closed-loop stability performance.
Disconnected operation is a challenging issue in mobile comp.ting. Data hoarding is the process of prefetching important data into local cache for future operation. The result of hoarding process will dramatically aff...
详细信息
Disconnected operation is a challenging issue in mobile comp.ting. Data hoarding is the process of prefetching important data into local cache for future operation. The result of hoarding process will dramatically affect the performance of disconnected operation. A low-cost general hoarding algorithm is introduced to exploit relationship among the data items simultaneously when processing data requests and to select data for hoarding automatically. Simulation results show that this algorithm effectively improves cache hit rate in disconnected operation. And it is especially applicable for handheld mobile devices with low storage capacity and slow comp.ting speed.
By lack of suitable abstractions of the resource model, it is difficult to apply well-established software development methods to Web applications. An object view model WebView is outlined and the model is implemented...
详细信息
By lack of suitable abstractions of the resource model, it is difficult to apply well-established software development methods to Web applications. An object view model WebView is outlined and the model is implemented in this paper as a Web application framework. WebView uses object view as a uniform concept to model Web entities. By using the model in designing, it can enhance reusability and productivity in the Web application development. Based on the available Web technologies, the Web application framework can map object views into the HTML format.
By the currently developed comp.nent models and standards, the comp.nent interfaces convey only limited semantics and the interaction protocol among comp.nents is hidden within the implementations, which may result in...
详细信息
By the currently developed comp.nent models and standards, the comp.nent interfaces convey only limited semantics and the interaction protocol among comp.nents is hidden within the implementations, which may result in the problem of architectural mismatches, also make these comp.nents in difficulty to reuse, validate and manage. An XML-message based architecture description language (XADL) is outlined, which supports the description of explicit interaction protocols and the comp.sing relations of comp.nents. Based on the XADL, the notion of architectural mismatch is introduced and shows how it can be checked. The XADL enhances the descriptive capacity of interfaces, prevents systems from potential architectural mismatches, and facilities the implementation of system monitor, performance analysis and dynamic tuning.
Performance analysis of comp.ter Network plays an important role in network construction and maintenance. Based on comp.ter networks performance analyzed modeling of Petri nets, this paper introduces the method of con...
详细信息
Performance analysis of comp.ter Network plays an important role in network construction and maintenance. Based on comp.ter networks performance analyzed modeling of Petri nets, this paper introduces the method of constructing Petri nets model in detail, and gives the constructor and actual examples of comp.ter network. The results of performance analysis demonstrate that the method is effective.
Feedforward inverse finite automata satisfy the condition of weakly error propagation limited in decoding, and it can be widely used in digital communication. The result of the structure of feedforward inverse finite ...
详细信息
Feedforward inverse finite automata satisfy the condition of weakly error propagation limited in decoding, and it can be widely used in digital communication. The result of the structure of feedforward inverse finite automata with delay 1 is revised, and a form of structure of feedforward inverse finite automata with delay t is given in the situation that it is a c-order semi-input-memory finite automata where autonomous finite automaton is cyclic and the number if input alphabet set is equal to the number of output alphabet set.
The agent organization is a kind of mechanism of problem solving, which can decrease the comp.exity of interactions between agents and reduce the difficulty of problem solving. A recursive model of agent organization ...
详细信息
The agent organization is a kind of mechanism of problem solving, which can decrease the comp.exity of interactions between agents and reduce the difficulty of problem solving. A recursive model of agent organization is proposed based on role utility and organizational rules. The goal resolving, utility calculation and rule formation of agent organization are also discussed. comp.red with the work of Ferber and Jennings, the recursive model is suitable to describe agent organizations with different scale, is useful for the combination of micro- and macro- analysis of agent organization and is able to express the agent organization evolution in some degree because of the introduction of role utility parameters.
In B/S architecture, a large amount of work such as disposing documents and reports on the server are carried out without any control, resources of the server will be exhausted quickly. For such a reason, this paper p...
详细信息
In B/S architecture, a large amount of work such as disposing documents and reports on the server are carried out without any control, resources of the server will be exhausted quickly. For such a reason, this paper proposes a technology based on the queuing model to dispose the documents and reports on the Web. It transplants some of the disposing documents and reports work to the client, through mutual cooperation of the server and the client, and this disposing data and storing data in the database system efficiently. And it also uses queuing model on the server to administrate the task of disposing documents and reports. Through application development and analysis of probability theory and queuing systems theory, the results show that the presented technology can finish to dispose documents and reports with high-efficiency, and improve stability and security of the server to a certain extent.
Building whole concept lattice from database is a comp.ting intensive operation in most cases. Sometimes people need only to find certain node in concept lattices. A novel approach to comp.te lattice node from databas...
详细信息
Building whole concept lattice from database is a comp.ting intensive operation in most cases. Sometimes people need only to find certain node in concept lattices. A novel approach to comp.te lattice node from database without generating the whole concept lattice is presented. Given a set of objects or attributes, by exploiting unique properties of concept lattice, it is are able to find the matching node, its parent nodes and children nodes in concept lattice directly. This avoids comp.ting and memory burden brought by lattice generation, and it is useful in concept lattice application in large data sets.
This paper presents a local search method based on a filled function transformation method. Given a current best local minimal solution of the TSP, the filled function transformation method converts the TSP into a com...
详细信息
This paper presents a local search method based on a filled function transformation method. Given a current best local minimal solution of the TSP, the filled function transformation method converts the TSP into a combinatorial optimization problem with the same solution space, but with less number of local minimal solutions. The combinatorial optimization problem has only one prescribed local minimal solution in the solution space where the length of any tour of the TSP is larger than that of the current best local minimal solution of the TSP. Moreover, a local minimal solution of the combinatorial optimization problem is either the prescribed local minimal solution, or else, is a strictly better local minimal solution of the TSP than the current best solution. Then the well-known 3-opt algorithm is used to solve the combinatorial optimization problem to find a better local minimal solution of the TSP. If a better local minimal solution of the TSP is found, then a new combinatorial optimization problem is constructed using the filled function transformation method, and the 3-opt algorithm is applied to solve it again. This method is tested by some standard test inst.nces, and the method presented in this paper is more efficient and more effective than the 3-opt algorithm for the TSP. It is easy to use, and can be directly generalized to solve other NP-hard combinatorial optimization problems.
暂无评论