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

Heterogeneous multiserver queues with general input

INFOR 1997年第3期35卷 208-224页

作者： Grassmann, WK Zhao, YQQ Department of Computer Science University of Saskatchewan Saskatoon Sask. S7N 5A9 57 Campus Drive Canada Dept. of Mathematics and Statistics University of Winnipeg Winnipeg Man. RSB 2E9 515 Potage Ave. Canada Operations Res. Dept. of Swissair Canada Computer Science Department University of Saskatchewan Canada University of Saskatchewan Canada Queen's University Can. Inst. for Telecom. Research Department of Statistics University of Winnipeg Canada

A queueing system with heterogeneous servers and general input is analyzed. In particular, it is shown how to obtain the steady state probabilities for such a system, both at random-times and at the times preceding an arrival. If more than one server is idle, an arrival has the choice how to select one of the idle servers. The rules used to do the selection are part of the model description. The probabilities at arrival points are found as follows. First, one determines the probabilities for all states in which there is no queue, and then one calculates the probabilities in which customers are waiting. The probabilities at arrival epochs allow one to find the probability of no wait, the waiting time distribution, and the distribution of the number in the system at random epochs. Heuristic arguments, supported by numerical calculations, show that the importance of selecting a server increases with decreasing traffic intensity, increasing number of servers, and decreasing variation between interarrival times.

关键词： queueing heterogeneous servers general input GI/M/c

来源：评论

学校读者我要写书评

暂无评论

Maximizing the spectral radius of fixed trace diagonal perturbations of nonnegative matrices

引用

Linear Algebra and Its Applications 1996年 241-243卷 635-654页

作者： Johnson, Charles R. Loewy, Raphael Olesky, D.D. Van, Den Driessche, P. Department of Mathematics College of William and Mary Williamsburg VA 23187 United States Department of Mathematics Technion - Israel Inst. of Technol. 32000 Haifa Israel Department of Computer Science University of Victoria Victoria BC V8W 3P6 Canada Dept. of Mathematics and Statistics University of Victoria Victoria BC V8W 3P4 Canada

Let A be an n-by-n irreducible, entrywise nonnegative matrix. For a given t > 0, we consider the problem of maximizing the Perron root of a nonnegative, diagonal, trace t perturbation of A. Because of the convexity of the Perron root as a function of diagonal entries, the maximum occurs for some tEii, Such an index i, which is called a winner, may depend on t. We show how to determine the (nonempty) set of indices i that are winners for all sufficiently small t and the possibly different (nonempty) set of indices that are winners for all sufficiently large t. We also show how to determine if there are indices that are winners for all t.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Global optimal control of redundant robot

引用

ROBOTICA 1996年第pt 2期14卷 131-140页

作者： Gotlih, K Troch, I Jezernik, K [a1 ]University of Maribor Faculty of Mechanical Engineering Smetanova 17 SI-62000 Maribor (Slovenia).[a2 ]Technical University Vienna Inst. f. Technical Mathematics Wiedner Haupstrasse 8-10/114 A-1040 Vienna (Austria).[a3 ]University of Maribor Faculty of Electrical Engineering and Computer Science Smetanova 17 SI-62000 Maribor (Slovenia).

A global optimal control algorithm was developed with the aim of finding a control which satisfies some special requirements in the sense of obtaining singular position free movement of the redundant robot mechanism. The solution of the developed global optimal control algorithm is a boundary value problem. The additional constraints in the boundary value problem were constructed with the use of an optimization process. The usefulness of the developed global optimal control algorithm is demonstrated by the example of the 3 DOFs planar redundant robot mechanism of SCARA type.

关键词： optimal control redundant robot boundary problem algorithm

来源：评论

学校读者我要写书评

暂无评论

Iterations of paracontractions and firmly nonexpansive operators with applications to feasibility and optimization

引用

Optimization 1996年第4期37卷 323-339页

作者： Censor, Y. Reich, S. Dept. of Math. and Computer Science University of Haifa Mt. Carmel 31905 Haifa Israel Department of Mathematics Technion-Israel Inst. of Technology 32000 Haifa Israel

A generalized "measure of distance" defined by Df(x, y): = f(x) - f(y) - 〈∇f(y), x - y〉, is generated from any member f of the class of Bregman functions. Although it is not, technically speaking, a distan... 详细信息

A generalized "measure of distance" defined by D_f(x, y): = f(x) - f(y) - 〈∇f(y), x - y〉, is generated from any member f of the class of Bregman functions. Although it is not, technically speaking, a distance function, it has been used in the past to define and study projection operators. In this paper we give new definitions of paracontractions, convex combinations, and firmly nonexpansive operators, based on D_f(x, y), and study sequential and simultaneous iterative algorithms employing them for the solution of the problem of finding a common asymptotic fixed point of a family of operators. Applications to the convex feasibility problem, to optimization and to monotone operator theory are also included.

关键词： Asymptotic fixed point Bregman function Firmly nonexpansive Generalized distance Paracontractions Projection Repetitive control

来源：评论

学校读者我要写书评

暂无评论

Splitters and near-optimal derandomization

Splitters and near-optimal derandomization

引用

Annual IEEE Symposium on Foundations of computer science

