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  (6,762)
  • 1975-1979  (4,143)
  • 1950-1954  (2,619)
  • 1975  (4,143)
  • 1953  (1,351)
  • 1950  (1,268)
  • Computer Science  (6,762)
Collection
  • Articles  (6,762)
Years
  • 1975-1979  (4,143)
  • 1950-1954  (2,619)
Year
Journal
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 91-103 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes what is termed the “generalized assignment problem”. It is a generalization of the ordinary assignment problem of linear programming in which multiple assignments of tasks to agents are limited by some resource available to the agents. A branch and bound algorithm is developed that solves the generalized assignment problem by solving a series of binary knapsack problems to determine the bounds. Computational results are cited for problems with up to 4 000 0–1 variables, and comparisons are made with other algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 43-53 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A break in a {0, 1}-matrix is defined as a 0 with at least one 1 to its left and at least one 1 to its right in the same row. This paper is concerned with {0, 1}-matrices with given column sums and an upper limit for the row sums. In addition, there are limits on the distance from the first to the last 1 in a row. The problem that is considered is to find a {0, 1}-matrix satisfying the conditions such that the total number of breaks is minimum. An algorithm for solving this problem is presented. Computational results illustrate the effectiveness of the algorithm. The investigation originated in a problem of crew rostering.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 104-116 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents a new algorithm for the solution of multi-state dynamic programming problems, referred to as the Progressive Optimality Algorithm. It is a method of successive approximation using a general two-stage solution. The algorithm is computationally efficient and has minimal storage requirements. A description of the algorithm is given including a proof of convergence. Performance characteristics for a trial problem are summarized.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 250-250 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 272-307 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A method of solving the 0–1 knapsack problem which derives from the “shrinking boundary method” is described and compared to other methods through extensive computational experimentation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 332-344 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Consequences of a general formulation of the theorem of the alternative are exploited.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 369-374 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A perturbation method is introduced which transforms any fixed cost transportation problem F into a degeneracy-free equivalent F′. If a basic optimal solution to F′ is known, an optimal solution to F can be obtained by means of simple rounding.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 345-368 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Consider the relaxation of an integer programming (IP) problem in which the feasible region is replaced by the intersection of the linear programming (LP) feasible region and the corner polyhedron for a particular LP basis. Recently a primal-dual ascent algorithm has been given for solving this relaxation. Given an optimal solution of this relaxation, we state criteria for selecting a new LP basis for which the associated relaxation is stronger. These criteria may be successively applied to obtain either an optimal IP solution or a lower bound on the cost of such a solution. Conditions are given for equality of the convex hull of feasible IP solutions and the intersection of all corner polyhedra.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 378-381 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract We consider the linear programming formulation of the asymmetric travelling salesman problem. Several new inequalities are stated which yield a sharper characterization in terms of linear inequalities of the travelling salesman polytope, i.e., the convex hull of tours. In fact, some of the new inequalities as well as some of the well-known subtour elimination constraints are indeed facets of the travelling salesman polytope, i.e., belong to the class of inequalities that uniquely characterize the convex hull of tours to an-city problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 57-68 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract A family of test-problems is described which is designed to investigate the relative efficiencies of general optimisation algorithms and specialised algorithms for the solution of nonlinear sums-of-squares problems. Five algorithms are tested on three members of the family, and it is shown that the best choice of algorithms is critically affected by the value of one parameter in the test functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 87-99 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper identifies necessary and sufficient conditions for a penalty method to yield an optimal solution or a Lagrange multiplier of a convex programming problem by means of a single unconstrained minimization. The conditions are given in terms of properties of the objective and constraint functions of the problem as well as the penalty function adopted. It is shown among other things that all linear programs with finite optimal value satisfy such conditions when the penalty function is quadratic.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 130-130 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 137-137 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 139-160 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Supposez ∈ E n is a solution to the optimization problem minimizeF(x) s.t.x ∈ E n and an algorithm is available which iteratively constructs a sequence of search directions {s j } and points {x j } with the property thatx j →z. A method is presented to accelerate the rate of convergence of {x j } toz provided that n consecutive search directions are linearly independent. The accelerating method uses n iterations of the underlying optimization algorithm. This is followed by a special step and then another n iterations of the underlying algorithm followed by a second special step. This pattern is then repeated. It is shown that a superlinear rate of convergence applies to the points determined by the special step. The special step which uses only first derivative information consists of the computation of a search direction and a step size. After a certain number of iterations a step size of one will always be used. The acceleration method is applied to the projection method of conjugate directions and the resulting algorithm is shown to have an (n + 1)-step cubic rate of convergence. The acceleration method is based on the work of Best and Ritter [2].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 255-255 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 247-254 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 257-277 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The nonlinear complementarity problem is the problem of finding a point x in the n-dimensional Euclidean space,R n , such that x ⩾ 0, f(x) ⩾ 0 and 〈x,f(x)∼ = 0, where f is a nonlinear continuous function fromR n into itself. Many existence theorems for the problem have been established in various ways. The aim of the present paper is to treat them in a unified manner. Eaves's basic theorem of complementarity is generalized, and the generalized theorem is used as a unified framework for several typical existence theorems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 313-335 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents a local convergence analysis of Broyden's class of rank-2 algorithms for solving unconstrained minimization problems, $$h(\bar x) = \min h(x)$$ ,h ∈ C1(R n ), assuming that the step-size ai in each iterationx i+1 =x i -α i H i ▽h(x i ) is determined by approximate line searches only. Many of these methods including the ones most often used in practice, converge locally at least with R-order, $$\tau \geqslant \sqrt[n]{2}$$ .
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 350-357 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper presents an algorithm for ranking the vertices of a directed graph. Its space and time requirements are bounded byc 1 n 2 +c 2, wheren is the number of vertices of the graph andc 1,c 2 are positive constants which are independent of the size or other properties of the graph. The algorithm can be easily modified to solve the problem of determining longest distances from a vertex to all other vertices in a positive real valued graph with at mostc 1 n 2 +c 2 elementary operations; the same result holds for shortest distances in negative real valued graphs.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 371-376 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper reports an empirical discovery in integer programming. A version of the branch-and-bound approach is used as a control and tested against the same algorithm augmented by the use of Hillier's linear search performed at every node of the search tree. It is shown that the imbedded linear search locates solutions within 1%, and solutions within 5% of the theoretical optimum, which in fact can be seen to have this proximity to the theoretical optimum at the time of termination of computation, over ten times faster than the control.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 51-65 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper the mathematical structures occuring in rounded computations with complex numbers and intervals are studied. By means of the special representation of the complex numbers and the properties of their operations one can show, that the same structures as in the real case occur again. Nevertheless we can prove formulae for the interval arithmetic wellknown for complex intervals ([1]) which are easy to calculate.
    Notes: Zusammenfassung In der vorliegenden Arbeit werden die beim numerischen Rechnen mit komplexen Zahlen und Intervallen auftretenden mathematischen Räume untersucht. Unter Verwendung der speziellen Darstellung komplexer Zahlen und der Eigenschaften ihrer Verknüpfungen läßt sich zeigen, daß wieder dieselben Strukturen wie im reellen Fall vorliegen. Trotzdem lassen sich für die Intervallarithmetik leicht auswertbare Formeln herleiten, wie sie für komplexe Intervalle bekannt sind ([1]).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 107-117 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es handelt sich um eine nomographische approximative Lösungsmethode der folgenden Minimierungsaufgabe: $$g(t_0 ,t_1 ) + g(t_1 ,t_2 ) + ... + g(t_{n - 1} ,t_n ) = \min !$$ unter der Bedingung $$t_0 \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \leqslant } 0〈 t_1〈 t_2〈 ...〈 t_{n - 1}〈 T\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \leqslant } t_n ,$$ wobein die Anzahl der Variablen ist und auch unbekannt sein kann. Der Nomograph besteht aus den Höhenlinien vong(.,.) und anderen Hilfslinien. Die Erstellung der Nomographen durch Computer wird auch gezeigt.
    Notes: Zusammenfassung A graphical procedure is presented to obtain an approximate solution to the minimization problem of the follwing form: Minimize the function $$\varphi (t_0 ,t_1 ,...,t_{n - 1} ,t_n ) = g(t_0 ,t_1 ) + g(t_1 ,t_2 ) + ... + g(t_{n - 1} ,t_n )$$ subject to the constraints $$t_0 \underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \leqslant } 0〈 t_1〈 t_2〈 ...〈 t_{n - 1}〈 T\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{ \leqslant } t_n $$ wheren the number of the variables is not predetermined. The nomograph for the procedure is constructed of contour lines of the functiong(.,.) as well as two other auxiliary curves. Procedures to prepare such nomographs by computer are also presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 141-147 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A theorem is proved by means of Brouwer's theorem which allows to decide whether a given interval matrix [S] has the inclusion property relative to the unknown inverseA −1 of a known matrixA. It is demonstrated in which cases the theorem may be used and how to choose [S] in these cases.
    Notes: Zusammenfassung Mittels des Satzes von Brouwer wird ein Satz bewiesen, nach dem man entscheiden kann, ob eine gegebene Intervallmatrix [S] die Einschließungseigenschaft bezüglich der unbekannten InversenA −1 einer bekannten MatrixA hat. Es wird vorgeführt, in welchen Fällen der Satz anwendbar ist und wie [S] in diesen Fällen gewählt werden kann.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 153-166 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Zur Konstruktion von Algorithmen zur numerischen Lösung einer allgemeinen Volterraschen Integralgleichung zweiter Art werden Splinefunktionen vom Gradem und der DefizienzJ−1, d. h. inC m−J , zusammen mit Gaußschen Quadraturformeln benutzt. Die Methode ist, für gegebenesm, von der Ordnung (m+1), und sie erfordert im allgemeinen 0(N) Auswertungen des Kerns. Die bisher bekannten Methoden erfordern 0(N 2) Auswertungen. Es wird gezeigt, daß die Methode für Splinefunktionen mit voller Stetigkeit (J=1) numerisch instabil ist für allem〉2. Dagegen wird die Stabilität bewiesen fürJ=m, m −1 undm beiliebig. Weiter wird fürm=3,J=1 gezeigt, daß bei geeigneter Modifikation der ursprünglichen Methode eine ganze Familie stabiler Methoden gewonnen werden kann.
    Notes: Abstract Spline function of degreem, deficiencyJ−1, i. e. inC m−J , are used in conjunction with (Gaussian) quadrature rules to construct algorthms for the numerical solution of a general Volterra integral equation of the second kind. For a givenm, the method is of order (m+1) and, in general, requires 0(N) evaluations of the kernel. This is in sharp contrast to the 0(N 2) evaluations required by hitherto known methods. It is shown that the method for spline functions with full continuity (J=1) is numerically unstable for allm〉2. However, stability is established forJ=m, m−1, for allm. Furthermore, form=3,J=1, it is demonstrated that by appropriately modifying the original method, a whole family of stable methods is obtained.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 195-203 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es wird ein Algorithmus beschrieben, der das chromatische Polynom eines Graphen in Koeffizientenform liefert. Ein FORTRAN-Programm wird angegeben und einige praktische Erfahrungen werden kurz zusammengefaßt.
    Notes: Abstract An algorithm for deriving the chromatic polynomial of a graph in coefficient form is described. A FORTRAN implementation is given, and some computational experience is summarized.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 225-234 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In the present paper a new method is given for the numerical treatment of the initial problemsy (n)=f(x,y,y′, ...,y (n−1),y (i) (x o )=y o (i) , i=0, 1, ...,n−1. This method is an one-step process of order four. For a class of linear differential equations the exact solution is obtained. Moreover some numerical results are presented.
    Notes: Zusammenfassung In der vorliegenden Arbeit wird ein neues Verfahren zur numerischen Berechnung des Anfangswertproblemsy (n)=f(x,y,y′, ...,y (n−1),y (i)(x o )=y o (i) , i=0, 1, ..., n−1 gegeben. Es handelt sich hierbei um ein Einschrittverfahren der Konsistenzordnung 4. Das Verfahren liefert für eine Klasse linearer Differentialgleichungen die exakte Lösung. Abschließend geben wir einige numerische Beispiele.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 261-270 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract It is not possible to support by numerical tests the common opinion that the filter method is better than the additive algorithm. The reasons for the limited efficiency of the filter method are stated together with results of numerical tests.
    Notes: Zusammenfassung Die in der Literatur verbreitete Meinung, die Filtermethode sei eine Verbesserung des additiven Algorithmus, kann durch numerische Tests nicht gestützt werden. Zusammen mit den Ergebnissen der numerischen Tests werden Ursachen für die beobachtete geringe Leistungsfähigkeit der Filtermethode angegeben.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 285-312 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Eine interpretierte zweisortige Logik wird so definiert, daß sie die Repräsentation einer Unterklasse von Flußdiagrammschemata erlaubt. Ein Entscheidungsverfahren wird entwickelt für die Äquivalenz einfacher Darstellungsformeln innerhalb der Logik und infolgedessen wird ein Entscheidungsverfahren für Flußdiagrammschemata innerhalb der Unterklasse demonstriert. Anwendungen der in der Arbeit entwickelten Techniken haben weitere Entscheidungsverfahren zur Folge. Ein Entscheidungsverfahren für die Äquivalenz von Programmen in einer einfachen Programmiersprache wird auch angegeben.
    Notes: Abstract An interpreted two-sorted logic is defined to allow the representation of a subclass of flowchart schemata. A decision procedure for the equivalence of simple representing formulae within the logic is developed and as a consequence a decision procedure for flowchart schemata within the subclass is demonstrated. Applications of the techniques developed within the paper result in further decision procedures for the equivalence of flowchart schemata in other subclasses. In addition, a decision procedure for the equivalence of programs in a simple programming language is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 389-396 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract This paper contains an ALGOL-Procedure for solving mixed integer programming problems with convex objective function and constraints according to a method of Burkard [2].
    Notes: Zusammenfassung Diese Arbeit enthält ein ALGOL-Programm zur Lösung gemischt-ganzzahliger Optimierungsaufgaben mit konvexer Zielfunktion und konvexen Restriktionen nach einer Methode von Burkard [2].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 33-39 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Folgende Algorithmen wurden untersucht: 1. Warshall's Algorithm [17], 2. Purdom's Algorithm [13], 3. der modifizierte Algorithmus von Yen [14], 4. der Algorithmus von Dzikiewicz [3, 4]. Die getesteten Digraphen wurden durch einen Zufallsgenerator erzeugt. Das Literaturverzeichnis enthält alle Veröffentlichungen über Algorithmen zur Bildung der transitiven Hülle, welche den Verfassern bekannt sind.
    Notes: Abstract The paper contains results of computational experiences with the following algorithms for finding the transitive closure of a digraph: (i) Warshall's algorithm [17], (ii) Purdom's algorithm [13], (iii) the modification of Yen's algorithm [14], and (iv) the new algorithms for finding the transitive closure [3, 4]. The tested digraphs were generated at random. The enclosed references contain all papers known to the authors concerning transitive closure algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 31
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In this paper Aireys converging factors of the exponential integral are transformed into an asymptotic expansion with remainder. This expansion is obtained by an Euler transformation of the remaining divergent series in analogy to the formal procedure due to Airey. The remainder termR N (z) is developed by Abels asymptotic principle. Transforming the terms of this series we get Aireys converging factors. Finally we improve the estimation of the remainder term which has been given by J. B. Rosser.
    Notes: Zusammenfassung In der vorliegenden Abhandlung werden die Aireyschen Konvergenzfaktoren für das Exponentialintegral zu einer asymptotischen Entwicklung mit Restglied umgeformt. Diese Entwicklung wird in Anlehnung an das Aireysche formale Herleitungsverfahren durch Eulersche Transformation der divergenten Restreihe gewonnen. Das RestgliedR N (z) seinerseits wird nach dem Prinzip der Abelschen Asymptotik entwickelt. Durch Umformen dieser Reihe erhält man die Aireyschen Konvergenzfaktoren; deren Restabschätzung nach J. B. Rosser wird in der vorliegenden Arbeit verbessert.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 32
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 71-74 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es werden einige Sätze über die Erhaltung der Eindeutigkeit von n-tupel-Sprachen präsentiert. Weiters wird der Begriff der „n-stratified” Mengen als Verallgemeinerung der von Ginsburg definierten „stratified” Mengen eingeführt und damit eine notwendige und hinreichende Charakterisierung der beschränkten eindeutigen n-tupel-Sprachen — in Analogie zu den beschränkten eindeutigen umgebungsunabhängigen Sprachen — angegeben.
    Notes: Abstract Several results concerning the preservation of unambiguity in n-tuple languages are presented here. Furthermore, the notion of n-stratified sets — as appropriate generalization of the straified sets defined by Ginsburg — is introduced and a necessary and sufficient characterisation result for bounded unambiguous n-tuple languages analogous to bounded unambiguous context free languages is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 33
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 137-146 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract If an Integral Equation is solved by Hermite Collocation we get essentially the same error bound as by using a more complicate method, supposed the collocation-points are suitably chosen. How to do this is one essential part of this paper. The discussion of numerical problems is confined to the case of linear problems.
    Notes: Zusammenfassung Gegenstand der Arbeit ist die Lösung nichtlinearer Integralgleichungen durch hermitesche Kollokation. Bei geeigneter Wahl der Kollokationsstellen —hierzu benötigen wir die Theorie der Gaußschen Quadraturformeln — ergibt sich praktisch dieselbe Genauigkeit wie bei komplizierteren Verfahren. Da nichtlineare Probleme bei der praktischen Rechnung meist linearisiert werden, beschränkt sich die Diskussion der numerischen Probleme auf den linearen Fall.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 34
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 147-156 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Effective procedures for the decision whether two finite graphs are isomorphic or not make use of some information about the automorphism groups of these graphs. The paper deals with a systematic representation of this information and proposes an algorithm scheme for the determination of the automorphisms of a graph.
    Notes: Zusammenfassung Bekannte Verfahren zum Nachweis der Isomorphie zwischen zwei endlichen GraphenG undG′ benutzen Informationen über die Automorphismengruppen beider Graphen. Die vorliegende Arbeit befaßt sich mit einer systematischen Darstellung dieser Information und enthält ein Algorithmenschema zur Bestimmung der Automorphismen eines Graphen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 35
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 173-179 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Dieser Aufsatz fängt mit einer Untersuchung zweier besonderer Gestalten der Gauß-Turán-Quadratur des Chebyshev-Typs der Präzision 6n−1 an. Dann werden die Restformeln dieser Quadraturen entwickelt und scharfe Irrtumgrenzen für die Funktionen inC q [−1, 1] gezeigt, woq eine positive ganze Zahl ist. Am wichtigsten beweist diese Studie, daß diese Ergebnisse verlängert werden können, um die Resformeln und scharfe Irrtumsabschätzungen für alle solchen Quadraturen höherer Präzision zu erhalten.
    Notes: Abstract This paper begins with an investigation of two special forms of the Gauss-Turán quadrature of Chebyshev-type of precision 6n−1. Then the remainder formulas of these quadratures are developed and sharp error bounds for the functions inC q [−1, 1] are shown, whereq is a positive integer. Most importantly this study proves that these reslts can be extended in order to yield sharp error estimates for all such quadratures of higher precision.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 36
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 205-216 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract By Mac Leod there was presented an improved algorithm for the computation of cubic natural Splines with equi-spaced knots. In this paper his algorithm is extended to the case of type I and II L-Splines corresponding to operators of second order with constant coefficients and applied to a problem concerning the static deflection of beams.
    Notes: Zusammenfassung Mac Leod hat ein numerisch stabiles Verfahren zur Berechnung von kubischen natürlichen Polynom-Splines mit äquidistanten Knoten hergeleitet, das lediglich einen Rechenaufwand in der Größenordnung der Knotenanzahl erfordert. Sein Ansatz wird in dieser Arbeit auf den Fall von L-Splines vom Typ I und II zu Operatoren zweiter Ordnung mit konstanten Koeffizienten erweitert und auf eine dem Spline-Problem adäquate Fragestellung bei der statischen Biegung von Balken angewendet.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 37
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 217-234 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Um einen natürlichen, von Kodierungen unabhängigen Vergleich zwischen primitiv-rekursiven Funktionen und Automatentransduktionen zu ermöglichen, werden die Grzegorczyk-Hierarchie, die Rekursionszahl-Hierarchie und die Loop-Hierarchie von arithmetischen auf Wortfunktionen verallgemeinert. Dabei ergeben sich einige Unterschiede zum arithmetischen Fall. Unter Benutzung von Turingmaschinen und verallgemeinerten endlichen Automaten werden alle Inklusionsprobleme der Funktionenklassen dieser Hierarchien gelöst. Von Automaten definierte Funktions- und Sprachklassen werden innerhalb dieser Hierarchien klassifiziert. Außerdem werden primitiv-rekursive Transformationen zwischen verschiedenen Monoiden behandelt.
    Notes: Abstract In order to compare primitive recursive functions and transductions defined by automata in a natural way independent of encodings, we generalize the Grzegorczyk hierarchy, the recursion number hierarchy and the loop hierarchy from arithmetical to wordfunctions. We observe several differences between the arithmetical and the non-arithmetical theory. By means of turingmachines and generalized sequential machines all inclusion problems for the function classes of these hierarchies are solved. Transductions and languages defined by automata are classified within these hierarchies. Moreover, we introduce and study primitive recursive transformations between different monoids.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 38
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 275-286 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A method for the determination of Eigenvalues and Eigenvectors of symmetric non-hermitian matrices has been developed. This method is characterized by a “complex unitarity” of the transformation matrix. Thereby it is possible to extend the Jacobi procedure to symmetric non-hermitian matrices and to guarantee convergency.
    Notes: Zusammenfassung Es wird ein Verfahren zur Bestimmung der Eigenwerte und Eigenrichtungen von symmetrisch nicht-hermiteschen Matrizen entwickelt, das dadurch charakterisiert ist, daß für die auf die Matrix angewandte Transformation eine „Komplexe Unitarität” gefordert wird. So gelingt es, das Jacobi-Verfahren auf symmetrische nicht-hermitesche Matrizen zu erweitern und die Konvergenz zu gewährleisten.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 39
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 311-328 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract We derive explicit bounds for the termination index and for the error bound of algorithms as they were studied in part I. Furthermore, we analyze a relation between the theory of part I and the theory of Dahlquist.
    Notes: Zusammenfassung Es werden explizite Schranken angegeben für den Abbrechindex und für die Fehlerschranke von Algorithmen, wie sie in Teil I untersucht wurden. Weiterhin wird ein Zusammenhang zwischen der Theorie von Teil I und der Theorie von Dahlquist untersucht.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 40
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 41
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 1-3 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 42
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 5-14 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Wir geben eine neue Methode für die Reduktion des Grades eines Intervallpolynoms. Es wird gezeigt, daß diese Methode besser ist als eine frühere Methode ([4] und [5]), wenn der Grad der Reduktion klein ist. Einige numerische Vergleiche und eine Anwendung auf Grenzwertprobleme werden angegeben.
    Notes: Abstract A new Method for reducing the degree of an interval polynomial is presented. The method is shown to be better than a previously suggested method ([4] and [5]) when the degree of the reduction is small. Some numerical comparisons and an application to a boundary value problem is given.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 43
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 183-193 
    ISSN: 1436-5057
    Keywords: Complexity classes ; honesty classes ; honesty procedures ; naming theorem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ein wichtiges Ergebnis der Komplexitätstheorie ist der Umbenennungssatz von E. M. McCreight, der besagt, daß es einen Algorithmus σ gibt, der alle Namen ϕi des Systems der Komplexitätsklassen in neue Namen ϕσ(i) überführt, derart, daß die neuen Namen die Schrittmaßbedingung „λi,n,m[ϕσ(i)(n)≦m] entscheidbar” erfüllen. Unsere Untersuchung der „gutartigen Funktionenklassen” zeigt, daß ein entsprechender Umbenennungsalgorithmus für diese Klassen nicht existiert.
    Notes: Abstract An important result in the theory of complexity classes is the naming theorem of E. M. McCreight, which states that the system of complexity classes can be renamed uniformly by a measured set of names. Our investigation of honesty classes shows that for these classes the analogous assertion is false. No measured transformation of programs renames correctly all honesty classes.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 44
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 213-223 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract In analogy to the well known rudimentary predicates some predicates are considered which are constructed by logical operations from basic finite-automatondecidable attributes. It is shown that all sets of words definable by these predicates are regular. A similar results holds, if one changes to Σ-valued trees and finite automata on Σ-valued trees.
    Notes: Zusammenfassung In Analogie etwa zu den bekannten rudimentären Prädikaten werden Prädikate betrachtet, die man mit logischen Mitteln aus Anfangsprädikaten gewinnen kann, die von endlichen Automaten entscheidbar sind. Es wird gezeigt, daß die mit solchen Prädikaten definierbaren Wortmengen stets wieder regulär sind. Ein entsprechendes Resultat gilt auch für den Bereich der Σ-bewerteten Bäume und endlichen Automaten über diesem Bereich.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 45
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 251-259 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The general duality theory of Rockafellar will be applied to some convex optimization problems in order to get duality, existence and characterization theorems for optimal solutions. Among other things, in this way one recovers some well-known results in a very simple manner.
    Notes: Zusammenfassung Die allgemeine Rockafellarsche Dualitätstheorie wird auf eine Reihe konvexer Optimierungsprobleme angewandt, um Dualitäts-, Existenz-und Charakterisierungssätze für Optimallösungen zu erhalten. Unter anderem werden auf diesem Wege einige schon bekannte Ergebnisse in sehr einfacher Weise wiedergewonnen.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 46
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 313-314 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 47
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 349-365 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung In dieser Arbeit wird ein allgemeines Ringsystem untersucht. Eine Anzahl mit Speichern versehener Einheiten tauschen miteinander Daten über einen gemeinsamen Ringkanal aus. Dieser Kanal überträgt Daten nur in einer Richtung. Der Verkehr wird durch stationäre stochastische Prozesse mit unabhängigen Zuwächsen beschrieben. Die an den verschiedenen Einheiten auf die Übertragung wartenden Daten werden betrachtet. Die angenommene Warteschlangendisziplin gibt Daten mit längerem Übertragungsweg unterbrechende Prioritäten gegenüber Daten mit kürzerem Übertragungsweg. Für derartige Systeme werden die Erwartungswerte der Warteschlangenlängen und der Wartezeiten im stationären Zustand für alle Einheiten und Prioritätsklassen berechnet. Als hauptsächliches Hilfsmittel wird eine Äquivalenz zwischen einem allgemeinen Ringsystem und einem System von sehr viel einfacherer Struktur benutzt.
    Notes: Abstract This paper is concerned with general loop systems in which each of several buffered units may exchange data with any other unit via a single oneway loop channel. The traffic is described in terms of stationary stochastic processes with independent increments. The queues of data waiting for transmission which develop at the different units are investigated. The queueing discipline assumed here accords data with longer transmission paths preemptive priority over those with shorter paths. For such systems expected queue lengths and waiting times in the steady state are calculated for all units and priority classes. An equivalence is established between general loop systems and systems of a much simpler structure and is used in the derivation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 48
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 87-103 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract A method to construct test matrices with free parameters is given. As an example of application a new test matrix of even order which is also appropriate to the eigenproblem is derived. Moreover some known test matrices with constant elements are generalized in such a way that they can be supplied with condition numbers of arbitrary order.
    Notes: Zusammenfassung Es wird eine Methode zur Konstruktion von Testmatrizen mit freien Parametern angegeben. Als Anwendungsbeispiel wird eine neue Testmatrix geradzahliger Ordnung hergeleitet, die auch für das Eigenwertproblem geeignet ist. Außerdem werden mehrere bekannte Testmatrizen mit konstanten Elementen so verallgemeinert, daß sie beliebig große Konditionszahlen annehmen können.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 49
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Algorithmen zur numerischen Lösung von Steuerungsproblemen mit beschränkten Zustandsvariablen werden entwickelt. Zwei Fälle werden betrachtet: entweder tritt die Steuervariable nichtlinear auf oder sie tritt linear auf. Im ersten Fall wird gezeigt, daß eine Extremale, welche entweder die begrenzung berührt oder ein Stück auf der Begrenzung verläuft, Lösung eines geeigneten Zwei-Punkt-Randwertproblems ist. Im zweiten Fall wird eine numerische Idee beschrieben, welche eine numerische Lösung des Problems im Zustandsraum gestattet und auf die Lagrange-Multiplikatoren verzichtet. Drei numerische Beispiele werden diskutiert, welche die Effektivität der verschiedenen Algorithmen zeigen. Die dabei auftretenden Zwei-Punkt-Randwertprobleme werden mit der Mehrzielmethode gelöst.
    Notes: Abstract Algorithms for the numerical solution of optimal control problems with bounded state variables are developed. Two main cases are considered: either the control variable appears nonlinearly or the control variable appears linearly. In the first case, an extremal are touching the boundary or containing a boundary arc, is shown to satisfy a suitable two-point boundary value problem. In the second case, a numerical idea for solving the problem in statespace is presented which dispenses with the Lagrange-multipliers. Three numerical examples are discussed illustrating the efficiency of the different algorithms. The encountered two-point boundary value problems are solved with the method of multiple shooting.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 50
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 157-167 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract If the cutting plane method is applied formally to the computation of flows with minimal costs then repeatedly negative cycles have to be determined. Up to now this can be done only with algorithms which are relatively clumsy. A modification of the algorithm enables us to avoid the search of such cycles and to generate an effective algorithm. At the same time we obtain stimulations for other numerical procedures, e. g., it becomes apparent how to proceed, when the approximation of the (nonlinear) cost function is successively improved.
    Notes: Zusammenfassung Wendet man den Schnittebenenalgorithmus formal zur Bestimmung kostenminimaler Flüsse an, hat man wiederholt Zyklen mit negativer Bewertung zu bestimmen. Dies ist zur Zeit nur mit relativ schwerfälligen Algorithmen möglich. Es gelingt nun, den Algorithmus so zu modifizieren, daß die Suche solcher Zyklen vermieden wird und ein effektiver Algorithmus entsteht. Zugleich gewinnen wir Anregungen für andere Verfahren, so wird z. B. deutlich, wie man vorzugehen hat, wenn man die Approximation der Kostenfunktionen sukzessive verbessert.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 51
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 181-193 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Ein beschränktes, konvexes PolyederP inR n wird meistens als Durchschnitt endlich vieler Halbräume beschrieben. Häufig bilden solche PolyederP den Restriktionenraum von Optimierungsaufgaben, die nur gelöst werden können, falls sämtliche Eckpunkte vonP bekannt sind. In diesem Artikel wird ein Algorithmus beschrieben, der unter Zuhilfenahme von Graphen und einer Idee von Mañas und Nedoma [2] diese Eckpunkte bestimmt. Anschiließen wird die erwartete Anzahl von Eckpunkten für die von Liebling [1] verwendeten Beispiele geschätzt.
    Notes: Abstract A bounded, convex polyhedronP inR n can be defined as the intersection of a finite number of halfspaces. Frequently, such polyhedronsP form the feasible regions of optimization problems; sometimes an optimum can only be determined when all vertices ofP are known. This paper describes an algorithm to enumerate these vertices with the help of graphs and a concept by Mañas and Nedoma [2]. Using this algorithm, it will be attempted to estimate the expected number of vertices of the examples employed by Liebling [1].
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 52
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 235-246 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract The convergence rate of the Chebyshev series of an analytic function depends on the singularities. In analgy to the Euler transformation we propose a method based on conformal mapping. By this means one obtains an improvement of the convergence rate and an enlargement of the domain where the series converges. In the special case of a linear transformation we find out a connection to the Euler-Knopp method. Finally we give applications to approximation problems and treat some examples.
    Notes: Zusammenfassung Das Konvergenzverhalten der Čebyšev-Entwicklung einer analytischen Funktion hängt von der Lage der Singularitäten ab. In Analogie zu den Euler-Verfahren schlagen wir ein konvergenzbeschleunigendes Verfahren vor, welches auf konformer Abbildung beruht. Dadurch erreicht man eine Vergrößerung des Konvergenzbereichs und eine Verbesserung der Konvergenzgüte. Besonders einfach läßt sich der Fall einer gebrochen linearen Abbildung behandeln, wo sich eine Verbindung zu den Euler-Knopp-Verfahren ergibt. Schließlich geben wir Anwendungen auf Approximationsprobleme und behandeln einige Beispiele.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 53
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 287-290 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 54
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 291-309 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract We introduce the concept of a (numerical) algorithm and the following properties: consistency, local and global stability, numerical convergence. We exhibit classes of such algorithms with the following property: consistency and local stability together with a suitable termination criterion imply numerical convergence. It is shown that all known results in the literature may be deduced from two theorems on monotone algorithms.
    Notes: Zusammenfassung Es wird der Begriff des (numerischen) Algorithmus eingeführt und es werden dazu die folgenden Eigenschaften definiert: Konsistenz, lokale und globale Stabilität, numerische Konvergenz. Es werden Klassen solcher Algorithmen angegeben mit der folgenden Eigenschaft: Aus Konsistenz und lokaler Stabilität, zusammen mit einem passenden Abbrechkriterium, folgt numerische Konvergenz. Es wird gezeigt, daß alle bis heute bekannten Ergebnisse aus zwei Sätzen über monotone Algorithmen ableitbar sind.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 55
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 347-355 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Die Quadraturformeln vom Clenshaw-Curtis Typ, die auf den “praktischen” Abszissenx k=cos(kπ/n),k=0(1)n, basieren, werden für die numerische Berechnung des Cauchyschen Hauptwerts $$\int\limits_{ - 1}^1 {(x - a)^{ - 1} } f(x) dx, - 1〈 a〈 1$$ , abgeleitet.
    Notes: Abstract Quadrature formulas of the Clenshaw-Curtis type, based on the “practical” abscissasx k=cos(kπ/n),k=0(1)n, are obtained for the numerical evaluation of Cauchy principal value integrals $$\int\limits_{ - 1}^1 {(x - a)^{ - 1} } f(x) dx, - 1〈 a〈 1$$ .
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 56
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 390-390 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 57
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 391-391 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 58
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 20-42 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Consider an edge-weighted graphG = (V, L), and define ak-cover C as a subset of the edgesL such that each vertex inV is incident to at least one edge ofC, and|C| = k. GivenG andk, the problem is to find ak-cover of minimum weight sum. This paper presents characterizations of minimumk-covers, and shows their weight to be convex with the parameterk. An efficient algorithm is presented which generates minimumk-covers continuously as the parameterk ranges over all feasible values, together with a proof of optimality. The computational order of this algorithm is found to be|V| ⋅ |L| 2.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 59
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 84-90 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Methods are given for replacing a system of equations in nonnegative integer variables by a single equation with the same solution set. These results focus on easily specified coefficient conditions rather than on the use of bounds that must be calculated “externally” in order to produce the desired aggregation.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 60
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 179-206 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The role of 0–1 programming problems having monotone or regular feasible sets was pointed out in [6]. The solution sets of covering and of knapsack problems are examples of monotone and of regular sets respectively. Some connections are established between prime implicants of a monotone or a regular Boolean functionβ on the one hand, and facets of the convex hullH of the zeros ofβ on the other. In particular (Corollary 2) a necessary and sufficient condition is given for a constraint of a covering problem to be a facet of the corresponding integer polyhedron. For any prime implicantP ofβ, a nonempty familyF(P) of facets ofH is constructed. Proposition 17 gives easy-to-determine sharp upper bounds for the coefficients of these facets whenβ is regular. A special class of prime implicants is described for regular functions and it is shown that for anyP in this class,F(P) consists of one facet ofH, and this facet has 0–1 coefficients. Every nontrivial facet ofH with 0–1 coefficients is obtained from this class.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 61
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 121-122 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 62
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 124-124 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 63
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 8 (1975), S. 165-178 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a linear inequality in 0–1 variables we attempt to obtain the faces of the integer hull of 0–1 feasible solutions. For the given inequality we specify how faces of a variety of lower-dimensional inequalities can be raised to give full-dimensional faces. In terms of a set, called a “strong cover”, we obtain necessary and sufficient conditions for any inequality with 0–1 coefficients to be a face, and characterize different forms that the integer hull must take. In general the suggested procedures fail to produce the complete integer hull. Special subclasses of inequalities for which all faces can be generated are demonstrated. These include the “matroidal” and “graphic” inequalities, where a count on the number of such inequalities is obtained, and inequalities where all faces can be derived from lower dimensional faces.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 64
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 358-370 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An economic production game is treated, in which players pool resources to produce finished goods which can be sold at a given market price. The production process is linear, so that the characteristic function can be obtained by solving linear programs. Duality theory of linear programming is used to obtain equilibrium price vectors and to prove the non-emptiness of the core. Under replication, it is shown that, in the non-degenerate case, the core converges finitely to the set of competitive equilibria; a counter-example shows that this is not true in the degenerate case (i.e., only convergence in the limit can be guaranteed).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 65
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 207-226 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we consider the question: how does the flow algorithm and the simplex algorithm work? The usual answer has two parts: first a description of the “improvement process”, and second a proof that if no further improvement can be made by this process, an optimal vector has been found. This second part is usually based on duality -a technique not available in the case of an arbitrary integer programming problem. We wish to give a general description of “improvement processes” which will include both the simplex and flow algorithms, which will be applicable to arbitrary integer programming problems, and which will inthemselves assure convergence to a solution. Geometrically both the simplex algorithm and the flow algorithm may be described as follows. At the ith stage, we have a vertex (or feasible flow) to which is associated a finite set of vectors, namely the set of edges leaving that vertex (or the set of unsaturated paths). The algorithm proceeds by searching among this special set for a vector along which the gain function is increasing. If such a vector is found, the algorithm continues by moving along this vector as far as is possible while still remaining feasible. The search is then repeated at this new feasible point. We give a precise definition for sets of vectors, called test sets, which will include those sets described above arising in the simplex and flow algorithms. We will then prove that any “improvement process” which searches through a test set at each stage converges to an optimal point in a finite number of steps. We also construct specific test sets which are the natural extensions of the test sets employed by the flow algorithm to arbitrary linear and integer linear programming problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 66
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 240-246 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Given a tree each of whose terminal vertices is associated with a given point in a compact metric space, the problem is to optimally associate a point in this space to each nonterminal vertex of the tree. The optimality criterion is the minimization of the sum of the lengths, in the metric space, over all edges of the tree. This note shows how a dynamic programming solution to this problem generalizes a number of previously published algorithms in diverse metric spaces, each of which has direct and significant applications to biological systematics or evolutionary theory.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 67
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 9 (1975), S. 278-293 
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For a given map f from the n-dimensional Euclidean space En into itself, we consider the complementary problem of finding a nonnegative vector x in En whose imagef(x) is also nonnegative and such that the two vectors are orthogonal. It is the unifying mathematical form for several problems arising in different fields such as mathematical programming, game theory and economics. In this paper a new algorithm is developed based on the “adjacent simplex technique ”, which was used by Garcia, Lemke and Lüthi for approximating an equilibrium point of a noncooperative n-person game. An “almost-complementary” path leads to a “complementary” simplex, which approximates a stationary point. Because most of the existence proofs for the nonlinear complementarity use the relationship between stationary points and complementarity, the algorithm gives constructive proofs for many existence theorems. If a better approximation is desired, the algorithm may be restarted from any point. The dimension of the simplices on the path is varying, which computationally should result in some savings.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 68
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 29-35 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract We give an iterative method for determining nested bounds for the Frobenius-rootr(A) of a nonnegative matrixA. This method still works when there are several eigenvalues with modulusr(A).
    Notes: Zusammenfassung Wir beschreiben ein Iterationsverfahren zur Bestimmung von Schranken für die Frobeniuswurzelr(A) einer nichtnegativen MatrixA. Die Methode funktioniert auch dann noch, wenn es mehrere Eigenwerte vom Betragr(A) gibt.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 69
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 79-105 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Es ist bekannt, daß die Anwendung von Methoden der konjugierten Richtungen sowie von geeigneten Modifikationen der Methode der konjugierten Gradienten zur Bestimmung des Minimums einer Funktion vonn Variablen einen-Schritt quadratische Konvergenzgeschwindigkeit ergibt. Eine Menge vonn aufeinanderfolgenden Richtungsvektoren, die von einer dieser Methoden erzeugt worden sind, enthalten Information über die zu minimierende Funktion, die dazu benutzt werden kann, die Konvergenzgeschwindigkeit zu erhöhen durch Ausführung besonderer Iterationsschritte. Unter geeigneten Voraussetzungen ergibt sich für die beschleunigte Methode der konjugierten Gradienten eine (n+1)-Schritt kubische Konvergenzgeschwindigkeit. Die Konvergenzgeschwindigkeit der beschleunigten Methode der konjugierten Richtungen ist in Abhängigkeit von der Häufigkeit der besonderen Iterationsschritte entweder (n+1)-Schritt kubisch oder 2-Schritt superlinear.
    Notes: Abstract Methods of conjugate directions and reset versions of the conjugate gradient method have ann-step quadratic rate of convergence when they are applied to the unconstrained minimization of a function ofn variables. A set ofn consecutive directions of descent generated by one of these methods contains information on the function to be minimized which is used to accelerate the convergence by perorming simple special steps. Under appropriate assumptions the rate of convergence of an accelerated reset version of the conjugate gradient method is (n+1)-step cubic. Depending on the frequency of the special step the rate of convergence of the method of conjugate directions is (n+1)-step cubic or 2-step superlinear.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 70
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 119-130 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Abstract Special nonlinear control problems with fixed time duration and compact convex control domain, for which the right hand side of the process differential equation depends linearly and the cost functional nonlinearly on the state vector, will be handled. The existence and the uniqueness of optimal controls will be discussed, and very general conditions will be given, on which a gradient method basing on the so-called set of attainability can be used.
    Notes: Zusammenfassung Es werden spezielle nichtlineare Kontrollprobleme mit festem Anfangs- und Endzeitpunkt und kompaktem konvexem Steuerbereich untersucht, bei denen die rechte Seite der Prozeßdifferentialgleichung linear, das Kostenfunktional jedoch nichtlinear von dem Zustandsvektor abhängen. Neben der Diskussion der Existenz und Eindeutigkeit optimaler Steuerungen werden relativ allgemeine Bedingungen angegeben, unter denen ein auf der sogenannten erreichbaren Menge basierendes Gradientenverfahren anwendbar ist.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 71
    Electronic Resource
    Electronic Resource
    Springer
    Computing 14 (1975), S. 167-171 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Wir stellen ein Itertionsverfahren vor zur gleichzeitigen Berechnung einer Wurzel und seiner Multiplizität einer einzigen nichtlinearen Gleichung. Dieses Verfahren enthält wesentlich eine Steffenson-artige Beschleunigung eines von einem Parameter abhängigen Newton-Raphson-Prozesses, wobei dieser Parameter zwangsmäßig zur Multiplizität konvergiert.
    Notes: Abstract A second order iteration method is proposed for the simultaneous computation of a root and its multiplicity of a single nonlinear equation. This method consists essentially in a Steffenson-like acceleration of a Newton-Raphson process that depends on a parameter which is forced to converge to the multiplicity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 72
    Electronic Resource
    Electronic Resource
    Springer
    Computing 15 (1975), S. 81-86 
    ISSN: 1436-5057
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 73
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 2-2 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 74
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 2-2 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 75
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 24-24 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 76
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 25-29 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 77
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 58-58 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 78
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 154-158 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 79
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 160-160 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 80
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 262-262 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 81
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 51-56 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 82
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 36-50 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 83
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 59-59 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 84
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 61-67 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 85
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 83-86 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Conclusions For the user who desires to construct his own random number generator we have presented guidelines and design considerations for implementing the mixed congruential method. The mixed generator is illustrated using several different languages and machines. We feel that by adhering to these guidelines, a user should be able to construct a random number generator that is adequate for most applications.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 86
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 89-101 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 87
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 113-114 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 88
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 122-122 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 89
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 152-153 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 90
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 160-160 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 91
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 231-235 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 92
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 259-260 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 93
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 262-262 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 94
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 291-298 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 95
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 299-302 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 96
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 97
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 3-12 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Notes: Conclusions An overview of these results indicates that SELECT is, in general, producing results in which elicited themes parallel those produced by frequency-based word selection. More importantly —and consonant with the impetus for development of the method — SELECT is delivering factors which are larger, more easily interpretable, and more discriminable than these available from frequency data and is doing so within the constraint of basic thematic identities.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 98
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 185-185 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 99
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 197-201 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 100
    Electronic Resource
    Electronic Resource
    Springer
    Computers and the humanities 9 (1975), S. 202-206 
    ISSN: 1572-8412
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Media Resources and Communication Sciences, Journalism
    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...