No variance for filed orders: Hayes v Westpac Banking Corporation [2015] QCA 260

In Hayes v Westpac Banking Corporation [2015] QCA 260 the Queensland Court of Appeal examined the relationship between rules 7 (extending and shortening time) and 667 (setting aside) of the Uniform Civil Procedure Rules 1999 (Qld), and held that r667(1) does not enable the court to set aside or vary an order after the order has been filed. The court found that, to the extent that this conclusion was contrary to the decision in McIntosh v Linke Nominees Pty Ltd [2010] 1 Qd R 152, the decision in McIntosh was wrong and should not be followed.

Discovering injective episodes with general partial orders

Frequent episode discovery is a popular framework for temporal pattern discovery in event streams. An episode is a partially ordered set of nodes with each node associated with an event type. Currently algorithms exist for episode discovery only when the associated partial order is total order (serial episode) or trivial (parallel episode). In this paper, we propose efficient algorithms for discovering frequent episodes with unrestricted partial orders when the associated event-types are unique. These algorithms can be easily specialized to discover only serial or parallel episodes. Also, the algorithms are flexible enough to be specialized for mining in the space of certain interesting subclasses of partial orders. We point out that frequency alone is not a sufficient measure of interestingness in the context of partial order mining. We propose a new interestingness measure for episodes with unrestricted partial orders which, when used along with frequency, results in an efficient scheme of data mining. Simulations are presented to demonstrate the effectiveness of our algorithms.

Two orders of magnitude increase in metal piezoresistor sensitivity through nanoscale inhomogenization

Metal-based piezoresistive sensing devices could find a much wider applicability if their sensitivity to mechanical strain could be substantially improved. Here, we report a simple method to enhance the strain sensitivity of metal films by over two orders of magnitude and demonstrate it on specially designed microcantilevers. By locally inhomogenizing thin gold films using controlled electromigration, we have achieved a logarithmic divergence in the strain sensitivity with progressive microstructural modification. The enhancement in strain sensitivity could be explained using non-universal tunneling-percolation transport. We find that the Johnson noise limited signal-to-noise ratio is an order of magnitude better than silicon piezoresistors. This method creates a robust platform for engineering low resistance, high gauge factor metallic piezoresistors that may have profound impact on micro and nanoscale self-sensing technology. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4761817]

Statistical significance of episodes with general partial orders

Frequent episode discovery is one of the methods used for temporal pattern discovery in sequential data. An episode is a partially ordered set of nodes with each node associated with an event type. For more than a decade, algorithms existed for episode discovery only when the associated partial order is total (serial episode) or trivial (parallel episode). Recently, the literature has seen algorithms for discovering episodes with general partial orders. In frequent pattern mining, the threshold beyond which a pattern is inferred to be interesting is typically user-defined and arbitrary. One way of addressing this issue in the pattern mining literature has been based on the framework of statistical hypothesis testing. This paper presents a method of assessing statistical significance of episode patterns with general partial orders. A method is proposed to calculate thresholds, on the non-overlapped frequency, beyond which an episode pattern would be inferred to be statistically significant. The method is first explained for the case of injective episodes with general partial orders. An injective episode is one where event-types are not allowed to repeat. Later it is pointed out how the method can be extended to the class of all episodes. The significance threshold calculations for general partial order episodes proposed here also generalize the existing significance results for serial episodes. Through simulations studies, the usefulness of these statistical thresholds in pruning uninteresting patterns is illustrated. (C) 2014 Elsevier Inc. All rights reserved.

Ultra-narrow bandwidth resonant reflection grating filters using the second diffracted orders

In this paper, we design resonant reflection grating filters employing the second diffracted orders as the leaky modes, then analyze the bandwidth of the reflection peak and the electric field distributions inside the wavegude under resonance. The numeric calculation confirms that ultra-narrow resonant reflection peaks can be observed in these structures. At the same time, strong electric field enhancement appears under resonance. It provides a new approach to diversify the resonant reflection filters and may open a new way to the realization of ultra-narrow bandwidth filters. (C) 2008 Elsevier B.V. All rights reserved.

Multi-frequency operation of a mems vibration energy harvester by accessing five orders of parametric resonance

The mechanical amplification effect of parametric resonance has the potential to outperform direct resonance by over an order of magnitude in terms of power output. However, the excitation must first overcome the damping-dependent initiation threshold amplitude prior to accessing this more profitable region. In addition to activating the principal (1st order) parametric resonance at twice the natural frequency ω0, higher orders of parametric resonance may be accessed when the excitation frequency is in the vicinity of 2ω0/n for integer n. Together with the passive design approaches previously developed to reduce the initiation threshold to access the principal parametric resonance, vacuum packaging (< 10 torr) is employed to further reduce the threshold and unveil the higher orders. A vacuum packaged MEMS electrostatic harvester (0.278 mm3) exhibited 4 and 5 parametric resonance peaks at room pressure and vacuum respectively when scanned up to 10 g. At 5.1 ms-2, a peak power output of 20.8 nW and 166 nW is recorded for direct and principal parametric resonance respectively at atmospheric pressure; while a peak power output of 60.9 nW and 324 nW is observed for the respective resonant peaks in vacuum. Additionally, unlike direct resonance, the operational frequency bandwidth of parametric resonance broadens with lower damping. © Published under licence by IOP Publishing Ltd.

A Characterization of First-Order Definable Subsets on Classes of Finite Total Orders

We give an explicit and easy-to-verify characterization for subsets in finite total orders (infinitely many of them in general) to be uniformly definable by a first-order formula. From this characterization we derive immediately that Beth's definability theorem does not hold in any class of finite total orders, as well as that McColm's first conjecture is true for all classes of finite total orders. Another consequence is a natural 0-1 law for definable subsets on finite total orders expressed as a statement about the possible densities of first-order definable subsets.

Shop-scheduling problems with fixed and non-fixed machine orders of the jobs

The paper deals with the determination of an optimal schedule for the so-called mixed shop problem when the makespan has to be minimized. In such a problem, some jobs have fixed machine orders (as in the job-shop), while the operations of the other jobs may be processed in arbitrary order (as in the open-shop). We prove binary NP-hardness of the preemptive problem with three machines and three jobs (two jobs have fixed machine orders and one may have an arbitrary machine order). We answer all other remaining open questions on the complexity status of mixed-shop problems with the makespan criterion by presenting different polynomial and pseudopolynomial algorithms.