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

Numerical Modelling of Control Time-Delay System

IFAC Proceedings Volumes 1998年第13期31卷 155-159页

作者： O.B. Kwon A.V. Kim V.G. Pimenov Kyung Sung College Computer Science Dept. Shitl Prong-Ri 131 Pochun-Gun Kyung-Kido Seoul Korea Control Information Systems Laboratory School of Electrical Engineering Seoul National University Seoul 151-742 Korea Ural State University Turgenev Str. 4 Ekaterinburg 620083 Russia

Discrete-time control schemes are often used for realization of positional control strategies for continuous time control problems (Krasovskii and Subbotin, 1974; Osipov, 1971) . However for general systems with delays (whicb are often called functional differential equations (FDE)) exact solutions in both continuous and discrete schemes can be found in exceptional cases. So, as rule, it is necessary to solve corresponding control problems using suitable numerical algorithms . In surveys (Cryer and Tavernini, 1972; Hall and watt, 1976; Bellen, 1985) different numerical methods for FDE are discussed. In this paper positional implicit Runge-Kutta-like numerical methods of solving general FDE are presented. The elaborated methods are direct analogs of the corresponding numerical methods of ODE case. Also we present new theorem (which generalizes the results of (Kim and Pimenov, 1997; Kim and Pimenov, 1998)) on convergence order. The obtained results are based on distinguishing of finite dimensional and infinite dimensional components in the structure of FDE, on interpolation and extrapolation of the discrete prehistory of the model, on application of constructions of i- smooth analysis (Kim, 1996) . The notion of an approximation order for an optimal strategy in the discrete scheme of realization is introduced. The conditions, which guarantee required approximation order of the optimal strategy, are presented.

关键词： Delay positional control discretization Runge-Kutta metbod implicit systems accuracity

来源：评论

学校读者我要写书评

暂无评论

Royal Academy of Medicine in Ireland - Section of Bioengineering - Proceedings of meeting held in Dundalk, Co. Louth, in February 1998.

引用

IRISH JOURNAL OF MEDICAL science 1998年第4期167卷 256-276页

作者： [Anonymous] Orthopaedic Research Unit The Queen’s University of Belfast School of Biomedical Sciences The Queen’s University of Belfast Howmedica International Ltd. Raheen Industrial Estate Limerick Department of Mechanical Engineering Trinity College Dublin 2 Mater Hospital Dublin 7 Orthopaedic Research Laboratory Århus University Hospital Denmark University of Limerick Limerick Limerick Regional Hospital Raheen Limerick Boston Scientific Ireland Ltd. Galway Department of Mechanical Engineering University College Dublin Dublin Department of Electrical and Electronic Engineering University College Dublin Dublin Bioengineering Research Centre Department of Mechanical Engineering University College Dublin Dublin Northern Ireland Bio-Engineering Centre (NIBEC) School of Electrical and Mechanical Engineering University of Ulster Newtownabbey Department of Mechanical & Manufacturing Engineering The Ashby Building The Queen’s University of Belfast Johnson and Johnson Professional Orthopaedic Division Queensway England Department of Cardiology and Department of Medical Physics & Bioengineering St. James’s Hospital Dublin 8 Burke House Ellison Street Castlebar Royal College of Surgeons in Ireland Department of Surgery Beaumont Hospital Dublin Department of Electronic and Electrical Engineering Trinity College Dublin 2 Department of Aeronautical Engineering The Queen’s University of Belfast Vascular Unit Belfast City Hospital Department of Medical Physics and Bioengineering St. James’s Hospital Dublin 8 Centre for Biomedical Electronics Department of Electronic and Computer Engineering University of Limerick Limerick Department of Mechanical and Aeronautical Engineering University of Limerick Limerick School of Health Sciences University of Ulster Ireland School of Physiotherapy University of Ulster Newtownabbey Clinical Engineering NI Medical Physics Agency Belfast and Radiology Royal Victoria Hospital Musgrave Park Hospital University of Limerick Biomedical Institute (ULBMI) Uni

来源：评论

学校读者我要写书评

暂无评论

Success factors for software reuse that are applicable across domains and businesses 97

Success factors for software reuse that are applicable acros...

引用

1997 ACM Symposium on Applied Computing, SAC 1997

作者： Rine, David C. Dept. of Computer Science and Information and Software Systems Engineering School of Information Technology and Engineering George Mason University Fairfax VA United States

ISBN: (纸本)0897918509

The problem researched is that there presently does not exist a set of success factors which are common across organizations and have some predictability relationship to software reuse. For completeness, this research also investigated possible predictive relationships between software reuse and both productivity and quality. A 1995 survey was conducted to determine the state-of-the-practice. The data from the survey was statistically analyzed to evaluate the relationships among reuse capability, productivity, quality, and the individual software reuse success factors. The results of the analysis showed some of the success factors to have a predictive relationship to software reuse capability. software reuse capability also had a predictive relationship to productivity and quality. Based on the research results, the leading indicators of software reuse capability are: product-line approach, architecture which standardizes interfaces and data formats, common software architecture across the product-line, design for manufacturing approach, domain engineering, management which understands reuse issues, software reuse advocate(s) in senior management, state-of-the-art tools and methods, precedence of reusing high level software artifacts such as requirements and design versus just code reuse, and trace end-user requirements to the components (systems, subsystems, and/or software modules) which support them. © 1997 ACM.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

