No description available.

The purpose of the studies included in this thesis is to develop an effective an efficient method to study the proteome using separation and detection of peptides, when only a limited amount of sample, 10 micrograms of total protein or less, is available. The analysis will be applied to multiple myeloma cancer cells using ultra high-performance liquid chromatography-mass spectrometry for expression proteomics to illustrate utility. To detect low abundance peptides in a complex proteome, we use different strategies, including basic pH reversed-phase liquid chromatography (bRPLC), mass-to-charge fractionation in the mass spectrometer, and various liquid chromatography gradients to increase peptide separation to improve opportunities for detection and quantification. The different methods are optimized and compared by the number of peptides detected. Step-wise elution of bRP spin columns proved to yield more than 36,000 peptides using only 10 μg of protein. Mass-to-charge (m/z) fractionation was tested in mass analyzer Q-Exactive Plus (Thermo Scientific). Liquid chromatography-tandem mass spectrometry (LC-MS/MS) of an unfractionated sample was analyzed 4 times at different mass ranges, each mass range width of 150 m/z, resulting from 4 spectra combined, 31,732 peptides representing 3,967 proteins. Showingcomparable results to those form high pH reversed phase fractionation spin columns 5 fractions. Establishing a benchmark where the LC-MS/MS analysis of 600 μg of 10plex TMT-labeled peptides fractionated with bRPLC into 24 fractions yielded over 74,000 peptides from 7,700 proteins, we compared those results with analysis of 10 μg of total TMT-labeled peptides fractionated by bRP spin columns into 5 fractions, which produced 14,019 peptides from 3,538 proteins. These experiments were used to relatively quantify protein expression in naïve and drug resistant multiple myeloma cells lines as an example application in cancer research.

We demonstrate how the performance of offset quadrature phase-shift keying (OQPSK) and its variants of Feher-patented QPSK (FQPSK) and Shaped Offset QPSK (SOQPSK) (collectively known as the ARTM Tier-1 waveforms) in single input single output (SISO) system could change with the channel fading parameters. The bit error rate expression of offset QSPK and ATRM Tier-1 waveforms over the aeronautical telemetry multipath channel has been derived. Simulations show that for the case of a single multipath ray, the BER gets worse with increasing Γ for a fixed delay, and that the BER has a quasi-periodic property for fixed Γ and increasing τ. For the case of two multipath rays, the multipath component characterized by large amplitude and small delay is the main factor of the BER degradation, while the BER is not very sensitive to the change of multipath delay. Analysis of the average bit error probability shows that a relatively high error floor at approximately 10−2 occurs for |Γ1| ≥ 0.5. When offset quadrature phase-shift keying (OQPSK) is used in multiple input multiple output (MIMO) environment, orthogonal space-time block codes can be applied to waveforms to orthogonalize a space-time coded multiple-input, multiple output link. For offset QPSK, this technique has the advantage of eliminating the I/Q interference associated with simultaneous transmission of offset QPSK waveforms. In addition, orthogonalization presents uncorrelated noise samples to the space-time trellis decoder. As a consequence, a less complex space-time decoder (relative to what would be required without orthogonalization) can be used. It is demonstrated that a concatenated system based on an orthogonal space-time block code and a trellis code, optimized for single-input, single-output fading channel, outperforms a space-time trellis code for a 2x1 system. The space-time block code orthogonalizes the channel seen by the outer code and this simplifies the computations required for decoding. The advantages of orthogonalization are achieved at the expense of rate. In the examples presented, the codes were chosen to have roughly equivalent bit error rate performance and identical code rates: the complexity was compared.

