An efficient algorithm for finding ideal schedules

We study the problem of scheduling unit execution time jobs with release dates and precedence constraints on two identical processors. We say that a schedule is ideal if it minimizes both maximum and total completion time simultaneously. We give an instance of the problem where the min-max completion time is exceeded in every preemptive schedule that minimizes total completion time for that instance, even if the precedence constraints form an intree. This proves that ideal schedules do not exist in general when preemptions are allowed. On the other hand, we prove that, when preemptions are not allowed, then ideal schedules do exist for general precedence constraints, and we provide an algorithm for finding ideal schedules in O(n ³) time, where n is the number of jobs. In finding such ideal schedules we resolve a conjecture of Baptiste and Timkovsky (Math. Methods Oper. Res. 60(1):145–153, 2004) Further, our algorithm for finding min-max completion-time schedules requires only O(n ³) time, while the most efficient solution to date has required O(n ⁹) time.     

Measurements and simulations of transient characteristics of heat pipes

The rejection of heat generated by components and circuits is a very important aspect in design of electronics systems. Heat pipes are very effective, low cost elements, which can be used in cooling systems. This paper presents the modelling and measurements of the heat and mass transfer in heat pipes. The physical model includes the effects of liquid evaporation and condensation inside the heat pipe. The internal vapour flow was fully simulated using computational fluid dynamics. The theory has been compared with experimental measurements using thermographic camera and contact thermometers. The main purpose of this study is to determine the effective heat pipe thermal conductivity in transient state during start up the pipe operation and temperature increase.     

A Rough Set Approach to Estimating the Game Value and the Shapley Value from Data

A value of a game v is a function which to each coalition S assigns the value v(S) of this coalition, meaning the expected pay–off for players in that coalition. A classical approach of von Neumann and Morgenstern [6] had set some formal requirements on v which contemporary theories of value adhere to. A Shapley value of the game with a value v [14] is a functional Φ giving for each player p the value Φ_p(v) estimating the expected pay-off of the player p in the game. Game as well as conflict theory have been given recently much attention on the part of rough and fuzzy set communities [11,8,1,4,7,2]. In particular, problems of plausible strategies [1] in conflicts as well as problems related to Shapley's value [3,2] have been addressed.We confront here the problem of estimating a value as well as Shapley's value of a game from a partial data about the game. We apply to this end the rough set ideas of approximations, defining the lower and the upper value of the game and, respectively, the lower and upper Shapley value. We also define a notion of an exact coalition, on which both values coincide giving the true value of the game; we investigate the structure of the family of exact sets showing its closeness on complements, disjoint sums, and intersections of coalitions covering the set of players. This work sets open a new area of rough set applications in mining constructs from data. The construct mined in this case are values as well as Shapley values of games.     

Methods of Image Compression by PHL Transform

In this paper an image data compression scheme based on Periodic Haar Piecewise-Linear (PHL) transform and quantization tables is proposed. Effectiveness of the compression for different classes of images is evaluated. The comparison of the compression quality using PHL and DCT transforms is given.     

Wave propagation in delaminated beam

The wave propagation model investigated herein is based on the known fact that material discontinuities affect the propagation of elastic waves in solids. The change in certain material characteristics, such as a local change in stiffness or inertia caused by a crack or the presence of material damage, will affect the propagation of transmitted elastic waves and will modify the received signal. Wave frequencies associated with the highest detection sensitivity depend, among other things, on the type of structure, the type of material, and the type of damage. This paper presents a method of wave propagation, which can be further used to detect small delaminations in beam-like structures. The considered beam is modelled by spectral finite elements.     

Constraint Lingo: towards high‐level constraint programming

Logic programming requires that the programmer convert a problem into a set of constraints based on predicates. Choosing the predicates and introducing appropriate constraints can be intricate and error prone. If the problem domain is structured enough, we can let the programmer express the problem in terms of more abstract, higher‐level constraints. A compiler can then convert the higher‐level program into a logic‐programming formalism. The compiler writer can experiment with alternative low‐level representations of the higher‐level constraints in order to achieve a high‐quality translation. The programmer can then take advantage of both a reduction in complexity and an improvement in runtime speed for all problems within the domain. We apply this analysis to the domain of tabular constraint‐satisfaction problems. Examples of such problems include logic puzzles solvable on a hatch grid and combinatorial problems such as graph coloring and independent sets. The proper abstractions for these problems are rows, columns, entries, and their interactions. We present a higher‐level language, Constraint Lingo, dedicated to problems in this domain. We also describe how we translate programs from Constraint Lingo into lower‐level logic formalisms such as the logic of propositional schemata. These translations require that we choose among competing lower‐level representations in order to produce efficient results. The overall effectiveness of our approach depends on the appropriateness of Constraint Lingo, our ability to translate Constraint Lingo programs into high‐quality representations in logic formalisms, and the efficiency with which logic engines can compute answer sets. We comment on our computational experience with these tools in solving both graph problems and logic puzzles. Copyright © 2004 John Wiley & Sons, Ltd.     

Validation of selected temperament and personality questionnaires for diagnosing drivers’ aptitude for safe driving. A Polish study

This paper presents the results of a study aimed at validating psychological questionnaires evaluating temperamental and personality features. It discusses their usefulness in diagnosing drivers’ aptitude for safe driving and working as professional drivers. Three psychological questionnaires were validated: the Formal Characteristics of Behaviour – Temperament Inventory (FCB-TI), the Eysenck Personality Questionnaire – Revised and Short Scale (EPQ-R (S)) and the Impulsiveness Questionnaire (IVE). Three groups of drivers (n = 246) aged 19–75 participated in the study. Group I (professional drivers; n = 96) and Group II (nonprofessional drivers; n = 75) had never been involved in road crashes, whereas Group III (nonprofessional drivers; n = 75) were offenders involved in fatal injury road crashes. Criterion-related validity, Cronbach's alpha and Guttman split-half reliability coefficient were in assessing the psychometric properties of the questionnaires. There were some significant differences between Groups II and III for most traits. However, contrary to expectations, higher Emotional Reactivity, Perseveration and lower Endurance as well as higher Neuroticism, Impulsiveness and Venturesomeness were determined for Group II than for Group III. Additionally, the temperament and personality profile of Group II turned out to be less fitted to the profile of safe drivers than that of Group III, whose profile was actually similar to that of Group I. This seems to result from a high tendency for a positive self-presentation among Group I and Group III (a significantly higher result on the Lie scale in comparison with Group II). The results suggest that if psychological tests are to decide on whether a person may be a professional driver or may drive vehicles, the three questionnaires (FCB-TI, EPQ-R(S) and IVE) do not provide a valid diagnosis of professional drivers’ aptitude because of drivers’ high tendency for positive self-presentation. However, they can be used in job counselling and in screening high-risk drivers.     

Determining dynamic output feedback of the least order for SIMO systems to locate poles in a specified region†

This paper presents a new theory for determining dynamic output feedback of the least order for a linear, time-invariant, controllable and observable SIMO system, such that poles of the closed-loop system lie in a given region Γ in the complex plane. When some poles have prespecified stationary locations in the complex plane, dynamic output feedback is obtained in the sense that the remaining poles lie in Γ This theory applies to continuous-time as well as discrete-time systems. Here a design algorithm for complete system realization and an illustrative example are given.