Molecular genetics of Usher syndrome -inherited deafness and blindness

Usher syndrome (USH) is an inherited blindness and deafness disorder with variable vestibular dysfunction. The syndrome is divided into three subtypes according to the progression and severity of clinical symptoms. The gene mutated in Usher syndrome type 3 (USH3), clarin 1 (CLRN1), was identified in Finland in 2001 and two mutations were identified in Finnish patients at that time. Prior to this thesis study, the two CLRN1 gene mutations were the only USH mutations identified in Finnish USH patients. To further clarify the Finnish USH mutation spectrum, all nine USH genes were studied. Seven mutations were identified: one was a previously known mutation in CLRN1, four were novel mutations in myosin VIIa (MYO7A) and two were a novel and a previously known mutation in usherin (USH2A). Another aim of this thesis research was to further study the structure and function of the CLRN1 gene, and to clarify the effects of mutations on protein function. The search for new splice variants resulted in the identification of eight novel splice variants in addition to the three splice variants that were already known prior to this study. Studies of the possible promoter regions for these splice variants showed the most active region included the 1000 bases upstream of the translation start site in the first exon of the main three exon splice variant. The 232 aa CLRN1 protein encoded by the main (three-exon) splice variant was transported to the plasma membrane when expressed in cultured cells. Western blot studies suggested that CLRN1 forms dimers and multimers. The CLRN1 mutant proteins studied were retained in the endoplasmic reticulum (ER) and some of the USH3 mutations caused CLRN1 to be unstable. During this study, two novel CLRN1 sequence alterations were identified and their pathogenicity was studied with cell culture protein expression. Previous studies with mice had shown that Clrn1 is expressed in mouse cochlear hair cells and spiral ganglion cells, but the expression profile in mouse retina remained unknown. The Clrn1 knockout mice display cochlear cell disruption/death, but do not have a retinal phenotype. The zebrafish, Danio rerio, clrn1 was found to be expressed in hair cells associated with hearing and balance. Clrn1 expression was also found in the inner nuclear layer (INL), photoreceptor layer and retinal pigment epithelium layer (RPE) of the zebrafish retina. When Clrn1 production was knocked down with injected morpholino oligonucleotides (MO) targeting Clrn1 translation or correct splicing, the zebrafish larvae showed symptoms similar to USH3 patients. These larvae had balance/hearing problems and reduced response to visual stimuli. The knowledge this thesis research has provided about the mutations in USH genes and the Finnish USH mutation spectrum are important in USH patient diagnostics. The extended information about the structure and function of CLRN1 is a step further in exploring USH3 pathogenesis caused by mutated CLRN1 as well as a step in finding a cure for the disease.

Search for the Higgs boson in the all-hadronic final state using the CDF II detector

We report on a search for the production of the Higgs boson decaying to two bottom quarks accompanied by two additional quarks. The data sample used corresponds to an integrated luminosity of approximately 4  fb-1 of pp̅ collisions at √s=1.96  TeV recorded by the CDF II experiment. This search includes twice the integrated luminosity of the previous published result, uses analysis techniques to distinguish jets originating from light flavor quarks and those from gluon radiation, and adds sensitivity to a Higgs boson produced by vector boson fusion. We find no evidence of the Higgs boson and place limits on the Higgs boson production cross section for Higgs boson masses between 100  GeV/c2 and 150  GeV/c2 at the 95% confidence level. For a Higgs boson mass of 120  GeV/c2, the observed (expected) limit is 10.5 (20.0) times the predicted standard model cross section.

Random-Restart Reactive Tabu Search Algorithm for Detection in Large-MIMO Systems

We present a low-complexity algorithm based on reactive tabu search (RTS) for near maximum likelihood (ML) detection in large-MIMO systems. The conventional RTS algorithm achieves near-ML performance for 4-QAM in large-MIMO systems. But its performance for higher-order QAM is far from ML performance. Here, we propose a random-restart RTS (R3TS) algorithm which achieves significantly better bit error rate (BER) performance compared to that of the conventional RTS algorithm in higher-order QAM. The key idea is to run multiple tabu searches, each search starting with a random initial vector and choosing the best among the resulting solution vectors. A criterion to limit the number of searches is also proposed. Computer simulations show that the R3TS algorithm achieves almost the ML performance in 16 x 16 V-BLAST MIMO system with 16-QAM and 64-QAM at significantly less complexities than the sphere decoder. Also, in a 32 x 32 V-BLAST MIMO system, the R3TS performs close to ML lower bound within 1.6 dB for 16-QAM (128 bps/Hz), and within 2.4 dB for 64-QAM (192 bps/Hz) at 10(-3) BER.

On some results of A. E. Livingston and coefficient problems for concave univalent functions

We consider functions that map the open unit disc conformally onto the complement of a bounded convex set. We call these functions concave univalent functions. In 1994, Livingston presented a characterization for these functions. In this paper, we observe that there is a minor flaw with this characterization. We obtain certain sharp estimates and the exact set of variability involving Laurent and Taylor coefficients for concave functions. We also present the exact set of variability of the linear combination of certain successive Taylor coefficients of concave functions.

