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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

279 篇 会议
5 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

102 篇 工学
- 97 篇 计算机科学与技术...
- 36 篇 软件工程
- 17 篇 电气工程
- 14 篇 信息与通信工程
- 10 篇 控制科学与工程
- 6 篇 网络空间安全
- 5 篇 交通运输工程
- 5 篇 安全科学与工程
- 3 篇 机械工程
- 3 篇 仪器科学与技术
- 3 篇 动力工程及工程热...
- 2 篇 电子科学与技术（可...
- 2 篇 化学工程与技术
- 1 篇 力学（可授工学、理...
- 1 篇 光学工程
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 建筑学
23 篇 管理学
- 18 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
21 篇 理学
- 15 篇 数学
- 5 篇 统计学（可授理学、...
- 3 篇 化学
- 3 篇 系统科学
- 2 篇 地球物理学
- 1 篇 物理学
- 1 篇 生物学
2 篇 法学
- 1 篇 法学
- 1 篇 社会学
1 篇 经济学
- 1 篇 应用经济学

主题

65 篇 distributed comp...
55 篇 knowledge discov...
28 篇 distributed data...
16 篇 computational mo...
14 篇 servers
11 篇 blockchain
9 篇 protocols
9 篇 encryption
9 篇 cloud computing
8 篇 routing
8 篇 educational inst...
8 篇 algorithm design...
8 篇 heuristic algori...
7 篇 simulation
7 篇 data mining
7 篇 monitoring
7 篇 wireless sensor ...
7 篇 predictive model...
7 篇 clustering algor...
6 篇 scalability

机构

8 篇 college of compu...
4 篇 guangdong tobacc...
4 篇 guangxi key labo...
3 篇 college of compu...
3 篇 shanghai jiao to...
3 篇 school of comput...
2 篇 department of co...
2 篇 nanjing universi...
2 篇 daocloud
2 篇 college of infor...
2 篇 college of compu...
2 篇 school of comput...
2 篇 department of co...
2 篇 college of infor...
2 篇 state grid infor...
2 篇 hunan xingtong e...
2 篇 key laboratory o...
2 篇 international bu...
2 篇 shenzhen institu...
2 篇 state grid infor...

作者

6 篇 yingzhou zhang
6 篇 yuxin sun
3 篇 xie bin
3 篇 junyan qian
2 篇 kumar anup
2 篇 tianlong gu
2 篇 gang yin
2 篇 zhu yanxu
2 篇 li li
2 篇 xinzhi xu
2 篇 ning wang
2 篇 long li
2 篇 fan lei
2 篇 yuan zhou
2 篇 zhou yuan
2 篇 he zhenfeng
2 篇 gang wang
2 篇 ganchev ivan
2 篇 qiaomu wang
2 篇 wang yujue

语言

281 篇 英文
4 篇 其他

检索条件"任意字段=International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC"

共 285 条记录，以下是81-90 订阅

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

详细简洁

排序：

Local query generation for distributed XQuery queries

Local query generation for distributed XQuery queries

引用

international conference on cyber-enabled distributed computing and knowledge discovery

作者： Park, Jong-Hyun Kang, Ji-Hoon Research Institute for Information Technology Kyushu University Hakozaki 6-10-1 Higashi-Ku Fukuoka 812-8581 Japan Dept. of Computer Science and Engineering Chungnam National University Gung-Dong Yuseong-Gu Daejeon 305-764 Korea Republic of

ISBN: (纸本)9780769542355

XML view is proposed to integrate between XML data and heterogeneous data over distributed environment and global XML view is used to search distributed heterogeneous data. distributed XQuery queries based on a global XML view can search heterogeneous data seamlessly, being distributed in the local systems. One of the basic and simple methods to process distributed SQL queries is that generates local SQL queries for processing a distributed SQL query and constructs the result of the distributed query from the results of the local queries. Therefore, it is natural to consider how the method for distributed SQL queries can be applied to processing XQuery queries. However, the syntax of XQuery differs from SQL because the XQuery contains some special expressions like FOR clauses for querying to semi-structured data. Therefore, this paper defines some problems to generate local XQuery queries for processing distributed XQuery queries and proposes a method for generating local XQuery queries considered these problems. We also implement a distributed XQuery query processor using our method. © 2010 IEEE.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

