| 1. |
- Andersson, Ulf
(författare)
-
Betalkort : Slutrapport
- 1980
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Idén till Universalkort uppkom för cirka tre år sedan, som en följd av ett examensarbete med namnet "ID- kort med minne". Där undersöktes möjligheten att placera ett nonvolatilt minne på ett kort. Fortsättningen på det projektet beskrivs kort under rubriken ”Existerande hårdvarusystem”.Utvecklingen av Betal- och Universalkortsidén har sedan dess bedrivits i samarbete med personal på Institutionen för Systemteknik inom ämnesområdet informationsteori vid LiTH. Jag vill rikta ett varmt tack till dessa och speciellt till Rolf Blom , Robert Forchheimer och Ingemar Ingemarsson för deras bidrag till arbetet.
|
|
| 2. |
- Lindeberg, Tony, 1964-
(författare)
-
Scale-space for discrete images
- 1989
-
Ingår i: Scandinavian Conference on Image Analysis. ; , s. 1098-1107
-
Konferensbidrag (refereegranskat)abstract
- This article addresses the formulation of a scale-space theory for one-dimensional discrete images. Two main subjects are treated:Which linear transformations remove structure in the sense that the number of local extrema (or zero-crossings) in the output image does not exceed the number of local extrema (or zero-crossings) in the original image?How should one create a multi-resolution family of representations with the property that an image at a coarser level of scale never contains more structure than an image at a finer level of scale?We propose that there is only one reasonable way to define a scale-space for discrete images comprising a continuous scale parameter, namely by (discrete) convolution with the family of kernels T(n; t) = e^{-t} I_n(t),, where $I_n$ are the modified Bessel functions of integer order. Similar arguments applied in the continuous case uniquely lead to the Gaussian kernel.Some obvious discretizations of the continuous scale-space theory are discussed in view of the results presented. An important result is that scale-space violations might occur in the family of representations generated by discrete convolution with the sampled Gaussian kernel.
|
|
| 3. |
- Maguire Jr., Gerald Q.
(författare)
-
Looking back at PACS attempts—what has happened since PACS I
- 1986
-
Ingår i: Pictorial information systems in medicine : [proceedings of the NATO Advanced Study Inst. on Pictorial Information Systems in Medicine held in Braunlage FRG, August 27 - September 7, 1984]. - 3540139214 - 0387139214 ; , s. 391-399
-
Konferensbidrag (refereegranskat)
|
|
| 4. |
- Persson, Iréne E, et al.
(författare)
-
Design Considerations of a Distributed Packet Radio Network Using the Radio Amateur Band
- 1980
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- The paper outlines an experimental radio based data network to be used by radio amateurs and computer hobbyists. Various aspects of network design is discussed with the intention to provide a foundation on which a more detailed specification can be based. Underlaying principles and qualitative rather than quantitative results are stressed.
|
|
| 5. |
- Eriksson, Lars-Henrik, et al.
(författare)
-
A programming calculus based on partial inductive definitions (with an introduction to the theory of partial inductive definitions)
- 1988. - 1
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- We present a general framework (a programming calculus) for the specification, verification and synthesis of programs. The underlying programming paradigm is similar in spirit to logic programming but based on the theory of partial inductive definitions instead of predicate logic. Within this framework we give criteria for the correctness of programs and outline a methodology for using these criteria to perform verifications and syntheses. The programming calculus permits us to use an arbitrary specification language, as long as this language itself can be defined within our framework. The program language is based on partial inductive definitions. Such definitions can be regarded as sets of an extension to Horn clauses of logic, so traditional logic (pure Prolog) programs are included as a special case. Since the theory of partial inductive definitions is not widely known, we include an introduction to it. This introduction can also be read by itself, without any interest in the programming calculus.
|
|
| 6. |
- Olsson, Pelle, et al.
(författare)
-
Boundary Modifications of the Dissipation Operators for the Three–Dimensional Euler Equations
- 1989
-
Ingår i: Journal of Scientific Computing. - 0885-7474 .- 1573-7691. ; 4:2, s. 159-195
-
Tidskriftsartikel (refereegranskat)abstract
- Explicit methods for the solution of fluid flow problems are of considerable interest in supercomputing. These methods parallelize well. The treatment of the boundaries is of particular interest with respect to both the numeric behavior of the solution and the computational efficiency. We have solved the three-dimensional Euler equations for a twisted channel using second-order, centered difference operators, and a three-stage Runge-Kutta method for the integration. Three different fourth-order dissipation operators were studied for numeric stabilization: one positive definite, one positive semidefinite, and one indefinite. The operators only differ in the treatment of the boundary. For computational efficiency all dissipation operators were designed with a constant bandwidth in matrix representation, with the bandwidth determined by the operator in the interior. The positive definite dissipation operator results in a significant growth in entropy close to the channel walls. The other operators maintain constant entropy. Several different implementations of the semidefinite operator obtained through factoring of the operator were also studied. We show the difference both in convergence rate and robustness for the different dissipation operators, and the factorizations of the operator due to Eriksson. For the simulations in this study one of the factorizations of the semidefinite operator required 70%–90% of the number of iterations required by the positive definite operator. The indefinite operator was sensitive to perturbations in the inflow boundary conditions. The simulations were performed on a 8,192 processor Connection Machine system CM-2. Full processor utilization was achieved, and a performance of 135 Mflops/sec in single precision was obtained. A performance of 1.1 Gflops/sec for a fully configured system with 65,536 processors was demonstrated.
|
|
| 7. |
|
|
| 8. |
|
|
| 9. |
|
|
| 10. |
- Emanuelson, Pär, 1949-
(författare)
-
Performance enhancement in a well-structured pattern matcher through partial evaluation
- 1980
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Partial evaluation is a technique which can be utilized for the generation of compiled code from the corresponding interpreter. In this work the partial evaluation technique is applied to a pattern match interpreter, in order to achieve the simultaneous goals of a general, well-structured program which is extendible and still make high performance at execution possible. A formal definition of pattern matching is presented, which is the basis for the interpreter. The partial evaluation technique is evaluated with respect to other techniques for implementation of pattern matchers. Control structures for pattern matching such as backtracking, generators, and recursion are presented, and the appropriateness of these for use in partial evaluation is discussed.
|
|
