The effect of lutein supplementation on visual fatigue: A psychophysiological analysis

We used psychophysiological technology to examine the effect of an oral supplement, a combination of lutein, zeaxanthin and blackcurrant extract (LUT), on visual fatigue, within the context of a randomized, double-blind, placebo-controlled cross-over trial. The LUT supplement and placebo samples were randomly assigned to thirteen participants, who took the samples for two LUT (and vice versa) for another 2 week. Each participant completed visual proof reading tasks for 2 h during each of four testing sessions. Saccade tests were administered before and after the proof reading task, during which the participants moved their eyes back and forth between two targets positioned in the center of two checkerboards. We recorded EEG, EOG, heart rate, and facial muscle potential/performance during the saccade tests. Blood pressure was measured and subjective fatigue and stress scores were collected before and after the proof reading task. We averaged EEG starting at saccade offset in order to analyze eye fixation related potentials (EFRP). Our results suggested that the proof reading task induced visual fatigue. An analysis of EFRP and other psychophysiological data revealed significant differences between the LUT and placebo conditions. These results suggest that supplementation with LUT could help to reduce symptoms of visual fatigue.     

Performance of SOR methods on modern vector and scalar processors

The building-cube method (BCM) is a new generation algorithm for CFD simulations. The basic idea of BCM is to simplify the algorithm in all stages of flow computation to achieve large-scale simulations. Calculation of a pressure field using the Successive Over Relaxation (SOR) method consumes most of the total execution time required for BCM. In this paper, effective implementations on modern vector and scalar processors are investigated. NEC SX-9 and Intel Nehalem-EX are the latest vector and scalar processors. Those processors have much higher peak performances than their previous-generation processors. However, their memory bandwidth improvement cannot catch up with the performance improvement of processors. This is the so-called memory wall problem. In our paper, we discuss optimization techniques for implementation of the SOR method based on architectural characteristics of these modern processors, and evaluate their effects on the sustained performances of these processors for BCM.     

P2P soft security: On evolutionary dynamics of P2P incentive mechanism

This paper thoroughly investigates the evolutionary dynamics of soft security mechanism, namely, reciprocity-based incentive mechanism, in P2P systems based on Evolutionary Game Theory (EGT). By soft security mechanism, it means social control mechanisms to overcome peers’ selfish (rational) behaviors, and encourage cooperation in P2P systems. Specifically, there exist three strategies in P2P systems: always cooperative (ALLC), always defect (ALLD) and reciprocator (R). Instead of existing work which take it for granted that, like ALLC users, R users did not bear any information-seeking cost, we assume small reciprocation cost, and study generalized mutation-selection dynamics. Our contributions are threefold: firstly, we prove and illustrate that, in a well-mixed P2P structure, ALLD is the only strict Nash equilibrium; secondly, we infer the specific condition under which evolution dynamics exhibits rock-scissors-paper oscillation in a structured P2P population. That is, the population cycles from ALLD to R to ALLC and back to ALLD; finally, we theoretically illustrate that the intensity of selection plays an important role in the evolutionary dynamics of P2P incentive mechanism. That is, when the intensity of selection is relatively weak and reciprocation cost limits to zero, the time average can be mostly concentrated on reciprocator. In brief, considering the existence of reciprocation cost and the small mutation in P2P incentive mechanisms, unlike existing work, it is impossible to simply achieve the “absolute cooperative” in P2P incentive mechanisms. On the other hand, stochastic evolution in P2P incentive mechanism with finite population and network structure still favor reciprocation.     

A Linear Algorithm for Computing the Homography from Conics in Correspondence

