A Study on the Relationship between Children's Developmental Stages and Sense of Color

It is well known that human sensitivity to color and expressive ability varies with age and gender. In addition, the perception, understanding, and comprehension of color vary according to developmental stage and color-related experiences. This study is one approach to research to clarify the relationship between such "sense of color" as above and the developmental stages of children. In this study, the coloring behavior of teenage subjects; elementary school, junior high school, and university students, to coloring book images were investigated using iPads. The characteristics of coloring and color schemes used in the coloring books were analyzed to explore the relationship with the developmental stages of the children. The coloring book images, mandala-like patterns, used in the investigation were designed originally based on some preliminary investigations. In addition, the original palette of colors systematically arranged in hues and tones was specified to quantitatively analyze the characteristics of the colors used in the coloring book. The results showed that the hues of colors used with high frequency in coloring books changed as the developmental stage progressed and that the range of tones by the combination of saturation and lightness widened. It was also found that the color schemes were simple and easy to understand at younger ages, while the complexity of the color schemes increased as the children grew older

Development of Track Condition Monitoring System Using Onboard Sensing Device

Monitoring the conditions of railway tracks is essential for ensuring the railway safety. In-service vehicles equipped with sensors and GPS systems can act as probes to detect and analyse real-time vehicle vibration. Recently, a compact on-board sensing device has been developed. This chapter describes the track condition monitoring system that uses a compact on-board sensing device and diagnosis software. The diagnosis software provides the function of detecting track faults using the root mean square (RMS) of the car-body acceleration. It also allows analysis in the time-frequency domain using wavelet transform. A monitoring experiment in a local railway line showed that the system is effective for practical application

DFT calculation for adatom adsorption on graphene sheet as a prototype of carbon nano tube functionalization

DFT calculation of various atomic species on graphene sheet is investigated as prototypes for formation of nano-structures on carbon nanotube (CNT) wall. We investigate computationally adsorption energies and adsorption sites on graphene sheet for a lot of atomic species including transition metals, noble metals, nitrogen and oxygen, using the DFT calculation as a prototype for CNT. The suitable atomic species can be chosen as each application from those results. The calculated results show us that Mo and Ru are bounded strongly on graphene sheet with large diffusion barrier energy. On the other hand, some atomic species has large binding energies with small diffusion barrier energiesComment: 4 pages, 1 figure, 3 tables. To be published as Journal of Physics:Conference Series for IVC17/ICSS1

Development of a UV-transparent Lens Array for Enlarging the Effective Area of Multichannel SiPMs

We developed a UV-transparent lens array that can increase the photon detection efficiency of a silicon photomultiplier (SiPM) array comprising of 64 pixels ($3\times3$ mm$^2$ each) and 0.2-mm gaps. Through the plano-convex spherical lens on each $3.2\times3.2$ mm$^2$ region, we showed that the loss of photon detection efficiency due to the pixel gaps could be recovered as the incident photons get concentrated on the sensitive regions of the SiPM array. By using a prototype lens array, we achieved approximately 10%-30% relative increase in photon detection efficiency in our target angles of incidence of 30-60 deg.Comment: Accepted for publication in the Proceedings of the 5th International Workshop on New Photon-Detectors (PD18

Finding a Maximum Weight Independent Set of a Circle Graph

We present an algorithm for finding a maximum weight independent set of a circle graph. For a cicle graph of a set of n chords with N endpoints, the algorithm finds a maximum weight independent set in O(nN) time and O(n) space.Special Section LETTER (Special Issue on Discrete Mathematics and Its Applications