In this paper face feature detection and tracking are discussed, using methods called edge pixel counting and deformable circular template matching. Instead of utilizing color or gray scale information of the facial image, the proposed edge pixel counting method utilizes the edge information to estimate the face feature positions such as eyes, nose and mouth, using a variable size face feature template, the initial size of which is predetermined by using a facial image database. The method is robust in the sense that the detection is possible with facial images with different skin color and different facial orientations. Subsequently, by using a deformable circular template matching two iris positions of the face are determined and are used in the edge pixel counting, to track the features in the next frame. Although feature tracking using gray scale template matching often fails when inter frame correlation around the feature areas are very low due to facial expression change (such as, talking, smiling, eye blinking etc.), feature tracking using edge pixel counting can track facial features reliably. Some experimental results are shown to demonstrate the effectiveness of the proposed method.

This paper describes, from a system architectural viewpoint, how knowledge-based technologies have been utilized in developing EXLOG (an LSI circuit synthesis system) and SOFTEX (a software synthesis system) inside the authors' projects. Although the system architectures for EXLOG and SOFTEX started from the same production systems, consisting of transformation rules in the middle of the 1980's, both branched off in different directions in the 1990's. Based on experiences with EXLOG and SOFTEX, the differences between LSI and software design models are discussed, and the future directions are indicated for the knowledge-based design system architectures.

The two-dimensional scattering problem of electromagnetic waves by a perfectly conducting wedge is analyzed by means of the Wiener-Hopf technique together with the formulation using the partition of scatterers. The Wiener-Hopf equations are derived on two complex planes. Investigating the mapping between these complex planes and introducing the appropriate functions which satisfy the edge condition of the wedge, the solutions of these equations are obtained by the decomposition procedure of functions. By deforming the integration path of the Fourier inverse transform, it is found that the representation of the scattered wave is in agreement with the integral representation using the Sommerfeld contours.

We have investigated the Josephson microwave self-radiation and the linewidth from different types of YBa2Cu3Oy(YBCO) grain boundary junctions: natural grain boundary junctions, step-edge junctions and bicrystal junctions. The Josephson self-rediation was directly observed using a total power radiometer receiver with receiving frequencies fREC=1.7-72 GHz. All junctions exhibited microwave self-radiation peaks with intensity of order of 10-12-10-14 W. For step-edge and bicrystal junction, they appeared at a voltage related to the Josephson frequency-voltage relation, V=n(h/2e)f, while for natural grain boundary junctions, the above relation did not hold, suggesting a Josephson medium property. For all types of junctions the observed Josephson linewidth deviated from the theoretical RSJ values due to the extra noise source in the grain boundary junction. The Josephson linewidth decreased with increasing the receiving frequency for all type of junctions. The reduction of Josephson linewidth at higher frequencies indicates that the critical current fluctuations due to a critical current spread at small bias voltages and a crystalline disorientation at the junction boundary generate an additional noise in grain boundary junctions.

This paper describes a model of kanji (Chinese characters) learning, called KASTAM (Knowledge Acquisition and STAbility Model), in order to develop a CAI system which supports a student to stabilize her/his kanji knowledge. KASTAM can handle kanji learning as complementary acquisition and stability processes of kanji knowledge.

This paper discusses some problems in Molecular Biology for which learning paradigms are strongly desired. We also present a framework of knowledge discovery by PAC-learning paradigm together with its theory and practice developed in our work for discovery from amino acid sequences.

Many combinatorial problems can be efficiently solved for partial k-trees (graphs of treewidth bounded by k). The edge-coloring problem is one of the well-known combinatorial problems for which no NC algorithms have been obtained for partial k-trees. This paper gives an optimal and first NC parallel algorithm to find an edge-coloring of any given partial k-tree with bounded degrees using a minimum number of colors. In the paper k is assumed to be bounded.

We model a road network as a directed graph G(V,E) with a source s and a sink t, where each edge e has a positive length l(e) and each vertex v has a distribution function αv with respect to the traffic entering and leaving v. This paper proposes a polynomial time algorithm for evaluating the importance of each edge e E whicn is defined to be the traffic f(e) passing through e in order to assign the required traffic Fst(0) from s to t along only shortest s-t paths in accordance with the distribution function αv at each vertex v.

