Graphics Processing Units for the Real-time Linear Elastostatic Simulation of Liver

Biomedical engineering solutions like surgical simulators need High Performance Computing (HPC) to achieve real-time performance. Graphics Processing Units (GPUs) offer HPC capabilities at low cost and low power consumption. In this work, it is demonstrated that a liver which is discretized by about 2500 finite element nodes, can be graphically simulated in realtime, by making use of a GPU. Present work takes into consideration the time needed for the data transfer from CPU to GPU and back from GPU to CPU. Although behaviour of liver is very complicated, present computer simulation assumes linear elastostatics. One needs to use the commercial software ANSYS to obtain the global stiffness matrix of the liver. Results show that GPUs are useful for the real-time graphical simulation of liver, which in turn is needed in simulators that are used for training surgeons in laparoscopic surgery. Although the computer simulation should involve rendering also, neither rendering, nor the time needed for rendering and displaying the liver on a screen, is considered in the present work. The present work is just a demonstration of a concept; the concept is not really implemented and validated. Future work is to develop software which can accomplish real-time and very realistic graphical simulation of liver, with rendered image of liver on the screen changing in real-time according to the position of the surgical tool tip approximated as the mouse cursor in 3D.

New La2CuO4 derivatives La(2-2x)Sr(2x)Cu(1-x)M(x)O(4) (M=Ti, Mn, Fe, or Ru): A study of linear Cu-O-M electronic interaction in two dimensions

Oxides of the general formula La2-2xSr2xCu1-xII,M(x)(IV)O(4) (M = Ti, Mn, Fe, or Ru), crystallizing in the tetragonal K,NIF, structure, have been synthesized. For M=Ti, only the x=0,5 member could be prepared, while for M=Mn and Fe, the composition range is 0 Cu(III)-O-Fe(III) valence degeneracy. Increasing the strontium content at the expense of lanthanum in La2-2xSr2xCu1-xFexO4 for x less than or equal to 0.20 renders the samples metallic but not superconducting. (C) 1997 Academic Press.

Anomalous Behavior of Linear Hydrocarbon Chains in Water-DMSO Binary Mixture at Low DMSO Concentration

We find that at a mole fraction 0.05 of DMSO (x(DMSO) = 0.05) in aqueous solution, a linear hydrocarbon chain of intermediate length (n = 30-40) adopts the most stable collapsed conformation. In pure water, the same chain exhibits an intermittent oscillation between the collapsed and the extended coiled conformations. Even when the mole fraction of DMSO in the bulk is 0.05, the concentration of the same in the first hydration layer around the hydrocarbon of chain length 30 (n = 30) is as large as 17%. Formation of such hydrophobic environment around the hydrocarbon chain may be viewed as the reason for the collapsed conformation gaining additional stability. We find a second anomalous behavior to emerge near x(DMSO) = 0.15, due to a chain-like aggregation of the methyl groups of DMSO in water that lowers the relative concentration of the DMSO molecules in the hydration layer. We further find that as the concentration of DMSO is gradually increased, it progressively attains the extended coiled structure as the stable conformation. Although Flory-Huggins theory (for binary mixture solvent) fails to predict the anomaly at x(DMSO) = 0.05, it seems to capture the essence of the anomaly at 0.15.

Solving linear programming problems exactly

A linear programming problem in an inequality form having a bounded solution is solved error-free using an algorithm that sorts the inequalities, removes the redundant ones, and uses the p-adic arithmetic. (C) Elsevier Science Inc., 1997

Counselling and predictive testing for familial adenomatous polyposis in a rural South Indian community

