A low cost demagnetizer with controllable cycle and adjustable level

Demagnetization to zero remanent value or to a predetermined value is of interest to magnet manufacturers and material users. Conventional methods of demagnetization using a varying alternating demagnetizing field, under a damped oscillatory or conveyor system, result in either high cost for demagnetization or large power dissipation. A simple technique using thyristors is presented for demagnetizing the material. Power consumption is mainly in the first two half-cycles of applied voltage. Hence power dissipation is very much reduced. An optimum value calculation for a thyristor triggering angle for demagnetizing high coercive materials is also presented.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

Efficient algorithms for computing Reeb graphs

The Reeb graph tracks topology changes in level sets of a scalar function and finds applications in scientific visualization and geometric modeling. We describe an algorithm that constructs the Reeb graph of a Morse function defined on a 3-manifold. Our algorithm maintains connected components of the two dimensional levels sets as a dynamic graph and constructs the Reeb graph in O(nlogn+nlogg(loglogg)3) time, where n is the number of triangles in the tetrahedral mesh representing the 3-manifold and g is the maximum genus over all level sets of the function. We extend this algorithm to construct Reeb graphs of d-manifolds in O(nlogn(loglogn)3) time, where n is the number of triangles in the simplicial complex that represents the d-manifold. Our result is a significant improvement over the previously known O(n2) algorithm. Finally, we present experimental results of our implementation and demonstrate that our algorithm for 3-manifolds performs efficiently in practice.

Fictionalising Trauma : The Aesthetics of Marguerite Duras's India Cycle

Marguerite Duras (1914−1996) was one of the most original French writers and film directors, whose cycles are renowned for a transgeneric repetition variation of human suffering in the modern condition. Her fictionalisation of Asian colonialism, the India Cycle (1964−1976), consists of three novels, Le ravissement de Lol V. Stein (1964), Le Vice-consul (1966) and L'amour (1971), a theatre play, India Song (1973), and three films, La Femme du Gange (1973), India Song (1974) and Son nom de Venise dans Calcutta desért (1976). Duras’s cultural position as a colon in inter-war ‘Indochina’ was the backdrop for this “théâtre-text-film”, while its creation was provoked by the atrocities of World War II and post-war decolonisation. Fictionalising Trauma analyses the aesthetics of the India Cycle as Duras’s critical working-through of historical trauma. From an emotion-focused cognitive viewpoint, the study sheds light on trauma’s narrativisation using the renewed concept of traumatic memory developed by current social neuroscience. Duras is shown to integrate embodied memory and narrative memory into an emotionally progressing fiction. Thus the rhetoric of the India Cycle epitomises a creative symbolisation of the unsayable, which revises the concept of trauma from a semiotic failure into an imaginative metaphorical process. The India Cycle portrays the stagnated situation of a white society in Europe and British India during the thirties. The narratives of three European protagonists and one fictional Cambodian mendicant are organised as analogues mirroring the effects of rejection and loss on both sides of the colonial system. Using trauma as a conceptual prism, the study rearticulates this composition as three roles: those of witnessing writers, rejected survivors and colonial perpetrators. Three problems are analysed in turn by reading the non-verbal markers of the text: the white man as a witness, the subversive trope of the madwoman and the deadlock of the colonists’ destructive passion. The study reveals emotion and fantasy to be crucial elements in critical trauma fiction. Two devices intertwine throughout the cycle: affective images of trauma expressing the horror of life and death, and self-reflexive metafiction distancing the face-value of the melodramatic stories. This strategy dismantles racist and sexist discourses underpinning European life, thus demanding a renewal of cultural memory by an empathic listening to the ‘other’. And as solipsism and madness lead the lives of the white protagonists to tragic ends, the ‘real’ beggar in Calcutta lives in ecological harmony with Nature. This emphasises the failure of colonialism, as the Durasian phantasm ambiguously strives for a deconstruction of the exotic mythical fiction of French ‘Indochina’.

On the Cubicity of Interval Graphs

A k-cube (or ``a unit cube in k dimensions'') is defined as the Cartesian product R-1 x . . . x R-k where R-i (for 1 <= i <= k) is an interval of the form [a(i), a(i) + 1] on the real line. The k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that the k-cubes corresponding to two vertices in G have a non-empty intersection if and only if the vertices are adjacent. The cubicity of a graph G, denoted as cub(G), is defined as the minimum dimension k such that G has a k-cube representation. An interval graph is a graph that can be represented as the intersection of intervals on the real line - i. e., the vertices of an interval graph can be mapped to intervals on the real line such that two vertices are adjacent if and only if their corresponding intervals overlap. We show that for any interval graph G with maximum degree Delta, cub(G) <= inverted right perpendicular log(2) Delta inverted left perpendicular + 4. This upper bound is shown to be tight up to an additive constant of 4 by demonstrating interval graphs for which cubicity is equal to inverted right perpendicular log(2) Delta inverted left perpendicular.

