In this paper, we give a denotational semantics of imperative programming languages as a CafeOBJ behavioral specification. Since CafeOBJ is an executable algebraic specification language, not only execution of programs but also semi-automatic verification of programs properties can be done. We first describe an imperative programming language with integer and Boolean types, called IPL. Next we discuss about how to extend IPL, that is, IPL with user-defined types. We give a notion of equivalent programs, which is defined by using the notion of the behavioral equivalence of behavioral specifications. We show a sufficient condition for the equivalence relation of programs, which reduces the task to prove programs to be equivalent.

Reduction of the intensity noise in semiconductor lasers is important subject to extend application range of the device. Blue-violet InGaN laser reveals high quantum noise when the laser is operated with low output power. The authors proposed a new scheme of noise reduction both for the optical feedback noise and the quantum noise by applying electric feedback which is positive type at a high frequency and negative type for lower frequency range. Noise reduction effect down to a level lower than the quantum noise was experimentally confirmed even under the optical feedback.

In this paper, we propose the construction of a web-based Question Answering (QA) system for restricted domain, which combines three resource information databases for the retrieval mechanism, including a Question&Answer database, a special domain documents database and the web resource retrieved by Google search engine. We describe a new retrieval technique of integrating a probabilistic technique based on OkapiBM25 and a semantic analysis which based on the ontology of HowNet knowledge base and a special domain HowNet created for the restricted domain. Furthermore, we provide a method of question expansion by computing word semantic similarity. The system is first developed for a middle-size domain of sightseeing information. The experiments proved the efficiency of our method for restricted domain and it is feasible to transfer to other domains expediently using the proposed method.

Recently, semantic text portion (STP) is getting popular in the field of Web mining. STP is a text portion in the original page which is semantically related to the anchor pointing to the target page. STPs may include the facts and the people's opinions about the target pages. STPs can be used for various upper-level applications such as automatic summarization and document categorization. In this paper, we concentrate on extracting STPs. We conduct a survey of STP to see the positions of STPs in original pages and find out HTML tags which can divide STPs from the other text portions in original pages. We then develop a method for extracting STPs based on the result of the survey. The experimental results show that our method achieves high performance.

We deal with quadratic semi-assignment problems with symmetric distances. This symmetry reduces the number of variables in its mixed integer programming formulation. We investigate a polytope arising from the problem, and obtain some basic polyhedral properties, the dimension, the affine hull, and certain facets through an isomorphic projection. We also present a class of facets.

This paper briefly introduces the T-DMB standard based on Eureka-147 DAB and presents a new T-DMB transmission system, which uses a device called the Ensemble Remultiplexer, for mobile multimedia broadcasting service. And we verify the T-DMB standard by using the new transmission system with commercial equipment in the laboratory and in the field as moving on a car in high speed around urban districts surrounded by high buildings.

We propose a tool to manage several sorts of relationships among RDF (Resource Description Framework) and RDFS (RDF Schema). Our tool consists of three main functions: graphical editing of RDF descriptions, graphical editing of RDFS descriptions, and meta-model management facilities. In this paper, we focus on the meta-model management, a key concept which is defined as the appropriate management of the correspondence between a model and its meta-model: especially, the class and property in the meta-model, and the type of RDF resource and property in the model. The above facilities are implemented based on the plug-in system. We provide basic plug-in modules for checking the consistency of RDFS classes and properties. The prototyping tool, called MR3 (Meta-Model Management based on RDFs Revision Reflection), is implemented by Java language. Through an experiment using MR3, we show how MR3 contributes to the Semantic Web paradigm from the standpoint of RDFs description management.

In this paper, a practical clock-scheduling engine is introduced. The minimum feasible clock-period is obtained by using a modified Bellman-Ford shortest path algorithm. Then an optimum cost clock-schedule is obtained by using a bipartite matching algorithm. It also provides useful information to circuit synthesis tools. The experiment to a circuit with about 10000 registers and 100000 signal paths shows that a result is obtained within a few minutes. The computation time is almost linear to the circuit size in practice.

This paper proposes a technique for synthesizing speech with a desired speaking style and/or emotional expression, based on model adaptation in an HMM-based speech synthesis framework. Speaking styles and emotional expressions are characterized by many segmental and suprasegmental features in both spectral and prosodic features. Therefore, it is essential to take account of these features in the model adaptation. The proposed technique called style adaptation, deals with this issue. Firstly, the maximum likelihood linear regression (MLLR) algorithm, based on a framework of hidden semi-Markov model (HSMM) is presented to provide a mathematically rigorous and robust adaptation of state duration and to adapt both the spectral and prosodic features. Then, a novel tying method for the regression matrices of the MLLR algorithm is also presented to allow the incorporation of both the segmental and suprasegmental speech features into the style adaptation. The proposed tying method uses regression class trees with contextual information. From the results of several subjective tests, we show that these techniques can perform style adaptation while maintaining naturalness of the synthetic speech.

