Rep. comput. sci. math., B

contributor

• Åbo Akademi

hasPart

• 5-year report 1984-1989
• A calculus of refinement for program derivations
• A class of non-time-homogeneous diffusions with the 2M-X-property
• A comparison of lattice-theoretic approaches to fuzzy topology
• A computational interpretation of truth logic
• A contractivity condition for iterated function systems
• A covering structure of IS quality concepts
• A distributed election algorithm allowing process failures
• A fair and efficient implementation of CSP with output guards
• A family of orthogonal polynomials on the unit circle and approximation of transfer functions
• A fast parallel algorithm for integer sorting
• A formalization of superposition refinement
• A generalization of the Hutchinson distance and applications
• A Markov model for the broke handling system of a paper machine
• A mechanization of a command lattice with recursion
• A method for rational Chebyshev approximation of rational functions on the unit disk and on the unit interval
• A monitoring system for a transputer-based multiprocessor
• A multiprocessor system for fast geometric image transformation
• A note on products of random matrices
• A note on the semigroup of analytic mappings with a common fixed point
• A note on the stationary modification of the loglikelihood function in asymptotic continuous time system identification
• A note on the statistical identifiability of some stationary stochastic evolution equations
• A Poisson process with predictable jump times
• A programming environment for a transputer-based multiprocessor system
• A ratio limit theorem for erased branching Brownian motion
• A study in fuzzy Petri nets and the relationship to fuzzy logic programming
• A survey on software quality metrics
• A unifying framework for chaos and stochastic stability in population models
• A universal algorithm for parallel k-selection in hypercubes
• Action system with synchronous communication
• An action system approach to the steam boiler problem
• An efficient procedure for determining the enabled set
• An equioscillation characterization of finite Blaschke products
• An exchange algorithm for Laurent polynomial Chebyshev approximation on the unit circle
• An exercise in deriving parallel algorithms : Gaussian elimination
• An implementation of gasdynamic problems on multiprocessor systems
• An implementation of Monte Carlo weighting method on multiprocessor systems
• An implementation of multiprocess handshaking on transputer networks
• An implementation of the ODE block algorithms for transputer systems
• An overview of research in maintenance
• Analysis of finite uniform hashing
• Analysis of index-sequential files with overflow chaining
• Analysis of three-dimensional nuclear data on a transputer-based multiprocessor system
• Analysis of uniform hashing
• Annual report 1994
• Annual report 1995
• Annual report 1996
• Annual report 1997
• Annual report 1998
• Annual report 1999
• Användarmanual för PDPSIM och RLINK
• Asymptotic properties of a simple TCP model
• Asymptotic properties of a TCP model with time-outs
• Atomicity refinement in a refinement calculus framework
• Bestämning och uppskattning av ruinsannolikheten i den klassiska riskmodellen
• Bootstrap confidence interval of life expectancy forecasted with the Lee-Carter method
• Category theoretic properties of fuzzy topological spaces
• Centipede : a program refinement environment
• Co-operation in distributed systems using symmetric multi-process handshaking
• Combining angels, demons and miracles in program specifications
• Command lattices, variable environments and data refinement
• Communication in processor farms : a case study in reactive systems refinement
• Comparison of some non-linear autoregressive processes
• Competition and invasion in stochastic population models
• Competitive financial benchmarking using self-organizing maps
• Completions and compactifications by means of monads
• Connectedness properties of lattices
• Consensus in distributed soft environments
• Construction of large-size interconnection : networks with high performance
• Context-sensitive data refinement and provable optimized compilation
• Contributions to fuzzy convergence
• Convergence in direction of products of random matrices
• Criteria for stability of density dependent stochastic population models
• Cutting Markovian trees
• Data compression : some notes on the effects of combining two compression methods
• Data refinement and the simulation method
• Data refinement in the refinement calculus
• Data refinement with stuttering
• Decentralization of process nets with centralized control
• Deriving action systems for processor farms
• Deriving an occam implementation of action systems
• Design and implementation of full-text retrieval on transputer networks
• Developing a customisable programming environment for message passing based systems
• Diagnosis of Nephropathia epidemica by adaption through Lukasiewicz inference
• DiGraph : user's guide
• DiGraph/Occam : user's guide
• Distributed co-operation with action systems
• Doing lattice theory in higher order logic
• Duality in specification languages : a lattice-theoretical approach
• Efficient implementation of multi-process handshaking on broadcasting networks
• Election in a uni-directional ring with a variable number of processes
• Estimating software quality characteristics from maintenance costs
• Expected worst-case performance of hash files
• Exploring summation and product operators in the calculus refinement
• Extended Petri net graphs - simulation graphs, a general tool for modeling simulation designs
• Factorization of morphisms in fuzzy topology
• Fairness in action systems
• Fast parallel algorithm for finding the kth longest path in a tree
• Fast path-disjoint routing in transputer networks
• FiF'93 : fuzziness in Finland : M/S Kalypso, January 15, 1993
• Finding the k most vital edges with respect to minimum spanning tree
• Formal derivation of a distributed load balancing algorithm
• Formal methods in program construction : final report on a research project sponsored by the Academy of Finland 1982-1985
• Frequency loading and linear probing
• From action systems to modular systems
• Fuzzy filter functors and convergence
• Generalized parallel selection in sorted matrices
• Hashing with overflow indexing
• Hathi-2 : users guide, version 1.0
• Hierarchical wiring in multigrids
• Homomorphisms on C[sup infinity](E) and C[sup infinity] -bounding sets
• Hur ofta är avvikelsen mindre än standardavvikelsen - ett sannolikhetsteoretiskt extremvärdesproblem
• Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning tree
• Improved universal k-selection in hypercubes
• Invariant measures and random walks on the semigroup of matrices
• Laws of action system programming
• Laws of parallel programming with shared variables
• Lectures on stochastic difference equations
• Lectures on stochastic processes
• Linear hashing with partial expansions
• Linguistic logic programming
• List of publications 1984-1989 (incl. abstracts)
• Mapping parallel programs onto transputer networks
• Markov random walks on groups
• Measures on the semigroup of singular matrices
• Mechanising some advanced refinement concepts
• MEPP '92 : international seminar on fuzzy control through neural interpretations of fuzzy sets : Mariehamn, Åland, June 15-19, 1992
• MEPP '93 : international seminar on fuzzy control through neural interpretations of fuzzy sets : Mariehamn, Åland, June 14-18, 1993
• Millipede - a programming environment providing visual support for parallel programming
• Modeling the Hathi-2 monitoring system
• Modelling and a first realization of a tool for configuration expert system
• Models facilitating surveillance of software maintena[n]ce characteristics and optimal life time
• Models of software accumulation
• Modifikationer av Panjers rekursionsformel för stora försäkringsbestånd och diskretisering av skadefördelningen
• Multi-process handshaking on broadcasting networks
• Multiprocessor applications in the Hathi project
• Neural fuzzy logic programming
• Nodes 07 : Nordic workshop and doctoral symposium on dependability and security, Oslo, Norway, October 2007 : abstracts
• Nonlinear autoregressive processes
• Notes on an estimating functional and its efficiency of compression in a Gaussian vector statistical space
• Oberon animation system : users guide
• Occam implementation of path-disjoint routing on the Hathi-2 transputer system
• Occam implementation of process-to-processor mapping on the Hathi-2 transputer system
• Om Carathéodory-Fejér approximation
• Om stationära fördelningen för icke-linjära autoregressiva processer
• On a first passage problem of Neveu for critical and subcritical branching Brownian motions
• On asymptotic localization by perturbing operators for partial observations of a stochastic evolution equation
• On conditional Ornstein-Uhlenbeck processes
• On products of random projections
• On some properties of statistical discrimination information for linear stochastic differential systems
• On space-time excessive measures and functions of symmetric Markov processes - especially linear diffusions
• On the equivalence of Gaussian measures induced by certain linear Hilbert space valued stochastic differential equations
• On the quasi-stationary distribution of a stochastic Ricker model
• On unifying assumption-commitment style proof rules for concurrency
• One-dimensional diffusions and their exit spaces
• Optimal algorithms for generalized matrix search problem
• Parallel algorithm animation
• Parallel Monte Carlo with application to global optimization
• Performance analysis of linear hashing with partial expansions
• Performance of a distributed algorithm : a case study
• PICA - a flowchart tool for structured programming supporting proving
• PICA : a graphical program development tool
• Procedural abstraction in the refinement calculus
• Procedures and atomicity refinement
• Proceedings of the 13th IRIS : the 13th Information Systems Research Seminar in Scandinavia : August 12-15, 1990, Turku, Finland : Part 1
• Proceedings of the 13th IRIS : the 13th Information Systems Research Seminar in Scandinavia : August 12-15, 1990, Turku, Finland : Part 2
• Proceedings of the 15th Nordic Workshop on Programming Theory, NWPT'03, 29-31.10.2003 : abstracts
• Proceedings of the 5th Nordic Workshop on Program Correctness
• Program inversion in the refinement calculus
• Program refinement by theorem prover
• Programmering : från problem till dokumentation med introduction i Algol 60, Basic, Fortran IV och 77, Pascal och Simula
• Quadratic optimal control through coprime and spectral factorizations
• Quasi-stationary behaviour in a simple discrete-time model
• Recurrence and transience of correlated random walks
• Refinement calculus : Part 1, Sequential nondeterministic programs
• Refinement calculus : Part 2, Parallel and reactive programs
• Refinement concepts formalized in higher order logic
• Refining atomicy in parallel algorithms
• Repeated hashing
• Reverse engineering distributed algorithms
• RMC : a length-independent measure of software complexity
• Self-adjusting mapping : a heuristic mapping algorithm for mapping parallel programs onto transputer networks
• Separation axioms for partially ordered convergence spaces
• Sequences of random transformations
• Simulation graphs, a non-procedural approach to simulation
• Simulation modelling
• Some notes on topological recurrence
• Specialization in logic programming : from Horn Clause Logic to Prolog and Concurrent Prolog
• Specification and implementation of a simple message passing system using TLA
• Specification of a microprocessor
• Specification of a program derivation editor
• Stability classification of a Ricker model with two random parameters
• Statement inversion and strongest postcondition
• Stationära fördelningar för autoregressiva processer med begränsad styrsignal
• Statistical spaces of Gaussian measures on a Hilbert space and their ellipsoids of variance
• Stepwise derivation of a parallel matrix multiplication algorithm
• Stepwise refinement of action systems
• Stepwise refinement of communicating systems
• Stepwise refinement of parallel algorithms
• Stepwise removal of virtual channels in distributed algorithms : a case study
• Structured programming using program flowcharts containing explicite representation of data including assertions
• Superposition refinement of reactive systems
• Synthesis of programs in the framework of partial deduction
• The 3-dimensional Bessel process and Brownian motion
• The Hathi project : a research project on parallel programming technology : 1986-1988 (final report)
• The Hathi-2 : multiprocessor system
• The lattice of data refinement
• TkWinHOL : a tool for doing window inference in HOL
• Topographical global optimization
• Topographical global optimization for constrained problems
• Trace refinement of action systems
• Traces, histories and streams in the semantics of nondeterministic data flow
• Transforming communication topology in distributed algorithms
• Transputer benchmark tests
• Verification of a distributed algorithm due to Chu
• Verifying modular reactive programs
• Åbo akademi, Department of Computer Science : Annual report 1989,1990

