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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是1981-1990 订阅

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

详细简洁

排序：

Security for grid-based computing systems issues and challenges 04

Security for grid-based computing systems issues and challen...

引用

proceedings of the ninth acm symposium on Access control models and technologies

作者： Elisa Bertino Bruno Crispo James Joshi Wengliang (Kevin) Du Ravi Sandhu CERIAS Purdue University W. Lafayette IN Vrije Universiteit Amsterdam Netherlands DIST Pittsburgh University Pittsburgh PA Syracuse University Syracuse NY George Mason University Fairfax VA

ISBN: (纸本)9781581138726

Grid systems were initially developed for supporting scientific computations. Today, companies, users and researchers are looking at ways to use the Grid approach to commercial uses and for applications in many different areas. Security in grid systems however has not been much addressed and yet is an important prerequisite to really make grid systems usable in a variety of commercial *** goal of this panel is to explore relevant security issues, with special emphasis on access control, for grid-based computing systems. The panel will discuss security requirements that are specific to grid-based systems and set these systems apart from conventional distributed systems, and outline directions for future research. Questions addressed by the panel include the following ones: What needs to be protected in a grid system: hosts, resources, data, computations?Access control languages and policies: do we need ad-hoc languages for specifying access control policies for grid hosts? If so, which would be the most relevant and features of these languages?User requirements: different grid hosts may provide different levels of security. How can a user specify his/her security requirements when running computations? Which assurance has the user that his/her own requirements have been met?Scalability and evolution: grid computing systems may encompass a very large number of nodes (hundreds or even thousands). Moreover, they can be quite dynamic with hosts and clients dynamically joining and leaving. How can we design scalable access systems able to cope with the required dynamicity?

关键词：

来源：评论

学校读者我要写书评

暂无评论

FDTD modeling of borehole georadar data

FDTD modeling of borehole georadar data

引用

proceedings of the International Conference on Ground Penetrating Radar, GPR

作者： J.R. Ernst K. Holliger H. Maurer Institute of Geophysics Swiss Federal Institute of Technology (ETH) Zurich Switzerland

High-frequency electromagnetic wave phenomena associated with borehole georadar experiments are complex. To improve our understanding of the governing physical processes, we have developed an advanced finite-difference time-domain (FDTD) solution of Maxwell’s equations in cylindrical coordinates. The computational domain is bounded by cylindrical symmetry conditions along the left model edge and by suitably adapted uniaxial perfectly matched layer (UPML) absorbing boundary conditions along the top, bottom and right model edges. An important feature of this algorithm is the use of a powerful grid-refinement technique that enables us to account for detailed design aspects of borehole georadar antenna systems. This type of modeling allows us to estimate the radiative properties of typical borehole georadar antennas under realistic operating conditions, which represents the basis for improving conventional ray-based amplitude inversions as well as for the eventual development of waveform inversion algorithms. The algorithm is validated with respect to analytical solutions for wire-type dipole antennas and then applied to model crosshole georadar data acquired under well-controlled conditions in the NAGRA (Swiss Cooperative for the Storage of Nuclear Waste) Grimsel rock laboratory in the central Swiss Alps.

关键词： Finite difference methods Time domain analysis Ground penetrating radar Dipole antennas Maxwell equations Power system modeling Receiving antennas Transmitters Antenna accessories Geophysics computing

来源：评论

学校读者我要写书评

暂无评论

Communications for improving policy computation in distributed POMDPs

Communications for improving policy computation in distribut...

引用

proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS

作者： R. Nair M. Tambe M. Roth M. Yokoo Computer Science Department University of Southern California USA Robotics Institute Carnegie Mellon University USA Department of Intelligent Systems Kyushu University Japan