作者： M. Naor L.J. Schulman A. Srinivasan Department of Applied Mathematics and Computer Science Weizmann Institute of Science Israel Department of Apllied Mathematics and Computer Science Weizmann Institute of Science Israel Georgia Inst. Technology College of Computing Georgia Institute of Technology Atlanta GA USA Department of Information Systems & Computer Science National University of Singapore Singapore

We present a fairly general method for finding deterministic constructions obeying what we call k-restrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n,k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2/sup k/ configurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very efficient derandomization of algorithms in learning, of fixed-subgraph finding algorithms, and of near optimal /spl Sigma/II/spl Sigma/ threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits.

关键词： computer science Circuit testing mathematics Protocols Engineering profession Information systems Contracts Educational inst.tutions Boosting Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Randomized single-target hot-potato routing

Randomized single-target hot-potato routing

引用

Israel Symposium on the Theory of Computing and Systems

作者： I.B. Aroya I. Newman A. Schuster Dept. of Comput. Sci. Technion-Israel Inst. of Technol. Haifa Israel Department of Mathematics and Computer Science Haifa University Haifa Israel Computer Science Department Technion-Israel Institute of Technology Haifa Israel

We present randomized hot-potato routing algorithms on d-dimensional meshes and on the n-dimensional hypercube. The algorithms are designed for routing many packets to a single destination, or a relatively small number of destinations. The important feature, which was not obtained previously, is that the algorithms utilize the higher in-degree of the nodes and are asymptotically optimal.< >

关键词： Routing Hypercubes Algorithm design and analysis Buffer storage Optical buffering High speed optical techniques Sorting Delay Parallel machines Communication networks

来源：评论

学校读者我要写书评

暂无评论

Taking it to the limit: on infinite variants of NP-complete problems

Taking it to the limit: on infinite variants of NP-complete ...

引用

Annual Conference on Structure in Complexity Theory

作者： T. Hirst D. Harel Department of Applied Mathematics & Computer Science Weizmann Institute of Science Rehovot Israel Dept. of Appl. Math. & Comput. Sci. Weizmann Inst. of Sci. Rehovot Israel

Infinite, recursive versions of NP optimization problems are defined. For example, MAX CLIQUE becomes the question of whether a recursive graph contains an infinite clique. The work was motivated by trying to understand what makes some NP problems highly undecidable in the infinite case, while others remain on low levels of the arithmetical hierarchy. Two results are proved; one enables using knowledge about the infinite case to yield implications to the finite case, and the other enables implications in the other direction. Taken together, the two results provide a method for proving (finitary) problems to be outside the syntactic class MAX NP, hence outside MAX SNP too. The technique is illustrated with many examples.< >

关键词： NP-complete problem Polynomials mathematics computer science Turing machines

来源：评论

学校读者我要写书评

暂无评论

Parallel construction of quadtrees and quality triangulations 3rd

Parallel construction of quadtrees and quality triangulation...

引用

3rd Workshop on Algorithms and Data Structures, WADS 1993

作者： Bern, Marshall Eppslein, David Teng, Skang-Hua Xerox Palo Alto Research Center 3333 Coyote Hill Rd Palo AltoCA94304 United States Department of Information and Computer Science University of California IrvineCA92717 United States Department of Mathematics Massachusetts Inst. of Technology CambridgeMA02139 United States

ISBN: (纸本)9783540571551

We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time O(log n) for point set input and O(log n log k) time for planar straight-line graphs, using O(n+k/log n) processors, where R measures input size and k output size. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

An inductive inference approach to classification 3rd

An inductive inference approach to classification

引用

3rd International Workshop on Analogical and Inductive Inference, AII 1992

作者： Freivalds, Rusins Hoffmann, Achim G. The University of Latvia Inst. of Mathematics & Comp. Science Raina boulevard 29 Riga226250 Latvia Technische Universität Berlin Department of Computer Science FR 5-11 Franklinstr. 28/29 Berlin 10D-1000 Germany

ISBN: (纸本)9783540560043

In this paper, we introduce a formal framework for investigating the relationship of inductive inference and the task of classification. We give the first results on the relationship between functions that can be identified in the limit and functions that can be acquired from unclassified objects only. Moreover, we present results on the complexity of classification functions and the preconditions necessary in order to allow the computation of such functions. © 1992, Springer Verlag. All rights reserved.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Processor-efficient parallel solution of linear systems. II. the positive characteristic and singular cases 33

Processor-efficient parallel solution of linear systems. II....

引用

33rd Annual Symposium on Foundations of computer science, FOCS 1992

作者： Kaltofen, Erich Pan, Victor Dept. of Comput. Sci. Rensselaer Polytech. Inst. TroyNY12180-3590 United States Department of Mathematics and Computer Science Lehman College City University of New York BronxNY10468 United States

ISBN: (纸本)0818629002

For pt.I see Proc. 3rd Ann. ACM Symp. Parallel Algms. Architecture, p. 180-91 (1991). The authors show that over any field, the solution set to a system of n linear equations in n unknowns can be computed in parallel with randomization simultaneously in poly-logarithmic time in n and with only as many processors as are utilized to multiply two n ∗ n matrices. A time unit represents an arithmetic operation in the field. For singular systems the parallel timings are asymptotically as fast as those for non-singular systems, due to the avoidance of binary search in the matrix rank problem, except when the field has small positive characteristic;in that case, binary search is avoided at a somewhat higher processor count measure. © 1992 IEEE.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：