inLanguage

• en
• mul
• sv

isPartOf

• Fennica

issn

• 0358-0563
• 0358-3392
• 1235-7502
• 1235-7839
• 1235-7839.

name

• Rapp. Åbo Akad., Inf.behandl. mat., A
• Rapp. Åbo Akad., Inf.behandl. mat., B
• Rapporter från Åbo akademi, infomationsbehandling & matematik
• Rapporter från Åbo akademi, informationsbehandling & matematik
• Rapporter från Åbo Akademi, informationsbehandling & matematik : Serie B
• Rapporter från Åbo Akademi, informationsbehandling & matematik. A
• Rapporter från Åbo Akademi, informationsbehandling & matematik. Ser. A
• Rapporter från Åbo Akademi. Informationsbehandling & matematik : Ser. A
• Rapporter från Åbo Akademi. Informationsbehandling & matematik. Ser. A
• Rapporter från Åbo akademi. Informationsbehandling & matematik. Ser. A
• Rapporter från Åbo Akademi. Informationsbehandling & matematik. Ser. B
• Rapporter från Åbo akademi. Informationsbehandling & matematik. Ser. B
• Rapporter från Åbo Akademi. Informationsbehandling & matematik. Serie B
• Rapporter från Åbo akademi. Informationsbehandling & matematik. Serie B
• Rep. comput. sci. math., A
• Rep. comput. sci. math., B
• Reports on computer science & mathematics / Åbo Akademi. Ser. A
• Reports on Computer Science & Mathematics / Åbo Akademi. Ser. B
• Reports on computer science & mathematics / Åbo Akademi. Ser. B
• Reports on computer science & mathematics : Ser. A
• Reports on computer science & mathematics : Ser. B
• Reports on computer science & mathematics : Ser. B / Åbo Akademi
• Reports on computer science & mathematics. Ser. A
• Reports on computer science & mathematics. Ser. B
• Reports on computer science & mathematics. Ser. B / Åbo Akademi
• Reports on computer science and mathematics : Ser. A / Åbo Akademi
• Reports on computer science and mathematics : Ser. B

P60049

• <http://rdaregistry.info/termList/RDAContentType/1020>

sameAs

• <https://issn.org/resource/issn/0358-0563>
• <https://issn.org/resource/issn/0358-3392>
• <https://issn.org/resource/issn/1235-7502>
• <https://issn.org/resource/issn/1235-7839>

Instances

• 1978/1991 : Åbo Akademi
• 1980/1991 : Åbo Akademi
• 1991- : Åbo Akademi
• 1992/.. : Åbo Akademi