Distributed Partially Observable Markov Decision Problems (POMDPs) are emerging as a popular approach for modeling multiagent teamwork where a group of agents work together to jointly maximize a reward function. Since the problem of finding the optimal joint policy for a distributed POMDP has been shown to be NEXP-Complete if no assumptions are made about the domain conditions, several locally optimal approaches have emerged as a viable solution. However, the use of communicative actions as part of these locally optimal algorithms has been largely ignored or has been applied only under restrictive assumptions about the domain. In this paper, we show how communicative acts can be explicitly introduced in order to find locally optimal joint policies that allow agents to coordinate better through synchronization achieved via communication. Furthermore, the introduction of communication allows us to develop a novel compact policy representation that results in savings of both space and time which are verified empirically. Finally, through the imposition of constraints on communication such as not going without communicating for more than K steps, even greater space and time savings can be obtained.

关键词： Distributed computing Teamwork Uncertainty Observability Permission Multiagent systems Performance loss Humans

来源：评论

学校读者我要写书评

暂无评论

Reduced-search dynamic programming for linear-space sequence alignment

Reduced-search dynamic programming for linear-space sequence...

引用

International symposium on Multimedia Software Engineering

作者： Hsueh-Foo Lin Jun-Ming Liang Department of Information Management National Pingtung Institute of Commerce Ping Tung Taiwan

Dynamic programming (DP) algorithms for the sequence alignment can easily incorporate the length of sequences, gap penalties, backtracking preference, and alignment score which present difficulties for algorithms based on linear or nonlinear programming formulations and for many sequence alignment heuristics. However, exact DP algorithms for the sequence alignment need exponential storage and computational time and can only be applied to small problems. In this paper, a heuristic algorithm is proposed for applying to banding algorithms on handling the alignment. The approach uses only linear space with an obviously reducing time complexity. This heuristic has several advantages over the previous fixed-band methods for aligning two sequences along a similarity-sensitive, adaptable band. Test results are conducted to show that the more precise similarity deliberated, the process is preformed more efficiently.

关键词： Dynamic programming Sequences Heuristic algorithms Proteins DNA Biology computing Chaos Information management Business Linear programming

来源：评论

学校读者我要写书评

暂无评论

Distance labeling in graphs 01

Distance labeling in graphs

引用

proceedings of the twelfth annual acm-SIAM symposium on Discrete algorithms

作者： Cyril Gavoille David Peleg Stéphane Pérennes Ran Raz LaBRI Université Bordeaux I 351 cours de la Libération 33405 Talence Cedex France Department of Computer Science and Applied Mathematics The Weizmann Institute of Science Rehovot 76100 Israel SLOOP 13S-CNRS/INRIA Université de Nice-Sophia Antipolis 2004 Route des Lucioles BP 93 F-06902 Sophia Antipolis Cedex France

ISBN: (纸本)9780898714906

We consider the problem of labeling the nodes of a graph in a way that will allow one to compute the distance between any two nodes directly from their labels (without using any additional information). Our main interest is in the minimal length of labels needed in different cases. We obtain upper bounds and (most importantly) lower bounds for several interesting families of graphs. In particular, our main results are the following: For general graphs, the length needed is Θ(n). For trees, the length needed is Θ(log2 n). For planar graphs, we show an upper bound of Ω(√n log n) and a lower bound of Ω(n1/3). For bounded degree graphs, we show a lower bound of Ω(√n). The upper bounds for planar graphs and for trees follow by a more general upper bound for graphs with a r(n)- separator. The two lower bounds, however, are obtained by two different arguments that may be interesting in their own *** also show some lower bounds on the length of the labels, even if it is only required that distances be approximated to a multiplicative factor s. For example, we show that for general graphs the required length is Ω(n). We also consider the problem of the time complexity of the distance function once the labels are computed. We show that there are graphs with optimal labels of length 3 log n, such that if we use any labels with fewer than n bits per label, computing the distance function requires exponential time. A similar result is obtained for planar and bounded degree graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Goal-focused self-modifying workflow in the healthcare domain

Goal-focused self-modifying workflow in the healthcare domai...

引用

