Jun'ichi Miyao

Visualized and modeless programming environment for form manipulation language

A visualized and modeless programming environment VPF (Visualized Programming environment for Form manipulation language) is presented. The VPF supports the development of programs written in a programming language called a form manipulation language. The language is a so-called iconic language and provides not only programming facilities but also form-oriented operations. VPF provides the following features: (1) hierarchical views that support views for various abstract levels of program specification and execution; (2) visualization of the program itself and its run-time behavior with graphical representation; and (3) modeless operations that enable a program to be developed under only one execution mode. These features give the programmers good comprehension of program development and enhance productivity and reliability of the application programs.<<ETX>>

Hierarchical floorplanning and detailed global routing with routing-based partitioning

A hierarchical floorplanning method is presented in which it is possible to determine simultaneously a floorplan and detailed global routes which directly correspond to switchboxes and channels. In this method, since the precise estimation of congestion of channels and switchboxes is possible, no extremely congested channels and switchboxes are created. Experimental results show that the method can produce an optimal floorplan in terms of congestion.<<ETX>>

A framework of a visual language with dynamic specification

The behavior of complex software may be changed depending on the external environment such as user profile, available resources, input data, time, and so on. Design of such dynamic software in conventional languages needs extra effort to keep consistency among behaviors for all states. We propose an object oriented visual language for dynamic software and its visualized specification with dynamics presentation. The language supports dynamic behavior according to both time-dependent and time-independent external states based on dynamic objects. In the visualized specification, we present uniform dynamics presentation for all elements in the language based on three concepts of snapshot, overlap and sweep.

A semantic approach to usability in relational database systems

This paper attempts to design a user-friendly interface which enhances usability of relational database systems. Our approach to usability is to design a semantic data model suitable for a user interface and provide an easy-to-use query language DOMCALC (domain calculus language) which is based on the semantic data model. A query in DOMCALC can be described in terms of intuitive notions, namely domains, instead of relations and attributes. That is, DOMCALC requires for users no knowledge of a conceptual database such as relation names and attribute names. Therefore, the usability based on the semantic data model removes the requirement of knowledge of a conceptual database from users and protects user views from changes in the conceptual database. We also describe an outline of a database system PRIM (Prototype of Laboratory information Management System) which has been developed with the above considerations. This is a step toward the enhancement of usability in relational database systems.

A Visual Language for Forms Definition and Manipulation

An office information system plays a key role in office automation. The most important factor in the office information system is a user-friendly interface, since office workers may be novices for computers. Forms provide a uniform and comfortable interface with the office workers, since much information within an office is found in forms such as reports, letters, and memorandums. Therefore, office information systems should be based on electronic forms which are the computer analog of paper forms.

A reliable software architecture for complex embedded systems

Embedded microprocessors are widely used in many kinds of industrial products, and the number of processors in a product has been greatly increased. Thus, such a system constitutes a complex embedded system which is distributed and reliable. I propose a software architecture for complex embedded systems based on the concepts of autonomous error checking and correction, acceptance test with load control, and request deletion. They will resolve the problems of unexpected overload, interference from other processors, and no protection for software failure or bugs.

A fast heuristic algorithm for hypergraph bisection

Presents an efficient heuristic algorithm for the min-cut bisection of hypergraphs. In this algorithm, first, a given hypergraph is transformed into a graph called the netgraph, and then a solution is found on this netgraph. Since a netgraph can explicitly represent the weight of nodes of a hypergrap, it is easy to partition a hypergraph into two hypergraphs with the same size. The computation time of the proposed method is O(m/sup 2/), where m is the number of nodes of a given hypergraph. Simulation results show that the proposed method produces better solutions in a shorter time compared with existing, methods, and that the solution is always balanced with the size of the partitioned hypergraphs.<<ETX>>

An approach to form creation based on AND/OR tree

A basic framework for the design of a prototype form system, CRAFT, is proposed. CRAFT enables users to create (i.e. define and realize) forms with various structures. Form creation is an integrated concept of form definition and form realization. For form definition, a formal form model is introduced. Form realization is specified by using a create graph based on AND/OR trees. CRAFT supports a visual language that provides naive users with an easy visual programming method.<<ETX>>

Response time minimization for processing simple queries in star networks

It has already been shown that the problem of obtaining an optimal strategy for a general query on a distributed database system is NP-hard. On the other hand, simple queries have been known as one class of queries for which an optimal strategy can be obtained efficiently. So far, it has been shown that if the topology of a computer network is a complete graph, then a strategy with the minimum response time for simple queries can be obtained in O(n2), where n is the number of sites of the network. This paper discusses the problem of obtaining a strategy with the minimum response time for simple queries when the topology of a computer network is a star (in brief, problem RT). We assume that each communication channel of a star network has equal communication capacity, and that each site has an equal capability for data processing. Here, we also assume that the center of a star network is capable of performing so-called broadcasting. In this paper, we present an algorithm called RT of O(n2) time for solving problem RT. Algorithm RT constructs a schedule graph that represents an optimal strategy by using the dynamic programming method.

Image Inpainting by Recursive Estimation Using Neural Network and Wavelet Transformation

This paper proposes image inpainting algorithms in which the pixel values of the regions to be inpainting are recursively estimated by using multi-layered Perceptron from the original input image and its wavelet transformation. Instead of forward estimation by using the deep neural network such as convolutional neural network (CNN), we use shallow neural network and the pixel values are recursively estimated. To improve the estimation quality, wavelet transformation is also used as the input of the neural network. The effectiveness of the proposed approach was experimentally confirmed by using the face databases.