Fuzzy multiple attributes and multiple hierarchical decision making

A procedure is proposed to solve the multiple attributes and multiple hierarchical system under fuzzy environment. The approach is based on:

1. (1) fuzzy representation;

2. (2) hierarchical performance evaluation structure,

3. (3) gradient eigenvector method for rating the fuzzy criteria weighting, and

4. (4) using the max-min paired elimination method for aggregation.

To illustrate the approach, an example on the evaluation of teaching performance in higher education is solved.     

An optimal gas-fired heating system

Utilizing a prescribed system configuration, this paper discusses the mathematical models of the system components used and formulates a method for controlling a domestic heating system in accordance to a prescribed criterion. The optimal problem treated is one of reducing the room temperature deviation from a prescribed reference value to zero, while at the same time minimizing the value of some predetermined performance or cost functional J. The development proceeds in essentially five steps.

1. (a) The development of the mathematical models for each of the elements of the heating system;

2. (b) Combining the mathematical models into a form which is suitable for the application of optimization techniques;

3. (c) Defining an optimization criterion which incorporates the main objective for minimizing room temperature variations with respect to a prescribed reference temperature;

4. (d) Choosing the optimization technique best suited for the problem;

5. (e) Constructing an optimal control system employing the optimization technique developed.

A numerical example compares the performance of the optimal system with a system of the conventional type which can be found in many American homes.     

Observer-based multivariable flatness control of a cold rolling mill

The synthesis methodology developed by Kimura (1985) based on the design theory of output regulators essentially due to Wonham (1974) has been applied successfully to the flatness control system for a 6-high cold rolling mill. The system has the following remarkable features.

1. (1) The structure of the controller is simple. This makes it easy to tune the control system.

2. (2) The controller copes well with the detection time delay, and thus high performance is obtained even at a low rolling speed.

3. (3) The flatness error caused by the rolling force variation in mill acceleration and deceleration time would be kept to a minimum by the function to adjust roll bending force using the signal of rolling force.

Use of simulation in the analysis of shop floor operations

The use of computers in actual system applications is increasing with the availability of intelligent terminals on the shop floor. These terminals can be used by management as tools in the decision making process of planning shop floor operation. This paper discusses a pilot simulation study in the use of conventional Fortran-based simulation programs by shop floor management to:

1. 1. Participate in the evaluation of proposed FMS systems,

2. 2. Assess the impact of FMS acquisition on existing facilities,

3. 3. Assist in the identification of operational alternatives in “bottle neck” situations.

The pilot study employs a batch-oriented MRP system to provide daily updates of outstanding production center loadings on a monthly planning horizon. Two intelligent terminals are used to access a mini computer facility that executes the simulation models. The terminals have AT-compatible capabilities and are also used as data acquisition devices that support the numerically controlled operations within each work center.

The simulation models represent the 13 work centers of the firm and provide information about the average utilization of each work center, the number of parts in each queue and the average delay of parts in the queues. Future extensions of the models are planned to utilize the terminals' graphic animation capabilities to display the flow of production orders through the manufacturing facility.     

A note on the combinatorial structure of the visibility graph in simple polygons

Combinatorial structure of visibility is probably one of the most fascinating and interesting areas of engineering and computer science. The usefulness of visibility graphs in computational geometry and robotic navigation problems like motion planning, unknown-terrain learning, shortest-path planning, etc., cannot be overstressed. The visibility graph, apart from being an important data structure for storing and updating geometric information, is a valuable mathematical tool in probing and understanding the nature of shapes of polygonal and polyhedral objects. In this research we wish to initially focus our attention on a fundamental class of geometric objects. These geometric objects may be looked upon as building blocks for more complex geometric objects, and which offer an ideal balance between complexity and simplicity, namely simple polygons.

A major theme of the proposed paper is the investigation of the combinatorial structure of the visibility graph. More importantly, the goals of this paper are:

1. (i) To characterize the visibility graphs of simple polygons by obtaining necessary and sufficient conditions a graph must satisfy to qualify for the visibility graph of a simple polygon

2. (ii) To obtain hierarchical relationships between visibility graphs of simple polygons of a given number of vertices by treating them as representing simple polygons that are deformations of one another.

3. (iii) To exploit the potential of complete graphs to be natural coordinate systems for addressing the problem of reconstructing a simple polygon from visibility graph.