An object-oriented dependency graph for program slicing

An object-oriented dependency graph for program slicing

引用

Technology of Object-Oriented Languages and systems (TOOLS)

作者： Jian-Liang Chen Feng-Jian Wang Yung-Lin Chen Dept. of Comput. Sci. & Inf. Eng. Nat. Chiao Tung Univ. Hsinchu Taiwan Department of Computer Science and Information Engineering National Chiao Tung University Taiwan Software Engineering Laboratory Institute for Information Industry Taiwan

Program dependency graphs (PDG) facilitate program analysis and related applications such as program slicing, which is a method to identify the relevant entities of the program according to data and control dependencies. In the past, PDGs and program slicing were mostly developed for (conventional) imperative programs. Recently, the object-oriented (OO) paradigm has gained momentum and popularity. The OO paradigm introduces the features of object abstraction, encapsulation, inheritance and polymorphism to programs, but is not considered in PDGs and program slicing. In this paper, we present an object-oriented dependency graph (ODG) to represent the structure of OO programs. The ODG is defined based on a property multi-digraph that is extended from a directed graph by augmenting multiple edge types, vertex properties and property relations. With these extensions, the ODG can avoid specious dependencies due to object encapsulation. Based on the ODG, a program slicing method for OO software is developed. Besides data and control dependencies, dependencies caused by OO features are taken into consideration in our slicing method. Through the ODG, the slicing method can be applied to facilitate the understanding, debugging and maintenance of OO software in the same way that traditional program slicing methods do.

关键词： Encapsulation Debugging information analysis software testing computer science Data engineering software engineering Laboratories computer industry Industrial control

来源：评论

学校读者我要写书评

暂无评论

A clustering-based approach to the separation of text strings from mixed text/graphics documents

A clustering-based approach to the separation of text string...

引用

13th International Conference on Pattern Recognition, ICPR 1996

作者： He, Shoujie Abe, Norihiro Dept. of Information Systems and Computer Science National University of Singapore Lower Kent Ridge Rd Singapore 0511 Singapore Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Kawatsu 680-4 Iizuka-shi 820 Japan

ISBN: (纸本)081867282X

A clustering-based approach to the separation of text from mixed text/graphics documents is presented. The approach starts from the grouping of connected components. Clustering is employed at three critical stages to improve the efficiency and effectiveness of the grouping, i.e., prior to the grouping, prior to orientation estimation, and posterior to the orientation estimation. Because of the high accuracy of the estimated orientation, not only the overgrouping but also most of undergrouping cases could be successfully handled. © 1996 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Parallel programming with CAPSE-A case study 4

Parallel programming with CAPSE-A case study

引用

4th Euromicro Workshop on Parallel and Distributed Processing, PDP 1996

作者： Gruber, B. Haring, G. Kranzlmuller, D. Volkert, J. University of Vienna Institute of Applied Computer Science Aid Information Systems Dept. of Advanced Computer Engineering Lenaugasse 218 ViennaA-1080 Austria Johannes Kepler University Linz Institute of Computer Science Dept. for Graphics and Parallel Processing Altenbergerstr. 69 LinzA-4040 Austria

ISBN: (纸本)0818673761

The CAPSE environment for computer Aided Parallel software engineering is intended to assist the developer in the crucial task of parallel programming. The methodology of CAPSE is based on direct manipulative graphical creation and editing of scalable workload characterizations of MIMD algorithms. This paper presents the basic concepts of this methodology and an example of a parallel Poisson solver. The workload characterization representing the computation and communication behavior of the algorithm is based on directed acyclic task graphs, which achieve scalability by composing the task graph of scalable basic patterns instead of single node and arcs. The composition and the usage of these basic patterns is described in the light of designing the Poisson solver algorithm. The resulting task graph is used to predict the program's performance on a nCUBE 2 distributed memory machine and the PAPS simulator. © 1996 IEEE.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

A hardware/software partitioning algorithm for designing pipelined ASIPs with least gate counts 96

A hardware/software partitioning algorithm for designing pip...

引用

Proceedings of the 33rd annual Design Automation Conference

作者： Nguyen Ngoc Bình Masaharu Imai Akichika Shiomi Nobuyuki Hikichi Department of Information and Computer Sciences Faculty of Engineering Science Osaka University Toyonaka-shi Osaka 560 Japan and Dept. of Information & Computer Sciences Toyohashi University of Technology Toyohashi 441 Japan Department of Computer Science Faculty of Information Shizuoka University Hamamatsu-shi 432 Japan and Dept. of Information & Computer Sciences Toyohashi University of Technology Toyohashi 441 Japan Dept. of Software Technology Software Research Associates Inc. Tokyo 170 Japan

