Slow-phase onset influence on waveform identification and foveation time measure in congenital nystagmus

Congenital nystagmus (CN) is an ocular-motor disorder characterised by involuntary, conjugated ocular oscillations and its pathogenesis is still under investigation. This kind of nystagmus is termed congenital (or infantile) since it could be present at birth or it can arise in the first months of life. Most of CN patients show a considerable decrease of their visual acuity: image fixation on the retina is disturbed by nystagmus continuous oscillations, mainly horizontal. However, the image of a given target can still be stable during short periods in which eye velocity slows down while the target image is placed onto the fovea (called foveation intervals). To quantify the extent of nystagmus, eye movement recording are routinely employed, allowing physicians to extract and analyse nystagmus main features such as waveform shape, amplitude and frequency. Using eye movement recording, it is also possible to compute estimated visual acuity predictors: analytical functions which estimates expected visual acuity using signal features such as foveation time and foveation position variability. Use of those functions extend the information from typical visual acuity measurement (e.g. Landolt C test) and could be a support for therapy planning or monitoring. This study focuses on detection of CN patients' waveform type and on foveation time measure. Specifically, it proposes a robust method to recognize cycles corresponding to the specific CN waveform in the eye movement pattern and, for those cycles, evaluate the exact signal tracts in which a subject foveates. About 40 eyemovement recordings, either infrared-oculographic or electrooculographic, were acquired from 16 CN subjects. Results suggest that the use of an adaptive threshold applied to the eye velocity signal could improve the estimation of slow phase start point. This can enhance foveation time computing and reduce influence of repositioning saccades and data noise on the waveform type identification.

An improved memory management scheme for large scale graph computing engine GraphChi

GraphChi is the first reported disk-based graph engine that can handle billion-scale graphs on a single PC efficiently. GraphChi is able to execute several advanced data mining, graph mining and machine learning algorithms on very large graphs. With the novel technique of parallel sliding windows (PSW) to load subgraph from disk to memory for vertices and edges updating, it can achieve data processing performance close to and even better than those of mainstream distributed graph engines. GraphChi mentioned that its memory is not effectively utilized with large dataset, which leads to suboptimal computation performances. In this paper we are motivated by the concepts of 'pin ' from TurboGraph and 'ghost' from GraphLab to propose a new memory utilization mode for GraphChi, which is called Part-in-memory mode, to improve the GraphChi algorithm performance. The main idea is to pin a fixed part of data inside the memory during the whole computing process. Part-in-memory mode is successfully implemented with only about 40 additional lines of code to the original GraphChi engine. Extensive experiments are performed with large real datasets (including Twitter graph with 1.4 billion edges). The preliminary results show that Part-in-memory mode memory management approach effectively reduces the GraphChi running time by up to 60% in PageRank algorithm. Interestingly it is found that a larger portion of data pinned in memory does not always lead to better performance in the case that the whole dataset cannot be fitted in memory. There exists an optimal portion of data which should be kept in the memory to achieve the best computational performance.

On a Direct Approach to the Solution of Inverse Optical Problems

The evaluation from experimental data, of physical quantities, which enter into the electromagnetic Maxwell equations, is described as inverse optical problem. The functional relations between the dependent and independent variables are of transcendental character and numeric procedures for evaluation of the unknowns are largely used. Herein, we discuss a direct approach to the solution, illustrated by a specific example of determination of thin films optical constants from spectrophotometric data. New algorithm is proposed for the parameters evaluation, which does not need an initial guess of the unknowns and does not use iterative procedures. Thus we overcome the intrinsic deficiency of minimization techniques, such as gradient search methods, Simplex methods, etc. The price of it is a need of more computing power, but our algorithm is easily implemented in structures such as grid clusters. We show the advantages of this approach and its potential for generalization to other inverse optical problems.

Time-Fractional Derivatives in Relaxation Processes: A Tutorial Survey

2000 Mathematics Subject Classification: 26A33, 33E12, 33C60, 44A10, 45K05, 74D05,

Services on Application Level in Grid for Scientific Calculations

AMS Subj. Classification: 00-02, (General)

On Extremal Binary Doubly-Even Self-Dual Codes of Length 88*

In this paper we present 35 new extremal binary self-dual doubly-even codes of length 88. Their inequivalence is established by invariants. Moreover, a construction of a binary self-dual [88, 44, 16] code, having an automorphism of order 21, is given.

On Solving the Maximum Betweenness Problem Using Genetic Algorithms

In this paper a genetic algorithm (GA) is applied on Maximum Betweennes Problem (MBP). The maximum of the objective function is obtained by finding a permutation which satisfies a maximal number of betweenness constraints. Every permutation considered is genetically coded with an integer representation. Standard operators are used in the GA. Instances in the experimental results are randomly generated. For smaller dimensions, optimal solutions of MBP are obtained by total enumeration. For those instances, the GA reached all optimal solutions except one. The GA also obtained results for larger instances of up to 50 elements and 1000 triples. The running time of execution and finding optimal results is quite short.

On some Modifications of the Nekrassov Method for Numerical Solution of Linear Systems of Equations

A modification of the Nekrassov method for finding a solution of a linear system of algebraic equations is given and a numerical example is shown.

On the Arithmetic of Errors

An approximate number is an ordered pair consisting of a (real) number and an error bound, briefly error, which is a (real) non-negative number. To compute with approximate numbers the arithmetic operations on errors should be well-known. To model computations with errors one should suitably define and study arithmetic operations and order relations over the set of non-negative numbers. In this work we discuss the algebraic properties of non-negative numbers starting from familiar properties of real numbers. We focus on certain operations of errors which seem not to have been sufficiently studied algebraically. In this work we restrict ourselves to arithmetic operations for errors related to addition and multiplication by scalars. We pay special attention to subtractability-like properties of errors and the induced “distance-like” operation. This operation is implicitly used under different names in several contemporary fields of applied mathematics (inner subtraction and inner addition in interval analysis, generalized Hukuhara difference in fuzzy set theory, etc.) Here we present some new results related to algebraic properties of this operation.

On the Mathematical Modelling of Microbial Growth: Some Computational Aspects

We propose a new approach to the mathematical modelling of microbial growth. Our approach differs from familiar Monod type models by considering two phases in the physiological states of the microorganisms and makes use of basic relations from enzyme kinetics. Such an approach may be useful in the modelling and control of biotechnological processes, where microorganisms are used for various biodegradation purposes and are often put under extreme inhibitory conditions. Some computational experiments are performed in support of our modelling approach.

Note on an Improvement of the Griesmer Bound for q-ary Linear Codes

Let nq(k, d) denote the smallest value of n for which an [n, k, d]q code exists for given integers k and d with k ≥ 3, 1 ≤ d ≤ q^(k−1) and a prime or a prime power q. The purpose of this note is to show that there exists a series of the functions h3,q, h4,q, ..., hk,q such that nq(k, d) can be expressed.

On Blocking Sets in Affine Hjelmslev Planes

ACM Computing Classification System (1998): G.2.1.

Adaptive E-learning Content Design and Delivery Based on Learning Styles and Knowledge Level

ACM Computing Classification System (1998): K.3.1, K.3.2.

A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs

ACM Computing Classification System (1998): G.2.2.

Architectural aspects of self-aware and self-expressive computing systems:from psychology to engineering

Work on human self-Awareness is the basis for a framework to develop computational systems that can adaptively manage complex dynamic tradeoffs at runtime. An architectural case study in cloud computing illustrates the framework's potential benefits.