A transcriptomic analysis of the kidney tissue of Tra catfish (pangasianodon hypophthalmus) reared in saline condition: De novo assembly, annotation, SNP discovery

Pangasianodon hypophthalmus is a commercially important freshwater fish used in inland aquaculture in the Mekong Delta, Vietnam. The current study using Ion Torrent technology generated EST resources from the kidney for Tra catfish reared at a salinity level of 9 ppt. We obtained 2,623,929 reads after trimming and processing with an average length of 104 bp. De novo assemblies were generated using CLC Genomic Workbench, Trinity and Velvet/Oases with the best overall contig performance resulting from the CLC assembly. De novo assembly using CLC yielded 29,940 contigs, and allowing identification of 5,710 putative genes when comppared with NCBI non-redundant database. A large number of single nucleotide polymorphisms (SNPs) were also detected. The sequence collection generated in our study represents the most comprehensive transcriptomic resource for P. hypophthalmus available to date.

XML Messaging for Mobile Devices

In recent years, XML has been widely adopted as a universal format for structured data. A variety of XML-based systems have emerged, most prominently SOAP for Web services, XMPP for instant messaging, and RSS and Atom for content syndication. This popularity is helped by the excellent support for XML processing in many programming languages and by the variety of XML-based technologies for more complex needs of applications. Concurrently with this rise of XML, there has also been a qualitative expansion of the Internet's scope. Namely, mobile devices are becoming capable enough to be full-fledged members of various distributed systems. Such devices are battery-powered, their network connections are based on wireless technologies, and their processing capabilities are typically much lower than those of stationary computers. This dissertation presents work performed to try to reconcile these two developments. XML as a highly redundant text-based format is not obviously suitable for mobile devices that need to avoid extraneous processing and communication. Furthermore, the protocols and systems commonly used in XML messaging are often designed for fixed networks and may make assumptions that do not hold in wireless environments. This work identifies four areas of improvement in XML messaging systems: the programming interfaces to the system itself and to XML processing, the serialization format used for the messages, and the protocol used to transmit the messages. We show a complete system that improves the overall performance of XML messaging through consideration of these areas. The work is centered on actually implementing the proposals in a form usable on real mobile devices. The experimentation is performed on actual devices and real networks using the messaging system implemented as a part of this work. The experimentation is extensive and, due to using several different devices, also provides a glimpse of what the performance of these systems may look like in the future.

Efficient search for statistically significant dependency rules in binary data

Analyzing statistical dependencies is a fundamental problem in all empirical science. Dependencies help us understand causes and effects, create new scientific theories, and invent cures to problems. Nowadays, large amounts of data is available, but efficient computational tools for analyzing the data are missing. In this research, we develop efficient algorithms for a commonly occurring search problem - searching for the statistically most significant dependency rules in binary data. We consider dependency rules of the form X->A or X->not A, where X is a set of positive-valued attributes and A is a single attribute. Such rules describe which factors either increase or decrease the probability of the consequent A. A classical example are genetic and environmental factors, which can either cause or prevent a disease. The emphasis in this research is that the discovered dependencies should be genuine - i.e. they should also hold in future data. This is an important distinction from the traditional association rules, which - in spite of their name and a similar appearance to dependency rules - do not necessarily represent statistical dependencies at all or represent only spurious connections, which occur by chance. Therefore, the principal objective is to search for the rules with statistical significance measures. Another important objective is to search for only non-redundant rules, which express the real causes of dependence, without any occasional extra factors. The extra factors do not add any new information on the dependence, but can only blur it and make it less accurate in future data. The problem is computationally very demanding, because the number of all possible rules increases exponentially with the number of attributes. In addition, neither the statistical dependency nor the statistical significance are monotonic properties, which means that the traditional pruning techniques do not work. As a solution, we first derive the mathematical basis for pruning the search space with any well-behaving statistical significance measures. The mathematical theory is complemented by a new algorithmic invention, which enables an efficient search without any heuristic restrictions. The resulting algorithm can be used to search for both positive and negative dependencies with any commonly used statistical measures, like Fisher's exact test, the chi-squared measure, mutual information, and z scores. According to our experiments, the algorithm is well-scalable, especially with Fisher's exact test. It can easily handle even the densest data sets with 10000-20000 attributes. Still, the results are globally optimal, which is a remarkable improvement over the existing solutions. In practice, this means that the user does not have to worry whether the dependencies hold in future data or if the data still contains better, but undiscovered dependencies.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Isoaccepting Lysine Transfer Ribonucleic Acid Species of Pseudomonas Aeruginosa

