检索结果-内蒙古大学图书馆

Hamiltonian-Based Efficient algorithms for Legalization with Neighbor Diffusion Effect

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE 2023年第0期

作者： Sun, Hao Guo, Longkun Zhang, Xiaoyan Qilu Univ Technol Sch Comp Sci & Technol Jinan 250300 Peoples R China Nanjing Normal Univ Inst Math Sch Math Sci Nanjing 210008 Peoples R China

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.

关键词： Neighbor diffusion effect legalization Hamiltonian completion algorithm design

来源：评论

学校读者我要写书评

暂无评论

A fuzzy model for automated precision robot assembly of parts

引用

IFAC Proceedings Volumes 2000年第20期33卷 521-525页

作者： Todor Neshkov Snejana Yordanova Lazar Videnov Technical University of Sofia Bulgaria

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.

关键词： fuzzy control algorithm design assembly SCARA type robot simulation Matlab

来源：评论

学校读者我要写书评

暂无评论

Smart Buildings IoT Networks Accuracy Evolution Prediction to Improve Their Reliability Using a Lotka-Volterra Ecosystem Model

引用

SENSORS 2019年第21期19卷 4642-4642页

作者： Casado-Vara, Roberto Canal-Alonso, Angel Martin-del Rey, Angel De la Prieta, Fernando Prieto, Javier Univ Salamanca BISITE Res Grp Edificio Multiusos I D I Salamanca 37007 Spain Univ Salamanca Inst Fundamental Phys & Math Dept Appl Math Calle Parque 2 E-37008 Salamanca Spain

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.

关键词： Internet of Things Lotka-Volterra model predator-prey system bio-inspired system evolution algorithm design

来源：评论

学校读者我要写书评

暂无评论

Optimal Maintenance Schedule for a Wind Power Turbine with Aging Components

引用

algorithmS 2023年第7期16卷 334-334页

作者： Yu, Quanjiang Carlson, Ola Sagitov, Serik Ericsson AB SE-41756 Gothenburg Sweden Chalmers Univ Technol Dept Elect Engn SE-42196 Gothenburg Sweden Chalmers Univ Technol Dept Math Sci SE-42196 Gothenburg Sweden Univ Gothenburg Dept Math Sci SE-40530 Gothenburg Sweden

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).

关键词： algorithm design combinatorial optimization preventive maintenance virtual maintenance linear programming wind turbine Weibull distribution renewal-reward theorem

来源：评论

学校读者我要写书评

暂无评论

Evaluation algorithm of Skilled Talents' Quality Based on Deep Belief Network Model

引用

JOURNAL OF INTERCONNECTION NETWORKS 2022年第SUPP02期22卷 2143035-2143035页

作者： Hua, Jiang Tao, Sun Jiaozuo Univ Coll Informat Engn Jiaozuo 454000 Henan Peoples R China Jiaozuo Technician Coll Dept Elect Engn Jiaozuo 454003 Henan Peoples R China

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.

关键词： Deep confidence network skilled personnel quality evaluation evaluation algorithm talent quality algorithm design

来源：评论

学校读者我要写书评

暂无评论

algorithm deign and application research on Josephus problem

引用

Journal of Information and Computational Science 2008年第3期5卷 1421-1428页

作者： Chen, Haishan Chen, Yu Yao, Junfeng Software School Xiamen University Xaimen 361005 China Dept. of Compute Section Xiamen University Xiamen 361005 China

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.

关键词： Josephus Problem algorithm design Dynamic Circular Linked List Text File

来源：评论

学校读者我要写书评

暂无评论

New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling

引用

algorithmS 2019年第7期12卷 142-142页

作者： Li, Qinghai Yu, Chang Wu Zhejiang Ind & Trade Vocat Coll Dept Elect Engn East Rd 717 Wenzhou 325003 Peoples R China Chung Hua Univ Dept Comp Sci & Informat Engn 707Sec 2WuFu Rd Hsinchu 30012 Taiwan

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.

关键词： data redistribution scheduling edge coloring approximation algorithms graph techniques bipartite graphs algorithm design

来源：评论

学校读者我要写书评

暂无评论

Fast constant-time gcd computation and modular inversion

IACR Transactions on Cryptographic Hardware and Embedded Sys...

引用

IACR Transactions on Cryptographic Hardware and Embedded Systems 2019年第3期2019卷 340-398页

作者： Bernstein, Daniel J. Yang, Bo-Yin Department of Computer Science University of Illinois at Chicago ChicagoIL60607–7045 United States Horst Görtz Institute for IT Security Ruhr University Bochum Germany Institute of Information Science and Research Center of Information Technology and Innovation Academia Sinica 128 Section 2 Academia Road Taipei115-29 Taiwan

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 Curve25519, which was previously believed to be handled much more efficiently by Fermat’s method, and (2) key generation for the ntruhrss701 and sntrup4591761 lattice-based cryptosystems. © 2019, Ruhr-University of Bochum. All rights reserved.

关键词： algorithm design Branchless algorithms Constant-time computations Curve25519 Euclid’s algorithm Gcd Greatest common divisor Modular inversion Modular reciprocal NTRU

来源：评论

学校读者我要写书评

暂无评论

On Maximizing the Throughput of Packet Transmission under Energy Constraints

引用

SENSORS 2018年第7期18卷 2018-2018页

作者： Wu, Weiwei Dai, Guangli Li, Yan Shan, Feng Southeast Univ Sch Comp Sci & Engn Nanjing 211189 Jiangsu Peoples R China Univ Houston Dept Comp Sci Houston TX 77204 USA Nanjing Univ Finance & Econ Sch Informat & Engn Nanjing 210046 Jiangsu Peoples R China

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.

关键词： energy-efficiency rate schedule throughput maximization data packets wireless data transmission algorithm design

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for designing multi-hop wireless connections for wireless-optical broadband access network

An efficient algorithm for designing multi-hop wireless conn...

引用

International Conference on Wireless and Optical Communications ( WOCC)

作者： Panaya Pengboon Pasu Kaewplung Department of Electrical Engineering Faculty of Engineering Chulalongkom University Bangkok Thailand

ISBN: (纸本)9781467309400;9781467309417;9781467309394

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.

关键词： component formatting fiber-to-the-home wireless-optical broadband access network (WOBAN) wireless mesh topology multi-hop connection Wireless connectivity fiber-to-the-home formatting Optical network units Humulus efficient algorithm broadband access Spread spectrum communication access network signal power algorithm design

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：