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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,927 篇 会议
142 篇 期刊文献
10 册 图书

馆藏范围

2,079 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,295 篇 工学
- 1,181 篇 计算机科学与技术...
- 861 篇 软件工程
- 225 篇 信息与通信工程
- 169 篇 控制科学与工程
- 129 篇 电气工程
- 77 篇 电子科学与技术（可...
- 73 篇 生物医学工程（可授...
- 72 篇 生物工程
- 40 篇 建筑学
- 36 篇 动力工程及工程热...
- 35 篇 机械工程
- 34 篇 光学工程
- 29 篇 仪器科学与技术
- 29 篇 化学工程与技术
- 27 篇 力学（可授工学、理...
- 27 篇 土木工程
498 篇 理学
- 377 篇 数学
- 100 篇 物理学
- 77 篇 统计学（可授理学、...
- 75 篇 生物学
- 26 篇 化学
- 23 篇 系统科学
276 篇 管理学
- 168 篇 图书情报与档案管...
- 123 篇 管理科学与工程(可...
- 88 篇 工商管理
66 篇 教育学
- 64 篇 教育学
63 篇 医学
- 61 篇 临床医学
- 34 篇 基础医学(可授医学...
- 24 篇 药学(可授医学、理...
28 篇 法学
- 23 篇 社会学
18 篇 经济学
9 篇 农学
3 篇 军事学
1 篇 文学
1 篇 艺术学

主题

91 篇 mobile computing
72 篇 distributed comp...
69 篇 computer science
53 篇 grid computing
47 篇 application soft...
40 篇 concurrent compu...
39 篇 computational mo...
36 篇 computer network...
34 篇 computer archite...
32 篇 cloud computing
29 篇 virtual reality
29 篇 ubiquitous compu...
27 篇 internet
26 篇 costs
25 篇 laboratories
23 篇 peer to peer com...
23 篇 middleware
20 篇 parallel process...
20 篇 processor schedu...
20 篇 hardware

机构

20 篇 the hong kong po...
18 篇 hong kong polyte...
18 篇 department of co...
15 篇 school of comput...
15 篇 school of comput...
12 篇 institute of com...
12 篇 department of co...
10 篇 nit calicut
10 篇 depauw universit...
10 篇 national institu...
9 篇 school of comput...
8 篇 college of compu...
7 篇 school of comput...
7 篇 school of comput...
6 篇 university of lo...
6 篇 pablo de olavide...
6 篇 department of co...
6 篇 college of compu...
6 篇 department of co...
6 篇 school of comput...

作者

25 篇 hong va leong
18 篇 leong hong va
15 篇 alvin chan
12 篇 hong jiman
11 篇 hung chih-cheng
11 篇 chan alvin t.s.
10 篇 liu ling
10 篇 gloria childress...
10 篇 george roussos
8 篇 umesh bellur
8 篇 song enmin
7 篇 rajiv ramnath
7 篇 pu calton
7 篇 si antonio
7 篇 ahamed sheikh iq...
7 篇 chandran priya
6 篇 federico divina
6 篇 sheikh iqbal aha...
6 篇 madhu kumar s.d.
6 篇 raúl giráldez ro...

语言

2,065 篇 英文
9 篇 其他
3 篇 中文
2 篇 葡萄牙文

检索条件"任意字段=Applied Computing 2004 - Proceedings of the 2004 ACM Symposium on Applied Computing"

共 2079 条记录，以下是701-710 订阅

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

详细简洁

排序：

Using Dynamic Bayesian Networks to infer gene regulatory networks from expression profiles 09

Using Dynamic Bayesian Networks to infer gene regulatory net...

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： Shermin, Akther Orgun, Mehmet A. Macquarie University Department of Computing NSW 2109 Australia

ISBN: (纸本)9781605581668

Two major challenges in inferring the sparse topological architecture of Gene Regulatory Networks using computational methods are 1) the low accuracy of predicting connections between genes and 2) the excessive computational cost. In order to address these challenges, we have exploited some biological features of yeast cell cycle. One such feature is that, a high proportion of Cell Cycle Regulated genes are periodically expressed;that is genes are maximally expressed to affect and control the regulation of other genes and on completing certain tasks;they are repressed by some other regulator genes. Thus the whole cell cycle progresses systematically through the successive activation and inactivation of CCR genes. To use this feature, we have calculated the peak time of individual genes which falls into one/more phases of the cell cycle. Therefore, genes that peak in the interval of the same phase of the cell cycle have been grouped together. Finally, we have applied the Dynamic Bayesian Network (DBN) algorithm within distinct phases of genes. As a consequence, both the accuracy and the computational cost of our learning algorithm have been improved in comparison with the existing DBN algorithms. Copyright 2009 acm.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

A pointing method using two accelerometers for wearable computing 09

A pointing method using two accelerometers for wearable comp...

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： Tokoro, Yohei Terada, Tsutomu Tsukamoto, Masahiko Grad. School of Engineering Kobe University 1-1 Rokkodaicho Nadaku Kobe 657-8501 Japan

ISBN: (纸本)9781605581668

A variety of real-world situations are beneficial for wearable computing since it provides information services while users are doing other jobs. Therefore, a simple and hands-free input interfaces have suitable for these computer operations. However, such interface has not been achieved with conventional input devices such as mice or track balls. Although gesture or eye-gaze input techniques have also been developed for wearable computing, they also suffer from problems i.e., a slow pointing speed, difficulty in carrying devices, and complexity in parallel use when doing tasks. We propose a new method of pointing using input of simple gestures with two accelerometers. By dividing the specifications of two coordinates into a combination of two independent motions, we accomplish accurate and intuitive pointing. A user attaches two small accelerometers to both his/her hands or both elbows. The pointing is done by using the intersection of two straight lines, and the movement of the lines is synchronized with that of the accelerometers. In addition, we also propose a method of changing the position of objects being pointed at that is new approach. The results we obtained from our evaluation experiments confirmed that our method was effective. Copyright 2009 acm.

关键词： Accelerometers

来源：评论

学校读者我要写书评

暂无评论

Refining spectrum-based fault localization rankings 09

Refining spectrum-based fault localization rankings

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： Abreu, Rui Mayer, Wolfgang Stumptner, Markus Van Gemund, Arjan J. C. Embedded Software Lab. Delft University of Technology Netherlands Advanced Computing Research Centre University of South Australia Australia

ISBN: (纸本)9781605581668

Spectrum-based fault localization is a statistical technique that aims at helping software developers to find faults quickly by analyzing abstractions of program traces to create a ranking of most probable faulty components (e.g., program statements). Although spectrum-based fault localization has been shown to be effective, its diagnostic accuracy is inherently limited, since the semantics of components are not considered. In particular, components that exhibit identical execution patterns cannot be distinguished. To enhance its diagnostic quality, in this paper, we combine spectrum-based fault localization with a model-based debugging approach based on abstract interpretation within a framework coined Deputo. The model-based approach is used to refine the ranking obtained from the spectrum-based method by filtering out those components that do not explain the observed failures when the program's semantics is considered. We show that this combined approach outperforms the individual approaches and other state-of-the-art automated debugging techniques. Copyright 2009 acm.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Self-organized control of knowledge generation in pervasive computing systems 09

Self-organized control of knowledge generation in pervasive ...

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： Castelli, Gabriella Menezes, Ronaldo Zambonelli, Franco DISMI University of Modena and Reggio Emilia 42100 Reggio Emilia Italy Computer Sciences Florida Tech. Melbourne FL United States

ISBN: (纸本)9781605581668

Pervasive computing devices (e.g., sensor networks, localization devices, cameras, etc.) are increasingly present in every aspect of our lives. These devices are able to generate enormous amounts of data, from which knowledge about situations and facts occurring in the world can be inferred;inference can also be done by combining data items and generating new (higher-level) ones. Such data and knowledge is of extreme importance for to context-aware and mobile services. However, we are left with the problem that the possibly huge amount of data and knowledge generated can be very hard to be analyzed and made usable in real-time. The core of the problem in today's pervasive environments lies between the ability to extract meaningful (useful) knowledge from the data while making sure the total amount of data does not become overwhelming to the system. This paper focus on this trade-off using (without loss of generality) the W4 model for contextual data as a case study. Starting from the basic mechanism by which the W4 model autonomously generate new knowledge, the paper shows how this can generate knowledge overflow, and propose a method to select - -in a self-organizing way - -what kinds of knowledge should be generated based on their importance;hence preventing knowledge overflow. Experimental results are reported to support our arguments and proposals. Copyright 2009 acm.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Impact of function inlining on resource-constrained embedded systems 09

Impact of function inlining on resource-constrained embedded...

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： Kim, Bongjae Yi, Sangho Cho, Yookun Hong, Jiman School of Computer Science and Engineering Seoul National University Korea Republic of School of Computing Soongsil University Korea Republic of

ISBN: (纸本)9781605581668

With the development of computer systems, function inlining schemes were used to reduce execution time while increasing codes. In embedded systems such as wireless sensor nodes, there are extreme limitations on memory space and battery power. This is the reason why function inlining is useful for maximizing memory utilization while minimizing energy consumption of embedded systems. In the previous works, basic inlining schemes were proposed, which were adapted to systems with code memory constraints. However, they were too coarse-grained, and did not evaluate the impact of function inlining in terms of both energy consumption and code memory utilization in actual systems. In this paper, we propose a fine-grained function inlining scheme. We also present the impact of function inlining schemes on resource-constrained embedded systems, in terms of energy consumption and code memory overhead. Based on experimental results, we demonstrate that fine-grained function inlining can improve the energy efficiency of embedded systems while maximizing code memory utilization. Copyright 2009 acm.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

Boosting the performance of computing systems through adaptive configuration tuning 09

Boosting the performance of computing systems through adapti...

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： Chen, Haifeng Jiang, Guofei Zhang, Hui Yoshihira, Kenji NEC Laboratories America 4 Independence Way Princeton NJ 08540 United States

ISBN: (纸本)9781605581668

Good system performance depends on the correct setting of its configuration parameters. It is observed that such optimal configuration relies on the incoming workload of the system. In this paper, we utilize the Markov decision process (MDP) theory and present a reinforcement learning strategy to discover the complex relationship between the system workload and the corresponding optimal configuration. Considering the limitations of current reinforcement learning algorithms used in system management, we present a different learning architecture to facilitate the configuration tuning task which includes two units: the actor and critic. While the actor realizes a stochastic policy that maps the system state to the corresponding configuration setting, the critic uses a value function to provide the reinforcement feedback to the actor. Both the actor and critic are implemented by multiple layer neural networks, and the error back-propagation algorithm is used to adjust the network weights based on the temporal difference error produced in the learning. Experimental results demonstrate that the proposed learning process can identify the correct configuration tuning rule which in turn improves the system performance significantly. Copyright 2009 acm.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

computing data cubes using exact sub-graph matching: The sequential MCG approach 09

Computing data cubes using exact sub-graph matching: The seq...

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： De Castro Lima, Joubert Hirata, Celso Massaki ITA P. Marechal Ed. Gomes - V. Acácias 12.228-900 - S.J.C. - S.P. Brazil

ISBN: (纸本)9781605581668

In this paper, we present a novel full cube computation and representation approach, named MCG. In a data cube, each cuboid can be viewed as a set of sub-graphs. In general, redundant sub-graphs are quite common in a data cube, but their elimination is a hard problem as some previous cube approaches demonstrate. The MCG approach differentiates significantly from previous approaches since it efficiently eliminates all common sub-graphs from the entire cube, based on an exact sub-graph matching solution. We propose a matching function to guarantee one-to-one mapping between sub-graphs. The function is computed incrementally, in a top-down fashion, and its computation uses a minimal amount of information to generate unique results, regardless of whether we are using distributive, algebraic or holistic measures. MCG performance analysis demonstrates a similar runtime when compared to Star approach and very low memory consumption (94 - 98% reduction) when compared to a full cube representation. Copyright 2009 acm.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

A new K-View algorithm for texture image classification using rotation-invariant feature 09

A new K-View algorithm for texture image classification usin...

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： Liu, Hong Dai, Siguang Song, Enmin Yang, Cihui Hung, Chih-Cheng School of Computer Science Huazhong University of Science and Technology Wuhan China School of Computing and Software Engineering Southern Polytechnic State University Marietta GA 30060 United States

ISBN: (纸本)9781605581668

This paper proposes a new K-View algorithm for texture image classification using rotation-invariant features. These features are statistically derived from characteristic view sets for each texture. Unlike the existing K-View algorithm, all the views used are transformed into rotation-invariant features and the K views are selected randomly. In contrast, the existing K-View algorithm uses the K-means algorithm for choosing the K views. In this new algorithm the decision of determining a pixel to which texture class it belong to, is made by considering all the views which consist of the pixel being classified. In order to preserve the primitive information of a texture class as much as possible, the proposed algorithm randomly selects k views of the view set from each sample sub-image as the characteristic view set. Experimental results show that the proposed algorithm is more robust and accurate compared with the results of the existing K-View algorithm. Copyright 2009 acm.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Jointly optimizing data acquisition and delivery in traffic monitoring VANETs 09

Jointly optimizing data acquisition and delivery in traffic ...

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： Skordylis, Antonios Trigoni, Niki Oxford University Computing Laboratory Wolfson Building Parks Road Oxford OX1 3QD United Kingdom

ISBN: (纸本)9781605581668

Vehicular ad hoc networks (VANETs) are envisaged to become a flexible platform for monitoring road traffic, which will gradually replace more cumbersome fixed sensor deployments. The efficacy of vehicle-assisted traffic monitoring systems depends on the freshness of traffic data that they can deliver to users, and the bandwidth used to do so. Clearly, high data freshness will allow users to estimate trip times accurately, and to select the fastest route to a destination. Low bandwidth utilization will allow the traffic monitoring application to coexist symbiotically with a wide variety of vehicle-based applications, ranging from road safety to advertising and entertainment. In this paper, we investigate the problem of minimizing the bandwidth utilization of a vehicle-assisted traffic monitoring system, whilst adhering to user-defined requirements for data freshness. The novelty of our approach is that we jointly optimize two intertwined aspects of traffic monitoring: data acquisition and data forwarding. We investigate how their combined operation trades data freshness for bandwidth utilization, and we propose a novel mechanism that fine-tunes their parameters to optimize the overall system performance. Our mechanism is evaluated using realistic vehicular traces on a real city map. Copyright 2009 acm.

关键词： Data acquisition

来源：评论

学校读者我要写书评

暂无评论

Fast networking with socket-outsourcing in hosted virtual machine environments 09

Fast networking with socket-outsourcing in hosted virtual ma...

引用

24th Annual acm symposium on applied computing, SAC 2009

作者： Eiraku, Hideki Shinjo, Yasushi Pu, Calton Koh, Younggyun Kato, Kazuhiko Department of Computer Science University of Tsukuba Tsukuba Ibaraki 305-8573 Japan College of Computing Georgia Institute of Technology Atlanta GA 30332-0765 United States

ISBN: (纸本)9781605581668

This paper proposes a novel method of achieving fast networking in hosted virtual machine (VM) environments. This method, called socket-outsourcing, replaces the socket layer in a guest operating system (OS) with the socket layer of the host OS. Socket-outsourcing increases network performance by eliminating duplicate message copying in both the host OS and the guest OS. Furthermore, socket-outsourcing significantly enhances inter-VM communication within the same host OS since it enables network packets to bypass the protocol stack in guest OSes. Socket-outsourcing was implemented in two representative operating systems (Linux and NetBSD) and on two virtual machine monitors (Linux KVM and PansyVM). These virtual machine monitors provided support for socket-outsourcing through shard memory, event queues, and VM-specific Remote Procedure Call between a guest OS and a host OS. The experimental results revealed that a guest OS outsourcing the socket layer achieved the same network throughput as a native OS using up to four Gigabit Ethernet links. Moreover, the benchmark results obtained from an N-tier Web application that generated a significant amount of inter-VM communication indicated that socket-outsourcing improved performance by up to 45 percent compared with conventional hosted VM environments. Copyright 2009 acm.

关键词： Outsourcing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 67 68 69 70 71 72 73 74 75 76 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：