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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

199 篇 会议
10 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

132 篇 工学
- 116 篇 计算机科学与技术...
- 58 篇 软件工程
- 27 篇 信息与通信工程
- 23 篇 电气工程
- 9 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 5 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 仪器科学与技术
- 3 篇 化学工程与技术
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 1 篇 机械工程
- 1 篇 光学工程
39 篇 理学
- 30 篇 数学
- 6 篇 生物学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 物理学
- 2 篇 化学
- 1 篇 地球物理学
- 1 篇 地质学
14 篇 管理学
- 12 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
- 3 篇 工商管理
6 篇 医学
- 5 篇 临床医学
- 3 篇 基础医学(可授医学...
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 艺术学

主题

21 篇 evolutionary com...
11 篇 optimization
10 篇 computation theo...
10 篇 computational mo...
8 篇 algorithms
8 篇 heuristic algori...
7 篇 signal processin...
6 篇 convergence
6 篇 genetic algorith...
6 篇 machine learning
6 篇 clustering algor...
6 篇 data structures
5 篇 statistics
5 篇 resource managem...
5 篇 servers
5 篇 algorithm design...
5 篇 artificial intel...
5 篇 edge computing
4 篇 computer science
4 篇 theory of comput...

机构

2 篇 univ bonn bonn
2 篇 univ manitoba de...
2 篇 hunan univ coll ...
2 篇 college of infor...
2 篇 bangladesh univ ...
2 篇 department of el...
2 篇 qingdao univ col...
2 篇 peng cheng labor...
2 篇 suny coll new pa...
2 篇 polytechnic inst...
2 篇 univ jember jemb...
2 篇 college of compu...
2 篇 national univers...
2 篇 school of commun...
2 篇 dipartimento di ...
2 篇 key laboratory o...
2 篇 beijing universi...
2 篇 college of compu...
2 篇 zhejiang univ te...
1 篇 ramrao adik inst...

作者

3 篇 jiang fan
3 篇 slamin
2 篇 wang lei
2 篇 wu yuan
2 篇 rahman md. saidu...
2 篇 li kenli
2 篇 mutzel petra
2 篇 leung carson kai...
2 篇 yu jie
2 篇 li hao
2 篇 jiao licheng
2 篇 li keqin
2 篇 pazdor adam g. m...
2 篇 peddle aaron m.
2 篇 zhang qi
2 篇 peng jiwu
1 篇 frangu laurentiu
1 篇 becchetti luca
1 篇 ha yajun
1 篇 jizhao yin

语言

211 篇 英文
3 篇 其他
2 篇 中文

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

共 216 条记录，以下是131-140 订阅

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

详细简洁

排序：

Distributed computation of Sparse Cuts via Random Walks 15

Distributed Computation of Sparse Cuts via Random Walks

引用

16th international conference on Distributed Computing and Networking

作者： Das Sarma, Atish Molla, Anisur Rahaman Pandurangan, Gopal eBay Inc eBay Res Labs San Jose CA 95125 USA Univ Freiburg Dept Comp Sci Freiburg Germany Univ Houston Dept Comp Sci Houston TX 77204 USA Nanyang Technol Univ Div Math Sci Singapore 637371 Singapore Brown Univ ICERM Providence RI 02912 USA

ISBN: (纸本)9781450329286

A sparse cut of a graph is a partition of the vertices into two disjoint subsets such that the ratio of the number of edges across the two subsets divided by the sum of degrees of vertices in the smaller side is minimum. Finding sparse cuts is an important tool in analyzing large-scale distributed networks such as the Internet and Peer-to-Peer networks, as well as large-scale graphs such as the web graph, online social communities, and VLSI circuits. Sparse cuts are useful in graph clustering and partitioning among numerous other applications. In distributed communication networks, they are useful for topology maintenance and for designing better search and routing algorithms. In this paper, we focus on developing a fast distributed algorithm for computing sparse cuts in networks. Given an undirected n-node network G with conductance phi, the goal is to find a cut set whose conductance is close to phi. We present a distributed algorithm that finds a cut set with sparsity (O) over tilde (root phi) ((O) over tilde hides polylog n factors). Our algorithm works in the CONGEST distributed computing model and outputs a cut of conductance at most (O) over tilde (root phi) with high probability, in O (1/b (1/phi + n) log(2)n) rounds, where b is balance of the cut of given conductance. In particular, to find a sparse cut of constant balance, our algorithm takes O ((1/phi + n) log(2)n) rounds. Our algorithm can also be used to output a local cluster, i.e., a subset of vertices near a given source node, and whose conductance is within a quadratic factor of the best possible cluster around the specified node. Our distributed algorithm can work without knowledge of the optimal phi value (with only a log n factor slowdown) and hence can be used to find approximate conductance values both globally and with respect to a given source node. Our algorithm uses random walks as a key subroutine and is fully decentralized and uses lightweight local computations. We also give a lower boun

关键词： Distributed Algorithm Sparse Cut Conductance Random Walks algorithms theory

来源：评论

学校读者我要写书评

暂无评论

Parallelized Population-Based Multi-heuristic Approach for Solving RCPSP and MRCPSP Instances 16th

Parallelized Population-Based Multi-heuristic Approach for S...

引用

16th international conference on computational Collective Intelligence (ICCCI)

作者： Jedrzejowicz, Piotr Ratajczak-Ropel, Ewa Gdynia Maritime Univ Morska 83 Gdynia Poland

ISBN: (纸本)9783031708152;9783031708169

Project scheduling with resource constraints are of significant importance in various application domains, including logistics, production, management, health care, and computer science. Two generic problems including the Resource-Constrained Project Scheduling Problem (RCPSP) and the Multi-Mode Resource-Constrained Project Scheduling Problem (MRCPSP) have attracted a lot of research effort. Since both are computationally difficult, finding satisfactory solutions for instances of even moderate size is not an easy task. In the literature there have been proposed numerous approaches based on using heuristic or metaheuristic algorithms. An effective way of addressing discussed problems include parallelizing computations and using multiple heuristic or metaheuristics. this paper introduces a set of heuristic algorithms and a parallelized population-based multi-heuristic system designed for the Apache Spark environment as an efficient method for solving instances of project scheduling problems. the approach has been validated in an extensive computational experiment based on datasets from PSPLIB library.

关键词： optimisation project scheduling RCPSP MRCPSP parallel computation population-based heuristic

来源：评论

学校读者我要写书评

暂无评论

16th international conference on Computer Aided Verification, CAV 2004

引用

16th international conference on Computer Aided Verification, CAV 2004

ISBN: (纸本)3540223428

the proceedings contain 51 papers. the special focus in this conference is on Computer Aided Verification. the topics include: Deductive verification of pipelined machines using first-order quantification;a formal reduction for lock-free parallel algorithms;an efficiently checkable, proof-based formulation of vacuity in model checking;symbolic model checking of non-regular properties;proving more properties with bounded model checking;parallel LTL-x model checking of high-level Petri nets based on unfoldings;using interface refinement to integrate formal verification into the design cycle;indexed predicate discovery for unbounded system verification;an experimental evaluation of ground decision procedures;statistical model checking of black-box probabilistic systems;compositional specification and model checking in GSTE;symbolic simulation, model checking and abstraction with partially ordered Boolean functional vectors;functional dependency for verification reduction;symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures;abstraction-based satisfiability solving of presburger arithmetic;image computation in infinite state model checking;global model-checking of infinite-state systems;an efficient execution verification tool for memory orderings;verification of an advanced MIPS-type out-of-order execution algorithm;automatic verification of sequential consistency for unbounded addresses and data values;formal analysis of java programs in JavaFAN;a toolset for modelling and verification of gals systems;a tool for formal analysis of web services;a new implementation of the cooperating validity checker;a satisfiability solver geared towards bounded model checking and mechanical mathematical methods for microprocessor verification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient Large Scale Reverse-time Migration Imaging computation based on Distributed Spark Cluster with GPUs 21

Efficient Large Scale Reverse-time Migration Imaging Computa...

引用

21st IEEE international Symposium on Parallel and Distributed Processing with Applications, 13th IEEE international conference on Big Data and Cloud Computing, 16th IEEE international conference on Social Computing and Networking and 13th international conference on Sustainable Computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Wangzhang, Suhui Yang, Ruizhang Gu, Rong Li, Bo Liu, Dingjin Wang, Zhaokang Nanjing University State Key Laboratory for Novel Software Technology China Sinopec Geophysical Research Institute China Nanjing University of Aeronautics and Astronautics College of Computer Science and Technology China

ISBN: (纸本)9798350329223

the reverse-time migration (RTM) imaging algorithm, which is used for complex underground structure analysis, is known as one of the current mainstream method of high-precision seismic imaging. Nowadays, as the fast development of seismic data acquisition technology, there exists large amount of seismic data. thus, the requirement for the efficient computation of the reverse-time migration (RTM) imaging algorithms over large-scale data have been increased greatly. To address this problem, in this paper, we propose a distributed reverse-time migration imaging algorithm based on the widely-used Spark platform first. Based on that, we design and implement a RTM computation solution based on Spark and GPU with several optimizations, including pre-shuffle&caching and load balancing. We also analyze the fault tolerance capability of the proposed distributed algorithm. We evaluate the proposed methods on the typical three-dimensional wavefild benchmark dataset. Experimental results show that the performance of the Spark based reverse-time migration imaging algorithm can scale up near linearly with computing nodes. In addition, the GPU+Spark based version has significant performance improvement on execution efficiency over the Spark-based algorithm. Moreover, the proposed optimization strategies also take effect. In addition, the method proposed in this paper has been applied in the real-world environment of one of the top oil exploration companies world wide, and has achieved significant improvement under the premise of the algorithm correctness guarantee. © 2023 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

An Efficient Method for Very Large Scale Out-of-Core Terrain Visualization

An Efficient Method for Very Large Scale Out-of-Core Terrain...

引用

international conference on Artificial Reality and Telexistence (ICAT)

作者： Huijie Zhang Jigui Sun Haihong Yu Changsong Qi College of Computer Science Northeast Normal University China College of Computer Science and Technology Jilin University China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education China

Large scale terrain visualization with high- resolution has an increasing demand in many research fields. To realize the efficient rendering of terrain, this paper presents an out-of-core terrain visualization method based on multi-resolution storage techniques. In external memory, the terrain data set is subdivided from top to bottom to build a multi-resolution hierarchical structure based on a quad-tree. the hierarchical structure can decimate the elevation data that must be loaded into internal memory. thus it can improve the efficiency of I/O access greatly. Moreover, in order to implement rapid data retrieval of the real time terrain flyover, an efficient indexing algorithm is proposed, in which those nodes in the hierarchical structure will be divided into several clusters in terms of the similarities of static error and the closed space constraint. In addition, a method for crack-free is also proposed here. the comprehensive experiment conducted on the GTOP30 data set shows that this approach outperforms the Block and the Hierarchy algorithms in the both ways of efficiency and simplification ratio.

关键词： Large-scale systems Clustering algorithms Information retrieval Educational institutions Computer science Data visualization Educational technology Costs Data structures Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Combining technical analysis and grammatical evolution in a trading system 1

引用

16th European conference on Applications of Evolutionary computation, EvoApplications 2013

作者： Contreras, Iván Hidalgo, J. Ignacio Núñez-Letamendia, Laura Facultad de Informática Universidad Complutense de Madrid Spain IE Business School Madrid Spain

ISBN: (数字)9783642371929

ISBN: (纸本)9783642371912

Trading Systems are beneficial for financial investments due to the complexity of nowadays markets. On one hand, finance markets are influenced by a great amount of factors of different sources such as government policies, natural disasters, international trade, political factors etc. On the other hand, traders, brokers or practitioners in general could be affected by human emotions, so their behaviour in the stock market becomes nonobjective. the high pressure induced by handling a large volume of money is the main reason of the so-called market psychology. Trading systems are able to avoid a great amount of these factors, allowing investors to abstract the complex flow of information and the emotions related to the investments. In this paper we compare two trading systems based on Evolutionary computation. the first is a GA-based one and was already proposed and tested with data from 2006. the second one is a grammatical evolution approach which uses a new evaluation method. Experimental results show that the later outperforms the GA approach with a set of selected companies of the spanish market with 2012 data. © Springer-Verlag Berlin Heidelberg 2013.

关键词： international trade

来源：评论

学校读者我要写书评

暂无评论

A comprehensive human computation framework - With application to image labeling 08

A comprehensive human computation framework - With applicati...

引用

16th ACM international conference on Multimedia, MM '08

作者： Yang, Yang Zhu, Bin B. Guo, Rui Yang, Linjun Li, Shipeng Yu, Nenghai University of Science and Technology of China Hefei Anhui 230027 China Microsoft Research Asia Beijing 100080 China Beihang University Beijing 100080 China

ISBN: (纸本)9781605583037

Image and video labeling is important for computers to understand images and videos and for image and video search. Manual labeling is tedious and costly. Automatically image and video labeling is yet a dream. In this paper, we adopt a Web 2.0 approach to labeling images and videos efficiently: Internet users around the world are mobilized to apply their "common sense" to solve problems that are hard for today's computers, such as labeling images and videos. We first propose a general human computation framework that binds problem providers, Web sites, and Internet users together to solve large-scale common sense problems efficiently and economically. the framework addresses the technical challenges such as preventing a malicious party from attacking others, removing answers from bots, and distilling human answers to produce high-quality solutions to the problems. the framework is then applied to labeling images. three incremental refinement stages are applied. the first stage collects candidate labels of objects in an image. the second stage refines the candidate labels using multiple choices. Synonymic labels are also correlated in this stage. To prevent bots and lazy humans from selecting all the choices, trap labels are generated automatically and intermixed with the candidate labels. Semantic distance is used to ensure that the selected trap labels would be different enough from the candidate labels so that no human users would mistakenly select the trap labels. the last stage is to ask users to locate an object given a label from a segmented image. the experimental results are also reported in this paper. they indicate that our proposed schemes can successfully remove spurious answers from bots and distill human answers to produce high-quality image labels. Copyright 2008 ACM.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

theory and Applications of Satisfiability Testing – SAT 2013 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Matti Järvisalo Allen Van Gelder

ISBN: (数字)9783642390715

ISBN: (纸本)9783642390708

this book constitutes the refereed proceedings of the 16th international conference on theory and Applications of Satisfiability Testing, SAT 2013, held in Helsinki, Finland in July 2013. the 21 regular papers, 5 short papers, and 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 71 submissions (850 regular, 15 short and 16 tool papers). the focus of the papers in on following topics: maximum satisfiability, encodings and applications, solver techniques and algorithms, clique-width and SAT, propositional proof complexity, parameterized complexity.

关键词： Logics and Meanings of Programs computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Artificial Intelligence Information and Communication, Circuits

来源：评论

学校读者我要写书评

暂无评论

Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 16

Computing Approximate Pure Nash Equilibria in Digraph k-Colo...

引用

16th international conference on Autonomous Agents and Multiagent Systems (AAMAS)

作者： Carosi, Raffaello Flammini, Michele Monaco, Gianpiero Gran Sasso Sci Inst Laquila Italy Univ Laquila Gran Sasso Sci Inst Laquila Italy Univ Laquila DISIM Laquila Italy

ISBN: (纸本)9781510855076

We investigate approximate pure Nash equilibria in digraph k-coloring games, where we are given an unweighted directed graph together with a set of k colors. Vertices represent agents and arcs capture their mutual unidirectional interests. the strategy set of each agent v consists of the k colors and the payoff of v in a given state or coloring is given by the number of outgoing neighbors with a color different from the one of v. Such games form some of the basic payoff structures in game theory, model lots of real-world scenarios with selfish agents and extend or are related to several fundamental class of games. It is known that the problem of understanding whether the game admits a pure Nash equilibrium is NP-complete. therefore we focus on designing polynomial time algorithms that return approximate Nash equilibria. Informally, we say that a coloring is a gamma-Nash equilibrium (for some gamma >= 1) if no agent can strictly improve her payoff by a multiplicative factor of gamma by changing color. We first propose a deterministic polynomial time algorithm that, for any k >= 3, returns a k-coloring that is a Delta(o) (G)-Nash equilibrium, where Delta(o) (G) is the maximum outdegree of the digraph. We then provide our two main results: i) By exploiting the constructive version of the well known Lovasz Local Lemma, we show a randomized algorithm with polynomial expected running time that, given any constant k >= 2, computes a constant-Nash equilibrium for a broad class of digraphs, i.e., for digraphs where, for any v 2 V, delta(v)(0) (G) = Omega(ln Delta(o) (G) ln Delta(i) (G)) where Delta(o) (G) (resp. Delta(i) (G)) is the maximum outgoing (resp. maximum ingoing) degree of G, and delta(v)(o) (G) is the outgoing degree of agent v. ii) For generic digraphs, we show a deterministic polynomial time algorithm that computes a (1+epsilon)-Nash equilibrium, for any epsilon > 0, by using O(log n/epsilon) colors.

关键词： Noncooperative games: computation Game theory for practical applications

来源：评论

学校读者我要写书评

暂无评论

Research on Simulation of Soft Tissue Deformation in Virtual Orthodontics

Research on Simulation of Soft Tissue Deformation in Virtual...

引用

international conference on Artificial Reality and Telexistence (ICAT)

作者： Ji Feng Department of Information and Computation Science Second Northwest University for Nationalities Yinchuan China

Soft tissue deformation has become bottle-neck in visual surgery technique. Based on the review of the current deformation methods and the analysis of soft tissue biology mechanics characteristic, the simple style mass-spring model is applied to soft tissue deformation in orthodontic simulation. In order to improve algorithm complexity, a simplification mass-spring system dynamic equation is established and an effective equations solution method are presented. In the method, good data structure is presented based on the feature of STL teeth model. computation quantity and accuracy are controlled by using pervasion depth. Experiments show that it can stimulate the deformation change in real time and the display result is vivid

关键词： Deformable models Biological tissues Biological system modeling Equations Surgery computational biology computational modeling Analytical models Data structures Teeth

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共22页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：