We propose a novel blind watermarking algorithm, called XFuseMark, which can hide a small, visually meaningful, grayscale logo in a host image instead of using a random-noise-like sequence based on the multiresolution fusion principles, and extract a recognizable version of the embedded logo even without reference to the original host data at the receiving end. XFuseMark is not only secure, i.e., only authorized users holding a private key are able to conduct the logo extraction operation, but also robust against noise addition and image compression. Experiments verify the practical performance of XFuseMark.

We present a training algorithm to create a neural network (NN) ensemble that performs classification tasks. It employs a competitive decay of hidden nodes in the component NNs as well as a selective deletion of NNs in ensemble, thus named a pruning algorithm for NN ensembles (PNNE). A node cooperation function of hidden nodes in each NN is introduced in order to support the decaying process. The training is based on the negative correlation learning that ensures diversity among the component NNs in ensemble. The less important networks are deleted by a criterion that indicates over-fitting. The PNNE has been tested extensively on a number of standard benchmark problems in machine learning, including the Australian credit card assessment, breast cancer, circle-in-the-square, diabetes, glass identification, ionosphere, iris identification, and soybean identification problems. The results show that classification performances of NN ensemble produced by the PNNE are better than or competitive to those by the conventional constructive and fixed architecture algorithms. Furthermore, in comparison to the constructive algorithm, NN ensemble produced by the PNNE consists of a smaller number of component NNs, and they are more diverse owing to the uniform training for all component NNs.

Flash bulk files downloading in style of P2P through perpendicular pattern becomes more popular recently. Many peers download different pieces of shared files from the source in parallel. They try to reconstruct complete files by exchanging needed pieces with other downloading peers. The throughput of entire downloading community, as well as the perceived downloading rate of each peer, greatly depends on uploading bandwidth contributed by every individual peer. Unfortunately, without proper built-in incentive mechanism, peers inherently tend to relentlessly download while intentionally limiting their uploading bandwidth. In this paper, we propose a both effective and efficient incentive approach--Reciprocity, which is only based on end-to-end measurement and reaction: a peer caps uploading rate to each of its peers at the rate that is proportional to its downloading rate from that one. It requires no centralized control, or electronic monetary payment, or certification. Preliminary experiments' results reveal that this approach offers favorable performance for cooperative peers, while effectively punishing defective ones.

We propose the concept of an opinion model for interactive multimodal services and apply it to an audiovisual communication service. First, psychological factors of an audiovisual communication service were extracted by using the semantic differential (SD) technique and factor analysis. Forty subjects participated in subjective tests and performed point-to-point conversational tasks on a PC-based video phone that exhibited various network qualities. The subjects assessed those qualities on the basis of 25 pairs of adjectives. Two psychological factors, i.e., an aesthetic feeling and a feeling of activity, were extracted from the results. Then, quality impairment factors affecting these two psychological factors were analyzed. We found that the aesthetic feeling was affected by IP packet loss and video coding bit rate, and the feeling of activity depended on delay time, video packet loss, video coding bit rate, and video frame rate. Using this result, we formulated an opinion model derived from the relationships among quality impairment factors, psychological factors, and overall quality. The validation test results indicated that the estimation error of our model was almost equivalent to the statistical reliability of the subjective score.

Cross-document personal name resolution is the process of identifying whether or not a common personal name mentioned in different documents refers to the same individual. Most previous approaches usually rely on lexical matching such as the occurrence of common words surrounding the entity name to measure the similarity between documents, and then clusters the documents according to their referents. In spite of certain successes, measuring similarity based on lexical comparison sometimes ignores important linguistic phenomena at the semantic level such as synonym or paraphrase. This paper presents a semantics-based approach to the resolution of personal name crossover documents that can make the most of both lexical evidences and semantic clues. In our method, the similarity values between documents are determined by estimating the semantic relatedness between words. Further, the semantic labels attached to sentences allow us to highlight the common personal facts that are potentially available among documents. An evaluation on three web datasets demonstrates that our method achieves the better performance than the previous work.