Annual Hawaii International Conference on System Sciences (HICSS)

作者： E.D. Browne M. Schrefl J.R. Warren Advanced Computing Research Centre University of South Australia Mawson Lakes SA Australia

This paper introduces the concept of self-modifying workflow in the context of health care planning. Certain tasks in the workflow schema are devoted to modifying the downstream workflow on an instance by instance basis. Such self-modifying schemas provide the necessary flexibility to suit the evolving diagnostic and therapeutic processes encountered in chronic disease management (CDM), particularly in complex areas requiring significant individualization. The management of diabetes mellitus in a community care setting provides an example to illustrate this complexity. Over the past few years, object-oriented modeling tools of inheritance and specialization have been applied to workflow modeling to assist in schema evolution and workflow migration, thereby potentially empowering new workflow management systems (WfMSs) with the functionality to allow the tailoring of guideline-based care plans to individual patient requirements. However, schema evolution is a necessary but insufficient requirement for such tailoring. Healthcare WfMSs need to support a paradigm whereby schema evolution becomes a de facto operation for each workflow instance (i.e. patient episode of care). Self-modifying workflows provide this paradigm. In order to facilitate self-modification of workflow schemas, we annunciate a set of valid operations that can be applied to downstream components of a workflow schema. These operations are primarily concerned with turning abstract subworkflows into concrete ones through completion and alteration of template primitives.

关键词： Medical services Object oriented modeling Guidelines Australia Diseases Concrete Lakes Diabetes Workflow management software Turning

来源：评论

学校读者我要写书评

暂无评论

Information and Communications Security 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Sihan Qing Wenbo Mao Javier López Guilin Wang

ISBN: (数字)9783540320999

ISBN: (纸本)9783540309345

The Seventh International Conference on Information and Communications - curity,ICICS2005,washeldinBeijing,China,10-13December2005. TheICICS conference series is an established forum for exchanging new research ideas and development results in the areas of information security and applied crypt- raphy. The ?rst event began here in Beijing in 1997. Since then the conference series has been interleaving its venues in China and the rest of the world: ICICS 1997 in Beijing, China; ICICS 1999 in Sydney, Australia; ICICS 2001 in Xi’an, China; ICICS 2002 in Singapore; ICICS 2003 in Hohhot City, China; and ICICS 2004 in Malaga, Spain. The conference proceedings of the past events have - ways been published by Springer in the Lecture Notes in Computer Science series, with volume numbers, respectively: LNCS 1334,LNCS 1726,LNCS 2229, LNCS 2513, LNCS 2836, and LNCS 3269. ICICS 2005 was sponsored by the Chinese Academy of Sciences (CAS); the Beijing Natural Science Foundation of China under Grant No. 4052016; the National Natural Science Foundation of China under Grants No. 60083007 and No. 60573042;the NationalGrandFundamentalResearch973ProgramofChina under Grant No. G1999035802, and Hewlett-Packard Laboratories, China. The conference was organized and hosted by the Engineering Research Center for Information Security Technology of the Chinese Academy of Sciences (ERCIST, CAS) in co-operation with the International Communications and Information Security Association (ICISA). The aim of the ICICS conference series has been to o?er the attendees the opportunity to discuss the latest developments in theoretical and practical - pects of information and communications security.

关键词： Cryptology Operating Systems Management of computing and Information Systems Computers and Society Computer Communication Networks Algorithm Analysis and Problem Complexity

来源：评论

学校读者我要写书评

暂无评论

Winner-take-all class AB input stage: a novel concept for low-voltage power-efficient class AB amplifiers

Winner-take-all class AB input stage: a novel concept for lo...

引用

IEEE International symposium on Circuits and Systems (ISCAS)

作者： J. Ramirez-Angulo S. Baswa A.J. Lopez-Martin R.G. Carvajal Klipsch School of Electrical and Computer Engineering New Mexico State University Las Cruces NM USA Department of Electrical and Electronic Engineering Public University of Navarra Pamplona Spain Departmento de Ingenieria Electronica Escuela Superior de Ingenieros Universidad de Sevilla Spain

