United States still no closer to database legislation

Last year European Intellectual Property Review published an article comparing the latest version of the proposed US database legislation, the Collections of Information Antipiracy Bill with the UK's Copyright and Rights in Database Regulations 1997. Subsequently a new US Bill, the Consumer and Investor Access to Information Act has emerged, the Antipiracy Bill has been amended and much debate has occurred, but the US seems no closer to enacting database legislation. This article briefly outlines the background to the US legislative efforts, examines the two Bills and draws some comparisons with the UK Regulations. A study of the US Bills clearly demonstrates the starkly divided opinion on database protection held by the Bills' proponents and the principal lobby groups driving the legislative efforts: the Antipiracy Bill is very protective of database producers' interests, whereas the Access Bill is heavily user-oriented. If the US experience is any indication there will be a long horizon involved in achieving any consensus on international harmonisation of this difficult area.

A Novel Approach to Haptic Tele-operation of Aerial Robot Vehicles

We present a novel, simple and effective approach for tele-operation of aerial robotic vehicles with haptic feedback. Such feedback provides the remote pilot with an intuitive feel of the robot’s state and perceived local environment that will ensure simple and safe operation in cluttered 3D environments common in inspection and surveillance tasks. Our approach is based on energetic considerations and uses the concepts of network theory and port-Hamiltonian systems. We provide a general framework for addressing problems such as mapping the limited stroke of a ‘master’ joystick to the infinite stroke of a ‘slave’ vehicle, while preserving passivity of the closed-loop system in the face of potential time delays in communications links and limited sensor data

Performance analysis of adaptive lattice filters for FM signals and alpha-stable processes

The performance of an adaptive filter may be studied through the behaviour of the optimal and adaptive coefficients in a given environment. This thesis investigates the performance of finite impulse response adaptive lattice filters for two classes of input signals: (a) frequency modulated signals with polynomial phases of order p in complex Gaussian white noise (as nonstationary signals), and (b) the impulsive autoregressive processes with alpha-stable distributions (as non-Gaussian signals). Initially, an overview is given for linear prediction and adaptive filtering. The convergence and tracking properties of the stochastic gradient algorithms are discussed for stationary and nonstationary input signals. It is explained that the stochastic gradient lattice algorithm has many advantages over the least-mean square algorithm. Some of these advantages are having a modular structure, easy-guaranteed stability, less sensitivity to the eigenvalue spread of the input autocorrelation matrix, and easy quantization of filter coefficients (normally called reflection coefficients). We then characterize the performance of the stochastic gradient lattice algorithm for the frequency modulated signals through the optimal and adaptive lattice reflection coefficients. This is a difficult task due to the nonlinear dependence of the adaptive reflection coefficients on the preceding stages and the input signal. To ease the derivations, we assume that reflection coefficients of each stage are independent of the inputs to that stage. Then the optimal lattice filter is derived for the frequency modulated signals. This is performed by computing the optimal values of residual errors, reflection coefficients, and recovery errors. Next, we show the tracking behaviour of adaptive reflection coefficients for frequency modulated signals. This is carried out by computing the tracking model of these coefficients for the stochastic gradient lattice algorithm in average. The second-order convergence of the adaptive coefficients is investigated by modeling the theoretical asymptotic variance of the gradient noise at each stage. The accuracy of the analytical results is verified by computer simulations. Using the previous analytical results, we show a new property, the polynomial order reducing property of adaptive lattice filters. This property may be used to reduce the order of the polynomial phase of input frequency modulated signals. Considering two examples, we show how this property may be used in processing frequency modulated signals. In the first example, a detection procedure in carried out on a frequency modulated signal with a second-order polynomial phase in complex Gaussian white noise. We showed that using this technique a better probability of detection is obtained for the reduced-order phase signals compared to that of the traditional energy detector. Also, it is empirically shown that the distribution of the gradient noise in the first adaptive reflection coefficients approximates the Gaussian law. In the second example, the instantaneous frequency of the same observed signal is estimated. We show that by using this technique a lower mean square error is achieved for the estimated frequencies at high signal-to-noise ratios in comparison to that of the adaptive line enhancer. The performance of adaptive lattice filters is then investigated for the second type of input signals, i.e., impulsive autoregressive processes with alpha-stable distributions . The concept of alpha-stable distributions is first introduced. We discuss that the stochastic gradient algorithm which performs desirable results for finite variance input signals (like frequency modulated signals in noise) does not perform a fast convergence for infinite variance stable processes (due to using the minimum mean-square error criterion). To deal with such problems, the concept of minimum dispersion criterion, fractional lower order moments, and recently-developed algorithms for stable processes are introduced. We then study the possibility of using the lattice structure for impulsive stable processes. Accordingly, two new algorithms including the least-mean P-norm lattice algorithm and its normalized version are proposed for lattice filters based on the fractional lower order moments. Simulation results show that using the proposed algorithms, faster convergence speeds are achieved for parameters estimation of autoregressive stable processes with low to moderate degrees of impulsiveness in comparison to many other algorithms. Also, we discuss the effect of impulsiveness of stable processes on generating some misalignment between the estimated parameters and the true values. Due to the infinite variance of stable processes, the performance of the proposed algorithms is only investigated using extensive computer simulations.

