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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,235 篇 会议
11 篇 期刊文献

馆藏范围

1,246 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

982 篇 工学
- 835 篇 计算机科学与技术...
- 484 篇 软件工程
- 252 篇 电气工程
- 204 篇 信息与通信工程
- 177 篇 控制科学与工程
- 131 篇 仪器科学与技术
- 61 篇 生物工程
- 58 篇 电子科学与技术（可...
- 51 篇 机械工程
- 46 篇 交通运输工程
- 46 篇 生物医学工程（可授...
- 44 篇 安全科学与工程
- 33 篇 光学工程
- 32 篇 动力工程及工程热...
- 29 篇 石油与天然气工程
283 篇 理学
- 152 篇 数学
- 76 篇 生物学
- 55 篇 物理学
- 47 篇 系统科学
- 47 篇 统计学（可授理学、...
- 32 篇 化学
247 篇 管理学
- 180 篇 管理科学与工程(可...
- 98 篇 图书情报与档案管...
- 78 篇 工商管理
52 篇 医学
- 45 篇 临床医学
- 41 篇 基础医学(可授医学...
- 27 篇 公共卫生与预防医...
- 21 篇 药学(可授医学、理...
28 篇 法学
- 20 篇 社会学
25 篇 经济学
- 25 篇 应用经济学
11 篇 教育学
9 篇 农学
1 篇 文学
1 篇 军事学

主题

71 篇 data acquisition
41 篇 intelligent syst...
36 篇 real-time system...
33 篇 data mining
29 篇 internet of thin...
27 篇 cloud computing
25 篇 neural networks
23 篇 data models
22 篇 computational mo...
19 篇 conferences
19 篇 wireless sensor ...
18 篇 big data
18 篇 control systems
17 篇 monitoring
17 篇 machine learning
17 篇 artificial intel...
16 篇 three-dimensiona...
15 篇 deep learning
14 篇 computer archite...
14 篇 intelligent netw...

机构

8 篇 ternopil natl ec...
5 篇 china electric p...
5 篇 faculty of telec...
4 篇 institute of rel...
4 篇 3-30-1 wajiro-hi...
3 篇 beijing key labo...
3 篇 peking univ sch ...
3 篇 misr internation...
3 篇 ternopil nationa...
3 篇 chitkara univers...
3 篇 state grid corpo...
3 篇 hubei univ techn...
3 篇 national institu...
3 篇 national institu...
3 篇 peking univ sch ...
3 篇 department of co...
2 篇 csg power dispat...
2 篇 school of inform...
2 篇 yellow sea fishe...
2 篇 lebanese america...

作者

13 篇 sachenko anatoli...
11 篇 kochan volodymyr
10 篇 axel sikora
9 篇 sachenko anatoly
9 篇 turchenko iryna
8 篇 lendyuk taras
7 篇 turchenko volody...
6 篇 rippa sergey
6 篇 sachenko svitlan...
6 篇 manolova agata
6 篇 agata manolova
5 篇 krasimir tonchev
5 篇 kochan r.
5 篇 golovko vladimir
5 篇 drozd oleksandr
5 篇 tonchev krasimir
4 篇 vasylkiv nadiia
4 篇 madani kurosh
4 篇 wang ping
4 篇 sachenko a.

语言

1,135 篇 英文
109 篇 其他
2 篇 中文

检索条件"任意字段=3rd IEEE Intelligent Data Acquisition and Advanced Computing Systems"

共 1246 条记录，以下是791-800 订阅

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

详细简洁

排序：

Contribution to the Optimization of data Aggregation Scheduling in Wireless Sensor Networks 3rd

引用

3rd International Conference on Modelling, Computation and Optimization in Information systems and Management Sciences (MCO)

作者： Yagouni, Mohammed Mobasti, Zakaria Bagaa, Miloud Djaoui, Hichem USTHB Laromad BP 32 El Alia Algiers Algeria USTHB RECITS Lab Algiers Algeria Res Ctr Sci & Tech Informat CERIST Algiers Algeria

ISBN: (纸本)9783319181677;9783319181660

Wireless Sensor Network (WSN) is a very important research area. It has wide range of applications in different domains, such as industrial production processes and military fields. The sensing of events and forwarding of sensed information, through multi-hops wireless communications, toward the base-station is the main functionality of a WSN. In this paper, we study the problem of how gather and aggregate data from the whole sensor nodes to the base-station, with efficient way, such that the energy consumption is reduced, messages collision are prevented and the time latency is minimized. The problem of data aggregation scheduling is mathematically modeled, and then a heuristic to resolve the problem are proposed. The simulation results show the efficiency of our solution compared to the best approaches existed in literature.

关键词： Sensors Wireless Sensor Network data aggregation scheduling Heuristic mathematical modeling

来源：评论

学校读者我要写书评

暂无评论

Statistical Features for Emboli Identification Using Clustering Technique 1

引用

3rd International Conference on Computer Science, Applied Mathematics and Applications (ICCSAMA)

作者： Ghazali, Najah Ramli, Dzati Athiar Univ Sains Malaysia Intelligent Biometr Res Grp IBG Sch Elect & Elect Engn Engn Campus Nibong Tebal 14300 Pulau Pinang Malaysia Univ Malaysia Perlis Inst Engn Math IMK Arau 02600 Perlis Malaysia

ISBN: (数字)9783319179964

ISBN: (纸本)9783319179964;9783319179957

Microembolus signals (MES) detected by transcranial Doppler (TCD) ultrasound are similar to the short duration transient signals. In previous researches, an embolus was tracked by using a supervised technique to discriminate the embolus from the background. However, the classification results were found to be affected by many factors and limited under experimental setup conditions. Therefore, a detection system based on the k-means clustering technique (unsupervised learning) is proposed for emboli detection. In order to verify the proposed technique, the signal data sets are also be computed and compared with SVM classifier. The features selected are the measured embolus-to-blood ratio (MEBR), peak embolus-to-blood ratio (PEBR) and statistical features. Five independent data sets of different transmitted frequency, probe location and different depths are identified to evaluate the feasibility of this new proposed method. The overall result show that k-means is better than SVM in term of robustness aspect. This work also revealed the feasibility of the automatic detection of the features-based emboli in which it is very imperative in assisting the experts to monitor the stroke patients.

关键词： Classification Embolus detection K-means Clustering Transcranial Doppler Ultrasound

来源：评论

学校读者我要写书评

暂无评论

引用

3rd International Conference on Modelling, Computation and Optimization in Information systems and Management Sciences (MCO)

作者： Maenpaa, Teemu Wanne, Merja Univ Vaasa Fac Technol Dept Comp Sci Vaasa Finland

ISBN: (纸本)9783319181677;9783319181660

The emergence of concepts such as big data and internet of things lead into a situation where the data structures and repositories have become more complex. So, there should be a way to analyze such data, and organize it into a meaningful and usable form. Relational model is widely used model for organizing data. Adjacency model is a data model that relies on adjacency between elements. Relational data can be represented by adjacency model. Moreover, the adjacency model can be visualized as a graph. This paper discusses the similarities between the models based on the previous studies and theories. Furthermore, this paper aims to strengthen and quantify the similarities between the models by utilizing the graph theory concepts. This study reveals that the previous considerations between the relational model and the adjacency model can be backed up with graph theory. If a relational database is represented by adjacency model and visualized as a graph called adjacency relation system, the elements of relational database can be identified from the graph. The identification of the elements is based on the graph theory concepts such as walk, vertex degree, leaf vertex, and graph domination.

关键词： data modeling relational model adjacency model graph analysis

来源：评论

学校读者我要写书评

暂无评论

Incremental Mining Class Association Rules Using Diffsets 1

引用

3rd International Conference on Computer Science, Applied Mathematics and Applications (ICCSAMA)

作者： Nguyen, Loan T. T. Ngoc Thanh Nguyen Ton Duc Thang Univ Fac Informat Technol Div Knowledge & Syst Engn ICT Ho Chi Minh City Vietnam Warsaw Univ Technol Fac Comp Sci & Management Dept Informat Syst PL-00661 Warsaw Poland

ISBN: (数字)9783319179964

ISBN: (纸本)9783319179964;9783319179957

Class association rule (CAR) mining is to find rules that their right hand sides contain class labels. Some recent studies have proposed algorithms for mining CARs;however, they use the batch process to solve the problem. In the previous work, we proposed a method for mining CARs from incremental datasets. This method uses MECR-tree to store itemsets and rules are easy to generate based on this tree. Pre-large concept is used to reduce the number of rescan datasets and Obidsets (set of object identifiers) are used to fast compute the support of itemsets. CAR-Incre algorithm has been proposed. However, when the number of inserted records is large, this method still consumes much time to compute the intersection of Obidsets on dense datasets. In this paper, we modify CAR-Incre algorithm by using Diffsets (difference between Obidsets) instead of Obidsets. CAR-Incre is adjusted to fit Diffsets. We verify the improved algorithm by experiments.

关键词： data mining class association rule incremental dataset Obidset Diffset

来源：评论

学校读者我要写书评

暂无评论

A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D 1

引用

3rd International Conference on Computer Science, Applied Mathematics and Applications (ICCSAMA)

作者： Thanh An Phan Thanh Giang Dinh Vietnam Acad Sci & Technol Inst Math Hanoi Vietnam Univ Lisbon Inst Super Tecn CEMAT Lisbon Portugal Vinh Univ Dept Math Vinh City Vietnam

ISBN: (数字)9783319179964

ISBN: (纸本)9783319179964;9783319179957

Determining the convex hull, its lower convex hull, and Voronoi diagram of a point set is a basic operation for many applications of pattern recognition, image processing, and data mining. To date, the lower convex hull of a finite point set is determined from the entire convex hull of the set. There arises a question "How can we determine the lower convex hull of a finite point set without relying on the entire convex hull?" In this paper, we show that the lower convex hull is wrapped by lower facets starting from an extreme edge of the lower convex hull. Then a direct method for determining the lower convex hull of a finite point set in 3D without the entire convex hull is presented. The actual running times on the set of random points (in the uniform distribution) show that our corresponding algorithm runs significantly faster than the incremental convex hull algorithm and some versions of the gift-wrapping algorithm.

关键词： Convex Hull Extreme Edge Gift-wrapping Algorithm Lower Convex Hull Pattern Recognition Voronoi Diagram

来源：评论

学校读者我要写书评

暂无评论

Mining the Adoption Intention of Location-Based Services Based on Dominance-Based Rough Set Approaches 3rd

引用

3rd International Conference on Modelling, Computation and Optimization in Information systems and Management Sciences (MCO)

作者： Chin, Yang-Chieh Asia Univ Dept Int Business 500 Lioufeng Rd Taichung 41354 Taiwan

ISBN: (纸本)9783319181677;9783319181660

Faced with the excessive opportunity, mobile service providers have unconstrained a variability of services, such as mobile instant messaging, mobile shopping and location-based services (LBS). Location-based service is a social media tool that allows users to write short text messages to public and private networks. This research focuses specifically on the mobile services on LBS. The main purposes of this study are to investigate and compare what recommendation sources influence the intention to use LBS and to combine gender, daily internet hour usage and past use experience to infer the usage of LBSs decision rules using a dominace-based rough-set approach. data for this study were collected from 398 users and potential users. The analysis is grounded in the taxonomy of induction-related activities using a domiance-based rough set approach to infer the usage of LBSs decision rules. Finally, the study of the nature of LBS reflects essential practical and academic value.

关键词： Location-base services Dominance-based rough set approach Recommendation source Adoption intention

来源：评论

学校读者我要写书评

暂无评论

A Cross-Efficiency Approach for Evaluating Decision Making Units in Presence of Undesirable Outputs 3rd

引用

3rd International Conference on Modelling, Computation and Optimization in Information systems and Management Sciences (MCO)

作者： Moeini, Mahdi Karimi, Balal Khorram, Esmaile Tech Univ Kaiserslautern Chair Business Informat Syst & Operat Res BISOR Postfach 3049Erwin Schrodinger Str D-67653 Kaiserslautern Germany Azad Univ Karaj Branch Dept Math Karaj Iran Amirkabir Univ Technol Dept Math & Comp Sci Tehran Iran

ISBN: (纸本)9783319181677;9783319181660

data Envelopment Analysis (DEA) is a mathematical programming approach for measuring efficiency of Decision Making Units (DMUs). In traditional DEA, a ratio of weighted outputs to inputs is examined and, for each DMU, some optimal weights are obtained. The method of cross-efficiency is an extension to DEA by which a matrix of scores is computed. The elements of the matrix are computed by means of the weights obtained via usual models of DEA. The cross-efficiency may have some drawbacks, e.g., the cross-efficiency scores may be multiple due to the presence of several optima. To overcome this issue, secondary goals are used. However, this method has never been used for peer evaluation of DMUs with undesirable outputs. In this paper, our objective is to bridge this gap. For this end, we introduce a new secondary goal, test it on an empirical example with undesirable outputs, report the results, and finally, we give some concluding remarks.

关键词： data Envelopment Analysis Cross-Efficiency Secondary Goals Undesirable Outputs

来源：评论

学校读者我要写书评

暂无评论

Inferring Mean Road Axis from Big data: Sorted Points Cloud Belonging to Traces 3rd

Inferring Mean Road Axis from Big Data: Sorted Points Cloud ...

引用

3rd International Conference on Modelling, Computation and Optimization in Information systems and Management Sciences (MCO)

作者： Ariza-Lopez, F. J. Barrera, D. Reinoso, J. F. Romero-Zaliz, R. Univ Jaen Dept Cartog Geodes & Photogrammetry Engn Jaen Spain Univ Granada Dept Appl Math E-18071 Granada Spain Univ Granada Dept Architecton & Engn Graph Express E-18071 Granada Spain Univ Granada Dept Comp Sci & Artificial Intelligence E-18071 Granada Spain

ISBN: (纸本)9783319181615;9783319181608

Roads are, probably the most important features appearing in cartography, both digital and analog one. The necessary tasks, to get accurate roads representation, were traditionally really expensive: photogrammetry and in situ differential GPS, for example. Nevertheless nowadays, the web allows people to register waypoints in their navigation device, with low accuracy and offer them to the rest of community. This way a lot of traces could be available to infer a mean road axis which, probably to be much more precise than the individual ones. In this paper we present three approaches in order to compute the representative axis above mentioned: a) Frechet distance concept, b) B-spline least square fit and c) genetic algorithm spline-based. This paper shows that all our approaches are suitable to be deployed in a web-based application in order to support collaborative digital cartography. The dataset we used in our study is composed of 149 traces captured by a low accuracy user consumer GPS.