Modern applications of XML use automata operating on unranked trees. A common definition of tree automata operating on unranked trees uses a set of vertical states that define the bottom-up computation, and the transitions on vertical states are determined by so called horizontal languages recognized by finite automata on strings. The bottom-up computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by DFAs or NFAs. There is also an alternative syntactic definition of determinism introduced by Cristau et al. It is known that a deterministic tree automaton with the smallest total number of states does not need to be unique nor have the smallest possible number of vertical states. We consider the question by how much we can reduce the total number of states by introducing additional vertical states. We give an upper bound for the state trade-off for deterministic tree automata where the horizontal languages are defined by DFAs, and a lower bound construction that, for variable sized alphabets, is close to the upper bound. We establish upper and lower bounds for the state complexity of conversions between different types of deterministic and nondeterministic unranked tree automata. The bounds are, usually, tight for the numbers of vertical states. Because a minimal deterministic unranked tree automaton need not be unique, establishing lower bounds for the number of horizontal states, that is, the combined size of DFAs used to define the horizontal languages, is challenging. Based on existing lower bound results for unambiguous finite automata we develop a lower bound criterion for the number of horizontal states. We consider the state complexity of operations on regular unranked tree languages. The concatenation of trees can be defined either as a sequential or a parallel operation. Furthermore, there are two essentially different ways to iterate sequential concatenation. We establish tight state complexity bounds for concatenation-like operations. In particular, for sequential concatenation and bottom-up iterated concatenation the bounds differ by an order of magnitude from the corresponding state complexity bounds for regular string languages. / Thesis (Ph.D, Computing) -- Queen's University, 2012-01-04 14:48:02.916

<p>How does action turn [into a] substantive and, if it does, how does it turn into action again to perdure or even change?</p><p>In this endeavor I set out to study organizing and organization by asking myself how organizing becomes a product called organization and how that product turns into the very organizing whence it once was spawned. In other words, I set out to study what I denominate the movements between organizing and organization. To that end a play is put in motion in which actors act and make representations which are subsequently interpreted poetically and rhetorically. This in order to create a stage of evidence from which the movements between organizing and organization can be derived.</p><p>The imagination put forth consists of two movements, which I dub instantiation and concatenation. These I relate to the motions embodied by metaphor and metonymy and later conflate them into one and the same movement of organizing in the wor[l]d within which materials through their play against each other are gathered to create more or less stable products. These products may be called organizations.</p><p>In a way, this is an attempt to study the makings of organization by way of a passage into it.</p>

How does action turn [into a] substantive and, if it does, how does it turn into action again to perdure or even change? In this endeavor I set out to study organizing and organization by asking myself how organizing becomes a product called organization and how that product turns into the very organizing whence it once was spawned. In other words, I set out to study what I denominate the movements between organizing and organization. To that end a play is put in motion in which actors act and make representations which are subsequently interpreted poetically and rhetorically. This in order to create a stage of evidence from which the movements between organizing and organization can be derived. The imagination put forth consists of two movements, which I dub instantiation and concatenation. These I relate to the motions embodied by metaphor and metonymy and later conflate them into one and the same movement of organizing in the wor[l]d within which materials through their play against each other are gathered to create more or less stable products. These products may be called organizations. In a way, this is an attempt to study the makings of organization by way of a passage into it.

ITC/USA 2013 Conference Proceedings / The Forty-Ninth Annual International Telemetering Conference and Technical Exhibition / October 21-24, 2013 / Bally's Hotel & Convention Center, Las Vegas, NV / Constrained codes also known as modulation codes are a key component in the digital magnetic recording systems. The constrained codes forbid particular input data patterns which lead to some of the dominant error events or higher media noise. In data recording systems, a concatenated approach toward the constrained code and error-correcting code (ECC) is typically used and the decoding is done independently. In this paper, we show the improvement in combining the decoding of the constrained code and the ECC using generalized belief propagation (GBP) algorithm. We consider the performance of a combined modulation constraints and the ECC on a binary symmetric channel (BSC). We show that combining demodulation and decoding results in a superior performance compared to concatenated schemes. Furthermore, we compute the capacity of the joint ECC and modulation codes for 1-D and 2-D constraints.

Orientador: Jaime Portugheis / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-06T08:08:11Z (GMT). No. of bitstreams: 1 Sharma_Manish_M.pdf: 1001397 bytes, checksum: 04250e6b88e19bb784d3b68313ace258 (MD5) Previous issue date: 2006 / Resumo: Nesta dissertação abordamos o problema de como construir codificadores bit-geometricamente uniformes (BGU) para a utilização como codificadores internos em sistemas com concatenação serial de códigos. A utilização destes codificadores implica na facilidade de determinação de parâmetros necessários para a análise do desempenho dos sistemas. Há um grande controle sobre estes parâmetros no projeto destes codificadores utilizando o método descrito neste trabalho, o que sugere que bons codificadores e conseqüentemente bons sistemas podem ser obtidos desta maneira. Além disso, os códigos gerados por estes codificadores possuem a propriedade de uniformidade de erro de bit, o que facilita bastante sua análise / Abstract: This thesis approaches the problem of building bit-geometrically uniform (BGU) encoders to be used as inner encoders in systems with serially concatenated codes. By using this type of encoders, certain parameters that are used to analyze the system's performance are easily determined. There is a great control over these parameters when building encoders using the method described in this work, suggesting that good encoders and subsequently good systems can be obtained. Besides, the codes generated by these encoders posses the uniform bit error property, that greatly facilitates their analysis / Mestrado / Engenharia de Telecomunicações / Mestre em Engenharia Elétrica

