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

International Conference on Advanced in Control Engineering and Information Science (CEIS)

作者： Tan, Aiguo Ju, Changjiang Shanghai Univ Sci & Technol Sch Opt Elect & Comp Engn Shanghai 200093 Peoples R China

maze algorithm can identify connected relation of a single node in ladder diagram of programmable logical controller, from which serial or parallel connections between pairs of attached nodes derive. After uniting serial or parallel relation of each node, serial or parallel connections of all nodes are stored in binary trees. Scanning binary trees can generate instruction lists. maze algorithm identifies the connected relation of ladder diagram node correctly and ensures the correctness of translating ladder diagram into instruction lists.

关键词： maze algorithm Programmable Logical Controller Ladder Diagram Instruction Lists

来源：评论

学校读者我要写书评

暂无评论

The Application of maze algorithm in Translating Ladder Diagram into Instruction Lists of Programmable Logical Controller

引用

Procedia Engineering 2011年 15卷 264-268页

作者： Aiguo Tan Changjiang Ju School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology Shanghai 200093 China School of Electronic Information and Electrical Engineering Shanghai Jiao Tong University Shanghai 200240 China

关键词： maze algorithm Programmable Logical Controller Ladder Diagram Instruction Lists

来源：评论

学校读者我要写书评

暂无评论

An improved maze algorithm in contour extraction of CAPTCHAs

An improved maze algorithm in contour extraction of CAPTCHAs

引用

2010 Third International Symposium on Knowledge Acquisition and Modeling (KAM 2010)

作者： Jialin Liu Zhuhai college, Jinan University Zhuhai, China,519070 Kaifa Liang Zhuhai college, Jinan University Zhuhai, China,519070 Shuangping Chen Zhuhai college, Jinan University Zhuhai, China,519070

An improved maze algorithm has been first advanced, combining with the rotation invariant theory, to extract the contour of CAPTCHAs which are slant and have random positions. First, take the CAPTCHAs as a maze, in which white pixels represents a potential route;Second, search towards left-down in the predefined direction and record the pixels which have been checked;Finally, get the clockwise rotate projection of CAPTCHAs within the paths’ closed region in order to obtain the CAPTCHAs’ contour features which are immune to rotation, random position, slant and other factors. Experiments have shown that the algorithm has better performance in dealing with CAPTCHAs which are slant and have random positions, its sufficient extraction of contour features reduces errors and improves recognition rate.

关键词： maze algorithm Contour CAPTCHAs

来源：评论

学校读者我要写书评

暂无评论

A FAST VECTORIZED maze ROUTING algorithm ON A SUPERCOMPUTER

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 1994年第12期E77A卷 2067-2075页

作者： MIKI, Y Hitachi Ltd Kokubunji-shi Japan

This paper presents a fast and practical routing algorithm implemented on a supercomputer. In previously reported work, routing has been accelerated by executing the maze algorithm on parallel processing elements. However, although many parallel algorithms and special architectures have been introduced, practical aspects have not been addressed. We therefore present a novel approach that uses a vector processor as a routing accelerator and a wavefront control algorithm in order to avoid the wasteful searches that often occur in industrial routing problems. Experimental results that show the performance of a supercomputer using these algorithms is equivalent to over 1800 VAXMIPS, the fastest yet reported for routing accelerators. Results with industrial data also prove the validity of our approach.

关键词： WIRE ROUTING algorithm VECTOR PROCESSOR maze algorithm CAD ACCELERATOR

来源：评论

学校读者我要写书评

暂无评论

Path Planning algorithm for maze: Design and Implementation in LEGO Mindstorms Rover

Path Planning Algorithm for Maze: Design and Implementation ...

引用

International Conference on Inventive Computing and Informatics (ICICI)

作者： Saranya, C. Unnikrishnan, Manju Ali, S. Akbar Sheela, D. S. Lalithambika, V. R. ISRO Satellite Ctr SCG Bengaluru India Vikram Sarabhai Space Ctr CGFSD Kerala India Vikram Sarabhai Space Ctr Control & Guidance Design Grp Kerala India Vikram Sarabhai Space Ctr Control Guidance & Simulat Ent Kerala India

ISBN: (纸本)9781538640319

Autonomous Rover requires navigating unknown areas and reaching target point successfully. Over the course, rovers may get trapped in a deadlock scenario. Rover must be built with intelligence to back trace its path and find an alternate route to avoid the trap situation. maze is a typical case which can be used to train the rover to deal with such scenarios. This paper brings out a maze solver algorithm which can be implemented in a simple autonomous rover with limited onboard resources. Also the implementation details of the algorithm in LEGO Mindstorms Rover along with the experimental results are brought out here.

关键词： Path planning maze algorithm Autonomous Rover

来源：评论

学校读者我要写书评

暂无评论

A Flow Path Generation Approach of Hydraulic Manifold Blocks Based on maze and Genetic algorithms

A Flow Path Generation Approach of Hydraulic Manifold Blocks...

引用

International Conference on Materials and Products Manufacturing Technology (ICMPMT 2011)

