Carotid Surgery : A posse ad esse non valet consequentia

According to a large body of evidence, carotid endarterectomy (CEA) can prevent strokes, provided that appropriate inclusion criteria and high-quality perioperative treatment methods are utilised with low complication rates. From the patient s perspective, it is of paramount importance that the operation is as safe and effective as possible. From the community s point of view, it is important that CEA provision prevents as many strokes as possible. In order to define the stroke preventing potential of CEA in different communities, a comparison between eight European countries and Australia was performed including 53 077 carotid interventions. A more detailed evaluation was performed in Finland, the United Kingdom and Egypt. It could be estimated that many potentially preventable strokes occur due to insufficient diagnostics and CEA provision. The number of CEAs should be at least doubled in the Helsinki region. The theoretical power of CEA provision in stroke prevention varied significantly between the countries. Delay from symptom to surgery has been identified as one of the most important factors influencing the effectiveness of CEA. In 2008 only 11% of CEAs in Helsinki university central hospital (HUCH) were performed within the recommended14 days. Registered data of 673 CEAs in HUCH during 2000-2005 was analyzed. There was no systematic error that would have changed the outcome analysis. However it is important that registers are audited regularly and cross matching of different registries is possible. A previously unpublished method of combining medial mandibulotomy, neck incision and carotid artery interposition was carried out as a collaboration of maxillofacial, ear, nose and throat and vascular surgeons. Five patients were operated on with a technique that was feasible and possible to perform with little morbidity, but due to the significant risks involved, this technique should be reserved for carefully selected cases. In stroke prevention, organisational decisions seem far more important than details in interventional procedures when CEA is performed with low complication rates, as was the case in the present study. A TIA clinic approach with close co-operation between the on-call vascular surgeons, neurologists and radiologists should be available at all centres treating these patients. Patients should have a direct and fast admission to the hospital performing CEA.

Analysis of reflection characteristics of a normal incidence plane wave on resonant sound absorbers: A finite element approach

Resonant sound absorbers are used widely as anechoic coatings in underwater applications. In this paper a finite element scheme based on the Galerkin technique is used to analyze the reflection characteristics of the resonant absorber when insonified by a normal incidence plane wave. A waveguide theory coupled with an impedance matching condition in the fluid is used to model the problem. It is shown in this paper that the fluid medium encompassing the absorber can be modeled as an elastic medium with equivalent Lamé constants. Quarter symmetry conditions within the periodic unit cell are exploited. The finite element results are compared with analytical results, and with results published elsewhere in the literature. It is shown in the process that meshing of the fluid domain can be obviated if the transmission coefficients or reflection coefficients only are desired as is often the case. Finally, some design curves for thin resonant absorbers with water closure are presented in this paper.

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.

Perturbative corrections for staggered four-fermion operators

We present results for one-loop matching coefficients between continuum four-fermion operators, defined in the Naive Dimensional Regularization scheme, and staggered fermion operators of various types. We calculate diagrams involving gluon exchange between quark fines, and ''penguin'' diagrams containing quark loops. For the former we use Landau-gauge operators, with and without O(a) improvement, and including the tadpole improvement suggested by Lepage and Mackenzie. For the latter we use gauge-invariant operators. Combined with existing results for two-loop anomalous dimension matrices and one-loop matching coefficients, our results allow a lattice calculation of the amplitudes for KKBAR mixing and K --> pipi decays with all corrections of O(g2) included. We also discuss the mixing of DELTAS = 1 operators with lower dimension operators, and show that, with staggered fermions, only a single lower dimension operator need be removed by non-perturbative subtraction.

Popular mixed matchings

We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be more popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M, T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based on the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distribution over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P, Q) >= phi(Q, P) for all mixed matchings Q. We show that popular mixed matchings always exist and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem. (C) 2010 Elsevier B.V. All rights reserved.

Turbulent near-wake development behind a flat plate

An asymptotic analysis of the two-dimensional turbulent near-wake flow behind a Rat plate with sharp trailing edge has been formulated, The feature that the near-wake, which is dominated by the mixing of the oncoming turbulent boundary layers retains, to a large extent, the memory of the turbulent structure of the upstream boundary layer has been exploited to develop the analysis. This analysis leads to two regions of the near-wake flow (the inner near-wake and the outer near-wake) for which the governing equations are derived. The matching conditions among these regions lead to a logarithmic variation in the normal direction in the overlapping region surrounding the inner near-wake. These features are validated by the available experimental data. Similarity solutions for the velocity distribution (which satisfy the required matching conditions) in the inner near-wake and outer near-wake regions have been obtained by making the appropriate eddy-viscosity assumptions, Uniformly valid solutions for velocity distribution have been constructed for the near-wake. The solutions show good agreement with available experimental data. (C) Elsevier, Paris.

Context based service discovery for ubiquitous applications

