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

EFFICIENT ALGORITHMS FOR OPTIMISTIC CRASH RECOVERY

DISTRIBUTED COMPUTING 1994年第2期8卷 105-114页

作者： VENKATESAN, S JUANG, TTY 1. Computer Science Program University of Texas at Dallas 75083-0688 Richardson TX USA

Recovery from transient processor failures can be achieved by using optimistic message logging and checkpointing. The faulty processors roll back, and some/all of the non-faulty processors also may have to roll back. This paper formulates the rollback problem as a closure problem. A centralized closure algorithm is presented together with two efficient distributed implementations. Several related problems are also considered and distributed algorithms are presented for solving them.

关键词： CRASH RECOVERY OPTIMISTIC MESSAGE LOGGING CHECKPOINTING ROLLBACK RECOVERY DISTRIBUTED ALGORITHM MESSAGE COMPLEXITY

来源：评论

学校读者我要写书评

暂无评论

BUNDLE-BASED DECOMPOSITION FOR LARGE-SCALE CONVEX-OPTIMIZATION - ERROR ESTIMATE AND APPLICATION TO BLOCK-ANGULAR LINEAR-programS

引用

MATHEMATICAL programMING 1994年第1期66卷 79-101页

作者： MEDHI, D 1. Computer Science Telecommunications Program University of Missouri-Kansas City 5100 Rockhill Road 64110 Kansas City Missouri USA

Robinson has proposed the bundle-based decomposition algorithm to solve a class of structured large-scale convex optimization problems. In this method, the original problem is transformed (by dualization) to an unconstrained nonsmooth concave optimization problem which is in turn solved by using a modified bundle method. In this paper, we give a posteriori error estimates on the approximate primal optimal solution and on the duality gap. We describe implementation and present computational experience with a special case of this class of problems, namely, block-angular linear programming problems. We observe that the method is efficient in obtaining the approximate optimal solution and compares favorably with MINOS and an advanced implementation of the Dantzig-Wolfe decomposition method.

关键词： LARGE-SCALE OPTIMIZATION NONSMOOTH OPTIMIZATION BUNDLE METHOD DECOMPOSITION BLOCK-ANGULAR LINEAR programMING

来源：评论

学校读者我要写书评

暂无评论

PARTIAL DEDUCTION OF LOGIC programS WRT WELL-FOUNDED SEMANTICS

引用

NEW GENERATION COMPUTING 1994年第1期13卷 45-74页

作者： ARAVINDAN, C DUNG, PM 1. Computer Science Program School of Advanced Technologies Asian Institute of Technology P. O. Box 2754 10501 Bangkok Thailand

In this paper, we extend the partial deduction framework of Lloyd and Shepherdson, so that unfolding of non-ground negative literals and loop checks can be carried out during partial deduction. We show that the unifie... 详细信息

关键词： PARTIAL DEDUCTION program TRANSFORMATION program SPECIALIZATION WELL-FOUNDED NEGATION

来源：评论

学校读者我要写书评

暂无评论