The concept of flexible system is long being used by many researchers, aiming to solve some particular problem of adaptation. The problem is viewed differently in different situations. In this paper, we first give a set of definitions and specifications to generalize this concept applicable to any system and in particular to communication networks. Through these definitions we will formalize, what are the conditions a system should satisfy to be called as a Flexible Communication System. The rest of the paper we formalize the concepts of flexible information network, and propose an agent oriented architecture that can realize it.

A multi-channel high temperature superconducting interference device (high Tc SQUID) system with high magnetic field resolution has been developed. Step edge junctions were employed as weakly coupled Josephson junctions for the SQUID. These junctions worked well and their I-V curves fit the resistively shunted junction (RSJ) model. The SQUID design was investigated to improve magnetic field resolution. The size of the SQUID's center hole was investigated, and we found the optimized size of the hole to be about 25 µm. Meissner effect of superconductor was used in order to concentrate magnetic fluxes. A large washer SQUID and a flux concentrating plate was developed to concentrate magnetic flux to the SQUID center hole. The magnetic field resolution became 370 fT/Hz at 10 Hz and 220 fT/Hz at 10 kHz. This field resolution was enough to detect biomagnetic signals such as magnetocardiac signals. The SQUID was mounted on a special chip carrier and was sealed with epoxy resin for protection from humidity. We have designed and developed a 4-channel and a 16-channel high Tc SQUID system. We used them in a magnetically shielded room to measure magnetic signals of the human heart. We obtained clear multi-channel magnetocardiac signals, which showed clear so called QRS and T wave peaks. A clear isofield contour map of magnetocardiac signals was also obtained. These data indicated that high Tc SQUID is feasible for these biomagnetic applications.

This paper discusses the role of knowledge in document image understanding from the viewpoints of representation, utilization and acquisition. For the representation of knowledge, we propose two models, a layout model and a content model, which represent knowledge about the layout structure and content of a document, respectively. For the utilization of knowledge, we implement layout analysis and content analysis which utilize a layout model and a content model, respectively. The strategy of hypothesis generation and verification is introduced in order to integrate these two kinds of analysis. For the acquisition of knowledge, we propose a method of incremental acquisition of a layout model from a stream of example documents. From the experimental results of document image understanding and knowledge acquisition using 50 samples of visiting cards, we verified the effectiveness of the proposed method.

The effects of finite ground plane upon the patterns of the GPS patch antennas are analyzed by EEC with modified edge representation (MER). The comparison with UTD and measurements shows that low elevation patterns including axial ratios are successfully predicted.

Physical optics (PO) is an approximation method for high-frequency scattering and diffraction problems. But PO fields are inaccurate in the shadow region where the source is screened by the scatterer. It has been difficult to extract the mechanism of this error because PO includes numerical integration. In 2-D problems, PO fields are analytically and accurately expressed in terms of PO equivalent edge currents (PO-EECs) which represent the leading contributions of PO original integration. Comparison of PO in this form and geometrical theory of diffraction (GTD) which gives accurate fields in the shadow region, clarifies the cause of PO errors. For a scatterer with a corner, PO errors are mainly due to the rays emanating from the invisible edges. For a curved surface scatterer, the contributions penetrating the scatterer are small and main PO errors generally consist in PO-EECs itself.

A network system is proposed for segmenting and extracting multiple moving objects in 2D images. The system uses an interconnected neural network in which grouping factors, such as edge proximity, smoothness of edge orientatio, and smoothness of velocity perpendicular to an edge, are embedded. The system groups edges so that the network energy may be minimized, i.e. edges may be organized into perceptually plausible configuration. Experimantal results are provided to indicate the performance and noise robustness of the system in extracting objects in synthetic images.

The use of computers with private networks has accelerated the electronic storage of business information in office systems. With the rapid progress in processing capability and small sizing of the computer world, private networks are going to be more intelligent. The utilization of shared information is a key issue in modern organizations, in order to increase the productivity of white-collar workers. In the CSCW research field, it is said that informal and unstructured information is important in group work contexts but difficult to locate in a large organization. Many researchers are paying particular attention to the importance of support systems for such information. These kinds of information are called Organizational memory or Group Memory. Our research focuses on knowledge propagation with private networks in the organization. This means emphasis on the process; with which organized information or the ability to use information is circulated throughout the organization. Knowledge propagation has three issues: knowledge transmission, destination locating and source locating. To cope with these issues we developed FISH, which stands for Flexible Information Sharing and Handling system. FISH was designed to provide cooperative information sharing in a group work context and to explore knowledge propagation. FISH stores fragmental information as cards with multiple keywords and content. This paper discusses a three-layered model that describes computer supported knowledge transmission. Based on this model, three issues are discussed regarding knowledge propagation. FISH and its two-year experiment are described and knowledge propagation is explored based on the results of this experiment.

