Franz Pichler

On first-passage problems for asymmetric one-dimensional diffusions

For a, b > 0, we consider a temporally homogeneous, one-dimensional diffusion process X(t) defined over I = (-b, a), with infinitesimal parameters depending on the sign of X(t). We suppose that, when X(t) reaches the position 0, it is reflected rightward to delta with probability p > 0 and leftward to -delta with probability 1 - p, where delta > 0. It is presented a method to find approximate formulae for the mean exit time from the interval (-b,a), and for the probability of exit through the right end a, generalizing the results of Lefebvre ([1]) holding, in the limit delta -> 0, for asymmetric Brownian motion with drift.

Computer Aided Systems Theory – EUROCAST 2005

Formal Approaches in Modelling.- On the Physical Formal and Semantic Frontiers Between Human Knowing and Machine Knowing.- Approximation Problems Categories.- Computation of Partial Automata Through Span Composition.- Degenerate Arrays: A Framework for Uncertain Data Tables.- Neural Network Sensitivity Analysis Applied for the Reduction of the Sensor Matrix.- Fuzzy Modeling for Coal Seams A Case Study for a Hard-Coal Mine.- Optimization of a Class of Uncertain Systems Based on Uncertain Variables.- Computational Simulation of Categorical Constructions.- Composing Transitions into Transactions in UML Diagrams.- Theory-Building with System Dynamics: Principles and Practices.- Ontology Integration for Statistical Information.- Intelligent Information Systems.- On Recursive Functions and Well-Founded Relations in the Calculus of Constructions.- Longest Sorted Sequence Algorithm for Parallel Text Alignment.- Information Retrieval and Large Text Structured Corpora.- Meteorological Image Descriptors.- Towards a Certified and Efficient Computing of Grobner Bases.- CheapTB: A Low Cost of Operation Distributed Filesystem.- Spelling Correction on Technical Documents.- Verification of Language Based Fault-Tolerance.- Applying Stacking and Corpus Transformation to a Chunking Task.- Extracting Computer Algebra Programs from Statements.- Integrating Syntactic Information by Means of Data Fusion Techniques.- Unsupervised Learning in Information Retrieval Using NOW Architectures.- An Iterative Method for Mining Frequent Temporal Patterns.- Information Applications Components.- Data Mining with Scatter Search.- Web Usage Mining Project for Improving Web-Based Learning Sites.- Similarity Queries in Data Bases Using Metric Distances - from Modeling Semantics to Its Maintenance.- A WEB-CASE Tool Prototype for Hybrid Software Development.- An Augmentative Communication System Based on Adaptive Evolutionary Hypermedia Systems.- The Gaps of the Thesaurus Wordnet Used in Information Retrieval.- Fuzzy Adaptive Objects (Logic of Monitors).- A Model-Based Architecture for Fuzzy Temporal Diagnosis.- Extension of Ontologies Assisted by Automated Reasoning Systems.- A Software Architecture for Effective Document Identifier Reassignment.- An Ontology for Reusing Synthetic Tasks.- A Tractable Subclass of Fuzzy Constraint Networks.- Parallel State Space Generation and Exploration on Shared-Memory Architectures.- Towards Automated Controlling of Human Projectworking Based on Multiagent Systems.- Cryptography and Spectral Analysis.- Tree-Structured Legendre Multi-wavelets.- Remarks on Calculation of Autocorrelation on Finite Dyadic Groups by Local Transformations of Decision Diagrams.- A New Pseudo-Random Generator Based on Gollmann Cascades of Baker-Register-Machines.- An Excellent Permutation Operator for Cryptographic Applications.- Fault Cryptanalysis of ElGamal Signature Scheme.- Complexity-Theoretical Approaches to the Design and Analysis of Cryptographical Boolean Functions.- Algorithm for Proving the Knowledge of an Independent Vertex Set.- Improvement of the Edit Distance Attack to Clock-Controlled LFSR-Based Stream Ciphers.- Protocol Analysis for Concrete Environments.- Computer Vision.- Pattern Recognition in AVHRR Images by Means of Hibryd and Neuro-fuzzy Systems.- Image Processing Techniques for Braille Writing Recognition.- Retinal Based Authentication via Distributed Web Application.- Skeleton Extraction of 2D Objects Using Shock Wavefront Detection.- Cue Combination for Robust Real-Time Multiple Face Detection at Different Resolutions.- Evolutionary Color Constancy Algorithm Based on the Gamut Mapping Paradigm.- Vision Based Automatic Occupant Classification and Pose Recognition for Smart Airbag Deployment.- Biocomputing.- A Wiener Neuronal Model with Refractoriness.- On Myosin II Dynamics: From a Pulsating Ratchet to a Washboard Potential.- Feedback Effects in Simulated Steins Coupled Neurons.- Upcrossing First Passage Times for Correlated Gaussian Processes.- Convergence of Iterations.- Semiautomatic Snake-Based Segmentation of Solid Breast Nodules on Ultrasonography.- Parallel Progressive Multiple Sequence Alignment.- Concepts and Systems Tools for Modelling Signal Processing in Vertebrate Retina.- Application of Multichannel Vision Concepts and Mechanisms in an Artificial Industrial Vision System.- Intelligent Vehicular Sytems.- Soft Computing and Geometrical Control for Computer Aided Driving.- A Monocular Solution to Vision-Based ACC in Road Vehicles.- Multi-objective Dynamic Optimization for Automatic Parallel Parking.- Electric Power Steering Automation for Autonomous Driving.- Computer Vision Application: Real Time Smart Traffic Light.- Permanency Memories in Scene Depth Analysis.- Pedestrian Detection for Intelligent Vehicles Based on Active Contour Models and Stereo Vision.- Fast Road Sign Detection Using Hough Transform for Assisted Driving of Road Vehicles.- Robotic Soccer, Robotics and Control.- Advances in Robotics.- Current and Future Trends and Challenges in Robot Soccer.- Strategy and Communication in Robotic Soccer Game.- Rete Algorithm Applied to Robotic Soccer.- Towards a Biomathematical Model of Intentional Autonomous Multiagent Systems.- A Controller Network for a Humanoid Robot.- Programming by Integration in Robotics.- A Mathematical Formalism for the Evaluation of C-Space for Redundant Robots.- Global Modal Logics for Multiagent Systems: A Logical Fibering Approach.- Improved Non-standard Discretization Methods for Nonlinear Dynamical Control Systems.- Hierarchical Control of a Distributed Solar Collector Field.- Explanatory Analysis of Data from a Distributed Solar Collector Field.

