A MATLAB Code for Three Dimensional Linear Elastostatics using Constant Boundary Elements

Present work presents a code written in the very simple programming language MATLAB, for three dimensional linear elastostatics, using constant boundary elements. The code, in full or in part, is not a translation or a copy of any of the existing codes. Present paper explains how the code is written, and lists all the formulae used. Code is verified by using the code to solve a simple problem which has the well known approximate analytical solution. Of course, present work does not make any contribution to research on boundary elements, in terms of theory. But the work is justified by the fact that, to the best of author’s knowledge, as of now, one cannot find an open access MATLAB code for three dimensional linear elastostatics using constant boundary elements. Author hopes this paper to be of help to beginners who wish to understand how a simple but complete boundary element code works, so that they can build upon and modify the present open access code to solve complex engineering problems quickly and easily. The code is available online for open access (as supplementary file for the present paper), and may be downloaded from the website for the present journal.

Optimal Linear Codes with a Local-Error-Correction Property

Motivated by applications to distributed storage, Gopalan et al recently introduced the interesting notion of information-symbol locality in a linear code. By this it is meant that each message symbol appears in a parity-check equation associated with small Hamming weight, thereby enabling recovery of the message symbol by examining a small number of other code symbols. This notion is expanded to the case when all code symbols, not just the message symbols, are covered by such ``local'' parity. In this paper, we extend the results of Gopalan et. al. so as to permit recovery of an erased code symbol even in the presence of errors in local parity symbols. We present tight bounds on the minimum distance of such codes and exhibit codes that are optimal with respect to the local error-correction property. As a corollary, we obtain an upper bound on the minimum distance of a concatenated code.

Better QOS with W/T SPR codes for the transmission of multimedia signals in Optical CDMA networks

In this paper optical code-division multiple-access (O-CDMA) packet network is considered, which offers inherent security in the access networks. The application of O-CDMA to multimedia transmission (voice, data, and video) is investigated. The simultaneous transmission of various services is achieved by assigning to each user unique multiple code signatures. Thus, by applying a parallel mapping technique, we achieve multi-rate services. A random access protocol is proposed, here, where all distinct codes are used, for packet transmission. The codes, Optical Orthogonal Code (OOC), or 1D codes and Wavelength/Time Single-Pulse-per-Row (W/T SPR), or 2D codes, are analyzed. These 1D and 2D codes with varied weight are used to differentiate the Quality of Service (QoS). The theoretical bit error probability corresponding to the quality of each service is established using 1D and 2D codes in the receiver noiseless case and compared. The results show that, using 2D codes QoS in multimedia transmission is better than using 1D codes.

Codes with Locality for Two Erasures

In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean recovery via a single parity-check equation associated with small Hamming weight. Earlier approaches considered recovery in parallel; the sequential approach allows us to potentially construct codes with improved minimum distance. These codes, which we refer to as locally 2-reconstructible codes, are a natural generalization along one direction, of codes with all-symbol locality introduced by Gopalan et al, in which recovery from a single erasure is considered. By studying the generalized Hamming weights of the dual code, we derive upper bounds on the minimum distance of locally 2-reconstructible codes and provide constructions for a family of codes based on Turan graphs, that are optimal with respect to this bound. The minimum distance bound derived here is universal in the sense that no code which permits all-symbol local recovery from 2 erasures can have larger minimum distance regardless of approach adopted. Our approach also leads to a new bound on the minimum distance of codes with all-symbol locality for the single-erasure case.

Belief propagation for minimum weight many-to-one matchings in the random complete graph

In a complete bipartite graph with vertex sets of cardinalities n and n', assign random weights from exponential distribution with mean 1, independently to each edge. We show that, as n -> infinity, with n' = n/alpha] for any fixed alpha > 1, the minimum weight of many-to-one matchings converges to a constant (depending on alpha). Many-to-one matching arises as an optimization step in an algorithm for genome sequencing and as a measure of distance between finite sets. We prove that a belief propagation (BP) algorithm converges asymptotically to the optimal solution. We use the objective method of Aldous to prove our results. We build on previous works on minimum weight matching and minimum weight edge cover problems to extend the objective method and to further the applicability of belief propagation to random combinatorial optimization problems.

