Uniqueness in Shape from Shading Revisited

We analyse the problem of representing solutions of first-orderpartial differential equations in terms of complete integrals and envelopes. In this context, we revisit the uniqueness results alreadyexisting in the shape-from-shading literature that concern eikonalequations corresponding to the images of a Lambertian hemi-sphere and aLambertian plane. We show that the approach adopted by Brooks in [2, 3] isincomplete and subsequently re-establish its uniqueness claims.     

Adaptive Control of the Electro‐Hydraulic Servo‐System with External Disturbances

The paper deals with the structure of the adaptive control electro‐hydraulic servo‐system (EHSS) with external load disturbances, practical verification of the identification, and control algorithms. The electro‐hydraulic servo system composed of a servo‐cylinder controlled with a servo‐valve is discussed. It is a strongly nonlinear object with parameters changing over time. Adaptive adjuster parameters were determined by means of current identification resulting in the parametric model. Identification was conducted on the basis of measurement of the controlling size and regulated size objects. The identified model of the object was applied to carry out the on‐line synthesis of the proportional–integral–derivative (PID) controller. The selected problems connected with obtaining the algorithm of adaptive control are presented. The computer program for implementing the algorithm with numerical simulation and identification of the control physical model object were calculated. The aim of the research was to examine the effectiveness of the adaptive control method in an electro‐hydraulic servo system, both theoretically and experimentally.     

Fundamentals of modelling concurrency using discrete relational structures

We consider relational structures such that is a set and are two binary relations on . For a number of different classes of structures we show that any structure can be represented as the intersection of its maximal extensions. Such a property – called extension completeness – can be seen as a generalisation of Szpilrajn's theorem which states that each partial order is the intersection of its total order extensions. When can be interpreted as causality and as ‘weak’ causality we obtain a model of concurrent histories generalising that based on causal partial orders. Received 1 February 1994 / 6 May 1996     

Relational structures model of concurrency

The paper deals with the foundations of concurrency theory. We show how structurally complex concurrent behaviours can be modelled by relational structures (X, ¨, \sqsubset){(X, \diamondsuit, \sqsubset)} , where X is a set (of event occurrences), and ¨{\diamondsuit} (interpreted as commutativity) and \sqsubset{\sqsubset} (interpreted as weak causality) are binary relations on X. The paper is a continuation of the approach initiated in Gaifman and Pratt (Proceedings of LICS’87, pp 72–85, 1987), Lamport (J ACM 33:313–326, 1986), Abraham et al. (Semantics for concurrency, workshops in computing. Springer, Heidelberg, pp 311–323, 1990) and Janicki and Koutny (Lect Notes Comput Sci 506:59–74, 1991), substantially developed in Janicki and Koutny (Theoretical Computer Science 112:5–52, 1993) and Janicki and Koutny (Acta Informatica 34:367–388, 1997), and recently generalized in Guo and Janicki (Lect Notes Comput Sci 2422:178–191, 2002) and Janicki (Lect Notes Comput Sci 3407:84–98, 2005). For the first time the full model for the most general case is given.     

Modelling concurrency with comtraces and generalized comtraces

Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the “not later than” relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally model the “non-simultaneously” relationship. Then we study some basic algebraic properties and canonical representations of comtraces and generalized comtraces. Finally we analyze the relationship between generalized comtraces and generalized stratified order structures. The major technical contribution of this paper is a proof showing that generalized comtraces can be represented by generalized stratified order structures.     

Path Loss Modelling for Location Service Applications

The aim of this paper is the path loss modelling for the radiolocation services in radio communication networks, particularly in cellular networks. The main results of the measurements obtained in the physical layer of the UMTS are introduced. A new method for the utilization of the multipath propagation phenomenon to improve the estimation of the distance between the MS （mobile station） and the BS （base station） is outlined. This method significantly increases the quality of location services in systems which use a radio interface with DS （direct sequence） CDMA （code division multiple access）.