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

automatic Navigation Scheme for Micro-Robot Using Magnetic Potential Field Through Field Free Point

IEEE ACCESS 2024年 12卷 30135-30145页

作者： Kim, Yonggyu Park, Myungjin Lee, Hosu Yoon, Jungwon Korea Inst Sci & Technol Ctr Healthcare Robot Seoul 02792 South Korea Gwangju Inst Sci & Technol Sch Integrated Technol Gwangju 61005 South Korea Gyeongsang Natl Univ Dept Control & Robot Engn Jinju 660701 South Korea

Magnetic actuation is particularly useful due to its deep penetration and safety to control microrobots for biomedical purposes. This paper proposes an automatic navigation algorithm using a magnetic potential field in the form of a Field Free Point (FFP). The FFP is a powerful tool for magnetic actuation because of its efficiency and versatility, and it can also be used in Magnetic Particle Imaging (MPI). The FFP provides efficiency and versatility in imaging and actuation and the ability to perform both functions on a single device without additional hardware. We suggest a novel navigation scheme based on FFP and Magnetic Potential Field (MPF) to achieve automatic navigation. It consists of a modified attractive field with velocity-based disturbance cancellation and a repulsive field to avoid collision. The suggested algorithm, leveraging microrobot movements and effectively addressing disturbance as inertia, is characterized by its capability to reduce deviations. Thus, simulations were conducted to tune the parameters and evaluate the proposed actuation scheme's effectiveness. Also, the entire algorithm's performance was verified through experiments in a dynamic environment with moving fluid and obstacles. The results demonstrated the proposed navigation system's robustness in reaching the micro-robot to its destination even in an environment with a peak fluid velocity of 80 mm/s .

关键词： Force Saturation magnetization Navigation Magnetic forces Radio frequency Heuristic algorithms Magnetic resonance imaging automatic programming Robots Actuators Mobile robots Micro-manipulation automatic navigation field free point microrobot

来源：评论

学校读者我要写书评

暂无评论

DECLARATIVE TASK DESCRIPTION AS A USER-INTERFACE STRUCTURING MECHANISM

引用

COMPUTER 1984年第9期17卷 29-38页

作者： SMITH, RG LAFUE, GME SCHOEN, E VESTAL, SC SCHLUMBERGER DOLL RES ADV COMP ENVIRONM PROGRAMRIDGEFIELDCT 06877

First Page of the Article

关键词： User interfaces Data acquisition Data flow computing Shape Software systems programming profession Documentation automatic programming Hardware Encapsulation

来源：评论

学校读者我要写书评

暂无评论

Large Language Models are Not Models of Natural Language: They are Corpus Models

引用

IEEE ACCESS 2022年 10卷 61970-61979页

作者： Veres, Csaba Univ Bergen Dept Informat Sci & Media Studies N-5020 Bergen Norway

Natural Language Processing (NLP) has become one of the leading application areas in the current Artificial Intelligence boom. Transfer learning has enabled large deep learning neural networks trained on the language modeling task to vastly improve performance in almost all downstream language tasks. Interestingly, when the language models are trained with data that includes software code, they demonstrate remarkable abilities in generating functioning computer code from natural language specifications. We argue that this creates a conundrum for the claim that eliminative neural models are a radical restructuring in our understanding of cognition in that they eliminate the need for symbolic abstractions like generative phrase structure grammars. Because the syntax of programming languages is by design determined by phrase structure grammars, neural models that produce syntactic code are apparently uninformative about the theoretical foundations of programming languages. The demonstration that neural models perform well on tasks that involve clearly symbolic systems, proves that they cannot be used as an argument that language and other cognitive systems are not symbolic. Finally, we argue as a corollary that the term language model is misleading and propose the adoption of the working term corpus model instead, which better reflects the genesis and contents of the model.

关键词： Grammar Linguistics Deep learning Computational modeling Syntactics Production Task analysis Natural language processing deep learning syntax linguistics language model automatic programming neural networks

来源：评论

学校读者我要写书评

暂无评论

A SPECIFICATIONAL APPROACH TO HIGH-LEVEL PROGRAM MONITORING AND MEASURING

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1992年第11期18卷 969-978页

作者： LIAO, YS COHEN, D USC INST INFORMAT SCIMARINA DEL REYCA 90292