This paper describes a high-speed MT connector assembly method. This technique uses adhesive with a short hardening time, is highly reliable and does not require a polishing process, thus reducing the connector assembly time. First, we investigated an alpha-cyanoacrylate adhesive that hardens quickly and whose adhesive strength does not decrease under high humidity and high temperature conditions, thus ensuring its excellent reliability for outside use. In addition, we investigated variations in the position of the fiber endface on the ferrule endface with a view to obtaining a low insertion loss. Based on the results, we assembled an MT connector using our proposed high-speed assembly method. We confirmed that the assembly time could be reduced to less than 70% of the time required with the conventional method. MT connectors assembled using this technique have a low insertion loss and stable environmental characteristics.

Contract signing is a practical application of the fair exchange of digital signatures. This application used to be realized by directly adopting the results of the fair exchange of signatures, which do not completely meet the requirements of the signing of a secret contract. The assistance of a trusted third party (TTP) and some cryptographic technology are required to allow two parties to exchange their signatures through the network in a fair manner because these two parties potentially may be dishonest or mistrust each other. This paper presents a subtle method of preventing the off-line TTP from gaining the exchanged signature and the corresponding message when a dispute occurs between the two parties wherein the TTP is required to take part in the exchange procedure. An advanced concept, the non-disclosure property, is proposed in order to prevent a party from misusing evidence left during the exchange process. Two approaches, namely the secret divide method and the convertible signature are demonstrated. To satisfy the properties of the traditional paper-based contract signing, the technique of multi-signature scheme is used in the proposed protocols.

This letter proposes the thinnest hybrid EM wave absorber using a composite magnetic material, which can be applied to the 3 m semi anechoic chambers. We experimentally designed a new hybrid EM wave absorber of the wedge shape, which was made from the ferrite powder, the inorganic fiber and binder. As a result, the length of this absorber could be realized only 6 cm, which was ascertained having the nonflammable. The 3 m semi anechoic chamber is constructed in the size of L9 mW6 mH5.7 m using this absorber, and then the site attenuation is measured according to ANSI C63.4 in the frequency range of 30 MHz-1 GHz. As a result, the measured normalized site attenuation is obtained within 3 dB to the theoretical normalized site attenuation.

At Eurocrypt '02, Cramer and Shoup [1] proposed a general paradigm to construct practical public-key encryption schemes secure against the adaptive chosen ciphertext attack as well as several concrete examples. One of these example is the scheme based on the quadratic residuosity (QR) problem. However this scheme is less efficient than the other examples. In this paper, we construct a new variant of the Cramer-Shoup encryption scheme which is related to the QR problem. Our variant is more efficient than the scheme based on the QR problem.

This paper investigates the 10 m semi anechoic chamber using a new type hybrid EM wave absorber consisted of the grid-ferrite and the open-top hollow pyramidal EM wave absorber. We designed a new type hybrid EM wave absorber, which length could be slightly realized 65 cm. The 10 m semi anechoic chamber was constructed in the size of L21.5 mW13.5 mH8.9 m as the result of the ray-tracing simulation using this absorber. Then, the site attenuation in the constructed anechoic chamber was measured by using the broadband calculable dipole antennas. As the result, the maximum deviations between the measured site attenuation and theoretical calculated one were obtained within 3.6 dB in the frequency range of 30 MHz to 300 MHz. It was confirmed the validity of a new type hybrid EM wave absorber. Moreover, it was confirmed that the measured results agree with the ray-tracing simulation results, in which the differences are about 1.5 dB.

Grid computing is an open, heterogeneous and highly dynamic environment based on the principles of service oriented computing. It focuses on basic infrastructure for coordinated resource sharing among virtual organizations to achieve high performance and availability. However, use of existing Grid computing environment is quite complex and requires a lot of human intervention. In order to avoid this intervention, enhancements are required in bringing autonomy and semantics in existing Grid infrastructure. Semantics would act as glue for autonomy in the process of efficient resource discovery and utilization. Several ontologies and ontology languages have been proposed in this regard which not only have some shortcoming but also poses a sort of overhead for the Grid environment. On the other hand, agents are autonomous problem solving entities, and can negotiate semantically for interoperation with each other in dynamic environments. Inspired from the concept of Autonomous Decentralized Systems, we propose that the above mentioned goals can be achieved by integrating FIPA Multi Agent Systems with the Grid Service Architecture and hence to lay the foundation for Autonomous Semantic Grid. Autonomous Semantic Grid system architecture is aimed to provide an improved infrastructure by bringing autonomy, semantic interoperability and decentralization in the Grid computing for emerging applications. This paper then presents implementation details of first milestone toward Autonomous Semantic Grid realization based on a middleware, namely AgentWeb Gateway for integration of Multi Agent Systems and Grid Service Architecture. Evaluation of the system has also been performed over a number of application scenarios.