Service discovery is vital in ubiquitous applications, where a large number of devices and software components collaborate unobtrusively and provide numerous services without user intervention. Existing service discovery schemes use a service matching process in order to offer services of interest to the users. Potentially, the context information of the users and surrounding environment can be used to improve the quality of service matching. To make use of context information in service matching, a service discovery technique needs to address certain challenges. Firstly, it is required that the context information shall have unambiguous representation. Secondly, the devices in the environment shall be able to disseminate high level and low level context information seamlessly in the different networks. And thirdly, dynamic nature of the context information be taken into account. We propose a C-IOB(Context-Information, Observation and Belief) based service discovery model which deals with the above challenges by processing the context information and by formulating the beliefs based on the observations. With these formulated beliefs the required services will be provided to the users. The method has been tested with a typical ubiquitous museum guide application over different cases. The simulation results are time efficient and quite encouraging.

Incremental-angle and angular velocity estimation using a star sensor

A method is described for estimating the incremental angle and angular velocity of a spacecraft using integrated rate parameters with the help of a star sensor alone. The chief advantage of this method is that the measured stars need not be identified, whereas the identification of the stars is necessary in earlier methods. This proposed estimation can be carried out with all of the available measurements by a simple linear Kalman filter, albeit with a time-varying sensitivity matrix. The residuals of estimated angular velocity by the proposed spacecraft incremental-angle and angular velocity estimation method are as accurate as the earlier methods. This method also enables the spacecraft attitude to be reconstructed for mapping the stars into an imaginary unit sphere in the body reference frame, which will preserve the true angular separation of the stars. This will pave the way for identification of the stars using any angular separation or triangle matching techniques applied to even a narrow field of view sensor that is made to sweep the sky. A numerical simulation for inertial as well as Earth pointing spacecraft is carried out to establish the results.

Optimization of off-oriented Ge substrates for MOVPE-grown GaAs solar cells

GaAs/Ge heterostructures having abrupt interfaces were grown on 2degrees, 6degrees, and 9degrees off-cut Ge substrates and investigated by cross-sectional high-resolution transmission electron microscopy (HRTEM), scanning electron microscopy, photoluminescence spectroscopy and electrochemical capacitance voltage (ECV) profiler. The GaAs films were grown on off-oriented Ge substrates with growth temperature in the range of 600-700degreesC, growth rate of 3-12 mum/hr and a V/III ratio of 29-88. The lattice indexing of HRTEM exhibits an excellent lattice line matching between GaAs and Ge substrate. The PL spectra from GaAs layer on 6degrees off-cut Ge substrate shows the higher excitonic peak compared with 2degrees and 9degrees off-cut Ge substrates. In addition, the luminescence intensity from the GaAs solar cell grown on 6degrees off-cut is higher than on 9degrees off-cut Ge substrates and signifies the potential use of 6degrees off-cut Ge substrate in the GaAs solar cells industry. The ECV profiling shows an abrupt film/substrate interface as well as between various layers of the solar cell structures.

Electrical transport characteristics of Au/n-GaAs Schottky diodes on n-Ge at low temperatures

The current�voltage characteristics of Au/n-GaAs Schottky diodes grown by metal-organic vapor-phase epitaxy on Ge substrates were determined in the temperature range 80�300 K. The zero-bias barrier height for current transport decreases and the ideality factor increases at low temperatures. The ideality factor was found to show the T0 effect and a higher characteristic energy. The excellent matching between the homogeneous barrier height and the effective barrier height was observed and infer good quality of the GaAs film. No generation�recombination current due to deep levels arising during the GaAs/Ge heteroepitaxy was observed in this study. The value of the Richardson constant was found to be 7.04 A K?2 cm?2, which is close to the value used for the determination of the zero-bias barrier height.

Solving a part classification problem using simulated annealing-like hybrid

Part classification and coding is still considered as laborious and time-consuming exercise. Keeping in view, the crucial role, which it plays, in developing automated CAPP systems, the attempts have been made in this article to automate a few elements of this exercise using a shape analysis model. In this study, a 24-vector directional template is contemplated to represent the feature elements of the parts (candidate and prototype). Various transformation processes such as deformation, straightening, bypassing, insertion and deletion are embedded in the proposed simulated annealing (SA)-like hybrid algorithm to match the candidate part with their prototype. For a candidate part, searching its matching prototype from the information data is computationally expensive and requires large search space. However, the proposed SA-like hybrid algorithm for solving the part classification problem considerably minimizes the search space and ensures early convergence of the solution. The application of the proposed approach is illustrated by an example part. The proposed approach is applied for the classification of 100 candidate parts and their prototypes to demonstrate the effectiveness of the algorithm. (C) 2003 Elsevier Science Ltd. All rights reserved.

Bounded Unpopularity Matchings