Program monitoring and measuring is the activity of collecting information about the execution characteristics of a program. Although this activity is occasionally supported by special purpose hardware, it is normally done by adding instrumentation code to the program so that it collects interesting data as it runs. Unfortunately, this alteration is itself a difficult task involving all the complexities of programming. Given some questions to be answered, the programmer must determine what data must be collected, determine where in the program that data can be collected, and add code to the program to collect that data and to process it to produce the desired results. The goal of our work is to automate the process. This paper describes a high level program monitoring and measuring system. The system provides a high level specification language to let programmers specify what they want to know about their program's execution. It automatically generates an augmented program whose execution produces both the results of the original program and answers to the specified questions.

关键词： automatic programming INSTRUMENTATION PROGRAM MONITORING AND MEASURING PROGRAM TRANSFORMATIONS STATIC ANALYSIS TEMPORAL REASONING

来源：评论

学校读者我要写书评

暂无评论

KNOWLEDGE-BASED CODE SELECTION METHODS IN RETARGETABLE MICROCODE SYNTHESIS

引用

IEEE DESIGN & TEST OF COMPUTERS 1985年第4期2卷 44-55页

作者： MUELLER, RA VARGHESE, J Colorado State University

We have presented a method for machine-independent synthesis of microcode using knowledge-based techniques. A high-level representationof the microprogram is translated into symbolic assertions and then converted by the synthesis system to microcode. Thus,a synthesis system can function as the back end of a microcode compiler. Since the knowledge base is machine-independent andrequires only a machine description to generate microcode for that machine, it can also be used as a retargetable microcodecompiler. The knowledge base is in procedural form and consists of transformation rules that reflect the effect of MOs onmachine states. Many of these rules simply restrict the transformations to acceptable behavior on the part of the synthesissystem. Others help to reduce the search by providing knowledge about desirable behavior in the form of heuristics, or helpthe synthesis system reason about different possible derivations for the same specification.

关键词： Microprogramming Compaction automatic programming Microarchitecture Control system synthesis System testing Design optimization Performance evaluation Motion control Automation

来源：评论

学校读者我要写书评

暂无评论

EXPLAINING CONTROL STRATEGIES IN 2ND-GENERATION EXPERT-SYSTEMS

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1995年第11期25卷 1483-1490页

作者： TONG, XJ ANG, J NATL UNIV SINGAPORE DEPT DECIS SCISINGAPORE 0511SINGAPORE