A Decentralized Load Balancing Architecture for Cache System 7

A Decentralized Load Balancing Architecture for Cache System

引用

6th international conference on cyber-enabled distributed computing and knowledge discovery (cyberc)

作者： Song, Mengjing Li, Hui Wu, Hao Peking Univ Shenzhen Grad Sch Shenzhen Eng Lab Converged Networks Technol Shenzhen Guangdong Peoples R China Peking Univ Shenzhen Grad Sch Inst Big Data Technol Shenzhen Guangdong Peoples R China

ISBN: (纸本)9781467392006

Cache technology has emerged as a promising approach for distributed web systems to mitigate the web server's data access performance bottleneck. In this paper, we propose a decentralized load balancing architecture. The cache system takes advantage of the decentralized architecture for providing scalability and high availability. It can provide content requested by a user if it is cached in any of the cache servers in the system. Moreover, it can reduce the network traffic for web servers if the requested contents are cached in the system. We also propose a dynamic load balancing algorithm called Adaptive Dynamic Algorithm to dispatch requested contents that are not cached in the cache system to different cache servers. In Adaptive Dynamic Algorithm, we combine load metrics (CPU, memory) and number of alive requests to predict the real load of cache server. The balance strategy prevents the cache servers to be skew, improves cache hit rate, and reduces response time effectively. Experimental results support that our proposed load balancing algorithm is faster than Round Robin and Least Connection, and the content hit rate is higher than Round Robin and Least Connection too.

关键词： cache distributed system decentralized architecture dynamic load balancing

来源：评论

学校读者我要写书评

暂无评论

A protocol for intrusion detection based on learning automata in forwarding packets for distributed wireless sensor networks

A protocol for intrusion detection based on learning automat...

引用

4th international conference on cyber-enabled distributed computing and knowledge discovery, cyberc 2012

作者： FathiNavid, Amir Hosein Aghababa, Amir Bagheri Computer Engineering Department Islamic Azad University Bahar Branch Hamedan Iran Computer Engineering Department Islamic Azad University East Tehran Branch Tehran Iran

ISBN: (纸本)9780769548104

In recent years, wireless technology has enjoyed a tremendous rise in popularity and its usage opens new fields of applications. Due to their possible deployment in remote locations for civil, educational, scientific, military purposes and security which includes intrusion detection and intrusion prevention are of utmost importance. distributed wireless sensor networks have problems on detecting and preventing malicious nodes which always bring destructive threats and compromise multiple sensor nodes. Therefore, sensor networks need to support an authentication service for sensor identity and message transmission. Furthermore, intrusion detection and prevention schemes are always integrated in sensor security appliances so that they can enhance network security by discovering malicious or compromised nodes. In this paper, we propose an energy-aware protocol for intrusion detection in wireless sensor networks (WSNs). Detection system is implemented based on learning automata concept. We implemented the system in network simulator "GloMoSim". Also we have rigorously evaluated the performance of our proposed solution by performing a variety of experiments and have found our solution approach to be promising. © 2012 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Improvement of Neural Cognitive Diagnosis for Intelligent Education Systems Based on Response Time Factor 15

Improvement of Neural Cognitive Diagnosis for Intelligent Ed...

引用

15th international conference on cyber-enabled distributed computing and knowledge discovery, cyberc 2023

作者： He, Zhenyu He, Weilong He, Zhenfeng Jinan University College of Information Science and Technology Guangzhou China Jinan University International School Guangzhou China Guangdong Tobacco Huizhou City Co. Ltd Huizhou China

ISBN: (纸本)9798350308693

Cognitive diagnosis is a fundamental issue in intelligent education, which aims to discover the proficiency level of students on specific knowledge concepts. In this area, the Neural Cognitive Diagnosis (NeuralCD) framework is a good solution. However, the NeuralCD model does not consider the response time of the students when answering questions. In this paper, we proposed an improved neural cognitive diagnostic model by introducing a response time factor into the NeuralCD model, named NeuralCDM-RTF. The core of the response time factor is the answering duration of the student on a problem. The duration of the response time showed the student's proficiency indirectly. We proposed the concept of response time factor and proposed trapezoid model to calculate the response time factor. By performing experiments on real-world datasets, the results show that the NeuralCDM-RTF has higher accuracy than the traditional NeuralCD model while the improved model remains interpretable. © 2023 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Efficient approach for repeated patterns mining based on indent shape of HTML documents

