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

IEEE International Symposium on Information Theory

作者： I. Honkala A. Klapper Dept. of Math. Turka Univ. Finland Department of Computer Science University of Kentucky Lexington KY USA

The concept of multicovering radius was introduced by A. Klapper (see IEEE Trans. Inform. Theory, vol.43, p.1372-7, 1997) in the context of studying the security of stream ciphers. The purpose of this paper is to derive new bounds by relating the multicovering radii of a code to a relative notion of covering radius. For generality, we define this notion for multicovering radii, although we only use the ordinary covering radius version.

关键词： Linear code math.matics Security Books Silicon carbide computer science Binary codes

来源：评论

学校读者我要写书评

暂无评论

Constructing symbols as manipulable structures by recurrent networks

Constructing symbols as manipulable structures by recurrent ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： J.G. Taylor N.R. Taylor B. Apolloni C. Orovas Dept. of Math. King's Coll. London UK Department of Computer Science University of Milan Milan Italy

A simple approach is developed to use semantics as defined by virtual actions to guide the construction of manipulable symbol representations for objects and actions, in particular to obtain a model of syntactic processing in the developing infant. This uses a simplified model of the frontal lobes, and in particular the various sets of neurons involved in the process of chunking of temporal sequences observed in monkeys. The manner in which such neurons play a role in phrase structure grammar is elucidated at a simple level.

关键词： Kirchhoff's Law Brain modeling Neurons Humans Natural languages math.matics Educational institutions computer science Biological neural networks Neural networks

来源：评论

学校读者我要写书评

暂无评论

General models for optimum arbitrary-dimension FPGA switch box designs

General models for optimum arbitrary-dimension FPGA switch b...

引用

IEEE International Conference on computer-Aided Design

作者： Hongbing Fan Jiping Liu Yu-Liang Wu Department of Computer Science University of Victoria Victoria BC Canada Department of Math. & Computer Sci University of Lethbridge Lethbridge Canada Department of Computer Science & Engineering Chinese University of Hong Kong New Territories Hong Kong China

ISBN: (纸本)0780364457

An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desirable to design hyper-universal switch boxes with the minimum number of switches. A previous work, Universal Switch Module, considered such a design problem concerning 2-pin net routings around a single FPGA switch box. However, as most nets are multi-pin nets in practice, it is imperative to study the problem that involves multi-pin nets. In this paper, we provide a new view of global routings and formulate the most general k-sided switch box design problem into an optimum k-partite graph design problem. Applying a powerful decomposition theorem of global routings, we prove that, for a fixed k, the number of switches in an optimum k-sided switch box with W terminals on each side is O (W), by constructing some hyper-universal switch boxes with O(W) switches. Furthermore, we obtain optimum, hyper-universal 2-sided and 3-sided switch boxes, and propose hyper-universal 4-sided switch boxes with less than 6.7 W switches, which is very close to the lower bound 6 W obtained for pure 2-pin net models.

关键词： Switches Field programmable gate arrays Routing Wire Pins Boolean functions computer science Logic arrays Councils Topology

来源：评论

学校读者我要写书评

暂无评论

Two dimensional simulations of enhanced heat transfer in an intermittently grooved channel

American Society of Mechanical Engineers, Heat Transfer Divi...

引用

American Society of Mechanical Engineers, Heat Transfer Division, (Publication) HTD 2000年 366卷 23-31页

作者： Greiner, M. Fischer, P.F. Tufo, H.M. Mechanical Engineering Department University of Nevada Reno NV 89557 United States Math. and Computer Science Division Argonne National Laboratory Argonne IL 60439 United States Department of Computer Science University of Chicago Chicago IL 60637 United States

Two-dimensional Navier-Stokes simulations of heat and momentum transport in an intermittently grooved passage are performed using the spectral element technique for the Reynolds number range 600 [less-than or equal to] Re [less-than or equal to] 1800. The computational domain has seven contiguous transverse grooves cut symmetrically into opposite walls, followed by a flat section with the same length. Periodic inflow/outflow boundary conditions are employed. The development and decay of unsteady flow is observed in the grooved and flat sections, respectively. The axial variation of the unsteady component of velocity is compared to the local heat transfer, shear stress and pressure gradient. The results suggest that intermittently grooved passages may offer even higher heat transfer for a given pumping power than the levels observed in fully grooved passages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Entropy and complexity

HP Laboratories Technical Report

引用

HP Laboratories Technical Report 2000年第32期BRIMS卷

作者： Shah, Devavrat Sharma, Mayank Basic Res. Inst. in the Math. Sci. HP Laboratories Bristol Computer Science Department Stanford University Stanford CA Department of Electrical Engineering Stanford University Stanford CA

Computational complexity of algorithms for solving problems has been at the heart of theoretical computer science. Traditionally, the computational cost of an algorithm is estimated by "counting" operations combinatorially depending on the algorithm. We present a very different method for estimating cost of solving problem, incorporating ideas from information theory. Algorithms can be viewed as "search" procedures on the input (output) space. This naturally makes computational cost of algorithm as function of "entropy" of input (output) distribution. The relation of computational complexity and "entropy" of distribution depends on the particular "operations" used by algorithm to solve problem. This particular mapping between computational scale and "entropy" scale is independent of problem. We demonstrate the use of this method in classical "searching" and "sorting" problems. We work out many different searching and sorting algorithms' complexity using this method. In process, we also come up with new algorithms to solve some cases of searching and sorting that are aware of input distribution.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Management through vision-a case study towards requirements of BizViz

