Tetsuya Masuishi

A reporting tool using “programming by example” for format designation

This paper describes a report tool in which report formats are designated by “Programming by Example”-like operations. Users specify a sample layout of an example row of relational table data on a sheet, and select an iteration pattern of the sample layout. The tool extracts a set of general formatting rules from the sample layout. The rules consist of absolute positions of non-iterative data, relative positions of iterative data, the iteration pattern, and the increment of the iteration. The tool interprets the rules and generates new reports of the format for different table data.

Autonomous decentralized resource allocation for tracking dynamic load change

System architecture is proposed to adapt computing resource to load changes of the service requests from the Internet. The architecture employs an autonomous decentralized computing scheme for resource allocation. A subsystem has a production server to process service requests and a coordination server to adapt computing resource to load changes. Coordination is executed among subsystems to calculate how many resources are needed. Three system architectures, centralized resource allocation, autonomous decentralized resource allocation with independent adaptation and autonomous decentralized resource allocation with coordinated adaptation, are compared for tracking ability through simulation. Autonomous decentralized resource allocation with coordinated adaptation shows a good tracking ability comparable to the centralized resource allocation that should be nearly optimal. Since autonomous decentralized architecture shows better performance for availability than centralized architecture, autonomous decentralized allocation achieves the best performance for overall criteria.

A method for solving trade-off among cost for owned/borrowed resource and loss of business chances

This paper proposes a trade-off new problem for resource consumers who join resource-sharing communities to calculate how much resource to be owned from the view point of cost for owing and borrowing resource and loss of business chances. The consumers can borrow resource from the communities when their resource is insufficient. to plan how much resource to be owned and how much resource to be borrowed from the communities. A community model and some resource usage models are assumed to figure out the optimization problem. A cost function is introduced. The function consists of the three kinds of cost/loss for the depreciation time of owned resource. The function value grows when owned resource is too much, and also grows when owned resource is too little. This means that the function value indicates the least point when owned resource is optimal. This paper introduces some assumptions about the character of resource sharing community and the shape of resource usage curve, and shows that the optimization problem can be solved analytically.

Knowledge-Based Optimal IIL Circuit Generator from Conventional Logic Circuit Descriptions

This paper describes a new knowledge-based circuit translator which automatically generates IIL, or Integrated Injection Logic, circuit from conventional logic circuit net data. By accumulating fragmental pieces of knowledge of expert designers into a knowledge base in forms of rules, and using inference mechanism, such tasks are realized as gate connectivity extraction, gate translation and redundant element reduction which have been difficult to implement on conventional procedural programming languages. Furthermore, due to the architecture of the system, system improvement becomes easy through additions and modifications of rules. Approximately 40 to 60% gate reduction was attained compared with simple gate-to-gate translation. Computation time for 100 gates translation is about 200 sec. on Hitachis main frame M-200H.

Autonomous Decentralized Load Tracking Techniques and Evaluation

Techniques to improve tracking ability are presented for autonomous decentralized load tracking system. We propose a load tracking mechanism based on incomplete management of load information from subsystems. The system employs autonomous decentralized architecture, which enables online expansion and fault tolerance. Each subsystem asynchronously broadcasts load information to the data field shared by the subsystems. Load information in the data field is measured for a limited period of time to make the tracking ability efficient. The total system can be designed as a stable system to converge measurement errors. This paper proposes some techniques to improve tracking ability, including a feed forward technique and a nonlinear technique. The techniques are evaluated by two kinds of criteria by simulation

Measurement Error Analysis of Autonomous Decentralized Load Tracking System

Measurement error analysis is presented for autonomous decentralized load tracking system. We propose a load tracking mechanism based on incomplete management of load information from subsystems. The system employs autonomous decentralized architecture, which enables online expansion and fault tolerance. Each subsystem asynchronously broadcasts load information to the data field shared by the subsystems. Load information in the data field is measured for a limited period of time to make the tracking ability efficient. The number of measurements and the estimation of total load from the measurements are stochastic variables. This paper shows the statistical model of measurement noise disturbing the tracking mechanism

Autonomous Decentralized Load Tracking Systems And Evaluation Criteria For Response and Stability

This paper proposes autonomous decentralized load tracking system to adapt computing resource to unpredictably fluctuating load. Autonomous measurement technology is proposed to achieve better response time, by communicating load difference among subsystems and normalized integral to estimate total load using limited information gathered within a measurement period. Autonomous controlled decision technology is proposed. Characteristics for the system to maintain are clarified and a decision mechanism by binary functions with uniformly distributed thresholds is proposed. Evaluation criteria for response and stability are proposed to measure response satisfaction for end users and stability satisfaction for system administrators. A trade-off relationship is shown between the two criteria. Comparisons with existent technologies are done using the criteria

Chapter 9 – A Reporting Tool Using Programming by Example for Format designation

Publisher Summary Data warehouse technologies have enabled centralized data management for decision support and planning applications. The decision makers print various formats of reports based on the data of the centralized database. Many end users, sometimes decision makers themselves, have to design the report formats because the formats represent the view of the data and cause considerable effects on the decision. This chapter describes the user interface of a report tool that designates formats of reports. The user interface is designed in a programming by example (PBE) manner. Users specify a sample layout of an example row of relational table data on a sheet and select an iteration pattern of the sample layout. The tool extracts a set of general formatting rules from the sample layout. The reporting tool is used in two phases: the format-making phase and the report-generating phase. The rules consist of absolute positions of non-iterative data, relative positions of iterative data, the iteration pattern, and the increment of the iteration. The tool interprets the rules and generates new reports of the format for different table data.