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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

100 篇 会议
3 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

84 篇 工学
- 81 篇 计算机科学与技术...
- 35 篇 信息与通信工程
- 21 篇 软件工程
- 7 篇 电气工程
- 2 篇 电子科学与技术（可...
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 测绘科学与技术
- 1 篇 力学（可授工学、理...
- 1 篇 控制科学与工程
- 1 篇 轻工技术与工程
- 1 篇 网络空间安全
13 篇 理学
- 9 篇 数学
- 2 篇 物理学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
6 篇 管理学
- 4 篇 管理科学与工程(可...
- 3 篇 工商管理
- 2 篇 图书情报与档案管...

主题

9 篇 parallel process...
9 篇 parallel process...
6 篇 application soft...
5 篇 computer archite...
4 篇 grid computing
3 篇 concurrent compu...
3 篇 acceleration
3 篇 semantics
3 篇 hardware
3 篇 middleware
3 篇 field programmab...
3 篇 computer network...
3 篇 engines
2 篇 parallel archite...
2 篇 information syst...
2 篇 deep learning
2 篇 fault tolerance
2 篇 model checking
2 篇 supercomputers
2 篇 software enginee...

机构

2 篇 ericsson researc...
2 篇 eriss university...
2 篇 shanghai jiao to...
2 篇 intel corp santa...
2 篇 nokia siemens ne...
2 篇 telefónica digit...
2 篇 university of st...
2 篇 bull grenoble
1 篇 anyang normal un...
1 篇 university of wy...
1 篇 univ politecn va...
1 篇 university of te...
1 篇 providence univ ...
1 篇 department of co...
1 篇 seconda universi...
1 篇 dpto. de electró...
1 篇 center for embed...
1 篇 inesc id p-9 lis...
1 篇 univ windsor sch...
1 篇 shenyang aerosp ...

作者

2 篇 jhumka arshad
2 篇 di martino benia...
2 篇 feilong tang
2 篇 beyer stefan
2 篇 chuah edward
2 篇 banuls mari-carm...
2 篇 minyi guo
2 篇 galdamez pablo
1 篇 su mei-hui
1 篇 joerg niemoller
1 篇 k. nakano
1 篇 leng xiaoxiang
1 篇 cole murray
1 篇 pombortsis andre...
1 篇 yamagiwa s
1 篇 osrael johannes
1 篇 de mello rodrigo...
1 篇 graniero phil
1 篇 thazhuthaveetil ...
1 篇 moscola james

语言

105 篇 英文

检索条件"任意字段=4th International Symposium on Parallel and Distributed Processing and Applications, ISPA 2006"

共 105 条记录，以下是11-20 订阅

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

详细简洁

排序：

parallel Jess

Parallel Jess

引用

4th international symposium on parallel and distributed Computing (ISPDC 2005)

作者： Petcu, D Western Univ Timisoara Dept Comp Sci Timisoara 300223 Romania

ISBN: (纸本)0769524346

parallel production or rule-based systems, like a parallel version of Jess, are needed for real applications. the proposed architecture for a such system is based on a wrapper allowing the cooperation between several instances Of Jess running on different computers. the system has been designed having in mind the final goal to speedup current P system simulators. Preliminary tests show its efficiency it? this particular case and on classical benchmarks.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

A User Behavior-Based Random Distribution Scheme for Adversarial Example Generated CAPTCHA 19

A User Behavior-Based Random Distribution Scheme for Adversa...

引用

19th IEEE international symposium on parallel and distributed processing with applications (IEEE ispa)

作者： Zheng, Wenwen Wang, Weiqi Ren, Wei Feng, Shiyuan Liu, Shiqin Ren, Yi China Univ Geosci Sch Comp Sci Wuhan Peoples R China Henan Key Lab Network Cryptog Technol Zhengzhou Peoples R China Chinese Acad Sci Inst Informat Engn Key Lab Network Assessment Technol Beijing 100093 Peoples R China Univ East Anglia Sch Comp Sci Norwich NR4 7TJ Norfolk England

ISBN: (纸本)9781665435741

the widespread and mature application of deep learning technology on human behavior analysis leads to the possibility that the Completely Automated Public Turing test to tell Computers and Humans Apart (CAPTCHA) may not be able to accurately determine whether or not the user is human, which makes the distributed denial-of-service (DDoS) attacks launched by deep learning-based malicious automatic computer programs become possible. the CAPTCHA generated by adversarial examples can defend against the automatic identification by the deep learning-based method, however, if the deployed CAPTCHAs are all adversarial examples solely, the adversary has the chance to collect sufficient adversarial examples, which also causes security issues. In this paper, a user behavior-based random distribution scheme for adversarial example generated CAPTCHA is proposed to tackle the above sole distribution problem. Specifically, we generated two kinds of CAPTCHAs, one is normal and the other is generated by the fast gradient signed method (FGSM), i.e., the adversarial examples. Meanwhile, user behaviors are analyzed and associated with a reasonable probability model. According to the probability selection, the normal CAPTCHAs or strong CAPTCHAs will be delivered to the users. the experimental results illustrate that our scheme has an excellent ability to distinguish computers from humans. thus, it can protect the CAPTCHA systems from DDoS attacks.

关键词： Deep learning CAPTCHA adversarial example behavior analysis user behavior-based random distribution

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Data Allocation in Pervasive Computing applications 18

Probabilistic Data Allocation in Pervasive Computing Applica...

引用

18th IEEE Int Symp on parallel and distributed Proc with Applicat (ispa) / 10th IEEE Int Conf on Big Data and Cloud Comp (BDCloud) / IEEE Int Symp on Social Comp and Networking (SocialCom) / IEEE Int Conf on Sustainable Comp and Commun (SustainCom)

作者： Kolomvatsos, Kostas Univ Thessaly Dept Informat & Telecommun Papasiopoulou 2-4 Lamia 35131 Greece

ISBN: (纸本)9781665414852

Pervasive Computing (PC) deals with the placement of services and applications around end users for facilitating their everyday activities. Current advances on the Internet of things (IoT) and the Edge Computing (EC) provide the room for adopting their infrastructures and hosting the desired services for supporting PC applications. Numerous devices present in IoT and EC infrastructures give the opportunity to record and process data through the interaction with users and their environment. Upon these data, the appropriate processing should be realized as requested by end users or applications. It is efficient to process such requests as close as possible to end users to limit the latency in the provision of responses. the research community, identifying this need, proposes the use of the EC as the appropriate place to perform the discussed processing which has the form of tasks or queries. Tasks/queries set specific conditions for data they desire imposing a number of requirements for the dataset upon which the desired processing should be executed. It is wise to pre-process the data and detect their statistics to know beforehand if it is profitable to have any dataset as part of the requested processing. this paper focuses on a model that is responsible to efficiently distribute the collected data to the appropriate datasets. We store similar data to the same datasets and keep their statistics solid (i.e., we meet a low deviation) through the use of a probabilistic approach. the second part of the proposed approach is related to an aggregation scheme upon multiple outlier detection methods. We decide to transfer outliers to Cloud avoiding to store them locally as they will jeopardize the solidity of datasets. If data are going to be locally stored, we provide a mechanism for selecting the most appropriate dataset to host them while we perform a controlled replication to support a fault tolerant system. the performance of the proposed models is evaluated by a high n

关键词： Pervasive Computing Internet of things Edge Computing Data Storage Accuracy Probabilistic Model

来源：评论

学校读者我要写书评

暂无评论

A distributed algorithm for a b-coloring of a graph 4th

引用

4th international symposium on parallel and distributed processing and applications

作者： Effantin, Brice Kheddouci, Hamamache Univ Lyon 1 Lab PRISMa IUT Dept Informat A F-01000 Bourg En Bresse France

ISBN: (纸本)9783540680673

A b-coloring of a graph is a proper coloring where each color admits at least one node (called dominating node) adjacent to every other used color. Such a coloring gives a partitioning of the graph. in clusters for which every cluster has a clusterhead (the dominating node) adjacent to each other cluster. Such a decomposition is very interesting for large distributed systems, networks,... In this paper we present a distributed algorithm to compute a b-coloring of a graph, and we propose an application for the routing in networks to illustrate our algorithm.

关键词： Coloring

来源：评论

学校读者我要写书评

暂无评论

A Data-Driven Dynamic Stochastic Programming Framework for Ride-Sharing Rebalancing Problem under Demand Uncertainty 18

A Data-Driven Dynamic Stochastic Programming Framework for R...

引用

作者： Li, Xiaoming Wang, Chun Huang, Xiao Nie, Yimin Concordia Univ Inst Informat Syst Engn Montreal PQ H3G 1M8 Canada Concordia Univ Concordia John Molson Sch Business JMSB Montreal PQ H3G 1M8 Canada Shenyang Aerosp Univ Sch Comp Shenyang 110136 Peoples R China Ericsson INC Global Artificial Intelligence Accelerator GAIA I Montreal PQ H4R 2A4 Canada

ISBN: (纸本)9781665414852

To make a reasonable decision on ride-sharing platform utilizing time-series historical data, we propose a deep learning-based stochastic programming framework for open driver guidance and rebalancing to further reduce the rider average wait time. the approach proactively guides open drivers to the designated regions by integrating an innovative deep neural network named LSTM-MDN with a two-stage stochastic programming model, which is capable of yielding high quality guidance solutions by leveraging the rider demand information predicted by LSTM-MDN from time-series historical data. To validate the performance of the proposed framework, we conduct a group of numerical experiments based on the New York taxi trip data sets. the results show that our proposed framework is capable of reducing driver rebalancing distance significantly, which implies that the riders' wait time can be decreased effectively. Most importantly, it turns out that by average, riders' wait time with guidance using our approach is 97% lower than the myopic batch matching algorithm without guidance.

关键词： Data-Driven Optimization Stochastic Programming Time-Series Prediction Ride-Sharing

来源：评论

学校读者我要写书评

暂无评论

Towards fully adaptive pipeline parallelism for heterogeneous distributed environments 4th

引用

4th international symposium on parallel and distributed processing and applications

作者： Gonzalez-Velez, Horacio Cole, Murray Univ Edinburgh Sch Informat Inst Comp Syst Architecture Edinburgh EH9 3JZ Midlothian Scotland

ISBN: (纸本)9783540680673

this work describes an adaptive parallel pipeline skeleton which maps pipeline stages to the best processors available in the system and clears dynamically emerging performance bottlenecks at run-time by re-mapping affected stages to other processors. It is implemented in C and MPI and evaluated on a non-dedicated heterogeneous Linux cluster. We report upon the skeleton's ability to respond to an artificially generated variation in the background load across the cluster.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Debugging distributed shared memory applications 4th

引用

4th international symposium on parallel and distributed processing and applications

作者： Olivier, Jeffrey Chen, Chih-Ping Hoeflinger, Jay Intel Corp Santa Clara CA 95051 USA

ISBN: (纸本)9783540680673

A debugger is a crucial part of any programming system, and is especially crucial for those supporting a parallel programming paradigm, like OpenMP. A parallel, relaxed-consistency, distributed shared memory (DSM) system presents unique challenges to a debugger for several reasons: 1) the local copies of a given variable are not always consistent between distributed machines, so directly accessing the variable in the local memory by the debugger won't always work as expected;2) if the DSM and debugger both modify page protections, they will likely interfere with each other;and 3) since a large number of SIGSEGVs occur as part of the normal operation of a DSM program, a program error producing a SIGSEGV may be missed. In this paper, we discuss these problems and propose solutions.

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Privacy Preserving Trajectory Data Publishing with Personalized Differential Privacy 18

