Search

This paper considers the Z-channel, which is known as a channel model for photon communication or semiconductor memory. A new decoding algorithm is proposed and discussed. Recently, studies have been made from various viewpoints on the asymmetrical error-correcting code suited to the Z-channel, which is considered interesting. One of the basic problems in the Z-channel is the performance and the decoding method when the cyclic code with various features is applied, but it has been investigated little. This paper presents first a maximum-likelihood decoding algorithm which is highly efficient for the cyclic code on the Z-channel. It is then shown that by providing a certain threshold for the algorithm, a higher-speed decoding is realized. It is shown also that by setting the threshold above a certain value, the computational complexity can be improved without sacrificing the maximum-likelihood property. Finally, it is demonstrated by numerical calculation that the decoding error probability is improved greatly by the decoding algorithm proposed in this paper, together with a drastic improvement in the computational complexity. [ABSTRACT FROM AUTHOR]

This paper proposes a new method for efficient validation of the telecommunication protocol, containing the internal events, including those for the timer and resource management. The proposed validation method first converts the protocol containing the internal event into the equivalent protocol not containing the internal event. Then the original protocol is validated by applying the already-proposed validation method for the protocol not containing the internal event to the result of conversion. This paper discusses mainly the principle and the algorithm of the protocol equivalent conversion. The features of the proposed validation method are that the protocol is validated with the minimum processes and signals, which reduces the processing time and the memory capacity needed in the validation and also improves the efficiency. [ABSTRACT FROM AUTHOR]

Abstract: Held on 21st to 23rd November 2009 in Hiroshima, the SiHIS working conference aimed at finding solutions to approach to an idealistic society where (1) the individual can trust information with full understanding and responsibility, (2) the individual can allow the use of information backed by sound legitimated environment, (3) information can play its role for better healthcare and the improvement of medicine. The purpose of this paper is to propose recommendations from this working conference. [ABSTRACT FROM AUTHOR]

In this paper, a novel approach for simplifying the obtained if–then rules from decision table by rough set based methods is proposed. This approach can extract main features of objects in different decision classes by remarkable degrees. Using the proposed method, two real world decision-making problems are studied. The first one is for analyzing the main features of Japanese industries. The second is for anatomizing the life situations of senior citizens in Japan. The analysis results show that the proposed method is powerful for piecing out the main features of decision classes in the decision table which has many attributes and objects. The obtained main features can provide deep insight into the situations of objects and are useful for making a decision in the real world. [ABSTRACT FROM AUTHOR]

This paper investigates the Japanese sentence-final particles ne and yo as they occur in soliloquy. Because of their pivotal roles in spoken Japanese, these particles have been investigated extensively for decades. However, most previous works have analyzed them solely in terms of communication, invariably assuming the presence of an addressee. In fact, it is not yet widely known that these particles can also occur in soliloquy in which communication with another person is not intended. The present article is the first study to address the significance of ne and yo as they occur in soliloquy and discuss problems associated with hitherto proposed analyses. In order to investigate how communicative and non-communicative intentions influence utterances, an experiment was conducted in which soliloquies of native speakers of Japanese were examined. For ne, this study endorses Takubo and Kinsui's Discourse Management Model. For yo, Inoue's account is vindicated. [ABSTRACT FROM AUTHOR]

A fiber optic subscriber loop provides many services that require high quality for a large number of subscribers. This means that it is necessary to establish a highly reliable, economical subscriber network. A method for high-reliability network construction has been proposed. In this method, the amount of equipment is reduced by utilizing a fiber access module (FAM), which allows fiber lines between the adjacent loops to be connected in the optical subscriber loop. To realize the function of the FAM inexpensively, manual cross-connection is indispensable. However, the restoration time in the event of cable failure is quite long for manual cross-connection. This paper proposes a reconfiguration method, the selected node reconfiguration method (SRM), which has a shorter restoration time than the conventional method, assuming a manual cross-connection FAM. To further shorten the restoration time, a cross-connection method is proposed in which several fibers are switched at the same time. The efficiency of this method and the functional structure of the F AM will be shown. [ABSTRACT FROM AUTHOR]

This paper presents a data compression scheme which uses the statistical properties of ordered dither image by vector reputation. When a part of the dither image corresponding to n × n dithering matrix is described as a vector, it is observed that there is high correlation ratio between neighbor blocks for level information (the number of black pixels in the vector), the resolution information (the number of kinds of vectors) is a few, and their frequency distribution is very biased. Thus, if these two kinds of information on vector are coded separately by the variable length coding scheme, then high compression ratio can be attained for transmission and storage of dither image. [ABSTRACT FROM AUTHOR]