ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (6.688)
  • 2020-2022
  • 1990-1994
  • 1985-1989  (6.688)
  • 1950-1954
  • 1985  (6.688)
  • Informatik  (6.688)
Sammlung
Erscheinungszeitraum
  • 2020-2022
  • 1990-1994
  • 1985-1989  (6.688)
  • 1950-1954
Jahr
Zeitschrift
  • 1
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: To plan means reasoning about possible actions, but a robot must also reason about actual events. This paper proposes a formal theory about actual and possible events. It presents a new modal logic as a notation for this theory and a technique for planning in the modal logic using a first-order theorem prover augmented with simple modal reasoning. This avoids the need for a general modal-logic theorem prover. Adding beliefs to this theory raises an interesting problem for which the paper offers a tentative solution.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Several computational theories of early visual processing, such as Marr's zero-crossing theory, are biologically motivated and based largely on the well-known difference of Gaussians (DOG) receptive-field model of retinal processing. We examine the physiological relevance of the DOG, particularly in the light of evidence indicating significant spatiotemporal inseparability in the behaviour of retinal cell types. From the form of the inseparability we find that commonly accepted functional interpretations of retinal processing based on the DOG, such as the Laplacian of a Gaussian and zero crossings, are not valid for time-varying images. In contrast to current machine-vision approaches, which attempt to separate form and motion information at an early stage, it appears that this is not the case in biological systems. It is further shown that the qualitative form of this inseparability provides a convenient precursor to the extraction of both form and motion information. We show the construction of efficient mechanisms for the extraction of orientation and two-dimensional normal velocity through the use of a hierarchical computational framework. The resultant mechanisms are well localized in space-time and can be easily tuned to various degrees of orientation and speed specificity.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: This paper proposes a method of fault diagnosis of power systems based on a knowledge-based approach. It makes use of information on relays and circuit breakers. The feature of this method is that the relay sequence is represented by a logical circuit. In this circuit the following two relations are represented; a logical relation between inputs and output of a gate and a connective relation between logical gates. These two relations are expressed by production rules in the knowledge base. When the information from relays and circuit breakers is given to the logical circuit, faulty components are pointed out.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: While the idea of developing ‘true’ expert systems in the current microcomputer environment continues to be a subject of derision among serious AI researchers, undaunted developers and designers of microcomputer-based systems continue to make progress on the personal computer front. This article presents an overview of the current state of expert systems in a microcomputer environment and then offers some prognostications about the near-term future of expert systems on desktop and personal computers. It is suggested that the history of software developments on the small computers indicates that a pattern of growth exists. If this same pattern is applied to expert systems, the author contends, the near-term future of micro-based knowledge-based systems is at least forecastable if not predictable.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: Public accounting firms are beginning to use more sophisticated forms of decision support as competitive pressures rise and technological advances are made. One form of support is the microcomputer-based expert system. This paper describes the development of one such system to aid external auditors in estimating the dollar amount of their client's uncollectible accounts receivable. The resulting system is Auditor, which is based on the general inference engine, AL/X, developed by Michie. The details of the development process from initial interviews to validation are presented. Insights into the process of audit decision making and into the development of microcomputer-based expert system for auditing are discussed.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 11
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: The increasing popularity of expert systems has led to a demand to apply expert systems technology in a wide variety of computing environments. As a result, various efforts have been made to implement expert systems on microcomputers. This article reviews some of the ongoing work on tools for the development of microcomputer-based expert systems. Some specific application areas are noted, and a brief discussion of the advantages and disadvantages of implementing expert systems on microcomputers is presented.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 12
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 13
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 14
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: Preceptor is a shell system for building rule-based expert systems to support clinical decision-making. Its highly-structured knowledge base is designed to reflect the variety of decision-making activities in patient management. We describe Preceptor's knowledge base and dialogue structures, its inference strategies, and its comprehensive facilities for knowledge base creation and management. We report its application in a study of prognostic indices in stroke, and describe our approach to knowledge acquisition in this application.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 15
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 16
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 17
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 18
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: This paper describes the design and operation of an expert system used by the United States Environmental Protection Agency (EPA) to help screen Freedom of Information Act (FOIA) requests. The system is called the Expert Disclosure Analysis and Avoidance System (EDAAS). It assists public information specialists to determine which information concerning the manufacture and distribution of toxic chemicals may be released to the public without compromising other sensitive company data which EPA is legally obligated to protect from public disclosure.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 19
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 20
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 21
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 22
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 23
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 24
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 25
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 26
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: GTE's Compass (Central Office Maintenance Printout Analysis and Suggestion System) is an expert system that aids in the maintenance of a telephone switching system. It analyzes maintenance printouts of telephone company central office switching equipment and suggests maintenance actions to be performed. The results from several field trials indicate that the current version of Compass performs well in identifying system faults and in suggesting corresponding maintenance actions. An expanded version of the expert system is under development while the present version is being put into field use.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 27
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: This paper examines the emerging relationship between the US and Japan with respect to artificial intelligence and the significant trend towards US-Japan cooperative AI research and development. This trend is underscored by the increasing investment by both nations to develop massive fifth generation computer technology. The importance of the US and Japan's relationship is amplified by these two nations being the world's largest high technology producers and trading partners. One must fully appreciate the future course of events as the two nations open up new markets, estimated at tens of billions of dollars in AI hardware, software and related services by the 1990s. AI has greater implications for collaboration versus ruthless competition, than in other markets, due to the uniqueness of opportunity AI offers the US and Japan for mutual growth. AI will offer unique ways for the US and Japan to grow closer with greater understanding of two otherwise extremely different social and economic systems. This does not diminish the importance of other countries growing closer through AI in this way, but rather demonstrates the greatest example of cooperation with the greatest total economic rewards.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 28
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 29
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 30
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 31
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 32
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 33
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 34
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 35
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: An expert system embodies a humun expert's domain-specific knowledge and skill, acquired and refined over years of experience. A number of problems in diagnosis and engineering design can be solved by Using current expert-system techniques. This paper enumerates the main components of such problems and the steps that are taken in solving them. A few prototypical articificial intellegence systems embody techniques that can be applied to engineering problems. These are surveyed, and their relevance to components of design problems is discussed. Some expert systems in design domains are summarized, with emphasis on aspects that can illustrate wider applicability of the techniques. A number of avenues of further research are evident, and the area of engineering design offers rich opportunities for advancing the state-of-the-art in expert systems. An annotated selective bibliography is included
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 36
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: From the mid-1950's to the present the notion of a heuristic has played a crucial role in the AI researchers’ descriptions of their work. What has not been generally noticed is that different researchers have often applied the term to rather different aspects of their programs. Things that would be called a heuristic by one researcher would not be so called by others. This is because many heuristics embody a variety of different features, and the various researchers have emphasized different ones of these features as being essential to being a heuristic. This paper steps back from any particular research program and investigates the question of what things, historically, have been thought to be central to the notion of a heuristic and which ones conflict with others. After analyzing the previous definitions and examining current usage of the term, a synthesizing definition is provided. The hope is that with this broader account of ‘heuristic’ in hand, researchers can benefit more fully from the insights of others, even if those insights are couched in a somewhat alien vocabulary.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 37
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Schema labelling is a knowledge organization theory for recognition systems. In this theory, recognition constructs symbolic network descriptions of sensory data in terms of a stored knowledge base of schemas. A schema knowledge representation is formally specified. Each schema represents a class of objects by specifying class membership as a set of constraints on other classes. The constraints are based on two orthogonal relationships in knowledge organization: composition and specialization. Complex objects have internal structure which can be represented as composition constraints among their parts. Likewise, specialization constraints segment classes into subclasses by type. The description produced by schema labelling is a network consistency graph. The nodes of the graph are schema instances derived from the knowledge base. The domain for each instance is its finite set of subclasses and the network constraints are the constraints defined between schemas. Constraints are propagated in the network using an arc consistency algorithm mat has been adapted to schema representations. The constructed network description makes explicit the objects recognized in the data and their relationships. The graph is hierarchical, providing a description at multiple levels of detail. A hypothetical scene analysis system is used to illustrate the methodology.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 38
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: In a discourse the hearer must recognize the response intended by the speaker. To perform this recognition, the hearer must ascertain what plans the speaker is undertaking and how the utterances in the discourse further that plan. To do so, the hearer can parse the initial intentions (recoverable from the utterance) and recognize the plans the speaker has in mind and intends the hearer to know about. This paper reports on a theory of parsing the intentions in discourse. It also discusses the role of another aspect of discourse, discourse markers, that are valuable to intended response recognition.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 39
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: We focus on McCarthy's method of predicate circumscription in order to establish various results about its consistency, and about its ability to conjecture new information. A basic result is that predicate circumscription cannot account for the standard kinds of default reasoning. Another is that predicate circumscription yields no new information about the equality predicate. This has important consequences for the unique names and domain closure assumptions.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 40
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: In real-world domains (e.g., a mobile robot environment), things do not always proceed as planned, so it is important to develop better execution-monitoring techniques and replanning capabilities. This paper describes these capabilities in the SIPE (System for Interactive Planning and Execution Monitoring) planning system. The motivation behind SIPE is to place enough limitations on the representation so that planning can be done efficiently, while retaining sufficient power to still be useful. This work assumes that new information given to the execution monitor is in the form of predicates, thus avoiding the difficult problem of how to generate these predicates from information provided by sensors.The replanning module presented here takes advantage of the rich structure of SIPE plans and is intimately connected with the planner, which can be called as a subroutine. This allows the use of SIPE's capabilities to determine efficiently how unexpected events affect the plan being executed and, in many cases, to retain most of the original plan by making changes in it to avoid problems caused by these unexpected events. SIPE is also capable of shortening the original plan when serendipitous events occur. A general set of replanning actions is presented along with a general replanning capability that has been implemented by using these actions.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 41
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: The so-called “first generation” expert systems were rule-based and offered a successful framework for building applications systems for certain kinds of tasks. Spatial, temporal, and causal reasoning, knowledge abstractions, and structuring are among topics of research for “second generation” expert systems. It is proposed that one of the keys for such research is knowledge organization. Knowledge organization determines control structure design, explanation and evaluation capabilities for the resultant knowledge base, and has strong influence on system performance. We are exploring a framework for expert system design that focuses on knowledge organization, for a specific class of input data, namely, continuous, time-varying data (image sequences or other signal forms). Such data are rich in temporal relationships as well as temporal changes of spatial relations, and are thus a very appropriate testbed for studies involving spatio-temporal reasoning. In particular, the representation formalism specifies the semantics of the organization of knowledge classes along the relationships of generalization/specialization, decomposition/aggregation, temporal precedence, instantiation, and expectation-activated similarity. Á hypothesize-and-test control structure is driven by the class organizational principles, and includes several interacting dimensions of search (data-driven, model-driven, goal-driven temporal, and failure-driven search). The hypothesis ranking scheme is based on temporal cooperative computation, with hypothesis “fields of influence” being defined by the hypothesis’ organizational relationships. This control structure has proven to be robust enough to handle a variety of interpretation tasks for continuous temporal data. A particular incarnation, the ALVEN system, for left ventricular performance assessment from X-ray image sequences, will be summarized in this paper.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 42
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: The central problem in vision is to determine scene properties from image properties. This is difficult because the problem, formally posed, is underconstrained. Methods that infer scene properties from images make assumptions about how the world determines what we see. In remote sensing, some of these assumptions can be dealt with explicitly. Available scene knowledge, in the form of a digital terrain model and a ground cover map, is used to synthesize an image for a given date and time. The synthesis process assumes that the surface is a perfectly diffuse or “lambertian” reflector. A scene radiance equation is described based on simple models of direct solar irradiance, diffuse sky irradiance, and atmospheric path radiance. Parameters of the model are estimated from the real image. A statistical comparison of the real image and the synthetic image is used to judge how well the model represents the mapping from scene to image.The methods presented for image synthesis are similar to those used in computer graphics. The motivation, however, is different. In graphics, the goal is to produce an effective rendering of the scene for a human viewer. Here, the goal is to predict properties of real images. In vision, one must deal with a confounding of effects due to surface shape, surface material, illumination, shadows, and atmosphere. These effects often detract from, rather than enhance, the determination of invariant scene characteristics.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 43
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 44
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Axiom sets and their extensions are viewed as functions from the set of formulas in the language to a set of four truth values, t, f, u for undefined, and k for contradiction. Such functions form a lattice with “contains less information” as the partial order ?, and “combination of several sources of knowledge” as the least-upper-bound operation ⊔. Inference rules are expressed as binary relations between such functions. We show that the usual criterium on fixpoints, namely, to be minimal, does not apply correctly in the case of non-monotonic inference rules. A stronger concept, approachable fixpoints, is introduced and proven to be sufficient for the existence of a derivation of the fixpoint. In addition, the usefulness of our approach is demonstrated by concise proofs for some previously known results about normal default rules.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 45
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Constraint satisfaction problems can be solved by network consistency algorithms that eliminate local inconsistencies before constructing global solutions. We describe a new algorithm that is useful when the variable domains can be structured hierarchically into recursive subsets with common properties and common relationships to subsets of the domain values for related variables. The algorithm, HAC, uses a technique known as hierarchical arc consistency. Its performance is analyzed theoretically and the conditions under which it is an improvement are outlined. The use of HAC in a program for understanding sketch maps, Mapsee3, is briefly discussed and experimental results consistent with the theory are reported.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 46
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 1 (1985), S. 0 
    ISSN: 1467-8640
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: This paper describes a first attempt to base a paraphrase generation system upon Meľčuk and Žolkovskij's linguistic meaning-text (MT) model whose purpose is to establish correspondences between meanings, represented by networks, and (ideally) all synonymous texts having this meaning. The system described here contains a Prolog implementation of a small explanatory and combinatorial dictionary (the MT lexicon) and, using unification and backtracking, generates from a given network the sentences allowed by the dictionary and the lexical transformations of the model. The passage from a net to the final texts is done through a series of transformations of intermediary structures that closely correspond to MT utterance representations (semantic, deep-syntax, surface-syntax, and morphological representations). These are graphs and trees with labeled arcs. The Prolog unification (equality predicate) was extended to extract information from these representations and build new ones. The notion of utterance path, used by many authors, is replaced by that of covering by defining subnetworks.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 47
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 48
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 49
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 50
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 51
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: Knowledge elicitation from experts is a major problem in the development of expert system. This paper sunmarises some of the difficulties inherent in the process and suggests that in certain situations induction can help. The algorithm considered Quinlan's ID3, because this is used in abailable software.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 52
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 53
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: Direct dissemination of expert knowledge to agricultural producers through computer programs will increase product quality as well as the profit margin. The construction of an expert system, called POMME, to help farmers manage apple orchards is reported here. The system provides advice regarding specific pest management, treatment of winter injuries, drought control and general pesticide selection. A sample interaction is provided, and the knowledge structures employed in the construction of the system are explained. A model of the apple scab disease cycle is incorporated into POMME to give the system a more fundamental reasoning capability than available from typical rule-based systems.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 54
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 55
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 56
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 57
    Digitale Medien
    Digitale Medien
    Oxford, UK : Blackwell Publishing Ltd
    Expert systems 2 (1985), S. 0 
    ISSN: 1468-0394
    Quelle: Blackwell Publishing Journal Backfiles 1879-2005
    Thema: Informatik
    Notizen: Abstract: KARDIO-E is an expert system for the electrocardiographic diagnosis of heart arrhythmias. AT the present stage the system can be used as a helpful diagnostic tool in the routine assessment of ECG recordings in preventive or systematic examinations as, by cardiologist's estimation, its performance is equivalent to that of a specialist of internal medicine (non-cardiologist) highly skilled in the reading of ECG recordings. The system is also useful for instruction of electrocardiography in education of all medical profiles. This paper presents the ECG diagnosis problem, the automatic generation of the system's knowledge base and a detailed description of the system. Results of on assessment study are also presented.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 58
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 249-277 
    ISSN: 1436-4646
    Schlagwort(e): Minisum Locations ; Location-Allocation ; Network Location ; Dynamic Location
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract In this paper, we consider multiperiod minisum location problems on networks in which demands can occur continuously on links according to a uniform probability density function. In addition, demands may change dynamically over time periods and at most one facility can be located per time period. Two types of networks are considered in conjunction with three behavioral strategies. The first type of network discussed is a chain graph. A myopic strategy and long-range strategy for locatingp-facilities are considered, as is a discounted present worth strategy for locating two facilities. Although these problems are generally nonconvex, effective methods are developed to readily identify all local and global minima. This analysis forms the basis for similar problems on tree graphs. In particular, we construct algorithms for the 3-facility myopic problem and the 2-facility long-range and discounted cost problems on a tree graph. Extensions and suggestions for further research on problems involving more general networks are provided.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 59
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 366-370 
    ISSN: 1436-4646
    Schlagwort(e): Cores ; Dual Prices ; Linear Production Games
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract Consider a game in which resources may be combined to produce products of known values. For linear production processes, the game may be characterized by a family of linear programs. It is shown that appropriately defined market prices for the resources coincide with the set of optimal dual solutions to one of these linear programs. This result generalizes and unifies the known cases in game theory, in which the core of a game coincides with the set of dual optimal solutions to a corresponding master linear programming problem.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 60
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 61-67 
    ISSN: 1436-4646
    Schlagwort(e): Conjugate Gradient Methods ; Global Convergence
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract The paper examines a method of implementing an angle test for determining when to restart conjugate gradient methods in a steepest descent direction. The test is based on guaranteeing that the cosine of the angle between the search direction and the negative gradient is within a constant multiple of the cosine of the angle between the Fletcher-Reeves search direction and the negative gradient. This guarantees convergence, for the Fletcher-Reeves method is known to converge. Numerical results indicate little, if anything, is lost in efficiency, and indicate gains may well be possible for large problems.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 61
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 120-121 
    ISSN: 1436-4646
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 62
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 93-114 
    ISSN: 1436-4646
    Schlagwort(e): Nonlinear Optimization ; Pairwise Comparison ; Priority Theory ; Fuzzy Sets ; Triangular Membership Functions ; Performance Evaluation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract In this paper we extend the deterministic performance evaluation of nonlinear optimization methods: we carry out a pairwise comparison using fuzzy estimates of the performance ratios to obtain fuzzy final scores of the methods under consideration. The key instrument is the concept of fuzzy numbers with triangular membership functions. The algebraic operations on them are simple extensions of the operations on real numbers; they are exact in the parameters (lower, modal, and upper values), not necessarily exact in the shape of the membership function. We illustrate the fuzzy performance evaluation by the ranking and rating of five methods (geometric programming and four general methods) for solving geometric-programming problems, using the results of recent computational studies. Some general methods appear to be leading, an outcome which is not only due to their performance under subjective criteria like domain of applications and conceptual simplicity of use; they also score higher under more objective criteria like robustness and efficiency.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 63
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 139-145 
    ISSN: 1436-4646
    Schlagwort(e): Computational Complexity ; NP-Complete ; Linear Program ; Polyhedron ; Cell
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A nonempty closed convex polyhedronX can be represented either asX = {x: Ax ⩽b}, where (A, b) are given, in which caseX is called anH-cell, or in the formX = {x: x = Uλ + Vμ, Σλ j = 1,λ ⩾ 0,μ ⩾ 0}, where (U, V) are given, in which caseX is called aW-cell. This note discusses the computational complexity of certain set containment problems. The problems of determining if $$X \nsubseteq Y$$ , where (i)X is anH-cell andY is a closed solid ball, (ii)X is anH-cell andY is aW-cell, or (iii)X is a closed solid ball andY is aW-cell, are all shown to be NP-complete, essentially verifying a conjecture of Eaves and Freund. Furthermore, the problem of determining whether there exists an integer point in aW-cell is shown to be NP-complete, demonstrating that regardless of the representation ofX as anH-cell orW-cell, this integer containment problem is NP-complete.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 64
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 123-138 
    ISSN: 1436-4646
    Schlagwort(e): Set Packing ; Integer Programming ; Linear Programming ; Simplex Method
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract This paper considers the set packing problem max{wx: Ax ⩽ b, x ⩾ 0 and integral}, whereA is anm × n 0–1 matrix,w is a 1 ×n weight vector of real numbers andb is anm × 1 vector of ones. In equality form, its linear programming relaxation is max{wx: (x, y) ∈P(A)} whereP(A) = {(x, y):Ax +I m y =b, x⩾0,y⩾0}. Letx 1 be any feasible solution to the set packing problem that is not optimal and lety 1 =b − Ax 1; then (x 1,y 1) is an integral extreme point ofP(A). We show that there exists a sequence of simplex pivots from (x 1,y 1) to (x*,y*), wherex* is an optimal solution to the set packing problem andy* =b − Ax*, that satisfies the following properties. Each pivot column has positive reduced weight and each pivot element equals plus one. The number of pivots equals the number of components ofx* that are nonbasic in (x 1,y 1).
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 65
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 1-27 
    ISSN: 1436-4646
    Schlagwort(e): Traveling Salesman Problem ; Integer Polyhedron ; Facet ; Graph ; Series-Parallel Graph ; Steiner Tree ; Polynomial Algorithm
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract Given a graphG = (N, E) and a length functionl: E → ℝ, the Graphical Traveling Salesman Problem is that of finding a minimum length cycle goingat least once through each node ofG. This formulation has advantages over the traditional formulation where each node must be visited exactly once. We give some facet inducing inequalities of the convex hull of the solutions to that problem. In particular, the so-called comb inequalities of Grötschel and Padberg are generalized. Some related integer polyhedra are also investigated. Finally, an efficient algorithm is given whenG is a series-parallel graph.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 66
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 146-161 
    ISSN: 1436-4646
    Schlagwort(e): Infinite Linear Programming ; Ordered Fields ; Extreme Points ; Extreme Directions ; Opposite Sign Property ; Nonlinear Equations
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract This paper provides a characterization of extreme points and extreme directions of the subsets of the space of generalized finite sequences occurring as the constraint sets of semi-infinite or infinite linear programs. The main result is that these sets are generated by (possibly infinitely many) extreme points and extreme directions. All results are valid over arbitrary ordered fields.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 67
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 204-233 
    ISSN: 1436-4646
    Schlagwort(e): Linear Programming ; Simplex Methods ; Piecewise-Linear Programming ; Nondifferentiable Optimization
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract The simplex method for linear programming can be extended to permit the minimization of any convex separable piecewise-linear objective, subject to linear constraints. This three-part paper develops and analyzes a general, computationally practical simplex algorithm for piecewiselinear programming. Part I derives and justifies the essential steps of the algorithm, by extension from the simplex method for linear programming in bounded variables. The proof employs familiar finite-termination arguments and established piecewise-linear duality theory. Part II considers the relaxation of technical assumptions pertaining to finiteness, feasibility and nondegeneracy of piecewise-linear programs. Degeneracy is found to have broader consequences than in the linear case, and the standard techniques for prevention of cycling are extended accordingly. Part III analyzes the computational requirements of piecewise-linear programming. The direct approach embodied in the piecewise-linear simplex algorithm is shown to be inherently more efficient than indirect approaches that rely on transformation of piecewise-linear programs to equivalent linear programs. A concluding section surveys the many applications of piecewise-linear programming in linear programming,l 1 estimation, goal programming, interval programming, and nonlinear optimization.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 68
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 339-351 
    ISSN: 1436-4646
    Schlagwort(e): Variational Inequality ; Nondifferentiable Optimization ; Nonconvex Programming ; Network Optimization
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract The variational inequality problem in Euclidian space is formulated as a nonconvex, nondifferentiable optimization problem. We show that any stationary point is optimal, and we propose a solution algorithm that decreases the nondifferential objective monotonically. Application to the asymmetric traffic assignment problem is considered.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 69
    Digitale Medien
    Digitale Medien
    Springer
    Engineering with computers 1 (1985), S. 27-37 
    ISSN: 1435-5663
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Maschinenbau , Technik allgemein
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 70
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 32-40 
    ISSN: 1436-4646
    Schlagwort(e): Nonlinear Programming ; Complementarity ; Monotonicity ; Convexity ; Bounds
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract For a solvable monotone complementarity problem we show that each feasible point which is not a solution of the problem provides simple numerical bounds for some or all components of all solution vectors. Consequently for a solvable differentiable convex program each primal-dual feasible point which is not optimal provides simple bounds for some or all components of all primal-dual solution vectors. We also give an existence result and simple bounds for solutions of monotone compementarity problems satisfying a new, distributed constraint qualification. This result carries over to a simple existence and boundedness result for differentiable convex programs satisfying a similar constraint qualification.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 71
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 114-117 
    ISSN: 1436-4646
    Schlagwort(e): Traveling Salesman Problem ; Heuristics ; Approximation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A number of heuristics for the traveling salesman problem (TSP) rely on the assumption that the triangle inequality (TI) is satisfied. When TI does not hold, the paper proposes a transformation such that for the transformed problem the TI holds. Consequently, the bounds obtained for heuristics are valid with appropriate modification. Moreover, for a TSP satisfying TI the same transformation strengthens such bounds. The transformation essentially maps the problem into one that is minimal with respect to the property that TI holds. For the symmetric TSP the transformation is particularly simple. For an application of the transformation in the asymmetric case we need the dual solution of an assignment problem.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 72
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 1-10 
    ISSN: 1436-4646
    Schlagwort(e): Scaling ; Network Algorithms
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract Asymmetric scaling of a square matrixA ≠ 0 is a matrix of the formXAX −1 whereX is a nonnegative, nonsingular, diagonal matrix having the same dimension ofA. Anasymmetric scaling of a rectangular matrixB ≠ 0 is a matrix of the formXBY −1 whereX andY are nonnegative, nonsingular, diagonal matrices having appropriate dimensions. We consider two objectives in selecting a symmetric scaling of a given matrix. The first is to select a scalingA′ of a given matrixA such that the maximal absolute value of the elements ofA′ is lesser or equal that of any other corresponding scaling ofA. The second is to select a scalingB′ of a given matrixB such that the maximal absolute value of ratios of nonzero elements ofB′ is lesser or equal that of any other corresponding scaling ofB. We also consider the problem of finding an optimal asymmetric scaling under the maximal ratio criterion (the maximal element criterion is, of course, trivial in this case). We show that these problems can be converted to parametric network problems which can be solved by corresponding algorithms.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 73
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 69-89 
    ISSN: 1436-4646
    Schlagwort(e): Composite Functions ; Nonsmooth Optimization ; Structure Functionals ; Superlinear Convergence ; Second Order Convergence ; Strong Uniqueness ; Reduced Curvature ; 90 C 30
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract This paper considers local convergence and rate of convergence results for algorithms for minimizing the composite functionF(x)=f(x)+h(c(x)) wheref andc are smooth buth(c) may be nonsmooth. Local convergence at a second order rate is established for the generalized Gauss—Newton method whenh is convex and globally Lipschitz and the minimizer is strongly unique. Local convergence at a second order rate is established for a generalized Newton method when the minimizer satisfies nondegeneracy, strict complementarity and second order sufficiency conditions. Assuming the minimizer satisfies these conditions, necessary and sufficient conditions for a superlinear rate of convergence for curvature approximating methods are established. Necessary and sufficient conditions for a two-step superlinear rate of convergence are also established when only reduced curvature information is available. All these local convergence and rate of convergence results are directly applicable to nonlinearing programming problems.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 74
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 165-182 
    ISSN: 1436-4646
    Schlagwort(e): Mixed-Inter Programming ; Fixed Charge Problems ; Preprocessing of Mixed-Integer Programs
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract We consider large-scale mixed-integer programming problems containing fixed charge variables. In practice such problems are frequently approached by using commercial mathematical programming systems. Depending on the formulation, size and structure of the problem this approach may or may not be successful. We describe algorithms for preprocessing and optimization of such problems and discuss the design of an experimental software system based on MPSX/370. Numerical results for solving some large real life problems are also presented.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 75
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 199-223 
    ISSN: 1436-4646
    Schlagwort(e): Monotone Multifunction ; Separable Convex Programming ; Proximal Point Algorithm ; Decomposition Algorithm ; Resource Allocation ; Large-Scale Programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A primal–dual decomposition method is presented to solve the separable convex programming problem. Convergence to a solution and Lagrange multiplier vector occurs from an arbitrary starting point. The method is equivalent to the proximal point algorithm applied to a certain maximal monotone multifunction. In the nonseparable case, it specializes to a known method, the proximal method of multipliers. Conditions are provided which guarantee linear convergence.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 76
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 242-246 
    ISSN: 1436-4646
    Schlagwort(e): Nonlinear Programming ; Kuhn—Tucker Multipliers ; Constraint Qualifications ; Second Order Conditions
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract Recently Fujiwara, Han and Mangasarian introduced a new constraint qualification which is a slight tightening of the well-known Mangasarian—Fromovitz constraint qualification. We show that this new qualification is a necessary and sufficient condition for the uniqueness of Kuhn—Tucker multipliers. We also show that it implies the satisfaction of second order necessary optimality conditions at a local minimum.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 77
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 33 (1985), S. 68-81 
    ISSN: 1436-4646
    Schlagwort(e): Unconstrained Optimization ; Parallel Computers ; Parallel Processing
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract We classify Straeter's ideas for parallel unconstrained optimization and apply them to Huang's class of updating formulas. Straeter's rank-one updating formula appears to be the only parallel extension within Huang's class with the property of quadratic termination. We also develop a parallel extension of Broyden's (1965) rank-one updating formula and prove quadratic termination. Finally, we present numerical results, obtained by testing the algorithms on several standard example problems.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 78
    Digitale Medien
    Digitale Medien
    Springer
    Computing 34 (1985), S. 41-61 
    ISSN: 1436-5057
    Schlagwort(e): 41A05 ; 41A20 ; 41A63 ; Multivariate functions ; rational interpolation ; branched continued fractions ; multivariate Padé approximants ; recursive calculation of interpolants ; multivariate inverse differences
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Das multivariate polynomiale Interpolationsproblem sowie die multivariate Padé-Approximation sind schon einige Jahre alt, aber das multivariate rationale Interpolationsproblem ist noch verhältnismäßig jung [3,8]. Für univariate Funktionen gibt es verschiedene äquivalente Algorithmen zur Berechnung vom rationalen Interpolant: die Lösung eines Gleichungssystems, die rekursive Berechnung oder die Berechnung eines Kettenbruchs. Diese Algorithmen werden hier verallgemeinert auf multivariate Funktionen. Wir bemerken, daß sie nun nicht mehr equivalent sind. Diese Beobachtung ist auch schon von anderen Mathematikern gemacht worden für das multivariate Padé-Approximationsproblem [2,7], das man auch auf verschiedene Weisen lösen kann.
    Notizen: Abstract Many papers have already been published on the subject of multivariate polynomial interpolation and also on the subject of multivariate Padé approximation. But the problem of multivariate rational interpolation has only very recently been considered; we refer among others to [8] and [3]. The computation of a univariate rational interpolant can be done in various equivalent ways: one can calculate the explicit solution of the system of interpolatory conditions, or start a recursive algorithm, or calculate the convergent of a continued fraction. In this paper we will generalize each of those methods from the univariate to the multivariate case. Although the generalization is simple, the equivalence of the computational methods is completely lost in the multivariate case. This was to be expected since various authors have already remarked [2,7] that there is no link between multivariate Padé approximants calculated by matching the Taylor series and those obtained as convergents of a continued fraction.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 79
    Digitale Medien
    Digitale Medien
    Springer
    Computing 34 (1985), S. 63-72 
    ISSN: 1436-5057
    Schlagwort(e): Primary: 65H10, 65K05 ; Secondary: 65F20 ; Nonlinear least-squares problems ; rankdeficient Jacobians ; Gauss-Newton method ; local convergence
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Gegenstand der Arbeit ist die Lösung nichtlinearer Quadratmittelproblemeg(x):=1/2F(x) T F(x)→Min!,F:ℝ n ℝ m ,m≧n, für die die Jacobi-MatrixF′(x*) in einem Lösungspunktx * rangdefizient ist. Es wird ein HilfsquadratmittelproblemG(u)→Min!,u≔(x,d) T, höherer Dimension konstruiert, von dem Gutartigkeit gezeigt werden kann, falls die Rangdefizienzr vonF′(x*) klein ist. Überdies wird bewiesen, daß für beliebigesr im konsistenten Fallg(x*)=0 die Gauss-Newton-Folge {x k} mindestensQ-linear gegenx * konvergiert.
    Notizen: Abstract This paper is concerned with solving nonlinear least-squares problemsg(x):=1/2F(x) T F(x)→Min!,F:ℝ n ℝ m ,m≧n having at a solution pointx * the rankdeficient JacobianF′(x*). An auxiliary least-squares problemG(u)→Min!,u≔(x, d) T of higher dimension is constructed which can be shown to be a well-posed one if the rank deficiencyr ofF′(x*) is small. Moreover, it is proved that for arbitraryr in the consistent caseg(x*)=0 the Gauss-Newton sequence {x k} converges at leastQ-linearly tox *.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 80
    Digitale Medien
    Digitale Medien
    Springer
    Computing 34 (1985), S. 81-85 
    ISSN: 1436-5057
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Wir verallgemeinern das “free steering theorem” im Ostrowski, das hinreichende Konvergenzbedingungen für lineare SOR-Verfahren mit variablen Relaxationsparametern angibt, auf nichtlineare Probleme.
    Notizen: Abstract We derive here a generalization to nonlinear problems of the “free steering theorem” of Ostrowski on sufficient conditions for convergence of linear SOR with varying relaxation parameters.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 81
    Digitale Medien
    Digitale Medien
    Springer
    Computing 34 (1985), S. 87-89 
    ISSN: 1436-5057
    Schlagwort(e): 65D15 ; 65G10 ; p-th roots ; interval arithmetic estimates
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Es wird eine einfache Methode angegeben, die quadratische von oben und von unter gegen α1/p strebende Folgen erzeugt.
    Notizen: Abstract A simple method is exhibited for obtaining sequences which tend quadratically to α1/p from above and below.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 82
    Digitale Medien
    Digitale Medien
    Springer
    Computing 34 (1985), S. 155-168 
    ISSN: 1436-5057
    Schlagwort(e): 65 H 10 ; 65 M 20 ; CR: 5.15 ; 5.17
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Die Poisson-Gleichung mit nichtlinearen Randbedingungen wird mittels der Linienmethode diskretisiert und ergibt ein System von gewöhnlichen Differentialgleichungen zweiter Ordnung mit Randbedingungen. Durch invariante Einbettung für jedes eindimensionale Problem wird dieses System in ein Fixpunktproblem verwandelt, auf das dann die asynchronen Algorithmen angewandt werden.
    Notizen: Abstract Poisson's equation with nonlinear boundary conditions is discretized with the method of lines to obtain a system of second order differential equations with multi-point boundary conditions. This differential system is converted, using invariant imbedding for each one-dimensional problem, into a fixed point problem and then the asynchronous algorithms are applied.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 83
    Digitale Medien
    Digitale Medien
    Springer
    Computing 34 (1985), S. 131-154 
    ISSN: 1436-5057
    Schlagwort(e): 65N 15 ; 34 B 15 ; Algorithm for a priori bounds ; boundary value problems with arbitrary many solutions
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Es werden nichtlineare gewöhnliche Randwertaufgaben zweiter Ordnung mit beliebig vielen LösungenuεC 2[a, b] behandelt. In dieser Arbeit wird ein Algorithmus zur Berechnung von a priori Schranken $$\bar u,\bar d \in C[a,b]$$ eingeführt. Für die Schranken $$\bar u$$ und % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGabmizayaara% aaaa!36EE!\[\bar d\] werden die folgenden Eigenschaften garantiert. 1. Für jede Lösungu des behandelten nichtlinearen Problems gelten $$\bar u(x) \leqslant u(x) \leqslant \bar u(x), - \bar d(x) \leqslant u'(x) \leqslant \bar d(x)$$ für jedesxε[a, b]. 2. Die Schranken $$\bar u$$ und % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGabmizayaara% aaaa!36EE!\[\bar d\] werden mit Hilfe der Funktionen exp, sin und cos definiert. 3. Die Schranken $$\bar u$$ und % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGabmizayaara% aaaa!36EE!\[\bar d\] werden ohne Kenntnis von Lösungen und der Zahl der Lösungen berechnet.
    Notizen: Abstract We consider nonlinear boundary value problems with arbitrarily many solutionsuεC 2 [a, b]. In this paper an Algorithm will be established for a priori bounds $$\bar u,\bar d \in C[a,b]$$ with the following properties: 1. For every solutionu of the nonlinear problem we obtain $$\bar u(x) \leqslant u(x) \leqslant \bar u(x), - \bar d(x) \leqslant u'(x) \leqslant \bar d(x)$$ for any,xε[a, b]. 2. The bounds $$\bar u$$ and % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaGabmizayaara% aaaa!36EE!\[\bar d\] are defined by the use of the functions exp, sin and cos. 3. We use neither the knowledge of solutions nor the number of solutions.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 84
    Digitale Medien
    Digitale Medien
    Springer
    Computing 34 (1985), S. 169-177 
    ISSN: 1436-5057
    Schlagwort(e): 65 D 30 ; Numerical integration ; minimal formulae
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Minimale Quadraturformeln für die HilberträumeH 2 R undL 2 R werden untersucht. Diese Räume enthalten die Funktionen, die analytisch sind in der offenen Kreisscheibe mit RadiusR und Zentrum im Ursprung der komplexen Ebene; die Skalarprodukte sind als Rand- bzw. Flächenintegrale definiert. Solche Formeln kann man interpolatorisch interpretieren, indem man den Markoffschen Zugang zu Gaußschen Formeln in zweierlei Hinsicht verallgemeinert. Dies geschieht für beide Räume simultan, man benutzt denselben Interpolationsoperator. Dieser Zugang bietet den Vorteil, daß man ein System nichtlinearer Gleichungen allein für die Stützstellen minimaler Formeln erhält, im Gegensatz zu dem gekoppelten System für Stützstellen und Gewichte, das sich aus den Minimalitätsbedingungen ergibt. Das entkoppelte System kann numerisch gelöst werden, die entstehenden Formeln sind sehr gut geeignet zur Integration von Funktionen mit Randsingularitäten.
    Notizen: Abstract We consider minimal quadrature formulae for the Hilbert spacesH 2 R andL 2 R consisting of functions which are analytical on the open disc with radiusR and centre at the origin; the inner products are the boundary contour integral forH 2 R and the area integral over the disc forL 2 R . Such formulae can be viewed as interpolatory, generalizing—in two ways—Markoff's idea to construct the classical Gaussian quadratur formulae. This can be done simultaneously for both spaces using the same Hermitian interpolating operator. The advantage of this approach to minimal formulae is that we get a nonlinear system of equations for the nodes of the minimal formulae alone, in contrast to the coupled system for nodes and weights which arises from the minimality conditions. The uncoupled system that we obtain is numerically solvable for reasonable numbers of nodes and numerical tests show that the resulting minimal formulae are very well suited for the integration of functions with boundary singularities.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 85
    Digitale Medien
    Digitale Medien
    Springer
    Computing 34 (1985), S. 179-190 
    ISSN: 1436-5057
    Schlagwort(e): 65 L 05 ; Doubling ; Richardson extrapolation ; error estimates
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Schrittverdopplung, oder Richardson-Extrapolation, ist ein allgemeines Prinzip zur Schätzung des lokalen Fehlers eines Einschrittverfahrens zur numerischen Lösung eines Anfangswertproblems für Systeme gewöhnlicher Differentialgleichungen. Es werden einige Beiträge zur Theorie dieses Vorgehens gemacht. Die Prinzipien zum Vergleich expliziter Runge-Kutta-Formeln werden betrachtet und durch eine ausgewogene Bewertung des Verdoppelns bei Formeln vierter Ordnung illustriert. Einige scheinbar widersprüchliche Vergleiche aus der Literatur werden aufgeklärt.
    Notizen: Abstract Doubling, or Richardson extrapolation, is a general principle for the estimation of the local error made by a one-step method for the numerical solution of the initial value problem for a system of ordinary differential equations. Some contributions are made to the theory of doubling. Principles of comparing explicit Runge-Kutta formulas are reviewed and illustrated in a balanced appraisal of doubling in the context of fourth order formulas. Some apparently contradictory comparisons in the literature are explained.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 86
    Digitale Medien
    Digitale Medien
    Springer
    Computing 34 (1985), S. 261-263 
    ISSN: 1436-5057
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Eine zentrische Form kleiner Komplexität für rationale Funktionen wird definiert. Einige numerische Beispiele werden angegeben.
    Notizen: Abstract A centered form of very low complexity is defined for rational functions. Some numerical examples are calculated.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 87
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 153-175 
    ISSN: 1436-5057
    Schlagwort(e): 65B99 ; Algorithmic performance ; accelerating algorithms ; accelerating convergence ; fully accurate inner product
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Ein erweiterter Satz in Gleitkomma-Operationen, der das genaue innere Produkt enthält, bürgt bei der routinemäßigen Verwendung in einigen klassischen iterativen numerischen Algorithmen Vorteile. Diese bestehen darin, daß zur Erreichung von algorithmischen Konvergenzkriterien weniger Iterationen notwendig sind bzw. für eine vorgegebene Anzahl von Iterationen eine höhere Genauigkeit erreicht wird. Nicht alle Algorithmen werden verbessert; günstige Ergebnisse wurden für den QR-Algorithmus, für den CG-Algorithmus und für die Bestimmung einer trennenden Hyperebene erzielt.
    Notizen: Abstract An augmented set of floating-point arithmetic operations which includes the accurate inner product can be routinely employed with benefit in some standard iterative numerical algorithms. Benefits include the requirement of fewer iterations for achieving computational convergence criteria and more accurate results for a given number of iterations. Not all algorithms are benefited, but favorable results have been obtained for the QR algorithm, the conjugate gradient algorithm and the separating hyperplane algorithm.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 88
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 185-188 
    ISSN: 1436-5057
    Schlagwort(e): 65G10 ; 65F30 ; Interval methods ; iteration methods
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Abstract We consider a modified method of [1] for the improvement of an inclusion of the inverse of a matrix. It is shown that this modification is more efficient than the original method.
    Notizen: Zusammenfassung Wir betrachten eine Modifikation eines Verfahrens aus [1] zur iterativen Verbesserung der Einschließung für die Inverse einer Matrix. Für diese Modifikation läßt sich zeigen, daß sie effizienter ist als das ursprüngliche Verfahren.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 89
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 177-184 
    ISSN: 1436-5057
    Schlagwort(e): 65G10 ; Interval arithmetic ; range of values
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Für den Fall, daßf eine Darstellung der Formf(x)=f(c)+(x-c) n h(x), xεX, besitzt, geben wir eine intervallmäßige Auswertung an, die den Wertebereich über dem kompakten IntervalX mit der Ordnungn+1 approximiert. Fürn=1 erhält man die bekannten Aussagen über die zentrierte Form.
    Notizen: Abstract If the real-valued mappingf has a representation of the formf(x)=f(c)+(x-c) n h(x), xεX, then we introduce an interval expression which approximates the range of values off over the compact intervalX with ordern+1. The well known centered form is the special casen=1 of this result.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 90
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 207-218 
    ISSN: 1436-5057
    Schlagwort(e): 65H ; Including iterations ; eigenproblem ; interval analysis
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung In dieser Arbeit wird eine allgemeine systematische Methode für die Berechnung von Nullstellen nichtlinearer Polynomgleichungen diskutiert. Das allgemeine Eigenwertproblem ist ein besonderer Schwerpunkt. Die Methode basiert auf der expliziten. Darstellung des Steigerungsoperators. Diese Darstellung ist auf die Aufspaltung von polynomen in mehrere Variablen begründet.
    Notizen: Abstract We discuss a general approach to the computation of the zeros of non-linear polynomial equations with particular emphasis on the lambda matrix eigenproblem. The approach is based on the explicit representation of the (non-unique) slope operator. This operator is then used to generate including iterations for the zeros. The underlying idea is that of the splitting of a multi-variate polynomial.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 91
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 189-206 
    ISSN: 1436-5057
    Schlagwort(e): 65F10 ; 65G10 ; Interval arithmetic ; linear systems of equations ; iterative solution methods ; incompleteLU-decompositions ; comparison theorems
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Vorgestellt wird eine Klasse von Iterationsverfahren zur Einschließung der Lösungsmenge durch einen Intervallvektor; dabei ist einen×n Intervall-H-Matrix und ein Intervallvektor. Der betrachtete Algorithmus verallgemeinert ein Iterationsverfahren von Meijerink/van der Vorst, das auf einer unvollständigenLU-Zerlegung einerM-MatrixA basiert. Es werden Aussagen über die Durchführbarkeit des Algorithmus, seiner Konvergenzgeschwindigkeit und seiner Einschließungsgüte gemacht. Da das ursprüngliche Verfahren von Meijerink/van der Vorst ein Spezialfall des vorliegenden Algorithmus ist, erhält man damit gleichzeitig seine Durchführbarkeit in der größeren Klasse derH-Matrizen. Als weitere Anwendung auf reelle Matrizen erhält man einen Zusammenhang zwischen demR 1-Faktor (Ortega/Rheinboldt [9]) des ursprünglichen Verfahrens und der zugrundeliegenden IndexmengeP.
    Notizen: Abstract We present a class of iterative methods to enclose the solution set by an interval vector;A is varying in ann×n intervalH-Matrix andb is varying in an interval vector . The algorithm taken into consideration generalizes an iterative method of Meijerink/van der Vorst based on an incompleteLU-decomposition of anM-MatrixA. Theorems concerning the feasibility of the algorithm, its rate of convergence and its quality of enclosure are given. Since the original method of Meijerink/van der Vorst is a special case of our algorithm we have thus shown its applicability to the larger class ofH-matrices. Furthermore we relate theR 1-factor (as defined in Ortega/Rheinboldt [9]) of the original method to the underlying setP of indices.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 92
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 219-229 
    ISSN: 1436-5057
    Schlagwort(e): 65K05 ; 65D07 ; 90C20 ; 41A15 ; Existence conditions ; quadratic programming ; dual optimization problem ; tridiagonal Hessian ; Newton's method
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Das Problem, konvexe Interpolationssplines mit minimaler mittlerer Krümmung zu ermitteln, führt auf eine speziell strukturierte quadratische Optimierungsaufgabe. In der vorliegenden Note wird eine zugehörige duale Aufgabe aufgestellt, die ohne Nebenbedingungen auskommt, deren Zielfunktion stückweise quadratisch ist und die daher eine effektive numerische Behandlung erlaubt.
    Notizen: Abstract The problem of finding convex spline interpolants with minimal mean curvature leads to a quadratic optimization problem of special structure. In the present note a corresponding dual problem without constraints is derived. Its objective function is piecewise quadratic and therefore admits an effective numerical treatment.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 93
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 231-246 
    ISSN: 1436-5057
    Schlagwort(e): 51N20 ; 68-04 ; 68C05 ; 68C25 ; Visible surface algorithms ; computational geometry ; computer graphics ; computational complexity
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Das Visible-Surface-Problem besteht darin, die Teilpolygone einer 3-D-Szene aus beliebigen einfachen planaren Polygonen zu bestimmen, die von einem gegebenen Augenpunkt aus sichtbar sind. Der Algorithmus der hier vorgestellt wird, und der für umfangreiche Szenen ausgelegt ist, löst dieses Problem durch implizites Zerlegen bezüglich eines Zellrasters. Die Komplexitätsabschätzung führt zu Aussagen über die günstige Wahl des Gitters und zu der Charakterisierung von Szenenklassen, welche bei praktischen Anwendungen auftreten, und für die der Algorithmus ein lineares Zeit- und Speicherplatzverhalten zeigt.
    Notizen: Abstract The visible surface problem is to determine those subpolygons of a 3-D scence of arbitrary simple planar polygons which are visible from a given viewpoint. The algorithm which is presented here, and which is designed for complex scenes solves this problem by an implicit partitioning w.r.t. a raster of cells. The estimation of complexity leads to propositions on the favorable choice of the grid, and to the characterization of classes of scenes, which are relevant for practical applications, and for which the algorithm shows a linear time and space behavior.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 94
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 257-268 
    ISSN: 1436-5057
    Schlagwort(e): 05A05 ; Symbolic calculation ; structure and complexity analysis
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Es wird ein Algorithmus vorgeschlagen, der die Spur einer Potenz einer Tridiagonalmatrix berechnet. Er stützt sich auf Techniken, die aus der Strukturanalysis und der Kombinatorik stammen. Die Komplexität des Algorithmus wird analysiert, Verallgemeinerungen und mögliche Anwendungen werden diskutiert.
    Notizen: Abstract An algorithm symbolically calculating the trace of the power of a tridiagonal matrix is proposed. The setting is based on techniques developed from structure analysis and combinatorics. The complexity analysis, the extension and the possible applications of this algorithm are also discussed.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 95
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 247-256 
    ISSN: 1436-5057
    Schlagwort(e): 68N15 ; 68Q25 ; 68R10 ; Recursion ; Recursive procedures ; activation record ; runtime stack allocation ; dominator
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Ausgehend von einem entscheidbaren Rekursivitäts-Begriff von Prozeduren (oder Funktionen) in Algol-ähnlichen Programmen definieren wir eine pseudo-rekursive Prozedur als solche, die keine eigene Schachtel (activation record) auf dem Laufzeit-Keller benötigt; sie kann vielmehr innerhalb der Schachtel eines stark-rekursiven (d. h. eines rekursiven aber nicht pseudorekursiven) dynamischen Vorgängers abgelegt werden. Wir stellen einen Algorithmus vor, der jede Prozedur eines Programms entweder als nicht-rekursiv pseudo-rekursiv oder stark-rekursiv einstuft und der jeder pseudo-rekursiven eine geeignete stark-rekursive zuordnet. Anhand dieser Information kann der Übersetzer für jeden Prozedur-Typ eine eigens darauf zugeschnittene Implementierung auswählen.
    Notizen: Abstract Based on a decidable notion of recursivity of procedures (or functions) in ALGOL-like programs we define pseudo-recursive procedures to be those that do not need an activation record of their own on the runtime stack; their storage can be allocated within the activation record of a strictly-recursive (i.e. not pseudo-recursive) dynamic predecessor. We present an algorithm that characterizes each procedure of a program as being either non-recursive, pseudo-recursive or strictlyrecursive and associates each pseudo-recursive procedure with one appropriate strictly-recursive one. With this information a better suited implementation technique can be chosen for each type of procedure.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 96
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 269-276 
    ISSN: 1436-5057
    Schlagwort(e): Primary 10E05 ; 10E25 ; Secondary 65C10 ; Lattice structure ; Minkowski-reduced bases ; reduction of quadratic forms ; random number generation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Bisher gab es nur einen Algorithmus für die Berechnung von Minkowski-reduzierten Gitterbasen bis zur Dimensionn=6 oder höchstens bisn=7. Es wird nun ein neues Verfahren angegeben, das auch für höhere Dimensionen praktikabel ist und wenig Rechenzeit benötigt.
    Notizen: Abstract Up to now there has been an algorithm for the calculation of Minkowski-reduced lattice bases to dimensionn=6 or at most ton=7. A new algorithm is presented which is practicable for greater dimensions and requires less computation time.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 97
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 277-294 
    ISSN: 1436-5057
    Schlagwort(e): Primary 65H ; Secondary 47E ; Branch points ; bifurcation points ; extended system ; nonlinear parameter dependent equations ; Newton-like method ; local convergence
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Es wird eine Vorgehensweise zur Berechnung einfacher Bifurkationspunkte nichtlinearer, von einem Parameter abhängender Gleichungssysteme vorgestellt. Zunächst wird das ursprüngliche Gleichungssystem um einen Parameter und zwei Gleichungen erweitert. Das so erhaltene System besitzt eine reguläre Lösung, aus der unmittelbar der gesuchte Bifurkationspunkt abgelesen werden kann. Aufgrund der speziellen Struktur dieses Systems wird ein Newton-ähnliches Verfahren abgeleitet, das ohne die Berechnung zweiter Ableitungen auskommt. Abschließend wird die Wirksamkeit des vorgeschlagenenR-quadratisch konvergenten Verfahrens an einfachen Beispielen demonstriert.
    Notizen: Abstract The present paper deals with the computation of simple bifurcation points of nonlinear parameter dependent equations. At first, a minimally extended system of nonlinear equations is constructed by addition of one parameter and two equations. This augmented system has an isolated solution which yields to the simple bifurcation point directly. Using the structural properties of this auxiliary system an adapted Newton-like method is developed not requiring evaluations of second derivatives. Finally, the results of some computer experiments show the efficiency of theR-quadratically convergent method.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 98
    Digitale Medien
    Digitale Medien
    Springer
    Computing 35 (1985), S. 295-306 
    ISSN: 1436-5057
    Schlagwort(e): 65N30 ; Variational inequalities ; finite elements ; penalty methods
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung In der vorliegenden Arbeit wird eine abgestimmte Wahl von Diskretisierungs- und Strafparametern zur Lösung diskretisierter Hindernisprobleme vorgeschlagen. Dabei gelingt es bei Erhaltung der Kondition des Problems, den Fehlereinfluß der Strafmethode auf die Ordnung des Diskretisierungsfehlers zu beschränken. Ferner wird die Konvergenz der diskretisierten Koinzidenzmengen analysiert.
    Notizen: Abstract In this paper we present a mutual adjustment for mesh size parameters of the discretization and for penalty parameters. This enables to restrict the error resulting from the penalty technique to the same order as the discretization error without destroying the conditioning of the problem. Furthermore we analyze the convergence of the discrete coincidence set.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 99
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 146-164 
    ISSN: 1436-4646
    Schlagwort(e): Linear Programming ; NP-Completeness ; Polynomial Hierarchy ; Computational Complexity ; Stackleberg Strategies
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract The multi-level linear programs of Candler, Norton and Townsley are a simple class of sequenced-move games, in which players are restricted in their moves only by common linear constraints, and each seeks to optimize a fixed linear criterion function in his/her own continuous variables and those of other players. All data of the game and earlier moves are known to a player when he/she is to move. The one-player case is just linear programming. We show that questions concerning only the value of these games exhibit complexity which goes up all levels of the polynomial hierarchy and appears to increase with the number of players. For three players, the games allow reduction of theΣ 2 andΠ 2 levels of the hierarchy. These levels essentially include computations done with branch-and-bound, in which one is given an oracle which can instantaneously solve NP-complete problems (e.g., integer linear programs). More generally, games with (p + 1) players allow reductions ofΣ p andΠ p in the hierarchy. An easy corollary of these results is that value questions for two-player (bi-level) games of this type is NP-hard.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 100
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 32 (1985), S. 232-237 
    ISSN: 1436-4646
    Schlagwort(e): Constrained Optimization ; Reduced Hessian ; Two-step convergence
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract In this paper we give examples illustrating the behavior of the Coleman-Conn horizontal vertical method and of successive quadratic programming with a Hessian approximation exact on the tangent space of the constraints. One example shows that these methods in general are not one-step superlinearly convergent.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...