Privacy Preserving Trajectory Data Publishing with Personali...

引用

作者： Wen, Ruxue Cheng, Wenqing Huang, Haojun Miao, Wang Wang, Chen Huazhong Univ Sci & Technol Sch Elect Informat & Commun Internet Technol & Engn R&D Ctr ITEC Wuhan 430074 Peoples R China Univ Exeter Dept Math & Comp Sci Exeter EX4 4QF Devon England

ISBN: (纸本)9781665414852

With the development of location-based applications, more and more trajectory data are collected and applied. Trajectory data often contains user's sensitive information, and direct release may pose a threat to users' privacy. Differential privacy, as a privacy preserving method with solid mathematical foundation, has been widely used in trajectory data publishing. However, current methods based on differential privacy can not fully realize the personalized trajectory privacy protection. In this paper, an optimal personalized trajectory differential privacy mechanism is proposed to balance the privacy protection and data utility. Firstly, we filter out the templet trajectory based on the semantic similarity of trajectories, and propose a privacy level allocation method based on stay-point and frequent sub-trajectory. then, the privacy levels of all users' locations are obtained according to the location matching results. Combined with the optimal location differential privacy mechanism, we disturb the location points on the user's trajectory before publishing, where different location privacy levels correspond to different privacy budgets. Experiments on real-world datasets show that compared with traditional differential privacy, our mechanism provides a better tradeoff between privacy protection and data utility.

