UC Research Repository Community:
http://hdl.handle.net/10092/1
2014-10-30T00:14:57ZLocal Tchebichef Moments for Texture Analysis
http://hdl.handle.net/10092/9755
Title: Local Tchebichef Moments for Texture Analysis
Authors: Mukundan, R.
Editors: Papakostas, G.A.
Abstract: Orthogonal moment functions based on Tchebichef polynomials have found several applications in the field of image analysis because of their superior feature representation capabilities. Local features represented by such moments could also be used in the design of efficient texture descriptors. This chapter introduces a novel method of constructing feature vectors from orthonormal Tchebichef moments evaluated on 5x5 neighborhoods of pixels, and encoding the texture information as a Lehmer code that represents the relative strengths of the evaluated moments. The features will be referred
to as Local Tchebichef Moments (LTMs). The encoding scheme provides a byte value for each pixel, and generates a gray-level "LTM-image" of the input image. The histogram of the LTM-image is then used as the texture descriptor for classification. The theoretical framework as well as the implementation aspects of the descriptor are discussed in detail.2014-01-01T00:00:00ZThe Clinical Utilisation of Respiratory Elastance Software (CURE Soft): a bedside software for real-time respiratory mechanics monitoring and mechanical ventilation management
http://hdl.handle.net/10092/9748
Title: The Clinical Utilisation of Respiratory Elastance Software (CURE Soft): a bedside software for real-time respiratory mechanics monitoring and mechanical ventilation management
Authors: Szlavecz, A.; Chiew, Y.S.; Redmond, D.; Beatson, A.; Glassenbury, D.; Corbett, S.; Major, V.; Pretty, C.G.; Shaw, G.; Benyo, B.; Desaive, T.; Chase, J.G.
Abstract: Background.
Real-time patient respiratory mechanics estimation can be used to guide mechanical
ventilation settings, particularly, positive end-expiratory pressure (PEEP). This work presents
a software, Clinical Utilisation of Respiratory Elastance (CURE Soft), using a time-varying
respiratory elastance model is developed to offer this ability to aid in mechanical ventilation
treatment.
Implementation.
CURE Soft a desktop application developed in JAVA. It has two modes of operation, 1)
Online real-time monitoring decision support and, 2) Offline for user education purposes,
auditing, or reviewing patient care. The CURE Soft has been tested in mechanically
ventilated patients with respiratory failure. The clinical protocol, software testing and use of
the data were approved by the New Zealand South Regional Ethics Committee.
Results and Discussion.
Using CURE Soft, patient’s respiratory mechanics response to treatment and clinical protocol
were monitored. Results showed that the patient’s respiratory elastance (Stiffness) changed
with the use of muscle relaxants, and responded differently to ventilator settings. This
information can be used to guide mechanical ventilation therapy and titrate optimal ventilator
PEEP.
Conclusion.
CURE Soft enables real-time calculation of model-based respiratory mechanics for
mechanically ventilated patients. Results showed that the system is able to provide detailed,
previously unavailable information on patient-specific respiratory mechanics and response to
therapy in real-time. The additional insight available to clinicians provides the potential for
improved decision-making, and thus improved patient care and outcomes.2014-01-01T00:00:00ZCombining Shortest Paths, Bottleneck Paths and Matrix Multiplication
http://hdl.handle.net/10092/9740
Title: Combining Shortest Paths, Bottleneck Paths and Matrix Multiplication
Authors: Shinn, Tong-Wook
Abstract: We provide a formal mathematical definition of the Shortest Paths for All Flows (SP-AF) problem and provide many efficient algorithms. The SP-AF problem combines the well known Shortest Paths (SP) and Bottleneck Paths (BP) problems, and can be solved by utilising matrix multiplication. Thus in our research of the SP-AF problem, we also make a series of contributions to the underlying topics of the SP problem, the BP problem, and matrix multiplication.
For the topic of matrix multiplication we show that on an n-by-n two dimensional (2D) square mesh array, two n-by-n matrices can be multiplied in exactly 1.5n ‒ 1 communication steps. This halves the number of communication steps required by the well known Cannon’s algorithm that runs
on the same sized mesh array.
We provide two contributions for the SP problem. Firstly, we enhance the breakthrough algorithm by Alon, Galil and Margalit (AGM), which was the first algorithm to achieve a deeply sub-cubic time bound for solving the All Pairs Shortest Paths (APSP) problem on dense directed graphs. Our enhancement allows the algorithm by AGM to remain sub-cubic for larger upper bounds on integer edge costs. Secondly, we show that for graphs with n vertices, the APSP problem can be solved in exactly 3n ‒ 2 communication steps on an n-by-n 2D square mesh array. This improves on the previous result of 3.5n communication steps achieved by Takaoka and Umehara.
For the BP problem, we show that we can compute the bottleneck of the entire graph without solving the All Pairs Bottleneck Paths (APBP) problem, resulting in a much more efficient time bound.
Finally we define an algebraic structure called the distance/flow semi-ring to formally introduce the SP-AF problem, and we provide many algorithms for solving the Single Source SP-AF (SSSP-AF) problem and the All Pairs SP-AF (APSP-AF) problem. For the APSP-AF problem, algebraic algorithms are given that utilise faster matrix multiplication over a ring.2014-01-01T00:00:00ZThe general mechanism of evaporation and production of saturated brine by natural evaporation of sea water in large ponds
http://hdl.handle.net/10092/9728
Title: The general mechanism of evaporation and production of saturated brine by natural evaporation of sea water in large ponds
Authors: Teplitzky, D. R.
Abstract: The principle of manufacturing salt from the sea is discussed. An examination of the literature indicates that the only relevant investigation which has been carried out is on the rate of evaporation from large bodies of water. A summary of the relevant methods of assessing the evaporation is made and it is concluded that the aerodynamic approach is the most promising. An approximate equation describing the evaporation from Lake Grassmere as a function of time and brine concentration is derived for average weather conditions. A qualitative discussion on the mechanism of natural evaporation of water from brine ponds by solar energy leads to energy balances which, it is suggested, should be completely investigated to produce an optimum depth of brine in a pond.
Material balances are set up for the general case of flow in n ponds. These can not be solved, for the variation of flow with time and a stepwise procedure is adopted to allow calculation of the output of saturated brine under average weather conditions for one, two, more than two, and an infinite number of ponds in a system. The latter calculations are based on what is proved to be an invalid assumption so that the results are erroneous. For the one and two pond cases, an estimate of output of saturated brine under average weather conditions is made and the time required to reach the stage of maximum output assessed.1954-01-01T00:00:00Z