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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

132 篇 会议
10 册 图书
5 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

86 篇 工学
- 74 篇 计算机科学与技术...
- 29 篇 软件工程
- 21 篇 信息与通信工程
- 13 篇 电气工程
- 9 篇 交通运输工程
- 6 篇 控制科学与工程
- 3 篇 电子科学与技术（可...
- 3 篇 生物工程
- 2 篇 动力工程及工程热...
- 2 篇 化学工程与技术
- 1 篇 机械工程
- 1 篇 光学工程
- 1 篇 仪器科学与技术
- 1 篇 材料科学与工程（可...
- 1 篇 石油与天然气工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物医学工程（可授...
- 1 篇 安全科学与工程
22 篇 理学
- 16 篇 数学
- 6 篇 物理学
- 4 篇 生物学
- 3 篇 统计学（可授理学、...
- 2 篇 化学
- 1 篇 地质学
15 篇 管理学
- 11 篇 管理科学与工程(可...
- 6 篇 图书情报与档案管...
- 3 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 医学
- 1 篇 临床医学

主题

27 篇 evolutionary com...
8 篇 genetic algorith...
8 篇 artificial intel...
8 篇 computation by a...
7 篇 optimization
7 篇 algorithm design...
6 篇 measurement
5 篇 computation offl...
5 篇 computational mo...
4 篇 approximation al...
4 篇 indexes
4 篇 statistics
4 篇 mobile edge comp...
4 篇 sociology
4 篇 programming lang...
4 篇 algorithm analys...
4 篇 heuristic algori...
3 篇 parallel process...
3 篇 homomorphic encr...
3 篇 task analysis

机构

2 篇 school of inform...
2 篇 equipe runtime i...
2 篇 leiden univ liac...
2 篇 equipe hiepacs i...
2 篇 shanghai institu...
2 篇 rissho univ
2 篇 jozef stefan ins...
2 篇 hosei univ
2 篇 guangdong provin...
2 篇 jozef stefan int...
2 篇 sorbonne univ cn...
2 篇 school of electr...
2 篇 research institu...
2 篇 department of st...
2 篇 the australian n...
2 篇 faculty of engin...
1 篇 chongqing univ t...
1 篇 college of compu...
1 篇 beihang univ han...
1 篇 department of co...

作者

3 篇 doerr carola
2 篇 jean roman
2 篇 yoshiko hanada
2 篇 schneider thomas
2 篇 vermetten dieder...
2 篇 kok wai wong
2 篇 emmanuel jeannot
2 篇 b. sumudu u. men...
2 篇 yang zheng
2 篇 li guiying
2 篇 abdesselam bouze...
2 篇 jarvinen kimmo
2 篇 tkachenko oleksa...
2 篇 eftimov tome
2 篇 kiss agnes
2 篇 takizawa makoto
2 篇 enokido tomoya
2 篇 yang peng
2 篇 raymond namyst
2 篇 zhang jiayu

语言

147 篇 英文

检索条件"任意字段=17th International Conference and Workshops on Algorithms and Computation"

共 147 条记录，以下是111-120 订阅

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

详细简洁

排序：

Flow-based path selection for Internet traffic engineering with NSGA-II

Flow-based path selection for Internet traffic engineering w...

引用

international conference on Telecommunications (ICT)

作者： El-Sayed M. El-Alfy College of Computer Sciences and Engineering King Fahd University of Petroleum and Minerals Dhahran Saudi Arabia

Traffic engineering has become an important issue in Internet operation due to the fast growing of the Internet traffic and the stringent requirements of quality-of-service over the limited available resources. this problem is a multicriteria optimization problem in nature and our goal in this paper is to explore the application of NSGA-II, an evolutionary algorithm for multiobjective optimization, for determining the optimal distribution of traffic demands over the network. the problem is first formulated as a multiobjective constrained optimization problem which is NP-hard. then, a hybrid heuristic algorithm based on of linear programming and NSGA-II is developed for approximating the optimal Pareto front. We compare the performance of the proposed heuristic using a 10-node problem adopted from the literature with the exact solutions generated using a lexicographic Chebyshev method.

关键词： Internet Telecommunication traffic Routing Quality of service Constraint optimization Evolutionary computation Traffic control Multiprotocol label switching IP networks Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic computation of population protocols

Dynamic computation of population protocols

引用

international conference on Telecommunications (ICT)

作者： Marin Bertier Yann Busnel Anne-Marie Kermarrec IRISA / INSA Rennes Universitaire de Beaulieu France LINA University of Nantes Nantes France INRIA Rennes Bretagne Atlantique France

Population protocols provide theoretical foundations for mobile tiny device networks in which global behavior emerges from a set of simple interactions between anonymous agents. the works in this area mostly focus on studying the computational power of the model. Results hold as long as a fair scheduler, which governs the interactions between nodes, ensures that all reachable system states may eventually happen. this paper studies for the first time the impact of the agents' mobility model on the convergence speed of population protocols, emphasizing the dynamic of the computation. We propose an augmented population protocol model where each edge of the interaction graph is weighted, representing the probability of two agents to interact. this model enables to define the behavior of the scheduler under various mobility models. We have empirically shown that mobility models have a significant impact on the convergence speed of the protocols. In fact, we observed that the uniform distribution always provides the best convergence time. Such a model is representative of the well-known Random Way Point model used to evaluate most of mobile ad-hoc network protocols. In this paper, we formally prove that a uniform distribution of weights provides the lowest bound of average convergence speed for a large class of population protocols. therefore, this analysis reveals that the Random Way Point model, following this distribution, provides the best case scenario questioning its relevance as a reference model.

关键词： Protocols Power system modeling Convergence Disruption tolerant networking Processor scheduling Computer networks Ad hoc networks Mobile ad hoc networks Distributed algorithms Telecommunication computing

来源：评论

学校读者我要写书评

暂无评论

Visual speaker localization aided by acoustic models 09

Visual speaker localization aided by acoustic models

引用

17th ACM international conference on Multimedia, MM'09, with Co-located workshops and Symposiums

作者： Friedland, Gerald Yeo, Chuohao Hung, Hayley International Computer Science Institute 1947 Center Street Berkeley CA 94704 United States University of California Berkeley Dept. of EECS Berkeley CA 94720 United States IDIAP Research Institute P.O. Box 592 CH-1920 Martigny Switzerland

ISBN: (纸本)9781605586083

the following paper presents a novel audio-visual approach for unsupervised speaker locationing. Using recordings from a single, low-resolution room overview camera and a single far-field microphone, a state-of-the art audio-only speaker localization system (traditionally called speaker diarization) is extended so that both acoustic and visual models are estimated as part of a joint unsupervised optimization problem. the speaker diarization system first automatically determines the number of speakers and estimates "who spoke when", then, in a second step, the visual models are used to infer the location of the speakers in the video. the experiments were performed on real-world meetings using 4.5 hours of the publicly available AMI meeting corpus. the proposed system is able to exploit audio-visual integration to not only improve the accuracy of a state-of-the-art (audio-only) speaker diarization, but also adds visual speaker locationing at little incremental engineering and computation costs. Copyright 2009 ACM.

关键词： Audio acoustics

来源：评论

学校读者我要写书评

暂无评论

Ambient media, ambient media computation, and media technology beyond the current state 09

Ambient media, ambient media computation, and media technolo...

引用

17th ACM international conference on Multimedia, MM'09, with Co-located workshops and Symposiums

作者： Lugmayr, Artur R. P.O. Box 541 Korkeakoulunkatu 8 FIN-33101 Tampere Finland

ISBN: (纸本)9781605586083

McLuhan's statement, "the medium is the message" is all-present in discussions within the media community. However, how does ubiquitous and pervasive computation impact when the medium is 'inside' the natural environment of humans? How do location based services, context awareness, emotional responsive interfaces, touch and gesture based interfaces, haptic devices, biometrics, sensor data fusion, mobile embedded systems, distributed networks, and smart data mining change the way of how media are presented, distributed, and consumed? these technical enablers go far beyond existing well known computer screen concepts or simple keyboard and mouse interaction methods. Within the scope of the tutorial several aspects and viewpoints of ambient media are presented: media, technology, HCI, and business. the tutorial presents case-studies and latest research methods in the field of ambient media. Examples of existing services are coming from ambient assisting living, user experience design, sensor networks, distributed systems, and mobile location based services ambient media are explained in further detail. the tutorial intends to train participants in the principles of ambient media and its concepts, content creation techniques, and methods. the tutorial rounds up with a more visionary viewpoint towards media technology in the future: the use of biological metaphors in presenting media, shortly called biological media - 'biomedia'.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Scalable computation for spatially scalable video coding using NVIDIA CUDA and multi-core CPU 09

Scalable computation for spatially scalable video coding usi...

引用

17th ACM international conference on Multimedia, MM'09, with Co-located workshops and Symposiums

作者： Huang, Yen-Lin Shen, Yun-Chung Wu, Ja-Ling Department of Computer Science and Information Engineering National Taiwan University Taipei 10617 Taiwan Graduate Institute of Networking and Multimedia National Taiwan University Taipei 10617 Taiwan

ISBN: (纸本)9781605586083

the scalable video coding (SVC), an extension of H.264/MPEG4-AVC (H.264), was standardized in 2007 by Joint Video Team (JVT). SVC provides spatial, temporal and SNR scalabilities. To achieve these scalabilities, SVC uses additional coding tools and coding modes based on H.264. the coding tools used by SVC and the variety coding modes decision make the corresponding coding complexity become extremely high, so real-time realization of SVC is nearly impossible by using software and single-core CPU only. One possible solution to generate SVC streams in real-time is to parallelize the whole encoding process. Currently, multi-core CPU and GPU are two popular kinds of parallel processing architectures. Not much research has been devoted to realize the parallel SVC encoders based on the co-work of these two architectures. In this paper, a scalable computation model for spatial SVC using multi-core CPU and GPGPU through NVIDIA CUDA is proposed. On the basis of the proposed computational model, a solution to solve the challenging data transition problem (will be detailed later) of this CPU-GPU co-work architecture is then provided. Simulation results show that, through our work, significant speed up gain in spatial SVC encoding can be achieved. Copyright 2009 ACM.

关键词： Scalable video coding

来源：评论

学校读者我要写书评

暂无评论

Decentralized area computation for spatial regions 09

Decentralized area computation for spatial regions

引用

17th ACM SIGSPATIAL international conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009

作者： Sadeq, Muhammad Jafar Duckham, Matt Department of Geomatics University of Melbourne Australia

ISBN: (纸本)9781605586496

this paper addresses the analysis and design of a decentralized algorithm for computing the area of spatial regions, like regions of high temperature or environmental pollution. the algorithm is suitable for application to distributed spatial monitoring systems, like geosensor networks. In such systems, conventional algorithms that rely on centralized control are acknowledged to present substantial constraints to network scalability. the algorithm presented in this paper requires no global knowledge, relying instead purely on a local knowledge about a node and its immediate one-hop neighbors. the paper then indicates avenues for further research, including relaxing strong assumptions about connectivity and region shape (e.g., simple region boundaries), and the application of the algorithm to related problems, such as computing region centroids. Copyright 2009 ACM.

关键词： Geographic information systems

来源：评论

学校读者我要写书评

暂无评论

Improved visibility computation on massive grid terrains 09

Improved visibility computation on massive grid terrains

引用

17th ACM SIGSPATIAL international conference on Advances in Geographic Information Systems, ACM SIGSPATIAL GIS 2009

作者： Fishman, Jeremy Haverkort, Herman Toma, Laura Bowdoin College Brunswick ME United States Eindhoven Univ. of Techn. Eindhoven Netherlands

ISBN: (纸本)9781605586496

this paper describes the design and engineering of algorithms for computing visibility maps on massive grid terrains. Given a terrain T, specified by the elevations of points in a regular grid, and given a viewpoint v, the visibility map or viewshed of v is the set of grid points of T that are visible from v. We describe three new algorithms to compute the viewshed for any given terrain T and viewpoint v. the first two algorithms "sweep" the terrain by rotating a ray around the viewpoint while maintaining the terrain profile along the ray. On a terrain of n grid points, these algorithms run in O(n log n) time and O(sort(n)) I/Os in the I/O-model of Aggarwal and Vitter. the difference between the two algorithms is in the preprocessing before the sweep: the first algorithm sorts the grid points into concentric bands around the viewpoint;the second algorithm sorts the grid points into sectors around the viewpoint. the third algorithm sweeps the terrain centrifugally, growing a star-shaped region around the viewpoint while maintaining the approximate visible horizon of the terrain within the swept region. this algorithm runs in O(n) time and O(scan(n)) I/Os and is cache-oblivious. We tested our algorithms on NASA SRTM data, and found that our fastest new algorithm computes the viewshed of a terrain of 7.6 billion points (28.4 GiB) in 203 minutes on a machine with 0.5 GiB RAM and a laptop-speed hard drive. Depending on the data set, the new algorithm is 20 to 50 times faster than the algorithm from our previous work. Copyright 2009 ACM.

关键词： NASA

来源：评论

学校读者我要写书评

暂无评论

Parallel Library of Multi-objective Evolutionary algorithms

Parallel Library of Multi-objective Evolutionary Algorithms

引用

Euromicro conference on Parallel, Distributed and Network-Based Processing

作者： Coromoto Leon Gara Miranda Eduardo Segredo Carlos Segura Departamento Estadistica I.O. y Computacion Universidad de La Laguna Tenerife Spain

ULL∷A-Team tool is a library that provides a skeleton to solve multi-objective optimization problems by applying evolutionary algorithms. In addition to providing sequential implementations of some of the best-known evolutionary algorithms, the skeleton provides great flexibility in obtaining parallel schemes. this flexibility is achieved by specifying configurations that allow the execution of different parallel evolutionary models: homogeneous island-based model, heterogeneous island-based model and self-adaptive island-based model. To solve a particular problem, the user must specify all its properties by defining a set of C ++ classes. Additionally, the user can also incorporate new evolutionary algorithms to the tool. this work explains how to carry out this task using IBEA algorithm as a case study. In order to check the contribution of the new algorithm, the computational results obtained for the multi-objective knapsack problem are presented.

关键词： Libraries Evolutionary computation Skeleton Algorithm design and analysis Testing Message passing User interfaces

来源：评论

学校读者我要写书评

暂无评论

ProTailor: A Parallel Operator for Extremely Fast Shape Analysis in Bioinformatics Applications

ProTailor: A Parallel Operator for Extremely Fast Shape Anal...

引用

Euromicro conference on Parallel, Distributed and Network-Based Processing

作者： Michela Mortara Antonella Galizia Istituto di Matematica Applicata e Tecnologie Informatiche Consiglio Nationale delle Ricerche Genoa Italy

the geometric shape of molecular surfaces strongly influences the docking processes where, although electrostatic, hydrophobic and van der Waals interactions affect greatly the binding affinity of the molecules, shape complementarity is a necessary condition. the vast majority of molecular docking algorithms uses a brute force enumeration of the transformation space, which requires extremely long running times. Few other methods use local shape feature matching to reduce the search to those relative positions which satisfy geometric constraints. Based on a shape analysis tool developed in Computer Graphics, in this paper we introduce ProTailor, a parallel algorithm for efficient multi-scale detection of morphological features on molecular surfaces. thanks to an almost linear speed-up, we show how ProTailor is well suited to efficiently identify salient features like cavities and depressions, saddle areas or bridges. Feature identification may serve as a powerful tool to automatically locate potential binding sites or as a pre-processing step for efficient shape complementarity assessment in docking prediction.

关键词： Shape Bioinformatics Sequences Amino acids Protein engineering Evolutionary computation Space technology Parallel processing Diseases Nuclear magnetic resonance

来源：评论

学校读者我要写书评

暂无评论

Valid scope computation for location-dependent spatial query in mobile broadcast environments

Valid scope computation for location-dependent spatial query...

引用

17th ACM conference on Information and Knowledge Management, CIKM'08

作者： Lee, Ken C. K. Schiffman, Josh Zheng, Baihua Lee, Wang-Chien Department of Computer Science and Engineering Pennsylvania State University United States School of Information Systems Singapore Management University Singapore

ISBN: (纸本)9781595939913

Wireless data broadcast is an efficient and scalable means to provide information access for a large population of clients in mobile environments. With Location-Based Services (LBSs) deployed upon a broadcast channel, mobile clients can collect data from the channel to answer their location-dependent spatial queries (LDSQs). Since the results of LDSQs would become invalid when mobile client moves to new locations, the knowledge of valid scopes for LDSQ results is necessary to assist clients to determine if their previous LDSQ results can be reused after they moved. this effectively improves query response time and client energy consumption. In this paper, we devise efficient algorithms to determine valid scopes for various LDSQs including range, window and nearest neighbor queries along with LDSQ processing over a broadcast channel. We conduct an extensive set of experiments to evaluate the performance of our proposed algorithms. While the proposed valid scope algorithm incurs only little extra processing overhead, unnecessary LDSQ reevaluation is significantly eliminated, thus providing faster query response and saving client energy. Copyright 2008 ACM.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：