Computer Aided Systems Theory - EUROCAST 2003

In this article results of earlier publications on the subject are summarized with some extensions and notational improvements. In the introduction a heuristic outline of human knowledge, its aquisition and its processing is given to motivate the following mathematical representation. The basic mathematical concepts are hierarchies of generalized relations and operations on these, corresponding to knowledge and knowledge processing. Included are objects with space and time parameterization, valuations of objects by partial ordered values, neighborhood and similarity relations, i.e. topologies, and variable objects.

Computer Aided Systems Theory - EUROCAST’99

The field of robotics is one of the most innovative in the last decade. Conventional industrial robots from the late 70 ́s are now only a tool on the production level. One of the oldest dreams of the robotic community – intelligent, mobile and humanoid robots – starts to become a reality because of the rapid development of “external” sensors. External sensors (e.g. visual, auditive, force-torque) offer intelligent robots the possibility to see, hear, speak, feel, smell like humans. Compared with conventional, unintelligent, industrial robots, intelligent robots can fulfill new, innovative tasks in new application areas.

Computer Aided Systems Theory - EUROCAST 2013

Starting with the well-known Towers of Hanoi, we create a new sequence of puzzles which can essentially be solved in the same way. Since graphs and puzzles are intimately connected, we define a sequence of graphs, the iterated complete graphs, for our puzzles. To create puzzles for all these graphs, we need to generalize another puzzle, Spin-Out, and cross the generalized Towers puzzles with the the generalized Spin-Out puzzles. We show how to solve these combined puzzles. We also show how to compute distances between puzzle configurations. We show that our graphs have Hamiltonian paths and perfect one-error-correcting codes. (Properties that are NP-complete for general graphs.) We also discuss computational complexity and show that many properties of our graphs and puzzles can be calculated by finite state machines.

Modeling Complex Systems by Multi-agent Holarchies

Arthur Koestler (1967, 1969, 1978) introduced into science the concepts of a “holon” and of a “holarchy”. A holarchy is according to A. Koestler a tree-like hierarchy where the nodes of the tree – the components of the hierarchy – are autonomous intelligent acting I/O systems.

STIMS-MEDTOOL: Integration of Expert Systems with Systems Modelling and Simulation

A feasibility study concerning the possibility of integrating Medtool (an expert system shell) with STIMS (a object-oriented modelling and simulation environment) is presented. The relationship between the formalisms implemented by the two environments has resulted in the possibility to relate one formalism to each other. The generalized magnitudes formalism on which Medtool is based, appears as a formalism that may be considered for systems modelling and simulation introducing new Artificial Intelligence features into Computer Aided Systems Theory. Finally, having associated the concepts in one formalism to the concepts in the other, the integration of the two shells can be accomplished in an easier fashion and with more meaning.

Fractional growth process with two kinds of jumps

While traditional glider path planning relies on constant model forecasts with only a limited range, a new approach to glider operation is based on automated topographical understanding incorporating feature detection and tracking techniques. Encapsulating the key elements of ocean structure dynamics and focusing on their behaviour an alternative prediction data model can be developed. This feature-based characterization is then used to improve upon the glider path planning. Additionally a structural comparison of ROMs and global models is conducted as well as a forecast assessment within the model. This approach is applied to the case of mesoscale eddies that form around the canary islands and spin off describing various trajectories depending on origin, type and time of the year.

A new pseudo-random generator based on gollmann cascades of baker-register-machines

In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register Machine (CBRM), which uses the sensitivity of chaotic behaviour and allows the application of automata- and shift-register theory. It is shown that a CBRM has good properties of randomness, such as large periods and high linear complexity. It can provide high cryptographic security with fast encryption speed, and can be realized effectively by both hardware and software.

FSM Shift Register Realization for Improved Testability

An approach for the FSM state assignment problem based on an enhanced algorithm for shift register realizations is presented. A FSM is transformed into a generalized shift register structure, where memory elements are put together to one or more shift registers. The proposed procedure considers a final scan path architecture of FSM memory cells already during state assignment, reducing the hardware overhead for testability purposes by exploiting special optimization potentials. Theoretically founded criteria are used to cancel the computation at an early stage if no fruitful shiftregister realization is possible. Experimental results for two-level and multi-level implementations are given for MCNC benchmark machines.