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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,668 篇 会议
4,290 篇 期刊文献

馆藏范围

82,958 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

17,626 篇 工学
- 6,927 篇 计算机科学与技术...
- 6,761 篇 电气工程
- 2,980 篇 信息与通信工程
- 2,680 篇 控制科学与工程
- 2,477 篇 软件工程
- 1,636 篇 电子科学与技术（可...
- 1,501 篇 仪器科学与技术
- 1,416 篇 机械工程
- 247 篇 航空宇航科学与技...
- 235 篇 生物医学工程（可授...
- 202 篇 网络空间安全
- 196 篇 交通运输工程
- 140 篇 测绘科学与技术
- 131 篇 生物工程
- 95 篇 材料科学与工程（可...
- 91 篇 动力工程及工程热...
- 83 篇 核科学与技术
- 69 篇 光学工程
1,906 篇 理学
- 955 篇 系统科学
- 515 篇 物理学
- 199 篇 数学
- 153 篇 生物学
- 79 篇 地球物理学
1,750 篇 管理学
- 1,686 篇 管理科学与工程(可...
505 篇 文学
- 505 篇 新闻传播学
247 篇 医学
- 180 篇 临床医学
140 篇 农学
- 100 篇 作物学
71 篇 艺术学
- 71 篇 设计学（可授艺术学...
55 篇 教育学
- 54 篇 教育学
51 篇 军事学
- 51 篇 军队指挥学
36 篇 经济学
7 篇 法学

主题

82,958 篇 algorithm design...
5,906 篇 clustering algor...
5,302 篇 heuristic algori...
5,277 篇 computer science
5,158 篇 optimization
4,677 篇 signal processin...
4,549 篇 hardware
4,068 篇 genetic algorith...
3,996 篇 computational mo...
3,980 篇 convergence
3,964 篇 performance anal...
3,643 篇 data mining
3,580 篇 mathematical mod...
3,392 篇 testing
3,250 篇 routing
2,987 篇 educational inst...
2,977 篇 robustness
2,964 篇 equations
2,956 篇 partitioning alg...
2,871 篇 delay

机构

90 篇 ibm thomas j. wa...
76 篇 department of el...
71 篇 school of comput...
51 篇 department of el...
49 篇 state key labora...
49 篇 school of electr...
46 篇 tsinghua univers...
45 篇 institute for in...
45 篇 school of electr...
44 篇 school of comput...
42 篇 school of comput...
40 篇 school of inform...
38 篇 department of el...
38 篇 department of co...
36 篇 institute of inf...
35 篇 department of co...
35 篇 department of co...
33 篇 department of el...
33 篇 department of el...
32 篇 department of co...

作者

88 篇 lei wang
62 篇 yu wang
57 篇 jun zhang
51 篇 jun wang
43 篇 jian wang
40 篇 bin wang
39 篇 hui wang
37 篇 jing zhang
37 篇 li li
33 篇 wei wang
28 篇 qiang zhou
28 篇 slawomir koziel
27 篇 rui wang
26 篇 xi chen
25 篇 min huang
25 篇 wayne luk
23 篇 jie yang
22 篇 hisao ishibuchi
21 篇 feng liu
21 篇 ming chen

语言

81,760 篇 英文
854 篇 其他
337 篇 中文
5 篇 俄文
1 篇 西班牙文
1 篇 斯洛伐克文

检索条件"主题词=Algorithm Design And Analysis"

共 82958 条记录，以下是841-850 订阅

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

详细简洁

排序：

Dynamic Propagation Rates: New Dimension to Viral Marketing in Online Social Networks 17

Dynamic Propagation Rates: New Dimension to Viral Marketing ...

引用

17th IEEE International Conference on Data Mining (ICDMW)

作者： Pan, Tianyi Kuhnle, Alan Li, Xiang Thai, My T. Univ Florida Dept Comp & Informat Sci & Engn Gainesville FL 32611 USA

ISBN: (纸本)9781538638354

Online Social Networks (OSNs) are effective platforms for viral marketing. Due to their importance, viral marketing related problems in OSNs have been extensively studied in the past decade. However, none of the existing works can cope with the situation that the propagation rate dynamically increases for popular topics, as they all assume known propagation rates. In this paper, to better describe realistic information propagation in OSNs, we propose a novel model, Dynamic Influence Propagation (DIP), that allows propagation rate to change during the diffusion. We then define a new research problem: Threshold Activation Problem under DIP (TAP-DIP) to study the impact of DIP. TAP-DIP adds extra complexity on the already #P-hard TAP problem. Despite it hardness, we are able to approximate TAP-DIP with O(log ratio. Sitting in the core of our algorithm are the Lipschitz optimization technique and a novel solution to the general version of TAP, the Multi-TAP problem. Using various real OSN datasets, we experimentally demonstrate the impact of DIP and that our solution not only generates high-quality seed sets when being aware of the rate increase, but also is scalable.

关键词： Electronics packaging Integrated circuit modeling Approximation algorithms Twitter Heuristic algorithms algorithm design and analysis Probability density function

来源：评论

学校读者我要写书评

暂无评论

Solution Recombination in an Indicator-Based Many-Objective Ant Colony Optimizer for Continuous Search Spaces

Solution Recombination in an Indicator-Based Many-Objective ...

引用

IEEE Symposium Series on Computational Intelligence (IEEE SSCI)

作者： Abdelbar, Ashraf M. Salama, Khalid M. Brandon Univ Dept Math & Comp Sci Brandon MB Canada Univ Kent Sch Comp Canterbury Kent England

ISBN: (纸本)9781538627266

In this paper, we present a recombination-based extension of the recently-introduced iMOACO(R) algorithm. iMOACO(R) itself is based on ACO(R), an Ant Colony Optimization (ACO) optimizer for continuous search spaces, and extends ACO(R) to Multi-Objective Optimization (MOO) problems. Our proposal uses an externally supplied probability to decide whether to apply a recombination operator or to invoke iMOACO(R)'s usual solution construction mechanism. In the former case, one parent is selected from the iMOACO(R) solution archive by rank-proportionate selection (as is the case in ACO(R)), and the other parent is selected by uniform selection. Our proposal is compared to iMOACO(R) using 64 standard problems from the MOO literature with number of objectives ranging from 3 to 10, and found to perform better than iMOACO(R) to a statistically significant extent, as assessed by the hypervolume indicator.

关键词： Data structures Optimization Standards algorithm design and analysis Search problems Ant colony optimization Proposals

来源：评论

学校读者我要写书评

暂无评论

Selected aspects and tradeoffs in transistor level implementation of genetic algorithms 30

Selected aspects and tradeoffs in transistor level implement...

引用

30th IEEE International Conference on Microelectronics (MIEL)

作者： Jezewski, Slawomir Dlugosz, Rafal Coll Social & Media Culture Inst Informat Ul Sw Jozefa 23-35 PL-87100 Torun Poland UTP Univ Sci & Technol Fac Telecommun Comp Sci & Elect Engn Ul Kaliskiego 7 PL-85796 Bydgoszcz Poland Delphi Poland Ul Podgorki Tynieckie 2 PL-30399 Krakow Poland

ISBN: (纸本)9781538625637

In this paper we focus on the issues of hardware implementation of genetic algorithms (GA) in hardware. In their classic implementation, the genetic algorithms search for a global minimum or maximum of a multidimensional function called the fitness function. If the problem, i.e. the fitness function, is too complex for a brute force search, we can look for a solution based on GA. In this situation we obtain desired results by performing parallel calculations on the "generation" of candidate solutions randomly distributed over the input data space. For these candidates we evaluate the fitness function and then we breed a next generation. During breeding we use operators that mimic chromosomal crossing to exchange of features between the candidates, and mutation operations to introduce new features into the population. The literature research shows that more than sixty different crossing algorithms are used with the GA in different purposes. Such a large number of crossing algorithms is a serious problem when developing a hardware solution. In this paper, we are reviewing a deployment of selected crossing operators in specialized hardware.

关键词： Genetic algorithms Hardware Biological cells algorithm design and analysis Field programmable gate arrays Registers Sociology

来源：评论

学校读者我要写书评

暂无评论

Querying Intimate-Core Groups in Weighted Graphs 11

Querying Intimate-Core Groups in Weighted Graphs

引用

11th IEEE International Conference on Semantic Computing (ICSC)

作者： Zheng, Dong Liu, Jianquan Li, Rong-Hua Aslay, Cigdem Chen, Yi-Cheng Huang, Xin Univ British Columbia Vancouver BC Canada Hong Kong Baptist Univ Hong Kong Hong Kong Peoples R China NEC Corp Ltd Tokyo Japan Shenzhen Univ Shenzhen Guangdong Peoples R China ISI Fdn Turin Italy Tamkang Univ New Taipei Taiwan

ISBN: (纸本)9781509042845

The semantic intimacy of relations in many real world networks (e.g., social, biological, and communication networks) can be modeled by weighted edges in which the more semantically intimate relations between the nodes translate to smaller edge weights. Recently, the problem of community search that aims to find the cohesive groups containing a given set of query nodes has attracted a great deal of attention. However, the bulk of literature on community search problem assumes a simple unweighted input graph, ignoring how semantically intimate the nodes have in retrieved communities. The discovered communities may have a highly cohesive structure, while they perform poorly in the semantic of intimate connections. In this paper, we investigate a novel problem of Querying Intimate-Core Groups (QICG): given a weighted undirected graph G, a set of query nodes Q and a positive integer k, to find a connected subgraph of G in which each node has at least k neighbors, and the sum of weights on its edges is minimum among all such subgraphs. We show that the QICG problem is NP-hard. We develop efficient algorithms based on several practical heuristic strategies to enhance the retrieval efficiency. Extensive experiments are conducted on real-world datasets to evaluate efficiency and effectiveness of proposed algorithms. The results confirm that our intimate-core group model outperforms state-of-the-art models in weighted graphs.

关键词： Search problems Semantics Collaboration algorithm design and analysis Standards Infectious diseases Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Multitemporal Synthetic Aperture Radar for Urban Planning and Critical Infrastructure Monitoring

Multitemporal Synthetic Aperture Radar for Urban Planning an...

引用

Joint Urban Remote Sensing Event (JURSE)

作者： Amitrano, Donato Cecinati, Francesca Di Martino, Gerardo Iodice, Antonio Mathieu, Pierre-Philippe Riccio, Daniele Ruello, Giuseppe Univ Napoli Federico II Dept Elect Engn & Informat Technol Naples Italy Univ Bristol Dept Civil Engn Bristol Avon England European Space Agcy ESA ESRIN Frascati Italy

ISBN: (纸本)9781509058082

Earth observation technologies can provide a significant contribution to the monitoring urban areas and critical infrastructures. In this paper, we show how to exploit the recently introduced multitemporal SAR RGB images of the Level-1 alpha and Level-1 alpha family in these applications. Simple, ad hoc algorithms are discussed to adapt these generalist products to the specific case study. In particular, self-organizing map clustering and object-based image analysis are used for urban area mapping. As for infrastructure monitoring, an application concerning railway monitoring is discussed.

关键词： Urban areas Monitoring Rail transportation Synthetic aperture radar Remote sensing Earth algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Scalable Data Stream Clustering with k Estimation 6

Scalable Data Stream Clustering with <i>k</i> Estimation

引用

6th Brazilian Conference on Intelligent Systems (BRACIS)

作者： Candido, Paulo L. Naldi, Murilo C. Silva, Jonathan A. Faria, Elaine R. Univ Fed Vicosa Dept Informat Vicosa MG Brazil Univ Fed Mato Grosso do Sul Curso Ciencia Comp Ponta Pora MS Brazil Univ Fed Uberlandia Fac Comp Uberlandia MG Brazil

ISBN: (纸本)9781538624074

The constant increasing of the generated data in real time has been creating new challenges for machine learning tasks and for one of their main branches: data clustering. The scenario of big data stream (high-speed data stream) has become reality. In order to deal with this scenario, new approaches are required. In this work, we present new techniques based on three clustering fields: Data Stream, MapReduce and automatic estimation of k from data. The goal is to cluster a high-speed data stream with varying number of clusters. Two scalable algorithms are proposed, based on centralized data stream algorithms. The first is based on the StreamKM++ and the second based on the F-EAC, an evolutionary algorithm used for batch clustering purpose. Results achieved the same high quality as the original centralized versions of the algorithms. The proposed techniques can be used instead the centralized ones when the velocity/volume is so high to fit in a centralized system.

关键词： Clustering algorithms Estimation Big Data Adaptation models algorithm design and analysis Data models Electronic mail

来源：评论

学校读者我要写书评

暂无评论

A Legalization algorithm for Multi-Tier Gate-Level Monolithic Three-Dimensional Integrated Circuits 18

A Legalization Algorithm for Multi-Tier Gate-Level Monolithi...

引用

18th International Symposium on Quality Electronic design (ISQED)

作者： Chen, Yiting Kim, Dae Hyun Washington State Univ Sch Elect Engn & Comp Sci Pullman WA 99164 USA Schweitzer Engn Labs Pullman WA USA

ISBN: (纸本)9781509054046

design of gate-level monolithic three-dimensional integrated circuits (3-D ICs) requires 3-D placement, 3-D clock-tree synthesis, 3-D routing and monolithic inter-layer via insertion, 3-D timing and power optimization, and so on. Until now, however, various research on gate-level monolithic 3-D ICs focused on analysis of wirelength, power consumption, performance, thermal characteristics, etc. based on a design methodology using 2-D placement, uniform location scaling, z-directional partitioning, and 2-D planar legalization. However, the design of gate-level monolithic 3-D IC layouts requires more sophisticated 3-D algorithms to generate high-quality layouts. In this paper, we propose a legalization algorithm for the design of multi-tier gate-level monolithic 3-D ICs. The algorithm performs planar and z-directional legalization in an interleaved fashion to perform native 3-D legalization. We compare the proposed algorithm with a legalization algorithm being used in the literature and show that the proposed algorithm achieves shorter wirelength with almost no density constraint violation.

关键词： Layout Logic gates algorithm design and analysis Through-silicon vias Partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Experimental Evaluation of ROS Compatible SLAM algorithms for RGB-D Sensors 14

Experimental Evaluation of ROS Compatible SLAM Algorithms fo...

引用

14th Latin American Robotics Symposium (LARS) / 5th Brazilian Robotics Symposium (SBR)

作者： da Silva, Bruno M. F. Xavier, Rodrigo S. do Nascimento, Tiago P. Goncalves, Luiz M. G. Univ Fed Rio Grande do Norte Sch Sci & Technol Natal RN Brazil Univ Fed Paraiba Dept Comp Syst Joao Pessoa PB Brazil Univ Fed Rio Grande do Norte Dept Comp Engn & Automat Natal RN Brazil

ISBN: (纸本)9781538609569

The recent adoption of the Robot Operating System (ROS) as a software standard in robotics has contributed to novel solutions for several problems on the area. One such problem is known as Simultaneous Localization and Mapping (SLAM), for which a number of algorithms from different classes are available as ROS packages ready to be used on any compatible robot. Considering that there is often a need to evaluate and choose an appropriate solution in any robotics application, this work presents an experimental evaluation of five SLAM algorithms usable on RGB-D sensors, namely, Gmapping, Hector SLAM, ORB SLAM, ORB SLAM 2 and RTAB-Map. The algorithms are assessed on data depicting realistic operation scenarios according to established criteria enumerated to emphasize practical aspects of the selected systems. The experiences reported on this work should provide insight for roboticists seeking a SLAM solution for indoor applications.

关键词： Simultaneous localization and mapping algorithm design and analysis Cameras Three-dimensional displays

来源：评论

学校读者我要写书评

暂无评论

Distributed Big-Data Optimization via Block-Iterative Convexification and Averaging 56

Distributed Big-Data Optimization via Block-Iterative Convex...

引用

56th Annual IEEE Conference on Decision and Control (CDC)

作者： Notarnicola, Ivano Sun, Ying Scutari, Gesualdo Notarstefano, Giuseppe Univ Salento Dept Engn Lecce Italy Purdue Univ Sch Ind Engn W Lafayette IN 47907 USA

ISBN: (纸本)9781509028733

In this paper, we study distributed big-data non-convex optimization in multi-agent networks. We consider the (constrained) minimization of the sum of a smooth (possibly) nonconvex function, i.e., the agents' sum-utility, plus a convex (possibly) nonsmooth regularizer. Our interest is in big-data problems wherein there is a large number of variables to optimize. If treated by means of standard distributed optimization algorithms, these large-scale problems may be intractable, due to the prohibitive local computation and communication burden at each node. We propose a novel distributed solution method whereby at each iteration agents optimize and then communicate (in an uncoordinated fashion) only a subset of their decision variables. To deal with non-convexity of the cost function, the novel scheme hinges on Successive Convex Approximation (SCA) techniques coupled with i) a tracking mechanism instrumental to locally estimate gradient averages;and ii) a novel block-wise consensus-based protocol to perform local block-averaging operations and gradient tacking. Asymptotic convergence to stationary solutions of the nonconvex problem is established. Finally, numerical results show the effectiveness of the proposed algorithm and highlight how the block dimension impacts on the communication overhead and practical convergence speed.

关键词： Distributed algorithms Cost function Convergence algorithm design and analysis Sun Convex functions

来源：评论

学校读者我要写书评

暂无评论

QX: A High-Performance Quantum Computer Simulation Platform 20

QX: A High-Performance Quantum Computer Simulation Platform

引用

20th Conference and Exhibition on design, Automation and Test in Europe (DATE)

作者： Khammassi, N. Ashraf, I. Fu, X. Almudever, C. G. Bertels, K. Delft Univ Technol Comp Engn Lab QuTech Delft Netherlands

ISBN: (纸本)9783981537093

Quantum computing is rapidly evolving especially after the discovery of several efficient quantum algorithms solving intractable classical problems such as Shor's factoring algorithm. However the realization of a large-scale physical quantum computer is very challenging and the number of qubits that are currently under development is still very low, namely less than 15. In the absence of large size platforms, quantum computer simulation is critical for developing and testing quantum algorithms and investigating the different challenges facing the design of quantum computer hardware. What makes quantum computer simulation on classical computers particularly challenging are the memory and computational resource requirements. In this paper, we introduce a universal quantum computer simulator, called QX, that takes as input a specially designed quantum assembly language, called QASM, and provides, through agressive optimisations, high simulation speeds and large number of qubits. QX allows the simulation of up to 34 fully entangled qubits on a single node using less than 270 GB of memory. Our experiments using different quantum algorithms show that QX achieves significant simulation speedup over similar state-of-the-art simulation environment.

关键词： Quantum computing Logic gates Computers Integrated circuit modeling Registers Computational modeling algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 81 82 83 84 85 86 87 88 89 90 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：