Language equations are equations where both the constants occurring in the equations and the solutions are formal languages. They have first been introduced in formal language theory, but are now also considered in other areas of computer science. In the present paper, we restrict the attention to language equations with one-sided concatenation, but in contrast to previous work on these equations, we allow not just union but all Boolean operations to be used when formulating them. In addition, we are not just interested in deciding solvability of such equations, but also in deciding other properties of the set of solutions, like its cardinality (finite, infinite, uncountable) and whether it contains least/greatest solutions. We show that all these decision problems are ExpTime-complete. / This report has also appeared as TUCS Technical Report, Turku Centre for Computer Science, University of Turku, Finland.

Since the analysis of dynamics of intervals of short cardiovascular signals reflects important vital processes, involving complex interactions of the regulatory processes (Batzel, Bachar, 2010), mathematical formalism is one of the ways to research the complexity of biological systems (Davis et al., 2010). Concerning the interaction of various physiological systems / parameters that point out the causes of fatigue, the theory of non-linear dynamical systems enables to reveal this phenomenon as a part of dynamic system’s processes. Cardiovascular functional values are integral indicators, i.e. the values of the recorded parameters are affected by numerous factors or at least some of them. The question to which we tried to find the answer performing the following analysis of the data could be worded as follows. Apparently, the evaluation of the dynamic concatenation among these cardiovascular parameters, when the functional state of the subject changes, can reveal an increase or decrease in the significance of the selected structural component during the developing and incremental fatigue. The aim of the study was to find out the peculiarities in concatenation between central and peripheral cardiovascular indices under the conditions of increasing fatigue. Objectives: 1. To compare the peculiarities of dynamics in cardiovascular functional and functional state indices while performing increamental exercise up to inability by applying the provocative or increasing workload... [to full text] / Nauji tyrimų rezultatų analizės metodai, nauja tyrimų metodologija išplečia fiziologų galimybes pažinti naujas, ligi šiol neatskleistas organizmo funkcijų ypatybes, panaudoti jas funkcinei būklei vertinti, valdant fizinio ir kitokio poveikio trukmę, stiprumą, ieškant optimalaus poveikio ir adaptacijos efekto. Kompleksiškumo ypatybėms vertinti Lietuvos mokslininkai pasiūlė dinaminių sąsajų vertinimo metodiką, taikant algebrinį duomenų kointegracijos metodą (Navickas ir kt., 2005; Navickas, Bikulčienė, 2008; Vainoras et al., 2008; Bikulčienė et al., 2009; Poderys et al., 2010). Darbo tikslas – nustatyti aktyvių raumenų kraujotakos ir kitų ŠKS funkcinių rodiklių dinaminių sąsajų ypatybes atliekant didėjantį fizinį krūvį iki negalėjimo. Uždaviniai: 1. Palyginti ŠKS funkcinių ir funkcinės būklės rodiklių kaitos ypatybes atliekant pakopomis didėjantį fizinį krūvį iki negalėjimo, taikant provokacinio ir darbinio fizinio krūvio didinimo protokolus. 2. Nustatyti reikšmingų širdies ir kraujagyslių sistemos funkcinių rodiklių dinaminių sąsajų ypatybes veloergometru atliekant pakopomis didėjantį fizinį krūvį iki negalėjimo. 3. Nustatyti adaptacijos greitumo, arba ištvermės fiziniams krūviams, įtaką širdies ir kraujagyslių sistemos funkcinių rodiklių dinaminių sąsajų kaitai atliekant pakopomis didėjantį fizinį krūvį iki negalėjimo. 4. Nustatyti, ar galima algebriniu duomenų kointegracijos metodu gauti fiziologijai reikšmingą informaciją, vertinant dinamines sąsajas tarp rodiklių, kai... [toliau žr. visą tekstą]