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.
Jeng-Shyang PAN Jing-Wein WANG
In this paper, a new feature which is characterized by the extrema density of 2-D wavelet frames estimated at the output of the corresponding filter bank is proposed for texture segmentation. With and without feature selection, the discrimination ability of features based on pyramidal and tree-structured decompositions are comparatively studied using the extrema density, energy, and entropy as features, respectively. These comparisons are demonstrated with separable and non-separable wavelets. With the three-, four-, and five-category textured images from Brodatz album, it is observed that most performances with feature selection improve significantly than those without feature selection. In addition, the experimental results show that the extrema density-based measure performs best among the three types of features investigated. A Min-Min method based on genetic algorithms, which is a novel approach with the spatial separation criterion (SPC) as the evaluation function is presented to evaluate the segmentation performance of each subset of selected features. In this work, the SPC is defined as the Euclidean distance within class divided by the Euclidean distance between classes in the spatial domain. It is shown that with feature selection the tree-structured wavelet decomposition based on non-separable wavelet frames has better performances than the tree-structured wavelet decomposition based on separable wavelet frames and pyramidal decomposition based on separable and non-separable wavelet frames in the experiments. Finally, we compare to the segmentation results evaluated with the templates of the textured images and verify the effectiveness of the proposed criterion. Moreover, it is proved that the discriminatory characteristics of features do spread over all subbands from the feature selection vector.
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.
This paper proves a general sampling theorem, which is an extension of Shannon's classical theorem. Let o be a closed subspace of square integrable functions and call o a signal space. The main aim of this paper is giving a necessary and sufficient condition for unique existence of the sampling basis {Sn}o without band-limited assumption. Using the general sampling theorem we rigorously discuss a frequency domain treatment and a general signal space spanned by translations of a single function. Many known sampling theorems in signal spaces, which have applications for multiresolution analysis in wavelets theory are corollaries of the general sampling theorem.
Mang LI Hidemitsu OGAWA Yukihiko YAMASHITA
We propose concepts of Paley-Wiener multiresolution analysis and Paley-Wiener wavelet frame based on general, not limited to dyadic, dilations of functions. Such a wavelet frame is an extension both of the Shannon wavelet basis and the Journe-Meyer wavelet basis. A concept of "natural" Paley-Wiener wavelet frame is also proposed to clarify whether a Paley-Wiener wavelet frame can naturally express functions from the point of view of the multiresolution analysis. A method of constructing a natural Paley-Wiener wavelet frame is given. By using this method, illustrative examples of Paley-Wiener wavelet frames with general scales are provided. Finally, we show that functions can be more efficiently expressed by using a Paley-Wiener wavelet frame with general scales.
Hitoshi YAMAUCHI Takayuki MAEDA Hiroaki KOBAYASHI Tadao NAKAMURA
The multipass rendering method based on the global illumination model can generate the most photo-realistic images. However, since the multipass rendering method is very time consuming, it is impractical in the industrial world. This paper discusses a massively parallel processing approach to fast image synthesis by the multipass rendering method. Especially, we focus on the performance evaluation of the view-dependent object-space parallel processing on the (Mπ)2 which has been proposed in our previous paper. We also propose two kinds of distributed frame buffer system named cached frame buffer and multistage-interconnected frame buffer. These frame buffer systems can solve the access conflict problem on the frame buffer. The simulation results show that the (Mπ)2 has a scalable performance. For example, the (Mπ)2 with more than 4000 processing elements can achieve an efficiency of over 50%. We also show that both of the proposed distributed frame buffer systems can relieve the overhead due to frame buffer access in the (Mπ)2 in the case that a large number of high-performance processing elements are adopted in the system.
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.
Su FENG Toshiki SAKABE Yasuyoshi INAGAKI
Dynamic Term Rewriting Calculus is a new computation model proposed by the authors for the purpose of formal description and verification of algorithms treating Term Rewriting Systems. The computation of DTRC is basically term rewriting. The characteristic features of DTRC are dynamic change of rewriting rules during computation and hierarchical declaration of not only function symbols and variables but also rewriting rules. These features allow us to program metacomputation of TRSs in DTRC, that is , we can implement in DTRC in a natural way those algorithms which manipulate term rewriting systems as well as those procedures which verify such algorithms. In this paper, we give a formal description of DTRC. We then show some results on confluence property of DTRC.
Mang Ll Hidemitsu OGAWA Yukihiko YAMASHITA
We propose a theory of general frame multiresolution analysis (GFMRA) which generalizes both the theory of multiresolution analysis based on an affine orthonormal basis and the theory of frame multiresolution analysis based on an affine frame to a general frame. We also discuss the problem of perfectly representing a function by using a wavelet frame which is not limited to being of affine type. We call it a "generalized affine wavelet frame." We then characterize the GFMRA and provide the necessary and sufficient conditions for the existence of a generalized affine wavelet frame.
Hiroaki KOBAYASHI Hitoshi YAMAUCHI Yuichiro TOH Tadao NAKAMURA
This paper proposes a hierarchical parallel processing system for the multipass rendering method. The multipass rendering method based on the integration of radiosity and ray-tracing can synthesize photo-realistic images. However, the method is also computationally expensive. To accelerate the multipass rendering method, the system, called (Mπ)2, employs two kinds of parallel processing schemes. As a coarse-grain parallel processing, object-space parallel processing with multiple processing elements based on the object-space subdivision is adapted, and each processing element (PE) is equipped with multiple pipelined units for a fine-grain parallel processing. To balance load among the system, static load balancing at the PE level and dynamic load balancing at the pipelined unit level within the PE are introduced. Especially, we propose a novel static load allocation scheme, skewed-distributed allocation, which can effectively distribute a three-dimensional object space to one- or two-dimensional processor configuration of the (Mπ)2 system. Simulation experiments show that the two-dimensional (Mπ)2 systems with the skewed-distributed allocation outperform the three-dimensional systems with the non-skewed distributed allocation. Since lower dimensional systems can be built at a lower cost than higher dimensional systems, the skewed-distributed allocation will be meritorious. Besides, by the combination of static load balancing by the skewed-distributed allocation and the dynamic load balancing by dynamic ray allocation within each PE, the system performance can be further boosted. We also propose a cached frame buffer system to relieve access collision on a frame buffer.
Kang-Hyun JO Kentaro HAYASHI Yoshinori KUNO Yoshiaki SHIRAI
This paper presents a vision-based human interface system that enables a user to move a target object in a 3D CG world by moving his hand. The system can interpret hand motions both in a frame fixed in the world and a frame attached to the user. If the latter is chosen, the user can move the object forward by moving his hand forward even if he has changed his body position. In addition, the user does not have to keep in mind that his hand is in the camera field of view. The active camera system tracks the user to keep him in its field of view. Moreover, the system does not need any camera calibration. The key for the realization of the system with such features is vision algorithms based on the multiple view affine invariance theory. We demon-strate an experimental system as well as the vision algorithms. Human operation experiments show the usefulness of the system.
Ikuo TAKAKUWA Akihiro MARUTA Masanori MATSUHARA
A beam adaptive frame for finite-element beam-propagation analysis is proposed. The width of the frame can be adapted itself to either the guiding structure or the propagating beam in optical circuits, so the size of the computational window can be reduced.
In this paper, the average error-rate characteristics are investigated as the number of users increases in the digital cellular DS/CDMA (Direct Sequence/Code Division Multiple Access) systems. Then, the performances of the various error control schemes applied to the data service of digital cellular DS/CDMA systems are compared and analyzed. That is, the performances of the conventional error control schemes such as Go-back-N ARQ (Automatic Repeat Request) and Selective-Repeat ARQ are analyzed in the circumstance of digital cellular DS/CDMA system. Also, the improved error control schemes which utilize the variable window size and/or variable data packet size are proposed and evaluated in order to improve the performances of the conventional error control scheme such as Quick-Repeat ARQ and WORM ARQ schemes in the digital cellular DS/CDMA system environments. According to the simulation results, the performances of the improved scheme with variable window and variable frame size are superior to those of the conventional scheme in the view of throughput and delay characteristics due to the robustness to the fading channel impairments.
Toyohide WATANABE Qin LUO Noboru SUGIE
The issue about document structure recognition and document understanding is today one of interesting subjects from a viewpoint of practical applications. The research objective is to extract the meaningful data from document images interpretatively and also classify them as the predefined item data automatically. In comparison with the traditional image-processing-based approaches, the knowledge-based approaches, which make use of various knowledge in order to interpret structural/constructive features of documents, have been currently investigated as more flexible and applicable methods. In this paper, we propose a totally integrated paradigm for understanding table-form documents from a viewpoint of the architectural framework.
A case structure expression is one of the most important forms to represent the meaning of the sentence. Case structure analysis is usually performed by consulting case frame information in a verb dictionary. However, this analysis is very difficult because of several problems, such as word sense ambiguity and structural ambiguity. A conventional method for solving these problems is to use the method of selectional restriction, but this method has a drawback in the semantic marker (SM) method --the trade-off between descriptive power and construction cost. In this paper, we propose a method of case structure analysis based on examples in case frame dictionary This method uses the case frame dictionary which has some typical example sentences for each case frame, and it selects a proper case frame for an input sentence by matching the input sentence with the examples in the case frame dictionary. The best matching score, which is utilized for selecting a proper case frame for a predicate, can be considered as the score for the case structure of the predicate. Therefore, when there are two or more readings for a sentence because of structural ambiguity, the best reading of a sentence can be selected by evaluating the sum of the scores for the case structures of all predicates in a sentence. We report on experiments which shows that this method is superior to the conventional, coarse-grained SM method, and also describe the superiority of the example-based method over the SM method.
Akira NAGAYAMA Shigefumi HOSOKAWA Tadashi HIRONO
A new automated main distributing frame (AMDF) system is developed that reduces operating costs in metallic-cable main distributing frames (MDFs) used for communication networks. In this AMDF system, a robot inserts connecting-pins into the crosspoint holes of matrix-boards. This process allows jumpering to be completed within three minutes and the route-setting for line testing within one minute. The AMDF system provides approximately 2,100 office equipment cable-terminals. Parallel installation of several AMDF systems allows larger MDF systems to be constructed. This system reduces costs and achieves high reliability through three new technologies: high-density matrix-board, precision pin-handling, and a highly reliable system control. Test results for a prototype AMDF system confirm their effectiveness.
Hideki TODE Noriaki KAMIYAMA Chikara OHTA Miki YAMAMOTO Hiromi OKADA
A new transfer mode and a switching architecture which can support loss free and no delay jitter service class with shorter switching delay compared with "stop and go queueing scheme" is proposed. This scheme combines ATM scheme with hierarchical STM framing concept.
Yuzo TAKAMATSU Taijiro OGAWA Hiroshi TAKAHASHI
In our recent work, a forward test generation method for sequential circuits by using a single time frame was proposed. In order to improve the effectiveness of the method, we introduced an extended mode which can handle the two time frames for a hard-to-test fault and a state escaping phase which can detect a sequence of unsuitable states for test generation. The experimental results show that the improved method is effective in generating higher coverage tests with a small number of tests.