Nowadays, the increasing demands of smart cities require innovative technologies to optimize resource utilization and minimize costs. This research focuses on the construction sector, specifically the production of ad...
详细信息
Nowadays, the increasing demands of smart cities require innovative technologies to optimize resource utilization and minimize costs. This research focuses on the construction sector, specifically the production of advanced high-strength steel. We address practical application problems from the iron and steel factory in Annaba, Algeria, known as fuzzy multi-objective linear programming problems. Two methods are applied: a mathematical model and Artificial Neural Networks (ANNs). Results indicate that the ANN approach offers significant time and effort savings. (c) 2024 Author(s). All article content, except where otherwise noted, is licensed under a Creative Commons Attribution (CC BY) license
This article introduces several improvements to the multipartite method, a generic technique for the hardware implementation of numerical functions. A multipartite architecture replaces a table of value with several t...
详细信息
ISBN:
(数字)9781665453363
ISBN:
(纸本)9781665453363
This article introduces several improvements to the multipartite method, a generic technique for the hardware implementation of numerical functions. A multipartite architecture replaces a table of value with several tables and an adder tree. Here, the optimization of multipartite tables is formalized using Integer linear programming so that generic ILP solvers can be used. This improves the quality of faithfully rounded architectures compared to the state of the art. The proposed approach also enables correctly rounded multipartite architectures, providing errorless table compression. This improves the area by a factor 5 without any performance penalty compared with the state of the art in errorless compression. Another improvement of the proposed work is a cost function that attempts to predict the total cost of an architecture in FPGA architectural LUTs, where most of the previous works only count the size of the tables, thus ignoring the cost of the adder tree.
linear programming on the Stiefel manifold (LPS) is studied for the first time. It aims at minimizing a linear objective function over the set of all p-tuples of orthonormal vectors in Rn satisfying k additional linea...
详细信息
Nowadays, the Voice Over IP (VoIP) technology is an important component of the communications industry as well as a low-cost alternative to Public Switched Telephone Networks. Communication in VoIP networks consists o...
详细信息
Nowadays, the Voice Over IP (VoIP) technology is an important component of the communications industry as well as a low-cost alternative to Public Switched Telephone Networks. Communication in VoIP networks consists of two main phases, for example, signaling and media exchange. VoIP servers are responsible for signaling exchange using the Session Initiation Protocol (SIP) as the signaling protocol. The saturation of SIP server resources is one of the issues with the VoIP network, which causes problems such as overload or loss of energy. Resource saturation occurs mainly due to a lack of integrated server resource management. In the traditional VoIP networks, management and routing are distributed among all equipment, including servers. These servers are overloaded during peak times and face energy loss during idle times. Given the importance of this issue, this paper introduces a framework based on Software-Defined Networking technology for SIP server resource management. The advantage of this framework is to have a global view of all the server resources. In this framework, the resource allocation optimization problem and resource autoscaling are presented to deal with the problems posed. The goal is to maximize total throughput and minimize energy consumption. In this regard, we seek to strike a balance between efficiency and energy. The proposed framework is implemented in the actual testbed. The results show that the proposed framework has succeeded in achieving these goals.
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and...
详细信息
ISBN:
(纸本)9781510655201;9781510655195
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?". This paper focuses on a relatively small case of TSP and uses JAVA and LpSolve (a linear programming solver) to simulate a situation where one wants to choose two to five cities out of ten cities and find the shortest distance to connect those chosen cities. This paper randomly selects ten cities which are Shanghai, Beijing, Qingdao, Seattle, LA, Las Vegas, Boston, Chicago, Orlando, and Miami. And this paper gets the result that when choosing two cities, the path between Orlando and Miami is the shortest. When choosing three cities, the path among Beijing, Qingdao, and Shanghai is the shortest. When choosing four cities, the shortest path connects Boston, Chicago, Orlando, and Miami. And when choosing five cities, the path among LA, Las Vegas, Chicago, Orlando, and Miami is the shortest. When choosing two and three cities, it takes LpSolve a few seconds to get the result. However, when choosing four and five cities, LpSolve spends much more time on generating the results. Therefore,despite that LpSolve can be applied to solve small casese of TSP, when sovling more complicated cases, a more efficient method must be considered.
This paper proposes the event-triggered control of positive systems with state saturation both in discrete-time and continuous-time cases. A 1-norm based event-triggered mechanism is established for positive systems. ...
详细信息
This paper proposes the event-triggered control of positive systems with state saturation both in discrete-time and continuous-time cases. A 1-norm based event-triggered mechanism is established for positive systems. Under the event-triggered mechanism, the error term between actual and sample states is transformed into interval uncertain form. Together with the properties of saturation, the systems with state saturation are transformed into interval uncertain systems and the corresponding lower and upper bounds of the system matrices are obtained, respectively. Using a linear co-positive Lyapunov function, the event-triggered controller and the auxiliary gain matrix of the domain of attraction are designed in terms of linear programming, respectively. Then, the systems with state and input saturation are also described via interval uncertain systems. An event-triggered controller is designed and thus the closed-loop systems are positive and stable under the designed controller. Furthermore, the presented event-triggered control approach is extended to the continuous-time case. Compared to existing control approaches, the event-triggered control can reduce energy consumption and increase the practicability. Finally, several numerical examples are given to illustrate the effectiveness of the proposed design.
The class of multiset combinatorial batch codes (MCBCs) was introduced by Zhang et al. (2018) as a generalization of combinatorial batch codes (CBCs), which are replication-based batch codes. The MCBCs allow multiple ...
详细信息
The class of multiset combinatorial batch codes (MCBCs) was introduced by Zhang et al. (2018) as a generalization of combinatorial batch codes (CBCs), which are replication-based batch codes. The MCBCs allow multiple users to retrieve items in parallel in a distributed storage and a fundamental objective in this study is to determine the minimum total storage given certain requirements. We formulate linear programs so that the optimal solutions provide lower bounds on the total storage of MCBCs. Borrowing techniques from linear programming, we improve known lower bounds in some cases. Furthermore, for some parameters, we showed that these lower bounds are either tight or asymptotically tight by constructing the corresponding codes.
There is a need to augment the irrigation operation policy, change of cropping pattern to improve the efficiency of canal system and to increase the overall productivity in the command area. This paper reports an opti...
详细信息
Optimal coordination of directional over-current relays (DOCRs) is a crucial task in ensuring the security and reliability of power system network. In this paper, a hybridization of an improved particle swarm optimiza...
详细信息
Optimal coordination of directional over-current relays (DOCRs) is a crucial task in ensuring the security and reliability of power system network. In this paper, a hybridization of an improved particle swarm optimization and linear programming (IPSO-LP) is proposed to solve DOCRs coordination problem. The considered decision variables in the optimization are plug setting current, time multiplier setting, type of relay, and type of curve. By considering these parameters in the optimization, the best relay operating time can be determined. Furthermore, the proposed technique also considered the continuous values of pick-up current setting (PSC) and time setting multiplier (TMS). Test on the IEEE 8 bus system has proven the effectiveness of the technique, where an improvement between 2.36% and 45.8% of total relay operating time can be observed as compared to other techniques in literature. In addition, the obtained settings of the DOCRs from the proposed technique have been verified using industrial software to make sure no setting that cause violation to the DOCRs operation.
Here it is assumed that the characteristic function of a linear control system, which is in the form of a polynomial and its coefficients are desired affine functions of unknown parameters of controller, is given. It ...
详细信息
Here it is assumed that the characteristic function of a linear control system, which is in the form of a polynomial and its coefficients are desired affine functions of unknown parameters of controller, is given. It is also assumed that the transfer function of controller has a desired order and structure. Hence, some of the coefficients of the characteristic polynomial may not depend on some or any of the controller parameters. The main problem under consideration is to calculate the parameters of the controller such that all roots of the characteristic equation lie (if possible) inside the desired D-stability region, which can be any convex/non-convex connected/disconnected subset of complex plane. This problem has important applications in control theory. For example, non-convex D-stability regions appear when designing a controller for a fractional-order system is aimed. It is shown that this problem, which is still open even in dealing with general convex regions, is exactly equivalent to a set of linear algebraic equalities/inequalities in mixed real-integer variables, which can be solved efficiently by using the available software. Application of the proposed method for optimal controller design is also studied and three numerical examples are presented.
暂无评论