Modelling and solving train scheduling problems under capacity constraints

Many large coal mining operations in Australia rely heavily on the rail network to transport coal from mines to coal terminals at ports for shipment. Over the last few years, due to the fast growing demand, the coal rail network is becoming one of the worst industrial bottlenecks in Australia. As a result, this provides great incentives for pursuing better optimisation and control strategies for the operation of the whole rail transportation system under network and terminal capacity constraints. This PhD research aims to achieve a significant efficiency improvement in a coal rail network on the basis of the development of standard modelling approaches and generic solution techniques. Generally, the train scheduling problem can be modelled as a Blocking Parallel- Machine Job-Shop Scheduling (BPMJSS) problem. In a BPMJSS model for train scheduling, trains and sections respectively are synonymous with jobs and machines and an operation is regarded as the movement/traversal of a train across a section. To begin, an improved shifting bottleneck procedure algorithm combined with metaheuristics has been developed to efficiently solve the Parallel-Machine Job- Shop Scheduling (PMJSS) problems without the blocking conditions. Due to the lack of buffer space, the real-life train scheduling should consider blocking or hold-while-wait constraints, which means that a track section cannot release and must hold a train until the next section on the routing becomes available. As a consequence, the problem has been considered as BPMJSS with the blocking conditions. To develop efficient solution techniques for BPMJSS, extensive studies on the nonclassical scheduling problems regarding the various buffer conditions (i.e. blocking, no-wait, limited-buffer, unlimited-buffer and combined-buffer) have been done. In this procedure, an alternative graph as an extension of the classical disjunctive graph is developed and specially designed for the non-classical scheduling problems such as the blocking flow-shop scheduling (BFSS), no-wait flow-shop scheduling (NWFSS), and blocking job-shop scheduling (BJSS) problems. By exploring the blocking characteristics based on the alternative graph, a new algorithm called the topological-sequence algorithm is developed for solving the non-classical scheduling problems. To indicate the preeminence of the proposed algorithm, we compare it with two known algorithms (i.e. Recursive Procedure and Directed Graph) in the literature. Moreover, we define a new type of non-classical scheduling problem, called combined-buffer flow-shop scheduling (CBFSS), which covers four extreme cases: the classical FSS (FSS) with infinite buffer, the blocking FSS (BFSS) with no buffer, the no-wait FSS (NWFSS) and the limited-buffer FSS (LBFSS). After exploring the structural properties of CBFSS, we propose an innovative constructive algorithm named the LK algorithm to construct the feasible CBFSS schedule. Detailed numerical illustrations for the various cases are presented and analysed. By adjusting only the attributes in the data input, the proposed LK algorithm is generic and enables the construction of the feasible schedules for many types of non-classical scheduling problems with different buffer constraints. Inspired by the shifting bottleneck procedure algorithm for PMJSS and characteristic analysis based on the alternative graph for non-classical scheduling problems, a new constructive algorithm called the Feasibility Satisfaction Procedure (FSP) is proposed to obtain the feasible BPMJSS solution. A real-world train scheduling case is used for illustrating and comparing the PMJSS and BPMJSS models. Some real-life applications including considering the train length, upgrading the track sections, accelerating a tardy train and changing the bottleneck sections are discussed. Furthermore, the BPMJSS model is generalised to be a No-Wait Blocking Parallel- Machine Job-Shop Scheduling (NWBPMJSS) problem for scheduling the trains with priorities, in which prioritised trains such as express passenger trains are considered simultaneously with non-prioritised trains such as freight trains. In this case, no-wait conditions, which are more restrictive constraints than blocking constraints, arise when considering the prioritised trains that should traverse continuously without any interruption or any unplanned pauses because of the high cost of waiting during travel. In comparison, non-prioritised trains are allowed to enter the next section immediately if possible or to remain in a section until the next section on the routing becomes available. Based on the FSP algorithm, a more generic algorithm called the SE algorithm is developed to solve a class of train scheduling problems in terms of different conditions in train scheduling environments. To construct the feasible train schedule, the proposed SE algorithm consists of many individual modules including the feasibility-satisfaction procedure, time-determination procedure, tune-up procedure and conflict-resolve procedure algorithms. To find a good train schedule, a two-stage hybrid heuristic algorithm called the SE-BIH algorithm is developed by combining the constructive heuristic (i.e. the SE algorithm) and the local-search heuristic (i.e. the Best-Insertion- Heuristic algorithm). To optimise the train schedule, a three-stage algorithm called the SE-BIH-TS algorithm is developed by combining the tabu search (TS) metaheuristic with the SE-BIH algorithm. Finally, a case study is performed for a complex real-world coal rail network under network and terminal capacity constraints. The computational results validate that the proposed methodology would be very promising because it can be applied as a fundamental tool for modelling and solving many real-world scheduling problems.

