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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是101-110 订阅

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

详细简洁

排序：

MobiCom'11 - Proceedings of the 17th Annual international conference on Mobile Computing and Networking and Co-Located workshops

MobiCom'11 - Proceedings of the 17th Annual International Co...

引用

17th Annual international conference on Mobile Computing and Networking, MobiCom'11 and Co-Located workshops

ISBN: (纸本)9781450304924

the proceedings contain 29 papers. the topics discussed include: FLUID: improving throughputs in enterprise wireless LANs through flexible channelization;FERMI: a femtocell resource management system for interference mitigation in OFDMA networks;WiFi-Nano: reclaiming WiFi efficiency through 800 ns slots;XPRESS: a cross-layer backpressure architecture for wireless multi-hop networks;SociableSense: exploring the trade-offs of adaptive sampling and computation offloading for social sensing;overlapping communities in dynamic networks: their detection and mobile applications;i am the antenna: accurate outdoor AP location using smartphones;traffic-driven power saving in operational 3G cellular networks;anonymization of location data does not work: a large-scale measurement study;scoop: decentralized and opportunistic multicasting of information streams;and R3: robust replication routing in wireless networks with diverse connectivity characteristics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SociableSense: Exploring the trade-offs of adaptive sampling and computation offloading for social sensing 11

SociableSense: Exploring the trade-offs of adaptive sampling...

引用

17th Annual international conference on Mobile Computing and Networking, MobiCom'11 and Co-Located workshops

作者： Rachuri, Kiran K. Mascolo, Cecilia Musolesi, Mirco Rentfrow, Peter J. Computer Laboratory University of Cambridge Cambridge United Kingdom School of Computer Science University of Birmingham Birmingham United Kingdom Faculty of Politics Psychology Sociology and International Studies University of Cambridge Cambridge United Kingdom

ISBN: (纸本)9781450304924

the interactions and social relations among users in workplaces have been studied by many generations of social psychologists. there is evidence that groups of users that interact more in workplaces are more productive. However, it is still hard for social scientists to capture fine-grained data about phenomena of this kind and to find the right means to facilitate interaction. It is also difficult for users to keep track of their level of sociability with colleagues. While mobile phones offer a fantastic platform for harvesting long term and fine grained data, they also pose challenges: battery power is limited and needs to be traded-off for sensor reading accuracy and data transmission, while energy costs in processing computationally intensive tasks are high. In this paper, we propose SociableSense, a smart phones based platform that captures user behavior in office environments, while providing the users with a quantitative measure of their sociability and that of colleagues. We tackle the technical challenges of building such a tool: the system provides an adaptive sampling mechanism as well as models to decide whether to perform computation of tasks, such as the execution of classification and inference algorithms, locally or remotely. We perform several micro-benchmark tests to fine-tune and evaluate the performance of these mechanisms and we show that the adaptive sampling and computation distribution schemes balance trade-offs among accuracy, energy, latency, and data traffic. Finally, by means of a social psychological study with ten participants for two working weeks, we demonstrate that SociableSense fosters interactions among the participants and helps in enhancing their sociability. © 2011 ACM.

关键词： Behavioral research

来源：评论

学校读者我要写书评

暂无评论

Computing and Combinatorics - 17th Annual international conference, COCOON 2011, Proceedings

Computing and Combinatorics - 17th Annual International Conf...

引用

17th Annual international Computing and Combinatorics conference, COCOON 2011

ISBN: (纸本)9783642226847

the proceedings contain 55 papers. the topics discussed include: strong I/O lower bounds for binomial and FFT computation graphs;spin systems on graphs with complex edge functions and specified degree regularities;quantum algorithm for the Boolean hidden shift problem;a Kolmogorov complexity proof of the Lovász local lemma for satisfiability;proper n-cell polycubes in n - 3 dimensions;largest area convex hull of axis-aligned squares based on imprecise data;improved algorithms for the point-set embeddability problem for plane 3-trees;optimal strategies for the one-round discrete Voronoi game on a line;computing the girth of a planar graph in linear time;diagonalization strikes back: some recent lower bounds in complexity theory;unions of disjoint NP-complete sets;and scheduling jobs on heterogeneous platforms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Strong I/O lower bounds for binomial and FFT computation graphs

Strong I/O lower bounds for binomial and FFT computation gra...

引用

17th Annual international conference on Computing and Combinatorics, COCOON 2011

作者： Ranjan, Desh Savage, John Zubair, Mohammad Old Dominion University NorfolkVA23529 United States Brown University ProvidenceRI02912 United States

ISBN: (纸本)9783642226847

