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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

1,295 篇 工学
- 1,184 篇 计算机科学与技术...
- 861 篇 软件工程
- 225 篇 信息与通信工程
- 169 篇 控制科学与工程
- 128 篇 电气工程
- 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
73 篇 distributed comp...
70 篇 computer science
52 篇 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 篇 hardware
20 篇 delay

机构

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,067 篇 英文
6 篇 其他
3 篇 中文
2 篇 葡萄牙文

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

共 2078 条记录，以下是2041-2050 订阅

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

详细简洁

排序：

Perfect simulation of monotone systems for rare event probability estimation 05

Perfect simulation of monotone systems for rare event probab...

引用

Simulation Winter Conference

作者： J.M. Vincent MESCAL Project Laboratoire ID-IMAG Montbonnot France

ISBN: (纸本)9780780395190

This paper deals with the estimation of rare event probabilities in finite capacity queuing networks. The traditional product form property of Markovian queueing networks usually vanishes when capacity of queues are finite and clients are blocked or rejected. A new efficient simulation method, derived from Propp & Wilson (Propp 1996), perfect simulation, is applied in the finite capacity queue context. An algorithm directly samples states of the network according to the stationary distribution. This method is adapted for simulation of rare events, typically when events are described by an increasing subset of the state space. Provided that events of the network are monotone, monotonicity techniques are used to reduce the sampling time. Moreover, a stopping mechanism has been developed to interrupt the simulation when an increasing set has been reached. Then, for the estimation of a monotonous reward function, the simulation time could be reduced drastically as in (Vincent and Marchand 2004).

关键词： Discrete event simulation Steady-state Context modeling State-space methods Capacity planning Distributed computing Sampling methods Performance analysis Availability Routing

来源：评论

学校读者我要写书评

暂无评论

Snap-drift learning for phrase recognition

Snap-drift learning for phrase recognition

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Sin Wee Lee D. Palmer-Brown Computational Intelligence Group School of Computing Leeds Metropolitan University Leeds UK School of Computing and Technology University of East London London UK

This paper presents a new application of the snap-drift algorithm by S. W. Lee, et al. (2004): phrase recognition using a set of phrases from the Lancaster parsed corpus (LPC) by R. Garside, et al. (1987). The learning algorithm is the classifier version of snap-drift. In this version, along with the complementary concepts of fast minimalist learning (snap) and slow drift towards the input pattern, each node of the snap-drift neural network (SDNN) swaps between snap and drift modes when declining performance is indicated on that particular node. This method enables the SDNN to learn at node level, in the sense that each node has its learning mode toggled independently of the other nodes. Learning on each node is also reinforced by enabling learning with a probability that decreases with increasing performance. The simulations demonstrate that learning is stable, and the results have consistently shown similar classification performance and advantages in terms of speed in comparison with a multilayer perceptron (MLP) and back-propagation by J. Topper, et al. (2002), D. E. Rumelhart, et al. (1986) applied to the same problem.

关键词： Subspace constraints Neural networks Linear predictive coding Resonance Fuzzy set theory Computer network management Speech Computational modeling Silicon compounds Computational intelligence

来源：评论

学校读者我要写书评

暂无评论

System design that minimizes both missed detections and false alarms: a case study in arc fault detection

System design that minimizes both missed detections and fals...

引用

IEEE Instrumentation and Measurement Technology Conference

作者： K.R. Fowler H.B. Land Applied Physics Laboratory Johns Hopkins University Laurel MD USA

This paper considers several components in the architecture and design of systems to discriminate conditions and fuse the data. It focuses on the problems of missing detections and reducing the possibility of generating false positive alarms. It uses a case study of a protective system that detects arcing faults in power switchboards on board ships. The results in this paper can be used in many systems that must monitor and detect hazardous events both accurately and consistently while minimizing false positive alarms that can cause harmful results. Examples include power plants, hospitals, computer installations, web servers, military sensors that detect enemy vehicles, aircraft engine monitoring, and telecommunications.

