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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,848 篇 会议
1,533 篇 期刊文献
38 册 图书

馆藏范围

3,419 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,239 篇 工学
- 1,717 篇 计算机科学与技术...
- 1,408 篇 软件工程
- 508 篇 信息与通信工程
- 269 篇 控制科学与工程
- 242 篇 生物工程
- 219 篇 电气工程
- 172 篇 光学工程
- 158 篇 机械工程
- 156 篇 生物医学工程（可授...
- 143 篇 电子科学与技术（可...
- 93 篇 化学工程与技术
- 85 篇 安全科学与工程
- 81 篇 动力工程及工程热...
- 79 篇 仪器科学与技术
- 77 篇 网络空间安全
- 70 篇 建筑学
- 69 篇 交通运输工程
1,024 篇 理学
- 582 篇 数学
- 271 篇 生物学
- 254 篇 物理学
- 182 篇 统计学（可授理学、...
- 103 篇 系统科学
- 94 篇 化学
675 篇 管理学
- 434 篇 管理科学与工程(可...
- 287 篇 图书情报与档案管...
- 157 篇 工商管理
140 篇 医学
- 129 篇 临床医学
- 100 篇 基础医学(可授医学...
- 58 篇 药学(可授医学、理...
91 篇 法学
- 62 篇 社会学
58 篇 教育学
56 篇 经济学
32 篇 农学
12 篇 军事学
12 篇 艺术学
11 篇 文学
2 篇 哲学

主题

103 篇 feature extracti...
92 篇 deep learning
87 篇 training
77 篇 computational mo...
75 篇 semantics
71 篇 software enginee...
62 篇 computer science
61 篇 machine learning
60 篇 accuracy
58 篇 data mining
49 篇 software
48 篇 predictive model...
44 篇 data models
43 篇 cloud computing
42 篇 internet of thin...
42 篇 educational inst...
42 篇 convolution
42 篇 optimization
42 篇 convolutional ne...
41 篇 image segmentati...

机构

83 篇 college of compu...
64 篇 school of comput...
56 篇 state key labora...
46 篇 school of inform...
45 篇 school of comput...
45 篇 school of comput...
42 篇 school of comput...
41 篇 university of ch...
40 篇 faculty of compu...
38 篇 software enginee...
37 篇 state key labora...
31 篇 school of comput...
30 篇 institute of com...
29 篇 school of softwa...
29 篇 school of comput...
29 篇 national enginee...
27 篇 school of comput...
27 篇 school of softwa...
27 篇 school of comput...
27 篇 institute of sof...

作者

27 篇 shen linlin
27 篇 quanyin zhu
23 篇 shi yinghuan
22 篇 gao yang
18 篇 wang wei
18 篇 liu wei
16 篇 gao shangbing
16 篇 tao dacheng
16 篇 du bo
16 篇 wang zheng
16 篇 zhang jian
14 篇 wei sun
14 篇 xiaorui zhang
13 篇 xiang-yang li
13 篇 chen bin
13 篇 tian chunwei
13 篇 qi lei
12 篇 wang hui
12 篇 hu ruimin
12 篇 yu zitong

语言

2,912 篇 英文
446 篇 其他
70 篇 中文
2 篇 德文
2 篇 法文
2 篇 日文
1 篇 斯洛文尼亚文

检索条件"机构=School of Computer and Software Engineering Huaiyin Institute of Technology"

共 3419 条记录，以下是3071-3080 订阅

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

详细简洁

排序：

Service-oriented business to business integration: A systematic literature analysis

Service-oriented business to business integration: A systema...

引用

IEEE International Conference on Service-Oriented Computing and Applications (SOCA)

作者： Ilkka Melleri Kari Hiekkanen Juha Mykkänen Software Business and Engineering Institute Aalto University School of Science and Technology Helsinki Finland Department of Computer Science University of Eastern Finland (UEF) Kuopio Finland

Business automation continues to be a strategic target for IT investment. However, business automation involves inherent challenges, such as system integration issues. Service-Oriented Architecture (SOA) and business-to-business (B2B) integration standards are two approaches used for creating business automation solutions. In this paper a systematic literature analysis is conducted to explore the integration concepts in these two approaches. The objective of the study is to characterize the integration issues in these approaches, and to synthesize the findings into characteristics of so called service-oriented B2B integration. From the literature it is concluded that the SOA approach emphasizes support for dynamic business processes within an enterprise, while the B2B standards approach focuses on pre-defined semantic descriptions of business data that is exchanged between business partners. Thus, a service-oriented B2B integration environment is conceptualized where the B2B standards are used to strengthen the semantic interoperability, while dynamic business process implementations are enabled through the SOA approach.

关键词： Service oriented architecture Standards Business Semantics Semiconductor optical amplifiers Materials Automation

来源：评论

学校读者我要写书评

暂无评论

MMIR: Mining Multi-scale Intervention Rules in Sub-Complex System

MMIR: Mining Multi-scale Intervention Rules in Sub-Complex S...

引用

International Asia-Pacific Web Conference (APWEB)

作者： Zheng Jiaoling Tang Changjie Qiao Shaojie Yang Ning Wang Yue Chen Yu Zhu Jun Department of Software Engineering Chengdu University of Information and Technology Chengdu China Institute of Database and Knowledge Engineering School of Computer Science Sichuan University Chengdu China School of Information Science and Technology Southwest Jiaotong University Chengdu China

Intervention analysis is the common method to reveal relationships between objects in human as well as biological society. Data mining research community is just starting to pay attention to intervention analysis. As the traditional association rules are not successful at measuring intervention, this paper tries to mining intervention rules from time series data of sub-complex system. The main contributions of this study include: (1) introduces a new concept of intervention rules. It can quantitatively detect at what scale, how intensive and how long the intervention does make sense; (2) conduct wavelet transform on time series. The decomposition scale can denotes the intervention scale; (3) proposes a new concept named directional correlation to measure intervention intensity; (4) calculates the intervention intensity between time series data with different time delays. The time delay can uncover after how long the intervention takes place; (5) conducts experiments on real datasets. The results show that intervention rules do exist at different decomposition scale of the original data. Moreover, the number of rules discovered by multi-scale analyzing methods is always 4 or 5 times more than those found by single scale methods. And the stability of rules discovered by the improved multi-scale mining algorithm MMIR* is always 100%, while the stability of rules discovered by the basic multi-scale mining algorithm MMIR fluctuate around 70%.

关键词： Heart rate Data mining Delay effects Stability Frequency Association rules Time measurement Control systems Databases Knowledge engineering

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Parallel Database in Grid

Performance Analysis of Parallel Database in Grid

引用

2010 International Conference on computer and Information Application(2010年计算机与信息应用国际会议 ICCIA 2010)

作者： Wu Weining Song Guozhi Li Xingang School of Computer Science and Technology Harbin Institute of Technology No.92 West Dazhi Street School of Computer Science & Software Engineering Tianjin Polytechnic University No.63 Chenglin Roa Smart Structures and Advanced Composites Laboratory Harbin Engineering University Harbin China

This paper presents a grid frame composed of a preprocessing database server and PC nodes. It divides the whole database into different parts for different PC nodes, where the corresponding data are stored. The server is responsible for the clients' interaction, order partition and management of the whole grid. It implements the parallel database in grid. The paper calculates the execution time of the operation in parallel database. It deduces the formula of the speedup, considering the network and the data interaction. The method derives the maximum of the speedup by calculating its limit in ideal state. Then for the fixed database size, with the number of grid processor nodes growing and the complexity of the database operation increasing, the speedup of this grid frame achieves its maximum value.

关键词： Speedup parallel computing database grid

来源：评论

学校读者我要写书评

暂无评论

Access Control Mechanism Based on Trust Quantification

Access Control Mechanism Based on Trust Quantification

引用

IEEE International Conference on Social Computing (SocialCom)

作者： Shunan Ma Jingsha He Xunbo Shuai Zhao Wang College of Computer Science and Technology Beijing University of Technology Beijing China School of Software Engineering Beijing University of Technology Beijing China Research Institute of Petroleum Exploration and Development PetroChina Beijing China

In an open distributed environment, protection of sensitive files and data becomes more difficult. Traditional access control mechanisms are not suitable for such dynamic environment. Trust can be an effective approach to solve the access control problem. In this paper, by considering fuzziness and uncertainty of trust, we propose a trust quantification algorithm based on grey fuzzy comprehensive evaluation method. Then we present an access control model based on trust quantification. Simulation results show that our mechanism is suitable for dynamic access control in distributed environment.

关键词： Access control History Uncertainty Simulation Computational modeling Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Distance-Optimized Load Balancing Scheme for Network Management

A Distance-Optimized Load Balancing Scheme for Network Manag...

引用

International Conference on Networking and Services (ICNS)

作者： Yantao Sun Fangnan Yang Qiang Liu Zhiqiang Shi The school of computer and information technology Beijing Jiaotong University Beijing China Multimedia Communication & Network Engineering Research Center Institute of Software Chinese Academy and Sciences Beijing China

ISBN: (纸本)9781424459278;9780769539690

Load balancing is an important factor, which influences the performance of DNMS (distributed network management system). In this paper, a two-layer load balancing scheme is proposed for DNMS based on the latest research works on physical topology. In the scheme, the management tasks are distributed to a number of stations for reducing the burden of center management station, the processing time of every station is balanced to almost equal for fairness and the management tasks are allocated to nearest station for saving bandwidth. Experiments show, compared with the centralized methods and general distributed method, it works stably and save over 26 percent of bandwidth occupied by management data in the testing network. This scheme has been used in an actual application.

关键词： Load management Network topology Resource management Bandwidth Scheduling algorithm Scalability technology management Testing Large-scale systems computer network management

来源：评论

学校读者我要写书评

暂无评论

A parallel type of DNA computing model for graph vertex coloring problem

A parallel type of DNA computing model for graph vertex colo...

引用

2010 IEEE 5th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2010

作者： Xu, Jin Qiang, XiaoIi Zhang, Kai Zhang, Cheng Yang, Jing Zhang, Rongkui Wang, Hanpin Fan, Yueke Wang, Shudong Dong, Yafei Wang, Zhezhi He, Xingui Key laboratory of High Confidence Software Technologies School of Electronics Engineering and Computer Science Peking University Beijing China College of Computer Science South-Central University for Nationalities Wuhan 430074 China Institute of Biomolecular Computer Huazhong University of Science and Technology Wuhan 430074 China Key Lab. of Ministry of Education for Medicinal Plant Resource and Natural Pharmaceutical Chemistry College of Life Sciences Shaanxi Normal University Xi'an Shaanxi 710062 China

ISBN: (纸本)9781424464388

A DNA computing model for solving graph vertex coloring problem is proposed in this article. To illustrate the capability of the DNA computing model, a 3-colorable graph with 61 vertices was constructed as an example. Using this model, more than 99% of false solutions were deleted when the initial solution space was established and finally all solutions of the graph were found. Because these operations can be used for any graph with 61 vertices, the searching capability of this model could be up to 0(359). This searching capability is the largest among both electronic and non-electronic computers after the DNA computing model (with searching capability of 0(220) proposed by Adleman's research group in 2002. © 2010 IEEE.

关键词： DNA

来源：评论

学校读者我要写书评

暂无评论

Nova: A Robustness-oriented Byzantine Fault Tolerance Protocol

Nova: A Robustness-oriented Byzantine Fault Tolerance Protoc...

引用

The Ninth International Conference on Grid and Cloud Computing(第九届网格与云计算国际学术会议 GCC 2010)

作者： Xiang Pei Yongjian Wang Zhongzhi Luan Sino-German Joint Software Institute School of Computer Science and Engineering Beihang University 100191 Beijing Beijing Key Laboratory of Network Technology Beihang University 100191 Beijing

With the increased complexity, malicious faults have become an important reasons that affect the reliability of the distributed system, especially the web-scale infrastructures, i.e. Amazon S3, Google AppEngine etc. Most such systems assume benign fault model which can't depict the malicious actions. The goal of Byzantine Fault Tolerance protocol (BFT for short) is to mask the malicious behaviors and it has been proved that some new proposed BFTs are suitable to support practical applications. But these BFTs still lack in robustness, a simple fault injection may cause significantly decrease in throughput or run in low throughput without violating the BFT safety property. We propose a new robustness-oriented BFT named Nova. Experiments show Nova has comparable throughput as PBFT in normal case and behave stably under the malicious attack. Compared with other BFTs, Nova can support practical applications more effectively.

关键词： Byzantine Fault Tolerance Equivocation Robustness

来源：评论

学校读者我要写书评

暂无评论

LISTEN: Non-interactive Localization in Wireless Camera Sensor Networks

LISTEN: Non-interactive Localization in Wireless Camera Sens...

引用

Real-Time Systems Symposium (RTSS)

作者： Yuan He Xingfa Shen Yunhao Liu Lufeng Mo Guojun Dai Department of Computer Science & Engineering Hong Kong University of Science and Technology Hong Kong China TNLIST School of Software Tsinghua University China Institute of Computer Applied Technology Hangzhou Dianzi University China Department of Computer Science & Technology Xian Jiao Tong University China

Recent advances in the application field increasingly demand the use of wireless camera sensor networks (WCSNs), for which localization is a crucial task to enable various location-based services. Most of the existing localization approaches for WCSNs are essentially interactive, i.e. require the interaction among the nodes throughout the localization process. As a result, they are costly to realize in practice, vulnerable to sniffer attacks, inefficient in energy consumption and computation. In this paper we propose LISTEN, a non-interactive localization approach. Using LISTEN, every camera sensor node only needs to silently listen to the beacon signals from a mobile beacon node and capture a few images until determining its own location. We design the movement trajectory of the mobile beacon node, which guarantees to locate all the nodes successfully. We have implemented LISTEN and evaluated it through extensive experiments. The experimental results demonstrate that it is accurate, efficient, and suitable for WCSNs that consist of low-end camera sensors.

关键词： Cameras Robot sensing systems Mobile communication Wireless sensor networks Trajectory

来源：评论

学校读者我要写书评

暂无评论

Notice of Retraction: Theoretical research on a high-speed vibration screen with monaxial motor based on Particle Swarm Optimization

Notice of Retraction: Theoretical research on a high-speed v...

引用

International Conference on computer, Mechatronics, Control and Electronic engineering (CMCE)

作者： Changfei Lv Xiaoyu Wu Dongping Qian School of Optical-Electrical and Computer Engineering University of Shanghai for Science and Technology China M&E College Agricultural University of Hebei China Hebei Software Institute China

This article has been retracted by the publisher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robustify a job-shop schedule according to the payload of the machine

Robustify a job-shop schedule according to the payload of th...

引用

International Conference on Services Systems and Services Management, ICSSSM

作者： Zhiyang You Zhigang Sun Xibin Zhao Daxin Zang Department of Computer Science and Technology Tsinghua University Beijing China School of Software Tsinghua University Beijing China Key Laboratory of Information System Security Ministry of Education School of Software Tsinghua University Beijing China Software Engineering Institute Beijing Aeronautics and Astronautics University Beijing China

Robust scheduling is an effective way to solve job-shop scheduling problem (JSP) under a dynamic and stochastic environment with uncertainties, which may lead to numerous schedule disruptions. Maintaining the optimization obtained, the robust schedule is more stable in execution. The vast majority of the researches on robust scheduling concentrate on the development of the robustness and stabilization with an optimization target that minimizes makespan. However, other optimization targets are needed in reality, and in this paper, we introduce another optimization target that maximizes the payload of the machine, which can reflect the capacity of machine. This work applies a two-step way to achieve a robust schedule. A baseline schedule in the deterministic environment is generated first, which pursues standard optimization criterions, and then the temporal buffers are inserted into the baseline schedule which make the schedule absorb some level of unexpected disruption without rescheduling. According to the payload of each machine which should be close to the maximum at any time in execution, we can get each size of the temporal buffers inserted into the different operations. An extensive experiment is used to show the relative performance of the proposed robust schedule. It is shown that the schedule is robust and stable under the stochastic disturbance coupling with minimal makespan tardiness and symmetry payload.

关键词： Robustness Payloads Job shop scheduling Uncertainty Processor scheduling Dynamic scheduling Stochastic processes Switches computer science Space technology

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共342页 << < 304 305 306 307 308 309 310 311 312 313 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：