Processors on most of the modern computing devices have several levels of memory hierarchy. To obtain good performance on these processors it is necessary to design algorithms that minimize I/O traffic to slower memories in the hierarchy. In this paper, we propose a new technique, the boundary flow technique, for deriving lower bounds on the memory traffic complexity of problems in a two-level memory hierarchy architectures. the boundary flow technique relies on identifying sub-computation structure corresponding to equal computations with a minimum number of boundary vertices, which in turn is related to the vertex isoperimetric parameter of a computation graph. We demonstrate that this technique results in stronger lower bounds for memory traffic on memory hierarchy architectures for well-known computation structures: the binomial computation graphs and FFT computation graphs. © Springer-Verlag Berlin Heidelberg 2011.

关键词： Fast Fourier transforms

来源：评论

学校读者我要写书评

暂无评论

17th Annual international conference on Computing and Combinatorics, COCOON 2011

17th Annual International Conference on Computing and Combin...

引用

17th Annual international conference on Computing and Combinatorics, COCOON 2011

ISBN: (纸本)9783642226847

the proceedings contain 55 papers. the special focus in this conference is on Computing and Combinatorics. the topics include: Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems;Strong I/O lower bounds for binomial and FFT computation graphs;spin systems on graphs with complex edge functions and specified degree regularities;quantum algorithm for the boolean hidden shift problem;a kolmogorov complexity proof of the lovász local lemma for satisfiability;proper n-cell polycubes in n − 3 dimensions;largest area convex hull of axis-aligned squares based on imprecise data;improved algorithms for the point-set embeddability problem for plane 3-trees;optimal strategies for the one-round discrete voronoi game on a line;dominating set counting in graph classes;computing the girth of a planar graph in linear time;diagonalization strikes back: some recent lower bounds in complexity theory;Unions of disjoint NP-complete sets;ReachFewL = ReachUL;(1 + Ε)-competitive algorithm for online OVSF code assignment with resource augmentation;scheduling jobs on heterogeneous platforms;self-assembling rulers for approximating generalized sierpinski carpets;approximately uniform online checkpointing;bandwidth of convex bipartite graphs and related graphs;algorithms for partition of some class of graphs under compaction;the density maximization problem in graphs;a generic approach to decomposition algorithms, with an application to digraph decomposition;matching and P2-Packing: Weighted versions;on totally unimodularity of edge-edge adjacency matrices;the topology aware file distribution problem;exploiting the robustness on power-law networks;competitive algorithms for online pricing;making abstraction-refinement efficient in model checking;property testing for cyclic groups and beyond.

关键词：

来源：评论

学校读者我要写书评

暂无评论

17th international conference on Principles and Practice of Constraint Programming, CP 2011

17th International Conference on Principles and Practice of ...

引用

17th international conference on Principles and Practice of Constraint Programming, CP 2011

ISBN: (纸本)9783642237850

the proceedings contain 61 papers. the special focus in this conference is on Principles and Practice of Constraint Programming. the topics include: Neuron constraints to model complex real-world problems;A constraint based approach to cyclic RCPSP;an efficient light solver for querying the semantic web;on guaranteeing polynomially bounded search tree size;a framework for decision-based consistencies;Hierarchically nested convex VCSP;tractable triangles;on minimal weighted clones;Solving MAXSAT by solving a sequence of simpler SAT instances;operations research and constraint programming at google;filtering algorithms for discrete cumulative problems with overloads of resource;Synthesis of search algorithms from high-level CP models;revisiting the tree constraint;half reification and flattening;the parameterized complexity of local consistency;symmetry breaking in numeric constraint problems;on minimal constraint networks;structural tractability of constraint optimization;models and strategies for variants of the job shop scheduling problem;MaxRPC algorithms based on bitwise operations;Solving problems with CP: Four common pitfalls to avoid;Grid-based SAT solving with iterative partitioning and clause learning;large neighborhood search for dial-a-ride problems;On deciding MUS membership with QBF;On the relative efficiency of DPLL and OBDDs with axiom and join;Min CSP on four elements: Moving beyond submodularity;algorithm selection and scheduling;incorporating variance in impact-based search;a quadratic edge-finding filtering algorithm for cumulative resource constraints;A CSP solver focusing on FAC variables;constraint reasoning and kernel clustering for pattern decomposition with scaling;a constraint seeker: Finding and ranking global constraints from examples;solving qualitative constraints involving landmarks;search combinators.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A game theoretic framework for heterogeneous information network clustering 17

A game theoretic framework for heterogeneous information net...

引用

17th ACM SIGKDD international conference on Knowledge Discovery and Data Mining, KDD 2011