Background—Mutations of the APC gene cause familial adenomatous polyposis (FAP), a hereditary colorectal cancer predisposition syndrome.Aims—To conduct a cost comparison analysis of predictive genetic testing versus conventional clinical screening for individuals at risk of inheriting FAP, using the perspective of a third party payer. Methods—All direct health care costs for both screening strategies were measured according to time and motion, and the expected costs evaluated using a decision analysis model.Results—The baseline analysis predicted that screening a prototype FAP family would cost $4975/£3109 by molecular testingand $8031/£5019 by clinical screening strategy, when family members were monitored with the same frequency of clinical surveillance (every two to three years). Sensitivity analyses revealed that the genetic testing approach is cost saving for key variables including the kindred size, the age of screening onset, and the cost of mutation identification in a proband. However, if the APC mutation carriers were monitored at an increased (annual) frequency, the cost of the genetic screening strategy increased to $7483/ £4677 and was especially sensitive to variability in age of onset of screening, family size, and cost of genetic testing of at risk relatives. Conclusions—In FAP kindreds, a predictive genetic testing strategy costs less than conventional clinical screening, provided that the frequency of surveillance is identical using either strategy. An additional significant benefit is the elimination of unnecessary colonic examinations for those family members found to be noncarriers.

Predictive uncertainty of chaotic daily streamflow using ensemble wavelet networks approach

Perfect or even mediocre weather predictions over a long period are almost impossible because of the ultimate growth of a small initial error into a significant one. Even though the sensitivity of initial conditions limits the predictability in chaotic systems, an ensemble of prediction from different possible initial conditions and also a prediction algorithm capable of resolving the fine structure of the chaotic attractor can reduce the prediction uncertainty to some extent. All of the traditional chaotic prediction methods in hydrology are based on single optimum initial condition local models which can model the sudden divergence of the trajectories with different local functions. Conceptually, global models are ineffective in modeling the highly unstable structure of the chaotic attractor. This paper focuses on an ensemble prediction approach by reconstructing the phase space using different combinations of chaotic parameters, i.e., embedding dimension and delay time to quantify the uncertainty in initial conditions. The ensemble approach is implemented through a local learning wavelet network model with a global feed-forward neural network structure for the phase space prediction of chaotic streamflow series. Quantification of uncertainties in future predictions are done by creating an ensemble of predictions with wavelet network using a range of plausible embedding dimensions and delay times. The ensemble approach is proved to be 50% more efficient than the single prediction for both local approximation and wavelet network approaches. The wavelet network approach has proved to be 30%-50% more superior to the local approximation approach. Compared to the traditional local approximation approach with single initial condition, the total predictive uncertainty in the streamflow is reduced when modeled with ensemble wavelet networks for different lead times. Localization property of wavelets, utilizing different dilation and translation parameters, helps in capturing most of the statistical properties of the observed data. The need for taking into account all plausible initial conditions and also bringing together the characteristics of both local and global approaches to model the unstable yet ordered chaotic attractor of a hydrologic series is clearly demonstrated.

On the achievable rates of sources having a group alphabet in a distributed source coding setting

We consider the problem of compression via homomorphic encoding of a source having a group alphabet. This is motivated by the problem of distributed function computation, where it is known that if one is only interested in computing a function of several sources, then one can at times improve upon the compression rate required by the Slepian-Wolf bound. The functions of interest are those which could be represented by the binary operation in the group. We first consider the case when the source alphabet is the cyclic Abelian group, Zpr. In this scenario, we show that the set of achievable rates provided by Krithivasan and Pradhan [1], is indeed the best possible. In addition to that, we provide a simpler proof of their achievability result. In the case of a general Abelian group, an improved achievable rate region is presented than what was obtained by Krithivasan and Pradhan. We then consider the case when the source alphabet is a non-Abelian group. We show that if all the source symbols have non-zero probability and the center of the group is trivial, then it is impossible to compress such a source if one employs a homomorphic encoder. Finally, we present certain non-homomorphic encoders, which also are suitable in the context of function computation over non-Abelian group sources and provide rate regions achieved by these encoders.

On the diversity and complexity of Zero Forcing receivers for MIMO Zero Padded systems

