Neighbor diffusion effect (NDE) is a crucial aspect in advanced technology node that is well-known for its infamous consequence of significant performance decrement of the circuit. In this paper, we observe that NDE i...
详细信息
Neighbor diffusion effect (NDE) is a crucial aspect in advanced technology node that is well-known for its infamous consequence of significant performance decrement of the circuit. In this paper, we observe that NDE is caused by different diffusion heights (the number of fins) between two adjacent cells, and consider reducing the number of height differences in single row to reduce NDE violations. Ignoring the movement of the cells, we first propose a Hamiltonian-completion-based algorithm that reorders the cells in the row such that the number of NDE violations is reduced to a near-optimal value. Then, for a given fixed integer eta > 0, we devise an algorithm to compute the new positions of cells, such that the number of NDE violations is bounded by eta + 1 and the maximum displacement is minimized. Moreover, we extend our algorithm for legalization in multiple rows against mixed-height cells. Experimental results show that our algorithm reduces the NDE violations to a near-optimal minimum without any area overheads while achieving a better practical running time compared to baselines conforming with the theoretical analysis.
The fuzzy logic theory is suitable for solving the vagueness, nonlinearity and complexity problems of an assembly process by implanting ’human reasoning and action’ in the automated devices. The aim of the paper is ...
详细信息
The fuzzy logic theory is suitable for solving the vagueness, nonlinearity and complexity problems of an assembly process by implanting ’human reasoning and action’ in the automated devices. The aim of the paper is to develop a simple and fast fuzzy rule-based algorithm and to explore via simulation the possibility of its implementation for precision assembly of chamferless parts. The main contribution is a simple, fast and reliable fuzzy algorithm, ready for imbedding in the PLC of a SCARA type robot.
Internet of Things (IoT) is the paradigm that has largely contributed to the development of smart buildings in our society. This technology makes it possible to monitor all aspects of the smart building and to improve...
详细信息
Internet of Things (IoT) is the paradigm that has largely contributed to the development of smart buildings in our society. This technology makes it possible to monitor all aspects of the smart building and to improve its operation. One of the main challenges encountered by IoT networks is that the the data they collect may be unreliable since IoT devices can lose accuracy for several reasons (sensor wear, sensor aging, poorly constructed buildings, etc.). The aim of our work is to study the evolution of IoT networks over time in smart buildings. The hypothesis we have tested is that, by amplifying the Lotka-Volterra equations as a community of living organisms (an ecosystem model), the reliability of the system and its components can be predicted. This model comprises a set of differential equations that describe the relationship between an IoT network and multiple IoT devices. Based on the Lotka-Volterra model, in this article, we propose a model in which the predators are the non-precision IoT devices and the prey are the precision IoT devices. Furthermore, a third species is introduced, the maintenance staff, which will impact the interaction between both species, helping the prey to survive within the ecosystem. This is the first Lotka-Volterra model that is applied in the field of IoT. Our work establishes a proof of concept in the field and opens a wide spectrum of applications for biology models to be applied in IoT.
Wind power is one of the most important sources of renewable energy available today. A large part of the cost of wind energy is due to the cost of maintaining wind power equipment. When a wind turbine component fails ...
详细信息
Wind power is one of the most important sources of renewable energy available today. A large part of the cost of wind energy is due to the cost of maintaining wind power equipment. When a wind turbine component fails to function, it might need to be replaced under circumstances that are less than ideal. This is known as corrective maintenance. To minimize unnecessary costs, a more active maintenance policy based on the life expectancy of the key components is preferred. Optimal scheduling of preventive maintenance activities requires advanced mathematical modeling. In this paper, an optimal preventive maintenance algorithm is designed using the renewal-reward theorem. In the multi-component setting, our approach involves a new idea of virtual maintenance that allows us to treat each replacement event as a renewal event even if some components are not replaced by new ones. The proposed optimization algorithm is applied to a four-component model of a wind turbine, and the optimal maintenance plans are computed for various initial conditions. The modeling results clearly show the benefit of PM planning compared to a pure CM strategy (about 30% lower maintenance cost).
In order to solve the problem that the evaluation algorithm is easy to fall into local extremum, which leads to slow convergence speed, a skilled talent quality evaluation algorithm based on a deep belief network mode...
详细信息
In order to solve the problem that the evaluation algorithm is easy to fall into local extremum, which leads to slow convergence speed, a skilled talent quality evaluation algorithm based on a deep belief network model was designed. Establish an evaluation set with 4 first level indicators and 14 second level indicators, and calculate the corresponding weights to complete the construction of the evaluation index system. A DBN structure composed of several RBMs and a BP network is constructed. Based on the DBN, a quality evaluation algorithm is designed. The algorithm training is used to evaluate the test data and output the evaluation level. The experimental results show that the convergence speed of DBN based evaluation algorithm is significantly better than that of BP neural network and SVM based evaluation algorithm under the same number of iterations, which is suitable for the accurate evaluation of talent quality.
Josephus problem is one of the headstreams of combinational mathematics. There are so many methods to describe Josephus problem. In this paper, through many experiments and analysis, a common method is summarized and ...
详细信息
Josephus problem is one of the headstreams of combinational mathematics. There are so many methods to describe Josephus problem. In this paper, through many experiments and analysis, a common method is summarized and an algorithm, which is based on circular linked list, is designed. The data source of the algorithm comes from the text file so that the practicability is enhanced. And since the circular linked list is created based on the ascending order of the value of data element, the data can be classified effectively to make the distribution of Josephus data sequence uniform and unduplicated. Some applications of Josephus problem is given in the paper, which include the algorithm on a test paper generating from a general test database and find a sequence of data in the specified range.
For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications. In general, an array can be distributed t...
详细信息
For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications. In general, an array can be distributed to multiple processing systems by using regular or irregular distributions. Some data distribution adopts BLOCK, CYCLIC, or BLOCK-CYCLIC to specify data array decomposition and distribution. On the other hand, irregular distributions specify a different-size data array distribution according to user-defined commands or procedures. In this work, we propose three bipartite graph problems, including the "maximum edge coloring problem", the "maximum degree edge coloring problem", and the "cost-sharing maximum edge coloring problem" to formulate these kinds of distribution problems. Next, we propose an approximation algorithm with a ratio bound of two for the maximum edge coloring problem when the input graph is biplanar. Moreover, we also prove that the "cost-sharing maximum edge coloring problem" is an NP-complete problem even when the input graph is biplanar.
This paper introduces streamlined constant-time variants of Euclid’s algorithm, both for polynomial inputs and for integer inputs. As concrete applications, this paper saves time in (1) modular inversion for Curve255...
详细信息
More and more Internet of Things (IoT) wireless devices have been providing ubiquitous services over the recent years. Since most of these devices are powered by batteries, a fundamental trade-off to be addressed is t...
详细信息
More and more Internet of Things (IoT) wireless devices have been providing ubiquitous services over the recent years. Since most of these devices are powered by batteries, a fundamental trade-off to be addressed is the depleted energy and the achieved data throughput in wireless data transmission. By exploiting the rate-adaptive capacities of wireless devices, most existing works on energy-efficient data transmission try to design rate-adaptive transmission policies to maximize the amount of transmitted data bits under the energy constraints of devices. Such solutions, however, cannot apply to scenarios where data packets have respective deadlines and only integrally transmitted data packets contribute. Thus, this paper introduces a notion of weighted throughput, which measures how much total value of data packets are successfully and integrally transmitted before their own deadlines. By designing efficient rate-adaptive transmission policies, this paper aims to make the best use of the energy and maximize the weighted throughput. What is more challenging but with practical significance, we consider the fading effect of wireless channels in both offline and online scenarios. In the offline scenario, we develop an optimal algorithm that computes the optimal solution in pseudo-polynomial time, which is the best possible solution as the problem undertaken is NP-hard. In the online scenario, we propose an efficient heuristic algorithm based on optimal properties derived for the optimal offline solution. Simulation results validate the efficiency of the proposed algorithm.
This paper presents an algorithm for the design of the wireless-optical broadband access network (WOBAN) considering the multi-hop wireless connection among subscribers. With our algorithm, we can specify the number o...
详细信息
This paper presents an algorithm for the design of the wireless-optical broadband access network (WOBAN) considering the multi-hop wireless connection among subscribers. With our algorithm, we can specify the number of hop in which subscribers can access to optical network units (ONUs) or base stations (BSs). Our algorithm will give the optimum positions, as well as the number, of ONU required in the network, when the number of wireless connection hop is ***, the algorithm can also assign for the shortest routes connecting among subscribers. Noted that the placement, the number of ONU, and the routes connecting among subscribers, will vary with the designed number of hop as well as the constraints of wireless connection such as the limitation of signal power.
暂无评论