来源：评论

学校读者我要写书评

暂无评论

A dynamic fuzzy reasoning method for adaptive diagnostic systems design

A dynamic fuzzy reasoning method for adaptive diagnostic sys...

引用

Conference of the North American Fuzzy information Processing Society - NAFIPS

作者： M. Ulieru M.H. Smith Department of Computer Science and Information Systems Brunel University UK School of Engineering Science Simon Fraser University Burnaby BC Canada Dept. of Electrical Engineering and Computer Science University of California Berkeley USA Dept. of Mining and Mineral Process Engineering University of British Columbia Canada

Tackles some critical issues in diagnostic problem solving by addressing the conceptual design of automatic diagnostic systems able to cope with complex dynamic processes. The dynamic switching fuzzy system model introduced by M.H. Smith (1994) is used as a generalized framework which dynamically changes the reasoning method by tuning the operators and/or defuzzification methods. This technique is applied to tune different fuzzy diagnostic models introduced by M. Ulieru (1995). The dynamic switching fuzzy diagnostic model (DFSDM) proposed in this paper can adapt online to drastic changes in the behavior of the diagnosed process. Tutorial investigations on an inverted pendulum clarify the ability of this method to cope with unexpected, unknown disturbances while simulation results on an electromechanical process prove the ability of this technique to manage critical faults in continuous dynamic systems.

关键词： Fuzzy reasoning Adaptive systems Fuzzy systems computer science Design engineering Electronic mail Problem-solving Degradation information systems Minerals

来源：评论

学校读者我要写书评

暂无评论

Test processor ASIC design

Test processor ASIC design

引用

IEEE International Conference on Semiconductor Electronics (ICSE)

作者： L. Ali Z.M. Darus M.A.M. Ali I. Ahmed Dept. of Electr. Electron. & Syst. Eng. Univ. Kebangsaan Malaysia Department of Electrical Electronic and Systems Engineering Universiti Kebangsaan Malaysia Malaysia Faculty of Computer Science and Information Technology University of Malaya Malaysia

In this paper, a design of a test processor ASIC employing a probabilistic approach is presented. The test processor chip is computer programmable. It consists of linear feedback shift register (LFSR) which can select one of 16 polynomials and set user programmable need for every test set, signature analyzer and 3 built-in RAMs and other control circuitry. It is capable of generating random numbers and applying them to the circuit under test (CUT) and then retrieve the responses from the CUT. It can generate a signature by compressing the response data and detect circuit faults by comparing this signature with that of a good CUT. This ASIC can be used to design a low cost IC tester of reliable performance.

关键词： Application specific integrated circuits Process design Circuit testing Linear feedback shift registers Polynomials Linear feedback control systems Feedback circuits Random number generation Electrical fault detection Fault detection

来源：评论

学校读者我要写书评

暂无评论

Proof Method for correctness of refinements of algebraic specification in abstract sequential machine style

引用

systems AND computerS IN JAPAN 1996年第5期27卷 25-38页

作者： Okano, K Higashino, T Taniguchi, K Member Faculty of Engineering Science Osaka University Toyonaka Japan 560 Teruo Hipshino received his B.E. M.E.and Ph.D. degrees in Information and Computer Sciences from Osaka University Osaka Japan in 1R9 1981 and 1984 respectively. He joined the Faculty of Osaka University in 1984. Since 1991 he has been an Associate Professor in the Department of Information and Computer Sciences at Osaka University. In 1990 he was a Visiting Researcher of Dept. I.R.O. at University of Montreal Canada. His current research interests include design and analysis of distributed systems specification and verification of communication protocols and formal approach of program design. He is a member of IEEE-CS ACM IEICE of Japan and IPS of Japan.

In this paper, new methods for providing the correctness of refinement among abstract sequential machine style programs are described. The programs are described in algebraic language ASL using some useful notions, i.e., the extended projection and the valid reachability condition for each transition function. These notions allow a designer to refine a given text (program or specification) to a concrete text more freely than the text that does not use such notions. These notions can also enhance the expressive power of the text. On the other hand, these advantages would have lost half their values, if useful methods to prove the correctness of refinement among the texts using them are not found. Thus new methods for proving the correctness of the texts are proposed, and they do not require much proof loads. First, the correctness of refinement among the ASL texts with the extended projection is defined. Second, a method is proposed for proving the correctness of refinement among such texts. Also proposed is a definition of the correctness of refinement among the texts with the valid reachability conditions and a method to prove their correctness. These methods do not require more proof loads than the usual methods for the texts that do not use such notions in the abstract sequential machine style. Therefore, these methods are useful.

关键词： abstract sequential machine ASL language proof algebraic specification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：