Transient analysis and synthesis of linear circuits using constraint logic programming

In this paper describes the design of a transient analysis program for linear circuits and its implementation in a Constraint Logic Programming language, CLP(R). The transient analysis program parses the input circuit description into a network graph, analyses its semantic correctness and then performs the transient analysis. The test results show that the program is at least 97% accurate when run at two decimal places. We have also compared the performance of our program with a commercial package implemented in an imperative language. The advantages of implementing the analysis program in a CLP language include: quick construction and ease of maintenance. We also report on the synthesis of generation of a circuit with given transient characteristics

Optimum structure to carry a uniform load between pinned supports: Exact analytical solution

This article is available open access through the publisher’s website at the link below. Copyright @ 2010 The Royal Society.Recent numerical evidence indicates that a parabolic funicular is not necessarily the optimal structural form to carry a uniform load between pinned supports. When the constituent material is capable of resisting equal limiting tensile and compressive stresses, a more efficient structure can be identified, comprising a central parabolic section and networks of truss bars emerging from the supports. In the current article, a precise geometry for this latter structure is identified, avoiding the inconsistencies that render the parabolic form non-optimal. Explicit analytical expressions for the geometry, stress and virtual-displacement fields within and above the structure are presented. Furthermore, a suitable displacement field below the structure is computed numerically and shown to satisfy the Michell–Hemp optimality criteria, hence formally establishing the global optimality of this new structural form

Induced voltage in an open wire

A puzzle arising from Faraday's law is considered and solved concerning the question which voltage is induced in an open wire with a time-varying homogeneous magnetic field. In contrast to closed wires where the voltage is determined by the time variance of magnetic field and enclosed area, in an open wire we have to integrate the electric field along the wire. It is found that the longitudinal electric field contributes with 1/3 and the transverse field with 2/3 to the induced voltage. In order to find the electric fields the sources of the magnetic fields are necessary to know. The representation of a homogeneous and time-varying magnetic field implies unavoidably a certain symmetry point or symmetry line which depend on the geometry of the source. As a consequence the induced voltage of an open wire is found to be the area covered with respect to this symmetry line or point perpendicular to the magnetic field. This in turn allows to find the symmetry points of a magnetic field source by measuring the voltage of an open wire placed with different angles in the magnetic field. We present exactly solvable models for a symmetry point and for a symmetry line, respectively. The results are applicable to open circuit problems like corrosion and for astrophysical applications

The Effect of Cooling Rate on the Ductile- Brittle Bend-transition Temperature of Chromium Wire

Effect of cooling rate on ductile-brittle bend-transition temperature of chromium wir

Investigation of mechanical properties of chromium, chromium-rhenium, and derived alloys Twenty-third quarterly progress report, Oct. 1, 1965 - Mar. 31, 1966

Mechanical properties of chromium-rhenium alloy wire

Simultaneous sparse approximation via greedy pursuit

A simple sparse approximation problem requests an approximation of a given input signal as a linear combination of T elementary signals drawn from a large, linearly dependent collection. An important generalization is simultaneous sparse approximation. Now one must approximate several input signals at once using different linear combinations of the same T elementary signals. This formulation appears, for example, when analyzing multiple observations of a sparse signal that have been contaminated with noise. A new approach to this problem is presented here: a greedy pursuit algorithm called simultaneous orthogonal matching pursuit. The paper proves that the algorithm calculates simultaneous approximations whose error is within a constant factor of the optimal simultaneous approximation error. This result requires that the collection of elementary signals be weakly correlated, a property that is also known as incoherence. Numerical experiments demonstrate that the algorithm often succeeds, even when the inputs do not meet the hypotheses of the proof

Relations between extensional tectonics and magmatism within the Southern Oklahoma aulacogen

Variations in the geometry, distribution and thickness of Cambrian igneous and sedimentary units within southwest Oklahoma are related to a late Proterozoic - early Paleozoic rifting event which formed the Southern Oklahoma aulacogen. These rock units are exposed in the Wichita Mountains, southwest Olkahoma, located on the northern margin of a Proterozoic basin, identified in the subsurface by COCORP reflection data. Overprinting of the Cambrian extensional event by Pennyslvanian tectonism obsured the influence of pre-existing basement structures and contrasting basement lithologies upon the initial development of the aulacogen

Developing a new business model for enabling research - the case of the ACPFG in Australia

Publisher's postprint archived as permitted by publisher.The way in which companies, research centres and educational institutions are organised and structured may provide a competitive advantage for commercialisation, in particular if companies are dependent on the deployment of complementary assets and capabilities by third parties. This paper presents the case of the Australian Centre for Plant Functional Genomics (ACPFG), a private agricultural biotechnology (agbiotech) company specialising in early stage Research and Development (R&D) to produce superior adapted cereal varieties, tolerant to abiotic stress conditions such as drought, frost, salt, or mineral toxicity, all of which have a direct and negative impact on plant growth and crop productivity. The organisational structure of the company has been influenced and shaped by Government policy, shareholders expectations and trends in the agbiotech industrial organisation. It has proved attractive to potential alliance partners for collaborative R&D and commercialisation. We present the ACPFG as a new business model to fund basic research and facilitate technology transfer.Stephanie C. Agius, David Corkindale, Antonio G. Dottore, Michael Gilber

Analytical and finite-element study of optimal strain distribution in various beam shapes for energy harvesting applications

Due to the increasing demand for harvesting energy from environmental vibration, for use in self-powered electronic applications, cantilever-based vibration energy harvesting has attracted great interest from various parties and become one of the most common approaches to convert redundant mechanical energy into electrical energy. As the output voltage produces from a piezoelectric material depends greatly on the geometric shape and the size of the beam, there is a need to model and compare the performance of cantilever beams of differing geometries. This paper presents the study of strain distribution in various shapes of cantilever beams, including a convex and concave edge profile elliptical beams that have been overseen in most of the prior literature. Both analytical and finite element models are derived and the resultant strain distributions in the beam are computed based on MATLAB solver and ANSYS finite element analysis tools. An optimum geometry for a vibration-based energy harvester system is verified. Lastly, experimental results comparing the power density for a triangular and rectangular piezoelectric beams are also presented to validate the finding of the study and the claim as suggested in the literature is verified

Cross-Sender Bit-Mixing Coding

Scheduling to avoid packet collisions is a long-standing challenge in networking, and has become even trickier in wireless networks with multiple senders and multiple receivers. In fact, researchers have proved that even {\em perfect} scheduling can only achieve $\mathbf{R} = O(\frac{1}{\ln N})$. Here $N$ is the number of nodes in the network, and $\mathbf{R}$ is the {\em medium utilization rate}. Ideally, one would hope to achieve $\mathbf{R} = \Theta(1)$, while avoiding all the complexities in scheduling. To this end, this paper proposes {\em cross-sender bit-mixing coding} ({\em BMC}), which does not rely on scheduling. Instead, users transmit simultaneously on suitably-chosen slots, and the amount of overlap in different user's slots is controlled via coding. We prove that in all possible network topologies, using BMC enables us to achieve $\mathbf{R}=\Theta(1)$. We also prove that the space and time complexities of BMC encoding/decoding are all low-order polynomials.Comment: Published in the International Conference on Information Processing in Sensor Networks (IPSN), 201