TUCS general publication

contributor

• Turun tietotekniikan tutkimus- ja koulutuskeskus

hasPart

• ([delta], *)-equality of fuzzy sets
• (G)PCP for words of length at most two
• 2-testability and relabelings produce every[t]hing
• 9th International Conference, Spice 2009, Turku, Finland, June 2009 : proceedings
• A browsable format for proof presentation
• A case study in balanced software process development
• A case study in requirement analysis of control systems using UML and B
• A characterization of the periodicity of bi-infinite words
• A combinatorial view on gene assembly
• A comparison of group and minimum setup strategies in PCB assembly
• A continuously processed business game construction for business process training
• A cooperative usability evaluation of the Domino software
• A formal model-driven approach to requirements engineering
• A fuzzy analysis of a Richter theorem in fuzzy consumers
• A fuzzy approach for mining quantitative association rules
• A generic deep copy algorithm for MOF-based models
• A greedy I/O scheduling method in the storage system of clusters
• A healthcare case study : Fillwell
• A hierarchical slice-based framework for object-oriented coupling measurement
• A Kleene-Schützenberger theorem for Lindenmayerian rational power series
• A language for modeling network availability
• A lower bound for a constant in Shallit's conjecture
• A mapping language from models to XMI[DI] diagrams
• A mathematica-package for algebraic braid groups
• A metatool for exploring program algebras
• A method for computing the characteristic polynomial and determining semidefiniteness
• A method for elicitating and combining group preferences for stochastic multicriteria acceptability analysis
• A methodology for co-design based on a healthcare case study
• A methodology for integration of formal methods in a healthcare case study
• A model of a snorer's upper airway
• A MOF-based metamodel for SA/RT
• A neural network model for estrogen receptor status prediction
• A neural network model for prediction : architecture and training analysis
• A new bound for the sequence equivalence problem of polynomial D0L systems
• A new class of algebraic series having a decidable equivalence problem
• A note on slender 0L languages
• A note on the proof of Cobham's theorem
• A note on uniform HDT0L systems
• A parallel genetic algorithm for clustering
• A plea for grey-box components
• A polynomial bound for certain cases of the D0L sequence equivalence problem
• A possibilistic approach to selecting portfolios with highest utility score
• A prototype-matching system for scientific abstract collection semantic clustering
• A python specification of the Tkinter Text-widget
• A query language with the star operator
• A relation between context-free grammars and meta object facility metamodels
• A retraining improvement of feedforward neural networks
• A review on networking and multiplayer computer games
• A short solution for the HDT0L sequence equivalence problem
• A simple and efficient Tabu search heuristics for Kirkman Schoolgirl Problem
• A simple P-complete language and its specification by language equations
• A statistical approach for characterising local binary patterns
• A strategic information system in the public sector : a major opportunity with several small ordinary barries
• A system for measuring application level quality of service in a DVB-H network
• A theory of prioritizing composition
• A tool for data refinement
• A toolkit for manipulating UML models
• A topological approach to distributed computing
• A unifying study between modal-like operators, topologies, and fuzzy sets
• A variant of dynamic programming algorithm for unit commitment optimization in combined heat and power production planning
• A wrap error attack against NTRUEncrypt
• About Duval's conjecture
• Abstracts : 14-16.10.1998, Mauno Koivisto Center, Turku, Finland
• Action systems in pipelined processor design
• Action systems synthesis of DI circuits
• Action systems with continuous behaviour
• Adding type-bound actions to action-oberon
• Adjustment of the human respiratory system to increased upper airway resistance during sleep
• Advanced data forecasting using retraining neural network technique
• Algebraic characterization of the finite power property
• Algebraic methods in the design of space-time codes
• An adaptive hybrid GA for the 3-matching problem
• An adaptive retraining technique to predict the critical process variables
• An analytic approach for obtaining maximal entropy OWA operator weights
• An approach to object-orientation in action systems
• An asynchronous linear predictive analyzer
• An effective heuristic for combined heat and power production planning with power ramp-rate constraints
• An efficient envelope-based branch and bound algorithm for combined heat and power production planning under the deregulated power market
• An efficient linear model and optimization algorithm for nation-wide combined heat and power production
• An efficient linear model and optimization algorithm for trigeneration
• An elementary proof for the non-parametrizability of the equation xyz=zvx
• An energy consumption model for Java virtual machine
• An experiment on extreme programming and stepwise feature introduction
• An extension of Event B for developing grid systems
• An inequality for occurences of subwords
• An infinite hierarchy of mildly context-sensitive families of languages
• An integrated project management information system
• An interactive system for scheduling jobs in electronic assembly
• An overview of software defined radio technologies
• An UML profile for action systems
• An undecidability result concerning periodic morphisms
• Analysing financial performance with quarterly data using self-organising maps
• Analysis and simulation of DVB-H link layer
• Annual report 1996
• Annual report 1997
• Annual report 1998
• Annual report 1999
• Annual report 2000-2001
• Annual report 2002
• Application of some recent stochastic global optimization algorithms to practical problems
• Applications for the SPIN model checker : a survey
• Applying the EM-algorithm to classification of bacteria
• Approaches to using e- and m-business components in companies
• Arrow axiom and full rationality for fuzzy choice functions
• Artificial neural network models for predicting patterns in auditing monthly balances
• Artificial neural networks in auditing : state of the art
• Associative and fair shuffle of omega-words
• Associative shuffle of infinite words
• Asynchronous Viterbi decoder in action systems
• Automated detection of differentially expressed fragments in mRNA differential display
• Automatic sequences and their shuffles
• Autonomy of group work : the realm of work groups and information systems
• Background knowledge in GA-based concept learning
• Benchmarking international pulp and paper companies using self-organizing maps
• Binary (generalized) post correspondence problem is in P
• Binary self-adding sequences and languages
• Binary words with few squares
• Binary Z[sub 4]-linear codes and sequences
• BinClass : a software package for classifying binary vectors user's guide
• Border correlation of binary words
• Bounding the indegree of spiking neural P systems
• Building and managing an electronic commerce system - case PC-SuperStore
• Calculation of elevator round-trip time for the collective control algorithm in general traffic situations
• CBISA - a DSS for analysing a company's information security : a tool for decreasing uncertainty
• Centre for Reliable Software Technology : a Centre of Excellence for Formal Methods in Programming : progress report 2003
• Characterization of a word by its subwords
• Characterization of infinite solutions of marked and binary post correspondence problems
• Characterizations of recursively enumerable languages by usigng copy languages
• Checking timing Petri nets for linear duration properties
• Chomsky-Schutzenberger-type representations of poly-slender context-free languages
• Choosing bankruptcy predictors using discriminant analysis, logit analysis and genetic algorithms
• Class refinement as Semantics of correct object substitutability
• Class refinement as Semantics of correct subclassing
• Classification of apples according to physiological status measured by fluorescence imaging
• Classifying alternatives in SMAA using cross confidence factors
• Classifying apples by the means of fluorescence imaging
• Clustering by adaptive local search with multiple search strategies
• Codes and equations on trees
• Collapsing hierarchies in parallel communicating grammar systems with communication by command
• Combinatorial and computational problems of finite sets of words
• Combinatorics of words
• Combinatorics on infinite words
• Combinatorics on Words : a new challenging topic
• Combinatorics on words : a tutorial
• Communication complexity method for measuring nondeterminism in finite automata
• Commutation with codes
• Compatible extensions of fuzzy relations
• Compile time recursive objects in C++
• Compile time sparse vectors in C++
• Complete finite automata network graphs with minimal number of edges
• Complexity measures for gene assembly
• Component-based asynchronous circuit design in B
• Component-oriented development of action systems
• Components vs. objects
• Composition sequences for functions over a finite domain
• Compositional action system refinement
• Compositions over a finite domain : from completeness to synchronizable automata
• Computation of profile-likehood-based confidence intervals in hidden Markov models
• Computation of restricted maximum-penalized-likelihood estimates in hidden Markov models
• Computation of standard errors for maximum-likelihood estimates in hidden Markov models
• Computational efficiency of intermoleculare gene assembly
• Computational power of intramolecular gene assembly
• Computer support for information security analysis in a small business environment
• Computing by commuting
• Computing partial information out of intractable : powers of algebraic numbers as an example
• Computing partial information out of uncomputable one : the first digit of 2[sup n] at base 3 as an example
• Computing through gene assembly
• Computing with membranes
• Computing with quanta : impacts of quantum theory on computation
• Computing with shapes
• Congestion and dimensioning characterizations by economical factors
• Congruence preserving functions of Wilke's tree algebras
• Connections between subwords and certain matrix mappings
• Considerations when using gene expression microarray data to diagnostic classification
• Context handling in the Refinement Calculus framework
• Contexts on trajectories
• Contextual grammars versus natural languages
• Contextual grammars with distributed catenation and shuffle
• Contracts as mathematical entities in programming logic
• Contracts, games and refinement
• Coordination among mobile objects
• Coordination in the ImpUnity framework
• Copying quantum computer makes NP-complete problems tractable
• Correcting distortions in 2D gels : a survey
• Correctness and refinement of dually nondeterministic programs
• Counting (scattered) subwords
• Counting bordered and primitive words with a fixed weight
• Crest, Centre for Reliable Software Technology : progress report 2002-2003
• Crest, Centre for Reliable Software Technology : progress report 2004-2005
• Crossing-over on languages : a formal representation of the recombination of genes in a chromosome
• Data mining in maintenance of electronic component libraries
• Data refinement of remote procedures
• Decidability and undecidability of marked PCP
• Decidability of binary infinite post correspondence problem
• Decidable and undecidable problems in matrix theory
• Decision problems concerning a power series generalization of DT0L systems
• Decision problems concerning prime words and languages of the PCP
• Decision problems concerning thinness and slenderness of formal languages
• Decision questions concerning semilinearity, morphisms and commutation of languages
• Decision questions on integer matrices
• Defect theorems for trees
• Defect theorems with compatibility relation
• Degree of dominance and congruence axioms for fuzzy choice functions
• Dense full-diversity matrix lattices for four transmit antenna MISO channel
• Deriving control programs by weakest preconditions
• Deriving distributed systems using B-method
• Descriptive statistics on companies in the forest products industry
• Detection of high-frequency respiratory movements during sleep
• Determining the proper number of software licenses
• Developing cloud software : algorithms, applications, and tools
• Developing components in the presence of re-entrance
• Developing control systems : a method and a case study
• Developing object-based distributed systems
• Development of fault tolerant grid applications using distributed B
• Developmental languages versus DNA computing
• Difference and union of models
• Differential equations as actions ; M. Rönkkö, A. P. Ravn
• Digital libraries : a human centred study of computerisation in a Finnish academic library
• Digital sound recorder : a case study on designing embedded systems using the UML notation
• Distributed object-based control systems
• Distributed service composition
• Distributed system development in B
• DNA complementarity and paradigms of computing
• DNA computing, matching systems, and universality
• Does fragmentation of working time and working space influence the acceptance of mobile technology? : a case of Finnish physicians
• DOGMA : a GA-based relational learner
• Doing high school mathematics carefully
• Duval's conjecture and Lyndon words
• Easy cases of the D0L sequence equivalence problem
• Efficient algorithms for optimizing combined heat and power production under the electricity market
• Efficient implementation of stochastic multicriteria acceptability analysis
• Efficient interconnect modeling for SoC systems with application to interconnection delay estimation
• Efficient scalar multiplication on elliptic curves
• Efficient state space search for time Petri nets
• Embedding linear orders in grids
• Embeddings of canonical Kirkman packing designs
• Encoding, decoding and data refinement
• Enforcing behavior with contracts
• Enhancing dependability via parameterized refinement
• Ensuring correctness of Java frameworks : a formal look at JCF
• Equality sets for recursively enumerable languages
• Equality sets of prefix morphisms and regular star languages
• Estimated time of arrival (ETA) based elevator group control algorithm with more accurate estimation
• Estimating the production times in PCB assembly
• Evaluating the XP customer model and design by contract
• Evaluation of DVB-H broadcast systems using new radio channel models
• Evolution of dispersal in a structured metapopulation model in discrete time
• Evolution of specialization on resource utilization in structured metapopulations
• Evolutionary branching of dispersal strategies in structured metapopulations
• Examples of undecidable problems for 2-generator matrix semigroups
• Examples on parallel complexity of signed graphs
• Experience on using stepwise feature introduction in software construction
• Explicit universal splicing
• Exploitation of association rules in updating of electronic component libraries
• Exploring the limits of support systems
• Factors affecting end-user computing skills
• Families of optimal codes for strong identification
• Fast implementation of the exact PNN algorithm
• Fault tolerance in a layered architecture : a general specification pattern in B
• Fault-tolerant wavelength allocation in all-optical hypercubes
• Feasibility report on asynchronous synthesis
• Feature learning with a genetic algorithm for fluorescence fingerprinting of plant species
• Field tests of the structured derivations method
• Filtering bad quality tandem mass spectra prior to protein identification
• Financial benchmarking of telecommunications companies
• Financial benchmarking tools in Finnish companies : a state of the art survey
• Finite metrics in switching classes
• Finite sets of words and computing (a survey)
• Finite substitutions and integer weighted finite automata
• Fixed point approach to commutation of languages
• Flexibility in investments : exploratory survey on how Finnish companies deal with flexibility in capital budgeting
• Formal channel based modeling of SoC systems
• Formal derivation of an on-chip communication platform
• Formal development of dynamically adaptable fault tolerant systems
• Formal development of mechanisms for tolerating transient faults
• Formal development of software for tolerating transient faults
• Formal energy estimation framework
• Formal model-driven development of communicating systems
• Formal properties of gene assembly : equivalence problem for overlap graphs
• Formal semantics of inheritance and object substitutability
• Formal service-oriented development of fault tolerant communicating systems
• Formal service-oriented development of fault tolerant systems
• Formal specification and refinement of a write blocker system for digital forensics
• Formal specification of an asynchronous on-chip bus
• Formal transformation of platform independent models into platform specific models in MDA
• Formal verification of a ubiquitous hardware component
• Formal verification of consistency in model-driven development of distributed communicating systems and communication protocols
• Formalising UML use cases in the refinement calculus
• Formalized mathematics
• Formalizing programming variables in process algebra
• Foundations of Computer Security : affiliated with LICS'04 and ICALP'04, Turku, Finland, July 12-13, 2004 : proceedings
• Freeness of multiplicative matrix semigroups
• From DNA recombination to DNA computing via formal languages
• From Kleene algebra to refinement algebra
• From Watson-Crick L systems to Darwinian P systems
• Functional and object-oriented modeling of embedded software
• Functional procedures in higher-order logic
• Fuzzy approach for modeling multiple criteria in the job grouping problem
• Fuzzy chance constrained linear programming based scrap charge optimization in steel production
• Fuzzy partitioning of quantitative attribute domains by a cluster goodness index
• Fuzzy real investment valuation model for giga-investments, and a note on giga-investment lifecycle and valuation
• Fuzzy reasoning and fuzzy optimization
• Fuzzy structural distance
• Gene assembly in ciliates : formal frameworks
• Gene assembly in ciliates : molecular operations
• Generalized factorizations of words and their algorithmic properties
• Generalized factors of words
• Generalized PCP is decidable for marked morphisms
• Generating strings by replication : a simple case
• Generic wrapping
• Genetic algorithm approach for the three-matching problem
• Global asymptotical stability of the non-trivial steady state of an epidemic model
• Governmental visions for future info-communication : a survey of the European Union, the United States and Japan
• Grammars working on layered strings
• Grouping and sequencing PCB assembly jobs with minimum feeder setups
• Grouping of PCB assembly jobs in the case of flexible feeder units
• Grouping PCB assembly jobs with typed component feeder units
• Growth functions and length sets of replicating systems
• Handshaking expansion as action system refinement
• Hazard analysis in formal specification
• Health and wealth through knowledge : information system solutions in the health care sector
• Heuristic algorithms for the Euclidean three-matching problem
• High level power estimation
• High-quality audio formats
• History of Nordic computing - HiNC2 : extended abstracts : IFIP WG9.7 Second Working Conference on the History of Nordic Computing, August 21-23, 2007, Turku, Finland
• How the inclusion of time creates complexity in dynamic decision-making environments
• Hybrid action systems
• ICT and services : combining views from IS and service research : proceedings of the post-graduate seminar : May 5-6, 2003, Turku, Finland
• Implementation of synchronous action systems
• Improved matrix pair undecidability results
• Improved undecidability results on the emptiness problem of probabilistic and quantum cut-point languages
• Improving investment decision : making by expanding key knowledge with real option tools
• Improving missing value estimation in microarray data with gene ontology
• Improving the engineering process area at Ericsson with agile practices : a case study
• Improving the pickups of components on a gantry-type placement machine
• In search for differencies - has the distinction between products and services on the internet become obsolete?
• Increasing business-relevancy to the IT service product with the support of packaging of IT services
• Increasing production efficiency by grouping PCB assembly jobs
• Incremental software construction with refinement diagrams
• Independence of certain quantities indicating subword occurrences
• Individual adoption of IS in organisations : a literature review of technology acceptance model
• Individual adoption of IS in organisations : a literature review of the intention-based theories
• Infinite solutions of marked post correspondence problem
• Information systems day
• Information technology artefacts and services they provide
• Information technology mediated activities in organizational contexts : a case of strategic information systems planning
• Inspiratory flow shape clustering (IFSC) : an automated method to monitor upper airway performance during sleep
• Integer weighted finite automata, matrices and formal power series over Laurent polynomials
• Integrated program generation system for a PC-board assembly line
• Integrating combined heat and power production and CO[sub 2] emissions trading planning
• Intelligent systems and active DSS : abstracts of the IFORS SPC-9 Conference 25-27 April 1999, Turku, Finland
• Interaction properties of relational periods
• Interactive information service for wellness support : a research agenda
• Internal structure of an enhanced Java execution engine
• Interpreting nondeterminism in the refinement calculus
• Intranet and active DSS : instruments for corporate success
• Invariant based programming revisited
• Invariants of gene assembly in stichotrichous ciliates
• Invest in IT but don't forget the organisation
• Investment planning : an introduction
• IS requirements and work transformation
• Issues on the design of an XML-based configuration management system for model driven engineering
• Iterated GSM mappings : a collapsing hierarchy
• Iterated morphisms with complementarity on the DNA alphabet
• Iterative split-and-merge algorithm for VQ codebook generation
• Java needs compound types
• Job grouping in surface mounted component printing
• Job ordering and management of wearing tools in flexible manufacturing
• Lagrangian relaxation based trigeneration planning with storages
• Language-theoretic aspects of DNA complementarity
• Languages accepted by integer weighted finite automata
• Languages defined by generalized equality sets
• Languages obtained from infinite words
• Languages with finite antidictionaries : growth rates and graph properties
• Largest solutions of left-linear language inequalities
• Layering distributed algorithms
• Likelihood based statistical inference in hidden Markov models
• Linear hybrid action systems
• Linear size test sets for certain commutative languages
• Linguistic optimization under Goetschel-Voxman defuzzification
• Linking personalization of information system to managerial productivity
• Locally periodic infinite words and a chaotic behaviour
• Making sence of the business environment with the help of intelligent agents
• Many-valyed truth functions, Ĉerný's conjecture and road coloring
• Matematiikan johtaminen luonnollisten lukujen teoriasta
• Matrix indicators for subword occurrences and ambiguity
• Maximal orders in the design of dense space-time lattice codes
• Mechanical verification of mutually recursive procedures for parsing expressions using separation logic
• Mechanical verification of recursive procedures manipulating pointers using separation logic
• Mechanising procedures in HOL
• Membrane computing with external output
• Minimal Duval extensions
• Minimising the number of tool switches with tools of different sizes
• Minimizing the number of pickups on a multi-head placement machine
• Mining textual contents of quarterly reports
• Mining weighted association rules for fuzzy quantitative items
• MIS - shaped or misshaped? : emerging issues in the new global arena : proceedings of the IFIP WG 8.7 working conference, December 13, 1998, Helsinki, Finland
• ML-style tuple assignment in standard C++ : extending the multiple return value formalism
• Mobile ambients and P-systems
• Mobile components as topological action systems
• Mode-automata in Simulink/Stateflow
• Model interchange using OMG standards
• Model refactorings as rule-based update transformations
• Modeling component environments and interactive programs using iterative choice
• Modeling SoC systems with flow control
• Modelling dependent uncertainties by multivariate gaussian distributions in SMAA
• Modelling simple operations for gene assembly
• Morphisms
• Multidimensional data visualization techniques for financial performance data : a review
• Multiparty communication complexity : very hard functions
• Multiple factorizations of words and defect effect
• Navigating the fragmented innovation landscape : proceedings of the Third International Conference on Well-being in the Information Society (WIS 2010)
• Necessary and sufficient conditions for evolutionary suicide
• Network on chip routing algorithms
• Networks of evolutionary processors with two nodes are unpredictable
• Networks of Watson-Crick D0L systems
• New bounds on covering radius as a function of dual distance
• New infinite families of 3-designs from the Z[sub4]-Goethals codes
• Nine open problems on conjunctive and Boolean grammars
• Non-convex power plant modelling in energy optimisation
• Note : an algorithm for contour-based region filling
• NWPT'10
• OB(PN)[sup 2] : an object based Petri net programming notation
• On a geometric problem of Zig-Zags
• On algebraic decoding of the Z[sub4]-linear Goethals-like codes
• On algebraicness of D0L power series
• On an extension of the Parikh mapping
• On binary cyclic codes with d=3
• On chains of world equations and test sets
• On codes identifying sets of vertices in Hamming spaces
• On communications protocols and their characteristics relevant to designing protocol processing hardware
• On commutation and primitive roots of codes
• On computational complexity of contextual languages
• On conjugacy of languages
• On constrained OWA aggregations
• On cooperatively distributed ciphering and hashing
• On D0L and HDT0L sets in monoids
• On D0L power series
• On D0L power series over various semirings
• On defect effect of bi-infinite words
• On designing for modularity
• On different constrains on three and four words
• On distributed computing on elliptic curves
• On estimating the covering radius with the aid of the dual distance
• On Fatou properties of rational languages
• On fault tolerance techniques towards nanoscale circuits and systems
• On finite automaton public key cryptosystems
• On formal power series generated by Lindenmayer systems
• On fuzzy internal rate of return
• On fuzzy real option valuation
• On guards and symbol dependencies in substring search
• On images of D0L and DT0L power series
• On intermediate factorial languages
• On language equations with complementation
• On language equations with one-sided concatenation
• On language equations with symmetric difference
• On language inequalities XK [subset equal] LX
• On languages defined by numerical parameters
• On lengths of words in context-free languages
• On locating-dominating codes in binary Hamming spaces
• On marked post correspondence problem
• On Markov's undecidability theorem for integer matrices
• On N-algebraic power series having polynomial growths
• On obtaining minimal variability OWA operator weights
• On Parikh slender context-free languages
• On possibilistic Cauchy-Schwartz inequality
• On possibilistic dependencies
• On possibilistic mean value and variance of fuzzy numbers
• On quantum computation
• On quasi orders of words and the confluence property
• On semilinearity in formal power series
• On sequences defined by D0L power series
• On slender 0L languages over the binary alphabet
• On solving single machine optimization problems in electronics assembly
• On some misconceptions about adaptive dynamics
• On some problems of Mateescu concerning subword occurrences
• On some special equations on words
• On sparse 0L languages over the binary alphabet
• On splitting and cloning agents
• On strongly context-free languages
• On strongly identifying codes
• On the 3-matching problem
• On the axioms of revealed preference in fuzzy consumers theory
• On the centralizer of a finite set
• On the computation of the class numbers of real abelian fields
• On the computational analysis of gene expression microarray data
• On the computational complexity of infinite words
• On the crossover distance
• On the decidability of the freeness of matrix semigroups
• On the decomposition of finite languages
• On the density of critical factorizations
• On the equation x[sup k]=z[sub 1][sup k[sub 1]]z[sub 2][sup k[sub 2]]...z[sub n][sup k[sub n]] in a free semigroup
• On the equivalence of finite substitutions and transducers
• On the equivalence problem of context-free and DTOL languages
• On the exact solution of the three-matching problem
• On the expressibility of languages by word equations with a bounded number of variables
• On the formulation and analysis of general deterministic structured population models : 2, Nonlinear theory
• On the generating function of discrete Chebyshev polynomials
• On the generative capacity of parallel communicating grammar systems with regular components
• On the independence of equations in three variables
• On the organization of multisegmented bus
• On the power of membrane computing
• On the power of parallel communicating Watson-Crick automata systems
• On the probability of undetected error for binary codes used for combined correction and detection
• On the satisfiability problem for word equations
• On the scheduling of a multipurpose laboratory analysis instrument
• On the sentence valuations in a semiring : an approach to the study of synonymy
• On the stability of pallet loading layouts
• On the state complexity of reversals of regular languages
• On the structure of rough approximations
• On the tiling problem and reversible cellular automata
• On the tool switching problem of flexible machines
• On the work process organization of surface mounted component printing
• On unique factorizations of primitive words
• On weighted possibilistic mean and variance of fuzzy numbers
• On-chip communications models
• Optimal harvesting in the presence of density - dependent extinction probabilities
• Optimal linear identifying codes
• Optimisation based black-box testing of assertions in Simulink models
• Optimization with linguistic variables
• Optimized manufacturing processes in multimodel PCB assembly (long version)
• Optimizing proof search in model elimination
• Packaging of IT services
• Parallel composition of words with re-entrant symbols
• Parallelism in gene assembly
• Parikh's theorem does not hold for multiplicities
• Pattern languages versus parallel communicating grammar systems
• Pattern matching problems for 2-dimensional images described by finite automata
• Peer-to-peer networking with firewalls
• People and computers : twenty-one ways of looking at information systems
• Performance evaluation and modeling of peer-to-peer systems over mobile ad hoc networks
• Periodic and Sturmian languages
• Periodicity and unbordered words
• Periods and binary words
• Periods in extensions of words
• Perspectives on and prospects for software agent systems
• Piecewise testable tree languages
• PM-colonies
• Polynomial languages with finite antidictionaries
• Polynomial versus exponential growth in repetition-free binary words
• Positive varieties of tree languages
• Positivity of second order linear recurrent sequences
• Post correspondence problem for morphisms with unique blocks
• Power and size of extended Watson-Crick L systems
• Probabilistic models for bacterial taxonomy
• Proceedings of COMPMOD 2008 : Workshop on Computational Models for Cell Processes, May 27, 2008, Turku, Finland
• Proceedings of Conference on Algorithmic Number Theory 2007
• Proceedings of DMCS'04, Workshop on Discrete Models for Complex Systems, July 10, 2004, Turku, Finland
• Proceedings of Doctoral Symposium held in conjunction with Formal Methods 2008 : May 27, 2008, Turku, Finland
• Proceedings of Koli Calling 2005 : Fifth Koli Calling Conference on Computer Science Education, November 17-20, 2005, Koli, Finland
• Proceedings of Louhi'08 : the first Conference on Text and Data Mining of Clinical Documents, September 3rd-4th, 2008, Turku, Finland
• Proceedings of MOMPES'04
• Proceedings of MOMPES'05 : 2nd International Workshop on Model-Based Methodologies for Pervasive and Embedded Software, June 6, 2005 Rennes, France
• Proceedings of Next 2008 : the fifth International New Exploratory Technologies Conference, August 20th-22nd, 2008, Turku, Finland
• Proceedings of NWPER'2004 : 11th Nordic Workshop on Programming and Software Development Tools and Techniques, August 17-19, 2004, Turku, Finland
• Proceedings of NWUML'2004, 2nd Nordic Workshop on the Unified Modeling Language, August 19-20, 2004, Turku, Finland
• Proceedings of SMBM 2008 : the Third International Symposium on Semantic Mining in Biomedicine : September 1st-3rd, 2008, Turku, Finland
• Proceedings of the 14th International Conference on Telework - ITA 2009 : 26-28th of August 2009 Pori, Finland
• Proceedings of the 2nd International Workshop on Quantum Programming Languages, July 12-13, Turku, Finland
• Proceedings of the 3rd Nordic EWM Summer School for PhD students in mathematics
• Proceedings of the first European Doctoral Seminar on Strategic Information Management
• Proceedings of the Second International Workshop on Component-Oriented Programming (WCOP '97)
• Proceedings of the Third International Workshop on Component-Oriented Programming (WCOP '98)
• Proceedings of WORDS'03
• Products in the refinement calculus
• Programs on product spaces
• Promoting health in urban living : proceedings of the Second International Conference on Well-being in the Information Society (WIS 2008)
• Proving isomorphism of first-order logic proof systems in HOL
• Quantum error correction
• Rational and congruous fuzzy consumers
• Rational approximations of polynomial factorial languages
• Rational, linear and algebraic languages with mix operation
• Realizing a model driven engineering process
• Reallocation of GLA codevectors for evading local minimum
• Reasoning about pointers in refinement calculus
• Reasoning about recursive procedures with parameters
• Reconfigurable hardware : a case study in codesign
• Recurrent construction of MacWilliams and Chebyshev matrices
• Redesigning the service concept for the age of the internet
• Reduction theorem for weighted grouping problems
• Refinement algebra extended with operators for enabledness and termination
• Refinement and continuous behaviour
• Refinement of atomic communication channels towards on-chip implementation
• Refinement of fault tolerant control systems in B
• Refinement of recursive procedures with parameters in PVS
• Refining concurrent objects
• Refining for safety
• Refining reactive systems in HOL using action system[s]
• Region based allocation in Java
• Relational codes of words
• Relevance ranking of intensive care nursing narratives
• Relying on autonomous multipath routing to achieve global load balancing in the Internet
• Results concerning E0L and C0L power series
• Results concerning thinness of D0L languages
• Rethinking software updating : concepts for improved updatability
• Role-based interpretation of ISs
• Scheduling algorithms for computer-aided line balancing in printed circuit board assembly
• Secret sharing schemes with nice access structures
• Secure multiparty computations without computers
• Segmentation and intensity correction of breast region in digitized mammograms
• Segmenting bones from wristhand radiographs
• Selecting the nozzle assortment for a Gantry-type placement machine
• Self-activating P systems
• Self-adaptive genetic algorithm for clustering
• Self-assembly as a string-based operation
• Sewing contexts and mildly context-sensitive languages
• Shuffle on trajectories : a simplified approach to the Schützenberger product and related operations
• Shuffle on trajectories : syntactic constraints
• Signaling techniques for NoC
• Simple gene assembly is deterministic
• Simple operations for gene assembly
• Simple words in equality sets
• Simulating project progress
• Singling out ill-fit items in a classification : application to the taxonomy of enterobacteriaceae
• Skolem's problem : on the border between decidability and undecidability
• SL - a structural hardware design language for the XC6216
• Slender context-free languages are strongly linear
• Software architectures for coordinated distributed systems
• Software construction by stepwise feature introduction
• Software development and experimentation in an academic environment : the Gaudi experience
• Some new results on post correspondence problem and its modifications
• Some open problems in combinatorics of words and related areas
• Sorting permutations on two parallel stacks
• Space-time codes from groups
• Space-time lattice codes from algebraic number fields
• Specification variables : between the angel and the demon
• Specifying safety-related hazards formally
• Split algorithms for sets of high-dimensional objects
• Stepwise development of peer-to-peer systems
• Stochastic global optimization : problem classes and solution techniques
• Stochastic multicriteria acceptability analysis using achievement functions
• Structured derivations : a method for doing high-school mathematics carefully
• Subset and union properties in modeling languages
• Subword balance in binary words, languages and sequences
• Subword conditions and subword histories
• Subword histories and Parikh matrices
• Subwords and power-free words are not expressible by word Equations
• Supplementary proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics : TPHOLs'96
• Switches and jumps in hybrid action systems
• Symbolic simulation of hybrid systems
• Synchronization of action systems
• Synchronization of finite automata : contributions to an old problem
• Synchronous action systems
• Synchronous pipeline design in action systems
• Szilard languages associated to parallel communicating grammar systems
• TACO IPv6 router : a case study in protocol processor design
• Taking articulation work seriously : an activity theoretical approach
• Teleworking environments : proceedings of the Third International Workshop on Telework, September 1-4, Turku, Finland
• Testing and verifying invariant based programs in the SOCOS environment
• Testing different sharing methods in concept learning
• Testing for periodicity in signals : an application to detect partial upper airway obstruction during sleep
• Testing the efficiency of pairwise comparison methods in discrete multiple criteria problems
• The commutation of finite sets : a challenging problem
• The commutation with codes and ternary sets of words
• The commutation with ternary sets of words
• The comparison of lossless compression methods in the case of a medical image database
• The compression of subsegments of images described by finite automata
• The cost-benefit approach to medical information systems evaluation
• The decidability of the generalized confluence problem for context-free languages
• The DF0L language equivalence problem
• The difference operation on semilinear power series
• The diffusion of internet business and the renaissance of conventional wisdom
• The effect of sample size on different failure prediction methods
• The equation a[sup M]=b[sup N]c[sup P] in a free semigroup
• The expressibility of languages and relations by word equations
• The fragile base class problem and its solution
• The greybox approach : when blackbox specification hide too much
• The Lambda Library : Lambda abstraction in C++
• The performance of decision support applications utilizing patient record narratives : a review
• The power of networks of Watson Crick D0L systems
• The probabilistic steam boiler : a case study in probabilistic data refinement
• The probability of undetected error can have several local maxima
• The production cell : an exercise in the formal verification of a UML model
• The semantics of UML state machines
• The square tiling problem is NP-complete for deterministic tile sets
• The state of the art of information system applications in 2007
• The theorem of Fine and Wilf for relational periods
• The Uva virtual machine
• Theorem prover support for precondition and correctness calculation
• Theory and applications of language equations : proceedings of the 1st international workshop, Turku, Finland, 2 July 2007
• There is something fishy about your evidence.., or, How to develop inconsistency checks for digital evidence using the B method
• Three factors affecting the predictive performance of ANNs : pre-processing method, data distribution and training mechanism
• Three perspectives for solving the job grouping problem
• Three variants of the DT0L sequence equivalence problem
• Timing analysis of message sequence charts
• Timing analysis of UML sequence diagrams
• Tissue P systems
• Tool support for DFD to UML model-based transformations
• Tool support for invariant based programming
• Towards a browsable record of HOL proofs
• Towards a building methodology for software agents
• Towards a definition of a computer game
• Towards a formal definition of model driven development
• Towards a formal power estimation framework
• Towards automated classification of intensive care nursing narratives
• Towards packaged IT consulting services : an illustrative case from IT business
• Transcendence of numbers with an expansion in a subclass of complexity 2n+1
• Transitivity of local complementation and switching on graphs
• Tree algebras and varieties of tree languages
• Trustworthy storage and exchange of theorems
• TTA Workshop notes 2002 : Turku, June 7, 2002
• Tuples and multiple return values in C++
• Turku Centre for Computer Science : annual report 2003
• Turku Centre for Computer Science : annual report 2004
• Turku Centre for Computer Science : annual report 2012
• Turku Centre for Computer Science : annual report 2013
• Turku Centre for Computer Science : annual report 2014
• Two families of optimal identifying codes in binary hamming spaces
• Two models for gene assembly in ciliates
• Two problems on commutation of languages
• UML-driven TTA-based protocol processor design
• Unambiguous Boolean grammars
• Undecidability bounds for integer matrices using Claus instances
• Undecidability in [omega]-regular languages
• Undecidability in integer weighted finite automata
• Undecidability in matrices over Laurent polynomials
• Undecidability of infinite Post Correspondence Problem for instances of size 9
• Undecidability of the equivalence of finite substitutions on regular language
• Uni-transitional Watson-Crick D0L systems
• Uniformly scattered factors
• Universality on tree automata of Moore type
• Unusual algorithms for lexicographical enumeration
• User participation and information systems change : an evolutionary learning approach
• Valence languages generated by equality sets
• Varieties of many-sorted recognizable sets
• Varieties of tree languages definable by syntactic monoids
• Vector quantization by lazy pairwise nearest neighbor method
• Verification and refinement of action contracts
• Verification of a song selection algorithm with SPIN
• Verification of linear hybrid action systems
• Verifying time Petri nets by linear programming
• VILLE - multilanguage tool for teaching novice programming
• Vinogradov's method and some applications
• vUML : a tool for verifying UML models
• Watson-Crick [omega]-automata
• Watson-Crick D0L systems : the power of one transition
• Watson-Crick DOL systems
• Watson-Crick walks and roads on DOL graphs
• Weak and strong structural induction and its mechanical support by a proof tool
• Weinbaum factorizations of primitive words
• What's in a specification?
• Why safeguard information?
• Work load balancing of a generalized flexible flow line in printed circuit board production
• Zebra factorizations in free semigroups

inLanguage

• en

isPartOf

• Fennica

issn

• 1239-1891
• 1239-1905

name

• TUCS gen. publ
• TUCS general publication
• TUCS general publications
• TUCS tech. rep
• TUCS technical report
• TUCS technical report, 1239-1891
• TUCS technical reports
• Turku Centre for Computer Science general publications
• Turku Centre for Computer Science technical reports

P60049

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

sameAs

• <https://issn.org/resource/issn/1239-1891>
• <https://issn.org/resource/issn/1239-1905>

Instances

• 1996- : Turun tietotekniikan tutkimus- ja koulutuskeskus
• 1996- : Turun tietotekniikan tutkimus- ja koulutuskeskus