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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

204 篇 会议
4 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

147 篇 工学
- 122 篇 计算机科学与技术...
- 69 篇 软件工程
- 41 篇 信息与通信工程
- 22 篇 电气工程
- 8 篇 控制科学与工程
- 5 篇 动力工程及工程热...
- 5 篇 生物医学工程（可授...
- 4 篇 电子科学与技术（可...
- 4 篇 土木工程
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 建筑学
- 2 篇 交通运输工程
- 2 篇 农业工程
- 2 篇 环境科学与工程（可...
22 篇 管理学
- 19 篇 管理科学与工程(可...
- 12 篇 工商管理
- 5 篇 图书情报与档案管...
21 篇 理学
- 14 篇 数学
- 5 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 大气科学
- 2 篇 系统科学
6 篇 法学
- 3 篇 法学
- 3 篇 社会学
5 篇 经济学
- 5 篇 应用经济学
5 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
- 3 篇 公共卫生与预防医...
2 篇 农学

主题

27 篇 cloud computing
16 篇 mobile computing
11 篇 internet
10 篇 distributed comp...
9 篇 social networkin...
9 篇 peer-to-peer com...
8 篇 routing
8 篇 wireless sensor ...
8 篇 protocols
7 篇 software enginee...
6 篇 artificial intel...
6 篇 distributed data...
5 篇 fault tolerance
5 篇 computer archite...
5 篇 smart phones
5 篇 security
5 篇 mobile communica...
4 篇 peer to peer com...
4 篇 grid computing
4 篇 resource managem...

机构

3 篇 department of in...
3 篇 univ fed paraiba...
3 篇 beijing jiaotong...
2 篇 inria
2 篇 rhein westfal th...
2 篇 department of co...
2 篇 parallel and dis...
2 篇 parallel wireles...
2 篇 univ minnesota d...
2 篇 freelance kanaga...
2 篇 faculty of elect...
2 篇 department of co...
2 篇 amrita vishwa vi...
2 篇 univ stuttgart i...
1 篇 anna university ...
1 篇 king abdulaziz u...
1 篇 sprint
1 篇 department of co...
1 篇 techno internati...
1 篇 department of co...

作者

3 篇 teruhisa hochin
3 篇 shen hong
2 篇 jin miao
2 篇 duerr frank
2 篇 shigeaki tanimot...
2 篇 zhou hongyu
2 篇 hiroki nomiya
2 篇 mostefaoui achou...
2 篇 motoi iwashita
2 篇 raynal michel
2 篇 mokbel mohamed f...
2 篇 li yidong
2 篇 sattler kai-uwe
2 篇 hiep hoang-van
2 篇 chen chao-chun
2 篇 henze martin
2 篇 iwashita motoi
2 篇 ziegeldorf jan h...
2 篇 wu hongyi
2 篇 chuang kun-ta

语言

209 篇 英文
1 篇 其他

检索条件"任意字段=14th International Conference on Distributed Computing and Networking, ICDCN 2013"

共 210 条记录，以下是61-70 订阅

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

详细简洁

排序：

MobiHoc 2013 - Proceedings of the 14th ACM international Symposium on Mobile Ad Hoc networking and computing

MobiHoc 2013 - Proceedings of the 14th ACM International Sym...

引用

14th ACM international Symposium on Mobile Ad Hoc networking and computing, MobiHoc 2013

ISBN: (纸本)9781450321938

the proceedings contain 40 papers. the topics discussed include: balancing lifetime and classification accuracy of wireless sensor networks;FAVOR: frequency allocation for versatile occupancy of spectrum in wireless sensor networks;barrier coverage in bistatic radar sensor networks: Cassini oval sensing and optimal placement;distributed greedy approximation to maximum weighted independent set for scheduling with fading channels;on the performance of largest-deficit-first for scheduling real-time traffic in wireless networks;Qute: quality-of-monitoring aware sensing and routing strategy in wireless sensor networks;CSMA over time-varying channels: optimality, uniqueness and limited backoff rate;on the instantaneous topology of a large-scale urban vehicular network: the cologne case;social trust and social reciprocity based cooperative D2D communications;and on bridging the gap between homogeneous and heterogeneous rendezvous schemes for cognitive radios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How to survive and thrive in a private bittorrent community

How to survive and thrive in a private bittorrent community

引用

14th international conference on distributed computing and networking, icdcn 2013

作者： Jia, Adele Lu Chen, Xiaowei Chu, Xiaowen Pouwelse, Johan A. Epema, Dick H. J. Department of Computer Science Delft University of Technology Netherlands Department of Computer Science Hong Kong Baptist University Hong Kong

ISBN: (纸本)9783642356674

Many private BitTorrent communities employ Sharing Ratio Enforcement (SRE) schemes to incentivize users to contribute. It has been demonstrated that communities that adopt SRE are greatly oversupplied, i.e., they have much higher seeder-to-leecher ratios than communities in which SRE is not employed. Most previous studies focus on showing the positive effect of SRE in achieving high downloading speed. However, in this paper we show through measurements that SRE also induces severe side-effects. Under SRE, users are forced to seed for excessively long times to maintain adequate sharing ratios to be able to start new downloads, though most of the time their seedings are not very productive (in terms of low upload speed). We also observe that many users who seed for very long times still have low sharing ratios. We find that this is due to the counter-intuitive phenomenon that long seeding times do not necessarily lead to large upload amounts. Based on these observations, we discuss possible strategies for users to gain sharing ratios efficiently, which help them to survive and thrive in private communities. © Springer-Verlag 2013.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance of Deadline Constrained Tasks based on Load Balancing in Cloud computing 14

Fault Tolerance of Deadline Constrained Tasks based on Load ...

引用

14th international conference on computing Communication and networking Technologies, ICCCNT 2023

作者： Kirti, Medha Maurya, Ashish Kumar Yadav, Rama Shankar Motilal Nehru National Institute of Technology Allahabad Department of Computer Science and Engineering Prayagraj India

ISBN: (纸本)9798350335095

Although cloud computing has been extensively studied in the past, there are still serious problems with task balancing in cloud-based systems. Effective load allocation is one of the most importance challenge in cloud computing as the available resources and virtual machines are limited. Excessive load on virtual machine may leads to failure of deadline constrained tasks as the task fails to meet deadline. In this paper, we proposed a load balancing technique for deadline constrained tasks which balance the workload among virtual machine to minimize the task rejection ratio. the proposed algorithm uses double threshold policy to measure the current load of node after allocating load which reduces the chance of task failure due to deadline miss. Tasks are distributed to underloaded nodes to balance the load and the algorithm dynamically check the status of nodes after every allocation. the proposed algorithm eliminates workload imbalance, maximize resource utilization, and minimize task rejection ratio. the proposed algorithm is implemented using Python platform. the result shows that the proposed load-balancing algorithm outperforms the existing algorithm. © 2023 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

A Platform for Privacy-Preserving Geo-Social Recommendation of Points of Interest

A Platform for Privacy-Preserving Geo-Social Recommendation ...

引用

IEEE 14th international conference on Mobile Data Management (MDM)

作者： Riboni, Daniele Bettini, Claudio Univ Milan Dept Comp Sci EveryWare Lab I-20135 Milan Italy

ISBN: (纸本)9781467360685

Different recommender systems suggest points of interest (POIs) based on data shared through geo-social networks (GSN). these systems are a very useful resource for mobile users, and an important business opportunity for advertisers. However, GSN data (e. g., the check-in of a person in a particular place) may be private information that a user may not want to release outside her social network. Even if the GSN service is trusted, and users' data is not directly released, an adversary may be able to reconstruct the data of a GSN user by mining the received recommendations. In this demo we will illustrate an implementation of the POI-Ti-Dico platform for privacy-conscious geo-social recommendation of POIs. the platform includes a server-side private recommender system and a mobile app for the Android framework. Recommendations are computed using a very large dataset of real check-ins.

关键词： advertising data processing data mining data privacy mobile computing recommender systems social networking (online) trusted computing

来源：评论

学校读者我要写书评

暂无评论

A Game theory-based Approach to Service Rating 14

A Game Theory-based Approach to Service Rating

引用

14th international conference on Parallel and distributed computing, Applications and Technologies (PDCAT)

作者： Ye, Xinfeng Zheng, Jupeng Khoussainov, Bakh Univ Auckland Dept Comp Sci Auckland 1 New Zealand

ISBN: (纸本)9781479924189

Most recommender systems proposed for service computing do not address the attacks on service rating systems. this paper proposed a service rating system that is capable of countering malicious manipulations. the system predicts how customers rate services based on the ratings given by the similar users of the customers and the trustworthy experienced users. the proposed scheme uses the collaborative filtering technique and a game theory-based approach in choosing users for rating prediction. Compared with existing schemes, the proposed scheme is more effective in countering malicious manipulations.

关键词： recommender system game theory service computing

来源：评论

学校读者我要写书评

暂无评论

Identification of distributed Denial of Service Attacks Employing L-BFGS Tuning 14

Identification of Distributed Denial of Service Attacks Empl...

引用

14th international conference on computing Communication and networking Technologies, ICCCNT 2023

作者： Singh, Vikas Dehalwar, Vasudev Bharti, Jyoti Manit Bhopal Department of Cse Bhopal India

ISBN: (纸本)9798350335095

Internet speed and capacity are crucial components of any communication technology in the modern era. Customers should expect excellent speed and a lot of bandwidth. A DDoS (distributed denial of service) assault, which is a well-known attack, is the biggest threat in communication. DDoS attacks limit the user's speed and bandwidth. In order to produce this work, we used the updated dataset, CICDDoS2019, and undertook tests using a variety of machine learning methods. We investigated which features had the strongest relationships with the analysis's projected classes. this research proposal offers a machine learning-based L-BFGS (Limited-memory Broyden-Fletcher-Goldfarb-Shanno) algorithm-based DDoS assault detection method. An HPC Python platform was used to carry out the simulation and experiment for the suggested research project. the accuracy, true and false negatives, along with true and false positives, confusion matrix structures, and other outcome measures are all evaluated in this study. the proposed method shows better results as compared to other previous methods. Index Terms - DDoS attack, MLP Classifier, LBFGS, Machine Learning. © 2023 IEEE.

关键词： Denial-of-service attack

来源：评论

学校读者我要写书评

暂无评论

distributed Complex Event Processing in Sensor Networks

Distributed Complex Event Processing in Sensor Networks

引用

IEEE 14th international conference on Mobile Data Management (MDM)

作者： Saleh, Omran Sattler, Kai-Uwe Ilmenau Univ Technol Fac Comp Sci & Automat Ilmenau Germany

ISBN: (纸本)9781467360685

Mobile systems which include sensor networks, generate a continuous unmatched volume of primitive event streams with various properties where the interior semantic information of these events is generally very limited. Moreover, forwarding all these events to a central processing entity is not favored for limited-resource systems, it would deplete nodes' resources e. g., the energy. the goal of this work is to address these issues by extracting useful information locally, transmitting only this information and avoiding transmission of unnecessary low-level data between nodes. therefore, an In-Network distributed Complex Event Processing (INDCEP) based solution is proposed. INDCEP technology is used to perform the processing within the network by pushing complex event processing into network nodes. this research aims to develop a robust and high performance distributed Complex Event Processing Engine for Mobile Systems (CEPEMS) based on aforementioned technology. It focuses on distributed event detection via disseminating distributed plans into a network of sensor nodes to perform complex event tasks. Furthermore, we present an optimization technique for the distributed queries and cost model to decide which query portions can be executed whether inside sensor nodes or at local CEP engine instance in a centralized point.

关键词： distributed processing mobile radio query processing telecommunication computing wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Fault-tolerant design of wireless sensor networks with directional antennas

Fault-tolerant design of wireless sensor networks with direc...

引用

14th international conference on distributed computing and networking, icdcn 2013

作者： Shirazipourazad, Shahrzad Sen, Arunabha Bandyopadhyay, Subir School of Computing Informatics and Decision System Engineering Arizona State University Tempe AZ 85281 United States School of Computer Science University of Windsor Windsor ON N9B 3P4 Canada

ISBN: (纸本)9783642356674

A tree structure is often used in wireless sensor networks to deliver collected sensor data to a sink node. Such a tree can be built using directional antennas as they offer considerable advantage over the omni-directional ones. A tree is adequate for data gathering from all sensor nodes as long as no node in the tree fails. Since the connectivity of the tree is one, failure of any one node disconnects the tree and may disable the sink node from collecting data from some of the sensor nodes. In this paper we study the problem of enhancing the fault tolerance capability of a data gathering tree by adding a few additional links so that the failure of any one sensor would not disconnect the tree. Assuming that the addition of each link to the tree involves some cost, we study the problem of least-cost augmentation of the tree, so that even after failure of a single node, all the surviving nodes will remain connected to the sink node. We prove that the least-cost tree augmentation problem is NP-complete. Moreover, we provide an approximation algorithm with performance bound of two. the experimental evaluations of the algorithm demonstrate that the approximation algorithm performs even better in practice and almost always produces near-optimal solution. © Springer-Verlag 2013.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Learning-based Characterizing and Modeling Performance Bottlenecks of Big Data Workloads

Learning-based Characterizing and Modeling Performance Bottl...

引用

18th IEEE international conference on High Performance computing and Communications (HPCC) / 14th IEEE international conference on Smart City (Smart City) / 2nd IEEE international conference on Data Science and Systems (DSS)

作者： Guo, Zhongxin Hu, Zheng Zhang, Chunhong Pu, Youer Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing Peoples R China Beijing Univ Posts & Telecommun Key Lab Universal Wireless Commun Minist Educ Beijing Peoples R China Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781509042975

As the increasing demands of large-scale data analytics, the understanding of performance bottlenecks on big data workloads becomes critical for the optimization of distribution platforms. Existing work focused on qualitatively characterizing the behaviors and performance of workloads. However little effort has been spent on quantification of performance bottlenecks and building bottleneck models. In this paper, we define a series of bottleneck ratios to quantify bottlenecks according to resource utilizations. then based on features parsed from original logs, a stage-level modeling approach is proposed to characterize bottlenecks of workloads. By modeling, we can estimate bottleneck ratios using original logs, without collecting resource utilizations. To generalize the models for diverse workloads, we propose a workload generator: TrainBench, which is flexible to generate workloads with multifarious behaviors at stage-level. In addition, taking hardware performance into account, three key features are extracted to improve the estimation accuracy. Our bottleneck models perform well for diverse workloads in different clusters.

关键词： Big data workloads distributed computing Performance bottlenecks

来源：评论

学校读者我要写书评

暂无评论

Understanding Vulnerabilities of Location Privacy Mechanisms against Mobility Prediction Attacks 2017

Understanding Vulnerabilities of Location Privacy Mechanisms...

引用

14th EAI international conference on Mobile and Ubiquitous Systems - computing, networking and Services (MobiQuitous)

作者： Riaz, Zohaib Duerr, Frank Rothermel, Kurt Univ Stuttgart Inst Parallel & Distributed Syst Stuttgart Germany

ISBN: (纸本)9781450353687

In today's online social networks such as Facebook, users increasingly share their location information as a popular type of personal information. However, since location data can leak privacy-sensitive information about individuals such as the type of places they like to visit, a number of location obfuscation mechanisms have been proposed to avoid such disclosure. these mechanisms publish bigger regions containing the actual user location in order to make it imprecise. thus an attacker may find it hard to precisely locate the user in a privacy-sensitive place such as a hospital. In this paper, we show that state-of-the-art location obfuscation mechanisms do not provide privacy guarantees against attacks based on mobility prediction. In this regard, we design and demonstrate a mobility predictions attack that exploits location history information of users and show its effectiveness on a year-long real-world location dataset. In particular, our results show that such an attack can successfully de-obfuscate up to 50% of sensitive user visits with high precision (>= 80%), even when the location history data used for the attack is already obfuscated. We also analyze the success of our mobility prediction attacks and suggest important design improvements for future location privacy mechanisms.

关键词： location privacy attack algorithms semantic location information usability prediction hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：