Substation Automation Systems – Future possibilities for commissioning

Substation Automation Systems have undergone many transformational changes triggered by improvements in technologies. Prior to the digital era, it made sense to confirm that the physical wiring matched the schematic design by meticulous and laborious point to point testing. In this way, human errors in either the design or the construction could be identified and fixed prior to entry into service. However, even though modern secondary systems today are largely computerised, we are still undertaking commissioning testing using the same philosophy as if each signal were hard wired. This is slow and tedious and doesn’t do justice to modern computer systems and software automation. One of the major architectural advantages of the IEC 61850 standard is that it “abstracts” the definition of data and services independently of any protocol allowing the mapping of them to any protocol that can meet the modelling and performance requirements. On this basis, any substation element can be defined using these common building blocks and are made available at the design, configuration and operational stages of the system. The primary advantage of accessing data using this methodology rather than the traditional position method (such as DNP 3.0) is that generic tools can be created to manipulate data. Self-describing data contains the information that these tools need to manipulate different data types correctly. More importantly, self-describing data makes the interface between programs robust and flexible. This paper proposes that the improved data definitions and methods for dealing with this data within a tightly bound and compliant IEC 61850 Substation Automation System could completely revolutionise the need to test systems when compared to traditional point to point methods. Using the outcomes of an undergraduate thesis project, we can demonstrate with some certainty that it is possible to automatically test the configuration of a protection relay by comparing the IEC 61850 configuration extracted from the relay against its SCL file for multiple relay vendors. The software tool provides a quick and automatic check that the data sets on a particular relay are correct according to its CID file, thus ensuring that no unexpected modifications are made at any stage of the commissioning process. This tool has been implemented in a Java programming environment using an open source IEC 61850 library to facilitate the server-client association with the relay.

Automation of underground truck haulage

This paper reviews the state-of-the-art in the automation of underground truck haulage. Past attempts at automating LHDs and haul trucks are described and their particular strengths and weaknesses are listed. We argue that the simple auto-tramming systems currently being commercialised, that follow rail-type guides placed along the back, cannot match the performance, flexibility and reliability of systems based on modern mobile robotic principles. In addition, the lack of collision detection research in the underground environment is highlighted.

Dragline automation

Draglines are used extensively for overburden stripping in Australian open cut coal mines. This paper outlines the design of a computer control system to implement an automated swing cycle on a production dragline. Subsystems and sensors have been developed to satisfy the constraints imposed by the task, the harsh operating environment and the mines production requirements.

On Visual Detection of Highly-occluded Objects for Harvesting Automation in Horticulture

Developing accurate and reliable crop detection algorithms is an important step for harvesting automation in horticulture. This paper presents a novel approach to visual detection of highly-occluded fruits. We use a conditional random field (CRF) on multi-spectral image data (colour and Near-Infrared Reflectance, NIR) to model two classes: crop and background. To describe these two classes, we explore a range of visual-texture features including local binary pattern, histogram of oriented gradients, and learn auto-encoder features. The pro-posed methods are evaluated using hand-labelled images from a dataset captured on a commercial capsicum farm. Experimental results are presented, and performance is evaluated in terms of the Area Under the Curve (AUC) of the precision-recall curves.Our current results achieve a maximum performance of 0.81AUC when combining all of the texture features in conjunction with colour information.

Hantzsch 1,4-dihydropyridine esters and analogs: candidates for generating reproducible one-dimensional packing motifs

Examination of the symmetric Hantzsch 1,4-dihydropyridine ester derivatives of the prototypical nifedipine molecule indicates the tendency of this class of molecule to form a common packing motif. Crystal structure analysis of 2,6-dimethyl-1,4-dihydropyridine-3,5-dicarboxylic diesters and analogs reveals that they form extended chains, characterized as the C(6) packing motif, via intermolecular (amine) N-H...O=C (C3,C5 carbonyl) hydrogen bonds. In addition, all the prepared derivatives also satisfy the basic structural requirements for their high binding efficiency to the receptor. The reproducible C(6) packing motif observed among these compounds has a use in the design of solid-state materials.

An (O)over-tilde(mn) Gomory-Hu Tree Construction Algorithm for Unweighted Graphs

We present a fast algorithm for computing a Gomory-Hu tree or cut tree for an unweighted undirected graph G = (V, E). The expected running time of our algorithm is (O) over tilde (mc) where vertical bar E vertical bar = m and c is the maximum u-v edge connectivity, where u, v is an element of V. When the input graph is also simple (i.e., it has no parallel edges), then the u-v edge connectivity for each pair of vertices u and v is at most n - 1; so the expected run-ning time of our algorithm for simple unweighted graphs is (O) over tilde (mn). All the algorithms currently known for constructing a Gomory-Hu tree [8, 9] use n - 1 minimum s-t cut (i.e., max flow) subroutines. This in conjunction with the current fastest (O) over tilde (n(20/9)) max flow algorithm due to Karger and Levine[11] yields the current best running time of (O) over tilde (n(20/9)n) for Gomory-Hu tree construction on simple unweighted graphs with m edges and n vertices. Thus we present the first (O) over tilde (mn) algorithm for constructing a Gomory-Hu tree for simple unweighted graphs. We do not use a max flow subroutine here; we present an efficient tree packing algorithm for computing Steiner edge connectivity and use this algorithm as our main subroutine. The advantage in using a tree packing algorithm for constructing a Gomory-Hu tree is that the work done in computing a minimum Steiner cut for a Steiner set S subset of V can be reused for computing a minimum Steiner cut for certain Steiner sets S' subset of S.

