Toru TAKAHASHI Keiichi TOKUDA Takao KOBAYASHI Tadashi KITAMURA
This paper defines a new kind of a mixture density model for modeling a quasi-stationary Gaussian process based on mel-cepstral representation. The conventional AR mixture density model can be applied to modeling a quasi-stationary Gaussian AR process. However, it cannot model spectral zeros. In contrast, the proposed model is based on a frequency-warped exponential (EX) model. Accordingly, it can represent spectral poles and zeros with equal weights, and, furthermore, the model spectrum has a high resolution at low frequencies. The parameter estimation algorithm for the proposed model was also derived based on an EM algorithm. Experimental results show that the proposed model has better performance than the AR mixture density model for modeling a frequency-warped EX process.
Natsume MATSUZAKI Toshihisa NAKANO Tsutomu MATSUMOTO
This paper proposes a flexible tree-based key management framework for a terminal to connect with multiple content distribution systems (called as CDSs in this paper). In an existing tree-based key management scheme, a terminal keeps previously distributed node keys which are used for decrypting contents from a CDS. According to our proposal, the terminal can calculate its node keys of a selected CDS as the need arises, using the "public bulletin board" of the CDS. The public bulletin board is generated by a management center of the individual CDS, depending on a tree structure which it determines in its convenience. After the terminal calculates its node keys, it can get a content of the CDS using the calculated node keys.
Yoshiki SAMESHIMA Toshiyuki TSUTSUMI
This paper describes User Attribute with Validity Period extension field of public key certificate and Certificate Verification Service with Time Stamp. The field and service solve the problems of unavailability of the latest revoked certificate information, large size of the revocation information and lack of non-repudiation mechanism of the X. 509 Authentication Framework. The proposed extension field is useful to reduce the revoked certificate information sent from CA of an organization where there are periodical personnel changes. The Certificate Verification Service with Time Stamp is an on-line service providing certificate status and non-repudiation service. The paper shows how the combination of the field and service solves the problems and that the server can serve hundreds of thousands of messaging system users, and the security of the service is also discussed.
Jae-Young KIM Hong-Taek JU James Won-Ki HONG Seong-Beom KIM Chan-Kyou HWANG
Today's complicated and heterogeneous telecommunication network environments need fully-integrated, cost-effective, user-friendly management systems. When developing such management systems in distributed environments, many telecommunication companies are carefully adopting CORBA and Java technologies. CORBA technology enables developers to create and manipulate distributed management system components easily while Java technology liberates human users from complicated and proprietary management system interfaces. In this paper, we propose a TMN-based integration framework for distributed network management by combining both CORBA and Java technologies. The framework generalizes a logically-layered architecture from the management agents layer to the user interface layer. It also provides generalized TMN management interfaces using inter-domain gateway systems for coordinating heterogeneous management protocols. By using these interfaces, TMN management function components can be easily constructed as CORBA objects to provide powerful TMN management services to administrators via user-friendly Web browsers. On the basis of this framework, we have designed and implemented a TMN alarm surveillance system which realizes our framework.
Toshiko WAKAKI Ken SATOH Katsumi NITTA Seiichiro SAKURAI
In the commonsense reasoning, priorities among rules are often required to be found out in order to derive the desired conclusion as a theorem of the reasoning. In this paper, first we present the bottom-up and top-down abduction procedures to compute skeptical explanations and secondly show that priorities of circumscription to infer a desired theorem can be abduced as a skeptical explanation in abduction. In our approach, the required priorities can be computed based on the procedure to compute skeptical explanations provided in this paper as well as Wakaki and Satoh's method of compiling circumscription into extended logic programs. The method, for example, enables us to automatically find the adequate priority w. r. t. the Yale Shooting Problem to express a human natural reasoning in the framework of circumscription.
Motohiro SUZUKI Yoshiaki KIRIHA Shoichiro NAKAI
We have developed a management agent that adapts the delegation concept to achieve efficient network management. In conventional delegation architecture, a network management operator details management operations in an operation-script that describes management operation flow and such network management functions as event management and path tracing. The operator sends this script to agents to execute. In our delegation architecture, the operator sends only a script skeleton describing management operation flow alone; management functions are built into the agents in the form of fuction objects. This helps keep management traffic low. Each function object is designed by utilizing three operational objects: enhanced, primitive, and communication. Each enhanced operational object (EOO) provides a script skeleton with an individual network management function. A primitive operational object (POO) provides an EOO with managed object (MO) access functions. A communication operational object (COO) provides an EOO with a mechanism for accessing the functions of other remote EOOs. We have tested our design by applying it to a path tracing application, and we have measured the total data transfer size between a manager and an agent and the amount of memory usage in our agent's running environment. Evaluation of our implementation suggests that our design can be applied such network management functions as connection establishment and release, fault isolation, and service provisioning.
Toru SUGIMOTO Akinori YONEZAWA
As a general basis for constructing a cooperative and flexible dialogue system, we are interested in modelling the inference process of an agent who participates in a dialogue. For this purpose, it is natural and powerful to model it in his general cognitive framework for problem solving. This paper presents such a framework. In this framework, we represent agent's mental states in the form called Mental World Structure, which consists of multiple mental worlds. Each mental world is a set of mental propositions and corresponds to one modal context, that is, a specific point of view. Modalities in an agent's mental states are represented by path expressions, which are first class citizens of the system and can be composed each other to make up composite modalities. With Mental World Structure, we can handle modalities more flexibly than ordinary modal logics, situation theory and other representation systems. We incorporate smoothly into the structure three basic inference procedures, that is, deduction, abduction and truth maintenance. Precise definitions of the structure and the inference procedures are given. Furthermore, we explain as examples, several cooperative dialogues in our framework.