We investigate the following problem: given a set of jobs and a set of people with preferences over the jobs, what is the optimal way of matching people to jobs? Here we consider the notion of popularity. A matching M is popular if there is no matching M' such that more people prefer M' to M than the other way around. Determining whether a given instance admits a popular matching and, if so, finding one, was studied by Abraham et al. (SIAM J. Comput. 37(4):1030-1045, 2007). If there is no popular matching, a reasonable substitute is a matching whose unpopularity is bounded. We consider two measures of unpopularity-unpopularity factor denoted by u(M) and unpopularity margin denoted by g(M). McCutchen recently showed that computing a matching M with the minimum value of u(M) or g(M) is NP-hard, and that if G does not admit a popular matching, then we have u(M) >= 2 for all matchings M in G. Here we show that a matching M that achieves u(M) = 2 can be computed in O(m root n) time (where m is the number of edges in G and n is the number of nodes) provided a certain graph H admits a matching that matches all people. We also describe a sequence of graphs: H = H(2), H(3), ... , H(k) such that if H(k) admits a matching that matches all people, then we can compute in O(km root n) time a matching M such that u(M) <= k - 1 and g(M) <= n(1 - 2/k). Simulation results suggest that our algorithm finds a matching with low unpopularity in random instances.

Influence of the highest occupied molecular orbital energy level of the donor material on the effectiveness of the anode buffer layer in organic solar cells

Efficiency of organic photovoltaic cells based on organic electron donor/organic electron acceptor junctions can be strongly improved when the transparent conductive Anode is coated with a Buffer Layer (ABL). Here, the effects of a metal (gold) or oxide (molybdenum oxide) ABL are reported, as a function of the Highest Occupied Molecular Orbital (HOMO) of different electron donors. The results indicate that a good matching between the work function of the anode and the highest occupied molecular orbital of the donor material is the major factor limiting the hole transfer efficiency. Indeed, gold is efficient as ABL only when the HOMO of the organic donor is close to its work function Phi(Au). Therefore we show that the MoO(3) oxide has a wider field of application as ABL than gold. (C) 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim

Site Characterization of Bangalore using Geophysical Method

A number of geophysical methods have been proposed for near-surface site characterization and measurement of shear wave velocity by using a great variety of testing configurations, processing techniques,and inversion algorithms. In particular, two widely-used techniques are SASW (Spectral Analysis of SurfaceWaves) and MASW (Multichannel Analysis of SurfaceWaves). MASW is increasingly being applied to earthquake geotechnical engineering for the local site characterization, microzonation and site response studies.A MASW is a geophysical method, which generates a shear-wave velocity (Vs) profile (i.e., Vs versus depth)by analyzing Raleigh-type surface waves on a multichannel record. MASW system consisting of 24 channels Geode seismograph with 24 geophones of 4.5 Hz frequency have been used in this investigation. For the site characterization program, the MASW field experiments consisting of 58 one-dimensional shear wave velocity tests and 20 two-dimensional shear wave tests have been carried out. The survey points have been selected in such a way that the results supposedly represent the whole metropolitan Bangalore having an area of 220 km2.The average shear wave velocity of Bangalore soils have been evaluated for depths of 5m, 10m, 15m, 20m, 25m and 30 m. The subsoil site classification has been made for seismic local site effect evaluation based on average shear wave velocity of 30m depth (Vs30) of sites using National Earthquake Hazards Reduction Program (NEHRP) and International Building Code (IBC) classification. Soil average shearwave velocity estimated based on overburden thickness from the borehole information is also presented. Mapping clearly indicates that the depth of soil obtained from MASW is closely matching with the soil layers in bore logs. Among total 55 locations of MASW survey carried out, 34 locations were very close to the SPT borehole locations and these are used to generate correlation between Vs and corrected “N” values. The SPT field “N” values are corrected by applying the NEHRP recommended corrections.

A Real-time clustering system for spatio-temporal signals from network of neurons

Over past few years, the studies of cultured neuronal networks have opened up avenues for understanding the ion channels, receptor molecules, and synaptic plasticity that may form the basis of learning and memory. The hippocampal neurons from rats are dissociated and cultured on a surface containing a grid of 64 electrodes. The signals from these 64 electrodes are acquired using a fast data acquisition system MED64 (Alpha MED Sciences, Japan) at a sampling rate of 20 K samples with a precision of 16-bits per sample. A few minutes of acquired data runs in to a few hundreds of Mega Bytes. The data processing for the neural analysis is highly compute-intensive because the volume of data is huge. The major processing requirements are noise removal, pattern recovery, pattern matching, clustering and so on. In order to interface a neuronal colony to a physical world, these computations need to be performed in real-time. A single processor such as a desk top computer may not be adequate to meet this computational requirements. Parallel computing is a method used to satisfy the real-time computational requirements of a neuronal system that interacts with an external world while increasing the flexibility and scalability of the application. In this work, we developed a parallel neuronal system using a multi-node Digital Signal processing system. With 8 processors, the system is able to compute and map incoming signals segmented over a period of 200 ms in to an action in a trained cluster system in real time.