On extremal solutions to stochastic control problems, II

The set of attainable laws of the joint state-control process of a controlled diffusion is analyzed from a convex analytic viewpoint. Various equivalence relations depending on one-dimensional marginals thereof are defined on this set and the corresponding equivalence classes are studied.

A monolithic strategy for fluid-structure interaction problems

In this work, we present a new monolithic strategy for solving fluid-structure interaction problems involving incompressible fluids, within the context of the finite element method. This strategy, similar to the continuum dynamics, conserves certain properties, and thus provides a rational basis for the design of the time-stepping strategy; detailed proofs of the conservation of these properties are provided. The proposed algorithm works with displacement and velocity variables for the structure and fluid, respectively, and introduces no new variables to enforce velocity or traction continuity. Any existing structural dynamics algorithm can be used without change in the proposed method. Use of the exact tangent stiffness matrix ensures that the algorithm converges quadratically within each time step. An analytical solution is presented for one of the benchmark problems used in the literature, namely, the piston problem. A number of benchmark problems including problems involving free surfaces such as sloshing and the breaking dam problem are used to demonstrate the good performance of the proposed method. Copyright (C) 2010 John Wiley & Sons, Ltd.

A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks

Our study concerns an important current problem, that of diffusion of information in social networks. This problem has received significant attention from the Internet research community in the recent times, driven by many potential applications such as viral marketing and sales promotions. In this paper, we focus on the target set selection problem, which involves discovering a small subset of influential players in a given social network, to perform a certain task of information diffusion. The target set selection problem manifests in two forms: 1) top-k nodes problem and 2) lambda-coverage problem. In the top-k nodes problem, we are required to find a set of k key nodes that would maximize the number of nodes being influenced in the network. The lambda-coverage problem is concerned with finding a set of k key nodes having minimal size that can influence a given percentage lambda of the nodes in the entire network. We propose a new way of solving these problems using the concept of Shapley value which is a well known solution concept in cooperative game theory. Our approach leads to algorithms which we call the ShaPley value-based Influential Nodes (SPINs) algorithms for solving the top-k nodes problem and the lambda-coverage problem. We compare the performance of the proposed SPIN algorithms with well known algorithms in the literature. Through extensive experimentation on four synthetically generated random graphs and six real-world data sets (Celegans, Jazz, NIPS coauthorship data set, Netscience data set, High-Energy Physics data set, and Political Books data set), we show that the proposed SPIN approach is more powerful and computationally efficient. Note to Practitioners-In recent times, social networks have received a high level of attention due to their proven ability in improving the performance of web search, recommendations in collaborative filtering systems, spreading a technology in the market using viral marketing techniques, etc. It is well known that the interpersonal relationships (or ties or links) between individuals cause change or improvement in the social system because the decisions made by individuals are influenced heavily by the behavior of their neighbors. An interesting and key problem in social networks is to discover the most influential nodes in the social network which can influence other nodes in the social network in a strong and deep way. This problem is called the target set selection problem and has two variants: 1) the top-k nodes problem, where we are required to identify a set of k influential nodes that maximize the number of nodes being influenced in the network and 2) the lambda-coverage problem which involves finding a set of influential nodes having minimum size that can influence a given percentage lambda of the nodes in the entire network. There are many existing algorithms in the literature for solving these problems. In this paper, we propose a new algorithm which is based on a novel interpretation of information diffusion in a social network as a cooperative game. Using this analogy, we develop an algorithm based on the Shapley value of the underlying cooperative game. The proposed algorithm outperforms the existing algorithms in terms of generality or computational complexity or both. Our results are validated through extensive experimentation on both synthetically generated and real-world data sets.

Theoretical and experimental investigation of framed structure-layered soil interaction problems

The plane stress solution for the interaction analysis of a framed structure, with a foundation beam, resting on a layered soil has been studied using both theoretical and photoelastic methods. The theoretical analysis has been done by using a combined analytical and finite element method. In this, the analytical solution has been used for the semi-infinite layered medium and finite element method for the framed structure. The experimental investigation has been carried out using two-dimensional photoelasticity in which modelling of the layered semi-infinite plane and a method to obtain contact pressure distribution have been discussed. The theoretical and experimental results in respect of contact pressure distribution between the foundation beam and layered soil medium, the fibre stresses in the foundation beam and framed structure have been compared. These results have also been compared with theoretical results obtained by idealizing the layered semi-infinite plane as (a) a Winkler model and (b) an equivalent homogeneous semi-infinite medium

Search Strategies for Multiple UAV Search and Destroy Missions

Multiple UAVs are deployed to carry out a search and destroy mission in a bounded region. The UAVs have limited sensor range and can carry limited resources which reduce with use. The UAVs perform a search task to detect targets. When a target is detected which requires different type and quantities of resources to completely destroy, then a team of UAVs called as a coalition is formed to attack the target. The coalition members have to modify their route to attack the target, in the process, the search task is affected, as search and destroy tasks are coupled. The performance of the mission is a function of the search and the task allocation strategies. Therefore, for a given task allocation strategy, we need to devise search strategies that are efficient. In this paper, we propose three different search strategies namely; random search strategy, lanes based search strategy and grid based search strategy and analyze their performance through Monte-Carlo simulations. The results show that the grid based search strategy performs the best but with high information overhead.