Static shunt and series compensations of an SMIB system using flying capacitor multilevel inverter

The flying capacitor multilevel inverter (FCMLI) is a multiple voltage level inverter topology intended for high-power and high-voltage operations at low distortion. It uses capacitors, called flying capacitors, to clamp the voltage across the power semiconductor devices. A method for controlling the FCMLI is proposed which ensures that the flying capacitor voltages remain nearly constant using the preferential charging and discharging of these capacitors. A static synchronous compensator (STATCOM) and a static synchronous series compensator (SSSC) based on five-level flying capacitor inverters are proposed. Control schemes for both the FACTS controllers are developed and verified in terms of voltage control, power flow control, and power oscillation damping when installed in a single-machine infinite bus (SMIB) system. Simulation studies are performed using PSCAD/EMTDC to validate the efficacy of the control scheme and the FCMLI-based flexible alternating current transmission system (FACTS) controllers.

Soil carbon saturation : implications for measurable carbon pool dynamics in long-term incubations

The efficiency of agricultural management practices to store SOC depends on C input level and how far a soil is from its saturation level (i.e. saturation deficit). The C Saturation hypothesis suggests an ultimate soil C stabilization capacity defined by four SOM pools capable of C saturation: (1) non-protected, (2) physically protected, (3) chemically protected and (4) biochemically protected. We tested if C saturation deficit and the amount of added C influenced SOC storage in measurable soil fractions corresponding to the conceptual chemical, physical, biochemical, and non-protected C pools. We added two levels of C-13- labeled residue to soil samples from seven agricultural sites that were either closer to (i.e., A-horizon) or further from (i.e., C-horizon) their C saturation level and incubated them for 2.5 years. Residue-derived C stabilization was, in most sites, directly related to C saturation deficit but mechanisms of C stabilization differed between the chemically and biochemically protected pools. The physically protected C pool showed a varied effect of C saturation deficit on C-13 stabilization, due to opposite behavior of the POM and mineral fractions. We found distinct behavior between unaggregated and aggregated mineral-associated fractions emphasizing the mechanistic difference between the chemically and physically protected C-pools. To accurately predict SOC dynamics and stabilization, C Saturation of soil C pools, particularly the chemically and biochemically protected pools, should be considered. (C) 2008 Elsevier Ltd. All rights reserved.

Soil carbon saturation : evaluation and corroboration by long-term incubations

