A learning-based colour image segmentation with extended and compact structural tensor feature representation

In this paper a novel Tensor-Based Image Segmentation Algorithm (TBISA) is presented, which is dedicated for segmentation of colour images. A purpose of TBISA is to distinguish specific objects based on their characteristics, i.e. shape, colour, texture, or a mixture of these features. All of those information are available in colour channel data. Nonetheless, performing image analysis on the pixel level using RGB values, does not allow to access information on texture which is hidden in relation between neighbouring pixels. Therefore, to take full advantage of all available information, we propose to incorporate the Structural Tensors as a feature extraction method. It forms enriched feature set which, apart from colour and intensity, conveys also information of texture. This set is next processed by different classification algorithms for image segmentation. Quality of TBISA is evaluated in a series of experiments carried on benchmark images. Obtained results prove that the proposed method allows accurate and fast image segmentation.     

On Constructing Unit Triangular Matrices with Prescribed Singular Values

We propose an efficient algorithm for computing a unit lower triangular n×n matrix with prescribed singular values of O(n ²) cost. This is a solution of the question raised by N. J. Higham in [4, Problem 26.3, p. 528]. Received July 21, 1999; revised November 4, 1999     

First experiences with the Polish Optical Internet

The paper describes the new development programme of the Polish information infrastructure. The programme, called in Polish PIONIER: (English—PIONEER) Polish Optical Internet, Advanced Applications, Services and Technologies for the Information Society, has been proposed to the Polish State Committee for Scientific Research and has been accepted. The aim of the programme is to create an advanced infrastructure together with tools, services and applications available to the entire scientific community and eventually to government and local administrations as well as society in general. Services and applications are expected to appear as selected pilot realizations in order to verify deployed technologies. Some of the pilot realizations and testbeds are also presented in the paper.     

Optimal Average Case Estimation in Hilbert Norms

In contrast to the worst case approach, the average case setting provides less conservative insight into the quality of estimation algorithms. In this paper we consider two local average case error measures of algorithms based on noisy information, in Hilbert norms in the problem element and information spaces. We define the optimal algorithm and provide formulas for its two local errors, which explicitly exhibit the influence of factors such as information, information (measurement) errors, norms in the considered spaces, a subset where approximations are allowed, and “unmodeled dynamics.” Based on the error expression, we formulate in algebraic language the problem of selecting the optimal approximating subspace. The solution is given along with the specific formula for the error, which depends on the eigenvalues of a certain matrix defined by information and norms under consideration. Date received: November 25, 1999. Date revised: May 30, 2000.     

Human factors in quality management

This article shows the results of research regarding the importance and the role of human factors in quality management in production enterprises. In creating the concept of systematizations of human factors in quality management an anthropocentrism rule was accepted and resulting from it a category of life quality. Acceptance of this rule led to a multiaspect and comprehensive approach to human factors in quality management. An interpretation of the notion of quality was made, adequate to needs, goals, and requirements of a human. Additionally, a cybernetic model of quality management system was elaborated. Human factors was exhibited in the manager's and executor's roles in quality management systems in enterprise as well as to the roles of creators, producers, and users (customers) in product life cycles. An existence of human factors in ISO norms regarding quality management, work safety, and hygiene management and environment management was also shown. The objective of this article is a comprehensive identification and systematization of aspects of human factors in quality management. © 2008 Wiley Periodicals, Inc.     

A generic interface for parallel access to large data sets from HPF applications

A critical performance issue for a number of scientific and engineering applications is the efficient transfer of data to secondary storage. Languages such as High Performance Fortran (HPF) have been introduced to allow programming distributed-memory systems at a relatively high level of abstraction. However, the present version of HPF does not provide appropriate constructs for controlling the parallel I/O capabilities of these systems. In this paper, constructs to specify parallel I/O operations on multidimensional arrays in the context of HPF are proposed. The paper also presents implementation concepts that are based on the HPF compiler VFC and the parallel I/O run-time system Panda. Experimental performance results are discussed in the context of financial management and traffic simulation applications.     

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.