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

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

来源：评论

学校读者我要写书评

暂无评论

RSN1-tt (NP) distinguishes robust many-one and Turing completeness 3rd

引用

3rd Italian Conference on Algorithms and Complexity, CIAC 1997

作者： Hemaspaandra, Edith Hemaspaandra, Lane A. Hempel, Harald Department of Mathematics Le Moyne College SyracuseNY13214 United States Department of Computer Science University of Rochester RochesterNY14627 United States Inst. für Informatik Friedrich-Schiller-Universität Jena Jena07743 Germany

ISBN: (纸本)3540625925

Do complexity classes have many-one complete sets if and only if they have Turing-complete sets? We prove that there is a relativized world in which a relatively natural complexity class—namely a downward closure of NP, RSN1-tt (NP)—has Turing-complete sets but has no many-one complete sets. In fact, we show that in the same relativized world this class has 2-truth-table complete sets but lacks 1-truth-table complete sets. As part of the groundwork for our result, we prove that RSN1-tt (NP) has many equivalent forms having to do with ordered and parallel access to NP and NP ∩ coNP. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A downward translation in the polynomial hierarchy 14th

引用

14th Annual Symposium on Theoretical Aspects of computer science, STACS 1997

ISBN: (纸本)9783540626169

Downward translation (a.k.a. upward separation) refers to cases where the equality of two larger classes implies the equality of two smaller classes. We provide the first unqualified downward translation result completely within the polynomial hierarchy. In particular, we prove that, for k>2, where the "[1]" (respectively, "[2]") denotes that at most one query is (respectively, two queries are) allowed. We also extend this to obtain a more general downward translation result. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Modeling human visual object recognition

Modeling human visual object recognition

引用

International Joint Conference on Neural Networks (IJCNN)

作者： S. Edelman H.H. Bulthoff Department of Applied Mathematics and Computer Science Weizmann Institute of Science Rehovot Israel Dept. of Appl. Math. & Comput. Sci. Weizmann Inst. of Sci. Rehovot Israel

The topics discussed here are network models of object recognition; a computational theory of recognition; psychophysical support for a view-interpolation model: and an open issue, features of recognition. The authors survey a successful replication of central characteristics of performance in 3-D object recognition by a computational model based on interpolation among a number of stored views of each object. Network models of 3-D object recognition based on interpolation among specific stored views behave in several respects similarly to human observers in a number of recognition tasks. Even closer replication of human performance in recognition should be expected, once the issue of the features used to represent object views is resolved.< >

关键词： Humans Object recognition Image recognition computer networks Biology computing mathematics computer science Mathematical model Interpolation Image resolution

来源：评论

学校读者我要写书评

暂无评论

Query order in the polynomial hierarchy 11th

引用

11th International Symposium on Fundamentals of Computation Theory, FCT 1997

作者： Hemaspaandra, Edith Hemaspaandra, Lane A. Hempel, Harald Department of Mathematics Le Moyne College SyracuseNY13214 United States Department of Computer Science University of Rochester RochesterNY14627 United States Inst. für Informatik Eriedrich-Schiller-Universität Jena Jena07743 Germany

ISBN: (纸本)3540633863

The study of query order was initiated by Hemaspaandra, Hempel, and Wechsung [HHW]. Their goal was to learn whether the order of access to information sources affects the class of problems that can be solved. They showed that in the boolean hierarchy over NP, order matters. In the present paper, we study the power of query order when accessing levels of the polynomial hierarchy, and we show that here order does not matter. In particular, let PC:D denote the class of languages computable by a polynomial-time machine that is allowed one query to C followed by one query to V [HHW]. We prove that the levels of the polynomial hierarchy are order-oblivious: PΣpj:Σpk=PΣpj:Σpj. Yet, we also show that these ordered query classes form new levels in the polynomial hierarchy unless the polynomial hierarchy collapses. We prove that a wide range of other classes (UP, BPP, ⊕P, PP, etc.) inherit all order-obliviousness results that hold for deterministic polynomialtime transducers. © Springer-Verlag Berlin Heidelberg 1997.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Visualization of processes in self-learning systems

Visualization of processes in self-learning systems

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Gabriele Peters Kerstin Bunte Marc Strickert Michael Biehl Thomas Villmann Human-Computer Interaction FernUniversität in Hagen Germany CITEC-Cognitive Interaction Technology Center of Excellence Bielefeld University Germany Department of Computer Science and Mathematics University of Marburg Germany Johann Bernoulli Inst. for Mathematics & Computer Science University of Groningen The Netherlands Computational Intelligence Group University of Applied Sciences Mittweida Germany

One aspect of self-organizing systems is their desired ability to be self-learning, i.e., to be able to adapt dynamically to conditions in their environment. This quality is awkward especially if it comes to applications in security or safety-sensitive areas. Here a step towards more trustful systems could be taken by providing transparency of the processes of a system. An important means of giving feedback to an operator is the visualization of the internal processes of a system. In this position paper we address the problem of visualizing dynamic processes especially in self-learning systems. We take an existing self-learning system from the field of computer vision as an example from which we derive questions of general interest such as possible options to visualize the flow of information in a dynamic learning system or the visualization of symbolic data. As a side effect the visualization of learning processes may provide a better understanding of underlying principles of learning in general, i.e, also in biological systems. That may also facilitate improved designs of future self-learning systems.