Efficient approach for repeated patterns mining based on ind...

引用

3rd international conference on cyber-enabled distributed computing and knowledge discovery, cyberc 2011

作者： Zhu, Yanxu Yin, Gang Wang, Huaimin Shi, Dianxi Rao, Xiang Yuan, Lin School of Computer National Laboratory for Parallel and Distributed Processing National University of Defense Technology 410073 Changsha Hunan China College of Electronic Technology Information Engineering University 450004 Zhengzhou Henan China

ISBN: (纸本)9780769545578

Mining of repeated patterns from HTML documents is the key step towards Web-based data mining and knowledge extraction. Many web crawling applications need efficient repeated patterns mining techniques to generate their wrapper automatically. Existing approaches such as tree matching and string matching can detect repeated patterns with high precision, but their performance is still a challenge for practical web crawling applications. In this paper, we propose an efficient approach for mining repeated patterns based on indent shape of HTML document. Indent shape is a novel and simple model of HTML document, in which tandem repeated waves have strong association with the repeated patterns to be detected. By scanning an indent shape with a horizontal indent-line from bottom to top, the tandem repeated waves are identified by filtering the wave segments with low self-similarities. After that the boundary of HTML code corresponding to repeated patterns can be identified, which could be transformed to regular expressions formal-defined easily. Extensive experiments on two practical data sets retrieved from Internet show that our approach achieves high efficiency significantly, and its precision performance is also generally better than the existing approaches. © 2011 IEEE.

关键词： HTML

来源：评论

学校读者我要写书评

暂无评论

Research on online failure prediction model and status pretreatment method for exascale system

Research on online failure prediction model and status pretr...

引用

3rd international conference on cyber-enabled distributed computing and knowledge discovery, cyberc 2011

作者： Zhou, Hao Jiang, Yanhuang National Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9780769545578

The reliability issue of Exascale system is extremely serious. Traditional passive fault-tolerant methods, such as rollback-recovery, can not fully guarantee system reliability any more because of their large executing overhead and long recovering duration. Active fault tolerance is expected to become another important fault-tolerant approach for Exascale system. Focusing on system failure prediction, which is one key step of active fault tolerance, we construct online failure prediction model and research on the effective method of system status pretreatment. In order to improve the accuracy and real-time feature of current methods, the proposed Improved Adaptive Semantic Filter (IASF) method processes the latest system logs regularly, filtering useless information out of them according to their semantics. Adopting the main idea of Vector Space Model (VSM), IASF method creates Event Vector corresponding to each log record. By calculating the cosine of vectorial angle, it evaluates the semantics correlation between different log records, and then executes temporal and spatial redundant filter considering the burst feature of log records. IASF method is insensitive to the type of system log and does not introduce any expert system or domain knowledge. The experiment result shows that system can eliminate about 99.6% of useless log records after executing IASF method. © 2011 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Exploiting attribute redundancy in extracting open source forge websites

Exploiting attribute redundancy in extracting open source fo...

引用

4th international conference on cyber-enabled distributed computing and knowledge discovery, cyberc 2012

作者： Li, Xiang Zhu, Yanxu Yin, Gang Wang, Tao Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9780769548104

Open Source Forge (OSF) websites provide information on massive open source software projects, extracting these web data is important for open source research. Traditional extraction methods use string matching among pages to detect page template, which is time-consuming. A recent work published in VLDB exploits redundant entities among websites to detect web page coordinates of these entities. The experiment gives good results when these coordinates are used for extracting other entities of the target site. However, OSF websites have few redundant project entities. This paper proposes a modified version of that redundancy-based method tailored for OSF websites, which relies on a similar yet weaker presumption that entity attributes are redundant rather than whole entities. Like the previous work, we also construct a seed database to detect web page coordinates of the redundancies, but all at the attribute-level. In addition, we apply attribute name verification to reduce false positives during extraction. The experiment result indicates that our approach is competent in extracting OSF websites, in which scenario the previous method can not be applied. © 2012 IEEE.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