Although current assessments of agricultural management practices on soil organic C (SOC) dynamics are usually conducted without any explicit consideration of limits to soil C storage, it has been hypothesized that the SOC pool has an upper, or saturation limit with respect to C input levels at steady state. Agricultural management practices that increase C input levels over time produce a new equilibrium soil C content. However, multiple C input level treatments that produce no increase in SOC stocks at equilibrium show that soils have become saturated with respect to C inputs. SOC storage of added C input is a function of how far a soil is from saturation level (saturation deficit) as well as C input level. We tested experimentally if C saturation deficit and varying C input levels influenced soil C stabilization of added C-13 in soils varying in SOC content and physiochemical characteristics. We incubated for 2.5 years soil samples from seven agricultural sites that were closer to (i.e., A-horizon) or further from (i.e., C-horizon) their C saturation limit. At the initiation of the incubations, samples received low or high C input levels of 13 C-labeled wheat straw. We also tested the effect of Ca addition and residue quality on a subset of these soils. We hypothesized that the proportion of C stabilized would be greater in samples with larger C Saturation deficits (i.e., the C- versus A-horizon samples) and that the relative stabilization efficiency (i.e., Delta SCC/Delta C input) would decrease as C input level increased. We found that C saturation deficit influenced the stabilization of added residue at six out of the seven sites and C addition level affected the stabilization of added residue in four sites, corroborating both hypotheses. Increasing Ca availability or decreasing residue quality had no effect on the stabilization of added residue. The amount of new C stabilized was significantly related to C saturation deficit, supporting the hypothesis that C saturation influenced C stabilization at all our sites. Our results suggest that soils with low C contents and degraded lands may have the greatest potential and efficiency to store added C because they are further from their saturation level. (c) 2008 Elsevier Ltd. All rights reserved.

V2V/V2I augmented maps : state-of-the-art and contribution to real-time crash risk assessment

A number of advanced driver assistance systems (ADAS) are currently being released on the market, providing safety functions to the drivers such as collision avoidance, adaptive cruise control or enhanced night-vision. These systems however are inherently limited by their sensory range: they cannot gather information from outside this range, also called their “perceptive horizon”. Cooperative systems are a developing research avenue that aims at providing extended safety and comfort functionalities by introducing vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) wireless communications to the road actors. This paper presents the problematic of cooperative systems, their advantages and contributions to road safety and exposes some limitations related to market penetration, sensors accuracy and communications scalability. It explains the issues of how to implement extended perception, a central contribution of cooperative systems. The initial steps of an evaluation of data fusion architectures for extended perception are exposed.

When He is a She is a He : the pregnant man and the transgendered mother