We intend to achieve this by defining appropriate “betweenness” relationships on points with respect to the edges of the complete graphs.     

A global parametrization of asymptotically stable linear systems

In this paper we construct a homeomorphism from the set of p × m transfer functions of McMillan degree n onto the open subspace of asymptotically stable linear systems. This homeomorphism yields a one-to-one correspondence between

1. (i) canonical forms for state space equivalence of minimal systems and

2. (ii) canonical forms for state space equivalence of asymptotically stable minimal systems.

Implications for the topology of various sets of asymptotically stable systems are given.     

The monadic second-order logic of graphs X: Linear orderings

Graphs are finite and handled as relational structures. We give some answers to the following general questions:

1. (1) For which classes of graphs is it possible to specify a linear ordering of the set of vertices of each graph of by fixed monadic second-order formulas?

2. (2) For which classes of graphs does there exist an extension of monadic second-order logic such that a subclass L of is recognizable if and only if it is the class of graphs in that satisfy a formula of ? (In this paper, recognizability is understood in an algebraic sense, relative to a finite set of graph operations and basic graphs that generate all graphs of .)

3. (3) For which classes of graphs is it possible to construct, in every graph of the class, and by fixed formulas of a suitable extension of monadic second-order logic, its hierarchichal structure, i.e., a finite term written with the operations and basic graphs of (2), that defines the considered graph?

Applications concern dependency graphs of partially commutative words, partial k-paths, cographs, and graphs, the modular decomposition of which uses prime graphs of bounded size.     

A survey of simple transfer-function derivations from high-order state-variable models

The problem of the derivation of simple transfer function models from high order state variable models is reviewed. Methods of reduction are classified according to whether they involve

1. (a) the computation of the time or frequency responses

2. (b) the derivation, as an intermediate step, of a transfer function which is the ratio of two polynomials, the denominator being of the same order as the state variable model, or

3. (c) a set of characterising functions.

Particular reduction methods considered are those based on fitting the step or frequency responses, on determining the intermediate, high order transfer function and reducing it by continued fraction expansion and on fitting the moments of the impulse response. An example illustrating these methods is given. The form of the simple model, the criteria of goodness of fit and the practical difficulties involved in the use of these methods are discussed.     

An analysis of research topics in software engineering – 2006

This paper is the first in a new annual series whose goal is to answer the following question: what are the active research focuses within the field of software engineering? We considered 7 top journals and 7 top international conferences in software engineering and examined all the 691 papers published in these journals or presented at these conferences in 2006. Consequently, we have a number of findings.

(1) Seventy-three percent of journal papers focus on 20% of subject indexes in software engineering, including Testing and Debugging (D.2.5), Management (D.2.9), and Software/Program Verification (D.2.4).

(2) Eighty-nine percent of conference papers focus on 20% of subject indexes in software engineering, including Software/Program Verification (D.2.4), Testing and Debugging (D.2.5), and Design Tools and Techniques (D.2.2).

(3) Seventy-seven percent of journal/conference papers focus on 20% of subject indexes in software engineering, including Testing and Debugging (D.2.5), Software/Program Verification (D.2.4), and Management (D.2.9).

(4) The average number of references cited by a journal paper is about 33, whereas this number becomes around 24 for a conference paper.

CIM includes the experimental shop

Integration of computers in the manufacturing process has rightfully emphasized their use in electronically conveying complex product geometry from engineering design and drafting to the design of manufacturing fixtures and part programming. The relative absence of literature and software relating to the use of micro-computers in the Experimental (prototype) Shop suggests that at best, their usage is limited and at worst, not amenable to very small lot size production quantities.

Experience with a trial program suggests the contrary. While the project described in this paper is far from a full implementation, early results suggest that micro-computers can be effectively use to:

1. 1) Improve communications between the designer and the shop.

2. 2) Assist the shop in purchasing, process planning, and control of spare part inventories.

Also included in the paper is an overview of the software as contrasted with conventional high volume production planning and inventory control systems to emphasize the fundamental differences in functional usage. The paper concludes with a discussion of future extensions to provide networking and graphic capabilities that shows promise of improving the feedback loop to Engineering Design and Manufacturing.     

Finite element programs based on general programming systems

