From dust till drawn

We present a system for drawing pastel media in real-time as an effective alternative to most existing digital solutions that basically allow for drawing arbitrary strokes in a particular style. Our approach is focused on the simulation of the natural material itself and on its interaction with the drawing surface and the drawing tool. Upon free-form drawing, a bidirectional transfer of pigment takes place. In one direction, the paper surface is dusted with new pigment particles broken off the tip (i.e., the end of the drawing tool). A large part of these particles will be deposited or blended together with previously deposited ones whereas the remainder does not contribute to the drawing and is blown off. On the other hand, a certain amount of previously deposited pigment is scraped off and picked up again soiling the tip. This is noticeable in the next strokes to be drawn. Furthermore, both the tip and the paper surface are subject to weathering depending on the exerted pressure and friction of the drawing tool, and the bumpiness of the paper. As a result, the paper surface becomes slightly damaged, limiting the deposition of new pigment. The tip, on the other hand, becomes blunt making new strokes wider. From a stylistic point of view, similarly to traditional drawings our results convey the artists’ characteristics (e.g., the way of wielding the brush, skillfulness, feeling for the medium). Therefore, we believe that our system allows an artist to create realistically looking pastel images without losing his/her personal touch.     

NEDAP-Wahlcomputer – Manipulationsmethoden an Hard- und Software

In Deutschland geh?rt der Einsatz von NEDAP-Wahlcomputern in immer mehr Gemeinden zum Alltag. Durch Untersuchungen zur Sicherheit und Manipulierbarkeit konnten Erkenntnisse gewonnen werden, mit welchen Methoden manipulierte Software in den Wahlcomputer eingebracht und Hardwarekomponenten ausgetauscht werden k?nnen. Dadurch ist erstmals eine Beurteilung der Eignung der NEDAP-Wahlcomputer hinsichtlich der Anforderungen an manipulationsfeste, nachvollziehbare und transparente Wahlen m?glich.     

Energy-efficient penetration and perforation of targets in the hypervelocity regime

In general, the performance of a KE penetrator against most targets increases with velocity regardless of the particular penetrator-target interaction mode. It is possible to show that there exists an optimum velocity which maximizes the performance of an impacting penetrator for a given expenditure of kinetic energy. Simple graphical methods are described that determine the optimum velocity from general performance-velocity plots. These graphical methods may also be applied to experimental data alone. In addition, simple analytic models which describe the velocity dependent penetration/perforation performance of KE penetrators are examined and extended. These models may be used to explicitly assess the influence of parameters such as target strength and density and penetrator mass, strength and density. For some of the models in this analysis, the explicit relations between the optimum striking velocity for a specific kinetic energy value and the penetrator-target parameters are described.     

Trade secrets in software design and logic

Much of what has been written in Australia about the protection of computer programs has been inspired by high profile cases concerning the boundaries of copyright protection. The Australian law firm Clayton Utz says that there has been little discussion about other types of legal protection for computer programs, and as a consequence, other intellectual property laws should not be overlooked.     

Robust pole assignment for incomplete nonlinear decoupling applied to robots

A robustness analysis and synthesis for incomplete nonlinear decoupling for a class of nonlinear systems is discussed. Rigid and elastic-joint robot models belong to this class. For the elastic case, a transformation facilitates the robustness analysis under a weak assumption. Charts with H ₁- and H - norms of closed-loop disturbance transfer functions of the nonlinear-decoupled system are presented for a robust pole assignment.     

HihO: accelerating artificial intelligence interpretability for medical imaging in IoT applications using hierarchical occlusion

Neural Computing and Applications - In the medical imaging domain, nonlinear warping has enabled pixel-by-pixel mapping of one image dataset to a reference dataset. This co-registration of data...     

Investigation of long term drift of an intraocular pressure sensor

Microsystem Technologies - “Zero drift” behavior of an optical intraocular pressure sensor is studied using an analytical model based on the deflection of a circular membrane. Results...     

Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization

Certain tasks, such as formal program development and theorem proving, fundamentally rely upon the manipulation of higher-order objects such as functions and predicates. Computing tools intended to assist in performing these tasks are at present inadequate in both the amount of knowledge they contain (i.e., the level of support they provide) and in their ability to learn (i.e., their capacity to enhance that support over time). The application of a relevant machine learning technique—explanation-based generalization (EBG)—has thus far been limited to first-order problem representations. We extend EBG to generalize higher-order values, thereby enabling its application to higher-order problem encodings.Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out. First-order Horn logics (e.g., Prolog) are not, however, well suited to higher-order applications. Instead, we employ Prolog, a higher-order logic programming language, as our basic framework for realizing higher-order EBG. In order to capture the distinction between domain theory and training instance upon which EBG relies, we extend Prolog with the necessity operator of modal logic. We develop a meta-interpreter realizing EBG for the extended language, Prolog, and provide examples of higher-order EBG.     

Bit transposition for very large scientific and statistical databases

Conventional access methods cannot be effectively used in large Scientific/Statistical Database (SSDB) applications. A file structure (called bit transposed file (BTF)) is proposed which offers several attractive features that are better suited for the special characteristics that SSDBs exhibit. This file structure is an extreme version of the (attribute) transposed file. The data are stored by vertical bit partitions. The bit patterns of attributes are assigned using one of several data encoding methods. Each of these encoding methods is appropriate for different query types. The bit partitions can also be compressed using a version of the run length encoding scheme. Efficient operators on compressed bit vectors have been developed and form the basis of a query language. Because of the simplicity of the file structure and query language, optimization problems for database design, query evaluation, and common subexpression removal can be formalized and efficient exact solution or near optimal solution can be achieved. In addition to selective power with low overheads for SSDBs, the BTF is also amenable to special parallel hardware. Results from experiments with the file structure suggest that this approach may be a reasonable alternative file structure for large SSDBs.