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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

983 篇 会议
37 篇 期刊文献
25 册 图书

馆藏范围

1,043 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

704 篇 工学
- 585 篇 计算机科学与技术...
- 368 篇 软件工程
- 146 篇 电气工程
- 56 篇 控制科学与工程
- 30 篇 信息与通信工程
- 27 篇 材料科学与工程（可...
- 19 篇 电子科学与技术（可...
- 16 篇 机械工程
- 11 篇 动力工程及工程热...
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 7 篇 仪器科学与技术
- 7 篇 石油与天然气工程
- 6 篇 城乡规划学
- 4 篇 核科学与技术
- 4 篇 农业工程
188 篇 理学
- 155 篇 数学
- 18 篇 系统科学
- 17 篇 物理学
- 12 篇 统计学（可授理学、...
- 10 篇 生物学
69 篇 管理学
- 53 篇 管理科学与工程(可...
- 22 篇 工商管理
- 19 篇 图书情报与档案管...
16 篇 教育学
- 16 篇 教育学
11 篇 文学
- 11 篇 新闻传播学
9 篇 法学
- 8 篇 社会学
6 篇 医学
- 4 篇 基础医学(可授医学...
4 篇 农学
- 4 篇 作物学
3 篇 经济学
- 3 篇 应用经济学
1 篇 军事学

主题

96 篇 logic gates
77 篇 programming
63 篇 logic programmin...
40 篇 fuzzy logic
35 篇 application soft...
30 篇 probabilistic lo...
29 篇 linear programmi...
27 篇 programming prof...
27 篇 computer archite...
26 篇 computer science
26 篇 dynamic programm...
23 篇 software enginee...
23 篇 protocols
21 篇 uncertainty
20 篇 object oriented ...
20 篇 java
20 篇 semantics
18 篇 computer circuit...
18 篇 costs
17 篇 software systems

机构

4 篇 univ potsdam pot...
4 篇 vienna univ tech...
4 篇 imdea software i...
4 篇 institute for lo...
3 篇 tu wien austria
3 篇 graduate school ...
3 篇 univ calabria de...
3 篇 carnegie mellon ...
3 篇 univ freiburg fr...
3 篇 univ british col...
3 篇 imperial coll lo...
3 篇 department of in...
2 篇 univ tecn federi...
2 篇 ist austria klos...
2 篇 univ savoie savo...
2 篇 tel aviv univers...
2 篇 zhongguancun lab...
2 篇 univ ferrara dip...
2 篇 south china univ...
2 篇 univ neuchatel i...

作者

8 篇 alviano mario
6 篇 lamma evelina
5 篇 schaub torsten
4 篇 riguzzi fabrizio
3 篇 lin yu
3 篇 vardi moshe y.
3 篇 gebser martin
3 篇 bellodi elena
3 篇 costa vitor sant...
3 篇 shinji sakamoto
3 篇 lakemeyer gerhar...
3 篇 ikeda markus
3 篇 zhou neng-fa
3 篇 xu hongxiang
3 篇 sabuncu orkunt
3 篇 leonard barolli
3 篇 schockaert steve...
3 篇 pichler andreas
3 篇 wang bin
3 篇 de givry simon

语言

1,013 篇 英文
25 篇 其他
8 篇 中文
1 篇 法文

检索条件"任意字段=30th International Conference on Logic Programming"

共 1045 条记录，以下是561-570 订阅

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

详细简洁

排序：

Study and Refactoring of Android Asynchronous programming 15

Study and Refactoring of Android Asynchronous Programming

引用

30th IEEE/ACM international conference on Automated Software Engineering Workshops (ASEW)

作者： Lin, Yu Okur, Semih Dig, Danny Univ Illinois Dept Comp Sci 1304 W Springfield Ave Urbana IL 61801 USA Oregon State Univ Sch Elect Engn & Comp Sci Corvallis OR 97331 USA

ISBN: (纸本)9781509000258

To avoid unresponsiveness, a core part of mobile development is asynchronous programming. Android provides several async constructs that developers can use. However, developers can still use the inappropriate async constructs, which result in memory leaks, lost results, and wasted energy. Fortunately, refactoring tools can eliminate these problems by transforming async code to use the appropriate constructs. In this paper we conducted a formative study on a corpus of 611 widely-used Android apps to map the asynchronous landscape of Android apps, understand how developers retrofit asynchrony, and learn about barriers encountered by developers. Based on this study, we designed, implemented, and evaluated ASYNCDROID, a refactoring tool which enables Android developers to transform existing improperly-used async constructs into correct constructs. Our empirical evaluation shows that ASYNCDROID is applicable, accurate, and saves developers effort. We submitted 45 refactoring patches, and developers consider that the refactorings are useful.

关键词： Androids Humanoid robots Graphical user interfaces Receivers programming Registers Transforms

来源：评论

学校读者我要写书评

暂无评论

Mutation-Based Fault Localization for Real-World Multilingual Programs 15

Mutation-Based Fault Localization for Real-World Multilingua...

引用

30th IEEE/ACM international conference on Automated Software Engineering Workshops (ASEW)

作者： Hong, Shin Lee, Byeongcheol Kwak, Taehoon Jeon, Yiru Ko, Bongsuk Kim, Yunho Kim, Moonzoo Korea Adv Inst Sci & Technol Daejeon South Korea

ISBN: (纸本)9781509000258

Programmers maintain and evolve their software in a variety of programming languages to take advantage of various control/data abstractions and legacy libraries. the programming language ecosystem has diversified over the last few decades, and non-trivial programs are likely to be written in more than a single language. Unfortunately, language interfaces such as Java Native Interface and Python/C are difficult to use correctly and the scope of fault localization goes beyond language boundaries, which makes debugging multilingual bugs challenging. To overcome the aforementioned limitations, we propose a mutation-based fault localization technique for real-world multilingual programs. To improve the accuracy of locating multilingual bugs, we have developed and applied new mutation operators as well as conventional mutation operators. the results of the empirical evaluation for six non-trivial real-world multilingual bugs are promising in that the proposed technique identifies the buggy statements as the most suspicious statements for all six bugs.

关键词： Computer bugs Debugging Java Safety Testing Libraries programming

来源：评论

学校读者我要写书评

暂无评论

Detecting Broken Pointcuts Using Structural Commonality and Degree of Interest 15

Detecting Broken Pointcuts Using Structural Commonality and ...

引用

30th IEEE/ACM international conference on Automated Software Engineering Workshops (ASEW)

作者： Khatchadourian, Raffi Rashid, Awais Masuhara, Hidehiko Watanabe, Takuya CUNY New York NY 10017 USA Univ Lancaster Lancaster LA1 4YW England Tokyo Inst Technol Tokyo Japan Edirium KK Tokyo Japan

ISBN: (纸本)9781509000258

Pointcut fragility is a well-documented problem in Aspect-Oriented programming;changes to the base-code can lead to join points incorrectly falling in or out of the scope of pointcuts. Deciding which pointcuts have broken due to base-code changes is a daunting venture, especially in large and complex systems. We present an automated approach that recommends pointcuts that are likely to require modification due to a particular base-code change, as well as ones that do not. Our hypothesis is that join points selected by a pointcut exhibit common structural characteristics. Patterns describing such commonality are used to recommend pointcuts that have potentially broken to the developer. the approach is implemented as an extension to the popular Mylyn Eclipse IDE plug-in, which maintains focused contexts of entities relevant to the task at hand using a Degree of Interest (DOI) model.

关键词： Context Software programming Complex systems Java Software engineering Cities and towns

来源：评论

学校读者我要写书评

暂无评论

Refactorings for Android Asynchronous programming 15

Refactorings for Android Asynchronous Programming

引用

30th IEEE/ACM international conference on Automated Software Engineering Workshops (ASEW)

作者： Lin, Yu Dig, Danny Univ Illinois Dept Comp Sci 1304 W Springfield Ave Urbana IL 61801 USA Oregon State Univ Sch Elect Engn & Comp Sci Corvallis OR 97331 USA

ISBN: (纸本)9781509000258

Running compute-intensive or blocking I/O operations in the UI event thread of smartphone apps can severely degrade responsiveness. Despite the fact that Android provides several async constructs that developers can use, developers can still miss opportunities to encapsulate long-running operations in async constructs. On the other hand, they can use the inappropriate async constructs, which result in memory leaks, lost results, and wasted energy. Fortunately, refactoring tools can eliminate these problems by retrofitting asynchrony to sequential code and transforming async code to use the appropriate constructs. this demo presents two refactoring tools for Android apps: (i) ASYNCHRONIZER, a refactoring tool that enables developers to extract long-running operations into Android AsyncTask. (ii) ASYNCDROID, a refactoring tool which enables developers to transform existing improperly-used AsyncTask into Android IntentService.

关键词： Androids Humanoid robots Graphical user interfaces Instruction sets Message systems programming Safety

来源：评论

学校读者我要写书评

暂无评论

LED: Tool for Synthesizing Web Element Locators 15

LED: Tool for Synthesizing Web Element Locators

引用

30th IEEE/ACM international conference on Automated Software Engineering Workshops (ASEW)

作者： Bajaj, Kartik Pattabiraman, Karthik Mesbah, Ali Univ British Columbia Vancouver BC Canada

ISBN: (纸本)9781509000258

Web applications are growing fast in popularity and complexity. One of the major problems faced by web developers is writing JavaScript code that can retrieve Document Object Model (DOM) tree elements, and is consistent among multiple DOM states. We attempt to solve this problem by automatically synthesizing JavaScript code that interacts with the DOM. We present an automated tool called LED, to analyze the DOM elements, and synthesize code to select the DOM elements based on the DOM hierarchy as well as the nature of task that the user wants to perform. LED provides an interactive drag and drop support inside the browser for selecting positive and negative examples of DOM elements. We find that LED supports at least 86% of the locators used in the JavaScript code of deployed web applications, and that the locators synthesized by LED have a recall of 98% and a precision of 63%. LED is fast, taking only 0.23 seconds on average to synthesize a locator.

关键词： Program synthesis programming by example Element locators CSS selectors Web applications

来源：评论

学校读者我要写书评

暂无评论

Efficiency Improvement of Induction Motor using Fuzzy-Genetic Algorithm 30

Efficiency Improvement of Induction Motor using Fuzzy-Geneti...

引用

30th international Power System conference (PSC)

作者： Hesari, Sadegh Sistani, Mohammad Bagher Naghibi Amirkabir Univ Technol Tehran Iran Ferdowsi Univ Mashhad Elect Engn Mashhad Iran

ISBN: (纸本)9781509027057

In most industrial zones, electric energy is one of the most important energy sources. Since electrical motors are the main energy consumers of industrial factories, consumption optimization in these motors can be considered as a main option related to energy saving. One very effective way to reduce the consumption of these equipment is to use a motor speed controllers or drives. Since the loss of inductive motor has a direct relationship with motor flux, in this paper, the rotor flux vector control has been used. Due to the strength of fuzzy controllers in load failure and noise generation states, this controller has been used to adjust the drive speed. Two fuzzy logic inputs including speed error and speed variation derivative, and a fuzzy output, motor reference torque (Te*) are estimated. the genetic optimization algorithm has been used in order to improve the Efficiency and reduce the losses. As such, the drive performance in GA and Fuzzy-Genetic (FG) states is reviewed and the simulation results are presented. Finally, the obtained results in this paper have been compared to the results of FOC inductive motor with PI controller and without optimization. It can be seen that when FG method is employed, the results show a higher performance and losses are reduced up to almost 40 to 50% in different loads, and the amount of input power is also reduced up to approximately 30%.

关键词： induction motor Loss Minimization genetic algorithm fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

Energy Scheduling in Power Market under Stochastic Dependence Structure 30

Energy Scheduling in Power Market under Stochastic Dependenc...

引用

30th international Power System conference (PSC)

作者： Farhadkhani, Mehdi NRI Elect Econ & Energy Res Grp Tehran Iran

ISBN: (纸本)9781509027057

Since the emergence of power market, the target of power generating utilities has mainly switched from cost minimization to revenue maximization. they dispatch their power energy generation units in the uncertain environment of power market. As a result, multi-stage stochastic programming has been applied widely by many power generating agents as a suitable tool for dealing with self-scheduling strategies under uncertainty. However, dependence structure between stochastic variables has been almost ignored in the literature. Copula function is a new concept in the probability and statistics field which has the capability to represent the dependence structure among stochastic variables. However, Copula function has recently taken into account in power system studies by some articles. In this article, self-scheduling strategy of a generation utility owning thermal units is investigated while the dependence structure among stochastic load and market price variables is taking into account. We assume that the generation utility is a price-taker agent in a power market, and it also has to meet the load of a specific region as a retailer. the results indicates that as the stochastic dependence structure among load and price variables is considered in modeling load and price scenarios, the output of unit commitment problem changes so that the revenue of generation utility increases.

关键词： Unit Commitment Stochastic Dependence Structure Multistage Stochastic programming Scenario Tree Construction Copula Function

来源：评论

学校读者我要写书评

暂无评论

Fast and Precise Symbolic Analysis of Concurrency Bugs in Device Drivers 15

Fast and Precise Symbolic Analysis of Concurrency Bugs in De...

引用

30th IEEE/ACM international conference on Automated Software Engineering Workshops (ASEW)

作者： Deligiannis, Pantazis Donaldson, Alastair F. Rakamaric, Zvonimir Imperial Coll London Dept Comp London England Univ Utah Sch Comp Salt Lake City UT 84112 USA

ISBN: (纸本)9781509000258

Concurrency errors, such as data races, make device drivers notoriously hard to develop and debug without automated tool support. We present WHOOP, a new automated approach that statically analyzes drivers for data races. WHOOP is empowered by symbolic pairwise lockset analysis, a novel analysis that can soundly detect all potential races in a driver. Our analysis avoids reasoning about thread interleavings and thus scales well. Exploiting the race-freedom guarantees provided by WHOOP, we achieve a sound partial-order reduction that significantly accelerates CORRAL, an industrial-strength bug-finder for concurrent programs. Using the combination of WHOOP and CORRAL, we analyzed 16 drivers from the Linux 4.0 kernel, achieving 1.5-20 x speedups over standalone CORRAL.

关键词： Concurrent computing programming Linux Computer bugs Kernel Instruction sets Context

来源：评论

学校读者我要写书评

暂无评论

Abductive logic programming for datalog± ontologies 30

Abductive logic programming for datalog± ontologies

引用

30th Italian conference on Computational logic, CILC 2015

作者： Gavanelli, Marco Lamma, Evelina Riguzzi, Fabrizio Bellodi, Elena Zese, Riccardo Cota, Giuseppe Dipartimento di Ingegneria University of Ferrara Italy Dipartimento di Matematica e Informatica University of Ferrara Via Saragat 1 FerraraI-44122 Italy

Ontologies are a fundamental component of the Semantic Web since they provide a formal and machine manipulable model of a domain. Description logics (DLs) are often the languages of choice for modeling ontologies. Great effort has been spent in identifying decidable or even tractable fragments of DLs. Conversely, for knowledge representation and reasoning, integration with rules and rule-based reasoning is crucial in the so-called Semantic Web stack vision. Datalog± is an extension of Datalog which can be used for representing lightweight ontologies, and is able to express the DL-Lite family of ontology languages, with tractable query answering under certain language restrictions. In this work, we show that Abductive logic programming (ALP) is also a suitable framework for representing Datalog± ontologies, supporting query answering through an abductive proof procedure, and smoothly achieving the integration of ontologies and rule-based reasoning. In particular, we consider an Abductive logic programming framework named SCIFF and derived from the IFF abductive framework, able to deal with existentially (and universally) quantified variables in rule heads, and Constraint logic programming constraints. Forward and backward reasoning is naturally supported in the ALP framework. the SCIFF language smoothly supports the integration of rules, expressed in a logic programming language, with Datalog± ontologies, mapped into SCIFF (forward) integrity constraints. the main advantage is that this integration is achieved within a single language, grounded on abduction in computational logic.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

Have We Seen Enough Traces? 15

Have We Seen Enough Traces?

引用

30th IEEE/ACM international conference on Automated Software Engineering Workshops (ASEW)

作者： Cohen, Hila Maoz, Shahar Tel Aviv Univ Sch Comp Sci IL-69978 Tel Aviv Israel

ISBN: (纸本)9781509000258

Dynamic specification mining extracts candidate specifications from logs of execution traces. Existing algorithms differ in the kinds of traces they take as input and in the kinds of candidate specification they present as output. One challenge common to all approaches relates to the faithfulness of the mining results: how can we be confident that the extracted specifications faithfully characterize the program we investigate? Since producing and analyzing traces is costly, how would we know we have seen enough traces? And, how would we know we have not wasted resources and seen too many of them? In this paper we address these important questions by presenting a novel, black box, probabilistic framework based on a notion of log completeness, and by applying it to three different well-known specification mining algorithms from the literature: k-Tails, Synoptic, and mining of scenario-based triggers and effects. Extensive evaluation over 24 models taken from 9 different sources shows the soundness, generalizability, and usefulness of the framework and its contribution to the state-of-the-art in dynamic specification mining.

关键词： Heuristic algorithms Computational modeling Data mining Estimation Probabilistic logic Adaptation models Servers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共105页 << < 53 54 55 56 57 58 59 60 61 62 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：