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

Relational Database to Resource Description Framework and Its Schema 1

1st International Conference on Intelligent Technologies and Applications (INTAP)

作者： Faheem, Muhammad Sattar, Hina Bajwa, Imran Sarwar Akbar, Wasif NCBA&E Lahore 54000 Pakistan Islamia Univ Bahawalpur Bahawalpur 63100 Pakistan

ISBN: (数字)9789811360527

ISBN: (纸本)9789811360527

A relational database is a digital collection of data constructed on data stored in relations. RDF (Resource Description Framework) is a standard exemplification for data substitution on the Web RDF Schema is a semantic addition of RDF. It renders the technique for narrating groups of allied resources. The direct mapping of RDF interprets the description of data in a relational database. It uses input data, schema and result in RDF graph, termed as direct graph. In this paper, online automatic conversion tool of RDB to RDF and RDFS is discussed. RDB to RDF and its schema is used to get relationships between tables using foreign keys and generate direct graph using data of RDB as input source. RDFS is a general-purpose language for demonstrating RDF. In RDFS, Object Oriented programming concepts are used to find Classes, Sub-Classes, Properties and SubProperties etc. to define relationships between the resources automatically.

关键词： Semantic web Relational database Resource Description Framework RDF schema Web Ontology Language automatic programming

来源：评论

学校读者我要写书评

暂无评论

Shellac: A Compiler Synthesizer for Concurrent Programs 1

引用

14th International Working Conference on Verified Software - Theories, Tools and Experiments (VSTTE)

作者： Chen, Christopher K. Seltzer, Margo I. Greenstreet, Mark R. Univ British Columbia Vancouver BC V6T 1Z4 Canada

ISBN: (数字)9783031258039

ISBN: (纸本)9783031258022;9783031258039

Formal specification languages such as TLA+ and unity are used to design and verify concurrent programs. These languages are intended for analysis rather than for execution. A compiler or a human must implement the specified program in a lower-level executable language. We present Shellac, a compiler synthesizer that completes a sketch of a syntax-directed compiler by using program synthesis to derive translation rules. This approach produces a correct-by-construction compiler without burdening the compiler writer with manual specification and verification. We evaluate Shellac by synthesizing a compiler from unity to Arduino C++ and Verilog, then compiling Paxos consensus in unity to implementations in Arduino C++ for microcontrollers and Verilog for reconfigurable hardware.

关键词： automatic programming Compilation Concurrency Formal models Program synthesis

来源：评论

学校读者我要写书评

暂无评论

Syntax-Guided Synthesis

Syntax-Guided Synthesis

引用

13th International Conference on Formal Methods in Computer-Aided Design (FMCAD)

作者： Alur, Rajeev Bodik, Rastislav Juniwal, Garvit Martin, Milo M. K. Raghothaman, Mukund Seshia, Sanjit A. Singh, Rishabh Solar-Lezama, Armando Torlak, Emina Udupa, Abhishek Univ Penn Philadelphia PA 19104 USA Univ Calif Berkeley Berkeley CA USA MIT Cambridge MA 02139 USA

ISBN: (纸本)9780983567837

The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program optimization illustrates many potential benefits of allowing the user to supplement the logical specification with a syntactic template that constrains the space of allowed implementations. Our goal is to identify the core computational problem common to these proposals in a logical framework. The input to the syntax-guided synthesis problem (SyGuS) consists of a background theory, a semantic correctness specification for the desired program given by a logical formula, and a syntactic set of candidate implementations given by a grammar. The computational problem then is to find an implementation from the set of candidate expressions so that it satisfies the specification in the given theory. We describe three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the synthesis problem, report on prototype implementations, and present experimental results on an initial set of benchmarks.

关键词： automatic programming computational linguistics formal specification program verification

来源：评论

学校读者我要写书评

暂无评论

Experimental results of pattern-based automatic program generator

Experimental results of pattern-based automatic program gene...

引用

Symposium on Applications and the Internet (SAINT 2002)

作者： Yoshida, M Sakamoto, M Oki Software Co. Ltd. Japan

ISBN: (纸本)0769514472

In this paper, we describe the pattern-based automatic program generator. The new approach that mitigates restrictions between general package approach and application-oriented approach in software development is described. It provides efficient solutions for developing application-oriented systems. Experimental results show that our approach results in significant improvement as compared to the traditional software development.

关键词： Application software Application specific processors automatic programming automatic testing Costs Logic Packaging programming profession Software packages Software systems

来源：评论

学校读者我要写书评

暂无评论

On the conversion of program specifications into pseudo code using Jackson structured programming

引用

Journal of Computing and Information Technology 2001年第1期9卷 71-80页

作者： Sörensen, Kenneth Vereist, Jan Department of Operations Research Logistics and Information Systems University of Antwerp - RUCA Middelheimlaan 1 AntwerpB-2020 Belgium

In this paper, we present a technique to automatically translate program specifications into pseudo code. This technique is developed in the context of the well-known programming method Jackson Structured programming (JSP). The objective of our research is to investigate to what extent a programming method can be automated. Current CASE tools are only able to automate programming methods to a very limited extent, whereas our technique automates the entire programming cycle by creating pseudo code from program specifications. We show that the JSP programming method can be transformed into a set of formal rules when the scope of the technique is limited to a well-defined area of problems. The rules are implemented in a CASE tool, called JSP tool, which is currently operative, although still in a prototyping phase. We believe that the strength of the CASE tool lies in the fact that it is able to automate the programming process completely, although its scope possibly is still rather limited. In this paper, the technique is explained by solving an example programming problem. The source language that has been developed to enter program specifications is briefly explained. Also, the differences between other JSP CASE tools and JSP tool are dealt with. Some additional features of the method are discussed and suggestions for future research are given.