Management through vision-a case study towards requirements ...

引用

International Conference on Information Visualisation (IV)

作者： B. Schonhage A. Eliens Dept. of Math. & Comput. Sci. Vrije Univ. Amsterdam Netherlands Department of Mathematics and Computer Science Vrije University Brussels Amsterdam Netherlands

BizViz (Business Visualization) is a rapidly growing phenomenon in the realm of visualization and information visualization. The main goal of BizViz is to support managers in their daily work of understanding forces within business processes and making decisions to control these forces. The case study presented in this paper illustrates the added value of visualization at a social security institution (Gak) in the Netherlands. The prototype built, integrates both databases and simulation as information sources. This way managers can study the past and present as well as experiment with possible future situations. The intended contribution of this paper is twofold. First, it presents how visualization can (successfully) be applied in practice. It illustrates the added value of BizViz in the social security domain. As a second contribution, the paper derives and discusses requirements that play an important role in visualization application development intended for decision-making support.

关键词： Production Data security Visual databases math.matics computer science Data visualization Management information systems Prototypes Information security Government

来源：评论

学校读者我要写书评

暂无评论

Extending BGMP for QoS-based inter-domain multicasting over the Internet

Extending BGMP for QoS-based inter-domain multicasting over ...

引用

IEEE International Conference on Communications (ICC)

作者： W.M. Moh L. Xiang X. Zhao Department of Math. and Computer Science San Jose State University Foundation San Jose CA USA Cisco Systems Inc. San Jose CA USA

There has been active research on quality of service (QoS) multicasting. Very few, however, addresses QoS inter-domain multicasting. We present a QoS extension to BGMP (border gateway multicast protocol) which, proposed by Kumar, et al., is currently one of the most promising inter-domain multicasting proposals. With limited modification to the current BGMP, we extend it to support the so called two-bit differentiated service (including the classes of premium, assured, and best-effort services) proposed by Nichols, Jacobson, and Zhang. Detailed mechanisms of the QoS extension are described. Performance is evaluated through extensive simulation of real-network scenarios, supporting CBR, VBR, and best-effort traffic flows with the three classes of services. We believe that the work presented here is significant to the advancement of the next-generation Internet supporting QoS communications.

关键词： Quality of service Multicast protocols Routing protocols Web and internet services Drives Proposals Jacobian matrices Traffic control Scalability computer science

来源：评论

学校读者我要写书评

暂无评论

Ant colonies are good at solving constraint satisfaction problems

Ant colonies are good at solving constraint satisfaction pro...

引用

Congress on Evolutionary Computation

作者： L. Schoofs B. Naudts Dept. of Math. & Comput. Sci. Antwerp Univ. Belgium Intelligent Systems Lab Department of Mathematics and Computer Science RUCA University of Antwerp Antwerp Belgium

We define an ant algorithm for solving random binary constraint satisfaction problems (CSPs). We empirically investigate the behavior of the algorithm on this type of problems and establish the parameter settings under which the ant algorithm performs best for a specific class of CSPs. The ant algorithm is compared to six other state-of-the-art stochastic algorithms from the field of evolutionary computing. It turns out that the ant algorithm outperforms all other algorithms and that bivariate distribution algorithms perform worse than the univariate ones, the latter largely due to the fact that they cannot model the randomly generated instances.

关键词： Scheduling algorithm Stochastic processes Intelligent systems math.matics computer science Ant colony optimization Vehicles Routing Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

Bisimilarity in term graph rewriting

引用

作者： Ariola, Zena M. Klop, Jan Willem Plump, Detlef Comp./Information Science Department University of Oregon Eugene OR 97401 United States Dept. of Math. and Computer Science Vrije Universiteit 1081 HV Amsterdam Netherlands Computing Science Institute Katholieke Universiteit Nijmegen Postbus 9010 6500 GL Nijmegen Netherlands Fb. Mathematik und Informatik Universität Bremen Postfach 33 04 40 28334 Bremen Germany

We present a survey of confluence properties of (acyclic) term graph rewriting. Results and counterexamples are given for different kinds of term graph rewriting;besides plain applications of rewrite rules, extensions with the operations of collapsing and copying, and both operations together are considered. Collapsing and copying together constitute bisimilarity of term graphs. We establish sufficient conditions for - and counterexamples to - confluence, confluence modulo bisimilarity, and the Church-Rosser property modulo bisimilarity. Moreover, we address rewriting modulo bisimilarity, that is, rewriting of bisimilarity classes of term graphs. © 2000 Academic Press.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Evaluation of rollback points on multiprocessor systems

引用

Systems and computers in Japan 2000年第11期31卷 24-30页

作者： Yoneda, Kiyomitsu Matsubara, Takashi Koga, Yoshiaki Department of Computer Science National Defense Academy Kanagawa 239-8686 Japan National Defense Academy Waseda University Department of Computer Science National Defense Academy IEEE Mathematical Society of Japan Dept. of Appl. Math. and Physics Kyoto University University of Illinois Department of Electrical Engineering Info. Processing Society of Japan

Rollback recovery is a well-known technique to recover the system from failures for fault-tolerant properties. There may be a domino effect when this method is applied to multiprocessor systems. In this paper, we discuss the method that restarts from consistent checkpoints without message loss in the whole system, when failure occurs under the assumption that the processors are connected with reliable communication. Furthermore, we present a method to obtain checkpoints by using temporal logic to roll back rapidly in each processor from the current renewal check-points and communication.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：