Construction of Singer Subgroup Orbit Codes Based on Cyclic Difference Sets

A recent approach for the construction of constant dimension subspace codes, designed for error correction in random networks, is to consider the codes as orbits of suitable subgroups of the general linear group. In particular, a cyclic orbit code is the orbit of a cyclic subgroup. Hence a possible method to construct large cyclic orbit codes with a given minimum subspace distance is to select a subspace such that the orbit of the Singer subgroup satisfies the distance constraint. In this paper we propose a method where some basic properties of difference sets are employed to select such a subspace, thereby providing a systematic way of constructing cyclic orbit codes with specified parameters. We also present an explicit example of such a construction.

Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes

We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor. © 2004 Elsevier B.V.

Weaknesses of margulis and ramanujan-margulis low-density parity-check codes

We report weaknesses in two algebraic constructions of low-density parity-check codes based on expander graphs. The Margulis construction gives a code with near-codewords, which cause problems for the sum-product decoder; The Ramanujan-Margulis construction gives a code with low-weight codewords, which produce an error-floor. ©2003 Published by Elsevier Science B. V.

Assessment of dry weight by monitoring changes in blood volume during hemodialysis using Crit-Line.

BACKGROUND: Routine assessment of dry weight in chronic hemodialysis patients relies primarily on clinical evaluation of patient fluid status. We evaluated whether measurement of postdialytic vascular refill could assist in the assessment of dry weight. METHODS: Twenty-eight chronic, stable hemodialysis patients were studied during routine treatment sessions using constant dialysate temperature and dialysate sodium concentration, and relative changes in blood volume were monitored using Crit-Line III monitors throughout this study. The study was divided into three phases. Phase 1 studies evaluated the time-dependence of vascular compartment refill after completion of hemodialysis. Phase 2 studies evaluated the relationships in patient subgroups between intradialytic changes in blood volume and the presence of postdialytic vascular compartment refill during that last 10 minutes of hemodialysis after stopping ultrafiltration. Phase 3 studies evaluated the extent of dry weight changes following the application of a protocol for blood volume reduction, postdialytic vascular compartment refill, and correlation with clinical evidence of intradialytic hypovolemia and/or postdialytic fatigue. Phase 3 included anywhere from three to five treatments. RESULTS: Phase 1 studies demonstrated that despite interpatient variability in the magnitude of postdialytic vascular compartment refill, when significant refill was evident, it always continued for at least 30 minutes. However, the majority of refill took place within 10 minutes postdialysis. Phase 2 studies identified 3 groups of patients: those who exhibited intradialytic reductions in blood volume but not postdialytic vascular compartment refill (group 1), those who exhibited intradialytic reductions in blood volume and postdialytic vascular compartment refill (group 2), and those whose blood volume did not change substantially during hemodialysis treatment (group 3). In phase 3 studies, use of an ultrafiltration protocol for blood volume reduction and monitoring of postdialytic vascular compartment refill combined with clinical assessment of hypovolemia and postdialytic fatigue demonstrated that patients often had a clinical dry weight assessment which was too low or too high. In all 28 patients studied, dry weight was either increased or decreased following use of this protocol. CONCLUSION: Determination of the extent of both intradialytic decreases in blood volume and postdialytic vascular compartment refill, combined with clinical assessment of intradialytic hypovolemia and postdialytic fatigue, can help assess patient dry weight and optimize volume status while reducing dialysis associated morbidity. The number of hospital admissions due to fluid overload may be reduced.

MOLECULAR-WEIGHT DEPENDENCE OF THE GLASS-TRANSITION OF CYCLIC POLYSTYRENE

The glass transition temperature (T(g)) of cyclic polystyrene was measured by differential scanning calorimetry. There was a marked difference in the glass transition behaviour between cyclic and linear polystyrene. In the low molecular weight region (M(n) < 5 x 10(3)), the T(g) of the cyclic polystyrene increased with decreasing M(n), contrary to that of linear polystyrene. With M(n) higher than 5 x 10(3), the T(g) of cyclic polystyrene increased with increasing M(n). The T(g) of cyclic and linear polystyrene approached the same constant value when the M(n) was high enough (M(n) > 10(5)). Combining the results of specific volume, it is believed that the variation of T(g) with molecular weight does not depend only on free volume effects but that configurational entropy is also an important factor.

