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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,599 篇 期刊文献
1,955 篇 会议
45 册 图书

馆藏范围

4,599 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

3,011 篇 工学
- 2,021 篇 计算机科学与技术...
- 1,647 篇 软件工程
- 824 篇 信息与通信工程
- 489 篇 电气工程
- 437 篇 电子科学与技术（可...
- 419 篇 生物工程
- 404 篇 控制科学与工程
- 379 篇 光学工程
- 327 篇 生物医学工程（可授...
- 162 篇 化学工程与技术
- 153 篇 机械工程
- 143 篇 动力工程及工程热...
- 137 篇 仪器科学与技术
- 135 篇 材料科学与工程（可...
- 104 篇 交通运输工程
- 95 篇 安全科学与工程
1,920 篇 理学
- 899 篇 数学
- 701 篇 物理学
- 486 篇 生物学
- 363 篇 统计学（可授理学、...
- 199 篇 系统科学
- 187 篇 化学
729 篇 管理学
- 479 篇 管理科学与工程(可...
- 273 篇 图书情报与档案管...
- 245 篇 工商管理
326 篇 医学
- 269 篇 临床医学
- 242 篇 基础医学(可授医学...
- 143 篇 公共卫生与预防医...
- 132 篇 药学(可授医学、理...
124 篇 法学
- 108 篇 社会学
72 篇 经济学
64 篇 农学
49 篇 教育学
11 篇 文学
9 篇 军事学
2 篇 艺术学

主题

129 篇 deep learning
125 篇 machine learning
120 篇 accuracy
96 篇 internet of thin...
96 篇 real-time system...
91 篇 training
86 篇 feature extracti...
85 篇 computational mo...
76 篇 artificial intel...
75 篇 optimization
62 篇 predictive model...
61 篇 convolutional ne...
59 篇 data models
55 篇 reinforcement le...
51 篇 semantics
50 篇 support vector m...
48 篇 federated learni...
45 篇 monitoring
45 篇 security
44 篇 cloud computing

机构

183 篇 department of el...
95 篇 college of compu...
58 篇 the department o...
50 篇 school of scienc...
43 篇 nanyang technolo...
37 篇 shenzhen researc...
34 篇 college of compu...
33 篇 department of ph...
33 篇 faculty of scien...
33 篇 departamento de ...
33 篇 department for p...
33 篇 department of ph...
33 篇 dipartimento di ...
33 篇 yerevan physics ...
32 篇 lehrstuhl für ex...
32 篇 west university ...
32 篇 department of el...
32 篇 graduate school ...
32 篇 institute of phy...
31 篇 department of mo...

作者

140 篇 niyato dusit
102 篇 zhang rui
43 篇 li haizhou
41 篇 zhu lipeng
34 篇 han zhu
32 篇 sun geng
31 篇 chen mingzhe
26 篇 m. klein
25 篇 f. buehrer
25 篇 m. khader
25 篇 a. t. law
25 篇 c. alexa
25 篇 j. d. mansour
25 篇 j. m. izen
25 篇 s. veneziano
25 篇 d. di valentino
25 篇 g. bella
25 篇 j. strandberg
25 篇 d. calvet
25 篇 c. amelung

语言

4,038 篇 英文
543 篇 其他
19 篇 中文
2 篇 德文
1 篇 法文

检索条件"机构=Department of Electrical and Computer Engineering and Institute for Data Science and Computing"

共 4599 条记录，以下是4181-4190 订阅

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

详细简洁

排序：

CE-ADI-FDTD method for active photonic device simulation with semiconductor/solid-state media

CE-ADI-FDTD method for active photonic device simulation wit...

引用

IEEE Asia-Pacific Conference on Antennas and Propagation (APCAP)

作者： Gurpreet Singh Koustuban Ravi Qian Wang Seng-Tiong Ho Data Storage Institute Agency for Science Technology and Research Singapore Department Electrical Engineering and Computer Science Northwestern University Evanston IL USA

This paper presents a complex-envelope (CE) alternating-direction-implicit (ADI) finite-difference time-domain (FDTD) method to treat light-matter interaction self-consistently with electromagnetic field evolution for efficient simulations of active photonic devices. The active medium (AM) is modeled using an efficient multi-level system of carrier rate equations. To include AM in the CE-ADI formulation, a 1st-order differential system composed of CE fields in AM is first set up. The system sub-matrices are then determined and used in an efficient ADI splitting formula. From microdisk laser simulations, the proposed method is shown to consume 22% of the explicit FDTD CPU time.

关键词： Time domain analysis Finite difference methods Mathematical model Photonics Equations Computational modeling Solid modeling

来源：评论

学校读者我要写书评

暂无评论

ScaleStar: Budget Conscious Scheduling Precedence-Constrained Many-task Workflow Applications in Cloud

ScaleStar: Budget Conscious Scheduling Precedence-Constraine...

引用

International Conference on Advanced Information Networking and Applications (AINA)

作者： Lingfang Zeng Bharadwaj Veeravalli Xiaorong Li Department of Electrical and Computer Engineering National University of Singapore Singapore Institute of High Performance Computing Agency for Science Technology and Research Singapore

Traditionally, the "best effort, cost free" model of Supercomputers/Grids does not consider pricing. Clouds have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on "pay-as-you-go" model. Large scale many-task workflow (MTW) may be suited for execution on Clouds due to its scale-* requirement (scale up, scale out, and scale down). In the context of scheduling, MTW execution cost must be considered based on users' budget constraints. In this paper, we address the problem of scheduling MTW on Clouds and present a budget-conscious scheduling algorithm, referred to as ScaleStar (or Scale-*). ScaleStar assigns the selected task to a virtual machine with higher comparative advantage which effectively balances the execution time-and-monetary cost goals. In addition, according to the actual charging model, an adjustment policy, refer to as DeSlack, is proposed to remove part of slack without adversely affecting the overall makespan and the total monetary cost. We evaluate ScaleStar with an extensive set of simulations and compare with the most popular HEFT-based LOSS3 algorithm and demonstrate the superior performance of ScaleStar.

关键词： Schedules Computational modeling Scheduling algorithms Scheduling Pricing Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games

Parallel Approximation of Min-max Problems with Applications...

引用

Annual IEEE Conference on Computational Complexity

作者： Gus Gutoski Xiaodi Wu Institute for Quantum Computing and School of Computer Science University of Waterloo Waterloo ONT Canada Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

This paper presents an efficient parallel algorithm for a new class of min-max problems based on the matrix multiplicative weights update method. Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum games in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other. This algorithm considerably extends the class of games which admit parallel solutions, demonstrating for the first time the existence of a parallel algorithm for a game in which one player reacts adaptively to the other. As a consequence, we prove that several competing-provers complexity classes collapse to PSPACE such as QRG(2), SQG and two new classes called DIP and DQIP. A special case of our result is a parallel approximation scheme for a new class of semi definite programs whose feasible region consists of lists of semi definite matrices that satisfy a ``transcript-like'' consistency condition. Applied to this special case, our algorithm yields a direct polynomial-space simulation of multi-message quantum interactive proofs resulting in a first-principles proof of QIP=PSPACE.

关键词： Registers Games Parallel algorithms Bismuth Complexity theory Approximation methods Game theory

来源：评论

学校读者我要写书评

暂无评论

Smart Grid Consumer-Provider Relationship Analysis Using System Modeling Approach

Smart Grid Consumer-Provider Relationship Analysis Using Sys...

引用

IEEE/ACM Int'l Conference on & Int'l Conference on Cyber, Physical and Social computing (CPSCom) Green computing and Communications (GreenCom)

作者： Omar Alriyami Husam Suleiman Davor Svetinovic Hatem Zeineldin Computing and Information Science Masdar Institute of Science and Technology Abu Dhabi UAE Department of Electrical and Computer Engineering University of Waterloo Waterloo ONT Canada Electrical and Power Engineering Masdar Institute of Science and Technology Abu Dhabi UAE

ISBN: (纸本)9781467351461

One of the main goals in the smart grid development is the continuous evolution of the smart grid as a cyber-physical system to accommodate electricity storage, provide safe power delivery, accommodate the needs of the local communities, facilitate the integration of innovative technologies, and enable active participation of consumers. The main purpose of this paper is to analyze the underlying complexities of the relationship between the consumers and providers in the smart grid in order to facilitate its planning and evolution. We elicit and specify the main actors, processes, and sequences of actions that occur in the smart grid to help smart grid designers properly plan its infrastructure and evolution.

关键词： Smart grids Electricity Schedules Conferences Privacy Electronic mail Complexity theory

来源：评论

学校读者我要写书评

暂无评论

An ant colony metaheuristic approach for optimal reliability assessment of software systems incorporating redundancy

An ant colony metaheuristic approach for optimal reliability...

引用

World Congress on Information and Communication Technologies (WICT)

作者： Madhu Sudana Rao Diptendu Sinha Roy P. Rakesh Parro D. K. Mohanta School of Computing SASTRA University Thanjavur Tamilnadu India Department of Computer Science and Engineering National Institute of Science and Technology Berhampur India Department of Electrical and Electronics Engineering Birla Institute of Technology Mesra India

With the all pervasive presence of computers to all aspects of life, software reliability assessment is assuming a position of utmost importance. Moreover many commercial and governmental software systems require high mission reliability requiring both hardware and the software to be very reliable. Software reliability is acknowledged to perk up with the amount of testing efforts invested, which in turn reduces the cost of software development and in turn system cost. The scale of redundancy employed affects reliability favorably, while increasing the cost of software design and development. This paper employs an ant colony meta-heuristic optimization method to solve the redundancy allocation problem (RAP) for software systems. Herein, an ant colony optimization algorithm for the software RAP (SRAP) is devised and tested on a computer relay software that is employed for fault handling in power system transmission lines and the results presented validates the efficacy of the approach.

关键词： Decision support systems Communications technology computers Relays Software

来源：评论

学校读者我要写书评

暂无评论

A formally verified deadlock-free routing function in a fault-tolerant NoC architecture

A formally verified deadlock-free routing function in a faul...

引用

Symposium on Integrated Circuits and Systems Design (SBCCI)

作者： Abdulaziz Alhussien Nader Bagherzadeh Freek Verbeek Bernard van Gastel Julien Schmaltz Department of Electrical Engineering and Computer Engineering University of California Irvine USA Institute for Computing and Information Sciences Radboud University Nijmegen Netherlands School of Computer Science Open University of the Netherlands Netherlands

A novel fault-tolerant adaptive wormhole routing function for Networks-on-Chips (NoCs) is presented. The routing function guarantees absence of deadlocks and livelocks up to two faulty channels. The routing logic does not require reconfiguration when a fault occurs. The routes themselves are dynamic. Based on the faults in the network, alternative routes are used to reroute packets. Routing decisions are based only on local knowledge, which allows for fast switching. Our approach does not use any costly virtual channels. As we do not prohibit cyclic dependencies, the routing function provides minimal routing from source to destination even in the presence of faults. We have implemented the architecture design using synthesizable HDL. To ensure deadlock freedom, we have extended a formally verified deadlock detection algorithm to deal with fault tolerant designs. For a 20×20 mesh, we have formally proven deadlock freedom of our design in all of the 2,878,800 configurations in which two channels are faulty. We supply experimental results showing the performance of our architecture.

关键词： Routing System recovery Fault tolerance Fault tolerant systems Switches Circuit faults

来源：评论

学校读者我要写书评

暂无评论

Reports of the AAAI 2011 conference workshops

Reports of the AAAI 2011 conference workshops

引用

作者： Agmon, Noa Agrawal, Vikas Aha, David W. Aloimonos, Yiannis Buckley, Donagh Doshi, Prashant Geib, Christopher Grasso, Floriana Green, Nancy Johnston, Benjamin Kaliski, Burt Kiekintveld, Christopher Law, Edith Lieberman, Henry Mengshoel, Ole J. Metzler, Ted Modayil, Joseph Oard, Douglas W. Onder, Nilufer O'Sullivan, Barry Pastra, Katerina Precup, Doina Ramachandran, Sowmya Reed, Chris Sariel-Talay, Sanem Selker, Ted Shastri, Lokendra Singh, Satinder Smith, Stephen F. Srivastava, Siddharth Sukthankar, Gita Uthus, David C. Williams, Mary-Anne Department of Computer Science University of Texas at Austin United States Center for Knowledge Driven Information Systems Infosys Labs India Adaptive Systems Section Naval Research Laboratory Washington DC United States Department of Computer Science University of Maryland College Park United States EMC's Center of Excellence in Ireland Research Europe at EMC Ireland Department of Computer Science University of Georgia United States School of Informatics University of Edinburgh United Kingdom Department of Computer Science University of Liverpool United Kingdom Department of Computer Science University of North Carolina Greensboro United States Faculty of Engineering and Information Technology University of Technology Sydney Australia VeriSign Inc. United States Department of Computer Science University of Texas at El Paso United States Machine Learning Department Carnegie Mellon University United States Massachusetts Institute of Technology Media Laboratory United States Carnegie Mellon University's Silicon Valley Campus United States Darrell W. Hughes Program for Religion and Science Dialogue Oklahoma City University United States Department of Computing Science University of Alberta Canada College of Information Studies Institute for Advanced Computer Studies University of Maryland College Park United States Department of Computer Science Michigan Technological University United States Department of Computer Science University College Cork Ireland Cognitive Systems Research Insitute Athens Greece School of Computer Science McGill University Canada Stottler Henke Inc. United States School of Computing University of Dundee United Kingdom Department of Computer Engineering Istanbul Technical University Turkey Convergence Lab Infosys Technologies Ltd. United States Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor United States Robotics Institute Carnegie Mellon University United States University of Wisconsin

The AAAI-11 workshop program was held Sunday and Monday, August 7-18, 2011, at the Hyatt Regency San Francisco in San Francisco, California USA. The AAAI-11 workshop program included 15 workshops covering a wide range of topics in artificial intelligence. The titles of the workshops were Activity Context Representation: Techniques and Languages;Analyzing Microtext;Applied Adversarial Reasoning and Risk Modeling;Artificial Intelligence and Smarter Living: The Conquest of Complexity;Artifiicial Intelligence for data Center Management and Cloud computing;Automated Action Planning for Autonomous Mobile Robots;Computational Models of Natural Argument;Generalized Planning;Human Computation;Human-Robot Interaction in Elder Care;Interactive Decision Theory and Game Theory, 2010;Language-Action Tools for Cognitive Artificial Agents: Integrating Vision, Action, and Language;Lifelong Learning from Sensorimotor Experience;Plan, Activity, and Intent Recognition;and Scalable Integration of Analytics and Visualization. This article presents short summaries of those events. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： Human robot interaction

来源：评论

学校读者我要写书评

暂无评论

Recovery of Sparse Probability Measures via Convex Programming 12

Recovery of Sparse Probability Measures via Convex Programmi...

引用

Annual Conference on Neural Information Processing Systems

作者： Mert Piland Laurent El Ghaoui Venkat Chandrasekaran Electrical Engineering and Computer Science University of California Berkeley Berkeley CA 94720 Department of Computing and Mathematical Sciences California Institute of Technology Pasadena CA 91125

ISBN: (纸本)9781627480031

We consider the problem of cardinality penalized optimization of a convex function over the probability simplex with additional convex constraints. The classical ?_1 regularizer fails to promote sparsity on the probability simplex since ?_1 norm on the probability simplex is trivially constant. We propose a direct relaxation of the minimum cardinality problem and show that it can be efficiently solved using convex programming. As a first application we consider recovering a sparse probability measure given moment constraints, in which our formulation becomes linear programming, hence can be solved very efficiently. A sufficient condition for exact recovery of the minimum cardinality solution is derived for arbitrary affine constraints. We then develop a penalized version for the noisy setting which can be solved using second order cone programs. The proposed method outperforms known rescaling heuristics based on ?_1 norm. As a second application we consider convex clustering using a sparse Gaussian mixture and compare our results with the well known soft k-means algorithm.

关键词： convex programming Probability Convex function base number Simplex

来源：评论

学校读者我要写书评

暂无评论

Progressive parallel coordinates

Progressive parallel coordinates

引用

Pacific (formerly Asia-Pacific APVIS) Visualization Symposium

作者： René Rosenbaum Jian Zhi Bernd Hamann Visual Computing and Computer Graphics group (VCG) Institute for Computer Science University of Rostock Rostock Germany Institute for Data Analysis and Visualization (IDAV) Department of Computer Science University of California Davis CA USA Department of Industrial Engineering and Operations Research Columbia University NY USA

Progressive refinement is a methodology that makes it possible to elegantly integrate scalable data compression, access, and presentation into one approach. Specifically, this paper concerns the effective use of progressive parallel coordinates (PPCs), utilized routinely for high-dimensional data visualization. It discusses how the power of the typical stages of progressive data visualization can also be utilized fully for PPCs. Further, different implementations of the underlying methods and potential application domains are described. The paper also presents empirical results concerning the benefits of PPC with regard to efficient data management and improved presentation, indicating that the proposed approach is able to close the gap between data handling and visualization.

关键词： Lead Visualization Logic gates

来源：评论

学校读者我要写书评

暂无评论

Large-scale situation awareness with camera networks and multimodal sensing

Large-scale situation awareness with camera networks and mul...

引用

作者： Ramachandran, Umakishore Hong, Kirak Iftode, Liviu Jain, Ramesh Kumar, Rajnish Rothermel, Kurt Shin, Junsuk Sivakumar, Raghupathy College of Computing Georgia Institute of Technology Atlanta GA 30332 United States Department of Computer Science Rutgers University Piscataway NJ 08854 United States School of Information and Computer Sciences University of California at Irvine Irvine CA 92697-3425 United States Weyond Princeton NJ 08540 United States University of Stuttgart 70569 Stuttgart Germany School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta GA 30332 United States

Sensors of various modalities and capabilities, especially cameras, have become ubiquitous in our environment. Their intended use is wide ranging and encompasses surveillance, transportation, entertainment, education, healthcare, emergency response, disaster recovery, and the like. Technological advances and the low cost of such sensors enable deployment of large-scale camera networks in large metropolises such as London and New York. Multimedia algorithms for analyzing and drawing inferences from video and audio have also matured tremendously in recent times. Despite all these advances, large-scale reliable systems for media-rich sensor-based applications, often classified as situation-awareness applications, are yet to become commonplace. Why is that? There are several forces at work here. First, the system abstractions are just not at the right level for quickly prototyping such applications on a large scale. Second, while Moore's law has held true for predicting the growth of processing power, the volume of data that applications are called upon to handle is growing similarly, if not faster. Enormous amount of sensing data is continually generated for real-time analysis in such applications. Further, due to the very nature of the application domain, there are dynamic and demanding resource requirements for such analyses. The lack of right set of abstractions for programing such applications coupled with their data-intensive nature have hitherto made realizing reliable large-scale situation-awareness applications difficult. Incidentally, situation awareness is a very popular but ill-defined research area that has attracted researchers from many different fields. In this paper, we adopt a strong systems perspective and consider the components that are essential in realizing a fully functional situation-awareness system. © 2012 IEEE.

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共460页 << < 415 416 417 418 419 420 421 422 423 424 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：