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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,946 篇 会议
97 篇 期刊文献
82 册 图书
2 篇 学位论文

馆藏范围

3,125 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

1,931 篇 工学
- 1,454 篇 计算机科学与技术...
- 822 篇 软件工程
- 383 篇 电气工程
- 255 篇 控制科学与工程
- 104 篇 信息与通信工程
- 59 篇 机械工程
- 57 篇 交通运输工程
- 47 篇 电子科学与技术（可...
- 38 篇 石油与天然气工程
- 33 篇 核科学与技术
- 31 篇 材料科学与工程（可...
- 26 篇 生物工程
- 24 篇 生物医学工程（可授...
- 22 篇 动力工程及工程热...
- 20 篇 仪器科学与技术
- 20 篇 土木工程
- 15 篇 建筑学
519 篇 理学
- 369 篇 数学
- 85 篇 物理学
- 62 篇 系统科学
- 57 篇 统计学（可授理学、...
- 44 篇 生物学
211 篇 管理学
- 177 篇 管理科学与工程(可...
- 63 篇 工商管理
- 43 篇 图书情报与档案管...
77 篇 医学
- 68 篇 临床医学
- 46 篇 特种医学
- 15 篇 基础医学(可授医学...
41 篇 教育学
- 39 篇 教育学
31 篇 法学
- 27 篇 社会学
16 篇 经济学
8 篇 农学
5 篇 文学
5 篇 艺术学
3 篇 哲学
1 篇 军事学

主题

274 篇 logic gates
236 篇 fuzzy logic
172 篇 probabilistic lo...
153 篇 programming
139 篇 linear programmi...
110 篇 logic programmin...
88 篇 dynamic programm...
86 篇 optimization
71 篇 computer science
69 篇 programming prof...
69 篇 computational mo...
67 篇 artificial intel...
67 篇 mathematical mod...
58 篇 integer programm...
58 篇 uncertainty
54 篇 semantics
53 篇 software enginee...
50 篇 computer archite...
50 篇 logic
44 篇 genetic programm...

机构

8 篇 university of mi...
6 篇 hitachi ltd hita...
6 篇 st petersburg el...
5 篇 inria
5 篇 kyushu sangyo un...
5 篇 myongji universi...
5 篇 saint petersburg...
5 篇 univ illinois ur...
5 篇 politecnico di b...
5 篇 monash universit...
5 篇 university of pe...
5 篇 carnegie mellon ...
5 篇 polytechnic univ...
5 篇 university of ba...
5 篇 covenant univers...
5 篇 univ illinois de...
4 篇 ist austria klos...
4 篇 graduate school ...
4 篇 institute of mic...
4 篇 school of electr...

作者

6 篇 kitamura m
6 篇 woltran stefan
6 篇 eiter thomas
6 篇 kakugawa s
5 篇 bernady o. apduh...
5 篇 ana maria a.c. r...
5 篇 eufemia tarantin...
5 篇 osvaldo gervasi
5 篇 yeonseung ryu
5 篇 beniamino murgan...
5 篇 sanjay misra
5 篇 inoue katsumi
5 篇 david taniar
5 篇 carmelo m. torre
5 篇 elena stankova
4 篇 schaub torsten
4 篇 belta calin
4 篇 leonard barolli
4 篇 hino n
4 篇 castillo oscar

语言

3,077 篇 英文
33 篇 其他
11 篇 中文
3 篇 葡萄牙文
2 篇 法文
1 篇 俄文

检索条件"任意字段=18th International Conference on Logic Programming"

共 3127 条记录，以下是2871-2880 订阅

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

详细简洁

排序：

Software architectural specification for optimal object distribution

Software architectural specification for optimal object dist...

引用

Computer Science Society (SCCC) international conference Chilean FLAGGED

作者： M.C. Bastarrica S.A. Demurjian A.A. Shvartsman Computer Science & Engineering Dept. The University of Connecticut Storrs CT USA The Mitre Corp. Eatontown NJ

Software architectural design is essential for complex distributed applications. Architectural specifications need to define the key aspects of the application, including its intended functions, interfaces, interoperability requirements, distributability; scalability, extensibility, target platforms and networks, and required middleware services. the authors present an architectural extension for specifying distributable components of the application and for quantifying their interaction patterns. the goal of the specification is to serve as the basis for obtaining optimal distributions of the application components over a target network that minimizes remote communication among the components. the optimal distributions are obtained by using the architectural specification to derive a BIP (binary integer programming) model and solving the resulting system. they formalize the object-oriented architectural style using the Z specification language. this style defines the detailed information necessary to derive optimal distributions using the BIP model.

关键词： Software engineering Nonlinear equations Writing Computer science Connectors throughput Packaging Condition monitoring Linear programming Upper bound

来源：评论

学校读者我要写书评

暂无评论

Optimal extension fields for fast arithmetic in public-key algorithms 8th

Optimal extension fields for fast arithmetic in public-key a...

引用

18th Annual international Cryptology conference, CRYPTO 1998

作者： Bailey, Daniel V. Paar, Christof Computer Science Department Worcester Polytechnic Institute WorcesterMA01609 United States ECE Department Worcester Polytechnic Institute WorcesterMA01609 United States

ISBN: (纸本)3540648925

this contribution introduces a class of Galois field used to achieve fast finite field arithmetic which we call an Optimal Extension Field (OEF). this approach is well suited for implementation of public-key cryptosystems based on elliptic and hyperelliptic curves. Whereas previous reported optimizations focus on finite fields of the form GF(p) and GF(2 m), an OEF is the class of fields GF(p m), for p a prime of special form and m a positive integer. Modern RISC workstation processors are optimized to perform integer arithmetic on integers of size up to the word size of the processor. Our construction employs well-known techniques for fast finite field arithmetic which fully exploit the fast integer arithmetic found on these processors. In this paper, we describe our methods to perform the arithmetic in an OEF and the methods to construct OEFs. We provide a list of OEFs tailored for processors with 8, 16, 32, and 64 bit word sizes. We report on our application of this approach to construction of elliptic curve cryptosystems and demonstrate a substantial performance improvement over all previous reported software implementations of Galois field arithmetic for elliptic curves. © Springer-Verlag Berlin Heidelberg 1998.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

On a tree-like representation for symbolic-numeric data and its use in Galois lattice method

On a tree-like representation for symbolic-numeric data and ...

引用

Computer Science Society (SCCC) international conference Chilean FLAGGED

作者： M.C. Daniel-Vatonne C. Hemce IREMIA Université de la Réunion Saint Denis Messag France

the authors propose a knowledge representation system that combines a greater expressive richness than that of the Boolean or attribute frameworks, and an analogous treatment complexity. this system can be used in symbolic-numerical clustering analysis and will be used to build a Galois (concept) lattice. Data and data classes are described by labelled, recursive trees called genterms. the set of these are generated with an algebraic signature. In addition, it is ordered by a generalization relation inducing a semilattice and easily extending to a lattice. Genterm node labels belong to numerical or symbolic sets of type. Each of these sets is a semilattice in which the order relation can also be viewed as a generalization relation. the used formalism is similar to those of abstract data type signatures and offers an alternative to the description logic formalisms. the elements of the Galois lattice between a genterm lattice and a power set of objects are couples (concepts) containing one set of objects and its description by a unique genterm.

关键词： Lattices logic Machine learning Tree graphs Electrical capacitance tomography Clustering algorithms Polynomials Unsupervised learning Knowledge representation Machine learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Khazana: an infrastructure for building distributed services

Khazana: an infrastructure for building distributed services

引用

international conference on Distributed Computing Systems

作者： J. Carter A. Ranganathan S. Susarla Department of Computer Science University of Utah Salt Lake UT USA

Essentially all distributed systems, applications, and services at some level boil down to the problem of managing distributed shared state. Unfortunately, while the problem of managing distributed shared state is shared by many applications, there is no common means of managing the data-every application devises its own solution. We have developed Khazana, a distributed service exporting the abstraction of a distributed persistent globally shared store that applications can use to store their shared state. Khazana is responsible for performing many of the common operations needed by distributed applications, including replication, consistency management, fault recovery, access control and location management. Using Khazana as a form of middleware, distributed applications can be quickly developed from corresponding uniprocessor applications through the insertion of Khazana data access and synchronization operations.

关键词： Application software Middleware Computer science Access control Distributed databases Collaboration Collaborative software Collaborative work Information management programming profession

来源：评论

学校读者我要写书评

暂无评论

LBF: a performance metric for program reorganization

LBF: a performance metric for program reorganization

引用

international conference on Distributed Computing Systems

作者： H. Eom J.K. Hollingsworth Computer Science Department University of Maryland MD USA

We introduce a new performance metric, called Load Balancing Factor (LBF), to assist programmers with evaluating different tuning alternatives. the LBF metric differs from traditional performance metrics since it is intended to measure the performance implications of a specific tuning alternative rather than quantifying where time is spent in the current version of the program. A second unique aspect of the metric is that it provides guidance about moving work within a distributed or parallel program rather than reducing it. A variation of the LBF metric can also be used to predict the performance impact of changing the underlying network. the LBF metric can be computed incrementally and online during the execution of the program to be tuned. We also present a case study that shows that our metric can predict the actual performance gains accurately for a test suite of six programs.

关键词： Measurement programming profession Computational modeling Computer science Educational institutions US Department of Energy NIST Load management Integrated circuit testing Debugging

来源：评论

学校读者我要写书评

暂无评论

Toward transparent selective sequential consistency in distributed shared memory systems

Toward transparent selective sequential consistency in distr...

引用

international conference on Distributed Computing Systems

作者： Chengzheng Sun Zhiyi Huang Wanju lei A. Saitar School of Computing & Information Technology Griffith University Brisbane QLD Australia Griffith University Nathan QLD AU

this paper proposes a transparent selective sequential consistency approach to distributed shared memory (DSM) systems. First, three basic techniques-time selection, processor selection, and data selection-are analyzed for improving the performance of strictly sequential consistency DSM systems, and a transparent approach to achieving these selections is proposed. then, this paper focuses on the protocols and techniques devised to achieve transparent data selection, including a novel selective lazy/eager updates propagation protocol for propagating updates on shared data objects, and the critical region updated pages set scheme to automatically detect the associations between shared data objects and synchronization objects. the proposed approach is able to offer the same potential performance advantages as the entry consistency model or the scope consistency model, but it imposes no extra burden to programmers and never fails to execute programs correctly. the devised protocols and techniques have been implemented and experimented with in the context of the TreadMarks DSM system. Performance results have shown that for many applications, our transparent data selection approach outperforms the lazy release consistency model using a lazy or eager updates propagation protocol.

关键词： Protocols Distributed computing programming profession Sun Information technology Australia Performance analysis Object detection Message passing Parallel programming

来源：评论

学校读者我要写书评

暂无评论

A multithreaded message-passing system for high performance distributed computing applications

A multithreaded message-passing system for high performance ...

引用

international conference on Distributed Computing Systems

作者： S.-Y. Park J. Lee S. Hariri High Performance Distributed Computing (HPDC) Laboratory Department of Electrical Engineering and Computer Science High Performance Distributed Computing HPDC Laboratory Syracuse University Syracuse NY USA

NYNET (ATM wide area network testbed in New York state) Communication System (NCS) is a multithreaded message passing system developed at Syracase University that provides high performance and flexible communication services over asynchronous transfer mode (ATM) based high performance distributed computing (HPDC) environments. NCS capitalizes on thread based programming model to overlap computations and communications, and develop a dynamic message passing environment with separate data and control paths. this leads to a flexible and adaptive message passing environment that can support multiple flow control, error control, and multicasting algorithms. We provide an overview of the NCS architecture and present how NCS point to point communication services are implemented. We also analyze the overhead incurred by using multithreading and compare the performance of NCS point to point communication primitives with those of other message passing systems such as p4, PVM, and MPI. Benchmarking results indicate that NCS shows comparable performance to other systems for small message sizes but outperforms other systems for large message sizes.

关键词： Message passing Asynchronous transfer mode Dynamic programming Communication system control Wide area networks System testing Distributed computing Yarn Computational modeling Programmable control

来源：评论

学校读者我要写书评

暂无评论

Fast, optimized Sun RPC using automatic program specialization

Fast, optimized Sun RPC using automatic program specializati...

引用

international conference on Distributed Computing Systems

作者： G. Muller R. Marlet E.-N. Volanschi C. Consel C. Pu A. Goel IRISA Rennes France Department of Computer Science and Engineering Oregon Graduate Institute Portland OR USA

Fast remote procedure call (RPC) is a major concern for distributed systems. Many studies aimed at efficient RPC consist of either new implementations of the RPC paradigm or manual optimization of critical sections of the code. this paper presents an experiment that achieves automatic optimization of an existing, commercial RPC implementation, namely the Sun RPC. the optimized Sun RPC is obtained by using an automatic program specializer. It runs up to 1.5 times faster than the original Sun RPC. Close examination of the specialized code does not reveal further optimization opportunities which would lead to significant improvements without major manual restructuring. the contributions of this work are: the optimized code is safely produced by an automatic tool and thus does not entail any additional maintenance; to the best of our knowledge this is the first successful specialization of mature, commercial, representative system code; and the optimized Sun RPC runs significantly faster than the original code.

关键词： Sun programming profession Performance gain Operating systems Computer science Telecommunications Safety Production Transport protocols Hardware

来源：评论

学校读者我要写书评

暂无评论

6th international conference on Algebraic and logic programming, ALP 1997 and the 3rd international Workshop on Higher-Order Algebra, logic and Term Rewriting, HOA 1997

6th International Conference on Algebraic and Logic Programm...

引用

6th international conference on Algebraic and logic programming, ALP 1997

ISBN: (纸本)3540634592

the proceedings contain 18 papers. the special focus in this conference is on Functional and logic programming. the topics include: Safe folding/unfolding with conditional narrowing;optimal non-deterministic functional logic computations;a semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints;parallelizing functional programs by generalization;higher-order equational unification via explicit substitutions;parameterised higher-order algebraic specifications;a computation model for a higher-order functional logic language;on composable properties of term rewriting systems;needed reductions with context-sensitive rewriting;conditional term graph rewriting;lazy narrowing with parametric order sorted types;termination of algebraic type systems;proof net semantics of proof search computation;perpetuality and uniform normalization;model generation with existentially quantified variables and constraints and optimal left-to-right pattern-matching automata.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Software engineering: Content, opinions, and tendencies - (Some results of the 18th international conference on Software Engineering)

引用

programming AND COMPUTER SOFTWARE 1997年第4期23卷 198-205页

作者： Pottosin, IV RUSSIAN ACAD SCI SIBERIAN DIVERSHOV INFORMAT SYST INSTNOVOSIBIRSK 630090RUSSIA

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共313页 << < 284 285 286 287 288 289 290 291 292 293 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：