Parallel packing of alpha-helices in crystals of the zervamicin IIA analog Boc-Trp-Ile-Ala-Aib-Ile-Val-Aib-Leu-Aib-Pro-OMe.2H2O.

An apolar synthetic analog of the first 10 residues at the NH2-terminal end of zervamicin IIA crystallizes in the triclinic space group P1 with cell dimensions a = 10.206 +/- 0.002 A, b = 12.244 +/- 0.002 A, c = 15.049 +/- 0.002 A, alpha = 93.94 +/- 0.01 degrees, beta = 95.10 +/- 0.01 degrees, gamma = 104.56 +/- 0.01 degrees, Z = 1, C60H97N11O13 X 2H2O. Despite the relatively few alpha-aminoisobutyric acid residues, the peptide maintains a helical form. The first intrahelical hydrogen bond is of the 3(10) type between N(3) and O(0), followed by five alpha-helix-type hydrogen bonds. Solution 1H NMR studies in chloroform also favor a helical conformation, with seven solvent-shielded NH groups. Continuous columns are formed by head-to-tail hydrogen bonds between the helical molecules along the helix axis. The absence of polar side chains precludes any lateral hydrogen bonds. Since the peptide crystallizes with one molecule in a triclinic space group, aggregation of the helical columns must necessarily be parallel rather than antiparallel. The packing of the columns is rather inefficient, as indicated by very few good van der Waals' contacts and the occurrence of voids between the molecules.

Packing for East Transport Artworks

Digital Image

Harvesting, packing, postharvest technology, transport and processing

This chapter provides updated information on avocado fruit quality parameters, sensory perception and maturity, production and postharvest factors affecting quality defects, disinfestation and storage (including pre-conditioning), predicting outturn quality and processing.

Orange Packing

Digital image

Central Packing - Rehovoth

Digital image

Location of concentrators in a computer communication network: a stochastic automation search method

The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.

Crystal structure from packing studies: application to the triclinic structure of the cyclic hexapeptide cyclo-(gly-tyr-gly)2

The paper describes a novel method of finding the position and orientation of a relatively rigid molecule in the unit cell from criteria concerning allowed contact distances between atoms. On application to the crystal structure of a hexapeptide, C25H31N6O8.2H2O, it was possible to solve the structure from this starting point, by a series of SFLS refinements with an increasingly larger number of reflexions at successive stages. The packing analysis succeeded, even though the water molecules were not included to start with.

Systematic study on crystal-contact engineering of diphthine synthase: influence of mutations at crystal-packing regions on X-ray diffraction quality

It is well known that protein crystallizability can be influenced by site-directed mutagenesis of residues on the molecular surface of proteins, indicating that the intermolecular interactions in crystal-packing regions may play a crucial role in the structural regularity at atomic resolution of protein crystals. Here, a systematic examination was made of the improvement in the diffraction resolution of protein crystals on introducing a single mutation of a crystal-packing residue in order to provide more favourable packing interactions, using diphthine synthase from Pyrococcus horikoshii OT3 as a model system. All of a total of 21 designed mutants at 13 different crystal-packing residues yielded almost isomorphous crystals from the same crystallization conditions as those used for the wild-type crystals, which diffracted X-rays to 2.1 angstrom resolution. Of the 21 mutants, eight provided crystals with an improved resolution of 1.8 angstrom or better. Thus, it has been clarified that crystal quality can be improved by introducing a suitable single mutation of a crystal-packing residue. In the improved crystals, more intimate crystal-packing interactions than those in the wild-type crystal are observed. Notably, the mutants K49R and T146R yielded crystals with outstandingly improved resolutions of 1.5 and 1.6 angstrom, respectively, in which a large-scale rearrangement of packing interactions was unexpectedly observed despite the retention of the same isomorphous crystal form. In contrast, the mutants that provided results that were in good agreement with the designed putative structures tended to achieve only moderate improvements in resolution of up to 1.75 angstrom. These results suggest a difficulty in the rational prediction of highly effective mutations in crystal engineering.

Effect of substitution on molecular conformation and packing features in a series of aryl substituted ethyl-6-methyl-4-phenyl-2-thioxo-1,2,3,4-tetrahydropyrimidine-5-carboxylates

The supramolecular structures of eight aryl protected ethyl-6-methyl-4-phenyl-2-thioxo-1,2,3,4 tetrahydropyrimidine-5-carboxyl ates were analyzed in order to understand the effect of variations in functional groups on molecular geometry, conformation and packing of molecules in the crystalline lattice. It is observed that the existence of a short intra-molecular C-H center dot center dot center dot pi interaction between the aromatic hydrogen of the aryl ring with the isolated double bond of the six-membered tetrahydropyrimidine ring is a key feature which imparts additional stability to the molecular conformation in the solid state. The compounds pack via the cooperative involvement of both N-H center dot center dot center dot S=C and N-H center dot center dot center dot O=C intermolecular dimers forming a sheet like structure. In addition, weak C-H center dot center dot center dot O and C-H center dot center dot center dot pi intermolecular interactions provide additional stability to the crystal packing.