关键词： automatic programming

来源：评论

学校读者我要写书评

暂无评论

Uncovering and Quantifying Social Biases in Code Generation 37

Uncovering and Quantifying Social Biases in Code Generation

引用

37th Conference on Neural Information Processing Systems (NeurIPS)

作者： Liu, Yan Chen, Xiaokang Gao, Yan Su, Zhe Zhang, Fengji Zan, Daoguang Lou, Jian-Guang Chen, Pin-Yu Ho, Tsung-Yi Microsoft Res New York NY USA Peking Univ Beijing Peoples R China Chinese Univ Hong Kong Hong Kong Peoples R China IBM Res Cambridge MA USA

ISBN: (纸本)9781713899921

With the popularity of automatic code generation tools, such as Copilot, the study of the potential hazards of these tools is gaining importance. In this work, we explore the social bias problem in pre-trained code generation models. We propose a new paradigm to construct code prompts and successfully uncover social biases in code generation models. To quantify the severity of social biases in generated code, we develop a dataset along with three metrics to evaluate the overall social bias and fine-grained unfairness across different demographics. Experimental results on three pre-trained code generation models (Codex, InCoder, and CodeGen) with varying sizes, reveal severe social biases. Moreover, we conduct analysis to provide useful insights for further choice of code generation models with low social bias(1).

关键词： automatic programming

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Approach of Defining the Secure Behavior of Automata Objects 17

Attribute-Based Approach of Defining the Secure Behavior of ...

引用

10th International Conference on Security of Information and Networks (SIN)

作者： Novikov, Fedor Fedorchenko, Ludmila Vorobiev, Vladimir Fatkieva, Roza Levonevskiy, Dmitriy SPbPU St Petersburg Russia SPIIRAS St Petersburg Russia

ISBN: (纸本)9781450353038

The article proposes an enhanced behavior model using graphs of state transitions. The properties and advantages of the proposed model are discussed, UML-based Cooperative Interaction of Automata Objects (CIAO) language is described, attribute approach on its parsing mechanism is introduced. The proposed model for describing behavior is aimed at achieving higher reliability and productivity indicators when designing the secure architecture and implementing reactive and distributed systems in comparison with traditional methods. A side-by-side goal is to create a convenient publication language for describing parallel algorithms and distributed reactive systems. The offered model has advantages under certain conditions in comparison with other models of behavior description in the field of the description of asynchronous distributed reacting systems.

关键词： secure behavior behavior model automatic programming parallel behavior the architecture of reacting systems security of distributed systems

来源：评论

学校读者我要写书评

暂无评论

Human Hand Motion Recognition Using Empirical Copula

Human Hand Motion Recognition Using Empirical Copula

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems

作者： Ju, Zhaojie Liu, Honghai Univ Portsmouth Intelligent Syst & Biomed Robot Grp Sch Creat Technol Portsmouth PO1 2DJ Hants England

ISBN: (纸本)9781424466757

programming by Demonstration (PbD) enables robotic hands to learn human manipulation skills through storing motion primitives and recognizing motion types. In this paper, Empirical Copula is introduced to recognize dynamic human hand motions for the first time using the proposed motion template and matching algorithm. The huge computational cost of Empirical Copula is alleviated by the proposed re-sampling processing. The experiments with human hand motions including grasps and in-hand manipulations demonstrate Empirical Copula outperforms the Time Clustering (TC) method, Gaussian Mixture Models (GMMs) and Hidden Markov Models (HMMs) in terms of recognition rate. In addition, Empirical Copula is also proved to be able to recognize different motions from different subjects.

关键词： Gaussian mixture model automatic programming empirical copula hidden Markov model hidden Markov models human hand motion recognition human manipulation skill matching algorithm motion estimation motion template programming by demonstration resampling processing

来源：评论

学校读者我要写书评

暂无评论

Unknown malicious codes detection based on rough set theory and support vector machine

Unknown malicious codes detection based on rough set theory ...

引用

IEEE International Joint Conference on Neural Network

作者： Zhang, Boyun Yin, Jianping Tang, Wensheng Hao, Jinbo Zhang, Dingxing Hunan Publ Secur Coll Dept Comp Sci Changsha 410138 Peoples R China Natl Univ Def Technol Sch Comp Sci Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9780780394902

For detecting malicious codes, a classification method of support vector machine (SVM) based on rough set theory(RST) is proposed. The original sample data is preprocessed with the knowledge reduction algorithm of RST, and the redundant features and conflicting samples are eliminated from the working sample dataset to reduce space dimension of sample data. Then the preprocessed sample data is used as training sample data of SVM. By utilizing SVM, the generalizing ability of detection system is still good even the sample dataset size is small. Experiment results show that the proposed detection system needs few priori knowledge and can improve the training speed and precision of classification.

关键词： automatic programming

来源：评论

学校读者我要写书评

暂无评论

Standard exemplars for autonomic computing concepts

Standard exemplars for autonomic computing concepts

引用

3rd IEEE International Workshop on Engineering of Autonomic and Autonomous Systems

作者： Bustard, D Hassan, S McSherry, D Walmsey, S Univ Ulster Sch Comp & Informat Engn Coleraine BT52 1SA Londonderry North Ireland

ISBN: (纸本)076952544X

Illustrations are general aids to communication, with those that are particularly effective becoming standard exemplars. For instance, in the computing domain, frequent reference is made to lift controllers, automated bank teller machines, and car parks. So far, there are few equivalent illustrations for autonomic systems. The purpose of this paper is to clarify the requirements for standard exemplars, propose one for consideration, and assess it against the criteria identified The exemplar described, an autonomic printing service, aims to be simple, informative, rich, general, engaging and plausible.

关键词： automatic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：