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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

519 篇 会议
300 篇 期刊文献
9 册 图书

馆藏范围

828 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

426 篇 工学
- 320 篇 计算机科学与技术...
- 248 篇 软件工程
- 77 篇 信息与通信工程
- 59 篇 控制科学与工程
- 31 篇 生物工程
- 28 篇 电气工程
- 26 篇 化学工程与技术
- 24 篇 机械工程
- 20 篇 电子科学与技术（可...
- 19 篇 动力工程及工程热...
- 18 篇 生物医学工程（可授...
- 15 篇 力学（可授工学、理...
- 15 篇 光学工程
- 15 篇 仪器科学与技术
- 15 篇 材料科学与工程（可...
- 7 篇 航空宇航科学与技...
371 篇 理学
- 302 篇 数学
- 92 篇 统计学（可授理学、...
- 62 篇 物理学
- 40 篇 生物学
- 28 篇 化学
- 28 篇 系统科学
80 篇 管理学
- 42 篇 管理科学与工程(可...
- 38 篇 图书情报与档案管...
- 28 篇 工商管理
13 篇 教育学
- 13 篇 教育学
12 篇 经济学
- 12 篇 应用经济学
12 篇 医学
- 10 篇 临床医学
- 8 篇 基础医学(可授医学...
7 篇 法学
- 6 篇 社会学
5 篇 农学
1 篇 哲学
1 篇 文学
1 篇 历史学
1 篇 军事学
1 篇 艺术学

主题

118 篇 computer science
40 篇 mathematics
19 篇 algorithm design...
19 篇 polynomials
17 篇 artificial intel...
16 篇 educational inst...
16 篇 computational mo...
14 篇 humans
14 篇 shape
13 篇 data mining
13 篇 equations
12 篇 application soft...
11 篇 routing
11 篇 mathematical mod...
11 篇 layout
10 篇 concurrent compu...
10 篇 control systems
10 篇 topology
10 篇 robustness
9 篇 cameras

机构

21 篇 department of co...
11 篇 math. division n...
11 篇 department of ma...
9 篇 college of mathe...
8 篇 courant inst. of...
7 篇 department of ap...
7 篇 inst. math. stoc...
6 篇 department of co...
6 篇 department of co...
6 篇 machine learning...
6 篇 department of ap...
5 篇 department of ap...
5 篇 school of comput...
5 篇 research centre ...
5 篇 department of ap...
5 篇 dept. of math. a...
4 篇 department of ma...
4 篇 math. research i...
4 篇 department of co...
4 篇 department of ma...

作者

11 篇 naor moni
11 篇 ban jung-chao
9 篇 hu wen-guei
9 篇 sharir micha
8 篇 alsmeyer gerold
8 篇 m. irani
8 篇 lai guan-yu
7 篇 r. basri
6 篇 hemaspaandra edi...
6 篇 krishnaswamy smi...
6 篇 srivastava gauta...
6 篇 fitzsimmons zack
6 篇 wu yu-liang
5 篇 chang chih-hung
5 篇 maldonado josé c...
5 篇 irit dinur
5 篇 macdonell stephe...
5 篇 mendes emília
5 篇 pinchasi rom
5 篇 evangelos a. the...

语言

810 篇 英文
16 篇 其他
3 篇 中文

检索条件"机构=Department of Applied Math. and Computer Science"

共 828 条记录，以下是131-140 订阅

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

详细简洁

排序：

Boundary recognition in sensor networks by topological methods

Boundary recognition in sensor networks by topological metho...

引用

12th Annual International Conference on Mobile Computing and Networking, MOBICOM 2006

作者： Wang, Yue Gao, Jie Mitchell, Joseph S. B. Dept. of Computer Science Stony Brook University Stony Brook NY United States Dept. of Applied Math. and Statistics Stony Brook University Stony Brook NY United States

ISBN: (纸本)1595932860

Wireless sensor networks are tightly associated with the underlying environment in which the sensors are deployed. The global topology of the network is of great importance to both sensor network applications and the implementation of networking functionalities. In this paper we study the problem of topology discovery, in particular, identifying boundaries in a sensor network. Suppose a large number of sensor nodes are scattered in a geometric region, with nearby nodes communicating with each other directly. Our goal is to find the boundary nodes by using only connectivity information. We do not assume any knowledge of the node locations or inter-distances, nor do we enforce that the communication graph follows the unit disk graph model. We propose a simple, distributed algorithm that correctly detects nodes on the boundaries and connects them into meaningful boundary cycles. We obtain as a byproduct the medial axis of the sensor field, which has applications in creating virtual coordinates for routing. We show by extensive simulation that the algorithm gives good results even for networks with low density. We also prove rigorously the correctness of the algorithm for continuous geometric domains. Copyright 2006 ACM.

关键词： Wireless telecommunication systems

来源：评论

学校读者我要写书评

暂无评论

Compositional modeling of reactive systems using open nets 12th

引用

12th International Conference on Concurrency Theory, CONCUR 2001

作者： Baldan, P. Corradini, A. Ehrig, H. Heckel, R. Dipartimento di Informatica Università di Pisa Italy Computer Science Department Technical University of Berlin Germany Dept. of Math. and Comp. Science University of Paderborn Germany

ISBN: (纸本)3540424970

In order to model the behaviour of open concurrent systems by means of Petri nets, we introduce open Petri nets, a generalization of the ordinary model where some places, designated as open, represent an interface of the system towards the environment. Besides generalizing the token game to reflect this extension, we define a truly concurrent semantics for open nets by extending the Goltz-Reisig process semantics of Petri nets. We introduce a composition operation over open nets, characterized as a pushout in the corresponding category, suitable to model both interaction through open places and synchronization of transitions. The process semantics is shown to be compositional with respect to such composition operation. Technically, our result is similar to the amalgamation theorem for data-types in the framework of algebraic specifications. A possible application field of the proposed constructions and results is the modeling of interorganizational workflows, recently studied in the literature. This is illustrated by a running example. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Enumeration of binary trees, Lempel-Ziv'78 parsings, and universal types

Enumeration of binary trees, Lempel-Ziv'78 parsings, and uni...

引用

Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

作者： Knessl, Charles Szpankowski, Wojciech Dept. Math. Stat. and Computer Science University of Illinois at Chicago Chicago IL 60607-7045 United States Department of Computer Science Purdue University West Lafayette IN 47907-2066 United States

ISBN: (纸本)0898715962

Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them, The number of such trees with n nodes is now known as the Catalan number. Over the years various interesting questions about the statistics of such trees were investigated (e.g., height and path length distributions for a randomly selected tree). Binary trees find an abundance of applications in computer science. However, recently Seroussi posed a new and interesting problem motivated by information theory considerations: how many binary trees of a given path length (sum of depths) are there? This question arose in the study of universal types of sequences. Seroussi declares that two sequences of length p have the same universal type if they generate the same set of phrases in the incremental parsing of the LempelZiv'78 scheme. (He then proves that sequences of the same type converge to the same empirical distribution.) It turns out that the number of distinct types of sequences of length p corresponds to the number of binary (unlabeled and ordered) trees, Tp, of given path length p (and also the number of different Lempel-Ziv'78 parsings of length p sequences). We first show that the number of binary trees with given path length p is asymptotically equal to Tp ∼ 22p/(log2p). Then we establish various limiting distributions for the number of nodes (number of phrases in the Lempel-Ziv'78 scheme) when a tree is selected randomly among all Tp trees. Throughout, we use methods of analytic algorithmics such as generating functions and complex asymptotics, as well as methods of applied math.matics such as the WKB method and matched asymptotics.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Portable, MPI-interoperable Coarray Fortran 14

Portable, MPI-interoperable Coarray Fortran

引用

2014 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2014

作者： Yang, Chaoran Bland, Wesley Mellor-Crummey, John Balaji, Pavan Department of Computer Science Rice University United States Math. and Comp. Sci. Division Argonne National Laboratory United States Mathematics and Computer Science Division Argonne National Laboratory United States

ISBN: (纸本)9781450326568

The past decade has seen the advent of a number of parallel programming models such as Coarray Fortran (CAF), Unified Parallel C, X10, and Chapel. Despite the productivity gains promised by these models, most parallel scientific applications still rely on MPI as their data movement model. One reason for this trend is that it is hard for users to incrementally adopt these new programming models in existing MPI applications. Because each model use its own runtime system, they duplicate resources and are potentially errorprone. Such independent runtime systems were deemed necessary because MPI was considered insufficient in the past to play this role for these languages. The recently released MPI-3, however, adds several new capabilities that now provide all of the functionality needed to act as a runtime, including a much more comprehensive one-sided communication framework. In this paper, we investigate how MPI-3 can form a runtime system for one example programming model, CAF, with a broader goal of enabling a single application to use both MPI and CAF with the highest level of interoperability. Copyright © 2014 ACM.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Application of L -fuzzy sets in m -ary semigroups

Application of L -fuzzy sets in m -ary semigroups

引用

作者： Kuka, Shkelqim Hila, Kostaq Naka, Krisanthi Department of Mathematics Faculty of Math. Engineering and Physics Engineering Polytechnic University of Tirana Tirana Albania Department of Mathematics and Computer Science Faculty of NaturalSciences University of Gjirokastra Gjirokastra Albania

In this paper, applying the theory of L-fuzzy sets, we introduce the concept of an L-fuzzy ideal (L-fuzzy k-ideal) of an m-ary semigroup. Some properties of them are investigated and some structural theorems for L-fuzzy ideals (L-fuzzy k-ideals) of m-ary semigroups are proved. In this direction the concept of image and preimage of an L-fuzzy set under m-ary semigroup homomorphism are discussed. Also, the notions of normal L-fuzzy ideal (L-fuzzy k-ideal) and maximal L-fuzzy ideal (L-fuzzy k-ideal) of an m-ary semigroup are introduced and some properties of them are studied. Further, we introduce the notion of L-fuzzy congruence on an m-ary semigroup and make a study of L-fuzzy quotient m-ary semigroup using an L-fuzzy congruence, an L-fuzzy quotient m-ary semigroup induced by L-fuzzy ideals. We also investigate some properties of homomorphisms between them. © 2018 - IOS Press and the authors. All rights reserved.

关键词： Algebra

来源：评论

学校读者我要写书评

暂无评论

Portable, MPI-interoperable coarray fortran

Portable, MPI-interoperable coarray fortran

引用

The past decade has seen the advent of a number of parallel programming models such as Coarray Fortran (CAF), Unified Parallel C, X10, and Chapel. Despite the productivity gains promised by these models, most parallel scientific applications still rely on MPI as their data movement model. One reason for this trend is that it is hard for users to incrementally adopt these new programming models in existing MPI applications. Because each model use its own runtime system, they duplicate resources and are potentially error-prone. Such independent runtime systems were deemed necessary because MPI was considered insufficient in the past to play this role for these languages. The recently released MPI-3, however, adds several new capabilities that now provide all of the functionality needed to act as a runtime, including a much more comprehensive one-sided communication framework. In this paper, we investigate how MPI-3 can form a runtime system for one example programming model, CAF, with a broader goal of enabling a single application to use both MPI and CAF with the highest level of interoperability. © 2014 ACM.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

On the cost of recomputing: Tight bounds on pebbling with faults

On the cost of recomputing: Tight bounds on pebbling with fa...

引用

Proceedings of the 1994 21st International Colloquium on Automata, Languages and Programming, ICALP'94

作者： Aumann, Yonatan Bar-Ilan, Judit Feige, Uriel Department of Applied Math. The Weizmann Institute Rehovot Israel MIT Laboratory of Computer Science 545 Technology Square CambridgeMA02138 United States School of Library Archive and Information Studies The Hebrew University Jerusalem91904 Israel

ISBN: (纸本)9783540582014

We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the "pebbling game" model. We extend this model to the faulty case, where the content of memory cells may be erased. The model captures notions such as "check points" (keeping multiple copies of intermediate results), and "recovery" (partial recomputing in the case of failure). Using this model, we derive tight bounds on the time and/or space overhead inflicted by faults. As a lower bound, we exhibit cases where f worst-case faults may necessitate an Ω(f) multiplicative overhead in computation resources (time, space, or their product). The lower bound holds regardless of the computing and recomputing strategy employed. A matching upper-bound algorithm establishes that an O(f) multiplicative overhead always suffices. For the special class of tree computations, we show that faults can be handled with an O(f) additive factor in memory, and only a constant multiplicative overhead in time. © 1994, Springer Verlag. All rights reserved.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

DEMView: 3-D visualization of DEM error 9

DEMView: 3-D visualization of DEM error

引用

9th International Symposium on Spatial Accuracy Assessment in Natural Resources and Environmental sciences, Accuracy 2010

作者： Gousie, Michael B. Smith, Michael Department of Math. and Computer Science Wheaton College MA United States School of Geography Geology and the Environment Kingston University Kingston-upon-Thames United Kingdom

It is well known that a digital elevation model (DEM) may contain systematic or other errors. In many 3-D visualization systems, problems in the data may be highlighted, but it is often difficult for the viewer to discern the exact nature of the problem. We present DEMView, a viewing and error assessment system specifically for use with DEMs. The system displays a DEM in 3-D with the usual translation, rotation, and zooming tools. However, the system incorporates a suite of visual (qualitative) and statistical (quantitative) assessment tools that help a researcher determine and analyze errors and uncertainty in a given DEM. A case study shows the efficacy of the system.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

Private pareto optimal exchange 15

Private pareto optimal exchange

引用

16th ACM Conference on Economics and Computation, EC 2015

作者： Kannan, Sampath Morgenstern, Jamie Rogers, Ryan Roth, Aaron Applied Math and Computational Sciences Department University of Pennsylvania United States Carnegie Mellon University Computer Science Department United States

ISBN: (纸本)9781450334105

We consider the problem of implementing an individually rational, asymptotically Pareto optimal allocation in a barter-exchange economy where agents are endowed with goods and preferences over the goods of others, but may not use money as a medium of exchange. Because one of the most important instantiations of such economies is kidney exchange - where the "input" to the problem consists of sensitive patient medical records - we ask to what extent such exchanges can be carried out while providing formal privacy guarantees to the participants. We show that individually rational allocations cannot achieve any non-trivial approximation to Pareto optimality if carried out under the constraint of differential privacy - or even the relaxation of joint-differential privacy, under which it is known that asymptotically optimal allocations can be computed in two sided markets [Hsu et al. STOC 2014]. We therefore consider a further relaxation that we call marginal-differential privacy - which promises, informally, that the privacy of every agent i is protected from every other agent j 6 ≡ i so long as j does not collude or share allocation information with other agents. We show that under marginal differential privacy, it is possible to compute an individually rational and asymptotically Pareto optimal allocation in such exchange economies.

关键词： algorithms differential privacy mechanism design

来源：评论

学校读者我要写书评

暂无评论

Parametric sensitivity in building fuzzy decision trees: An experimental analysis

Parametric sensitivity in building fuzzy decision trees: An ...

引用

Proceedings of 2002 International Conference on Machine Learning and Cybernetics

作者： Wang, Xi-Zhao Zhao, Ming-Hua Yeung, Daniel So School of Math. and Computer Science Hebei University Baoding Hebei China Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong

ISBN: (纸本)0780375084

Fuzzy Decision Tree (FDT) induction is an extraction technique of fuzzy rules, which has been widely used in handling ambiguous classification problems related to human's thought and sense. The entire process of building FDT is based on a specified parameter (called significant level) which seriously affects the computation of fuzzy entropy and classification result of FDT. Since the value of this parameter is usually given in terms of human experience while building a FDT, it is very difficult to determine its optimal value. This paper makes an attempt to give some guidelines for how to automatically choose the optimal value of this parameter by analyzing analytic expression between this parameter and fuzzy entropy and further by investigating the decision tree's sensitivity to the parameter perturbation.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共83页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：