关键词： Fault detection Computerized monitoring Military computing Vehicle detection Fuses Power system protection Marine vehicles Event detection Power generation Hospitals

来源：评论

学校读者我要写书评

暂无评论

Meeting Scheduling Guaranteeing n/2-Privacy and Resistant to Statistical Analysis (Applicable to any DisCSP) 04

Meeting Scheduling Guaranteeing n/2-Privacy and Resistant to...

引用

IEEE WIC acm International Conference on Web Intelligence (WI)

作者： M.C. Silaghi Computer Science Department Florida Institute of Technology USA

ISBN: (纸本)9780769521008

Distributed problems raise privacy issues. The user would like to specify securely his constraints (desires, availability, money) on his computer once. The computer is expected to compute and communicate for searching an acceptable solution while maintaining the privacy of the user. Even without computers infested with spy viruses that capture the interaction with the user, most agent based approaches reveal parts of one agent's secret data to its partners in distributed computations [Using privacy loss to guide decisions in distributed CSP search]. Some cryptographic multi-party computation protocols [Completeness theorems for non-cryptographic fault-tolerant distributed computating] succeed to avoid leaking secrets at the computation of some functions with private inputs. They have been applied to find the set of all solutions for the meeting scheduling problem [On securely scheduling a meeting]. However, nobody yet succeeded to apply those techniques for finding a random solution to the meeting scheduling problem. Note that revealing all solutions, when you only need a single one, leaks a lot of data about when others are, or are not, available. Some answers were proposed in our previous approaches to distributed constraint problems [Solving a distributed CSP with cryptographic multi-party computations, without revealing constraints and without involving trusted servers]. They guarantee that no agent can infer with certitude a secret from the identity of the solution of the problem (other than the acceptance of the solution), but guarantee nothing about inference of probabilistic information about secrets. Our new technique answers this problem, too.

关键词： Statistical analysis Processor scheduling Distributed computing Privacy Computer viruses Cryptography Cryptographic protocols Availability Law Legal factors

来源：评论

学校读者我要写书评

暂无评论

How to meet asynchronously (almost) everywhere 10

How to meet asynchronously (almost) everywhere

引用

Annual acm-Society for Industrial and applied Mathmatics symposium on Discrete Algorithms

作者： Jurek Czyzowicz Arnaud Labourel Andrzej Pelc Departement d'informatique Universite du Quebecen Partially supported by NSERC Departement d'informatique Universite du Quebecen Supported by the ANR-project "ALADDIN" Departement d'informatique Universite du Quebecen Partially supported by NSERC discovery grant and by the Research Chair in Distributed Computing at the Universite du Quebec en Outaouais

ISBN: (纸本)9780898717013

Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents are modeled as points, and the route of each of them only depends on its label and on the unknown environment. The actual walk of each agent also depends on an asynchronous adversary that may arbitrarily vary the speed of the agent, stop it, or even move it back and forth, as long as the walk of the agent in each segment of its route is continuous, does not leave it and covers all of it. Meeting in a graph means that both agents must be at the same time in some node or in some point inside an edge of the graph, while meeting in a terrain means that both agents must be at the same time in some point of the terrain. Does there exist a deterministic algorithm that allows any two agents to meet in any unknown environment in spite of this very powerful adversary? We give deterministic rendezvous algorithms for agents starting at arbitrary nodes of any anonymous connected graph (finite or infinite) and for agents starting at any interior points with rational coordinates in any closed region of the plane with path-connected interior. While our algorithms work in a very general setting-agents can, indeed, meet almost everywhere - we show that none of the above few limitations imposed on the environment can be removed. On the other hand, our algorithm also guarantees the following approximate rendezvous for agents starting at arbitrary interior points of a terrain as above: agents will eventually get at an arbitrarily small positive distance from each other.

关键词： Agents internal point terrains lamb meat landscapes Asynchronous deterministic algorithms Infinite Unknown plane Platanus hybrida rendezvous Connected graph