Pseudomonas aeruginosa tRNA was treated with iodine, CNBr and N-ethylmaleimide,three thionucleotide-specific reagents. Reaction with iodine resulted in extensive loss of acceptor activity by lysine tRNA, glutamic acid tRNA, glutamine tRNA, serine tRNA and tyrosine tRNA. CNBr treatment resulted in high loss of acceptor ability by lysine tRNA, glutamic acid tRNA and glutamine tRNA. Only the acceptor ability of tyrosine tRNA was inhibited up to 66% by N-ethylmaleimide treatment, a reagent specific for 4-thiouridine. By the combined use of benzoylated DEAE-cellulose and DEAESephadex columns, lysine tRNA of Ps. aeruginosa was resolved into two isoaccepting species, a major, tRNAL'y and a minor, tRNA'Ys. Co-chromatography of 14C-labelled tRNALYS and 3H-labelled tRNALy, on benzoylated DEAE-cellulose at pH4.5 gave two distinct, non-superimposable profiles for the two activity peaks, suggesting that they were separate species. The acceptor activity of these two species was inhibited by about 95% by iodine and CNBr. Both the species showed equal response to codons AAA and AAG and also for poly(A) and poly(A1,Gl) suggesting that the anticodon of these species was UUU. Chemical modification of these two species by iodine did not inhibit the coding response. The two species of lysine of Ps. aeruginosa are truly redundant in that they are indistinguishable either by chemical modification or by their coding response.

The Feeding Practices and Structure Questionnaire (FPSQ-28): A parsimonious version validated for longitudinal use from 2-5 years

Prospective studies and intervention evaluations that examine change over time assume that measurement tools measure the same construct at each occasion. In the area of parent-child feeding practices, longitudinal measurement properties of the questionnaires used are rarely verified. To ascertain that measured change in feeding practices reflects true change rather than change in the assessment, structure, or conceptualisation of the constructs over time, this study examined longitudinal measurement invariance of the Feeding Practices and Structure Questionnaire (FPSQ) subscales (9 constructs; 40 items) across 3 time points. Mothers participating in the NOURISH trial reported their feeding practices when children were aged 2, 3.7, and 5 years (N = 404). Confirmatory Factor Analysis (CFA) within a structural equation modelling framework was used. Comparisons of initial cross-sectional models followed by longitudinal modelling of subscales, resulted in the removal of 12 items, including two redundant or poorly performing subscales. The resulting 28-item FPSQ-28 comprised 7 multi-item subscales: Reward for Behaviour, Reward for Eating, Persuasive Feeding, Overt Restriction, Covert Restriction, Structured Meal Setting and Structured Meal Timing. All subscales showed good fit over 3 time points and each displayed at least partial scalar (thresholds equal) longitudinal measurement invariance. We recommend the use of a separate single item indicator to assess the family meal setting. This is the first study to examine longitudinal measurement invariance in a feeding practices questionnaire. Invariance was established, indicating that the subscales of the shortened FPSQ-28 can be used with mothers to validly assess change in 7 feeding constructs in samples of children aged 2-5 years of age.

Ethics of Justification : A Defence of Contractualism

In What We Owe to Each Other, T.M. Scanlon formulated a new version of the ethical theory called contractualism. This theory took reasons considerations that count in favour of judgment-sensitive attitudes to be the fundamental normative notion. It then used normative reasons to first account for evaluative properties. For an object to be valuable, on this view, is for it to have properties that provide reasons to have favourable attitudes towards the bearer of value. Scanlon also used reasons to account for moral wrongness. His contractualism claims that an act is morally wrong if it is forbidden by any set of moral principles that no one could reasonably reject. My thesis consists of five previously published articles which attempt to clarify Scanlon s theory and to defend it against its critics. The first article defends the idea that normative reason-relations are fundamental against Joshua Gert. Gert argues that rationality is a more basic notion than reasons and that reasons can be analysed in terms of their rationally requiring and justifying dimensions. The second article explores the relationship between value and reasons. It defends Scanlon s view according to which reasons are the more basic than value against those who think that reasons are based on the evaluative realm. The last three articles defend Scanlon s views about moral wrongness. The first one of them discusses a classic objection to contractualist theories. This objection is that principles which no one could reasonably reject are redundant in accounting for wrongness. This is because we need a prior notion of wrongness to select those principles and because such principles are not required to make actions wrong or to provide reasons against wrong actions. The fourth article explores the distinctive reasons which contractualists claim there are for avoiding the wrong actions. The last article argues against the critics of contractualism who claim that contractualism has implausible normative consequences for situations related to the treatment of different-sized groups of people.

Reliability Optimization using SLUMT

This paper is concerned with the reliability optimization of a spatially redundant system, subject to various constraints, by using nonlinear programming. The constrained optimization problem is converted into a sequence of unconstrained optimization problems by using a penalty function. The new problem is then solved by the conjugate gradient method. The advantages of this method are highlighted.