Explaining control strategies is an important aspect in second generation expert system explanation. With explicit representation of control, it is possible to construct explanations at different levels of abstraction so as to satisfy different needs, This paper presents our work on explaining control strategies within the context of the system tool, CARMEN. CARMEN's methodology for modeling control knowledge (MMCK) uses problem-solving entities (i.e., tasks, meta-knowledge sources (MKS's), basic-knowledge sources (BKS's) and engines) to integrate different kinds of knowledge and reasoning. These entities reflect the ways experts organize their problem solving activities, Explanations about control strategies can be clearly given according to the roles these entities play in problem solving.

关键词： Control systems Expert systems Problem-solving Engines Calculus automatic programming Terminology Pressing Knowledge acquisition Cybernetics

来源：评论

学校读者我要写书评

暂无评论

Fuzzing: Challenges and Reflections

引用

IEEE SOFTWARE 2021年第3期38卷 79-86页

作者： Bohme, Marcel Cadar, Cristian Roychoudhury, Abhik Monash Univ Melbourne Vic 3168 Australia Imperial Coll London Dept Comp London SW7 2AZ England Natl Univ Singapore Comp Sci Singapore 117417 Singapore

We summarize the open challenges and opportunities for fuzzing and symbolic execution as they emerged in discussions among researchers and practitioners in a Shonan Meeting and that were validated in a subsequent survey.

关键词： automatic programming Fuzzy Set Theory Program Debugging Program Testing Security Of Data Fuzzing Execution Symbolic Execution automatic Bug Vul Nerability Discovery Gray Box Fuzzing White Box Fuzzing Black Box Fuzzing Security Flaw Fuzzing Computer Bugs Software Engineering Security Industries

来源：评论

学校读者我要写书评

暂无评论

Evolving assembly programs:: How games help microprocessor validation

引用

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 2005年第6期9卷 695-706页

作者： Corno, F Sánchez, E Squillero, G Politecn Torino DAUIN I-10129 Turin Italy

Core War is a game where two or more programs, called warriors, are executed in the same memory area by a time-sharing processor. The final goal of each warrior is to crash the others by overwriting them with illegal instructions. The game was popularized by A. K. Dewdney in his Scientific American column in the mid-1980s. In order to automatically devise strong warriors, mu GP, a test program generation algorithm, was extended with the ability to assimilate existing code and to detect clones;furthermore, a new selection mechanism for promoting diversity independent from fitness calculations was added. The evolved warriors are the first machine-written programs ever able to become King of the Hill (champion) in all four main international Tiny Hills. This paper shows how playing Core War may help generate effective test programs for validation and test of microprocessors. Tackling a more mundane problem, the described techniques are currently being exploited for the automatic completion and refinement of existing test programs. Preliminary experimental results are reported.

关键词： automatic programming Core War evolutionary program generation games microprocessor testing

来源：评论

学校读者我要写书评

暂无评论

In search of evidence for model-driven development claims: An experiment on quality, effort, productivity and satisfaction

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2015年第Jun.期62卷 164-186页

作者： Panach, Jose Ignacio Espana, Sergio Dieste, Oscar Pastor, Oscar Juristo, Natalia Univ Valencia Dept Informat Escola Tecn Super Engn E-46100 Valencia Spain Univ Politecn Valencia Ctr Invest Metodos Prod Software ProS E-46022 Valencia Spain Univ Politecn Madrid Escuela Tecn Super Ingn Informat Boadilla Del Monte 28660 Spain

Context: Model-Driven Development (MDD) is a paradigm that prescribes building conceptual models that abstractly represent the system and generating code from these models through transformation rules. The literature is rife with claims about the benefits of MDD, but they are hardly supported by evidences. Objective: This experimental investigation aims to verify some of the most cited benefits of MDD. Method: We run an experiment on a small set of classes using student subjects to compare the quality, effort, productivity and satisfaction of traditional development and MDD. The experiment participants built two web applications from scratch, one where the developers implement the code by hand and another using an industrial MDD tool that automatically generates the code from a conceptual model. Results: Outcomes show that there are no significant differences between both methods with regard to effort, productivity and satisfaction, although quality in MDD is more robust to small variations in problem complexity. We discuss possible explanations for these results. Conclusions: For small systems and less programming-experienced subjects, MDD does not always yield better results than a traditional method, even regarding effort and productivity. This contradicts some previous statements about MDD advantages. The benefits of developing a system with MDD appear to depend on certain characteristics of the development context. (C) 2015 Elsevier B.V. All rights reserved.

关键词： automatic programming Methodologies programming paradigms Quality analysis and evaluation

来源：评论

学校读者我要写书评

暂无评论

Neural Network Approach to Program Synthesis for Tabular Transformation by Example

引用

IEEE ACCESS 2022年 10卷 24864-24876页

作者： Ujibashi, Yoshifumi Takasu, Atsuhiro Grad Univ Adv Studies SOKENDAI Dept Informat Hayama Kanagawa 2400193 Japan Fujitsu Ltd Nakahara Ku Kawasaki Kanagawa 2118588 Japan Natl Inst Informat Chiyoda Ku Tokyo 1018430 Japan

Data transformation is a laborious and time-consuming task for analysts. programming by example (PBE) is a technique that can simplify this difficult task for data analysts by automatically generating programs for data transformation. Most of the previously proposed PBE methods are based on search algorithms, but recent improvements in machine learning (ML) have led to its application in PBE research. For example, RobustFill was proposed as an ML-based PBE method for string transformation by using long short-term memory (LSTM) as the sequential encoder-decoder model. However, an ML-based PBE method has not been developed for tabular transformations, which are used frequently in data analysis. Thus, in the present study, we propose an ML-based PBE method for tabular transformations. First, we consider the features of tabular transformations, which are more complex and data intensive than string transformations, and propose a new ML-based PBE method using the state-of-the-art Transformer sequential encoder-decoder model. To our knowledge, this is the first ML-based PBE method for tabular transformations. We also propose two decoding methods comprising multistep beam search and program validation-beam search, which are optimized for program generation, and thus generate correct programs with higher accuracy. Our evaluation results demonstrated that the Transformer-based PBE model performed much better than LSTM-based PBE when applied to tabular transformations. Furthermore, the Transformer-based model with the proposed decoding method performed better than the conventional PBE model using the search-based method.

关键词： Task analysis Transformers Data integration Training Decoding Licenses Domain specific languages automatic programming beam search LSTM neural network programming by example program synthesis tabular data transformer

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：