Two stage Gifford-McMahon cycle cryorefrigerator operating at 20 K

A two stage Gifford-McMahon cycle cryorefrigerator operating at 20 K is described. This refrigerator uses a very simple ‘spool valve’ and a modified indigenous compressor to compress helium gas. This cryorefrigerator reaches a lowest temperature of 15.5 K; it takes ≈ 50 min to reach 20 K and the cooling capacity is ≈ 2.5 W at 25 K. The cool-down characteristics and load characteristics are presented in graphical form. The effect of changing the operating pressure ratio and the second stage regenerator matrix size are also reported. Pressure-volume (P-V) diagrams obtained at various temperatures indicate that P-V losses form the major fraction of the total losses and this becomes more pronounced as the temperature is decreased. A heat balance analysis shows the relative magnitudes of various losses.

Photosynthetic responses of subtidal seagrasses to a daily light cycle in Torres Strait: A comparative study

In this study, we examined the photosynthetic responses of five common seagrass species from a typical mixed meadow in Torres Strait at a depth of 5–7 m using pulse amplitude modulated (PAM) fluorometry. The photosynthetic response of each species was measured every 2 h throughout a single daily light cycle from dawn (6 am) to dusk (6 pm). PAM fluorometry was used to generate rapid light curves from which measures of electron transport rate (ETRmax), photosynthetic efficiency (α), saturating irradiance (Ek) and light-adapted quantum yield (ΔF/F′m) were derived for each species. The amount of light absorbed by leaves (absorption factor) was also determined for each species. Similar diurnal patterns were recorded among species with 3–4 fold increases in maximal electron rate from dawn to midday and a maintenance of ETRmax in the afternoon that would allow an optimal use of low light by all species. Differences in photosynthetic responses to changes in the daily light regime were also evident with Syringodium isoetifolium showing the highest photosynthetic rates and saturating irradiances suggesting a competitive advantage over other species under conditions of high light. In contrast Halophila ovalis, Halophila decipiens and Halophila spinulosa were characterised by comparatively low photosynthetic rates and minimum light requirements (i.e. low Ek) typical of shade adaptation. The structural makeup of each species may explain the observed differences with large, structurally complex species such as Syringodium isoetifolium and Cymodocea serrulata showing high photosynthetic effciciencies (α) and therefore high-light-adapted traits (e.g. high ETRmax and Ek) compared with the smaller Halophila species positioned lower in the canopy. For the smaller Halophila species these shade-adapted traits are features that optimise their survival during low-light conditions. Knowledge of these characteristics and responses improves our understanding of the underlying causes of changes in seagrass biomass, growth and survival that occur when modifications in light quantity and quality arise from anthropogenic and climatic disturbances that commonly occur in Torres Strait.

Gene expression profiling of cuticular proteins across the moult cycle of the crab Portunus pelagicus

Background: Crustaceans represent an attractive model to study biomineralization and cuticle matrix formation, as these events are precisely timed to occur at certain stages of the moult cycle. Moulting, the process by which crustaceans shed their exoskeleton, involves the partial breakdown of the old exoskeleton and the synthesis of a new cuticle. This cuticle is subdivided into layers, some of which become calcified while others remain uncalcified. The cuticle matrix consists of many different proteins that confer the physical properties, such as pliability, of the exoskeleton. Results: We have used a custom cDNA microarray chip, developed for the blue swimmer crab Portunus pelagicus, to generate expression profiles of genes involved in exoskeletal formation across the moult cycle. A total of 21 distinct moult-cycle related differentially expressed transcripts representing crustacean cuticular proteins were isolated. Of these, 13 contained copies of the cuticle_1 domain previously isolated from calcified regions of the crustacean exoskeleton, four transcripts contained a chitin_bind_4 domain (RR consensus sequence) associated with both the calcified and un-calcified cuticle of crustaceans, and four transcripts contained an unannotated domain (PfamB_109992) previously isolated from C. pagurus. Additionally, cryptocyanin, a hemolymph protein involved in cuticle synthesis and structural integrity, also displays differential expression related to the moult cycle. Moult stage-specific expression analysis of these transcripts revealed that differential gene expression occurs both among transcripts containing the same domain and among transcripts containing different domains. Conclusion: The large variety of genes associated with cuticle formation, and their differential expression across the crustacean moult cycle, point to the complexity of the processes associated with cuticle formation and hardening. This study provides a molecular entry path into the investigation of the gene networks associated with cuticle formation.

