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

A comparative study of similarity measures for manufacturing cell formation

JOURNAL OF MANUFACTURING SYSTEMS 2008年第1期27卷 19-25页

作者： Oliveira, S. Ribeiro, J. F. F. Seok, S. C. Univ Iowa Dept Comp Sci Iowa City IA 52242 USA Univ Sao Paulo FEARP BR-14049 Ribeirao Preto Brazil

We introduced a spectral clustering algorithm based on the bipartite graph model for the Manufacturing Cell Formation problem in [Oliveira S, Ribeiro JFF, Seok SC. A spectral clustering algorithm for manufacturing cell formation. computers and Industrial Engineering. 2007 [submitted for publication]]. It constructs two similarity matrices;one for parts and one for machines. The algorithm executes a spectral clustering algorithm on each separately to find families of parts and cells of machines. The similarity measure in the approach utilized limited information between parts and between machines. This paper reviews several well-known similarity measures which have been used for Group Technology. Computational clustering results are compared by various performance measures. (C) 2008 The Society of Manufacturing Engineers. Published by Elsevier Ltd. All rights reserved.

关键词： Manufacturing cells computer algorithms Mathematical models Group technology Industrial engineering Bipartite graphs computer engineering Comparative studies

来源：评论

学校读者我要写书评

暂无评论

The development of a fuzzy logic controller that drives a passive compliant manipulator

引用

JOURNAL OF ROBOTIC SYSTEMS 1998年第12期15卷 671-680页

作者： De, A Tasch, U Univ Maryland Baltimore Cty Dept Mech Engn Baltimore MD 21250 USA

A fuzzy logic controller that drives a crank turning apparatus is presented. A crank turning operation with unknown initial conditions is an example of a contact operation a mechanical manipulator often finds challenging. The apparatus presented in this manuscript uses a fuzzy logic controller that results in a simple structure and a readily realizable algorithm. computer simulations and experimental studies demonstrate favorable results offering an effective control algorithm. (C) 1998 John Wiley & Sons, Inc.

关键词： CRANK fuzzy logic controller computer algorithms Manuscripts

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of digital controllers for smart structures using field programmable gate arrays

引用

SMART MATERIALS AND STRUCTURES 1997年第5期6卷 559-572页

作者： Kelly, JS Rao, VS Pottinger, HJ Bowman, HC UNIV MISSOURI DEPT ELECT ENGN ROLLA MO 65409 USA UNIV MISSOURI INTELLIGENT SYST CTR ROLLA MO 65409 USA

Implementation issues represent an unfamiliar challenge to most control engineers, and many techniques for controller design ignore these issues outright. Consequently, the design of controllers for smart structural systems usually proceeds without regard for their eventual implementation, thus resulting either in serious performance degradation or in hardware requirements that squander power, complicate integration, and drive up cost. The level of integration assumed by the smart patch further exacerbates these difficulties, and any design inefficiency may render the realization of a single-package sensor-controller-actuator system infeasible. The goal of this research is to automate the controller implementation process and to relieve the design engineer of implementation concerns like quantization, computational efficiency, and device selection. Field programmable gate arrays (FPGA) are specifically targeted as a hardware platform because these devices are highly flexible, power efficient, and reprogrammable. The current study develops an automated implementation sequence that minimizes hardware requirements while maintaining controller performance. Beginning with a state space representation of the controller, the sequence automatically generates a configuration bitstream for a suitable FPGA implementation. MATLAB functions optimize and simulate the control algorithm before translating it into the VHSIC hardware description language (VHDL). These functions improve power efficiency and simplify integration in the final implementation by performing a linear transformation that renders the controller computationally friendly. The transformation favors sparse matrices in order to reduce multiply operations and the hardware necessary to support them;simultaneously, the remaining matrix elements take on values that minimize limit cycles and parameter sensitivity. The proposed controller design methodology is implemented on a simple cantilever beam test structure using

关键词： SENSITIVITY SYSTEMS control engineering Controllers degradation of performance Hardware Platform State-space Representation Field programmable gate arrays controller design Designers computer hardware digital controller computer algorithms Parameter sensitivity

来源：评论

学校读者我要写书评

暂无评论

SLIDING MODE CONTROL OF AC DRIVES

引用

IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS 1989年第1期25卷 70-75页

作者： SABANOVIC, A BILALOVIC, F Energoinvest-Institute for Automatic Control and Computer Science Sarajevo Serbia

The application of sliding mode control to permanent-magnet synchronous motors (DC brushless motors), wound-rotor synchronous motors, and asynchronous motors is presented. A unified approach to the control problem of AC machines reveals that a simple control algorithm which effectively solves the problem can be derived using variable-structure system theory. Selection of the control variable (angular position, speed, acceleration, or torque) leaves the basic control structure unchanged, and even current limiting can easily be included. The theoretical results are verified by experiments. The design procedure and experimental results show that this approach provides good behavior of the system in both transient and steady-state operation.