来源：评论

学校读者我要写书评

暂无评论

Cassandra: flexible trust management, applied to electronic health records

Cassandra: flexible trust management, applied to electronic ...

引用

Computer Security Foundations Workshop

作者： M.Y. Becker P. Sewell Computer Laboratory University of Cambridge Cambridge UK

We study the specification of access control policy in large-scale distributed systems. We present Cassandra, a language and system for expressing policy, and the results of a substantial case study, a security policy for a national electronic health record system, based on the requirements for the ongoing UK National Health Service procurement exercise. Cassandra policies are expressed in a language based on Datalog with constraints. The expressiveness of the language (and its computational complexity) can be tuned by choosing an appropriate constraint domain. Cassandra is role-based; it supports credential-based access control (e.g. between administrative domains); and rules can refer to remote policies (for automatic credential retrieval and trust negotiation). Moreover, the policy language is small, and it has a formal semantics for query evaluation and for the access control engine. For the case study we choose a constraint domain C/sub 0/ that is sufficiently expressive to encode many policy idioms. The case study turns out to require many subtle variants of these; it is important to express this variety smoothly, rather than add them as ad hoc features. By ensuring only a constraint compact fragment of C/sub 0/ is used, we guarantee a finite and computable fixed-point model. We use a top-down evaluation algorithm, for efficiency and to guarantee termination. The case study (with some 310 rules and 58 roles) demonstrates that this language is expressive enough for a real-world application; preliminary results suggest that the performance should be acceptable.

关键词： Health information management Access control Large-scale systems Data security National security Procurement Distributed computing Laboratories Computational complexity Query processing

来源：评论

学校读者我要写书评

暂无评论

Parallel rank aggregation for theWorld Wide Web

Parallel rank aggregation for theWorld Wide Web

引用

International Conference on Intelligent Sensing and Information Processing (ICISIP)

作者： M.M. Sufyan Beg Department of Computer Engineering Aligarh Muslim University Aligarh India

Rank aggregation is the problem of generating a "consensus" ranking for a given set of rankings. When applied to the Web, this finds applications in meta-searching, spam fighting and word association techniques. The rank aggregation obtained by optimizing the Spearman footrule distance is called footrule optimal aggregation (FOA), and it also satisfies the Condorcet property. We find in literature a polynomial time algorithm to compute the FOA for full lists. However, when dealing with the results from various search engines, the lists are almost invariably always the partial ones. The FOA for partial lists is NP-hard. This NP-hard nature of partial footrule optimal aggregation problem (PFOA) motivates us to apply genetic algorithm (GA) for the PFOA problem. The GA based technique may take long to compute, but we propose to decide upon the number of generations of GA based on the time limit allowed by the user. Moreover, the inherent parallelism of GA is also utilized to speed up the processing. For GA based rank aggregation, we depart from having the pool of chromosomes represented in binary to those represented in decimal itself. We achieve crossover by carrying out multiplication of permutations. For mutation, the to-be-mutated digit is exchanged with any other randomly selected digit in that very permutation. For experimental procedure falls in line with the ones found in literature. The results for rank aggregation using genetic algorithm are much better, as compared to the ones obtained using the classical Borda's method of rank aggregation.

关键词： Web sites Search engines Genetic algorithms Application software Concurrent computing Parallel processing Biological cells Genetic mutations Databases Web pages

来源：评论

学校读者我要写书评

暂无评论

A high gain multiple time-scaling technique for global control of nonlinear systems

A high gain multiple time-scaling technique for global contr...

引用

American Control Conference (ACC)

作者： P. Krishnamurthy F. Khorrami Control/Robotics Research Laboratory(CRRL) Department of Electrical and Computer Engineering Polytechnic University Brooklyn NY USA