A technique for implementing class AB differential input stages is proposed. It is well suited for low voltage operation, and can be applied to single-stage or two-stage OTAs in continuous time or sampled-data systems. In order to illustrate this approach an OTA is presented, combining the input stage proposed and local common-mode feedback with two-resistors to obtain high slew rate and very low static power consumption. Measurement results from a 0.5-/spl mu/m CMOS implementation with supply voltages of /spl plusmn/1 V show a slew rate of 50V//spl mu/s for an 80-pF load capacitance, and a static power consumption of only 120 /spl mu/W. Silicon area for this OTA is 0.024mm/sup 2/.

关键词： Energy consumption Indium phosphide Low voltage Feedback Switching circuits Power dissipation Circuit topology Differential amplifiers Power engineering computing Power engineering and energy

来源：评论

学校读者我要写书评

暂无评论

Maximum Balanced (k, ϵ)-Bitruss Detection in Signed Bipartite Graph 50th

Maximum Balanced (k, ϵ)-Bitruss Detection in Signed Biparti...

引用

50th International Conference on Very Large Data Bases, VLDB 2024

作者： Chung, Kai Hiu Zhou, Alexander Wang, Yue Chen, Lei Hong Kong University of Science and Technology China Shenzhen Institute of Computing Sciences China

Signed bipartite graphs represent relationships between two sets of entities, including both positive and negative interactions, allowing for a more comprehensive modeling of real-world networks. In this work, we focus on the detection of cohesive subgraphs in signed bipartite graphs by leveraging the concept of balanced butterflies. A balanced butterfly is a cycle of length 4 that is considered stable if it contains an even number of negative edges. We propose anovel model called the balanced (k, ϵ)-bitruss, which provides a concise representation of cohesive signed bipartite subgraphs while enabling control over density (k) and balance (ϵ). We prove that finding the largest balanced (k, ϵ)-bitruss is NP-hard and cannot be efficiently approximated to a significant extent. Furthermore, we extend the unsigned butterfly counting framework to efficiently compute both balanced and unbalanced butterflies. Based on this technique, we develop two greedy heuristic algorithms: one that prioritizes followers and another that focuses on balanced support ratios. Experimental results demonstrate that the greedy approach based on balanced support ratios outperforms the follower-based approach in terms of both efficiency and effectiveness. © 2023, VLDB Endowment. All rights reserved.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds for Number-in-Hand Multiparty Communication Complexity Made Easy 12

Lower Bounds for Number-in-Hand Multiparty Communication Com...

引用

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

作者： Jeff M. Phillips Elad Verbin Qin Zhang School of Computing University of Utah MADALGO Dept. of Computer Science Aarhus University

ISBN: (纸本)9781611972108

In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players to see) and (mainly) in the message-passing model, where messages are sent player-to-player. We introduce a new technique for proving such bounds, called symmetriza-tion, which is natural, intuitive, and often easy to use. For example, for the problem where each of k players gets a bit-vector of length n, and the goal is to compute the coordinate-wise XOR of these vectors, we prove a tight lower bounds of Ω(nk) in the blackboard model. For the same problem with AND instead of XOR, we prove a lower bounds of roughly Ω(nk) in the message-passing model (assuming k ≤ n/3200) and Ω(n log k) in the blackboard model. We also prove lower bounds for bit-wise majority, for a graph-connectivity problem, and for other problems; the technique seems applicable to a wide range of other problems as well. The obtained communication lower bounds imply new lower bounds in the functional monitoring model (also called the distributed streaming model). All of our lower bounds allow randomized communication protocols with two-sided error.

关键词： Lower bound communication complexity exclusive OR message passing new technique Messages Communication protocols Players

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共208页 << < 195 196 197 198 199 200 201 202 203 204 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：