Jiri Soukup

Learn More
This paper describes a method of generating a path between two points of a cellular array, with some cells being specified as obstacles. The method combines two techniques: A line search is first directed toward the target. This is a fast and extremely effective method on boards with plenty of space. When the line search hits an obstacle, an expansion(More)
The paper describes a new router which develops all connections simultaneously. Routes do not exist as lines, but rather as connected irregularly shaped areas which grow and retract in an amoeba-like manner. It is as if some routes are being rerouted, but it is all done at once. Because the cell map is scanned sequentially, the data handling and storage is(More)
A channel router which is to be effective for general-purpose automatic routing must be able to use different sets of routing criteria priorities, in a controllable manner. We present an approach to channel routing with compaction in which channel compaction is adaptable to several routing criteria priorities. We show how overall channel routing performance(More)
Maze routers provide powerful and flexible routing algorithms, but require storage of information for every routing grid and layer. With the advance of manufacturing technology, the number of these grids is often so large that routing programs either run out of memory or become very slow due to excessive paging. This paper presents a new data organization(More)
UNLABELLED Mass spectrometers are sophisticated, fine instruments which are essential in a variety applications. However, the data they produce are usually interpreted in a rather primitive way, without considering the accuracy of this data and the potential errors in identifying peaks. Our new approach corrects this situation by dividing the LC-MS output(More)
There is a disconnect between modelling and implementation: relationships are prevalent in system models but implementation languages do not provide first-class support for them. For example, in Java (and other Object-Oriented Languages), relationships must be implemented by hand using references embedded in participants. This approach is cumbersome and(More)