关键词： geographic information roads determination Frechet distance homologous points B-spline fitting genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

The dynamics of 3-dimentional micro-mechanic sensor of angle motions of a robot-hexapod

The dynamics of 3-dimentional micro-mechanic sensor of angle...

引用

ieee International Workshop on intelligent data acquisition and advanced computing systems: Technology and Applications

作者： Sergei I. Osadchy Valeriy A. Zozulya Grygoriy I. Rudiuk Kirovograd National Technical University Kirovograd Ukraine Company Antonov Kyiv Ukraine

Transfer function matrices of 3d MEMS sensor of angular motions and spectral density of noises measurements were estimated with the help of the method of structural identification for first time. This provides the pos... 详细信息

关键词： Home appliances Robot sensing systems Three-dimensional displays Micromechanical devices Noise measurement Gyroscopes Dynamics

来源：评论

学校读者我要写书评

暂无评论

Soft-computing based fast visual objects' distance evaluation for robots' vision

Soft-computing based fast visual objects' distance evaluatio...

引用

ieee International Workshop on intelligent data acquisition and advanced computing systems: Technology and Applications

作者： Hossam Fraihat Cristophe Sabourin Kurosh Madani LISSI / EA 3956 Lab. Senart-FB Institute of Technology Lieusaint France

The paper deals with visual objects' distance evaluation using Soft-computing based approaches and pseudo-3D standard low-cost sensor, namely the Kinect. The investigated technique points toward robots' vision and the robot's surrounding environment metrology. Experimental results showing viability of the proposed approach, providing comparison with geometrical distance evaluation, are reported.

关键词： databases Robot sensing systems Visualization Feature extraction Estimation error

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共125页 << < 76 77 78 79 80 81 82 83 84 85 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：