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

作者： George, Stefanoiu Horatiu Octavian, Stanasila Corneliu, Stanasila Virgil Dan, Stefanoiu Bioterra University of Bucharest Dept. of Chemistry Romania Politehnica University of Bucharest Dept. of Applied Sciences Romania Technical University of Civil Engineering Bucharest Romania Politehnica University of Bucharest Dept. of Automatic Control and Computer Science Romania

ISBN: (纸本)9789604742271

The redox steam-iron process, which has been discovered in the early 1900's, was finally abandoned because the degradation of the iron oxide ores within a few cycles. Recently, this process has been reconsidered, due to the necessity to yield cheap and pure hydrogen. In this article, we introduce a related but improved technology. At the first stage, the inlet iron oxide for the steam-iron process is the hematite, which has to be reduced to metallic iron in a gasifier called HG, by using syngas from coke (or cellulose). The hydrogen is then produced in a cyclic process, based upon the reduction of metallic iron by means of steam. At the second stage, another hematite, at any granulation, is reduced to iron powder in a reactor called IPR, at about 570°C by using the hydrogen of HG.

关键词： Heat transfer

来源：评论

学校读者我要写书评

暂无评论

Author's retrospective for: Biomedical image analysis on a cooperative cluster of GPUs and multicores 25

Author's retrospective for: Biomedical image analysis on a c...

引用

25th ACM International Conference on Supercomputing, ICS 2014

作者： Hartley, Timothy D. R. Çatalyürek, Ümit V. Ruiz, Antonio Igual, Francisco Mayo, Rafael Ujaldon, Manuel Intel Corporation Software and Services Group HillsboroOR United States Dept. Biomedical Informatics Ohio State University ColumbusOH43210 United States Computer Architecture Dept. University of Malaga Malaga Spain Computer Architecture and Automatic Control Dept. Univ. Complutense of Madrid Madrid Spain Dept. of Computer Eng. and Computer Science University Jaume I Castellon Spain

ISBN: (纸本)9781450328401

The last six years has seen Moore's Law continue to produce incredible gains in computational power. Indeed, the November, 2007 list of the top ten fastest supercomputers in the world contained no machines with acceleration of any kind. The same list six years later has four of the ten fastest supercomputers using accelerators, including the top two machines [3] . And the ten greenest supercomputers in November 2013 are using NVIDIA GPUs [1]. This heterogeneity of processing units is present from the top of the computational power spectrum down to the bottom, where GPU hardware coupled with novel CUDA and OpenCL programming paradigms have brought significant performance gains to consumer-grade applications. Copyright © 2014 by the Association for Computing Machinery, Inc. (ACM).

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

controller synthesis for autonomous systems interacting with human operators 15

Controller synthesis for autonomous systems interacting with...

引用

6th ACM/IEEE International Conference on Cyber-Physical Systems, ICCPS 2015

作者： Feng, Lu Wiltsche, Clemens Humphrey, Laura Topcu, Ufuk Dept. of Computer and Information Science University of Pennsylvania United States Dept. of Computer Science University of Oxford United Kingdom Control Science Center of Excellence AFRL United Kingdom Dept. of Electrical and Systems Engineering University of Pennsylvania United States

ISBN: (纸本)9781450334556

We propose an approach to synthesize control protocols for autonomous systems that account for uncertainties and imperfections in interactions with human operators. As an illustrative example, we consider a scenario involving road network surveillance by an unmanned aerial vehicle (UAV) that is controlled remotely by a human operator but also has a certain degree of autonomy. Depending on the type (i.e., probabilistic and/or nondeterministic) of knowledge about the uncertainties and imperfections in the operator- Autonomy interactions, we use abstractions based on Markov- decision processes and augment these models to stochastic two-player games. Our approach enables the synthesis of operator-dependent optimal mission plans for the UAV, highlighting the effects of operator characteristics (e.g., workload. proficiency, and fatigue) 011 UAV mission performance;it can also provide informative feedback (e.g., Pareto curves showing the trade-offs between multiple mission objectives), potentially assisting the operator in decision-making.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Detecting network faults on industrial process control IP networks

引用

7th IEEE International Workshop on IP Operations and Management

作者： Won, Young J. Choi, Mi-Jung Lee, Jang Jin Lee, Jun Hyub Hwang, Hwa Won Hong, James Won-Ki Dept. of Computer Science and Engineering POSTECH South Korea Electric and Control Maintenance Dept. POSCO South Korea Technical Research Laboratories POSCO South Korea