The biological functions of mouse twinfilin isoforms

The actin cytoskeleton is essential for many cellular processes, including motility, morphogenesis, endocytosis and signal transduction. Actin can exist in monomeric (G-actin) or filamentous (F-actin) form. Actin filaments are considered to be the functional form of actin, generating the protrusive forces characteristic for the actin cytoskeleton. The structure and dynamics of the actin filament and monomer pools are regulated by a large number of actin-binding proteins in eukaryotic cells. Twinfilin is an evolutionarily conserved small actin monomer binding protein. Twinfilin is composed of two ADF/cofilin-like domains, separated by a short linker and followed by a C-terminal tail. Twinfilin forms a stable, high affinity complex with ADP-G-actin, inhibits the nucleotide exchange on actin monomers, and prevents their assembly into filament ends. Twinfilin was originally identified from yeast and has since then been found from all organisms studied except plants. Not much was known about the role of twinfilin in the actin dynamics in mammalian cells before this study. We set out to unravel the mysteries still covering twinfilins functions using biochemistry, cell biology, and genetics. We identified and characterized two mouse isoforms for the previously identified mouse twinfilin-1. The new isoforms, twinfilin-2a and -2b, are generated from the same gene through alternative promoter usage. The three isoforms have distinctive expression patterns, but are similar biochemically. Twinfilin-1 is the major isoform during development and is expressed in high levels in almost all tissues examined. Twinfilin-2a is also expressed almost ubiquitously, but at lower levels. Twinfilin-2b turned out to be a muscle-specific isoform, with very high expression in heart and skeletal muscle. It seems all mouse tissues express at least two twinfilin isoforms, indicating that twinfilins are important regulators of actin dynamics in all cell and tissue types. A knockout mouse line was generated for twinfilin-2a. The mice homozygous for this knockout were viable and developed normally, indicating that twinfilin-2a is dispensable for mouse development. However, it is important to note that twinfilin-2a shows similar expression pattern to twinfilin-1, suggesting that these proteins play redundant roles in mice. All mouse isoforms were shown to be able to sequester actin filaments and have higher affinity for ADP-G-actin than ATP-G-actin. They are also able to directly interact with heterodimeric capping protein and PI(4,5)P2 similar to yeast twinfilin. In this study we also uncovered a novel function for mouse twinfilins; capping actin filament barbed ends. All mouse twinfilin isoforms were shown to possess this function, while yeast and Drosophila twinfilin were not able to cap filament barbed ends. Twinfilins localize to the cytoplasm but also to actin-rich regions in mammalian cells. The subcellular localizations of the isoforms are regulated differently, indicating that even though twinfilins biochemical functions in vitro are very similar, in vivo they can play different roles through different regulatory pathways. Together, this study show that twinfilins regulate actin filament assembly both by sequestering actin monomers and by capping filament barbed ends, and that mammals have three biochemically similar twinfilin isoforms with partially overlapping expression patterns.

Mining topical relevant patterns for multi-document summarization

Multi-document summarization addressing the problem of information overload has been widely utilized in the various real-world applications. Most of existing approaches adopt term-based representation for documents which limit the performance of multi-document summarization systems. In this paper, we proposed a novel pattern-based topic model (PBTMSum) for the task of the multi-document summarization. PBTMSum combining pattern mining techniques with LDA topic modelling could generate discriminative and semantic rich representations for topics and documents so that the most representative and non-redundant sentences can be selected to form a succinct and informative summary. Extensive experiments are conducted on the data of document understanding conference (DUC) 2007. The results prove the effectiveness and efficiency of our proposed approach.

A constraint Jacobian based approach for static analysis of pantograph masts

This paper presents a constraint Jacobian matrix based approach to obtain the stiffness matrix of widely used deployable pantograph masts with scissor-like elements (SLE). The stiffness matrix is obtained in symbolic form and the results obtained agree with those obtained with the force and displacement methods available in literature. Additional advantages of this approach are that the mobility of a mast can be evaluated, redundant links and joints in the mast can be identified and practical masts with revolute joints can be analysed. Simulations for a hexagonal mast and an assembly with four hexagonal masts is presented as illustrations.

A Search for Energy Minimized Sequences of Proteins