A general procedure for modified crack closure integral in 3D problems with cracks

In linear elastic fracture mechanics (LEFM), Irwin's crack closure integral (CCI) is one of the signficant concepts for the estimation of strain energy release rates (SERR) G, in individual as well as mixed-mode configurations. For effective utilization of this concept in conjunction with the finite element method (FEM), Rybicki and Kanninen [Engng Fracture Mech. 9, 931 938 (1977)] have proposed simple and direct estimations of the CCI in terms of nodal forces and displacements in the elements forming the crack tip from a single finite element analysis instead of the conventional two configuration analyses. These modified CCI (MCCI) expressions are basically element dependent. A systematic derivation of these expressions using element stress and displacement distributions is required. In the present work, a general procedure is given for the derivation of MCCI expressions in 3D problems with cracks. Further, a concept of sub-area integration is proposed which facilitates evaluation of SERR at a large number of points along the crack front without refining the finite element mesh. Numerical data are presented for two standard problems, a thick centre-cracked tension specimen and a semi-elliptical surface crack in a thick slab. Estimates for the stress intensity factor based on MCCI expressions corresponding to eight-noded brick elements are obtained and compared with available results in the literature.

Connectionist approach for global optimization

A connectionist approach for global optimization is proposed. The standard function set is tested. Results obtained, in the case of large scale problems, indicate excellent scalability of the proposed approach

Modified Crack Closure Integral (MCCI) For 3-D Problems Using 20-Noded Brick Elements

The Modified Crack Closure Integral (MCCI) technique based on Irwin's crack closure integral concept is very effective for estimation of strain energy release rates G in individual as well as mixed-mode configurations in linear elastic fracture mechanics problems. In a finite element approach, MCCI can be evaluated in the post-processing stage in terms of nodal forces and displacements near the crack tip. The MCCI expressions are however, element dependent and require a systematic derivation using stress and displacement distributions in the crack tip elements. Earlier a general procedure was proposed by the present authors for the derivation of MCCI expressions for 3-dimensional (3-d) crack problems modelled with 8-noded brick elements. A concept of sub-area integration was proposed to estimate strain energy release rates at a large number of points along the crack front. In the present paper a similar procedure is adopted for the derivation of MCCI expressions for 3-d cracks modelled with 20-noded brick elements. Numerical results are presented for centre crack tension and edge crack shear specimens in thick slabs, showing a comparison between present results and those available in the literature.

Frontier Based Multiple Goal Search in Unknown Environments

We present a frontier based algorithm for searching multiple goals in a fully unknown environment, with only information about the regions where the goals are most likely to be located. Our algorithm chooses an ``active goal'' from the ``active goal list'' generated by running a Traveling Salesman Problem (Tsp) routine with the given centroid locations of the goal regions. We use the concept of ``goal switching'' which helps not only in reaching more number of goals in given time, but also prevents unnecessary search around the goals that are not accessible (surrounded by walls). The simulation study shows that our algorithm outperforms Multi-Heuristic LRTA* (MELRTA*) which is a significant representative of multiple goal search approaches in an unknown environment, especially in environments with wall like obstacles.

Contraceptive vaccines: current status and problems in mass application

Progress in the development of contraceptive vaccines for males and females is reviewed. Based on the criteria which need to be met with, none of the proposed candidate antigens meets the requirements for use as a contraceptive vaccine for human application. One of the major problems is the need for periodic injections to maintain required titre and use of an alternate method until effective titres are obtained. Some of the problems associated with active immunization approach can be overcome by the use of preformed, highly specific, potent antibodies. Some progress has been achieved in this direction by the use of humanized single chain monoclonal antibodies to human chorionic gonadotropin.

Layered Tabu Search Algorithm for Large-MIMO Detection and a Lower Bound on ML Performance

In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions in this paper are two-fold. First, we propose a low-complexity algorithm for large-MIMO detection based on a layered low-complexity local neighborhood search. Second, we obtain a lower bound on the maximum-likelihood (ML) bit error performance using the local neighborhood search. The advantages of the proposed ML lower bound are i) it is easily obtained for MIMO systems with large number of antennas because of the inherent low complexity of the search algorithm, ii) it is tight at moderate-to-high SNRs, and iii) it can be tightened at low SNRs by increasing the number of symbols in the neighborhood definition. Interestingly, the proposed detection algorithm based on the layered local search achieves bit error performances which are quite close to this lower bound for large number of antennas and higher-order QAM. For e. g., in a 32 x 32 V-BLAST MIMO system, the proposed detection algorithm performs close to within 1.7 dB of the proposed ML lower bound at 10(-3) BER for 16-QAM (128 bps/Hz), and close to within 4.5 dB of the bound for 64-QAM (192 bps/Hz).