An exact analysis for magnetostatic surface wave excitation by a single microstrip is presented. Conventional approaches for such an excitation problem do not explain experimental results in a reasonable manner. The theory proposed here explains radiation resistances obtained by experiments, owing to having considered the edge conditions and an expansion form of excitation current on the microstrip properly.

In this paper, we investigate the knowledge complexity of interactive proof systems and show that (1) under the blackbox simulation, if a language L has a bounded move public coin interactive proof system with polynomially bounded knowledge complexity in the hint sense, then the language L itself has a one move interactive proof system; and (2) under the blackbox simulation, if a language L has a three move private coin interactive proof system with polynomially bounded knowledge complexity in the hint sense, then the language L itself has a one move interactive proof system. These results imply that as long as the blackbox simulation is concerned, any language L AM＼MA is not allowed to have a bounded move public coin (or three move private coin) interactive proof system with polynomially bounded knowledge complexity in the hint sense unless AM = AM. In addition, we present a definite distinction between knowledge complexity in the hint sense and in the strict oracle sense, i.e., any language in AM (resp. IP) has a two (resp. unbounded) move public coin interactive proof system with polynomially bounded knowledge complexity in the strict oracle sense.

This paper presents a zero-knowledge interactive protocol that demonstrates two factors a and b of a composite number n (=ab) are really known by the prover, without revealing the factors themselves. Here the factors a and b need not be primes. The security of the protocol is based on the difficulty of computing discrete logarithms modulo a large prime.

In this paper, we study the knowledge tightness of zero-knowledge proofs. To this end, we present a new measure for the knowledge tightness of zero-knowledge proofs and show that if a language L has a bounded round zero-knowledge proof with knowledge tightness t(|x|) 2 - |x|-c for some c 0, then L BPP and that any language L AM has a bounded round zero-knowledge proof with knowledge tightness t(|x|) 2-2-O(|x|) under the assumption that collision intractable hash functions exist. This implies that in the case of a bounded round zero-knowledge proof for a language L BPP, the optimal knowledge tightness is "2" unless AM = BPP. In addition, we show that any language L IP has an unbounded round zero-knowledge proof with knowledge tightness t(|x|) 1.5 under the assumption that nonuniformly secure probabilistic encryptions exist.

This paper describes the concepts and methodologies of the INTELLITUTOR system which is an integrated intelligent programming environment for learning programming. INTELLITUTOR attempts to work as a human programming tutor to guide a user, i.e., a student, in writing a computer program, to detect logical errors within it, and to make advices not only for fixing them but also for letting him notice his misunderstandings. The system consists of three major modules, i.e., GUIDE, ALPUS and TUTOR. GUIDE is a guided editor for easy coding, ALPUS is an algorithm-based program understander, and TUTOR is an embedded-intelligent tutoring system for programming education. The ALPUS system can infer user's intentions from buggy codes in addition to detecting logical errors by means of knowledge-based reasoning. ALPUS uses four kinds of programming knowledge: 1) knowledge on algorithms, 2) Knowledge on programming techniques, 3) Knowledge on a programming language, and 4) Knowledge on logical errors. These knowledge are organized in a hierarchical procedure graph (HPG) as a multi-use knowledge base. The knowledge on logical errors was obtained by means of cognitive experiments. The student model is built by means of the results of ALPUS and interactions between a student and the system. Teaching is done based on the student model. Because the ITS subsystem, i.e., TUTOR, is embedded within the intelligent programming environment interactions for creating the student model could be minimized. Although the current system deals with the PASCAL language, most of the knowledge is applicable to those of procedure-oriented programming languages. The INTELLITUTOR system was implemented in the frame-based knowledge engineering environment ZERO and working on a UNIX workstation for system evaluation.