Hiroyasu ISHIKAWA Naoyuki NAKADA Masaharu NAKAJI Guang-Yuan ZHAO Takashi EGAWA Takashi JIMBO Masayoshi UMENO
Investigations were carried out on metalorganic-chemical-vapor-deposition (MOCVD)-grown strained AlGaN/ GaN/sapphire structures using X-ray diffratometry. While AlGaN with lower AlN molar fraction (< 0.1) is under the in-plane compressive stress, it is under the in-plane tensile stress with high AlN molar fraction (> 0.1). Though tensile stress caused the cracks in AlGaN layer with high AlN molar fraction, we found that the cracks dramatically reduced when the GaN layer quality was not good. Using this technique, we fabricated a GaInN multi-quantum-well (MQW) surface emitting diodes were fabricated on 15 pairs of AlGaN/GaN distributed Bragg reflector (DBR) structures. The reflectivity of 15 pairs of AlGaN/GaN DBR structure has been shown as 75% at 435 nm. Considerably higher output power (1.5 times) has been observed for DBR based GaInN MQW LED when compared with non-DBR based MQW structures.
Hidenao TANAKA Atsushi NAKADAIRA
We studied Si and Mg doping characteristics in cubic GaN and fabricated a light emitting diode of cubic GaN on a GaAs substrate by metalorganic vapor-phase epitaxy. The diode structure consisted of undoped and Mg-doped GaN stacking layers deposited on Si-doped GaN and AlGaN layers. The electron-beam-induced-current signal and current injection characteristics of this diode structure were measured. There was a peak at the interface between the Mg-doped and undoped GaN in the electron-beam-induced-current signal. This shows successful growth of the p-n junction. Light emitting operation was achieved by currents injected through the conducting GaAs substrate of this diode at room temperature. We observed electroluminescence below the bandgap energy of cubic GaN with a peak at 2.6 eV.
Yasuhiko ARAKAWA Takao SOMEYA Koichi TACHIBANA
Our recent progress in GaN-based nanostructures for quantum dot (QD) lasers and vertical microcavity surface emitting lasers (VCSELs) is discussed. We have grown InGaN self-assembled QDs on a GaN epitaxial layer, using atmospheric-pressure metalorganic chemical vapor deposition. The average diameter of the QDs was as small as 8.4 nm and strong photoluminescence emission from the QDs was observed at room temperature. Furthermore, we found that InGaN QDs could be formed even after 10 QD layers were stacked, thus increasing the total QD density. Using these growth results, we fabricated a laser structure with InGaN QDs embedded in the active layer. A clear threshold was observed in the dependence of the emission intensity on the excitation energy at room temperature under optical excitation. We succeeded in demonstrating in lasing action in vertical cavity surface emitting lasers at room temperature with a cavity finesse of over 200.
Akito KURAMATA Shin-ichi KUBOTA Reiko SOEJIMA Kay DOMEN Kazuhiko HORINO Peter HACKE Toshiyuki TANAHASHI
We introduce the characteristics for continuous wave operation at room temperature of InGaN laser diodes fabricated on SiC substrates. The threshold current was 60 mA, the threshold voltage was 8.3 V, and the oscillation wavelength was 404.4 nm. The lifetime of the laser diodes with a constant light output of 1 mW at 25 was 57 hours. The heat dissipation of the devices mounted p-side-up on a stem without using a heat sink was shown to be as good as that of devices mounted p-side-down with an external heat sink, owing to the high thermal conductivity of SiC substrates.
A min-wise independent permutation family is known to be an efficient tool to estimate similarity of documents. Toward good understanding of min-wise independence, we present a characterization of exactly min-wise independent permutation families by size uniformity, which represents certain symmetry of the string representation of a family. Also, we present a general construction strategy which produce any exactly min-wise independent permutation family using this characterization.
Tetsuya HIROSHIMA Yuichiro MIYAMOTO Kokichi SUGIHARA
This paper presents a new proof to a polynomial-time algorithm for determining whether a given embedded graph is a Delaunay graph, i. e. , whether it is topologically equivalent to a Delaunay triangulation. The problem of recognizing the Delaunay graph had long been open. Recently Hodgson et al. gave a combinatorial characterization of the Delaunay graph, and thus constructed the polynomial-time algorithm for recognizing the Delaunay graphs. Their proof is based on sophisticated discussions on hyperbolic geometry. On the other hand, this paper gives another and simpler proof based on primitive arguments on Euclidean geometry. Moreover, the algorithm is applied to study the distribution of non-Delaunay graphs.
The minimum distance of a linear code C is a useful metric property for estimating the error correction upper bound of C and the maximum likelihood decoding of a linear code C is also of practical importance and of theoretical interest. These problems are known to be NP-hard to approximate within any constant relative error to the optimum. As a problem related to the above, we consider the maximization problem MAX-WEIGHT: Given a generator matrix of a linear code C, find a codeword c C with its weight as close to the maximum weight of C as possible. It is shown that MAX-WEIGHT PTAS unless P=NP, however, no nontrivial approximation upper and lower bounds are known. In this paper, we investigate the complexity of MAX-WEIGHT to make the approximation upper and lower bounds more precise, and show that (1) MAX-WEIGHT is APX-complete; (2) MAX-WEIGHT is approximable within relative error 1/2 to the optimum; (3) MAX-WEIGHT is not approximable within relative error 1/10 to the optimum unless P=NP.
Xiaohua ZHANG Hiroki TAKAHASHI Masayuki NAKAJIMA
The construction of photo-realistic 3D scenes from video data is an active and competitive area of research in the fields of computer vision, image processing and computer graphics. In this paper we address our recent work in this area. Unlike most methods of 3D scene construction, we consider the generation of virtual environments from video sequence with a video-cam's forward motion. Each frame is decomposed into sub-images, which are registered correspondingly using the Levenberg-Marquardt iterative algorithm to estimate motion parameters. The registered sub-images are correspondingly pasted together to form a pseudo-3D space. By controlling the position and direction, the virtual camera can walk through this virtual space to generate novel 2D views to acquire an immersive impression. Even if the virtual camera goes deep into this virtual environment, it can still obtain a novel view while maintaining relatively high resolution.
Knowledge-based program understanding is widely known as one of the key issues in programming education support systems and environments for novices. Most program understanders, however, have limitations. One of them is an ability to deal with a single programming language, while human tutors can comprehend plural languages by means of generalized knowledge on programming languages and techniques. This paper proposes the concepts and methodology of the knowledge-based program understander ALPUS II, which deals with plural programming languages, i. e. , Pascal and C, by means of generalized abstract syntax AL and knowledge representations based on it. ALPUS II is an extension of ALPUS, which dealt with a single programming language Pascal, and is a sub-system of an intelligent programming environment INTELLITUTOR. The INTELLITUTOR system consists of a guided programming editor GUIDE and a knowledge-based program understander ALPUS II, and is available on the Internet. In the process of comprehension source statements written in Pascal or C are translated into AL representation first. Since the contents of the programming knowledge bases are adjusted to deal with the AL representations the program comprehension procedure is available for both Pascal and C. It is possible to append other programming languages by simply attaching a transformation module for each additional procedural language. It is noted that knowledge acquisition tasks for additional languages are not needed since the contents of the knowledge base are generalized for multiple use. The INTELLITUTOR system was implemented in the frame-based knowledge engineering environment ZERO on a UNIX server machine in the Internet environment. ALPUS II demonstrates interesting features in program comprehension for the C language by means of the transformed knowledge from the already available knowledge for Pascal, which was developed for ALPUS, in a feasibility study. The current version of ALPUS II supports almost full specifications for Pascal and a Pascal-associated subset for C. This limitation should be reasonable for programming practice at freshmen classes of a university.
There are the following three targets to be achieved in a software project from the three viewpoints of process management (or progress management), cost management, and quality management for software project to be successful: (a) drafting a software development plan based on accurate estimation, (b) early detection of risks that the project includes based on correct situation appraisal, (c) early avoidance of risks that the project includes. In this paper, the authors propose a method and facilities to project risks in a software project through Kepner-Tregoe program, and propose schedule re-planning by using genetic algorithm for avoiding the projected risks. Furthermore the authors show, from the results of execution of the system, that the system is effective in early avoidance of risks that the software project includes.
This paper proposes a method of automatically eliciting knowledge which is used to detect feature interactions in telecommunication services. With conventional methods, the knowledge is provided manually. With the proposed method, the knowledge is automatically elicited as service constraints. In telecommunication systems, when a new service is added, new state transitions are created. In case of new service, the new state should be reached in the state transitions. On the other hand, some states of existing services should not be reached. These constraints can be considered as knowledge for detecting feature interactions. This paper also proposes a scenario for detecting feature interactions using elicited knowledge. This scenario was confirmed as effective.
Hideaki SUGIMOTO Atsushi OHNISHI
A software requirements specification (SRS) is a document at the first phase of software development. Since it is difficult to make an accurate SRS at the beginning of software development, we propose a supporting method to detect and interpret the inconsistency of SRS. First, we classify and define the inconsistency of SRS. Next, we describe how to detect and interpret the inconsistency of SRS. We use the Requirements Frame Model to detect the inconsistency of SRS. We apply the Dempster and Shafer's theory to interpret the inconsistency of SRS. We illustrate our method with an example.
Takahiro NAKANISHI Motoshi SAEKI
In a software maintenance phase, since quality assurance engineers frequently only change source codes, the consistency between the source codes and their specification documents cannot be kept. In this paper we propose a supporting technique for changing specification documents automatically so that the specifications can be consistent with the source codes. In our technique, we represent a program with multiple graphs and we consider the changes on programs as the modification of the graphs. The modification of the graphs is formalized with a sequence of the operation on the graphs. We design the rules of how to relate the operations on program graphs to the operations on graphs that represent specification documents. By applying these rules, we can detect what modification and which parts of the specification document should be made to maintain the consistency between the specification and the program, when the program is modified.
The quality of an architectural design of a software system has a great influence on achieving non-functional requirements to the system, so formal evaluation and validation techniques to designed architectures are necessary in the early phase of development processes. In this paper, we present a technique for describing software architectures formally based on Coloured Petri Nets (CPNs) and a technique for reusing architectural constituents. Architectural descriptions are essentially written with a CPN language, so that the evaluation and analysis on the architectural descriptions can be made in architectural design phrase. We extract reusable architectural parts from standard architecture styles and architectural patterns so that a designer can construct an architecture by only retrieving the parts and combine them. We also designed the language for describing the combination of the architectural parts. To show the effectiveness of our techniques, we illustrate how a blackboard architecture can be composed of reusable parts and be simulated on a CPN tool (Design/CPN).
Takashi HATASHIMA Toshihiro MOTODA Shuichiro YAMAMOTO
We describe an index for estimating the level of interest in Web pages. This "time-based interest" (TBI) index combinates an equation reflecting page accesses and an equation reflecting the decrease in interest over time. These equations work simultaneously by using a parameter that is based on the time since the last access. We experimentally estimated the decrease ratio of the TBI index and evaluated the characteristics of the TBI equation. We found that the index follows Zipf's distribution, indicating that reflects the change in popularity. We also introduce an access-log analysis system called CyberRanking that includes TBI analysis. CyberRanking analyzes the access logs of Web servers and presents the results in 2-D or 3-D graph on a Web browser.
Si-Gwan KIM Seung Ryoul MAENG Jung Wan CHO
We present efficient all-to-all personalized communication algorithms for a 2D torus in wormhole-routed networks. Our complete exchange algorithms reduce the number of start-up by a factor of up to 2, which is a good metric for network performance in wormhole networks. Our algorithms divide the whole network into 22 networks, giving two contention-free networks with N/2N/2. After specially designated nodes called master nodes have collected messages, whose destinations are the rest of the basic cells, only master nodes perform complete exchange with a reduced network size. When finished with this complete exchange among master nodes, these nodes distribute messages to the rest of the master nodes, which results in the desired complete exchange. Then, we present a modified algorithm that further reduces the data transmission time sacrificing the start-up time. After we present our new algorithms, we analyze time complexities and compare several algorithms. We show that our practical algorithm is efficient by a factor of 2 in the required start-up time which means that our algorithms are suitable for wormhole-routed networks.
Alexander I-Chi LAI Chin-Laung LEI Hann-Huei CHIOU
Distributed shared memory (DSM) systems on top of network of workstations are especially vulnerable to the impact of false sharing because of their higher memory transaction overheads and thus higher false sharing penalties. In this paper we develop a dynamic-granularity shared memory management scheme that eliminates false sharing without sacrificing the transparency to conventional shared-memory applications. Our approach utilizes a special threaded splay tree (TST) for shared memory information management, and a dynamic token-based path-compression synchronization algorithm for data transferring. The combination of the TST and path compression is quite efficient; asymptotically, in an n-processor system with m shared memory segments, synchronizing at most s segments takes O(s log m log n) amortized computation steps and generates O(s log n) communication messages, respectively. Based on the proposed scheme we constructed an experimental DSM prototype which consists of several Ethernet-connected Pentium-based computers running Linux. Preliminary benchmark results on our prototype indicate that our scheme is quite efficient, significantly outperforming traditional schemes and scaling up well.
Masakazu FURUICHI Atsuo OZAKI Kazuhiro ABE Katsuto NAKAJIMA Hidetoshi TANAKA
This paper proposes a Space-Time Object Model, an object oriented model that possesses space and time management mechanisms. The goal of this object model is to provide a common software infrastructure for implementing large-scale moving object simulations efficiently, such as car traffic simulations and disaster evacuation simulations, using a direct mapping scheme on a parallel and distributed computing environment. In this object model, the software infrastructure provides two principal functions, "Space Management" and "Time Management," which allows programmers to focus on application programming instead of parallel programming. Although there are several known infrastructure software, which provide the environment needed to develop and execute parallel and distributed simulations, they only provide a "Time Management" mechanism. In this paper, we present a Space-Time Object Model and an overview of a program called OSim, which is an implementation of the Space-Time Object Model. Then, we demonstrate the applicability and efficiency of this model by introducing the overview and evaluation results of a parallel car traffic simulation system using OSim.
Ji-Hoon KANG Ki-Hyung HONG Kyu-Young WHANG Jung-Wan CHO
In this paper, we consider linearization of nonlinear datalog programs with multiple bilinear rules and multiple linear rules. If a nonlinear program can be linearized, it is possible to process queries on the program efficiently by using well-known cost-effective techniques for linear programs. We define a transformation, called Right-Linear-First (RLF) transformation, for linearizing such nonlinear programs. A nonlinear program is RLF-linearizable if it is logically equivalent to its RLF-transformed program. We present three sufficient conditions, called LCR-consistency, LCRN1-consistency, and LCRN2-consistency, for identifying such RLF-linearizable programs. These conditions can be tested in polynomial time. Our work presented in this paper extends the work on ZYT-linearizability in a sense that RLF-linearizability considers multiple bilinear rules with multiple linear rules.
Jianjun YAN Naoyuki TOKUDA Juichi MIYAMICHI
We have developed a new efficient neural network-based algorithm for Alife application in a competitive world whereby the effects of interactions among organisms are evaluated in a weak form by exploiting the position of nearest food elements into consideration but not the positions of the other competing organisms. Two online learning algorithms, an instructive ASL (adaptive supervised learning) and an evaluative feedback-oriented RL (reinforcement learning) algorithm developed have been tested in simulating Alife environments with various neural network algorithms. The constructive compound neural network algorithm FuzGa guided by the ASL learning algorithm has proved to be most efficient among the methods experimented including the classical constructive cascaded CasCor algorithm of [18],[19] and the fixed non-constructive fuzzy neural networks. Adopting an adaptively selected best sequence of feedback action period Δα which we have found to be a decisive parameter in improving the network efficiency, the ASL-guided FuzGa had a performance of an averaged fitness value of 541.8 (standard deviation 48.8) as compared with 500(53.8) for ASL-guided CasCor and 489.2 (39.7) for RL-guided FuzGa. Our FuzGa algorithm has also outperformed the CasCor in time complexity by 31.1%. We have elucidated how the dimensionless parameter food availability FA representing the intensity of interactions among the organisms relates to a best sequence of the feedback action period Δα and an optimal number of hidden neurons for the given configuration of the networks. We confirm that the present solution successfully evaluates the effect of interactions at a larger FA, reducing to an isolated solution at a lower value of FA. The simulation is carried out by thread functions of Java by ensuring the randomness of individual activities.