关键词： Trajectory data publishing personalized differential privacy semantic similarity

来源：评论

学校读者我要写书评

暂无评论

Remote class prefetching: Improving performance of Java applications on grid platforms 4th

引用

4th international symposium on parallel and distributed processing and applications

作者： Cardinale, Yudith De Oliveira, Jesus Figueira, Carlos Univ Simon Bolivar Dept Computac & Tecnol Informac Apartado 89000 Caracas 1080A Venezuela

ISBN: (纸本)9783540680673

In this paper we introduce and evaluate two prefetching techniques to improve the performance of Java applications executed on the grid. these techniques are experimentally evaluated on two grid environments, by running test applications on two different grid deployment configurations. Our testbed is SUMA/G, a grid platform specifically targeted at executing Java bytecode on Globus grids. the experimental results show that these techniques can be effective on improving the performance of applications run on the grid, especially for compute intensive scientific applications.

关键词： Java applications class prefetching computational grids distributed applications collaborative platforms

来源：评论

学校读者我要写书评

暂无评论

Some properties of WK-Recursive and swapped networks

引用

5th international symposium on parallel and distributed processing and applications/ispa 2007 international Workshops

作者： Imanil, Navid Sarbazi-Azad, Hamid Zomaya, Albert Y. IPM Sch Comp Sci Tehran Iran Sharif Univ Technol Tehran Iran Univ Sydney Sch Informat Technol Sydney NSW 2006 Australia

ISBN: (纸本)9783540747413

the surface area which is defined as the number of vertices at a given distance from a base vertex of a graph is considered to be as one of the,most useful yet abstract combinatorial properties of a graph. the applicability of surface area spans many problem spaces such as those in parallel and distributed computing. these problems normally involve combinatorial analysis of underlying graph structures (e.g., spanning tree construction, minimum broadcast algorithms, efficient VLSI layout, performance modeling). In this paper, we focus on the problem of finding the surface area of a class of popular graphs, namely the family of WK-recursive and swapped networks. these are attractive networks due to their useful recursive structures.

关键词： interconnection networks WK-recursive networks swapped networks topological properties surface area

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共11页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：