This paper presents a study, based on conic correspondences, on the relationship between two perspective images acquired by an uncalibrated camera. We show that for a pair of corresponding conics, the parameters representing the conics satisfy a linear constraint. To be more specific, the parameters that represent a conic in one image are transformed by a five-dimensional projective transformation to the parameters that represent the corresponding conic in another image. We also show that this transformation is expressed as the symmetric component of the tensor product of the transformation based on point/line correspondences and itself. In addition, we present a linear algorithm for uniquely determining the corresponding point-based transformation from a given conic-based transformation up to a scale factor. Accordingly, conic correspondences enable us to easily handle both points and lines in uncalibrated images of a planar object.     

Microstructure and yield strength of UDIMET 720LI alloyed with Co-16.9 Wt Pct Ti

We proposed a new method for developing Ni-base turbine disc alloy for application at temperatures above 700 °C by mixing a Ni-base superalloy U720LI with a two-phase alloy Co-16.9 wt pct Ti in various contents. The microstructure and phase stability of the alloys were analyzed using an optical microscope, a scanning electron microscope, energy-dispersive spectroscopy, and an X-ray diffractometer. The yield strength was studied by compression tests at temperatures ranging from 25 °C to 1200 °C. The results show that all the alloys had a dendritic structure. Ni₃Ti (η) phase was formed in the interdendritic region in the alloys with the addition of Co-16.9 wt pct Ti, and its volume fraction increased with the increase in the addition of Co-16.9 wt pct Ti. The results of exposure at 750 °C show that the addition of Co-16.9 wt pct Ti to U720LI had a great effect on suppressing the formation of σ phase due to the reduced Cr content in the γ matrix. Compared to U720LI, the alloys with the addition of Co-16.9 wt pct Ti possessed higher yield strength. The solid-solution strengthening of γ and γ′ and higher volume fraction of γ′ were assumed to cause this strength increase.     

Spin Injection Processes in ZnSe-Based Double Quantum Dots of Diluted Magnetic Semiconductors

Spin injection processes in the double quantum dots of ZnSe-based diluted magnetic semiconductors are discussed. Double quantum dots are fabricated from ZnSe-based double quantum wells by electron beam lithography and wet etching. In these samples, the photo-excited carriers in the magnetic dots are injected into the non-magnetic dots. The circular polarization degrees of photoluminescence from the non-magnetic dots are measured by micro-photoluminescence measurement system under the magnetic field up to 5 T. The maximum spin polarization degrees of injected carriers determined from our experiment are 10% for double quantum wells and 15% for double quantum dots. The spin injection efficiency was estimated both from the observed circular polarization degree and the diffusion length of carriers. We concluded that the spin injection efficiency is increased in the double quantum dots.     

On the computational power of insertion-deletion systems

Gene insertion and deletion are basic phenomena found in DNA processing or RNA editing in molecular biology. The genetic mechanism and development based on these evolutionary transformations have been formulated as a formal system with two operations of insertion and deletion, called insertion-deletion systems (Kari and Thierrin, 1996; Kari et al., 1997).We investigate the generative power of insertion-deletion systems (InsDel systems), and show that the family INS ¹ ₁ DEL ¹ ₁ is equal to the family of recursively enumerable languages. This gives a positive answer to an open problem posed in Kari et al. (1997) where it was conjectured contrary. This revised version was published online in June 2006 with corrections to the Cover Date.     

Complete Mining of Frequent Patterns from Graphs: Mining Graph Data

Basket Analysis, which is a standard method for data mining, derives frequent itemsets from database. However, its mining ability is limited to transaction data consisting of items. In reality, there are many applications where data are described in a more structural way, e.g. chemical compounds and Web browsing history. There are a few approaches that can discover characteristic patterns from graph-structured data in the field of machine learning. However, almost all of them are not suitable for such applications that require a complete search for all frequent subgraph patterns in the data. In this paper, we propose a novel principle and its algorithm that derive the characteristic patterns which frequently appear in graph-structured data. Our algorithm can derive all frequent induced subgraphs from both directed and undirected graph structured data having loops (including self-loops) with labeled or unlabeled nodes and links. Its performance is evaluated through the applications to Web browsing pattern analysis and chemical carcinogenesis analysis.