The recent successful pregnancy of Thomas Beatie, a transgender FTM, billed by the various media as ‘the pregnant man’, has stirred up considerably diverse public opinion and debate, some supportive and indicative of changing and progressive ideas around sex, gender and sexuality; others condemnatory in their claims that Beatie’s pregnancy is an affront to the laws of Nature and/or God. Desired or derided, the pregnant male body contests the terrain of reproductive embodiment and the orthodoxy of Western systems of gender categorization. This chapter analyses a selection of media and internet responses to the case of the pregnant man, arguing that most disturbing of all it seems, is the body in-between (Kristeva 1982, p.4), the one that visibly defies socially obdurate gender oppositions of male and female, feminine and masculine in its insistence on being, to borrow from Homi Bhabha, a ‘third space of enunciation.’ Banana Yoshimoto’s novella Kitchen, also contests gender boundaries in its characterisation of Eriko, a transgendered male to female, a father, then a mother. In this narrative the in-between, the ambiguous, is not reviled but rather celebrated as a ‘horizon of possibility’ (Halperin, qtd in Jagose 1996 http://www.australianhumanitiesreview.org/archive/Issue-Dec- 1996/jagose.html).

Bow and stern flows with constant vorticity

Free surface flows of a rotational fluid past a two-dimensional semi-infinite body are considered. The fluid is assumed to be inviscid, incompressible, and of finite depth. A boundary integral method is used to solve the problem for the case where the free surface meets the body at a stagnation point. Supercritical solutions which satisfy the radiation condition are found for various values of the Froude number and the dimensionless vorticity. Subcritical solutions are also found; however these solutions violate the radiation condition and are characterized by a train of waves upstream. It is shown numerically that the amplitude of these waves increases as each of the Froude number, vorticity and height of the body above the bottom increases.

Linear stern waves in finite depth channels

This paper formulates an analytically tractable problem for the wake generated by a long flat bottom ship by considering the steady free surface flow of an inviscid, incompressible fluid emerging from beneath a semi-infinite rigid plate. The flow is considered to be irrotational and two-dimensional so that classical potential flow methods can be exploited. In addition, it is assumed that the draft of the plate is small compared to the depth of the channel. The linearised problem is solved exactly using a Fourier transform and the Wiener-Hopf technique, and it is shown that there is a family of subcritical solutions characterised by a train of sinusoidal waves on the downstream free surface. The amplitude of these waves decreases as the Froude number increases. Supercritical solutions are also obtained, but, in general, these have infinite vertical velocities at the trailing edge of the plate. Consideration of further terms in the expansions suggests a way of canceling the singularity for certain values of the Froude number.

Smoothly attaching bow flows with constant vorticity

The free surface flow of a finite depth fluid past a semi-infinite body is considered. The fluid is assumed to have constant vorticity throughout and the free surface is assumed to attach smoothly to the front face of the body. Numerical solutions are found using a boundary integral method in the physical plane and it is shown that solutions exist for all supercritical Froude numbers. The related problem of the cusp-like flow due to a submerged sink in a corner is also considered. Vorticity is included in the flow and it is shown that the behaviour of the solutions is qualitatively the same as that found in the problem described above.

meso-Porphyrinylphosphine Oxides: Mono- and Bidentate Ligands for Supramolecular Chemistry and the Crystal Structures of Monomeric [10,20-Diphenylporphyrinatonickel(II)-5,15-diyl]-bis-[P(O)Ph2] and Polymeric Self-Coordinated ([10,20-Diphenylporphyrinatozinc(II)-5,15-diyl]-bis-[P(O)Ph2])

A series of porphyrins substituted in one or two meso-positions by diphenylphosphine oxide groups has been prepared by the palladium catalysed reaction of diphenylphosphine or its oxide with the corresponding bromoporphyrins. Compounds {MDPP-[P(O)Ph2]n} (M = H2, Ni, Zn; H2DPP = 5,15-diphenylporphyrin; n = 1, 2) were isolated in yields of 60-95%. The reaction is believed to proceed via the conventional oxidative addition, phosphination and reductive elimination steps, as the stoichiometric reaction of η1-palladio(II) porphyrin [PdBr(H2DPP)(dppe)] (H2DPP = 5,15-diphenylporphyrin; dppe = 1,2-bis(diphenylphosphino)ethane) with diphenylphosphine oxide also results in the desired mono-porphyrinylphosphine oxide [H2DPP-P(O)Ph2]. Attempts to isolate the tertiary phosphines failed due to their extreme air-sensitivity. Variable temperature 1H NMR studies of [H2DPP-P(O)Ph2] revealed an intrinsic lack of symmetry, while fluorescence spectroscopy showed that the phosphine oxide group does not behave as a "heavy atom" quencher. The electron withdrawing effect of the phosphine oxide group was confirmed by voltammetry. The ligands were characterised by multinuclear NMR and UV-visible spectroscopy as well as mass spectrometry. Single crystal X-ray crystallography showed that the bis(phosphine oxide) nickel(II) complex {[NiDPP-[P(O)Ph2]2} is monomeric in the solid state, with a ruffled porphyrin core and the two P=O fragments on the same side of the average plane of the molecule. On the other hand, the corresponding zinc(II) complex formed infinite chains through coordination of one Ph2PO substituent to the neighbouring zinc porphyrin through an almost linear P=O---Zn unit, leaving the other Ph2PO group facing into a parallel channel filled with disordered water molecules. These new phosphine oxides are attractive ligands for supramolecular porphyrin chemistry.

Practical application of pseudospectral optimization to robot path planning

To obtain minimum time or minimum energy trajectories for robots it is necessary to employ planning methods which adequately consider the platform’s dynamic properties. A variety of sampling, graph-based or local receding-horizon optimisation methods have previously been proposed. These typically use simplified kino-dynamic models to avoid the significant computational burden of solving this problem in a high dimensional state-space. In this paper we investigate solutions from the class of pseudospectral optimisation methods which have grown in favour amongst the optimal control community in recent years. These methods have high computational efficiency and rapid convergence properties. We present a practical application of such an approach to the robot path planning problem to provide a trajectory considering the robot’s dynamic properties. We extend the existing literature by augmenting the path constraints with sensed obstacles rather than predefined analytical functions to enable real world application.