This article describes the advantages and inconveniences with a finite element programming system, i.e. blocks of routines already thoroughly tested, which has to be built together by a programmer to a finite element program. This program may be a tailor-made program to fit a special problem or a general purpose finite element program.

The programming system used as an example in this article consists of

1. *NORSAM—finite element programming system

2. *DASA — pre- and postprocessors

3. *ELLIB—element library

Together they form a complete set of subroutines from datageneration through the necessary routines for matrix manipulation to presentation of results, including the multilevel superelement technique.

Reference to finite element programs applying the programming system concept, is given at the end of the article. Among others, programs for buckling, elasto-plastic analysis of 3-dimensional membranes and solids, nonlinear pipeline problems, acoustic field problems and transient heat conduction in solids are developed. The multilevel superelement technique has been applied in several of these application programs.

The concept of the programming system gives undoubtedly a large saving of time and resources and has proved to be more reliable than conventional methods when developing finite element programs.     

Discrete warehouse problem

A discrete warehouse is a collection of two-dimensional unit-square objects (robot and obstacles), which are allowed to move horizontally and vertically along grid lines. In this paper, we consider motion planning problems in a discrete warehouse with movable obstacles. In such a setup one is allowed to move some of the obstacles in order to:

1. (1) navigate the robot between an initial and a final position of the warehouse, and

2. (2) construct a clearing (path) between two specified points.

The final positions of the obstacles are unimportant for our problems.

We consider two forms of obstacle manipulations:

1. (a) remote, when the obstacles are moved by a remote mechanism, and

2. (b) contact, when the obstacles are moved only by direct contact of the robot.

We present necessary and sufficient conditions for the existence of a motion in both cases, and propose efficient algorithms for constructing feasible motions.     

Impact of personality and intelligence on job satisfaction of assembly line and bench work - an industrial study

A study of the impact of machine-paced (M/P) and self-paced (S/P) work on job satisfaction of 28 female industrial assembly workers was evaluated in which M/P work was confounded with simplified work and the S/P job was confounded with enriched tasks. Results indicated the following:

1. 1. Over three-quarters of workers were more satisfied in S/P jobs, while only less than one-quarter were more satisfied in M/P jobs.

2. 2. The 16PF personality test effectively predicts (0·88 multiple correlation) the satisfaction ratios of M/P to S/P jobs.

Applications of power series in computational geometry

A number of algorithms are presented for obtaining power series expansions of curves and surfaces at a point. Some results on the radius of convergence are given. Two applications of series are given:

1. • for curve tracing algorithms, where a truncated series is used to approximate the curve of intersection of two surfaces

2. • to define nth degree geometric continuity, for arbitrary

On the complexity of ω-type Turing acceptors

