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

A FRAMEWORK FOR SOURCE CODE SEARCH USING PROGRAM PATTERNS

IEEE TRANSACTIONS ON SOFTWARE engineering 1994年第6期20卷 463-475页

作者： PAUL, S PRAKASH, A Software Systems Research Laboratory Dept. of Electrical Engineering & Computer Science University of Michigan Ann Arbor MI 48105 USA

For maintainers involved in understanding and reengineering large software. locating source code fragments that match certain patterns is a critical task. Existing solutions to the problem are few, and they either involve manual, painstaking scans of the source code using tools based on regular expressions, or the use of large, integrated software engineering environments that include simple pattern-based query processors in their tool-kits. We present a framework in which pattern languages are used to specify interesting code features. The pattern languages are derived by extending the source programming language with pattern-matching symbols. We describe SCRUPLE, a finite state machine-based source code search tool, that efficiently implements this framework. We also present experimental performance results obtained from a SCRUPLE prototype, and the user interface of a source code browser built on top of SCRUPLE.

关键词： REVERSE engineering SOFTWARE MAINTENANCE SOFTWARE REengineering PROGRAM UNDERSTANDING PATTERN MATCHING QUERY LANGUAGE

来源：评论

学校读者我要写书评

暂无评论

An Intraoperative Glucose control Benchmark for Formal Verification

引用

IFAC-PapersOnLine 2015年第27期48卷 211-217页

作者： Chen, Sanjian O'Kelly, Matthew Weimer, James Sokolsky, Oleg Lee, Insup Dept. of Computer and Information Science University of Pennsylvania Philadelphia United States Dept. of Electrical and Systems Engineering University of Pennsylvania Philadelphia United States