关键词： AC machines ALTERNATING CURRENT wound rotor design process synchronous motors Permanent magnet synchronous machines Asynchronous motors DRIVES computer algorithms Control Architecture system behavior brushless direct current motor Torque Variable structure systems Automobile driving

来源：评论

学校读者我要写书评

暂无评论

Adaptive sorting: an information theoretic perspective

引用

ACTA INFORMATICA 2008年第1期45卷 33-42页

作者： Elmasry, Amr Fredman, Michael L. Rutgers State Univ Dept Comp Sci New Brunswick NJ 08903 USA Univ Alexandria Dept Comp Engn & Syst Alexandria Egypt

We present two algorithms that are near optimal with respect to the number of inversions present in the input. One of the algorithms is a variation of insertion sort, and the other is a variation of merge sort. The number of comparisons performed by our algorithms, on an input sequence of length n that has I inversions, is at most n log(2) (I/n + 1) + O(n) . Moreover, both algorithms have implementations that run in time O(n log(2) (I/n + 1) + n ) . All previously published algorithms require at least cn log(2) (I/n + 1) comparisons for some c > 1.

关键词： computer science computer algorithms ADAPTIVE computing systems SORTING (Electronic computers) algorithms computer science -- Mathematics

来源：评论

学校读者我要写书评

暂无评论

A fast and robust method of calculating RFM parameters for satellite imagery

引用

REMOTE SENSING LETTERS 2016年第12期7卷 1112-1120页

作者： Wu, Yingdan Ming, Yang Hubei Univ Technol Sch Sci Wuhan Peoples R China Hubei Univ Technol Hubei Collaborat Innovat Ctr High Efficient Utili Wuhan Peoples R China CCCC Second Highway Consultants Co Ltd Wuhan Peoples R China

Since the normal matrix is often ill-conditioned when solving Rational Function Model (RFM) for the satellite remote sensing imagery, combining with matrix orthogonal decomposition, Levenberg-Marquardt algorithm and Compute Unified Device Architecture high-performance computing technique, a fast and robust method directly based on the error equation coefficient matrix is proposed. The method is analysed by different parameters of control point grid and compared with the common methods, namely L-curve based ridge estimation and Iteration by Correcting Characteristic Value. The experimental results show that RFM parameters derived by ourmethod have higher fitting accuracy.

关键词： REMOTE-sensing images ORTHOGONAL functions DECOMPOSITION method (Mathematics) computer algorithms CUDA (computer architecture)

来源：评论

学校读者我要写书评

暂无评论

Cyber-physical approach to the optimization of semiactive structural control under multiple earthquake ground motions

引用

computer-AIDED CIVIL AND INFRASTRUCTURE ENGINEERING 2019年第5期34卷 402-414页

作者： Zhang, Ruiyang Phillips, Brian M. Univ Pittsburgh Dept Civil & Environm Engn Pittsburgh PA USA Univ Maryland Dept Civil & Environm Engn 1173 Martin Hall4298 Campus Dr College Pk MD 20742 USA

This paper presents a cyber-physical approach to optimize the semiactive control of a base-isolated structure under a suite of earthquakes. The approach uses numerical search algorithms to guide the exploration of the design space and real-time hybrid simulation (RTHS) to evaluate candidate designs, creating a framework for real-time hybrid optimization (RHTO). By supplanting traditional numerical analysis (i.e., finite element methods) with RTHS, structural components that are difficult to model can be represented accurately while still capturing global structural performance. The efficiency of RTHO is improved for multiple design excitations with the creation of a multiinterval particle swarm optimization (MI-PSO) algorithm. As a proof-of-concept, RTHO is applied to improve the seismic performance of a base-isolated structure with supplemental control. The proposed RTHO framework with MI-PSO is a versatile technique for multivariate optimization under multiple excitations. It is well suited for the accurate and rapid evaluation of structures with nonlinear experimental substructures, in particular, those that do not undergo permanent damage such as structural control devices. The RTHO framework integrates popular optimization algorithms with advanced experimental methods, creating an exciting new cyber-physical approach to design.

关键词： HYBRID computer simulation FINITE element method PARTICLE swarm optimization computer algorithms EARTHQUAKES

来源：评论

学校读者我要写书评

暂无评论

Blocking in parallel multisearch problems

引用

THEORY OF COMPUTING SYSTEMS 2001年第2期34卷 145-189页

作者： Dittrich, W Hutchinson, DA Maheshwari, A Marconi Commun GMBH D-71522 Backnang Germany Duke Univ Dept Comp Sci Durham NC 27708 USA Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada

External memory (EM) algorithms are designed for computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. Blockwise access to data is a central theme in the design of efficient EM algorithms, A similar requirement arises in the transmission of data between processors in high performance parallel computation systems, for which blockwise communication is a crucial issue. We consider multisearch problems, where a large number of queries are to be simultaneously processed and satisfied by navigating through large data structures on parallel computers, Our examples originate as algorithms for parallel machines, and we adapt them to the EM situation where the queries and data structure are considered to be much larger than the size of the available internal memory. This paper presents techniques to achieve blocking for I/O as well as for communication in multisearch on the BSP and EM-BSP models. We describe improvements to the 1-optimal BSP* multisearch algorithm of [8] which permit larger search trees to be handled. In the area of EM algorithms new algorithms for multisearch in balanced trees are described. For search trees of size O (n log n) where n is the number of queries, we obtain a work-optimal, parallel, randomized EM multisearch algorithm whose I/O and communication time are smaller, asymptotically, than the computation time. We obtain a deterministic version via a similar technique. These algorithms are obtained via the simulation techniques of [12], [17], [13], [14], and [24]. For larger trees we describe a parallel, EM algorithm which is I-optimal considering computation, communication, and I/O (for suitable parameter constellations) plus I/O-optimal. We give a lower bound to the number of I/O operations required for filtering n queries through a binary or multiway search tree of size m when m greater than or equal to n(2 + epsilon) for a constant epsilon > 0.

关键词： computer storage devices computer algorithms PARALLEL computers

来源：评论

学校读者我要写书评

暂无评论

An improved parallelism scheme for deterministic discrete ordinates transport

引用

INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS 2018年第4期32卷 555-569页

作者： Deakin, Tom McIntosh-Smith, Simon Martineau, Matt Gaudin, Wayne Univ Bristol Dept Comp Sci Bristol Avon England UK Atom Weap Estab High Performance Comp Aldermaston England

In this paper we demonstrate techniques for increasing the node-level parallelism of a deterministic discrete ordinates neutral particle transport algorithm on a structured mesh to exploit many-core technologies. Transport calculations form a large part of the computational workload of physical simulations and so good performance is vital for the simulations to complete in reasonable time. We will demonstrate our approach utilizing the SNAP mini-app, which gives a simplified implementation of the full transport algorithm but remains similar enough to the real algorithm to act as a useful proxy for research purposes. We present an OpenCL implementation of our improved algorithm which achieves a speedup of up to 2.5 x on a many-core GPGPU device compared to a state-of-the-art multi-core node for the transport sweep, and up to 4 x compared to the multi-core CPUs in the largest GPU enabled supercomputer;the first time this scale of speedup has been achieved for algorithms of this class. We then discuss ways to express our scheme in OpenMP 4.0 and demonstrate the performance on an Intel Knights Corner Xeon Phi compared to the original scheme.

关键词： computer programming MOBILE apps computer algorithms CENTRAL processing units (computers) GRAPHICS processing units (computers)

来源：评论

学校读者我要写书评

暂无评论

Sub-logarithmic distributed algorithms for metric facility location

引用

DISTRIBUTED COMPUTING 2015年第5期28卷 351-374页

作者： Hegeman, James W. Pemmaraju, Sriram V. Univ Iowa Dept Comp Sci Iowa City IA 52242 USA

The facility location problem consists of a set of facilities , a set of clients , an opening cost associated with each facility , and a connection cost between each facility and client . The goal is to find a subset of facilities to open, and to connect each client to an open facility, so as to minimize the total facility opening costs plus connection costs. We consider distributed versions of facility location in which the underlying network is either a clique, in which each node is both a client and a facility (and ), or a complete bipartite network, with forming the bipartition. This paper presents the first expected-sub-logarithmic-round distributed -approximation algorithms in the model for the metric facility location problem. We present our approach first for a clique network, and then extend it to a bipartite network. Our algorithms have expected running times of rounds, where , and where for a clique network and for a bipartite network (These results were first published in ICALP 2012 and DISC 2013). In order to obtain these results, our paper makes four main technical contributions. First, we show a new lower bound for metric facility location, extending the lower bound of Bdoiu et al. (ICALP 2005) that applies only to the special case of uniform facility opening costs. Next, we demonstrate a reduction of the distributed metric facility location problem to the problem of computing an -ruling set of an appropriate spanning subgraph. Third, we provide an expected-sub-logarithmic-round algorithm for computing a -ruling set in a spanning subgraph of a clique. Finally, we present a new technique based on probabilistic hashing to solve a problem of information dissemination on bipartite networks.

关键词： DISTRIBUTED computing RESEARCH computer algorithms BANDWIDTH research BIPARTITE graphs LOCATION problems (Programming)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：