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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

78 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

66 篇 工学
- 66 篇 计算机科学与技术...
- 56 篇 软件工程
- 6 篇 信息与通信工程
- 3 篇 控制科学与工程
- 2 篇 建筑学
- 2 篇 土木工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 水利工程
8 篇 理学
- 8 篇 数学
- 1 篇 大气科学
- 1 篇 系统科学
3 篇 管理学
- 2 篇 图书情报与档案管...
- 1 篇 管理科学与工程(可...
- 1 篇 工商管理

主题

7 篇 parallel computi...
4 篇 parallel optimiz...
3 篇 deep learning
3 篇 gpu
2 篇 parallel program...
2 篇 high performance...
2 篇 mobile device
2 篇 parallel algorit...
1 篇 petri net
1 篇 dsps
1 篇 data pipeline
1 篇 distributed dnn ...
1 篇 reliability
1 篇 query processing
1 篇 parallel process...
1 篇 geometric modeli...
1 篇 instrumentation
1 篇 segmentation
1 篇 query languages
1 篇 virtual addresse...

机构

2 篇 zhengzhou univ z...
2 篇 univ chinese aca...
2 篇 beihang univ bei...
2 篇 beihang univ han...
2 篇 univ hannover in...
2 篇 qilu univ techno...
2 篇 natl univ def te...
2 篇 natl univ def te...
2 篇 hunan univ coll ...
2 篇 natl univ def te...
1 篇 xian univ sci & ...
1 篇 center for relia...
1 篇 univ otago sch c...
1 篇 zhongguancun lab...
1 篇 asia univ dept p...
1 篇 univ so queensla...
1 篇 beijing univ pos...
1 篇 qingdao binhai u...
1 篇 univ waterloo de...
1 篇 int comp sci ins...

作者

3 篇 zhang lin
2 篇 huang tsung-chua...
2 篇 ren zenghui
2 篇 fu zongkai
2 篇 guo ying
2 篇 niu jianwei
2 篇 liu jie
2 篇 pan jingshan
2 篇 ouyang zhenchao
2 篇 liu tao
2 篇 wang qinglin
2 篇 liu zhaoyuan
2 篇 kneip j
1 篇 du haiwen
1 篇 lagana a.
1 篇 peng shaoliang
1 篇 lan yanzhi
1 篇 jiang lin
1 篇 ieee victorian s...
1 篇 zhu jiayang

语言

79 篇 英文

检索条件"任意字段=3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997"

共 79 条记录，以下是41-50 订阅

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

详细简洁

排序：

Design Flaws in a Secure Medical Data Exchange Protocol Based on Cloud Environments 15th

Design Flaws in a Secure Medical Data Exchange Protocol Base...

引用

15th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Li, Chun-Ta Lee, Cheng-Chi Wang, Chun-Cheng Yang, Tzu-Hui Chen, Song-Jhih Fu Jen Catholic Univ Dept Lib & Informat Sci 510 Jhongjheng Rd New Taipei 24205 Taiwan Asia Univ Dept Photon & Commun Engn Taichung 41354 Taiwan Tainan Univ Technol Dept Informat Management Tainan 71002 Taiwan

ISBN: (纸本)9783319271613;9783319271606

With the growing popularity of network technologies, cloud-based health care applications are becoming an essential part of telecare medical information systems have been widely studied in recent years. To protect patient privacy and restrict the access of precious services for legal privileged participants only, many secure medical data exchange protocols have been widely utilized for various service-oriented medical systems. In 2014, Chen et al. proposed a secure medical data exchange protocol based on cloud environments. They claimed that their protocol achieves better security as compared to those for other existing medical-oriented systems. However, in this paper, we found that Chen et al.'s data exchange protocol has two functional weaknesses such as (1) it fails to provide real-time monitoring service, (2) it has two design flaws in doctor treatment phase and is not easily reparable.

关键词： Anonymity Authentication Body sensors Cloud Medical data Mobile device Security

来源：评论

学校读者我要写书评

暂无评论

Strategies for Evacuating from an Affected Area with One or Two Groups

Strategies for Evacuating from an Affected Area with One or ...

引用

14th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Wei, Qi Shi, Yuan Jiang, Bo Wang, Lijuan Dalian Maritime Univ Sch Informat Sci & Technol Linghai Rd 1 Dalian Peoples R China Dalian Inst Sci & Technol Sch Informat Sci & Technol Dalian Peoples R China

ISBN: (纸本)9783319111971;9783319111964

This paper considers the problem faced by a group of evacuees who must leave from an affected area as quickly as possible. We seek the strategies that achieve a bounded ratio of evacuation path length without any boundary information to that with. We restrict the affected area to a convex region in the plane, and investigate the problem in two scenarios: general plane and plane in grid network. In these two scenarios, we first present efficient strategies with one or two groups and analyze the competitive ratios of them. In general plane, we give a 30.47-competitive strategy for one group evacuation and a 15.58-competitive strategy for two groups evacuation. In grid network, we give a 33-competitive strategy for one group evacuation and a 19-competitive strategy for two groups evacuation.

关键词： Computational geometry Evacuation strategy Competitive analysis Convex region Grid network

来源：评论

学校读者我要写书评

暂无评论

rd-PCA: A Traffic Condition Data Imputation Method Based on Robust Distance 1

引用

14th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Wan, XueJin Du, Yong Wang, Jiong Beijing Transportat Informat Ctr Beijing Peoples R China

ISBN: (数字)9783319111971

ISBN: (纸本)9783319111971;9783319111964

Dynamic Transportation Information Service has penetrated into residents' travels. The current problems that transportation information services face are variable such as real-time traffic forecasting, traffic managing and traffic induction. The above problems are related to the quality of historical traffic condition data. Due to a limited of GPS data collecting, the collected GPS data which scarcely covers the whole road network leads to incomplete and error traffic condition data. In consequence, two serious problems of traffic condition data quality manifest in incompleteness and low accuracy. This paper extends rd-PCA method which preliminarily focuses on the accuracy of imputing to prevent the estimating results from being impacted by outliers and aims at guaranteeing the completeness of imputing. The method excludes error data taking data quality measurement criterions. By adopting a measure factor, this method detects outliers and standardizes them, then constructs a robust feature space and imputes the missing data. The experimental results show that the proposed method can guarantee a high completeness and high accuracy under the condition of different missing rates.

关键词： Imputing missing data robust feature space outliers detecting accuracy

来源：评论

学校读者我要写书评

暂无评论

FIDs classifier for artificial intelligence and its application

FIDs classifier for artificial intelligence and its applicat...

引用

12th international conference on algorithms and architectures for parallel processing, ica3pp 2012

作者： Wei, Chih-Chiang Department of Information Management Toko University No. 51 Sec. 2 University Rd. Pu-Tzu City Chia-Yi County 61363 Taiwan

ISBN: (纸本)9783642330643

Fuzzy ID3 (FIDs) is popular and efficient method of making fuzzy decision trees in recent years. This paper presents FIDs algorithm for the precipitations during typhoon periods for a reservoir watershed. The FIDs was constructed as the quantitative precipitation forecast (QPF) model. This study also constructed the traditional C4.5 and the average statistical model (AVS) to compare with the performance by FIDs model. The steps involve collecting typhoon data, preprocessing the typhoon patterns, building QPF models, and training and testing the models. The experiment was in Shihmen Reservoir watershed. The results include the analysis of the 1-, 3-, and 6-hr accumulated rainfalls. The results showed that the superior RMSE and the categorical statistics of BIAS and ETS scores by using FIDs in contrast to those by using traditional C4.5 and AVS. Consequently, the FIDs model demonstrated its feasibility for predict rainfalls. © 2012 Springer-Verlag.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

Scheduling Concurrent Workflows in HPC Cloud through Exploiting Schedule Gaps

引用

11th international conference on algorithms and architectures for parallel processing (ica3pp)

作者： Jiang, He-Jhan Huang, Kuo-Chan Chang, Hsi-Ya Gu, Di-Syuan Shih, Po-Jen Natl Taichung Univ Educ Dept Comp & Informat Sci 140 Min Shen Rd Taichung Taiwan Natl Ctr High Performance Comp Natl Appl Res Lab Hsinchu Taiwan

ISBN: (纸本)9783642246494

Many large-scale scientific applications are usually constructed as workflows due to large amounts of interrelated computation and communication. Workflow scheduling has long been a research topic in parallel and distributed computing. However, most previous research focuses on single workflow scheduling. As cloud computing emerges, users can now have easy access to on-demand high performance computing resources, usually called HPC cloud. Since HPC cloud has to serve many users simultaneously, it is common that many workflows submitted from different users are running concurrently. Therefore, how to schedule concurrent workflows efficiently becomes an important issue in HPC cloud environments. Due to the dependency and communication costs between tasks in a workflow, there usually are gaps formed in the schedule of a workflow. In this paper, we propose a method which exploits such schedule gaps to efficiently schedule concurrent workflows in HPC cloud. The proposed scheduling method was evaluated with a series of simulation experiments and compared to the existing method in the literature. The results indicate that our method can deliver good performance and outperform the existing method significantly in terms of average makespan, up to 18% performance improvement.

关键词： HPC cloud workflow scheduling distributed gap search

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for the shortest path problem with forbidden paths

引用

9th international conference on algorithms and architectures for parallel processing, ica3pp 2009

作者： Hsu, Chiun-Chieh Chen, Da-Ren Ding, Hua-Yuan Department of Information Management National Taiwan University of Science and Technology 43 Sec.4 Keelung Rd. Taipei 106 Taiwan Department of Information Management Hwa Hsia Institute of Technology 111 Gong Jhuan Rd. Chung Ho Taipei 235 Taiwan

ISBN: (纸本)3642030947

In this paper, we discuss the shortest path problem with forbidden paths (SppFP), where the constraints come from a set of forbidden paths (arc sequences) that cannot be part of any feasible solution. SppFP can be used to solve the problems with hard-to-modeled path constraints or to implement exact branching *** method proposed by Villeneuve and Desaulniers first transfer the SppFP problem to the k-shortest paths problem. We propose an algorithm which reduces execution time of solving the SppFP problem via a nodes combination process. It improves the approach proposed by Villeneuve and Desaulniers. In addition, their algorithm for generating augmented paths could cause the inconsistency in particular situations. The proposed method also improves the weakness without increasing its time complexity. © 2009 Springer Berlin Heidelberg.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Construct the load-balanced topology in NEMO

引用

9th international conference on algorithms and architectures for parallel processing, ica3pp 2009

作者： Li, Long-Sheng Lee, Gwo-Chuan Kang, Li-Keng Mei, Jhu-Shyuan Department of Computer Science and Information Engineering National Chiayi University 300 Syuefu RD. Chiayi City 60004 Taiwan Department of Computer Science and Information Engineering National United University 1 Lien Da Kung-Ching Li Miao-Li 360 Taiwan

ISBN: (纸本)3642030947

The Mobile Network (MONET) is a single network unit and can move around arbitrarily. The NEMO protocol is a way of managing the mobility of an entire MONET which changes its access point to the Internet. In NEMO, the Mobile Router (MR) acts as a central point of Internet attachment for all the mobile nodes, and it is likely to be a potential bottleneck because of its limited wireless link capacity. However, in original NEMO protocol, the MR cannot select a less loaded access router (AR) to connect to the Internet when NEMO handoff occurs. To construct a load balancing NEMO, the mechanism for choosing a suitable AR should be further studied. In this paper we propose two clustering algorithms to construct one NEMO. Further, two load balancing schemes are proposed to resolve the load-balanced handoff problem in NEMO. The simulation results show that the proposed constructing algorithms and load balancing schemes could significantly improve the performance of NEMO in terms of delivery ratio, load balancing index and host-to-host delay. © 2009 Springer Berlin Heidelberg.

关键词： Routers

来源：评论

学校读者我要写书评

暂无评论

Reliable greedy forwarding in obstacle-aware wireless sensor networks

引用

9th international conference on algorithms and architectures for parallel processing, ica3pp 2009

作者： Hsu, Ming-Tsung Lin, Frank Yeong-Sung Chang, Yue-Shan Juang, Tong-Ying Dept. of Information Management National Taiwan University No. 1 Sec. 4 Roosevelt Road Taipei 10617 Taiwan Dept. of Computer Science and Information Engineering National Taipei University 151 University Rd. San Shia Taipei 23741 Taiwan

ISBN: (纸本)3642030947

We present Obstacle-aware Virtual Circuit geographic Routing (OVCR), a novel routing mechanism for obstacle-aware wireless sensor networks that uses the obstacle-free path computed by the sink to make the greedy forwarding of geographic routing dependable. OVCR discovers obstacle-free paths by the powerful sink as obstacles are detected. To bypass obstacles, the information of obstacle-free paths is forwarded to sensors close to obstacles for finding virtual circuits in a distributed manner. A virtual circuit containing a sequence of relay positions (temporary destinations) is used for obstacle-free data packet forwarding. Data packets can then be forwarded greedily, either by the location of the destination, or the relay position. Simulation results show that OVCR is more dependable since the success rate of packet forwarding is raised and more efficient since the hop count is reduced. © 2009 Springer Berlin Heidelberg.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A cluster-based data routing for wireless sensor networks

引用

9th international conference on algorithms and architectures for parallel processing, ica3pp 2009

作者： Wang, Hao-Li Chao, Yu-Yang Department of Computer Science and Information Engineering National Chiayi University Syuefu Rd. Chiayi City 60004 Taiwan

ISBN: (纸本)3642030947

To promise low energy consumption for wireless sensor network routing, a number of routing protocols have been published. A novel routing protocol called BeamStar was proposed in [6]. In BeamStar, each base station uses a directional antenna with power control to assist locating sensors. It shifts the burden of network control and management from resource-limited sensors to resource-abundant and more sophisticate base stations, but still has three serious problems. The different size between the nearer and farther region, base station's scanning time, and a great quantity of inter-node communication all waste precious energy. In the cause of solving these problems, we present a routing protocol, namely Cluster-based BeamStar (CBS), for wireless sensor networks. CBS follows cluster-based structure to decrease the volume of inter-node communication and we have reformed the scanning manner in BeamStar. Our simulations show that CBS is scalable, low-cost, and energy efficient. © 2009 Springer Berlin Heidelberg.

关键词： Routing protocols

来源：评论

学校读者我要写书评

暂无评论

1997 3rd international conference on algorithms and architectures for parallel processing, ica3pp 1997

1997 3rd International Conference on Algorithms and Architec...

引用

3rd international conference on algorithms and architectures for parallel processing, ica3pp 1997

ISBN: (纸本)0780342291

The proceedings contain 62 papers. The topics discussed include: adaptive routing for a bus-based multiprocessor;multi-node broadcasting in hypercubes and star graphs;calculating optimal flit size and upper limit on the performance of wormhole routing;prioritized physical channel scheduling in wormhole networks;an object-oriented data cache architecture for programmable parallel digital signal processors;a systolic architecture for sorting an arbitrary number of elements;virtual parallel processors;parallel information retrieval on a distributed memory multiprocessor system;modeling and evaluation of a new cluster-based system for commercial applications;a simulator construction methodology for the shiva multiprocessor system;and Dycos - a customizable kernel architecture supporting distributed operating environments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：