作者： Li, Guang Niu, Wentie Zhang, Dawei Gao, Weiguo Tianjin Univ Sch Mech Engn Tianjin 300072 Peoples R China

ISBN: (纸本)9783037852484

The automatic generation of flow path is the key and most difficult task in Hydraulic Manifold Blocks (HMB) design. This paper divides the HMB layout space into grids, and sets the HMB boundaries and existing flow paths to obstacles, and the paths generated using maze algorithm are regarded as the initial population of genetic algorithm. The optimal path with the shortest path and least turnings can be obtained using genetic algorithm. The ports of flow path can be connected after the generation of technical holes based on the blind holes. The design parameters of holes, such as starting point coordinates, orientations and depths, can be obtained through a series of algorithms, and then drive the secondary development system HMBDesigner based on SolidWorks to generate three-dimensional solid model. This paper also discusses the generation method of multi-port flow path and multiple flow paths.

关键词： Hydraulic Manifold Blocks Flow path generation maze algorithm Genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Pipe-assembly approach for ships using modified NSGA-Ⅱ algorithm

引用

Computer Aided Drafting,Design and Manufacturing 2016年第2期26卷 34-42页

作者： Sui Haiteng Niu Wentie Niu Yaxiao Zhou Chongkai Gao Weigao Key Laboratory of Mechanism Theory and Equipment Design of Ministry of Education Tianjin University

Pipe-routing for ship is formulated as searching for the near-optimal pipe paths while meeting certain objectives in an environment scattered with obstacles. Due to the complex construction in layout space, the great number of pipelines, numerous and diverse design constraints and large amount of obstacles, finding the optimum route of ship pipes is a complicated and time-consuming process. A modified NSGA-II algorithm based approach is proposed to find the near-optimal solution to solve the problem. By simplified equipment models, the layout space is firstly divided into three dimensional （3D） grids to build its mathematical model. In the modified NSGA-II algorithm, the concept of auxiliary point is introduced to improve the search range of maze algorithm （MA） as well as to guarantee the diversity of chromosomes in initial population. Then the fix-length coding mechanism is proposed, Fuzzy set theory is also adopted to select the optimal solution in Pareto solutions. Finally, the effectiveness and efficiency of the proposed approach is demonstrated by the contrast test and simulation. The merit of the proposed algorithm lies in that it can provide more appropriate solutions for the designers while subject certain constrains.

关键词： pipe routing fix-length coding maze algorithm modified NSGA-II algorithm ship industry

来源：评论

学校读者我要写书评

暂无评论

An Optimal Decoding algorithm for LDPC Codes Based on Reverse Distance

An Optimal Decoding Algorithm for LDPC Codes Based on Revers...

引用

ICEMI'2005第七届国际电子测量与仪器学术会议

作者： Xiong Lei Tan Zhenhui Yao Dongping Zhu Gang (School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing 100044 China)

Although the belief propagation (BP) algorithm can achieve good performance for long low-density parity-check (LDPC) codes, and has linear decoding complexity, for the existence of cycle, it is only n

关键词： LDPC codes maze algorithm reverse distance.

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive Multi-layer Gridless Routing algorithm

引用

Jisuanji Gongcheng/Computer Engineering 2006年第14期32卷 11-13页

作者： Xie, Man-De College of Computer and Information Engineering Zhejiang Gongshang Univ. Hangzhou 310035 China

A non-uniform-grid graph model is introduced and a self-adaptive iterative algorithm is presented for multi-layer gridless area routing. The algorithm can not only handle the case in which the number of metal layers is uncertain but also greatly reduce the search space of multi-layer maze routing by converting multi-layer into multiple two-layer pairs. Based on the feature of non-uniform-grid graph, the optimal maze routing algorithm, which generates the shortest length by steering clear of obstacles, is employed. The experiment data shows the algorithm has rapid search speed and better routing quality.

关键词： Detailed routing Gridless routing maze algorithm

来源：评论

学校读者我要写书评

暂无评论

Detailed routing algorithm with optimized pin mapping strategy

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics 2006年第1期18卷 69-74页

作者： Yang, Liu Hong, Xianlong Cai, Yici Zhou, Qiang EDA Laboratory Department of Computer Science and Technology Tsinghua University Beijing 100084 China

A new multi-layer area routing algorithm with optimized pin mapping strategy is presented. The algorithm can handle large routing problems, in which terminals and obstacles are arbitrarily located in the routing area. Firstly, it divides each net into two-pin subnets according to their relative positions. Then, every subnet is routed in turn by an improved maze algorithm. The routing conflicts are solved by rip-up and rerouting approach. An optimized pin mapping strategy is proposed as a pre-process before routing. The best matching of a bipartite graph is used to solve the pin-mapping problem. We tested our algorithm on a set of benchmark examples and compared our routing results with the results without pin-optimized mapping. Experimental results show that, the algorithm efficiently shortens the total wire length greatly and increases the routing completion rate.

关键词： Area routing maze algorithm Pin mapping Subnet

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：