Zero padded systems with linear receivers are shown to be robust and amenable to fast implementations in single antenna scenarios. In this paper, properties of such systems are investigated when multiple antennas are present at both ends of the communication link. In particular, their diversity and complexity are evaluated for precoded transmissions. The linear receivers are shown to exploit multipath and receive diversities, even in the absence of any coding at the transmitter. Use of additional redundancy to improve performance is considered and the effect of transmission rate on diversity order is analyzed. Low complexity implementations of Zero Forcing receivers are devised to further enhance their applicability.

Network Error Correction for Unit-Delay, Memory-Free Networks Using Convolutional Codes

A single source network is said to be memory-free if all of the internal nodes (those except the source and the sinks) do not employ memory but merely send linear combinations of the symbols received at their incoming edges on their outgoing edges. In this work, we introduce network-error correction for single source, acyclic, unit-delay, memory-free networks with coherent network coding for multicast. A convolutional code is designed at the source based on the network code in order to correct network- errors that correspond to any of a given set of error patterns, as long as consecutive errors are separated by a certain interval which depends on the convolutional code selected. Bounds on this interval and the field size required for constructing the convolutional code with the required free distance are also obtained. We illustrate the performance of convolutional network error correcting codes (CNECCs) designed for the unit-delay networks using simulations of CNECCs on an example network under a probabilistic error model.

Performance analysis of single-symbol maximum likelihood decodable linear STBCs

Performance of space-time block codes can be improved using the coordinate interleaving of the input symbols from rotated M-ary phase shift keying (MPSK) and M-ary quadrature amplitude modulation (MQAM) constellations. This paper is on the performance analysis of coordinate-interleaved space-time codes, which are a subset of single-symbol maximum likelihood decodable linear space-time block codes, for wireless multiple antenna terminals. The analytical and simulation results show that full diversity is achievable. Using the equivalent single-input single-output model, simple expressions for the average bit error rates are derived over flat uncorrelated Rayleigh fading channels. Optimum rotation angles are found by finding the minimum of the average bit error rate curves.

DMT of multi-hop cooperative networks

Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achievable diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network. Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K-parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3. It is shown that a linear DMT between the maximum diversity dmax and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify-and-forward protocols are often sufficient to attain the optimal DMT.

Video coding mode decision as a classification problem

In this paper, we show that it is possible to reduce the complexity of Intra MB coding in H.264/AVC based on a novel chance constrained classifier. Using the pairs of simple mean-variances values, our technique is able to reduce the complexity of Intra MB coding process with a negligible loss in PSNR. We present an alternate approach to address the classification problem which is equivalent to machine learning. Implementation results show that the proposed method reduces encoding time to about 20% of the reference implementation with average loss of 0.05 dB in PSNR.

Weakly non-linear stability of a hydrodynamic accretion disc

When the cold accretion disc coupling between neutral gas and a magnetic field is so weak that the magnetorotational instability is less effective or even stops working, it is of prime interest to investigate the pure hydrodynamic origin of turbulence and transport phenomena. As the Reynolds number increases, the relative importance of the non-linear term in the hydrodynamic equation increases. In an accretion disc where the molecular viscosity is too small, the Reynolds number is large enough for the non-linear term to have new effects. We investigate the scenario of the `weakly non-linear' evolution of the amplitude of the linear mode when the flow is bounded by two parallel walls. The unperturbed flow is similar to the plane Couette flow, but with the Coriolis force included in the hydrodynamic equation. Although there is no exponentially growing eigenmode, because of the self-interaction, the least stable eigenmode will grow in an intermediate phase. Later, this will lead to higher-order non-linearity and plausible turbulence. Although the non-linear term in the hydrodynamic equation is energy-conserving, within the weakly non-linear analysis it is possible to define a lower bound of the energy (alpha A(c)(2), where A(c) is the threshold amplitude) needed for the flow to transform to the turbulent phase. Such an unstable phase is possible only if the Reynolds number >= 10(3-4). The numerical difficulties in obtaining such a large Reynolds number might be the reason for the negative result of numerical simulations on a pure hydrodynamic Keplerian accretion disc.