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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,958 篇 会议
98 篇 期刊文献
84 册 图书
2 篇 学位论文

馆藏范围

3,140 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

1,939 篇 工学
- 1,461 篇 计算机科学与技术...
- 826 篇 软件工程
- 383 篇 电气工程
- 259 篇 控制科学与工程
- 105 篇 信息与通信工程
- 59 篇 机械工程
- 57 篇 交通运输工程
- 47 篇 电子科学与技术（可...
- 38 篇 石油与天然气工程
- 33 篇 核科学与技术
- 31 篇 材料科学与工程（可...
- 26 篇 生物工程
- 24 篇 生物医学工程（可授...
- 22 篇 动力工程及工程热...
- 20 篇 仪器科学与技术
- 20 篇 土木工程
- 15 篇 建筑学
520 篇 理学
- 370 篇 数学
- 85 篇 物理学
- 62 篇 系统科学
- 57 篇 统计学（可授理学、...
- 44 篇 生物学
214 篇 管理学
- 178 篇 管理科学与工程(可...
- 64 篇 工商管理
- 45 篇 图书情报与档案管...
77 篇 医学
- 68 篇 临床医学
- 46 篇 特种医学
- 15 篇 基础医学(可授医学...
48 篇 教育学
- 46 篇 教育学
32 篇 法学
- 27 篇 社会学
16 篇 经济学
8 篇 农学
6 篇 文学
5 篇 艺术学
3 篇 哲学
1 篇 军事学

主题

274 篇 logic gates
236 篇 fuzzy logic
172 篇 probabilistic lo...
155 篇 programming
139 篇 linear programmi...
110 篇 logic programmin...
89 篇 dynamic programm...
86 篇 optimization
71 篇 computer science
69 篇 programming prof...
69 篇 computational mo...
68 篇 artificial intel...
67 篇 mathematical mod...
58 篇 integer programm...
58 篇 uncertainty
56 篇 software enginee...
54 篇 semantics
50 篇 computer archite...
50 篇 logic
44 篇 genetic programm...

机构

8 篇 university of mi...
6 篇 hitachi ltd hita...
6 篇 st petersburg el...
5 篇 inria
5 篇 kyushu sangyo un...
5 篇 myongji universi...
5 篇 saint petersburg...
5 篇 univ illinois ur...
5 篇 politecnico di b...
5 篇 monash universit...
5 篇 university of pe...
5 篇 carnegie mellon ...
5 篇 polytechnic univ...
5 篇 university of ba...
5 篇 covenant univers...
5 篇 univ illinois de...
4 篇 ist austria klos...
4 篇 graduate school ...
4 篇 institute of mic...
4 篇 school of electr...

作者

6 篇 kitamura m
6 篇 woltran stefan
6 篇 eiter thomas
6 篇 kakugawa s
5 篇 bernady o. apduh...
5 篇 ana maria a.c. r...
5 篇 eufemia tarantin...
5 篇 osvaldo gervasi
5 篇 yeonseung ryu
5 篇 beniamino murgan...
5 篇 sanjay misra
5 篇 inoue katsumi
5 篇 david taniar
5 篇 carmelo m. torre
5 篇 elena stankova
4 篇 schaub torsten
4 篇 belta calin
4 篇 leonard barolli
4 篇 hino n
4 篇 castillo oscar

语言

3,078 篇 英文
47 篇 其他
18 篇 中文
3 篇 葡萄牙文
2 篇 法文
1 篇 俄文

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

共 3142 条记录，以下是2481-2490 订阅

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

详细简洁

排序：

Fast Support Vector Machine Classification using linear SVMs

Fast Support Vector Machine Classification using linear SVMs

引用

international conference on Pattern Recognition

作者： K.Z. Arreola J. Fehr H. Burkhardt LITIS INSA Rouen Saint Etienne du Rouvray France Chair of Pattern Recognition and Image Processing University of Freiburg Freiburg im Breisgau Germany

We propose a classification method based on a decision tree whose nodes consist of linear support vector machines (SVMs). Each node defines a decision hyperplane that classifies part of the feature space. For large classification problems (with many support vectors (SVs)) it has the advantage that the classification time does not depend on the number of SVs. Here, the classification of a new sample can be calculated by the dot product with the orthogonal vector of each hyperplane. the number of nodes in the tree has shown to be much smaller than the number of SVs in a non-linear SVM, thus, a significant speedup in classification time can be achieved. For non-linear separable problems, the trivial solution (zero vector) of a linear SVM is analyzed and a new formulation of the optimization problem is given to avoid it

关键词： Support vector machine classification Support vector machines Classification tree analysis Decision trees Pattern recognition Image processing Kernel Quadratic programming Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

Learning Policies for Efficiently Identifying Objects of Many Classes

Learning Policies for Efficiently Identifying Objects of Man...

引用

international conference on Pattern Recognition

作者： R. Greiner A. Elgammal R. Isukapalli Lucent Technol. Bell Labs. Innovations Whippany NJ

Viola and Jones (VJ) cascade classification methods have proven to be very successful in detecting objects belonging to a single class - e.g., faces. this paper addresses the more challenging "many class detection" problem: detecting and identifying objects that belong to any of a set of classes. We use a set of learned weights (corresponding to the parameters of a set of binary linear separators) to identify these objects. We show that objects within many real-world classes tend to form clusters in this induced "classifier space". As the results of a sequence of classifiers can suggest a possible label for each object, we formulate this task as a Markov decision process. Our system first uses a "decision tree classifier" (i.e., a policy produced using dynamic programming) to specify when to apply which classifier to produce a possible class label for each sub-image W of a test image. It then uses a cascade of classifiers, specific to each "leaf" in this tree, to confirm that W is an instance of the proposed class. We present empirical evidence to verify that our ideas work effectively: showing that our system is essentially as accurate as running a set of cascade classifiers, but is much faster than that approach

关键词： Face detection Object detection Classification tree analysis Particle separators Technological innovation Dynamic programming System testing Image databases Spatial databases Training data

来源：评论

学校读者我要写书评

暂无评论

Machine Learning in Value-Based Software Test Data Generation

Machine Learning in Value-Based Software Test Data Generatio...

引用

international conference on Tools for Artificial Intelligence (ICTAI)

作者： Du Zhang Department of Computer Science California State University Sacramento CA USA

Software engineering research and practice thus far are primarily conducted in a value-neutral setting where each artifact in software development such as requirement, use case, test case, and defect, is treated as equally important during a software system development process. there are a number of shortcomings of such value-neutral software engineering. Value-based software engineering is to integrate value considerations into the full range of existing and emerging software engineering principles and practices. Machine learning has been playing an increasingly important role in helping develop and maintain large and complex software systems. However, machine learning applications to software engineering have been largely confined to the value-neutral software engineering setting. In this paper, we advocate a shift to applying machine learning methods to value-based software engineering. We propose a framework for value-based software test data generation. the proposed framework incorporates some general principles in value-based software testing and can help improve return on investment

关键词： Machine learning Software testing Software engineering programming Software systems Application software Engineering management System testing Genetic algorithms Knowledge management

来源：评论

学校读者我要写书评

暂无评论

Semantic Understanding of Continued and Recursive Human Activities

Semantic Understanding of Continued and Recursive Human Acti...

引用

international conference on Pattern Recognition

作者： M.S. Ryoo J.K. Aggarwal Computer and Vision Research Center Department of ECE University of Texas Austin Austin TX USA

ISBN: (纸本)0769525210

this paper presents a methodology for semantic understanding of complex and continued human activities. A context-free grammar (CFG) based representation scheme developed earlier is extended to construct a description for continued and recursive human activities. New system recognizes recursively described high-level interactions: fighting and greeting. the system understands activities by detecting the time intervals that satisfy their semantic descriptions

关键词： Humans Computer vision logic Punching Application software Surveillance Airports Patient monitoring Computerized monitoring Senior citizens

来源：评论

学校读者我要写书评

暂无评论

Automated AI Planning and Code Pattern Based Code Synthesis

Automated AI Planning and Code Pattern Based Code Synthesis

引用

international conference on Tools for Artificial Intelligence (ICTAI)

作者： Jicheng Fu Farokh B. Bastani I-ling Yen Department of Computer Science University of Texas Dallas USA

the past decade has seen great progress in the development of embedded real-time systems, which are playing increasingly important roles in various application domains. However, the growing complexity of these systems has revealed the urgent need to develop advanced techniques to reduce the time-to-market as well as the overall system development cost. One method for achieving both of these goals is automated code synthesis combined with component based software development (CBSD). this enables the synthesizer to focus on generating the glue code needed to assemble an application from existing components. the main challenge is how to enable the synthesizer to recognize and generate complex conditional or loop statements. In this paper, a pattern-based code synthesis approach is enhanced to enable it to synthesize new loop statements. Specifically, we use an extended version of Graphplan to help the synthesizer to recognize and generate new loop statements. the paper proposes a planning domain model for code patterns and an automated code synthesis system, which integrates the enhanced AI planner with the code pattern integration system (CPIS) to fully automate the code synthesis process

关键词： Artificial intelligence Application software Real time systems Synthesizers Costs programming Power generation Computer science Time to market Assembly

来源：评论

学校读者我要写书评

暂无评论

A Robust and Accurate Segmentation of Iris Images Using Optimal Partitioning

A Robust and Accurate Segmentation of Iris Images Using Opti...

引用

international conference on Pattern Recognition

作者： A. Zaim M. Quweider J. Scargle J. Iglesias R. Tang Visualization Image Processing and Bioinformatics Research Group CS/CIS Department University of Technology Brownsville TX USA Spase Science Division NASA Ames Research Center Moffett Field CA USA

An effective and accurate identification of human individuals from their iris features is largely dependent on proper segmentation of the iris and the pupil features from camera images. Most modern segmentation schemes exploit the circular geometry of the iris to fit a circle or an ellipse to an edge map of the iris. In this paper, we present a new method for automatically localizing and segmenting iris features by optimal partitioning using the relative distribution of gray-level intensities across an image. First, the eye images are unrolled after detecting the center of the pupil from the image local minima. For each radial sample, segments corresponding to regions that are statistically different are computed using dynamic programming applied to a Poisson-based cost function. the results are a set of change points marking the edges of different features including those of the pupil and the iris. the radius of the pupil and the iris are then obtained by searching for the best fit of two lines connecting the detected edge points. the proposed method is superior to other methods in that artifacts such as excessive or weak illumination, blurring and occlusion by eyelids do not interfere with the segmentation process. Moreover, our algorithm is also robust and accurate even in the presence of eyewear such as glasses. Applying this method to 122 images revealed a 98% segmentation accuracy. the algorithm has been shown to be effective in images with large field of view containing other facial features

关键词： Robustness Image segmentation Iris Image edge detection Humans Cameras Geometry Dynamic programming Cost function Joining processes

来源：评论

学校读者我要写书评

暂无评论

ACache: Using Caching to Improve the Performance of Multiple Sequence Alignments

ACache: Using Caching to Improve the Performance of Multiple...

引用

international Working conference on Scientific and Statistical Database Management

作者： Xun Tu K.T. Claypool C.X. Chen Computer Science Department University of Massachusetts Lowell Lowell MA USA

Multiple sequence alignment represents a class of powerful bioinformatics tools with many uses in computational biology ranging from discovery of characteristic motifs and conserved regions in protein families to improved prediction of secondary and tertiary structure. Today, with rapidly growing data repositories offering scientists significantly more data with which to make better decisions, it is increasingly important to run these multiple alignment calculations as rapidly as possible. However, while several multiple alignment algorithms have been developed, these algorithms remain computationally expensive taking as long as 2 to 3 days for some queries. In this paper, we propose a new caching technique to improve the performance of multiple sequence alignment algorithms. In particular, we propose a nested two level cache hierarchy that provides caching of pairwise alignment results - a computationally expensive subcomponent of the multiple sequence alignment algorithms. A key contribution of our work is the development of two novel cache replacement policies that closely track the scientist's query patterns over time. We present experimental results that validate the benefits of caching over the repeated computation of the alignments, provide heuristics for determining which alignments would benefit from the caching, and show the effectiveness of the developed cache replacement policies

关键词： Sequences Bioinformatics Databases Computer science Computational biology Biology computing Protein engineering Genomics Dynamic programming Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

18th international conference on logic programming, ICLP 2002

引用

18th international conference on logic programming, ICLP 2002

ISBN: (纸本)3540439307

the proceedings contain 44 papers. the special focus in this conference is on logic programming. the topics include: Representing arithmetic constraints with finite automata;logic databases on the semantic web;an abductive approach for analysing event-based requirements specifications;trailing analysis for HAL;access control for deductive databases by logic programming;reasoning about actions with CHRs and finite domain constraints;using hybrid concurrent constraint programming to model dynamic biological systems;efficient real-time model checking using tabled logic programming and constraints;constraint-based infinite model checking and tabulation for stratified CLP;a model theoretic semantics for multi-level secure deductive databases;propagation completeness of reactive constraints;on enabling the WAM with region support;a different look at garbage collection for the WAM;logical algorithms;learning in logic with richprolog;towards a declarative query and transformation language for XML and semistructured data;a proof-theoretic foundation for tabled higher-order logic programming;proving the equivalence of CLP programs;a purely logical account of sequentiality in proof search;disjunctive explanations;computing stable models;towards local search for answer sets;a rewriting method for well-founded semantics with explicit negation;embedding defeasible logic into logic programs;a polynomial translation of logic programs with nested expressions into disjunctive logic programs;using logic programming to detect activities in pervasive healthcare;logic programming for software engineering;a logic-based system for application integration;the limits of horn logic programs and multi-adjoint logic programming.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Solving alternating Boolean equation systems in answer set programming

引用

15th international conference on Applications of Declarative programming and Knowledge Management (INAP 2004)/18th Workshop on logic programming (WLP 2004)

作者： Keinänen, M Niemelä, I Helsinki Univ Technol Lab Theoret Comp Sci Dept Comp Sci & Engn FI-02015 Helsinki Finland

ISBN: (纸本)3540255605

In this paper we apply answer set programming to solve alternating Boolean equation systems. We develop a novel characterization of solutions for variables in disjunctive and conjunctive Boolean equation systems. Based on this we devise a mapping from Boolean equation systems with alternating fixed points to normal logic programs such that the solution of a given variable of an equation system can be determined by the existence of a stable model of the corresponding logic program. the technique can be used to model check alternating formulas of modal mu-calculus.

关键词： Boolean algebra

来源：评论

学校读者我要写书评

暂无评论

Variable input delay CMOS logic for low power design

Variable input delay CMOS logic for low power design

引用

18th international conference on VLSI Design/4th international conference on Embedded Systems Design

作者： Raja, T Agrawal, VD Bushnell, ML Transmeta Corp Santa Clara CA 95054 USA

ISBN: (纸本)0769522645

Modern digital circuits consist of logic gates implemented in the complementary metal oxide semiconductor (C-MOS) technology. the time taken for a logic gate output to change after one or more inputs have changed is called the delay of the gate. A conventional CMOS gate is designed to have the same input to output delay irrespective of which input caused the output to change. We propose a new gate design that has different delays along various input to output paths within the gate. this is accomplished by inserting selectively sized "permanently on" series. transistors at the inputs of the logic gate. We demonstrate the use of the variable input delay CMOS gates for a totally glitch-free minimum dynamic power implementation of a digital circuit. Applying a previously described linear programming method to the c7552 benchmark circuit, we obtained a power saving of 58% over an unoptimized design. this power consumption was 18% lower than that for an alternative low power design using conventional CMOS gates. All circuits had the same overall delay. Since the overall delay was not allowed to increase, the glitch elimination with conventional gates required insertion of delay buffers on non-critical paths. the use of the variable input delay gates drastically reduced the required number of delay buffers.

关键词： CMOS integrated circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共315页 << < 245 246 247 248 249 250 251 252 253 254 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：