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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,820 篇 会议
19 篇 期刊文献
7 册 图书

馆藏范围

1,846 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,182 篇 工学
- 744 篇 计算机科学与技术...
- 450 篇 软件工程
- 216 篇 机械工程
- 162 篇 控制科学与工程
- 157 篇 信息与通信工程
- 137 篇 电气工程
- 115 篇 仪器科学与技术
- 67 篇 电子科学与技术（可...
- 49 篇 网络空间安全
- 46 篇 生物工程
- 37 篇 生物医学工程（可授...
- 29 篇 交通运输工程
- 27 篇 动力工程及工程热...
- 19 篇 光学工程
- 17 篇 建筑学
- 17 篇 安全科学与工程
- 17 篇 公安技术
260 篇 管理学
- 213 篇 管理科学与工程(可...
- 51 篇 图书情报与档案管...
- 45 篇 工商管理
206 篇 理学
- 109 篇 数学
- 41 篇 生物学
- 40 篇 系统科学
- 24 篇 物理学
- 24 篇 统计学（可授理学、...
60 篇 医学
- 41 篇 基础医学(可授医学...
- 38 篇 临床医学
- 21 篇 公共卫生与预防医...
34 篇 经济学
- 34 篇 应用经济学
26 篇 教育学
- 21 篇 教育学
22 篇 农学
15 篇 法学
10 篇 文学
10 篇 艺术学
4 篇 军事学
1 篇 哲学

主题

147 篇 cloud computing
92 篇 informatics
84 篇 computational mo...
55 篇 educational inst...
54 篇 conferences
46 篇 feature extracti...
43 篇 data mining
43 篇 servers
40 篇 computer archite...
39 篇 semantics
39 篇 data models
32 篇 monitoring
32 篇 databases
32 篇 accuracy
30 篇 big data
28 篇 software
28 篇 training
26 篇 visualization
26 篇 security
26 篇 standards

机构

25 篇 school of comput...
12 篇 department of co...
9 篇 school of inform...
9 篇 school of softwa...
9 篇 cloud computing ...
8 篇 dongguan researc...
7 篇 national institu...
7 篇 ieee beijing sec...
7 篇 faculty of engin...
6 篇 shanghai univers...
6 篇 information depa...
6 篇 school of scienc...
6 篇 department of ma...
6 篇 school of softwa...
5 篇 qingdao academy ...
5 篇 signal & informa...
5 篇 cloud computing ...
5 篇 collaborative in...
5 篇 management schoo...
5 篇 informatics cent...

作者

13 篇 gang xiong
10 篇 jing zhang
10 篇 bin sheng
9 篇 ping li
9 篇 xiaohua hu
9 篇 paulo maciel
8 篇 shangce gao
7 篇 xiwei liu
7 篇 li zhuo
7 篇 yinglin wang
7 篇 wang yinglin
7 篇 stoyanova-doyche...
7 篇 yi zhang
7 篇 jin sun
7 篇 zhou mengqi
6 篇 xiong gang
6 篇 shusaku tsumoto
6 篇 anum masood
6 篇 kris hauser
6 篇 shoji hirano

语言

1,836 篇 英文
9 篇 其他
1 篇 中文

检索条件"任意字段=2014 IEEE International Conference on Progress in Informatics and Computing"

共 1846 条记录，以下是1461-1470 订阅

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

详细简洁

排序：

ReMAP: Reuse and memory access cost aware eviction policy for last level cache management

ReMAP: Reuse and memory access cost aware eviction policy fo...

引用

ieee international conference on Computer Design: VLSI in Computers and Processors, (ICCD)

作者： Akhil Arunkumar Carole-Jean Wu School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ USA

To mitigate the significant main memory access latency in modern chip multiprocessors, multi-level on-chip caches are used to bridge the gap by retaining frequently used data closer to the processor cores. Such dependence on the last-level cache (LLC) has motivated numerous innovations in cache management schemes. However, most prior works focus their efforts on optimizing cache miss counts experienced by applications, irrespective of the interactions between the LLC and other components in the memory hierarchy such as the main memory. This results in sub-optimal performance improvements, since reducing miss rates does not directly translate to increased IPC performance. In this paper, we show that in addition to the recency information provided by the cache replacement policy, post eviction reuse distance (PERD) and main memory access latency cost are useful to make better-informed eviction decisions at the LLC. We propose ReMAP, Reuse and Memory Access Cost aware eviction policy, that takes reuse characteristics and memory access behavior into consideration when making eviction decisions. ReMAP achieves higher performance compared to prior works. Our full-system simulation results show that ReMAP reduces the number of misses of SPEC2006 applications by as much as 13% over the baseline LRU replacement and by an average of 6.5% while MLP-aware replacement and DRRIP reduce the miss counts by -0.7% and 5% respectively. More importantly, ReMAP achieves an average of 4.6% IPC performance gain across the SPEC2006 applications while MLP-aware replacement and DRRIP see only 1.8% and 2.3% respectively.

关键词： Benchmark testing Memory management Estimation Hardware Random access memory Radiation detectors Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Holistic, model-based service repository for distributed industrial automation

Holistic, model-based service repository for distributed ind...

引用

international conference on Emerging Technologies and Factory Automation (ETFA)

作者： Viktor Steiner Zoltan Theisz Zsolt Szepessy Brice Morin Gergely Mezei Evopro Innovation Ltd Budapest Hungary Department of Aut. and Applied Informatics Budapest Uni. of Tech. and Econ Budapest Hungary SINTEF IKT Oslo Norway

Modern industrial control applications gradually take advantage of well-defined state-of-the-art distributed software architecture principles and framework designs, including corresponding modeling techniques. Moreover, the advent of this new era goes way beyond current modeling tool-chains via the application of mature meta-model driven software engineering paradigms. In the frame of the Arrowhead ARTEMIS project these techniques are to showcase the synergies between multi-level meta-model driven design and SOA based dynamic model-aware run-time framework components. This paper reports on the on-going engineering efforts in this domain by showing the generic architecture and by explaining some of the current implementation details through a prototypical tool-chain and a simple model example.

关键词： Object oriented modeling Unified modeling language Automation Mathematical model Peer-to-peer computing Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Inverse-Free D1G1 Solution toAcceleration-Level Inverse Kinematics of Redundant Robot Manipulators

Inverse-Free D1G1 Solution toAcceleration-Level Inverse Kine...

引用

2014 ieee international conference on progress in informatics and computing

作者： Ying Wang Jiawei Luo Weibing Li Hongzhou Tan Yunong Zhang School of Information Science and Technology Sun Yat-sen University

The forward kinematics(FK) problem for robotic manipulators has a mathematically analytical solution, while the inverse kinematics(IK) problem is computationally expensive,and the closed-form expression of the solution does not always exist. In recent years, many approaches have been proposed tosolve such a complicated IK problem, such as the traditional pseudoinverse based solution. However, there are many limitations when using the pseudo-inverse based solution. Therefore, how toeffectively avoid the Jacobian pseudo-inversion is very important and meaningful. Motivated by this, an important branch of dynamics methods, i.e., the gradient dynamics(GD) method, is thus applied todeveloping a novel inverse-free D1G1 solution at the joint-acceleration level for solving the IK problem of redundant robot manipulators. Furthermore, simulation results based on a three-link redundant robot manipulator substantiate the effectiveness and accuracy of the proposed inverse-free D1G1 solution.

关键词： inverse kinematics inverse-free D1G1 solution redundant robot manipulators path tracking

来源：评论

学校读者我要写书评

暂无评论

Empirical Analysis of Consumers' Channel Choice for Electronic Products:A Consumer'S Perspective

Empirical Analysis of Consumers' Channel Choice for Electron...

引用

2014 ieee international conference on progress in informatics and computing

作者： Hui Zhang Tiaojun Xiao Chen Tian Juan Li School of Management and Engineering Nanjing Un iversity

With ra pid development of internet, more and more consumers choose toshop from different channels, such as offline channel and online channel. Some consumers prefer shopping through offline channel because they want toexperience the products' quality in person, while other consumers would like toshop online because the y care more about the efficiency of shopping. There are several factors that can affect consumers' channel choice, such as channel factors, situational factors, consumers' own factors. This paper aims toanalyze consumers' channel choice for electronic products from consumers' own factors. We develop a structural equation model tostudy consumers' channel choice and investigate the relationships among the indexes via data from questionnaire s. We find that(i) both perceived time pressure and perceived channel convenience have positive effects on the attitude towards purchasing electronic products via the internet;(ii) the attitude towards purchasing electronic products via the internetis positively related tothe intention of online channel, and negatively related tothe intention of offline channel. However, price sensitivity and perceived risk have nosignificant causal relationships with attitude towards purchasing electronic products via the internet. Further, we divide the sample intotwosubgroups by gender, using the same method toconduct empirical research. We obtain some valuable resul ts and give some related policies. Then we alsodivide the sample intotwosubgroups by ca reer, and we get some useful conclusions.

关键词： electronic p roduct s channel choice structu ral equation model attitude towards purchasing electronic products via the internet

来源：评论

学校读者我要写书评

暂无评论

Demand-driven Task Scheduling Using 2D Chromosome Genetic Algorithm in Mobile Cloud

Demand-driven Task Scheduling Using 2D Chromosome Genetic Al...

引用

2014 ieee international conference on progress in informatics and computing

作者： Zhiming Cai Chongcheng Chen Spatial Information Research Center of Fujian Fuzhou UniversityKey Lab of Spatial Data Mining & Information Sharing of Ministry of Education

Mobile cloud computing, which comes up in recent years, is a new computing paradigm. In mobile cloud, mobile users can access and schedule the resources or services in remote clouds via wireless networks, which we call mobile cloud task scheduling. They even can build mobile micro-cloud(MuC loud) with mobile device toprovide lightweight service. However, unreliable wireless connection and dynamic join and quit of MuC loud make task scheduling in mobile cloud face more challenges than in wired cloud. Moreover, from both the users and service providers' perspective, task scheduling is a multiobjective optimization problem. Small makespan and load balancing are pursued by mobile users and cloud service providers respectively. In this paper, we advance a demanddriven task scheduling model and introduce an estimate method topredict warranty complete time of tasks in wireless network. An improved genetic algorithm using 2D chromosome(2DCGA) is presented totackle multi-objective task scheduling. Simulation experiments show:1) compared with Markov model, our estimate method has higher accuracy of prediction and more reasonable prediction results of probability of task scheduling failure;2) 2DCGA has good performance for task scheduling. When compared with IGA, it has smaller makespan and lower deviation of load;3) objective priority can be adjusted exactly by weights of fitness functions. It makes 2DCGA suitable for multiobjective optimization.

关键词： task scheduling demand-driven model 2D chromosome genetic algorithm mobile cloud

来源：评论

学校读者我要写书评

暂无评论

An In-depot Realtime Train Tracking System using RFID and Wireless Mesh Networks

An In-depot Realtime Train Tracking System using RFID and Wi...

引用

17th international ieee conference on Intelligent Transportation Systems & The Asia-Pacific Council on Systems Engineering conference 2014

作者： Zongjian He Yigui Luo Junhao Zheng School of Software Engineering Tongji University Department of Computing The Hong Kong Polytechnic University

Knowing the real-time position of moving trains is critical for public transportation *** obtain the realtime train position,signal based,video based and sensor based solutions have been ***,those solutions are either too expensive or only applicable for normal driving *** this paper,we propose a real-time tracking solution for light railway trains inside the depot to avoid potential *** system utilizes RFID technology to localize trains' current position and sends the position information to control center using wireless mesh *** proposed solution is low cost and easy to deploy on both railway and train *** designed RFID deployment strategy to improve the sensor reading *** addition,we proposed a Bloom filter based communication protocol to transmit the RFID reading,which can effectively eliminate network packet loss / RFID duplicated reading and other *** on the location information,we designed two sample applications and deployed them in real train *** on-site experiments have been conducted to show the effectiveness of the system.

关键词： RFID,wireless mesh network,train localization,Bloom filter

来源：评论

学校读者我要写书评

暂无评论

Formal property verification in a conformance testing framework

Formal property verification in a conformance testing framew...

引用

ACM and ieee international conference on Formal Methods and Models for Co-Design (MEMOCODE)

作者： Houssam Abbas Hans Mittelmann Georgios Fainekos School of Electrical Energy and Computer Engineering Arizona State University Tempe AZ U.S.A. School of Mathematical and Statistical Sciences Arizona State University Tempe AZ U.S.A. School of Computing Informatics and Decision Systems Arizona State University Tempe AZ U.S.A.

In model-based design of cyber-physical systems, such as switched mixed-signal circuits or software-controlled physical systems, it is common to develop a sequence of system models of different fidelity and complexity, each appropriate for a particular design or verification task. In such a sequence, one model is often derived from the other by a process of simplification or implementation. E.g. a Simulink model might be implemented on an embedded processor via automatic code generation. Three questions naturally present themselves: how do we quantify closeness between the two systems? How can we measure such closeness? If the original system satisfies some formal property, can we automatically infer what properties are then satisfied by the derived model? This paper addresses all three questions: we quantify the closeness between original and derived model via a distance measure between their outputs. We then propose two computational methods for approximating this closeness measure. Finally, we derive syntactical re-writing rules which, when applied to a Metric Temporal Logic specification satisfied by the original model, produce a formula satisfied by the derived model. We demonstrate the soundness of the theory with several experiments.

关键词： Computational modeling Testing Integrated circuit modeling Educational institutions Software packages Switches Measurement

来源：评论

学校读者我要写书评

暂无评论

A Multi-hop Reputation Announcement Scheme for VANETs

A Multi-hop Reputation Announcement Scheme for VANETs

引用

2014 ieee international conference on Service Operations and Logistics,and informatics

作者： Zhiguang Cao Qin Li Hoon Wei Lim Jie Zhang School of Computer Engineering Nanyang Technological University Interdisciplinary Graduate School Nanyang Technological University School of Computing National University of Singapore

Vehicular ad hoc networks(VANETs)allow vehicles to generate and broadcast messages to inform nearby vehicles about road *** propose a multi-hop announcement scheme for VANETs which supports message broadcasting and *** this scheme,we propose two algorithms to evaluate the reliability of messages and aggregate the reputation scores *** major principle of the reliability evaluation algorithm is Dempster-Shafter Theory and the reputation aggregation algorithm is a variant of weighted averaging *** balance the message coverage area and the cost of forwarding messages,we also provide a message forwarding *** proposed multi-hop scheme offers satisfactory robustness and preserves privacy *** importantly,the multi-hop scheme not only guarantees better message flexibility,but also can generate more satisfactory message drop *** addition,in the message forward criterion of our multi-hop scheme,it is up to vehicles(i.e.,user friendly)to regulate the trade-off between the message utility rate and the maximal message broadcasting bandwidth,based on their real needs.

关键词： A Multi-hop Reputation Announcement Scheme for VANETs

来源：评论

学校读者我要写书评

暂无评论

On shortest single/multiple path computation problems in Fiber-Wireless (FiWi) access networks

On shortest single/multiple path computation problems in Fib...

引用

ieee Workshop on High Performance Switching and Routing

作者： Chenyang Zhou Anisha Mazumder Arunabha Sen Martin Reisslein Andrea Richa Informatics and Decision Systems Engineering School of Comoputing

Fiber-Wireless (FiWi) networks have received considerable attention in the research community in the last few years as they offer an attractive way of integrating optical and wireless technology. As in every other type of networks, routing plays a major role in FiWi networks. Accordingly, a number of routing algorithms for FiWi networks have been proposed. Most of the routing algorithms attempt to find the “shortest path” from the source to the destination. A recent paper proposed a novel path length metric, where the contribution of a link towards path length computation depends not only on that link but also every other link that constitutes the path from the source to the destination. In this paper we address the problem of computing the shortest path using this path length metric. Moreover, we consider a variation of the metric and also provide an algorithm to compute the shortest path using this variation. As multipath routing provides a number of advantages over single path routing, we consider disjoint path routing with the new path length metric. We show that while the single path computation problem can be solved in polynomial time in both the cases, the disjoint path computation problem is NP-complete. We provide optimal solution for the NP-complete problem using integer linear programming and also provide two approximation algorithms with a performance bound of 4 and 2 respectively. The experimental evaluation of the approximation algorithms produced a near optimal solution in a fraction of a second.

关键词： Measurement Routing Approximation algorithms Approximation methods Optical fiber networks Polynomials Wireless communication

来源：评论

学校读者我要写书评

暂无评论

Is high level synthesis ready for business? A computational finance case study

Is high level synthesis ready for business? A computational ...

引用

ieee international conference on Field-Programmable Technology (FPT)

作者： Gordon Inggs Shane Fleming David Thomas Wayne Luk Department of Electrical and Electronic Engineering Imperial College London London United Kingdom Department of Computing Imperial College London London United Kingdom

High Level Synthesis (HLS) tools for Field Programmable Gate Arrays (FPGAs) have made considerable progress, and are now sufficiently mature that a novice developer could create functionally correct implementation with limited understanding of the target hardware. In this case study, a novice developer considers a benchmark of financial problems for implementation upon FPGA via HLS. This novice starts by extending an existing implementation for a CPU or GPU using tools such as Xilinx's Vivado HLS, the Altera OpenCL SDK or Maxeler's MaxCompiler. When their direct source code translation inevitably didn't meet performance expectations, this developer then applies optimisations such as exploiting task or pipeline parallelism as well as C-slowing. When a combination of these optimisations are considered for a range of devices and process technologies, an acceleration of up to 220 times is achieved using these tools, the sort of acceleration expected of custom architectures. Compared to the 31 times improvement shown by an optimised Multicore CPU implementation, the 60 times improvement by a GPU and 207 times by a Xeon Phi, these results suggest that HLS is indeed ready for industrial adoption.

关键词： Field programmable gate arrays Pricing Optimization Parallel processing Hardware Computational modeling Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共185页 << < 143 144 145 146 147 148 149 150 151 152 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：