ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (144)
  • artificial intelligence  (77)
  • 65F10  (67)
  • Springer  (144)
  • American Association for the Advancement of Science
  • Wiley
  • Computer Science  (144)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 57 (1992), S. 215-238 
    ISSN: 1436-4646
    Keywords: Inductive inference ; Boolean function synthesis ; satisfiability ; artificial intelligence ; integer programming ; interior point method ; Riemannian geometry
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we describe an interior point mathematical programming approach to inductive inference. We list several versions of this problem and study in detail the formulation based on hidden Boolean logic. We consider the problem of identifying a hidden Boolean functionℱ:{0, 1} n → {0, 1} using outputs obtained by applying a limited number of random inputs to the hidden function. Given this input—output sample, we give a method to synthesize a Boolean function that describes the sample. We pose the Boolean Function Synthesis Problem as a particular type of Satisfiability Problem. The Satisfiability Problem is translated into an integer programming feasibility problem, that is solved with an interior point algorithm for integer programming. A similar integer programming implementation has been used in a previous study to solve randomly generated instances of the Satisfiability Problem. In this paper we introduce a new variant of this algorithm, where the Riemannian metric used for defining the search region is dynamically modified. Computational results on 8-, 16- and 32-input, 1-output functions are presented. Our implementation successfully identified the majority of hidden functions in the experiment.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Computing 37 (1986), S. 351-355 
    ISSN: 1436-5057
    Keywords: 65F10 ; Matrix equation ; algebraic formula
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Angegeben wird eine algebraische Formel für die Lösung der GleichungAX−XB=C und ein auf ihr basierender Lösungsalgorithmus.
    Notes: Abstract In this paper a finite algebraic formula for the solution of the matrix equationAX−XB=C is derived. Based on it, a new direct algorithm is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Computing 46 (1991), S. 253-263 
    ISSN: 1436-5057
    Keywords: 65G10 ; 65F10 ; Linear interval equations ; inclusion of solution ; error bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Vorgestellt werden neue Methoden zur Lösung spezieller Klassen linearer Intervallgleichungssysteme mittels geeigneter Auswahlsysteme. Zuerst beweisen wir einige Sätze die die Extremalpunkte der Lösungsmenge charakterisieren. Für invers stabile Matrizen sowie für Systeme, deren Lösungen nur in einem Orthanten liegen, werden Algorithmen für die Auswahl solcher Gleichungen angegeben, deren Lösungen die Intervallhülle erzeugen.
    Notes: Abstract We present new methods for solving special classes of linear interval equations by means of suitable selection systems. First we prove some theorems characterizing the extremal points of the solution set. For invers-stable interval matrices and systems whose solution set are contained in one orthant we give algorithms to select such systems the solutions of which generate the interval hull.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Computing 52 (1994), S. 51-63 
    ISSN: 1436-5057
    Keywords: 65F10 ; 65N20 ; 65N30 ; Preconditioning ; conjugate gradients ; local refinement ; elliptic problems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Präkonditionierte iterative Methoden von Typ der konjugierten Gradienten zur Lösung elliptischer und parabolischer Probleme werden auf lokal verfeinerten Gittern untersucht. Die Komponenten des während der Iteration berechneten Residuumsvektors werden betrachtet. Man erkennt, daß sie nur an den Knoten nahe dem Übergang zwischen feinem und grobem Gitter ungleich null sind. Diese Eigenschaft wird verwendet, um die präkonditionierte CG-Methode oder, wenn wie im parabolischen Fall die Matrix nicht symmetrisch ist, verallgemeinerte CG- oder GMRES-Methoden zu formulieren. Dadurch wird Speicherplatz und Rechenaufwand eingespart.
    Notes: Abstract Preconditioned iterative methods of conjugate gradient type for solving elliptic and parabolic problems discretized on grids wth local refinement are considered. The sparsity pattern of the residuals computed throughout the iterative process is investigated. It turns out that they are nonzero only near the interface nodes between the coarse-and fine-grids. This observation is used to formulate the preconditioned CG, and when the matrix is not symmetric as in the parabolic case—the generalized CG and GMRES methods, thus substantially saving storage and computation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Computing 53 (1994), S. 155-171 
    ISSN: 1436-5057
    Keywords: 65F10 ; 65N30 ; Wavelets ; wavelet packets ; robust multilevel methods ; V-cycle
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir betrachten den gedämpftenV-Zyklus für die Wavelet-Variante der “Frequenzzerlegungs-Multigridmethode” von Hackbusch [Numer. Math.56, 229–245 (1989)]. Es wird gezeigt, daß die Konvergenzgeschwindigkeit bei hinreichender Dämpfung durch Anisotropie nicht beeinflußt wird, aber noch von der Anzahl des Niveaus abhängt. Unsere Analyse beruht auf Eigenschaften von Wavelet-Paketen, die formuliert und bewiesen werden. Numerische Schätzungen der Konvergenzgeschwindigkeit erläutern die theoretischen Ergebnisse.
    Notes: Abstract The dampedV-cycle of the wavelet variation of the “Frequency decomposition multigrid method” of Hackbusch [Numer. Math.56, pp. 229–245 (1989)] is considered. It is shown that the convergence speed under sufficient damping is not affected by the presence of anisotropy but still depends on the number of levels. Our analysis is based on properties of wavelet packets which are supplied and proved. Numerical approximations to the speed of convergence illustrate the theoretical results.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Computing 55 (1995), S. 181-189 
    ISSN: 1436-5057
    Keywords: 65N55 ; 65F10 ; Smoothing property ; multi-grid method ; semi-iteration
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine Modifikation des Lemmas von Reusken wird angegeben. Sie gestattet, im Falle von konvergenten Glättungsiterationen die Konvergenzgeschwindigkeit in die Abschätzung der Glättungseigenschaft mit aufzunehmen. Eine derartige Abschätzung wird bei robusten Mehrgitterverfahren benötigt. Ferner wird ein einfacher semiiterativer Glätter angegeben, der ein asymptotisch besseres Verhalten besitzt.
    Notes: Abstract A modification of the Lemma of Reusken is given. It allows us to improve the estimate of the smoothing property in cases where the contraction number of the iteration is small. This is of importance for robust multi-grid methods. Moreover, we describe a simple semi-iterative smoother with better asymptotic behaviour than for the stationary iterative smoother.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Computing 55 (1995), S. 271-288 
    ISSN: 1436-5057
    Keywords: 65F10 ; Finite elements ; multigrid methods ; error control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir behandeln das Problem einer adaptiven Fehlerkontrolle bei Finite-Elemente-Methoden unter Enschluß des Fehlers, der durch ungenaue Lösung der diskreten Gelichungen entsteht. Wir beweisen A-posteriori-Fehlerabschätzungen für ein elliptisches Modellproblem, welches mit linearen finiten-Elementen diskretisiert wird. Die diskreten Gleichungen werden mit Hilfe des kanonischen Finite-Elemente-Mehrgitterverfahrens gelöst. Die Beweise beruhen auf der Kombination der «starken” stabilitätseigenschaft des zugrundeliegenden Differentialoperators und der Galerkin-Orthogonalität sowohl des Finite-Elemente-als auch des Mehrgitterverfahrens.
    Notes: Abstract We consider the problem of adaptive error control in the finite element method including the error resulting from, inexact solution of the discrete equations. We prove a posteriori error estimates for a prototype elliptic model problem discretized by the finite element with a canomical multigrid algorithm. The proofs are based on a combination of so-called strong stability and, the orthogonality inherent in both the finite element method can the multigrid algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Computing 56 (1996), S. 1-27 
    ISSN: 1436-5057
    Keywords: 65F10 ; 65H10 ; 65N22 ; 65N30 ; 65N55 ; Semiconductor device ; drift-diffusion equations ; finite element methods ; Gummel's method ; preconditioned conjugate gradient methods ; Schur complement ; domain decomposition massively parallel
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Diese Arbeit enthält die Beschreibung, Analyse und Implementierung eines parallelen iterativen Verfahrens zur Lösung der stationären Drift-Diffusions-Gleichung für ein zweidimensionales Halbleitermodell. Die Unbekannten unseres Modells sind das elektrostatische Potential und die Quasi-Fermi-Potentiale der Elektronen und Löcher. Unsere Diskretisierung verwendet die Finite-Element-Methode mit ‘mass limping’ für das elektrostatische Potential und hybride Elemente mit lokaler Stromerhaltung für die Kontinuitätsgleichung. Zur Lösung der entsprechenden nichtlinearen Gleichungen wird eine Version des Gummel-Algorithmus verwendet, der lediglich die Lösung positiv definiter, symmetrischer linearer Gleichungssysteme erfordert. Wir zeigen, daß diese Methode eine Konvergenzrate besitzt, die nur logarithmisch von der Schrittweite abhängt. Die (inneren) nichtlinearen Löser der elektrostatischen Potentialgleichung konvergieren gitterunabhängig quadratisch. Wir beschreiben auch eine Implementierung auf einem MasPar MP-1-Parallelrechner, wobei die auftretenden linearen Systeme mit einem vorkonditionierten cg-Verfahren approximiert werden. Gebietszerlegungsmethoden werden eingesetzt, um die notwendige Matrix-Vektor-Multiplikation zu parallelisieren und Vorkonditionierer dieser schlechtkonditionierten Systeme zu erstellen. Die vorkonditionierten linearen Löser haben ebenfalls eine Konvergenzrate, die logarithmisch vom Verhältnis Teilgebietsgröße zu Schrittweite abhängt und welche robust ist bezüglich stark variierenden Koeffizientenfunktionen des zugrundeliegenden elliptischen Operators. Experimente auf einem Parallelrechner werden diskutiert.
    Notes: Abstract In this paper we describe, analyse and implement a parallel iterative method for the solution of the steady-state drift diffusion equations governing the behaviour of a semiconductor device in two space dimensions. The unknowns in our model are the electrostatic potential and the electron and hole quasi-Fermi potentials. Our discretisation consists of a finite element method with mass lumping for the electrostatic potential equation and a hybrid finite element with local current conservation properties for the continuity equations. A version of Gummel's decoupling algorithm which only requires the solution of positive definite symmetric linear systems is used to solve the resulting nonlinear equations. We show that this method has an overall rate of convergence which only degrades logarithmically as the mesh is refined. Indeed the (inner) nonlinear solves of the electrostatic potential equation converge quadratically, with a mesh independent asymptotic constant. We also describe an implementation on a MasPar MP-1 data parallel machine, where the required linear systems are solved by the preconditioned conjugate gradient method. Domain decomposition methods are used to parallelise the required matrix-vector multiplications and to build preconditioners for these very poorly-conditioned systems. Our preconditioned linear solves also have a rate of convergence which degrades logarithmically as the grid is refined relative to subdomain size, and their performance is resilient to the severe layers which arise in the coefficients of the underlying elliptic operators. Parallel experiments are given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    AI & society 1 (1987), S. 5-15 
    ISSN: 1435-5655
    Keywords: artificial intelligence ; social sciences ; parallel computing systems ; collaboration ; problem-solving
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Artificial intelligence is presented as a set of tools with which we can try to come to terms with human problems, and with the assistance of which, some human problems can be solved. Artificial intelligence is located in its social context, in terms of the environment within which it is developed, and the applications to which it is put. Drawing on social theory, there is consideration of the collaborative and social problem-solving processes which are involved in artificial intelligence and society. In a look ahead to the coming generations of highly parallel computing systems, it is suggested that lessons can be learnt from the highly parallel processes of human social problem-solving.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    AI & society 1 (1987), S. 17-23 
    ISSN: 1435-5655
    Keywords: artificial intelligence ; intelligent program ; common-sense reasoning ; social effect ; dehumanising
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Some of the concerns people have about AI are: its misuses, effect on unemployment, and its potential for dehumanising. Contrary to what most people believe and fear, AI can lead to respect for the enormous power and complexity of the human mind. It is potentially very dangerous for users in the public domain to impute much more inferential power to computer systems, which look common-sensical, than they actually have. No matter how impressive AI programs may be, we must be aware of their limitations and should not abrogate human responsibility to such programs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...