Diabetes associated complications are affecting an increasingly large population of hospitalized patients. Since glucose physiology is significantly impacted by patient-specific parameters, it is critical to verify that a clinical glucose control protocol is safe across a wide patient population. A safe protocol should not drive the glucose level into dangerous low (hypoglycemia) or high (hyperglycemia) ranges. Verification of glucose controllers is challenging due to the high-dimensional, non-linear glucose physiological models which contain both unobservable states and unmeasurable patient-specific parameters. This paper presents a hybrid system model of a closed-loop physiological system that includes an existing FDA-accepted high-fidelity physiological model tailored to intraoperative settings and a validated improvement to a clinical glucose control protocol for diabetic cardiac surgery patients. We propose the closed-loop model as a physiological system benchmark for verification and present our initial results on verifying the system using the SMT-based hybrid system verification tool dReach. © 2015, IFAC (International Federation of Automatic control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Physiological models Cardiovascular surgery Closed loop control systems controllers Formal verification Glucose Hybrid systems Medical applications Physiology Closed loop controllers Glucose control Glucose control protocols Hybrid system models Patient specific parameters Physiological systems Safety analysis System verifications

来源：评论

学校读者我要写书评

暂无评论

Optimization Path Planning Algorithm Rapidly-Exploring Random Trees∗ (RRT*) with Fixed Node, Mesh Grid and Visibility Graph Sampling-Based Method 8

Optimization Path Planning Algorithm Rapidly-Exploring Rando...

引用

8th International Conference on Wireless and Telematics, ICWT 2022

作者： Izaty, Annisa Rusmin, Pranoto Hidaya Institute Technology of Bandung Dept. Control and Computer Systems Bandung Indonesia

ISBN: (数字)9781665451222

ISBN: (纸本)9781665451222

Path planning is very necessary in an autonomous mobile robot system to ensure a planned collision- free path from the starting point to the destination point in the navigation environment In general, there are two methods for finding paths, namely Deterministic and Random Graph Search. One of the random graph search algorithms that is often used for path planning is Rapidly Exploring Random Trees (RRT). RRT is a path planning algorithm that forms nodes randomly from the start point to the end point in the navigation environment. RRT can ensure probabilistic completeness but does not guarantee that the specified path is the shortest path in the navigation environment The proposed extension of the RRT and guaranteeing a shorter path length is RRT*. RRT∗ claims a more optimal solution than RRT but the path formed is not yet the most optimal path. This article introduces an RRT∗ algorithm with several innovative methods that can form optimal paths with shorter paths, less memory usage, and fewer iterations. The fixed node method is used to select the node to be selected and stored when searching for nodes, so that it uses less memory. Meanwhile, to reduce the number of iterations needed to form a path from the starting point to the destination point, a sampling-based method is used when looking for qnew from qnear and qgrand. © 2022 IEEE.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

controlling CAN Servo Step Drives and Their Remote Monitoring by Using Protocol OPC UA

Controlling CAN Servo Step Drives and Their Remote Monitorin...

引用

2019 International Multi-Conference on Industrial engineering and Modern Technologies, FarEastCon 2019

作者： Martinov, G. Issa, A. Martinova, L. Institute of Automation and Robotics Dept. Computer Control Systems Moscow Russia

ISBN: (纸本)9781728100616

The diverse requirements of customers in automation systems increase the need for improved adaptability, flexibility and of simplicity production processes. which creates new horizons for modern production systems. Fortunately, the achievements of the Industry 4.0 (fourth industrial revolution) have provided many solutions to these problems. In this study, an OPC UA-based solution is proposed for monitoring the working process of CAN servo drives. By integrating C++ based OPC UA libraries to implement common OPC UA functionality and developing protocol of interaction between the kernel of CNC system and OPC UA server. The aim of this work is to ensure the connection mechanism between OPC UA Server of CNC system and OPC UA clients which are currently existed on the market. This flexible model allows users to remotely tune and set up CAN servo drives and monitor their work. © 2019 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Path planning of free-floating robot in cartesian space using direct kinematics

引用

International Journal of Advanced Robotic systems 2007年第1期4卷 17-26页

作者： Xu, Wenfu Liang, Bin Li, Cheng Xu, Yangsheng Qiang, Wenyi Dept. of Control Science and Engineering Harbin Institute of Technology Harbin China Dept. of Automation and Computer-Aided Engineering Chinese University of Hong Kong Hong Kong Hong Kong

Dynamic singularities make it difficult to plan the Cartesian path of free-floating robot. In order to avoid its effect, the direct kinematic equations are used for path planning in the paper. Here, the joint position, rate and acceleration are bounded. Firstly, the joint trajectories are parameterized by polynomial or sinusoidal functions. And the two parametric functions are compared in details. It is the first contribution of the paper that polynomial functions can be used when the joint angles are limited (In the similar work of other researchers, only sinusoidla functions could be used). Secondly, the joint functions are normalized and the system of equations about the parameters is established by integrating the differential kinematics equations. Normalization is another contribution of the paper. After normalization, the boundary of the parameters is determined beforehand, and the general criterion to assign the initial guess of the unknown parameters is supplied. The criterion is independent on the planning conditions such as the total time tf. Finally, the parametes are solved by the iterative Newtonian method. Modification of tf may not result in the recalculation of the parameters. Simulation results verify the path planning method.

关键词： Mobile robots

来源：评论

学校读者我要写书评

暂无评论

A hierarchical and modular agent-oriented framework for power systems co-simulations

引用

Energy Informatics 2022年第4期5卷 48页

作者： De Vizia, Claudia Macii, Alberto Patti, Edoardo Bottaccioli, Lorenzo Dept. of Control and Computer Engineering Politecnico di Torino Turin Italy Interuniversity Dept. of Regional and Urban Studies Politecnico di Torino Turin Italy

During the last decades, numerous simulation tools have been proposed to faithfully reproduce the different entities of the grid together with the inclusion of new elements that make the grid "smart". Often, these domain-specific simulators have been then coupled with co-simulation platforms to test new scenarios. In parallel, agent-oriented approaches have been introduced to test distributed control strategies and include social and behavioural aspects typical of the consumer side. Rarely, simulators of the physical systems have been coupled with these innovative techniques, especially when social and psychological aspects have been considered. In order to ease the re-usability of these simulators, avoiding re-coding everything from scratch, we propose a hierarchical and modular agent-oriented framework to test new residential strategies in the energy context. If needed, the presented work enables the user to select the desired level of details of the agent-based framework to match the corresponding physical system without effort to test very different scenarios. Moreover, it allows adding on top of the physical data, behavioural aspects. To this end, the characteristics of the framework are first introduced and then different scenarios are described to demonstrate the flexibility of the proposed work: (i) a first stand-alone scenario with two hierarchy levels, (ii) a second co-simulation scenario with a photovoltaic panel simulator and (iii) a third stand-alone scenario with three hierarchy levels. Results demonstrate the flexibility and ease of use of the framework, allowing us to compare several scenarios and couple new simulators to build a more and more complex environment. The framework is in the early stages of its development. However, thanks to its properties in the future it could be extended to include new actors, such as industries, to get the full picture. © 2022, The Author(s).

关键词： Smart power grids

来源：评论

学校读者我要写书评

暂无评论

Learning algorithm and application of quantum BP neural networks based on universal quantum gates

引用

Journal of systems engineering and Electronics 2008年第1期19卷 167-174页

作者： Li Panchi Li Shiyong Dept. of Control Science and Engineering Harbin Inst. of Technology Harbin 150001 P. R. China Dept. of Computer Science and Engineering Daqing Petroleum Inst. Daqing 163318 P. R. China

A quantum BP neural networks model with learning algorithm is proposed. First, based on the universality of single qubit rotation gate and two-qubit controlled-NOT gate, a quantum neuron model is constructed, which is composed of input, phase rotation, aggregation, reversal rotation and output. In this model, the input is described by qubits, and the output is given by the probability of the state in which （1） is observed. The phase rotation and the reversal rotation are performed by the universal quantum gates. Secondly, the quantum BP neural networks model is constructed, in which the output layer and the hide layer are quantum neurons. With the application of the gradient descent algorithm, a learning algorithm of the model is proposed, and the continuity of the model is proved. It is shown that this model and algorithm are superior to the conventional BP networks in three aspects： convergence speed, convergence rate and robustness, by two application examples of pattern recognition and function approximation.

关键词： quantum computing universal quantum gate quantum neuron quantum neural networks

来源：评论

学校读者我要写书评

暂无评论

Grover quantum searching algorithm based on weighted targets

引用

Journal of systems engineering and Electronics 2008年第2期19卷 363-369页

The current Grover quantum searching algorithm cannot identify the difference in importance of the search targets when it is applied to an unsorted quantum database, and the probability for each search target is equal. To solve this problem, a Grover searching algorithm based on weighted targets is proposed. First, each target is endowed a weight coefficient according to its importance. Applying these different weight coefficients, the targets are represented as quantum superposition states. Second, the novel Grover searching algorithm based on the quantum superposition of the weighted targets is constructed. Using this algorithm, the probability of getting each target can be approximated to the corresponding weight coefficient, which shows the flexibility of this algorithm. Finally, the validity of the algorithm is proved by a simple searching example.

关键词： Grover algorithm targets weighting quantum searching quantum computing.

来源：评论

学校读者我要写书评

暂无评论

A Theoretical Framework for the Identification of the Role of IT in the Support to Decision Making

A Theoretical Framework for the Identification of the Role o...

引用

Proceedings of the 6th Joint Conference on Information Sciences, JCIS 2002

作者： Manuel Mora, T. Cervantes-Pérez, Francisco Forgionne, Guisseppi Dept. of Information Systems UAA DEFPI-UNAM Dept. of Computer Engineering ITAM Information Systems Dept. UMBC

ISBN: (纸本)0970789017

A framework of structural components of decision making support systems (DMSS) was presented. The two main structural components of the framework included data and process. It was argued that the traditional transaction processing systems (TPS) and management information systems are not adequate to directly support the decision making process (DMP). The results show that the framework is useful to identify the role of different kinds of DMSS to support the different phases of DMP for different types of decisions.

关键词： Decision support systems

来源：评论

学校读者我要写书评

暂无评论

MAXIMUM-LIKELIHOOD SOFT DECODING OF BINARY BLOCK-CODES AND DECODERS FOR THE GOLAY CODES

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 1989年第5期35卷 963-975页

作者： SNYDERS, J BEERY, Y Department of Electronic Communications Control and Computer Systems School of Engineering Tel-Aviv University Ramat-Aviv Israel Dept. of Electron. Commun. Control & Comput. Syst. Tel-Aviv Univ. Ramat-Aviv Israel

Maximum-likelihood soft-decision decoding of linear block codes is addressed. A binary multiple-check generalization of the Wagner rule is presented, and two methods for its implementation, one of which resembles the suboptimal Forney-Chase algorithms, are described. Besides efficient soft decoding of small codes, the generalized rule enables utilization of subspaces of a wide variety, thereby yielding maximum-likelihood decoders with substantially reduced computational complexity for some larger binary codes. More sophisticated choice and exploitation of the structure of both a subspace and the coset representatives are demonstrated for the (24, 12) Golay code, yielding a computational gain factor of about 2 with respect to previous methods. A ternary single-check version of the Wagner rule is applied for efficient soft decoding of the (12, 6) ternary Golay code.< >

关键词： Maximum likelihood decoding Block codes Lattices Computational complexity Binary codes Information theory Parity check codes Maximum likelihood detection Conferences Communication system control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：