Turing machines are considered as recognizers of sets of infinite (ω-type) sequences, so called ω-languages. The basic results on such ω-type Turing acceptors were presented in a preceding paper. This paper focuses on the theory of deterministic ω-type Turing acceptors (ω-DTA's) which turns out to be crucially different from the ‘classical’ theory of Turing machines. It is shown that there exists no ω-DTA which is universal for all ω-DTA's. Two infinite complexity hierarchies for ω-DTA's are established, the ‘states hierarchy’, corresponding to the number of states in the machine, and the ‘designated sets hierarchy’, corresponding to the number of designated sets of states used in the recognition. Concrete examples of ω-languages characterizing each of the complexity classes are exhibited. Two additional examples of interesting ω-languages are presented:

1. (i) An ω-language which is ‘inherently non-deterministic’, i.e. can be recognized by a non-deterministic Turing acceptor but by no deterministic acceptor.

2. (ii) An ω-language which cannot be recognized even by a non-deterministic Turing acceptor.

The above examples are constructed without using diagonalization. Oscillating ω-DTA's, i.e. ω-DTA's which are allowed to oscillate on ω-inputs, are also considered and are shown to be strictly more powerful than non-oscillating ω-DTA's, yet strictly less powerful than non-deterministic ω-Turing acceptors.     

An experimental analysis of critical factors in automatic data acquisition through bar coding

The technology of bar coding has been in existence for nearly forty (40) years but has only recently found much application in modern industry. This fact is attributable in part to the evolution of the bar coding symbology itself (of which there are at least 16 in use today), but to a larger extent to the technological advances that have greatly improved the ability to both print and read bar coded symbols. There remain, however, a number of critical factors that are thought to impact the success or failure of a bar code system.

Although several methods for measuring the success of bar code system are certainly plausible, the most appropriate or revealing index of success is identified as First Read Rate (FRR), for a low FRR will virtually guarantee user rejection of the system in favor of a more traditional yet undoubtedly slower and less accurate method of data collection or reporting. But while the importance of a high FRR is generally accepted, the factors or parameters that impact FRR are to a large extent still unknown.

Defined herein are two major categories of bar code system parameters. There are:

1. (1) GO/NOGO Parameters

2. (2) Level of Success parameters

Of the “Level of success” parameters, the quality of the printed media or print technique is often purported to be the single most important criterion in determining FRR. Other potentially significant contributors to the success of a bar code system, however, include the bar code application (defined herein by label length), and the human variability of the operator(s) that must use the system.

This text outline an experiment designed to characterize the impact of these three parameters on the FRR of a bar code system. Then a mixed-effects linear model is defined, and factorial analysis of variance (ANOVA) techniques are used to analyze the results of 4800 attempted “reads” which represent the FRR data for every possible combination of four (4) print techniques, three (3) application/label lengths, and two (2) randomly selected operations.

Contrary to the assertions of many “experts” the results of this experiment lead to the conclusion that the operator effect and interaction effects between operator and the other experimental variables are likely to have the greatest impact on a system's FRR. This conclusion suggests that success of the overall system is tantamount to success in controlling the operator variability, and that more attention should be given to the definition of human factors such as operator training than to the specification of system hardware — as is so often the case.     

Verification in loosely synchronous queue-connected discrete timed automata

We look at a model of a queue system that consists of the following components:

1. Two discrete timed automata W (the “writer”) and R (“the reader”).

2. One unrestricted queue that can be used to send messages from W to R. There is no bound on the length of the queue.

W and R do not share a global clock and operate in a loosely synchronous way. That is, the absolute value of the difference between the local time of W and the local time of R is always bounded by a positive constant. We show that the binary reachability for these systems is effectively computable, and this result is generalized to the case when there are two queues (one from W to R and the other from R to W) that operate in half-duplex. We then present some properties (e.g., safety, invariance, etc.) that can be verified for loosely synchronous queue-connected discrete timed automata and give an example of a system composed of a sensor and a controller that is verifiable using our results.     

Investigations on the Dual Calculus

The Dual Calculus, proposed recently by Wadler, is the outcome of two distinct lines of research in theoretical computer science:

(A) Efforts to extend the Curry–Howard isomorphism, established between the simply-typed lambda calculus and intuitionistic logic, to classical logic.

(B) Efforts to establish the tacit conjecture that call-by-value (CBV) reduction in lambda calculus is dual to call-by-name (CBN) reduction.

This paper initially investigates relations of the Dual Calculus to other calculi, namely the simply-typed lambda calculus and the Symmetric lambda calculus. Moreover, Church–Rosser and Strong Normalization properties are proven for the calculus’ CBV reduction relation. Finally, extensions of the calculus to second-order types are briefly introduced.

Application of AI in software and information engineering

Methodologies already exist for information systems analysis and design (e.g. SSADM, JSP, Merise, etc.) and supporting tools, namely, CASE (Computer Aided Software Engineering) and RDBMS (Relational Database Management System) and/or 4GL tools. All of these tools contain a data dictionary at the core of certain facilities.

In the underlying research and in this paper, the following questions need to be addressed:

• —How can the capability of a recently available data dictionary be enhanced with some knowledge-based modules?

• —What would be the architecture of such a system, based on the data dictionary of some CASE tools?

• —How can the informal and formal modelling approach information system design be combined?

• —What sort of knowledge-representation techniques would be suitable for the different tasks during the analysis and the design of the system?

The system outlined here would work as an intelligent assistant and workbench supporting the developer, but not as an automatic programming environment.     

CSCW系统的理论与应用研究

计算机支持的协同工作（ＣＳＣＷ）作为新兴的研究领域正受到广泛的重视，本文介绍ＣＳＣＷ的发展背景、基本概念和应用领域，分析了ＣＳＣＷ系统的功能需求和特点，指出它与传统的分布式系统的联系和区别。讨论和评述了目前国内外ＣＳＣＷ系统的关键技术的研究现状，最后讨论了ＣＳＣＷ系统存在的几个问题，给出了今后的重点研究方向。