关键词： Visualization Data visualization Learning systems Shape Electronic mail Machine learning Security

来源：评论

学校读者我要写书评

暂无评论

XP/Agile education and training

XP/Agile education and training

引用

6th International Conference on Extreme Programming and Agile Processes in Software Engineering

作者： Martin, A Fraser, S Davies, R Holcombe, M Mugridge, R Pierce, D Poppendieck, T Succi, G Qualcomm's Learning Center Victoria University of Wellington New Zealand Agile Experience Ltd. Department of Computer Science University of Sheffield United Kingdom British Computer Society Inst. Math. and Its Applications United Kingdom Extreme Tuesday Club (XTC) Department of Tenure Free University of Bolzano Bozen Italy Center for Applied Software Engineering Italy

ISBN: (纸本)3540262776

XP/Agile education and training remains a challenge from the perspective of determining relevant content;identifying effective methods for delivery;and maintaining the focus and motivation of students. This panel brings together academic and industry professionals to share their perspectives and experiences. Anticipated points for discussion include: education/training delivery strategies, curriculum definition, certification challenges, marketing issues, collaboration strategies to engage industry sponsorship, value assessments for students and sponsoring organizations, and program success stories. This will be a highly interactive panel and the audience should come prepared to both ask and answer questions. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Education

来源：评论

学校读者我要写书评

暂无评论

WATER-FLOW AND BINDER MIGRATION DURING DRYING OF COATED PAPER

引用

DRYING TECHNOLOGY 1991年第4期9卷 1019-1049页

作者： FARKAS, I LAMPINEN, MJ OJALA, K University of Godollo Inst. for Mathematics and Computer Science Godollo H-2103 Hungary Helsinki University of Technology Dept. of Energy Engineering SF-02150 Espoo Otakaari 4 Finland

The aim of this study has been to develop a mathematical model for water flow and binder migration in coated paper. The model can be used for simulation of the stages starting after the coating applicator, including infrared and air drying sections. On the basis of the model the moisture, temperature and binder distribution can be determined across the paper thickness. Approximating equations concerning the paper properties are used in the model. We have measured the diffusion coefficient between the water and binder substances. Representative numerical examples are presented for separate and combined infrared and air drying processes.

关键词： DRYING COATING BINDER MIGRATION DIFFUSION

来源：评论

学校读者我要写书评

暂无评论

Resolution and path dissolution in multiple-valued logics 6th

Resolution and path dissolution in multiple-valued logics

引用

6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991

作者： Murray, Neil V. Rosenthal, Erik Inst. for Programming & Logics Dept. of Computer Science State Univ. of N.Y. at Albany AlbanyNY12222 United States Dept. of Mathematics University of New Haven 300 Orange Avenue West HavenCT06516 United States

ISBN: (纸本)9783540545637

Path dissolution is an inferencing mechanism for classical logic that efficiently generalizes the method of analytic tableaux. Two features that both methods enjoy are (in the propositional case) strong completeness and the ability to produce a list of essential models (satisfying interpretations) of a formula. The latter feature is particularly valuable in a setting in which one wishes to make use of satisfying interpretations rather than merely to determine whether any exist. In this paper we describe a method for employing dissolution as a deduction mechanism for a class of multiple-valued logics that we call the UNF logics. The basic idea is to keep track of the sign of the formula. Dissolution is shown to be a sound rule of inference as well as strongly complete in this setting. We also describe how the signing technique may be used to apply resolution to these logics;Robinson's semantic tree argument is adapted to prove completeness. © Springer-Verlag Berlin Heidelberg 1991.

关键词： Dissolution

来源：评论

学校读者我要写书评

暂无评论

Reflecting distributed knowledge in IT systems: a three layers concept

Reflecting distributed knowledge in IT systems: a three laye...

引用

International Workshop on Database and Expert Systems Applications

作者： M. Winimer R. Traunmuller Inst. for Comput. Sci. Linz Univ. Austria Institute of Applied Computer Science University of Linz Austria

Critics of present IT support systems reveal a lack of adequate comprehension of the application domain and its components and features at the systemic level. In particular, the distribution of knowledge, its change over time, and its redistribution induced by tools as a key factor have been under-rated up to now. So, after discussing IT support system deficiencies, we continue with a holistic view on, and a concept for, distributed knowledge, especially for information- and knowledge-rich organisations. The three layers of the concept comprise: knowledge types; the interaction between knowledge stakeholders; and knowledge representation. From there, we proceed to the acquisition of distributed knowledge and to issues on how to manage it.

关键词： Knowledge management Shape Humans computer science Application software Psychology Knowledge representation Power system management Hardware Cost function

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：