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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

101 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

49 篇 工学
- 40 篇 计算机科学与技术...
- 22 篇 软件工程
- 6 篇 控制科学与工程
- 4 篇 电气工程
- 4 篇 生物医学工程（可授...
- 4 篇 生物工程
- 3 篇 机械工程
- 3 篇 光学工程
- 2 篇 电子科学与技术（可...
- 2 篇 信息与通信工程
- 2 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 农业工程
32 篇 理学
- 27 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 物理学
- 4 篇 生物学
- 4 篇 系统科学
- 3 篇 化学
- 1 篇 地球物理学
- 1 篇 地质学
7 篇 管理学
- 4 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 农学
- 1 篇 作物学
1 篇 医学
- 1 篇 基础医学(可授医学...
- 1 篇 临床医学
- 1 篇 药学(可授医学、理...

主题

6 篇 cameras
4 篇 image edge detec...
4 篇 vectors
4 篇 algorithm design...
4 篇 image color anal...
3 篇 data mining
3 篇 web pages
3 篇 semantics
3 篇 feature extracti...
3 篇 training
3 篇 heuristic algori...
2 篇 computer science
2 篇 conferences
2 篇 reliability
2 篇 noise reduction
2 篇 search-based sof...
2 篇 delays
2 篇 throughput
2 篇 dictionaries
2 篇 face recognition

机构

4 篇 school of inform...
3 篇 college of compu...
2 篇 college of compu...
2 篇 school of electr...
1 篇 state key labora...
1 篇 national institu...
1 篇 school of comput...
1 篇 computer school ...
1 篇 national satelli...
1 篇 college of compu...
1 篇 dept. computer s...
1 篇 inspur group co....
1 篇 institute of com...
1 篇 new mexico state...
1 篇 faculty of mecha...
1 篇 college of infor...
1 篇 department of me...
1 篇 faculty of engin...
1 篇 department of el...
1 篇 max-planck-insti...

作者

3 篇 chu shu-chuan
3 篇 zoran ivanovski
2 篇 enrico masala
2 篇 wu tsu-yang
2 篇 guojun wang
1 篇 ahlem saddoud
1 篇 debie essam
1 篇 kim seokhwan
1 篇 zhanyang gao
1 篇 lu ke
1 篇 wei hu
1 篇 fister jr. iztok
1 篇 qiang yang
1 篇 reitzig raphael
1 篇 van der lugt aad
1 篇 lailong luo
1 篇 amorim rainer
1 篇 antonio servetti
1 篇 guido maria cort...
1 篇 kačič zdravko

语言

99 篇 英文
3 篇 中文

检索条件"任意字段=15th Workshop on Algorithm Engineering and Experiments, ALENEX 2013"

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

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

详细简洁

排序：

Cursive Style Korean Handwriting Synthesis based on Shape Analysis with Minimized Input Data

Cursive Style Korean Handwriting Synthesis based on Shape An...

引用

International workshop on Intelligent Communication and Social Networks

作者： Suyun Ju Jungpil Shin School of Computer Science and Engineering The University of Aizu

ISBN: (纸本)9781479909735

In this paper we present novel algorithm for the cursive style Korean handwriting synthesis method based on the shape analysis with minimized input data. Hangul (Korean Character) has the different characteristics in structure, that is, character consists of consonants and vowels like English and also it is a combination character like Chinese character. this research aims at using minimal input character data, that is namely consonant and vowel, to synthesize all possible combination of Hangul character. First, we propose the method how to get an inter-strokes information for making position of the natural Korean character. Second, we propose how to synthesize all the Korean characters using small amount of input data and normalized one from some of representative input data. Finally we add a function that concatenates each consonants and vowels for cursive style. By the experiment, we show that the proposed method is effective for synthesis of Hangul by human evaluation.

关键词： Cursive Korean Handwriting Synthesis Shape Analysis

来源：评论

学校读者我要写书评

暂无评论

Cost Model based Analyses on Performance Effects of Loop Transformations in Block Associative Sector Translation

Cost Model based Analyses on Performance Effects of Loop Tra...

引用

International workshop on Intelligent Communication and Social Networks

作者： Joon-Young Paik Tae-Sun Chung Eun-Sun Cho Dept. of Computer Sci. and Engineering Chungnam National University College of Information Technology Ajou University

ISBN: (纸本)9781479909735

In this paper, we investigate how traditional loop transformations affect flash memory performance. To do so, we propose cost models of loop structures in BAST (Block Associative Sector Translation) on flash memory. the proposed cost models reflect not only distinctive characteristics of flash memory but also loop structures, making these new models suitable to loop structures compared with previous cost models. Based on these cost models, we analyze the performance effects of loop transformation, and then determined the referenced order and stride variables which influence the performance in BAST. From the cost models and the experiments, we find out that loop distribution and loop fusion rarely affect performance, while that loop reversal and loop interchange apparently do, due to the one log block to one data block property of BAST. In addition, some loop transformations, when applied to flash memory based programs, can cause unexpected performance variations.

关键词： NAND flash memory FTL (Flash Translation Layer) Loop transformations BAST (Block Associative Sector Translation)

来源：评论

学校读者我要写书评

暂无评论

Component-Based Localization for Wireless Sensor Networks Combining Angle and Distance Information

Component-Based Localization for Wireless Sensor Networks Co...

引用

International workshop on Intelligent Communication and Social Networks

作者： Weitao Hu Jianxin Wang Shigeng Zhang School of Information Science and Engineering Central South University

ISBN: (纸本)9781479909735

Location information of sensor nodes is critical to many wireless sensor network (WSN) applications and protocols. Many localization algorithms have been proposed in the past several years. However, they cannot successfully localize all the localizable nodes in sparse networks in which the average node degree is usually less than 10. In this paper, we propose two component based localization algorithms that can localize many more nodes than state-of-the-art solutions in sparse networks. We first develop BCLA that uses both common nodes and measured distances between nodes of adjacent components to merge components. BCLA outperforms CALL in which only distance measurements are used to merge components. In order to further improve the performance of BCLA, we take into account the angular information among nodes when merging components and propose the CLAD algorithm. We prove the merging conditions for both BCLA and CLAD. Simulation results show that CLAD can locate more than 90 percent of nodes in sparse networks with average node degree 7.5, while CALL can locate only 78 percent of nodes in the same scenario.

关键词： Wireless sensor networks Component-based localization Range-based localization

来源：评论

学校读者我要写书评

暂无评论

LSoVC: A Framework for Taking Live Snapshot of Virtual Cluster in the Cloud

LSoVC: A Framework for Taking Live Snapshot of Virtual Clust...

引用

International workshop on Intelligent Communication and Social Networks

作者： Ruiqi Sun Jie Yang Zhan Gao Zhiqiang He School of Computer Science and Engineering Beihang University Cloud and Intelligent Computing Lab Lenovo (Beijing) Ltd. Lenovo Group

ISBN: (纸本)9781479909735

With the widespread adoption of Cloud computing system, more and more application services based on cluster computing adopt this new computing paradigm. Live snapshot technology is usually used to ensure the reliability of data and high availability of the running virtual machines. this technology is essential to bring abilities of fault recovery and rollback to virtual clusters. Existing virtual machine live snapshot technologies are not enough to cope with the following challenges induced by taking live snapshots for a virtual cluster. One is keeping communication status among virtual machines belonging to a virtual cluster, and the other is minimizing the downtime of virtual machines when taking snapshot for a virtual cluster consisting of a large number of virtual machines. To address both challenges, this paper proposes a virtual cluster live snapshot framework which aims to preserve communication status among virtual machines belonging to a virtual cluster and to minimize the virtual machines downtime and performance overhead of live snapshot. Our experiments show that there is no lost package during taking live snapshot or restoring live snapshot, and that the average downtime of eight virtual machines in a virtual cluster is just 3% longer than that of individual virtual machine during taking live snapshot.

关键词： Cloud computing Virtual machine Virtual cluster Live snapahot

来源：评论

学校读者我要写书评

暂无评论

A New DHT Supporting Multi-Attribute Queries for Grid Information Services

A New DHT Supporting Multi-Attribute Queries for Grid Inform...

引用

International workshop on Intelligent Communication and Social Networks

作者： Yawei Zhao Fei Cai Junjie Xie Lailong Luo Xiaoqiang Teng Honghui Chen Weijie Kong Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology

ISBN: (纸本)9781479909735

Recent structured Peer-to-Peer (P2P) systems can't be simply applied to grid information services, because grid resources need to be registered and searched using multiple attributes. this paper proposes a multi-attribute addressable DHT (MAA-DHT) for grid information services. It uses hypercube as its logical graph and provides a new resource placement mechanism based on the values of all attributes, and then supports query based on all attributes and part attributes. the join of a new object and object query operation based on all attributes can be finished within O(log N) hops for N peers. then, this paper proposes the lookup algorithm based on global index, the corresponding query delay is still O(log N) hops. In particular, in order to maintain the topology, this paper designs a novel stabilization protocol for the MAA-DHT, which also can implement and maintain the global index within O(2 log N) rounds. Furthermore, in order to save storage and query time of the global index, we propose the informed lookup mechanism based on bloom filters, the query based on part attributes still can be finished within O(log N) hops.

关键词： Information Services grids Grid Dihydrotestosterone search time Humulus Hypercube

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the Meeting on algorithm engineering and experiments, alenex 2012

Proceedings of the Meeting on Algorithm Engineering and Expe...

引用

14th Annual Meeting on algorithm engineering and experiments, alenex 2012

ISBN: (纸本)9781611972122

the proceedings contain 15 papers. the topics discussed include: experiments on density-constrained graph clustering;distributed evolutionary graph partitioning;exact combinatorial branch-and-bound for graph bisection;leveling the grid;evaluation of an MSO-solver;the complexity of partial orders;fast compressed tries through path decompositions;solving the minimum string cover problem;computing a consensus of multi-labeled trees;clique cover on sparse networks;an experimental and analytical study of order constraints for single machine scheduling with quadratic cost;user-constrained multi-modal route planning;round-based public transit routing;transit nodes - lower bounds and refined construction;robust mobile route planning with limited connectivity;and hierarchical heavy hitters with the space saving algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Cross Layer Design for Improving Trivial File Transfer Protocol in Mobile Transparent Computing

A Cross Layer Design for Improving Trivial File Transfer Pro...

引用

International workshop on Intelligent Communication and Social Networks

作者： Juan Li Wang Yang Guojun Wang School of Information Science and Engineering Central South University

ISBN: (纸本)9781479909735

In Mobile Transparent Computing, client loads operating systems, applications and user data from server through wireless network. TFTP (Trivial File Transfer Protocol) is implemented to transfer data between client and server in wired LAN (Local Area Network) and is known for simplicity. However, because of the difference between wired and wireless LAN, TFTP is useless in WLAN (Wireless Local Area Network). TFTP uses a lock-step algorithm. that means after sending a data packet, the sender has to wait for an acknowledgement from the receiver before sending the next data packet. So that the transfer rate is limited by the RTT (round-trip time). the WLAN usually has a long latency, in other words, the RTT of WLAN is much higher than LAN, which means that the server is waiting for the arrival of acknowledgement during the most of time during the data transmission process, and wireless channel is idle because there is only one packet being transferred. the TFTP transfer rate is extremely low. To solve this problem, "transfer window" scheme is introduced into TFTP. Meanwhile, in Mobile Transparent Computing, the transmission medium is 802.11a/b/g, and they all provide multi-rate capabilities, which means the bit rate of the wireless channel is changing dynamically, and consequently, the throughout of the channel is changing dynamically. therefore, constant window size is not suitable for the TFTP in Mobile Transparent Computing. In this paper, we propose an improvement of TFTP named DTFTP (Dynamic Trivial File Transfer Protocol). DTFTP is based on a cross-layer design, in which the window size changes reasonably along with the bit rate change. the throughout increases about 54 percent when we use DTFTP to transfer data in Mobile Transparent Computing.

关键词： Mobile intelligent terminals Transparent computing Trivial File Transfer Protocol Cross-layer feedback

来源：评论

学校读者我要写书评

暂无评论

A Partners Assisted Virtual Machine Live Storage Migration for Intensive Disk I/O Workloads

A Partners Assisted Virtual Machine Live Storage Migration f...

引用

International workshop on Intelligent Communication and Social Networks

作者： Xing Jin Hongbo Wang Jianjian Wang Shiduan Cheng Jihan Li State Key Lab of Networking and Switching Techonology Beijing University of Posts and Telecommunications School of Information and Communication Engineering Beijing University of Posts and Telecommunications

ISBN: (纸本)9781479909735

Live migration of virtual machine (VM) enables mobility of VM and contributes to advantages of virtualization like energy saving, high availability, fault tolerance and work load balancing. However solutions of VMs' migration in both theoretical and industrial areas concentrate more on memory migration other than storage migration. Lots of applications with intensive disk I/O operations rely on local storage, especially when it comes to high performance computing. Migration of shared storage is also of necessity for consolidation and workload balance. Current approaches on storage migration can hardly work effectively in disk I/O intensive environment. they cannot reduce migration time and guarantee the disk I/O performance of VMs at the same time. this paper proposes an approach called Partners Assisted Storage Migration (PASM). We are the first to utilize disk I/O ability of pre-allocated storage nodes to relieve the competition between VMs' intensive disk I/O and storage migration. It can migrate VMs' storage effectively comparing to current methods: post-copy and write-mirror. experiments including single VM's migration and multiple VMs' migration show that PASM can save 78.9% migration time and achieve additional 27.1% in disk I/O performance over existing methods.

关键词： Cloud computing Virtualization Live migration Storage migration High performance computing Disk I/O intensive applications

来源：评论

学校读者我要写书评

暂无评论

2011 Proceedings of the 13th workshop on algorithm engineering and experiments, alenex 2011

2011 Proceedings of the 13th Workshop on Algorithm Engineeri...

引用

13th Annual workshop on algorithm engineering and experiments, alenex 2011

the proceedings contain 15 papers. the topics discussed include: a closer look at the closest string and closest substring problem;exact pattern matching with feed-forward bloom filters;fast and lightweight LCP-array construction algorithms;an elimination method for solving bivariate polynomial systems: eliminating the usual drawbacks;a simple parallel Cartesian tree algorithm and its application to suffix tree construction;avoiding communication in numerical linear algebra;disjoint-path facility location: theory and practice;approximate map matching with respect to the fréchet distance;algorithms for matching and predicting trajectories;dependent randomized rounding: the bipartite case;1D vehicle scheduling with conflicts;an SDP approach to multi-level crossing minimization;and simple and efficient distribution- sensitive point location in triangulations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient GPU-Based algorithm for Aligning Huge Sequence Database

Efficient GPU-Based Algorithm for Aligning Huge Sequence Dat...

引用

International workshop on Intelligent Communication and Social Networks

作者： Chun-Yuan Lin Che-Lun Hung Jen-Cheng Huang Dept. Computer Science and Information Engineering Chang Gung University Dept. Computer Science and Communication Engineering Providence University

ISBN: (纸本)9781479909735

Sequence alignment has been widely utilized in biological computing science. To obtain the optimal alignment results many algorithms adopts dynamic programming method to achieve this goal. Smith-Waterman algorithm is the famous in the sequence alignment approach. However, such dynamic programming algorithms are computation-consuming. It is impossible to use these algorithms to compare query sequence with a sequence database such as GenBank and PDB. Recently, GPU computing has been applied in many sequence alignment algorithms to enhance the performance. In this paper, we proposed a GPU-based Smith-Waterman algorithm by combining the CPU and GPU computing capabilities to accelerate alignments on a sequence database. In the proposed algorithm, a filtration mechanism using frequency distance is used to decrease the number of compared sequences. We implemented the Smith-Waterman alignments by CUDA on the NVIDIA Tesla C2050. the experimental results show that the highest speedup ratio is about 80 to 90 times over CPU-based Smith-Waterman algorithm.

关键词： Sequence alignment Smith-Waterman algorithm GPU Parallel processing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：