ISBN: (纸本)9783540758525

Industrial process control IP networks support communications between process control applications and devices. Communication faults in any stage of these control networks can cause delays or even shutdown of the entire manufacturing process. The current process of detecting and diagnosing communication faults is mostly manual and limited to post-reaction of user complaints which are followed by noticeable process malfunctioning. This paper identifies control network specific failures and their symptoms for early detection

关键词： industrial process control networks IP network operation and management fault detection and diagnosis traffic monitoring

来源：评论

学校读者我要写书评

暂无评论

Structured coprime factorizations description of linear and time-invariant networks

Structured coprime factorizations description of linear and ...

引用

52nd IEEE Conference on Decision and control, CDC 2013

作者： SabǍu, Şerban OarǍ, Cristian Warnick, Sean Jadbabaie, Ali Electrical and Computer Engineering Dept. Stevens Institute of Technology United States Faculty of Automatic Control Dept. University Politehnica Bucharest Romania Faculty of Computer Science Department Information and Decision Algorithms Laboratories Brigham Young University United States Faculty of Electrical and Systems Engineering Dept. University of Pennsylvannia United States

ISBN: (纸本)9781467357173

In this paper we study state-space realizations of Linear and Time-Invariant (LTI) systems. Motivated by biochemical reaction networks, Gonçalves and Warnick have recently introduced the notion of a Dynamical Structure Functions (DSF), a particular factorization of the system's transfer function matrix that elucidates the interconnection structure in dependencies between manifest variables. We build onto this work by showing an intrinsic connection between a DSF and certain sparse left coprime factorizations. By establishing this link, we provide an interesting systems theoretic interpretation of sparsity patterns of coprime factors. In particular we show how the sparsity of these coprime factors allows for a given LTI system to be implemented as a network of LTI sub-systems. We examine possible applications in distributed control such as the design of a LTI controller that can be implemented over a network with a pre-specified topology. ©2013 IEEE.

关键词： Factorization

来源：评论

学校读者我要写书评

暂无评论

Real-time visual predictive control of manipulation systems

Real-time visual predictive control of manipulation systems

引用

IEEE 15th International Conference on Advanced Robotics: New Boundaries for Robotics, ICAR 2011

作者： Burlacu, Adrian Copot, Cosmin Cervera, Enric Lazar, Corneliu Dept. of Automatic Control and Applied Informatics Technical University of Iasi D. Mangeron Street no.27 700050 Iasi Romania Dept. of Computer Science and Engineering Jaume I University Campus Riu Sec 12071 Castello Spain

ISBN: (纸本)9781457711589

This paper presents the results obtained by visual predictive control laws in real-time visual servoing architectures. A key role when designing a stable image based control law is played by the visual features, and thus both points and image moments were considered and their performance revealed. A 6 d.o.f manipulator robot with an eye-in-configuration is used to design a visual servoing architecture and realtime implementation using Matlab is described. The results of different experiments for planar static objects are presented and discussed. For establishing the performance of visual predictive control laws a comparison with classical image based control laws is conducted. © 2011 IEEE.

关键词： Visual servoing

来源：评论

学校读者我要写书评

暂无评论

Optimal distributed control for platooning via sparse coprime factorizations

Optimal distributed control for platooning via sparse coprim...

引用

2016 American control Conference, ACC 2016

作者： SabǍu, Şerban OarǍ, Cristian Warnick, Sean Jadbabaie, Ali Electrical and Computer Engineering Dept. Stevens Institute of Technology HobokenNJ United States Automatic Control Dept. University Politehnica Bucharest Romania Information and Decision Algorithms Laboratories Faculty of the Computer Science Department Brigham Young University United States Electrical and Systems Engineering Dept. University of Pennsylvania United States

ISBN: (纸本)9781467386821

We introduce a novel distributed control architecture for disturbances attenuation in heterogeneous platoons of linear and time-invariant autonomous agents that inherits the performance achievable by the leader-follower control policies. We provide a Youla-like parameterization for the class of all distributed controllers such that the sparsity constraints are imposed on the controllers' left coprime factors, outlining a new concept of structural constraints in distributed control. The proposed scheme lends itself to optimal controller design via norm based costs, it guarantees string stability and completely eliminates the accordion effect from the behavior of the platoon. The distributed controller is proven to attain global optimality for heterogeneous platoons and H2 costs and can easily reconfigure such as to remain optimal during formation merging/exiting maneuvers. The scheme is amenable to a GPS time base synchronization mechanism, allowing for the exact compensation of the time delays induced by the wireless communications. © 2016 American automatic control Council (AACC).

