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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

166 篇 会议
15 册 图书
5 篇 期刊文献

馆藏范围

186 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

129 篇 工学
- 119 篇 计算机科学与技术...
- 85 篇 软件工程
- 5 篇 电气工程
- 5 篇 信息与通信工程
- 5 篇 控制科学与工程
- 4 篇 电子科学与技术（可...
- 2 篇 农业工程
- 2 篇 生物医学工程（可授...
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 矿业工程
- 1 篇 石油与天然气工程
- 1 篇 生物工程
- 1 篇 网络空间安全
22 篇 理学
- 16 篇 数学
- 3 篇 系统科学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 化学
- 1 篇 生物学
15 篇 管理学
- 8 篇 图书情报与档案管...
- 5 篇 管理科学与工程(可...
- 4 篇 工商管理
- 1 篇 公共管理
2 篇 农学
- 2 篇 作物学
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 医学
- 1 篇 护理学（可授医学、...

主题

18 篇 computer languag...
12 篇 database languag...
12 篇 query languages
10 篇 logic programmin...
9 篇 database systems
9 篇 software enginee...
9 篇 artificial intel...
9 篇 functional progr...
8 篇 parallel program...
8 篇 computer program...
7 篇 xml
7 篇 programming lang...
6 篇 computer science
6 篇 software enginee...
6 篇 mathematical log...
6 篇 costs
6 篇 semantics
6 篇 computer program...
6 篇 relational datab...
6 篇 logics and meani...

机构

2 篇 univ valladolid ...
2 篇 carleton univ sc...
2 篇 imdea software
2 篇 department of co...
2 篇 tallinn universi...
2 篇 univ aarhus dept...
2 篇 univ calabria di...
2 篇 vienna univ tech...
1 篇 philipps univ ma...
1 篇 xian technol uni...
1 篇 ibm corp almaden...
1 篇 mechanical engin...
1 篇 university paris...
1 篇 department of in...
1 篇 epfl
1 篇 univ nottingham ...
1 篇 dept. of informa...
1 篇 university of te...
1 篇 department of co...
1 篇 the pennsylvania...

作者

3 篇 schwartzbach mic...
2 篇 bertossi leopold...
2 篇 chakravarty manu...
2 篇 zhao yidan
2 篇 krennwallner tho...
2 篇 moreton-fernande...
2 篇 van gucht dirk
2 篇 gonzalez-escriba...
2 篇 cozman fabio g.
2 篇 carro manuel
2 篇 eiter thomas
2 篇 moller anders
2 篇 ianni giovambatt...
2 篇 steffen bernhard
2 篇 xiao qinkun
2 篇 li kin fun
2 篇 schindlauer roma...
2 篇 brabrand claus
2 篇 hanus michael
2 篇 keller gabriele

语言

183 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=10th International Symposium on Database Programming Languages"

共 186 条记录，以下是111-120 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Query-Driven Program Testing

Query-Driven Program Testing

引用

10th international Conference on Verification, Model Checking and Abstract Interpretation

作者： Holzer, Andreas Schallhart, Christian Tautschnig, Michael Veith, Helmut Tech Univ Darmstadt FB Informat Formal Methods Syst Engn Darmstadt Germany

ISBN: (纸本)9783540938996

We present a new approach to program testing which enables the programmer to specify test suites in terms of a versatile query language. Our query language subsumes standard coverage criteria ranging from simple basic block coverage all the way to predicate complete coverage and multiple condition coverage, but also facilitates on-the-fly requests for test suites specific to the code structure, to external requirements, or to ad hoc needs arising in program understanding/exploration. the query language is supported by a model checking backend which employs the CBMC framework. Our main algorithmic contribution is a method called iterative constraint strengthening which enables us to solve a query for an arbitrary coverage criterion by a single call to the model checker and a novel form of incremental SAT solving: Whenever the SAT solver finds a solution, our algorithm compares this solution against the coverage criterion, and strengthens the clause database with additional clauses which exclude redundant new solutions. We demonstrate the scalability of our approach and its ability to compute compact test suites with experiments involving device drivers, automotive controllers, and open source projects.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Human motion retrieval based on feedback learning

Human motion retrieval based on feedback learning

引用

作者： Xiao, Qinkun Zhao, Yidan Li, Kin Fun Department of Electronic Information Engineering Xi'An Technological University Xi'an City710032 China Electrical and Computer Engineering University of Victoria Victoria CityV8W 2Y2 Canada

ISBN: (纸本)9781538636749

A novel content-based feedback learning motion retrieval approach is presented. the approach includes two primary stages. (1) In the learning stage, fuzzy clustering is first utilized to get the representative frames of motions, and the body gesture features are extracted to build a motion feature database. (2) In the motion retrieval stage, the query motion feature is extracted according to stage (1). Similarity measurements are then conducted by employing a novel method that combines Manhattan distance dynamic programming (MDP) and support vector machine (SVM) feedback learning. the retrieval results are ranked according to the feedback learning values. the effectiveness of the proposed method is verified experimentally. © 2017 IEEE.

关键词： Dynamic programming Feedback learning Manhattan distance Motion retrieval SVM

来源：评论

学校读者我要写书评

暂无评论

10th international symposium on Foundations of Information and Knowledge Systems, FoIKS 2018

10th International Symposium on Foundations of Information a...

引用

10th international symposium on Foundations of Information and Knowledge Systems, FoIKS 2018

ISBN: (纸本)9783319900490

the proceedings contain 21 papers. the special focus in this conference is on Foundations of Information and Knowledge Systems. the topics include: Probabilistic team semantics;strategic dialogical argumentation using multi-criteria decision making with application to epistemic and emotional aspects of arguments;first-order definable counting-only queries;the power of tarski’s relation algebra on trees;improving the performance of the k rare class nearest neighbor classifier by the ranking of point patterns;preference learning and optimization for partial lexicographic preference forests over combinatorial domains;enumeration complexity of poor man’s propositional dependence logic;refining semantic matching for job recruitment: An application of formal concept analysis;ontodebug: Interactive ontology debugging plug-in for protégé;concatenation, separation, and other properties of variably polyadic relations;a framework for comparing query languages in their ability to express boolean queries;a generalized iterative scaling algorithm for maximum entropy model computations respecting probabilistic independencies;compilation of conditional knowledge bases for computing C-inference relations;characterizing and computing causes for query answers in databases from database repairs and repair programs;inferences from attribute-disjoint and duplicate-preserving relational fragmentations;ASP programs with groundings of small treewidth;rationality and context in defeasible subsumption;haydi: Rapid prototyping and combinatorial objects;argumentation frameworks with recursive attacks and evidence-based supports.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parallel break construct, or how to kill an activity tree

Parallel break construct, or how to kill an activity tree

引用

Proceedings of the 1996 10th international Parallel Processing symposium

作者： Friedman, Yair I. Feitelson, Dror G. Exman, Iaakov Hebrew Univ Jerusalem Israel

Most parallel languages provide means to express parallelism, e.g. a parallel-do construct, but no means to terminate the parallel activities spawned by such constructs. We propose three high-level primitives for this purpose, which are defined by analogies with primitives that break out of sequential iterative constructs. the primitives are pcontinue, which terminates the calling activity, pbreak, which terminates all the activities in the construct that spawned the calling activity, and return, which terminates all the activities created in the current function call. these constructs are especially useful in search problems, where an activity that finds a solution can terminate other activities that are investigating inferior approaches. Given that parallel constructs can be nested, activities form a tree rooted at the original activity that started the program. the main challenge in implementing pbreak and return is identifying the subtree of activities that should be killed. three algorithms were designed and implemented, and experiments show that using these constructs can provide significant performance benefits.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Soya: A programming model and runtime environment for component composition using SSDL

Soya: A programming model and runtime environment for compon...

引用

10th international symposium on Component-Based Software Engineering

作者： Fornasier, Patric Webber, Jim Gorton, Ian Univ New S Wales Natl ICT Australia Sch Comp Sci & Engn Empir Software Engn Sydney NSW 2052 Australia Pacific NW Natl Lab Richland WA 99352 USA

ISBN: (纸本)9783540735502

the SOAP Service Description Language (SSDL) is a SOAP-centric language for describing Web Service contracts. SSDL focuses on message abstraction as the building block for creating service-oriented applications and provides an extensible range of protocol frameworks that can be used to describe and formally model component composition based on Web Service interactions. Given its novel approach, implementing support for SSDL contracts presents interesting challenges to middleware developers. At one end of the spectrum, programming abstractions that support message-oriented designs need to be created. At the other end, new functionality and semantics must be added to existing SOAP engines. In this paper we explain how component developers can create message-oriented Web Service interfaces with contemporary tool support (specifically the Windows Communication Foundation) using SSDL. We show how SSDL can be used as an alternative and powerful metadata language natively alongside existing tooling without imposing additional burdens on application developers. Moreover, we describe the design and architecture of the Soya middleware which supports SSDL-based development of Web Services on the WCF platform.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Automatic runtime calculation of communications for data-parallel expressions with periodic conditions

Automatic runtime calculation of communications for data-par...

引用

10th international symposium on High-Level Parallel programming and Applications (HLPP)

作者： Moreton-Fernandez, Ana Gonzalez-Escribano, Arturo Univ Valladolid Dept Informat Valladolid Spain

Many real-world applications feature data accesses on periodic domains. Manually implementing the synchronizations and communications associated to the data dependences on each case is cumbersome and error-prone. It is increasingly interesting to support these applications in high-level parallel programming languages or parallelizing compilers. In this paper, we present a technique that, for distributed-memory systems, calculates the specific communications derived from data-parallel codes with or without periodic boundary conditions on affine access expressions. It makes transparent to the programmer the management of aggregated communications for the chosen data partition. Our technique moves to runtime part of the compile-time analysis typically used to generate the communication code for affine expressions, introducing a complete new technique that also supports the periodic boundary conditions. We present an experimental study to evaluate our proposal using several study cases. Our experimental results show that our approach can automatically obtain communication codes as efficient as those found in MPI reference codes, reducing the development effort.

关键词： communications distributed memory parallel programming periodic boundary condition

来源：评论

学校读者我要写书评

暂无评论

NASA Formal Methods 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Aaron Dutle César Muñoz Anthony Narkawicz

ISBN: (数字)9783319779355

ISBN: (纸本)9783319779348

this book constitutes the proceedings of the 10th international symposium on NASA Formal Methods, NFM 2018, held in Newport News, VA, USA, in April 2018.;the 24 full and 7 short papers presented in this volume were carefully reviewed and selected from 92 submissions. the papers focus on formal techniques and other approaches for software assurance, their theory, current capabilities and limitations, as well as their potential application to aerospace, robotics, and other NASA-relevant safety-critical systems during all stages of the software life-cycle.

关键词： Software Engineering programming languages, Compilers, Interpreters Simulation and Modeling Artificial Intelligence theory of Computation System Performance and Evaluation

来源：评论

学校读者我要写书评

暂无评论

Automatic coding rule conformance checking using logic programming

Automatic coding rule conformance checking using logic progr...

引用

10th international symposium on Practical Aspects of Declarative languages, PADL 2008

作者： Marpons, Guillem Mariño, Julio Carro, Manuel Herranz, Ángel Moreno-Navarro, Juan José Fredlund, Lars-Åke Universidad Politécnica de Madrid IMDEA Software

ISBN: (纸本)3540774416

An extended practice in the realm of Software Engineering and programming in industry is the application of coding rules. Coding rules are customarily used to constrain the use (or abuse) of certain programming language constructions. However, these rules are usually written using natural language, which is intrinsically ambiguous and which may complicate their use and hinder their automatic enforcement. this paper presents some early work aiming at defining a framework to formalise and check for coding rule conformance using logic programming. We show how a certain class of rules - structural rules - can be reformulated as logic programs, which provides both a framework for formal specification and also for automatic conformance checking using a Prolog engine. Some examples of rules belonging to actual, third-party coding rule sets are discussed, along with the corresponding Prolog code. Experimental data regarding the practicality and impact of their application to real-life software projects is presented and discussed. © Springer-Verlag Berlin Heidelberg 2008.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Efficient bottom-up heap analysis for symbolic path-based data access summaries 12

Efficient bottom-up heap analysis for symbolic path-based da...

引用

10th international symposium on Code Generation and Optimization, CGO 2012

作者： Matosevic, Ivan Abdelrahman, Tarek S. Edwards S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto Toronto ON M5S3G4 Canada

ISBN: (纸本)9781605586359

We propose a heap analysis for extracting data access summaries based on symbolic access paths (SAPs) of methods in object-oriented languages. the analysis takes advantage of the insight that typical programs access dynamic data structures in regular manners. We combine this insight with a bottom-up approach that computes a local summary for each basic block, loop, and method in the program, which is then encapsulated into an abstract block in order to efficiently handle the higher levels of the analysis. We solve the problem of the dependence of local analysis results on the global heap aliasing by inferring the sets of aliases on which the correctness of the local results is predicated. Experimental evaluation for Java shows that for typical programs that use dynamic data structures, our analysis runs in a fast single pass and produces useful results. Copyright © 2012 ACM.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

FM 2009: Formal Methods 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Ana Cavalcanti Dennis R. Dams

ISBN: (数字)9783642050893

ISBN: (纸本)9783642050886

th FM 2009, the 16 international symposium on Formal Methods, marked the 10th an- versary of the First World Congress on Formal Methods that was held in 1999 in Toulouse, France. We wished to celebrate this by advertising and organizing FM 2009 as the Second World Congress in the FM series, aiming to once again bring together the formal methods communities from all over the world. the statistics displayed in the table on the next page include the number of countries represented by the Programme Committee members, as well as of the authors of submitted and accepted papers. Novel this year was a special track on tools and industrial applications. Subm- sions of papers on these topics were especially encouraged, but not given any special treatment. (It was just as hard to get a special track paper accepted as any other paper.) What we did promote, however, was a discussion of how originality, contri- tion, and soundness should be judged for these papers. the following questions were used by our Programme Committee.

关键词： Software Engineering Software Engineering/programming and Operating Systems User Interfaces and Human Computer Interaction Logics and Meanings of Programs programming languages, Compilers, Interpreters programming Techniques

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共19页 << < 8 9 10 11 12 13 14 15 16 17 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：