We consider a general high-gain scaling technique for global control of strict-feedback-like systems. Unlike previous results, the scaling utilizes arbitrary powers (instead of requiring successive powers) of the high gain parameter with the powers chosen to satisfy certain inequalities depending on system nonlinearities. The scaling induces a weak-cascading upper diagonal dominance (w-CUDD) structure on the dynamics. The analysis is based on our recent results on the w-CUDD property and uniform solvability of coupled state-dependent Lyapunov equations. The proposed scaling provides extensions in both state-feedback and output-feedback cases. The state-feedback problem is solved for a class of systems with certain ratios of nonlinear terms being polynomially bounded. The controller has a simple form being essentially linear with state-dependent dynamic gains and does not involve recursive computations. In the output-feedback case, the scaling technique is applied to the design of the observer which is then coupled with a backstepping controller. The results relax the assumption in our earlier papers on cascading dominance of upper diagonal terms. However, since the required upper diagonal cascading dominance in observer and controller contexts are dual, it is not possible to use a dual high-gain observer/controller in the proposed design preventing the bounds on uncertain functions from being of the more general form in our earlier work. A topic of further research is to examine the possibility of a scaling (perhaps utilizing more than one high gain parameter) that achieves bidirectional cascading dominance.

关键词： Nonlinear control systems Control systems Nonlinear systems Backstepping Linear matrix inequalities Riccati equations Robot control Laboratories Power engineering computing Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Fixed order /spl Hscr//sub /spl infin//-synthesis: computing optimal values by robust performance analysis

Fixed order /spl Hscr//sub /spl infin//-synthesis: computing...

引用

American Control Conference (ACC)

作者： C. Hol C. Scherer Delft Center of Systems and Control (DCSC) Delft University of Technnology Delft Netherlands

The computation of optimal /spl Hscr//sub /spl infin// controllers with a prescribed order is important for their real-time implementation. This problem is well-known to be non-convex, and only algorithms that compute upper bounds on the global optimal value are known. We present a method to compute lower bounds by re-formulating the problem as a robust analysis problem, where the controller variables are the "uncertain" parameters. This allows to apply the wide spectrum of robust analysis techniques to the fixed order controller design problem. The solution to the robust analysis problem is a global lower bound on the optimal closed loop /spl Hscr//sub /spl infin// performance. We construct a family of robust analysis problems and relax them to convex optimization problems using the S-procedure. The optimal values of this family converge from below to the globally optimal fixed order /spl Hscr//sub /spl infin//-norm. This allows verification of global optimality of controllers. The number of complicating variables in our robust analysis problem is small if we optimize over a few controller parameters. The technique is therefore computationally feasible for optimization over few controller variables, e.g. PID-tuning of systems with large Mc-Millan degree. The method is applied to the tuning of two controller parameters of a 4-block /spl Hscr//sub /spl infin// design of an active suspension system, with a Mc-Millan degree of the plant of 27.

关键词： Robustness Performance analysis Robust control Optimal control Control systems Control system synthesis Control design Upper bound Uncertainty Control engineering

来源：评论

学校读者我要写书评

暂无评论

Middle-out design 05

Middle-out design

引用

proceedings of the 2005 conference on Designing for User eXperience

作者： Audrey Crane Dubberly Design Office San Francisco CA

ISBN: (纸本)9781595932501

In 2004, Dubberly Design Office (DDO) was contracted by "HandScript" to design a product that enables physicians to enter orders on a handheld ***' engineers had been working for a year on an alpha prototype and would continue development during the design of the beta. HandScripts' physicians were supplying content using a tool that mimicked an early interface for the product and enjoyed their roles as designers. The client had a limited budget and needed usability questions answered *** in many design projects, there was not time for a top-down or bottom-up design process. DDO had to work "middle-out".This case study describes how DDO borrowed the software quality assurance cycle and applied it to managing interaction design---resolving both large conceptual questions and detailed, screen-level questions. This "middle-out" approach used a familiar process to achieve fast, quality work.

关键词： usability research user-centered design / human-centered design user interface design health user experience analysis handheld devices and mobile computing design planning concept design product design process improvement interaction design health care

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 199 200 201 202 203 204 205 206 207 208 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：