作者： Alqadah, Faris Bhatnagar, Raj Johns Hopkins University 733 North Broadway Baltimore MD 21205 United States University of Cincinnati 814 Rhodes Hall Cincinnati OH 45221 United States

ISBN: (纸本)9781450308137

Heterogeneous information networks are pervasive in applications ranging from bioinformatics to e-commerce. As a result, unsupervised learning and clustering methods pertaining to such networks have gained significant attention recently. Nodes in a heterogeneous information network are regarded as objects derived from distinct domains such as'authors'and'papers'. In many cases, feature sets characterizing the objects are not available, hence, clustering of the objects depends solely on the links and relationships amongst objects. Although several previous studies have addressed information network clustering, shortcomings remain. First, the definition of what constitutes an information network cluster varies drastically from study to study. Second, previous algorithms have generally focused on non-overlapping clusters, while many algorithms are also limited to specific network topologies. In this paper we introduce a game theoretic framework (GHIN) for defining and mining clusters in heterogeneous information networks. the clustering problem is modeled as a game wherein each domain represents a player and clusters are defined as the Nash equilibrium points of the game. Adopting the abstraction of Nash equilibrium points as clusters allows for flexible definition of reward functions that characterize clusters without any modification to the underlying algorithm. We prove that well-established definitions of clusters in 2-domain information networks such as formal concepts, maximal bi-cliques, and noisy binary tiles can always be represented as Nash equilibrium points. Moreover, experimental results employing a variety of reward functions and several real world information networks illustrate that the GHIN framework produces more accurate and informative clusters than the recently proposed NetClus and state of the art MDC algorithms. Copyright 2011 ACM.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Real-Time Divisible Load theory: Incorporating computation Costs

Real-Time Divisible Load Theory: Incorporating Computation C...

引用

IEEE international conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Suriayati Chuprat Sanjoy Baruah Universiti Teknologi Malaysia Kuala Lumpur Malaysia University of North Carolina Chapel Hill NC USA

We extend the current state of the art in real-time divisible load theory (RT-DLT), by considering the problems of scheduling a real-time divisible job on computing clusters in which different processing nodes have different computing capabilities, as well as different costs associated with executing on them. We seek to minimize the cost of executing a job while also meeting its deadline.

关键词： Program processors Real time systems Schedules Processor scheduling Scheduling Time factors Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Reviewing DSTATCOM for smart distribution grid applications in solving power quality problems

Reviewing DSTATCOM for smart distribution grid applications ...

引用

international conference on Automation and Computing (ICAC)

作者： Bala Boyi Bukata Yun Li School of Engineering University of Glasgow Glasgow UK

Evolution of the future smart distribution grid has made power quality (PQ) resolution a key concern to stakeholders in the power supply sector. the distribution static compensator (DSTATCOM) is one of the custom power devices recently applied to solve this problem. However, manual techniques based on computer-aided-design (CAD) simulator used in designing the DSTATCOM controllers cannot guarantee optimum solutions because of the added integrate-able nonlinearities of the future distribution grid. therefore, its functionality can be improved through optimum designs by allowing flexible range of working voltages at the point of common coupling (PCC) to meet customer's load demands. this paper focuses on: reviewing DSTATCOM control strategies for solving PQ problems, and its challenges, possible solutions through evolutionary algorithms (EA) based computer-automated-design (CAutoD) of fuzzy logic control, future direction as well as the state-of-the-arts.

关键词： Control systems Power quality Optimization conferences Voltage control Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

A GA-based Method for Efficient Interconnect Capacitance computation in Mixed-Signal Integrated Circuits Using Sets of Linear Charges

A GA-based Method for Efficient Interconnect Capacitance Com...

引用

IEEE international conference on Electronics, Circuits and Systems

作者： Yiorgos I. Bontzios Michael G. Dimopoulos Alkis A. Hatzopoulos Department of Electrical & Computer Eng. Aristotle Univ. of Thessaloniki Dept. of Electronics Alexander Technological Educational Inst. of Thessaloniki

ISBN: (纸本)9781424481552

the problem of interconnect capacitance computation in mixed-signal integrated circuits is studied in this work. the proposed method is based on the method of images utilizing sets of linear charges and a Genetic Algorithm (GA). the proposed method is general and applicable to an arbitrary geometry configuration of interconnection lines. Comparative simulation results are presented for several practical case studies with a commercial tool employing the Finite Element Method (FEM). the results show that the computed capacitance value by our proposed method is in close agreement to the value obtained by the commercial tool with the average difference ranging between 2%-5%.

关键词： Capacitance Capacitance Modeling Genetic algorithms Linear Charges Mixed analog-digital integrated circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：