In this paper, we present numerical evidence that supports the notion of minimization in the sequence space of proteins for a target conformation. We use the conformations of the real proteins in the Protein Data Bank (PDB) and present computationally efficient methods to identify the sequences with minimum energy. We use edge-weighted connectivity graph for ranking the residue sites with reduced amino acid alphabet and then use continuous optimization to obtain the energy-minimizing sequences. Our methods enable the computation of a lower bound as well as a tight upper bound for the energy of a given conformation. We validate our results by using three different inter-residue energy matrices for five proteins from protein data bank (PDB), and by comparing our energy-minimizing sequences with 80 million diverse sequences that are generated based on different considerations in each case. When we submitted some of our chosen energy-minimizing sequences to Basic Local Alignment Search Tool (BLAST), we obtained some sequences from non-redundant protein sequence database that are similar to ours with an E-value of the order of 10(-7). In summary, we conclude that proteins show a trend towards minimizing energy in the sequence space but do not seem to adopt the global energy-minimizing sequence. The reason for this could be either that the existing energy matrices are not able to accurately represent the inter-residue interactions in the context of the protein environment or that Nature does not push the optimization in the sequence space, once it is able to perform the function.

Leveraging Partially Enhanced Scan for Improved Observability in Delay Fault Testing

Enhanced Scan design can significantly improve the fault coverage for two pattern delay tests at the cost of exorbitantly high area overhead. The redundant flip-flops introduced in the scan chains have traditionally only been used to launch the two-pattern delay test inputs, not to capture tests results. This paper presents a new, much lower cost partial Enhanced Scan methodology with both improved controllability and observability. Facilitating observation of some hard to observe internal nodes by capturing their response in the already available and underutilized redundant flip-flops improves delay fault coverage with minimal or almost negligible cost. Experimental results on ISCAS'89 benchmark circuits show significant improvement in TDF fault coverage for this new partial enhance scan methodology.

Disulfide conformation and design at helix N-termini

To understand structural and thermodynamic features of disulfides within an alpha-helix, a non-redundant dataset comprising of 5025 polypeptide chains containing 2311 disulfides was examined. Thirty-five examples were found of intrahelical disulfides involving a CXXC motif between the N-Cap and third helical positions. GLY and PRO were the most common amino acids at positions 1 and 2, respectively. The N-Cap residue for disulfide bonded CXXC motifs had average values of (-112 +/- 25.2 degrees, 106 +/- 25.4 degrees). To further explore conformational requirements for intrahelical disulfides, CYS pairs were introduced at positions N-Cap-3; 1,4; 7,10 in two helices of an Escherichia coli thioredoxin mutant lacking its active site disulfide (nSS Trx). In both helices, disulfides formed spontaneously during purification only at positions N-Cap-3. Mutant stabilities were characterized by chemical denaturation studies (in both oxidized and reduced states) and differential scanning calorimetry (oxidized state only). All oxidized as well as reduced mutants were destabilized relative to nSS Trx. All mutants were redox active, but showed decreased activity relative to wild-type thioredoxin. Such engineered disulfides can be used to probe helix start sites in proteins of unknown structure and to introduce redox activity into proteins. Conversely, a protein with CYS residues at positions N-Cap and 3 of an alpha-helix is likely to have redox activity.

Role and function of nonmuscle alpha-actinin-1 and -4 in regulating distinct subcategories of actin stress fibers in mammalian cells

Actin stress fibers are dynamic structures in the cytoskeleton, which respond to mechanical stimuli and affect cell motility, adhesion and invasion of cancer cells. In nonmuscle cells, stress fibers have been subcategorized to three distinct stress fiber types: dorsal and ventral stress fibers and transverse arcs. These stress fibers are dissimilar in their subcellular localization, connection to substratum as well as in their dynamics and assembly mechanisms. Still uncharacterized is how they differ in their function and molecular composition. Here, I have studied involvement of nonmuscle alpha-actinin-1 and -4 in regulating distinct stress fibers as well as their localization and function in human U2OS osteosarcoma cells. Except for the correlation of upregulation of alpha-actinin-4 in invasive cancer types very little is known about whether these two actinins are redundant or have specific roles. The availability of highly specific alpha-actinin-1 antibody generated in the lab, revealed localization of alpha-actinin-1 along all three categories of stress fibers while alphaactinin-4 was detected at cell edge, distal ends of stress fibers as well as perinuclear regions. Strikingly, by utilizing RNAi-mediated gene silencing of alpha-actinin-1 resulted in specific loss of dorsal stress fibers and relocalization of alpha-actinin-4 to remaining transverse arcs and ventral stress fibers. Unexpectedly, aberrant migration was not detected in cells lacking alpha-actinin-1 even though focal adhesions were significantly smaller and fewer. Whereas, silencing of alpha-actinin-4 noticeably affected overall cell migration. In summary, as part of my master thesis study I have been able to demonstrate distinct localization and functional patterns for both alpha-actinin-1 and -4. I have identified alpha-actinin-1 to be a selective dorsal stress fiber crosslinking protein as well as to be required for focal adhesion maturation, while alpha-actinin-4 was demonstrated to be fundamental for cell migration.