ON THE BENEFITS OF INTERRELATING computer-{1. AND THE HUMANITIES - THE CASE OF METAPHOR

引用

computerS AND THE HUMANITIES 1991年第5期25卷 289-295页

作者： KOCH, C 1. Computer Science Program Oberlin College 44074 Oberlin OH USA

If there is to be a new, substantive area of teaching and research that combines competence in specific areas of the humanities with computer {1. understandings and skills, such teaching and research needs to be led by persons who themselves are competent in both the humanities and in computer {1., rather than by a team of persons who represent a division' of labors along the lines of 'idea' persons and 'technical' persons. The new kind of teaching and research that might result is pointed to by describing a connectionist, neural network approach to the study of metaphor.

关键词： CONNECTIONISM NEURAL NETWORKS METAPHOR

来源：评论

学校读者我要写书评

暂无评论

RELEVANCE AS AN EXPLANATION OF COMMUNICATION

引用

LINGUISTICS AND PHILOSOPHY 1991年第4期14卷 453-472页

作者： ROBERTS, LD 1. Program in Philosophy and Computer and Systems Science Department of Philosophy State University of New York at Binghamton 13902-6000 Binghamton NY USA

来源：评论

学校读者我要写书评

暂无评论

THE COMPLEXITY OF RANKING SIMPLE LANGUAGES

引用

MATHEMATICAL SYSTEMS THEORY 1990年第1期23卷 1-19页

作者： HUYNH, DT 1. Computer Science Program University of Texas at Dallas 75083 Richardson TX USA

Ranking is the problem of computing for an input string its lexicographic index in a given (fixed) language. This paper concerns the complexity of ranking. We show that ranking languages accepted by 1.way unambiguous auxiliary pushdown automata operating in polynomial time is inNC (2). We also prove negative results about ranking for several classes of simple languages.C is rankable in deterministic polynomial time iffP=P #P , whereC is any of the following six classes of languages: (1. languages accepted by logtime-bounded nondeterministic Turing machines, (2) languages accepted by (uniform) families of unbounded fan-in circuits of constant depth and polynomial size, (3) languages accepted by 2-way deterministic pushdown automata, (4) languages accepted by multihead deterministic finite automata, (5) languages accepted by 1.way nondeterministic logspace-bounded Turing machines, and (6) finitely ambiguous linear context-free languages.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A NEW ALGORITHM FOR SCHEDULING PERIODIC, REAL-TIME TASKS

引用

ALGORITHMICA 1989年第2期4卷 209-219页

作者： LEUNG, JYT 1. Computer Science Program University of Texas at Dallas 75080 Richardson TX USA

We consider the problem of preemptively scheduling a set of periodic, real-time tasks on a multiprocessor computer system. We give a new scheduling algorithm, the so-called Slack-Time Algorithm, and show that it is more effective than the known Deadline Algorithm. We also give an (exponential-time) algorithm to decide if a task system is schedulable by the Slack-Time or the Deadline Algorithm. The same algorithm can also be used to decide if a task system is schedulable by any given fixed-priority scheduling algorithm. This resolves an open question posed by Leung and Whitehead. Finally, it is shown that the problem of deciding if a task system is schedulable by the Slack-Time, the Deadline, or any given fixed-priority scheduling algorithm is co-NP-hard for each fixedm≥.

关键词： Periodic Real-time tasks Multiprocessor system Schedulability co-NP-hard

来源：评论

学校读者我要写书评

暂无评论

SPACE BIOPROCESSING

引用

BIO-TECHNOLOGY 1985年第9期3卷 786-790页

作者： TODD, P Paul Todd Ph.D. Director of the Bioprocessing and Pharmaceutical Research Center University City Science Center 3401 Market Street Suite 220 Philadelphia PA 19104.REFERENCES Universities Space Research Association Microgravity Biotechnology Working Group "Goals in Microgravity Biotechnology". 1985. Unpublished.Allen R.E. Rhodes P.H. Snyder R.S. Barlow G.H. Bier M. Bigazzi P.E. van Oss C.J. Knox R.J. Seaman G.V.F. Micale F.J. and Vanderhoff J.W. 1977. Column electrophoresis on the Apollo-Soyuz Test Project. Sep. Purif. Meth. 6: 1-59.|ISI|Snyder R.S. Rhodes P.H. Herren B.J. Miller R.Y. Seaman G.V.F. Todd P. Kunze M.E. and Sarnoff B.E. 1985. Analysis of free zone electrophoresis of fixed erythrocytes performed in microgravity. Electrophoresis 6: 3-9.|ISI|Tulp A. 1984. Density gradient electrophoresis of mammalian cells. In Methods of Biochemical Analysis 30: 148-198.Strickler A. and Sacks T. 1973. Continuous free-film electrophoresis: The crescent phenomenon. Prep. Biochem. 3: 269-277.|PubMed|ISI|ChemPort|Morrison D.R. Barlow G.H. Cleveland C. Grindeland R. Hymer W.C. Kunze M.E. Lanham J.W. Lewis M.L. Sarnoff B.E. Todd P. and Wilfinger W. 1984. Electrophoretic separation of kidney and pituitary cells on STS-8. Adv. Space Res. 4: 67-76.|Article|PubMed|ChemPort|Bier M. Palusinski O.A. Mosher R.A. and Saville D.A. 1983. Electrophoresis: Mathematical modeling and computer simulation. Science 219: 1281-1287.|PubMed|ISI|ChemPort|Albertsson P.A. 1971. Partition of Cell Particles and Macromolecules. Wiley- Interscience New York.Brooks D.E. and Bamberger S. 1982. Studies on aqueous two phase polymer systems useful for partitioning of biological material p. 233-240. In Materials Processing in the Reduced Gravity Environment of Space. G. E. Rindone (ed.) Elsevier Science Publ. Co. Inc. New York.Juarez-Salinas H. Engelhorn S.C. Bigbee W.L. Lowry M.A. and Stanker L.H. 1984. Ultrapurification of monoclonal antibodies by high-performanc

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：