The main limitation of the study by Danesh-Meyer et al. was neither discussed nor mentioned. The time axis was not taken into account. The functional change after an acute event such as anterior ischemic optic neuropathy (AION) is immediate, but there is a delay before the anatomic changes take place. In this study, most of the patients with nonarteritic anterior ischemic optic neuropathy (NAIO...

This paper reviews the implementation of a non-linear method, the spherical selforganising feature map that was able to recognise non-linear patterns in micro-artefacts, proposing the necessity for such recognitions in order to improve archaeological interpretations.

Let C be an additive subgroup of Z n 2k for any k ≥ 1. We define a Gray map Φ : Z n 2k −→ Z kn 2 such that Φ(C) is a binary propelinear code and, hence, a Hamming-compatible group code. Moreover, Φ is the unique Gray map such that Φ(C) is Hamming-compatible group code. Using this Gray map we discuss about the nonexistence of 1-perfect binary mixed group code.

In recent years different genetic programming (GP) structures have emerged. Today, the basic forms of representation for genetic programs are tree, linear and graph structures. In this contribution we introduce a new kind of GP structure which we call linear-graph. This is a further development to the linear-tree structure that we developed earlier. We describe the linear-graph structure, as we...

Given a list of filtering rules with individual hitting probabilities, it is known that the average processing time of a linear-search based firewall can be minimized by searching rules in some appropriate order. This paper proposes a new yet simple technique called the linear-tree structure. It utilizes an advanced feature of modern firewalls, the “goto”like statement, to transform the given r...

In 1975, Ladner showed that under the hypothesis that P is not equal to NP, there exists a language which is neither in P, nor NP-complete. This result was latter generalized by Schoning and several authors to various polynomial-time complexity classes. We show here that such results also apply to linear-time reductions on RAMs (resp. Turing machines), and hence allow for separation results in ...

Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In this paper we first develop a new algebraic framework for a systematic analysis of linear trellises which enables us to address open foundational questions. In...

The analysis of protein structure using secondary structure line segments has been widely used in many structure analysis and prediction methods over the past 20 years. Its use in methods that compare protein structures at this level of representation is becoming more important as an increasing number of protein structures become determined through structural genomic programmes. The standard me...

The paper is a report of the second part of the talk on relative motion determination. For a detailed introduction and references see the paper on the rst part of the talk 1]. We present a method for the optimal, rapid and high resolution determination of the relative general (i.e., translational as well as rotational) motion from an image sequence based on linear transformations.