Capillary zone electrophoresis characterization of low molecular weight heparin binding to interleukin 2

A method based on capillary zone electrophoresis (CZE) was used to study the interaction between low molecular weight heparin (LMWH) and interleukin 2 (IL-2). The results showed that the increase of the concentration of LMWH led to the decrease of the peak height and the increase of the peak width of IL-2, but the peak areas were kept constant. The binding constant of IL-2 with LMWH was calculated as 1.2 x 10(6) M(-1) by Scatchard analysis, which is in good agreement with the results found in the references using enzyme-linked immunosorbent assay (ELISA). The results demonstrated that the interaction between IL-2 and LMWH is of fast on-and-off kinetic binding reaction. CZE might be used to study not only slow on-and-off rates interactions, but also fast on-and-off rates ones. The binding constant can be calculated easily, and the method can be applied to study a wide range of heparin-protein interactions. (c) 2005 Elsevier B.V. All rights reserved.

Information sets and partial permutation decoding for codes from finite geometries

Mavron, Vassili; McDonough, T.P.; Key, J.D., (2006) 'Information sets and partial permutation decoding for codes from finite geometries', Finite Fields and their applications 12(2) pp.232-247 RAE2008

Numerical investigation of ramp and constant pressurization system during tube crushing process

The requirement for the automotive industry at present and even more so in the future is to simultaneously develop materials, economic forming processes and techniques for weight reduction of the component. To fulfil this need steel manufacturers have developed Advanced High Strength Steels which have high strength and good formability. Due to high strength, material thickness can be reduced without compromising the function of the component. High pressure hydro forming is one process that can be used to produce complex components from these materials. However, reduction in material thickness of these steels does not result in a large decrease of internal fluid pressure and die closing force during tube hydro forming and hence the higher strengths of these steels will require higher pressures. Tube crushing is a process in which the component can be formed with low pressures. In this paper numerical comparison of ramp and constant pressurization system during tube crushing for a TRIP steel is studied. It is proposed that ramp pressure is the best option to obtain a part with accurate geometrical shape from tube crushing with less die closing force. The stress and thickness distribution of the part during tube crushing were critically analysed.

The weight of the thing left its mark

The weight of the thing left its mark imagines and abstracts a domestic situation where the relationships are under constant negotiation and held by what has been left unsaid. Framed by the unexpected use of kitchen cutlery the performance has a loosely knit structure that makes the dancing immediate and the quality of attention very alive.

"They all work...when you stick to them" : a qualitative investigation of dieting, weight loss, and physical exercise, in obese individuals

Background
To explore the extent to which people living with obesity have attempted to lose weight, their attitudes towards dieting, physical exercise and weight loss solutions, why their weight loss attempts have failed, and their opinions about what would be most beneficial to them in their struggle with their weight.

Method
Qualitative study, using open-ended interviews, of 76 people living with obesity in Victoria, Australia in 2006/7. Individuals with a BMI of 30 or over were recruited using articles in local newspapers, convenience sampling, and at a later stage purposive sampling techniques to diversify the sample. Data analysis was conducted by hand using a constant, comparative method to develop and test analytical categories. Data were interpreted both within team meetings and through providing research participants the chance to comment on the study findings.

Results
Whilst participants repeatedly turned to commercial diets in their weight loss attempts, few had used, or were motivated to participate in physical activity. Friends or family members had introduced most individuals to weight loss techniques. Those who took part in interventions with members of their social network were more likely to report feeling accepted and supported. Participants blamed themselves for being unable to maintain their weight loss or 'stick' to diets. Whilst diets did not result in sustained weight loss, two thirds of participants felt that dieting was an effective way to lose weight.

Conclusion
Individuals with obesity receive numerous instructions about what to do to address their weight, but very few are given appropriate long term guidance or support with which to follow through those instructions. Understanding the positive role of social networks may be particularly important in engaging individuals in physical activity. Public health approaches to obesity must engage and consult with those currently living with obesity, if patterns of social change are to occur.