A note on acyclic edge coloring of complete bipartite graphs

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic (2-colored) cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). Let Delta = Delta(G) denote the maximum degree of a vertex in a graph G. A complete bipartite graph with n vertices on each side is denoted by K-n,K-n. Alon, McDiarmid and Reed observed that a'(K-p-1,K-p-1) = p for every prime p. In this paper we prove that a'(K-p,K-p) <= p + 2 = Delta + 2 when p is prime. Basavaraju, Chandran and Kummini proved that a'(K-n,K-n) >= n + 2 = Delta + 2 when n is odd, which combined with our result implies that a'(K-p,K-p) = p + 2 = Delta + 2 when p is an odd prime. Moreover we show that if we remove any edge from K-p,K-p, the resulting graph is acyclically Delta + 1 = p + 1-edge-colorable. (C) 2009 Elsevier B.V. All rights reserved.

An effective, economic way of monitoring menstrual cycle hormones in at risk female athletes

PURPOSE: Female athletes, in response to intensive training, competition stress and a lean, athletic physique, are at increased risk of altered hypothalamic-pituitary ovarian (HPO) axis function associated with menstrual cycle disturbance and reduced secretion of the ovarian hormones estrogen and progesterone. Because there is evidence suggesting possible detrimental effects on skeletal health associated with deficiencies in these hormones, a suitable means to asses ovarian hormone concentrations in at risk athletes is needed. The aim of this study was to evaluate a simple, economical means to monitor the ovarian hormone production in athletes, in the setting of intensive training. METHODS: Subjects comprised 14 adolescent rowers, 12 lightweight rowers, and two groups of 10 matched control subjects. Ovarian function was monitored during the competition season by estimation of urinary excretion of estrone glucuronide (E1G) and pregnanediol glucuronide (PdG), enabling the menstrual cycles to be classified as ovulatory or anovulatory. RESULTS: Results indicated 35% and 75% of schoolgirl and lightweight rowers had anovulatory menstrual cycles, respectively. These findings were highlighted by significantly lower excretion of E1G and PdG during phases of intensive training in both the lightweight and schoolgirl rowers, compared with the control subjects. CONCLUSION: It was concluded that the urinary E1G and PdG assays were an effective means to assess the influence of intense training on ovarian hormone concentrations in at risk athletes. It is recommended that this technique be applied more widely as a means of early detection of athletes with low estrogen and progesterone levels, in an attempt to avoid detrimental influences on skeletal health.

Acyclic Edge Coloring of Graphs with Maximum Degree 4

An acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a'(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a'(G) <= Delta+2, where Delta=Delta(G) denotes the maximum degree of G. We prove the conjecture for connected graphs with Delta(G)<= 4, with the additional restriction that m <= 2n-1, where n is the number of vertices and m is the number of edges in G. Note that for any graph G, m <= 2n, when Delta(G)<= 4. It follows that for any graph G if Delta(G)<= 4, then a'(G) <= 7.

Effect of Ethanol Extract of Whole Plant of Trichosanthes cucumerina var. cucumerina L. on Gonadotropins, Ovarian Follicular Kinetics and Estrous Cycle for Screening of Antifertility Activity in Albino Rats

Ethanol extract of whole plant of Trichosanthes cucumerina L. var. cucumerina was evaluated for antiovulatory activity in adult rats. The ethanol extract at the doses 200 and 400mg/kg body weight (orally) affected the normal estrous cycle showing a significant increase in estrus and metestrus phases and decrease in diestrus and proestrus phases. The extract also significantly reduced the number of healthy follicles (Class I-Class VI) and corpora lutea and increased the number of regressing follicles (Stage IA, Stage IB, Stage IIA, and Stage IIB). The protein and glycogen content in the ovaries were significantly reduced in treated rats. The cholesterol level was significantly increased, whereas, the enzyme activities like 3b-HSD and 17b-HSD were significantly inhibited in the ovary of treated rats. Serum FSH and LH levels were significantly reduced in the treated groups were measured by RIA. In acute toxicity test, neither mortality nor change in the behavior or any other physiological activities in mice were observed in the treated groups. In chronic toxicity studies, no mortality was recorded and there were no significant differences in the body and organ weights were observed between controls and treated rats. Hematological analysis showed no significant differences in any of the parameters examined (RBC, WBC count and Hemoglobin estimation). These observations showed the antiovulatory activity of ethanol extract of whole plant of Trichosanthes cucumerina L. var. cucumerina in female albino rats.

A Closed-Cycle Refrigerator Based Pulsed Management System

A low cost 12 T pulsed magnet system has been integrated with a closed-cycle helium refrigerator. The copper solenoid is directly immersed in liquid nitrogen for reduced electrical resistance and more efficient heat transfer. This ensures a minimal delay of few minutes between pulses. The sample is mounted on the cold finger of the refrigerator and, along with the surrounding vacuum shroud, is inserted into the bore of the solenoid. When combined with software lock-in signal processing to reduce noise, quick but accurate measurements can be performed at temperatures 4 K-300 K up to 12 T. Quantum Hall effect data in a p-channel SiGe/Si heterostructure has been used to calibrate the instrument against a commercial superconducting magnet. Its versatility as a routine characterization tool is demonstrated bymeasuring parallel conduction in Si/SiGe modulation doped heterostructures.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

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.