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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

258 篇 会议
11 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

192 篇 工学
- 167 篇 计算机科学与技术...
- 103 篇 软件工程
- 42 篇 信息与通信工程
- 30 篇 电气工程
- 21 篇 控制科学与工程
- 10 篇 电子科学与技术（可...
- 9 篇 生物工程
- 7 篇 动力工程及工程热...
- 6 篇 仪器科学与技术
- 6 篇 交通运输工程
- 5 篇 光学工程
- 5 篇 安全科学与工程
- 5 篇 网络空间安全
- 4 篇 建筑学
- 4 篇 生物医学工程（可授...
- 3 篇 力学（可授工学、理...
- 3 篇 机械工程
- 3 篇 化学工程与技术
72 篇 理学
- 47 篇 数学
- 22 篇 系统科学
- 13 篇 统计学（可授理学、...
- 10 篇 物理学
- 10 篇 生物学
- 3 篇 化学
- 3 篇 地球物理学
35 篇 管理学
- 18 篇 管理科学与工程(可...
- 17 篇 图书情报与档案管...
- 12 篇 工商管理
6 篇 医学
5 篇 法学
- 4 篇 社会学
5 篇 教育学
- 5 篇 教育学
2 篇 经济学
2 篇 农学
1 篇 文学
1 篇 军事学

主题

10 篇 genetic algorith...
8 篇 artificial intel...
8 篇 constraint theor...
6 篇 machine learning
6 篇 game theory
6 篇 clustering algor...
5 篇 computer science
5 篇 algorithm design...
4 篇 quality of servi...
4 篇 computational mo...
4 篇 graph theory
4 篇 computers
4 篇 decision making
4 篇 computer vision
4 篇 computer network...
3 篇 computer simulat...
3 篇 object detection
3 篇 systems engineer...
3 篇 algorithms
3 篇 logic gates

机构

3 篇 univ penn dept c...
3 篇 electronics and ...
3 篇 division of comp...
2 篇 ben-gurion unive...
2 篇 univ cambridge 6...
2 篇 duke univ dept e...
2 篇 tu wien austria
2 篇 institute of sys...
2 篇 school of mathem...
2 篇 department of co...
2 篇 dacya complutens...
2 篇 med mobile 535 2...
2 篇 college of compu...
2 篇 deis universit d...
2 篇 school of comput...
1 篇 lahore pakistan
1 篇 department of co...
1 篇 university of ca...
1 篇 dept. of mechani...
1 篇 key laboratory o...

作者

3 篇 parlato gennaro
3 篇 sokolsky oleg
3 篇 park junkil
3 篇 pajic miroslav
3 篇 lee insup
3 篇 la torre salvato...
3 篇 fischer bernd
2 篇 holeman isaac
2 篇 mohd azlishah ot...
2 篇 tomasco ermenegi...
2 篇 inverso omar
2 篇 segal michael
2 篇 lengál ondřej
2 篇 ross peter
2 篇 hamzah asyrani s...
2 篇 yahaya abd rahim
2 篇 mohd fairuz iska...
2 篇 marchetti-spacca...
2 篇 corne david
1 篇 roihan ahmad

语言

275 篇 英文
2 篇 中文

检索条件"任意字段=1st International ICST Conference on Theory and Practice of Algorithms in Computer Systems"

共 276 条记录，以下是241-250 订阅

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

详细简洁

排序：

Partial arc consistency

Partial arc consistency

引用

Workshop on Over-Constrained systems, held as part of 1st international conference on Principles and practice of Constraint Programming, CP 1995

作者： Dendris, Nick D. Kirousis, Lefteris M. stamatiou, Yannis C. Thilikos, Dimitris M. Department of Computer Engineering and Informatics Patras University Rio Patras265 00 Greece

ISBN: (纸本)3540614796

A constraint network is arc consistent if any value of its variables is compatible with at least one value of any other variable. Enforcing arc consistency in a constraint network is a commonly used preprocessing step before identifying the globally consistent value assignments to all the variables. Since many constraint networks that arise in practice are overconstrained, any global assignment of values to the variables involved, is expected to include constraint violations. Therefore, it is often necessary to enforce some weak form of consistency, to avoid excessive value elimination due to the existence of many constraints. It is also necessary that this form of consistency be enforced fast. In this paper, we introduce a notion of weak local consistency that we call partial arc consistency. We then give an algorithm that, for any constraint network of n variables, outputs a partially arc consistent subnetwork of it in sublinear (0(√nlog n)) parallel time using 0(n2) processors. This algorithm removes at least a constant fraction of the local inconsistencies of a general constraint network, without eliminating any globally consistent assignment of values. To our knoweldge, it is the first sublinear-time parallel algorithm with polynomially many processors that achieves this extent of local consistency. Moreover, we propose several approximation schemes to a total solution of the arc consistency problem. We show that these approximation schemes are inherently sequential (more formally, they are P-complete), a fact indicating that the approach of partial solutions, rather than that of approximation schemes, is more promising for parallelism. © 1996, Springer Verlag. All rights reserved.

关键词： Constraint theory

来源：评论

学校读者我要写书评

暂无评论

Rough inference system for automated failure prediction in cooling devices

Rough inference system for automated failure prediction in c...

引用

Optimization Techniques for Learning (ICOTL), international conference on

作者： Zbigniew Kokosiński Piotr Szydłowski Department of Automatic Control and Computer Engineering Cracow University of Technology Kraków Poland Efento Sp. z o.o. Kraków Poland

This article presents a versatile model of failure prediction in control systems of objects with large time constants. The basic model of a control unit consists of deterministic finite automaton (DFA) which states correspond to states of the system where system variables satisfy a given set of constraints. System failures can be predicted on the basis of time series of the selected signals. Further diagnosis is performed on the basis of rough set theory and original algorithms for attributes’ reduction and decision rule generation. A versatile failure prediction algorithm is constructed that integrates all involved techniques. Cooling systems are application examples of the proposed methodology.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A novel automatic step-size adjustment approach in the LMS algorithm

A novel automatic step-size adjustment approach in the LMS a...

引用

international conference on Wireless Communication, Vehicular Technology, Information theory and Aerospace and Electronic systems Technology (Wireless VITAE)

作者： Peijie Wang Pooi Yuen Kam Meng Wah Chia Department of Electrical and Computer Engineering National University of Singapore Singapore

A variable step-size is necessary in the least-mean-square (LMS) algorithm to achieve both fast convergence and a small final excess mean-square estimation error. As a well-studied area, many variations of the LMS algorithm with variable step-sizes have been proposed in the literature. A common point in these algorithms is that the step-size is computed according to some pre-specified formulas with preset control parameters, and therefore the generated step-size is a predetermined constant at each single time point. In this paper, we propose a novel parameter-free step-size adjustment approach, in which the step-size is viewed as a variable, and rechosen at each new time point to minimize a least-squares cost function. Experiments for the linear prediction of random processes show the effectiveness of the proposed approach in rapidly driving the mean-square estimation error to a small final steady-state value. The most significant feature of the new approach is that no control parameters need to be set in advance.

关键词： Least squares approximation Signal processing algorithms Estimation error Convergence steady-state Cost function Random processes Adaptive signal processing Robustness Frequency selective surfaces

来源：评论

学校读者我要写书评

暂无评论

On the effectiveness and efficiency of computing bounds on the support of item-sets in the frequent item-sets mining problem

On the effectiveness and efficiency of computing bounds on t...

引用

1st international Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, OSDM 2005, held in conjunction with the 11th ACM SIGKDD international conference on Knowledge Discovery and Data Mining

作者： Sayrafi, Bassem Van Gucht, Dirk Purdom, Paul W. Computer Science Department Indiana University Lindley Hall 215 Bloomington IN 47405 United States

ISBN: (纸本)1595932100

We study the relative effectiveness and the efficiency of computing support-bounding rules that can be used to prune the search space in algorithms to solve the frequent item-sets mining problem (FIM). We develop a formalism wherein these rules can be stated and analyzed using the concept of differentials and density functions of the support function. We derive a general bounding theorem, which provides lower and upper bounds on the supports of item-sets in terms of the supports of their subsets. Since, in general, many lower and upper bounds exists for the support of an item-set, we show how to the best bounds. The result of this optimization shows that the best bounds are among those that involve the supports of all the strict subsets of an item-set of a particular size q. These bounds are determined on the basis of so called q-rules. In this way, we derive the bounding theorem established by Calders [5]. For these types of bounds, we consider how they compare relative to each other, and in so doing determine the best bounds. Since determining these bounds is combinatorially expensive, we study heuristics that efficiently produce bounds that are usually the best. These heuristics always produce the best bounds on the support of item-sets for basket databases that satisfies independence properties. In particular, we show that for an item-set I determining which bounds to compute that lead to the best lower and upper bounds on freq(I) can be done in time O(|I|). Even though, in practice, basket databases do not have these independence properties, we argue that our analysis carries over to a much larger set of basket databases where local "near" independence hold. Finally, we conduct an experimental study using real baskets databases, where we compute upper bounds in the context of generalizing the Apriori algorithm. Both the analysis and the study confirm that the q-rule (q odd and larger than 1) will almost always do better than the 1-rule (Apriori rule) on large d

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Machine Learning-Based Hybrid Feature Selection for Improvised Network Intrusion Detection 1st

Machine Learning-Based Hybrid Feature Selection for Improvis...

引用

1st international conference on Innovations in Intelligent Computing and Communication, ICIICC 2021

作者： Satapathy, Pritimayee Behera, Prafulla Kumar Department of Computer Science and Applications Utkal University Vani Vihar Odisha Bhubaneswar751004 India

ISBN: (纸本)9783031232329

With the expeditious development of network-based applications, unusual threats erupt. Therefore, distinctive security components are required so that they can boost the existing security mechanism. Network administrators depend primarily on intrusion detection programs to spot such attacks. But nowadays, Machine Learning-based approaches are overwhelmingly used towards intrusion detection, where the system is made to learn from information so that it can distinguish between anomaly and normal traffic. In this research work, we comprehensively discuss some of the established machine learning classifiers concerning network traffic invasions. Using the NSL-KDD dataset, we evaluated five ML classifiers and highlighted their adequacy by employing a rigorous experimental assessment. Within the scope of this study, we propose a hybrid feature selection technique with the goal of enhancing the prediction performance of anomaly-based intrusion detection systems (IDS). We have used information gain (IG), gain ratio (GR) and chi-squared (CS) attribute evaluation methods for the selection of relevant features. Thereafter, we have used mathematical set theory intersection to extract the best features among the 3 evaluation methods mentioned above. Five different machine learning algorithms (MLA): REPTree, LogitBoost, J48, NB, and BayesNet were implemented to generate 32 machine learning models based on each MLA, resulting in a total of 160 models. Akaike Information Criterion (AIC) was used to select the best model out of the 160 models. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Prediction and management in energy harvested wireless sensor nodes

Prediction and management in energy harvested wireless senso...

引用

international conference on Wireless Communication, Vehicular Technology, Information theory and Aerospace and Electronic systems Technology (Wireless VITAE)

作者： Joaquin Recas Piorno Carlo Bergonzini David Atienza Tajana Simunic Rosing DACYA Complutense University of Madrid Spain DEIS Universit degli Studi di Bologna Italy Embedded Systems Laboratory Ecole Polytechnique Fédérale de Lausanne Switzerland Computer Science and Engineering University of California San Diego USA

ISBN: (纸本)9781424440665

Solar panels are frequently used in wireless sensor nodes because they can theoretically provide quite a bit of harvested energy. However, they are not a reliable, consistent source of energy because of the Sun's cycles and the everchanging weather conditions. Thus, in this paper we present a fast, efficient and reliable solar prediction algorithm, namely, weather-conditioned moving average (WCMA) that is capable of exploiting the solar energy more efficiently than state-of-the-art energy prediction algorithms (e.g. exponential weighted moving average EWMA). In particular, WCMA is able to effectively take into account both the current and past-days weather conditions, obtaining a relative mean error of only 10%. When coupled with energy management algorithm, it can achieve gains of more than 90% in energy utilization with respect to EWMA under the real working conditions of the Shimmer node, an active sensing platform for structural health monitoring.

关键词： Energy management Wireless sensor networks Prediction algorithms Solar energy Batteries Sensor systems Weather forecasting Energy storage Capacitors Monitoring

来源：评论

学校读者我要写书评

暂无评论

Issues with Path Representation in Transition systems

Issues with Path Representation in Transition Systems

引用

international conference on Applied Computing and Information Technology

作者： Yi Zheng Chi-Chang Chang Pei He Yafen Liu School of Computer Science and Educational Software Guangzhou University School of Medical Informatics Chung Shan Medical University

ISBN: (纸本)9781509048724

structured analysis of transition systems concerns paths, building blocks, representations, and effective computations of semantics, thus having significant influence on practical applications of graph theory. For instance, part of these results plays important roles in formal language studies, compiler designs and genetic programming. This paper aims to introduce relations among them, and to present related algorithms for calculating of them.

关键词： Artificial intelligence Finite state transition system Building block Detection algorithm Abstract representation

来源：评论

学校读者我要写书评

暂无评论

Combining unification algorithms for confined regular equational theories 1st

Combining unification algorithms for confined regular equati...

引用

1st international conference on Rewriting Techniques and Applications, RTA 1985

作者： Yelick, Kathy Laboratory for Computer Science Massachusetts Institute of Technology United States MIT Laboratory for Computer Science 545 Technology Square CambridgeMA02139 United States

ISBN: (纸本)9783540159766

This paper presents a method for combining equational unification algorithms to handle terms containing "mixed" sets of function symbols. For example, given one algorithm for unifying associative-commutative operators, and another for unifying commutative operators, our algorithm provides a method for unifying terms containing both kinds of operators. We restrict our attention to a class of equational theories which we call confined regular theories. The algorithms is proven to terminate with a complete and correct set of E-unifiers. An implementation has been done as part of a larger system for reasoning about equational theories. © 1985, Springer-Verlag.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Energy devices for sensor networks: Properties for simulation and deployment

Energy devices for sensor networks: Properties for simulatio...

引用

international conference on Wireless Communication, Vehicular Technology, Information theory and Aerospace and Electronic systems Technology (Wireless VITAE)

作者： Alex S. Weddell Geoff V. Merrett Nick R. Harris Neil M. White Pervasive Systems Centre School of Electronics and Computer Science University of Southampton Southampton UK

ISBN: (纸本)9781424440665

Recent developments in microcontroller, radio transceiver, and energy harvesting device design now permit wireless sensor nodes to operate indefinitely from power scavenged from their environment. Many algorithms for conventional sensor networks assume that nodes run directly from non-rechargeable batteries and therefore attempt to conserve energy rather than carefully exploiting it when available. Effectively incorporating energy harvesting into wireless sensor network deployments, and simulations, poses unique problems related to energy-awareness and performance optimization. This paper presents a characterization of energy devices for sensor nodes and outlines their use in simulation and deployment. A case study of an energy-aware sensor node operating from a photovoltaic module and supercapacitor is explored. This paper also presents a modular software and hardware architecture which encourages energy-aware algorithm design and allows the automatic configuration of energy-aware sensor nodes.

关键词： Sensor phenomena and characterization Wireless sensor networks Microcontrollers Radio transceivers Batteries Optimization Photovoltaic systems Solar power generation Supercapacitors Hardware

来源：评论

学校读者我要写书评

暂无评论

Code-based test generation for validation of functional processor descriptions

Code-based test generation for validation of functional proc...

引用

9th international conference on Tools and algorithms for the Construction and Analysis of systems, TACAS 2003 Held as Part of the Joint European conferences on theory and practice of Software, ETAPS 2003

作者： Baray, Fabrice Codognet, Philippe Diaz, Daniel Michel, Henri ST-Microelectronics Central R and D France University of Paris 6 LIP6 France University of Paris 1 France

ISBN: (纸本)3540008985

Microprocessor design deals with many types of specifications: from functional models (SystemC or proprietary languages) to hardware description languages such as VHDL or Verilog. Functional descriptions are key to the development of new processors or System On Chips at stMicroelectronics. In this paper we address the problem of automatic generation of high quality test-suites for microprocessor functional models validation. We present the design and implementation of a software tool based on constraint solving techniques which analyzes the control flow of the initial description in order to generate tests for each path. The test vectors are computed with a dedicated constraint solver designed to handle specific constraints related to typical constructs found in microprocessor descriptions. Results are illustrated with a case study. © Springer-Verlag Berlin Heidelberg 2003.

关键词： System-on-chip

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共28页 << < 19 20 21 22 23 24 25 26 27 28 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：