distributed cluster-based fault-tolerant topology control for space information networks

Distributed cluster-based fault-tolerant topology control fo...

引用

international conference on cyber-enabled distributed computing and knowledge discovery

作者： Ye, Ning Zhu, Zhiliang Liu, Jun Shi, Jiping College of Information Science and Engineering Northeastern University Shenyang Liaoning China College of Software Northeastern University Shenyang Liaoning China Air Force Dalian Communication Petty Officer School Dalian Liaoning China

ISBN: (纸本)9780769542355

Space information networks are a new type of self-organizing networks constituted by communication and information systems of land, sea, air and space. The performances of space information networks are closely related to their distinguishing characteristics such as large scale, high component complexity and high link redundancy. The paper proposed a distributed cluster-based and fault-tolerant topology control algorithm to construct a more efficient and failure-resistant topology for space information networks. Within each cluster, nodes discover local topology and compute appropriate transmitted powers reaching all nodes in their close vicinity through k optimal vertex-disjoint paths to achieve k-connectivity of the whole cluster. Between each pair of adjacent clusters, k disjoint links connecting the two clusters are maintained by finding out optimal matching of weighted bipartite graphs formed by topology of border nodes and their connections, which arranges inter-cluster relaying optimally. In the third phase, nodes adjust their transmitted power according to the logical topology generated by intra-cluster and inter-cluster topology control. Simulation results show performances such as invulnerability, reliability and validity are enhanced under the proposed topology control algorithm. © 2010 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A Reliable and Efficient distributed Semantic discovery Mechanism for Mobile P2P Networks 12

A Reliable and Efficient Distributed Semantic Discovery Mech...

引用

12th international conference on cyber-enabled distributed computing and knowledge discovery, cyberc 2020

作者： Chen, Shengnan Qian, Liang Shanghai Jiao Tong University Department of Electronic Engineering Shanghai China Shenzhen Institute of Guangdong Ocean University Shenzhen China

ISBN: (纸本)9781728184487

With the amazing development of mobile internet, the traditional client/server architecture is facing problems such as centralization and scalability. Therefore, many researchers have been focusing on applying P2P networks to dynamic mobile systems. However, mobile nodes tend to join/leave the network frequently, which makes the P2P system unstable and inefficient. To solve this problem, this paper proposes a reliable and efficient semantic discovery model for mobile P2P networks. It is consisted of two layers, with the cluster administrators in the upper layer and data nodes in the lower layer. The data nodes of each cluster provide the storage of files with similar semantics. The heartbeat and recovery mechanism inside each cluster contributes to reducing the impact of churn and preventing data loss. The simulation results show that under heavy level of churn, the proposed mechanism can achieve better performance than other implementations of Kademlia in terms of lookup success rate, average lookup hops and average lookup delay. © 2020 IEEE.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based Dynamic Group Management for Multiple Keywords Searchable Encryption Technology 12

Blockchain-based Dynamic Group Management for Multiple Keywo...

引用

12th international conference on cyber-enabled distributed computing and knowledge discovery, cyberc 2020

作者： Chen, Yuxiang Bai, Jian Hao, Yao Liao, Sijie Yi, Zhongqiang Zhang, Hao Science and Technology on Communication Security Laboratory Chengdu610041 China No.30 Inst China Electronics Technology Group Corporation Chengdu610041 China China Electronics Technology Cyber Security Co. Ltd China

ISBN: (纸本)9781728184487

Searchable Encryption (SE) provides data online search function to users while protecting the data security and the user's query privacy. It has challenges of high computational and storage overhead that should be mitigated for a practical SE system. In this paper, we propose a blockchain-based user management scheme for SE system that can decentralize bandwidth resource consumption. Meanwhile it prevents single point failure and enhances the security protection in order to prevent identity leakage, loss, tampering brought by TTP. It leverages blockchain to offer non-central dynamic user management capability. Our theoretical analysis validates the feasibility and security. Further, experiments are carried out to demonstrate the SE effectiveness. © 2020 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共29页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：