关键词：

来源：评论

学校读者我要写书评

暂无评论

NEW DIRECT DISCRETIZATION OF THE FRACTIONAL-ORDER DIFFERENTIATOR/INTEGRATOR BY THE CHEBYSHEV-PADÉ APPROXIMATION

引用

IFAC Proceedings Volumes 2006年第11期39卷 269-273页

作者： A.P. de Madrid C. Mañoso R. Hernández Dept. of Computer Science and Automatic Control Computer Science School. Juan del Rosal 16. 28040 – Madrid (Spain)

This paper deals with the use of the Chebyshev-Padé approximation (CP) in order to achieve accurate direct discrete-time approximations to the fractional-order differentiator/integrator. It is shown how, for a given order of the transfer functions, CP is much more accurate at low frequencies than the continued fraction expansion (CFE). Furthermore, CP can be more accurate than a CFE approximation of a higher order.

关键词： Fractional-order differentiator/integrator Fractional calculus Fractional-order systems Chebyshev-Padé approximation Continued fraction expansion Integer-order approximation Backward differentiation rule Tustin operator Al-Alaoui operator Discretization

来源：评论

学校读者我要写书评

暂无评论

control configurationfor robustness enhancement 6

Control configurationfor robustness enhancement

引用

6th European control Conference, ECC 2001

作者： Pedret, C. Vilanova, R. Serra, I. Moreno, R. System Engineering and Automatic Control Group. Computer Science Dept ETSE Universitat Autònoma de Barcelona Bellaterra08193 Spain

ISBN: (纸本)9783952417362

This paper proposes a design framework for robust control system design. The approach is based on improving the robustness of a previously existing controller instead of the design of a Robust controller: therefore the consideration of the controller Robustification problem. The method is based on the generation of a complement to the control signal of the initial controller by means of a Robustification Block. This robustification part, which is based on the Observer-controller configuration, will add an additional free parameter to the initial controller and will provide an IMC-like control scheme. Consequently, two important facts follows: The robustness properties of the initial controller are improved and it is not necessary to modify the initial controller. The approach is presented as a two-step design and we will concentrate on the second stage by designing for Robust Stability. To illustrate the proposed design, the temperature of an open-loop unstable bach chemical reactor is controlled. © 2001 EUCA.

关键词： Robust control

来源：评论

学校读者我要写书评

暂无评论

Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs 19

Constant-factor approximations for asymmetric TSP on nearly-...

引用

19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016

作者： Marx, Dániel Salmasi, Ario Sidiropoulos, Anastasios Institute of Computer Science and Control Hungarian Academy of Sciences MTA SZTAKI Budapest Hungary Dept. of Computer Science and Engineering Ohio State University ColumbusOH United States Dept. of Computer Science and Engineering Dept. of Mathematics Ohio State University ColumbusOH United States

ISBN: (纸本)9783959770187

In the Asymmetric Traveling Salesperson Problem (ATSP) the goal is to find a closed walk of minimum cost in a directed graph visiting every vertex. We consider the approximability of ATSP on topologically restricted graphs. It has been shown by Oveis Gharan and Saberi [13] that there exists polynomial-Time constant-factor approximations on planar graphs and more generally graphs of constant orientable genus. This result was extended to non-orientable genus by Erickson and Sidiropoulos [8]. We show that for any class of nearly-embeddable graphs, ATSP admits a polynomial-Time constant-factor approximation. More precisely, we show that for any fixed k κ 0, there exist α β > 0, such that ATSP on n-vertex k-nearly-embeddable graphs admits an-Approximation in time O(n). The class of k-nearly-embeddable graphs contains graphs with at most κ apices, κ vortices of width at most k, and an underlying surface of either orientable or non-orientable genus at most κ. Prior to our work, even the case of graphs with a single apex was open. Our algorithm combines tools from rounding the Held-Karp LP via thin trees with dynamic programming. We complement our upper bounds by showing that solving ATSP exactly on graphs of pathwidth κ (and hence on κ-nearly embeddable graphs) requires time nω(κ), assuming the Exponential-Time Hypothesis (ETH). This is surprising in light of the fact that both TSP on undirected graphs and Minimum Cost Hamiltonian Cycle on directed graphs are FPT parameterized by treewidth.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：