To see the other types of publications on this topic, follow the link: Weighted sequences.
Dissertations / Theses on the topic 'Weighted sequences'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Weighted sequences.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Christodoulakis, Emmanouil. "Regularities on fixed and weighted sequences." Thesis, King's College London (University of London), 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.420363.
Full text
2
Biaggi, Andrea. "Combining the normal hedge algorithm with weighted trees for predicting binary sequences." Diss., [La Jolla] : University of California, San Diego, 2010. http://wwwlib.umi.com/cr/ucsd/fullcit?p1474775.
Full textAbstract:
Thesis (M.S.)--University of California, San Diego, 2010.Title from first page of PDF file (viewed April 14, 2010). Available via ProQuest Digital Dissertations. Includes bibliographical references (p. 30).
3
Furuta, Akihiro. "Comparison of monopolar and bipolar diffusion weighted imaging sequences for detection of small hepatic metastases." Kyoto University, 2015. http://hdl.handle.net/2433/195942.
Full text
4
Wu, Changshun. "Séquences de synchronisation pour les réseaux de Petri synchronisés non bornés." Thesis, Aix-Marseille, 2018. http://www.theses.fr/2018AIXM0717.
Full textAbstract:
L'un des problèmes fondamentaux de test pour les systèmes à événements discrets (SEDs) est l'identification d'un état final, c'est-à-dire, étant donné un système dont l'état courant est inconnu, trouver une séquence d'événements d'entrée pouvant le conduire à un état connu. Les séquences de synchronisation (SS), sans information de sortie, sont une solution classique à ce problème. Dans cette thèse, nous étudions la détermination des SS pour des systèmes modélisés par des réseaux de Petri synchronisés (SynPN) non bornés, une classe de réseaux de Petri avec des entrées. Dans la première partie de cette thèse, nous développons deux méthodes: 1) construction d'une représentation finie, appelée improved modified coverability graph (IMCG), pour d'écrire exactement l'espace d'états infini d'un 1-place-unbounded SynPN; 2) conversion d'un 1-place-unbounded SynPN en un automate pondéré (WA) fini et sauf équivalent. Les deux graphes sont ainsi potentiellement des outils puissants pour déterminer les SS pour une telle sous-classe de réseaux de Petri. Dans la seconde partie de cette thèse, nous développons des algorithmes de calcul pour deux problèmes de synchronisation de localisation dans le cas où l'IMCG ou le WA sont déterministes : synchronisation sur un seul nœud et synchronisation sur un sous-ensemble de nœuds de ces deux graphes. L'avantage de ces algorithmes de calcul est de réduire le calcul sur les graphes globaux (IMCG ou WA) à celui du plus petit sous-graphe: la composante fortement connectée ergodique peut réduire l'effort de calcul mais peut également être appliquée lorsque le IMCG ou le WA équivalent déterministes ne sont pas fortement connexesOne of the fundamental testing problems for discrete event systems (DESs) is the identification of a final state, i.e., given a system whose current state is unknown, find an input sequence that can drive it to a known state. Synchronizing sequences (SSs), without output information, are one conventional solution to this problem. In this thesis, we address the computation of SSs for systems modeled by unbounded synchronized Petri nets (SynPNs), a class of Petri nets with inputs. In the first part of this thesis, we utilize two methods: 1) construct a finite representation, called improved modified coverability graph (IMCG), to exactly describe the infinite state space of a 1-place-unbounded SynPN; 2) convert a 1-place-unbounded SynPN into an equivalent finite location weighted automaton (WA) with safety conditions. Both graphs are thus, potentially, useful tools to compute SSs for such subclass of nets. In the second part of this thesis, we develop computation algorithms for two location synchronization problems in the case either the IMCG or the WA is deterministic: synchronization into a single node and synchronization into a subset of nodes of these two graphs. The advantage of these computation algorithms consists in reducing the computation on the global graphs (IMCGs or WAs) to the one on the smaller subgraph: the ergodic strongly connected component (SCC), which can reduce the computational effort and furthermore can also be applied when the converted deterministic IMCG or WA is not strongly connected
5
Temirkhanova, Ainur. "Estimates for Discrete Hardy-type Operators in Weighted Sequence Spaces." Doctoral thesis, Luleå tekniska universitet, Matematiska vetenskaper, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-18222.
Full textAbstract:
This PhD thesis consists of an introduction and eight papers, which deal with questions of the validity of some new discrete Hardy type inequalities in weighted spaces of sequences and on the cone of non-negative monotone sequences, and their applications. In the introduction we give an overview of the area that serves as a frame for the rest of the thesis. In particular, a short description of the development of Hardy type inequalities is given. In Paper 1 we find necessary and sufficient conditions on weighted sequences $\omega_i$, $i=1, 2,...,n-1$, $u$ and $v$, for which the operator $$ (S_{n}f)_i=\sum\limits_{k_1=1}^i\omega_{1,k_1}\cdots\sum\limits_{k_{n-1}=1}^{k_{n-2}} \omega_{n-1,k_{n-1}}\sum\limits_{j=1}^{k_{n-1}}f_j,~~ i\geq 1,~~~~~(1) $$ is bounded from $l_{p,v}$ to $l_{q,u}$ for $1<p\leq q<\infty$. In Paper 2 we prove a new discrete Hardy-type inequality $$ \|Af\|_{q,u}\leq C\|f\|_{p,v},~~~~1<p\leq q<\infty,~~~~~~~~~~~(2) $$ where the matrix operator $A$ is defined by $\left(Af\right)_i:=\sum\limits_{j=1}^ia_{i,j}f_j,$ ~$a_{i, j}\geq 0$, where the entries $a_{i, j}$ satisfy less restrictive additional conditions than studied before. Moreover, we study the problem of compactness for the operator $A$, and also the dual result is stated, proved and discussed. In Paper 3 we derive the necessary and sufficient conditions for inequality (2) to hold for the case $1<q<p<\infty$. In Papers 4 and 5 we obtain criteria for the validity of the inequality (2) for slightly more general classes of matrix operators $A$ defined by $\left(Af\right)_j:=\sum\limits_{i=j}^\infty a_{i,j}f_i,$ ~$a_{i, j}\geq 0$, when $1<p, q<\infty$. Moreover, we study the problem of compactness for the operator $A$ for the case $1<p\leq q<\infty$, also the dual result is established and here we also give some applications of the main results. In Paper 6 we state boundedness for the operator of multiple summation with weights (1) in weighted sequence spaces for the case $1<q<p<\infty$. Paper 7 deals with new Hardy-type inequalities restricted to the cones of monotone sequences. The case $1<q<p<\infty$ is considered. Also some applications related to H\"{o}lder's summation method are pointed out. In Paper 8 we obtain necessary and sufficient conditions for which three-weighted Hardy type inequalities hold.Godkänd; 2015; 20151021 (aintem); Nedanstående person kommer att disputera för avläggande av teknologie doktorsexamen. Namn: Ainur Temirkhanova Ämne: Matematik/Mathematics Avhandling: Estimates for Discrete Hardy-type Operators in Weighted Sequence Spaces Opponent: Professor Mikhail Goldman, Dept of Nonlinear Analysis and Optimization, Peoples’Friendship University of Russia, Moscow, Russia. Ordförande: Professor Peter Wall, Avd för matematiska vetenskaper, Institutionen för teknikvetenskap och matematik, Luleå tekniska universitet, Luleå. Tid: Tisdag 8 december kl 10.00 Plats: E246, Luleå tekniska universitet
6
Faulkner, Sean (Sean Anthony) Carleton University Dissertation Engineering Electrical. "Determination of maximal-length sequences by weight distribution analysis." Ottawa, 1989.
Find full text
7
Denev, Alexander. "Digital Distance Functions Defined by Sequence of Weights." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-162025.
Full textAbstract:
In this paper, digital distance functions using sequences of weights are studied and used to approximate the Euclidian distance. Sequences of weights that guarantee a low maximum absolute error for path lengths of up to 10000 are calculated. A necessary condition and a sufficient condition for metricity of this kind of distance function are established.
8
Bodily, Paul Mark. "Inverted Sequence Identification in Diploid Genomic Scaffold Assembly via Weighted MAX-CUT Reduction." BYU ScholarsArchive, 2013. https://scholarsarchive.byu.edu/etd/3793.
Full textAbstract:
Virtually all genome assemblers to date are designed for use with data from haploid or homozygous diploid genomes. Their use on heterozygous genomic datasets generally results in highly-fragmented, error-prone assemblies, owing to the violation of assumptions during both the contigging and scaffolding phases. Of the two phases, scaffolding is more particularly impacted and algorithms to facilitate the scaffolding of heterozygous data are lacking. We present a stand-alone scaffolding algorithm, ScaffoldScaffolder, designed specifically for scaffolding diploid genomes. A fundamental step in the scaffolding phase is the assignment of sequence orientations to contigs within scaffolds. Deciding such an assignment in the presence of ambiguous evidence is what is termed the contig orientation problem. We define this problem using bidirected graph theory and show that it is equivalent to the weighted MAX-CUT problem. We present a greedy heuristic solution which we comparatively assess with other solutions to the contig orientation problem, including an advanced MAX-CUT heuristic. We illustrate how a solution to this problem provides a simple means of simultaneously identifying inverted haplotypes, which are uniquely found in diploid genomes and which have been shown to be involved in the genetic mechanisms of several diseases. Ultimately our findings show that due to the inherent biases in the underlying biological model, a greedy heuristic algorithm performs very well in practice, retaining a higher total percent of edge weight than a branch-and-bound semidefinite programming heuristic. This application exemplifies how existing graph theory algorithms can be applied in the development of new algorithms for more accurate assembly of heterozygous diploid genomes.
9
黃耀進 and Yuejin Huang. "A multiple access interference rejection technique using weighted despreading functions for direct-sequence code division multipleaccess communications." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31237071.
Full text
10
Huang, Yuejin. "A multiple access interference rejection technique using weighted despreading functions for direct-sequence code division multiple access communications /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19627543.
Full text
11
Carter, Scott Edward. "Development and saw device implementation of a new weighted stepped chirp code signal for direct sequence spread spectrum communications systems." Doctoral diss., University of Central Florida, 1998. http://digital.library.ucf.edu/cdm/ref/collection/RTD/id/15108.
Full textAbstract:
University of Central Florida College of Engineering ThesisThis work introduces the new weighted stepped chirp code signal for direct dequence spread spectrum (DS/SS) communications systems. This code signal uses the truncated cosine series functions as the chip functions. This code signal is the result of discretizing a continuous wave (CW) chirp which results in enhanced performance versus a pseudonoise (PN) cose and equivalent performance and easier implementation than a CW chirp. This code signal will be shown to possess improved compression ratio (CR), peak sidelobe level (PSL), integrated sidelobe level (ISL), and bit error rate (BER) when compared to a PN code of identical code length and chip length. It also will be shown to have a similar CR, PSL, ISL, and loss in processing gain (LPG) when compared to a CW chirp with identical pulse length and frequency deviation. The code signal is implemented on surface acoustic wave (SAW) devices which can be used as the code signal generator at the transmitter and the correlator at the receiver in a DS/SS communication system. SAW design considerations for the weighted stepped chirp signal are discussed. Experimental data is presented and compared to the predicted CR, PSL, ISL, LPG, and BER.
Ph.D.;
Electrical and Computer Engineering
Engineering;
Engineering;
105 p.
xiv, 105 leaves, bound : ill. ; 28 cm.
12
Fujimoto, Koji. "BLADE acquisition method improves T2-weighted MR images of the female pelvis compared with a standard fast spin-echo sequence." Kyoto University, 2010. http://hdl.handle.net/2433/131918.
Full text
13
Kokkonen, S. M. (Salla-Maarit). "MRI of intracranial tumours in adults:oedema-attenuated inversion recovery MR sequence in low-field MRI, diffusion-weighted MRI and BOLD fMRI." Doctoral thesis, University of Oulu, 2009. http://urn.fi/urn:isbn:9789514292316.
Full textAbstract:
Abstract
The goal of this study was to explore preoperative evaluation of patients with intracranial tumours using magnetic resonance imaging (MRI) methods: oedema-attenuated inversion recovery (EDAIR) sequence in low-field MRI, and diffusion-weighted imaging (DWI) and resting-state functional MRI (fMRI) in high-field MRI. The aim was also to increase our knowledge about the effects of brain surgery on eloquent brain cortices using new MRI techniques. The total number of patients in these studies was 50 (24 women).
Enhancement of the tumour in ten patients after intravenous administration of gadolinium-based contrast agent in low-field MRI was examined with a new sequence, EDAIR, and compared with more conventionally used partial saturation spin echo sequences. EDAIR may facilitate the perception of small enhancing lesions and is valuable in low-field imaging, where T1-based contrast is inferior to high-field imaging.
DWI was performed on 25 patients in order to evaluate the potential of this imaging method to assist in differential diagnosis of intracranial tumours. It was shown that apparent diffusion coefficient values of the tumour and peritumoural oedema produced by DWI were different in benign and malignant tumours.
Resting-state blood oxygen level-dependent (BOLD) fMRI was performed on eight patients and ten healthy volunteers to examine if functional sensorimotor areas in the brain could be determined without any task-related activations. It was shown that intracranial tumours do not appear to hamper visualization of the sensorimotor area in resting-state BOLD fMRI when independent component analysis is performed, and this method may be used in preoperative imaging when activation studies cannot be performed.
Conventional BOLD fMRI with motor and auditory stimuli was used with seven patients as the effect of brain surgery was studied. The results suggest that resection of a tumour with preoperative oedema probably decreases pressure on the brain and makes the functional cortex transiently more easily detectable in BOLD fMRI.
In conclusion, the MRI imaging methods used in this study can give valuable additional information about the tumour, specifically for preoperative imaging and planning for surgery.
14
Ozakin, Cigdem. "On The Expected Value Of The Linear Complexity Of Periodic Sequences." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605541/index.pdf.
Full textAbstract:
In cryptography, periodic sequences with terms in F2 are used almost everywhere. These sequences should have large linear complexity to be cryptographically strong. In fact, the linear complexity of a sequence should be close to its period. In this thesis, we study the expected value for N-periodic sequences with terms in the finite field Fq. This study is entirely devoted to W. Meidl and Harald Niederreiter&rsquos paper which is &ldquo
On the Expected Value of the Linear Complexity and the k-Error Linear Complexity of Periodic Sequences&rdquo
We only expand this paper, there is no improvement. In this paper there are important theorems and results about the expected value of linear complexity of periodic sequences.
15
Darwiche, Ahmad. "De nouveaux théorèmes limites sur les extrêmes et les systèmes dynamiques." Thesis, Littoral, 2020. http://www.theses.fr/2020DUNK0572.
Full textAbstract:
Dans cette thèse, nous établissons quelques théorèmes limites en théorie des valeurs extrêmes et en systèmes dynamiques. La thèse est composée de deux parties. Dans la première partie, nous nous intéressons au comportement du maximum d’une suite qui ne satisfait pas les hypothèses classiques de la théorie des valeurs extrêmes. La suite que nous considérons est générée par une marche aléatoire en milieu aléatoire. Nous établissons un résultat de convergence sur le processus ponctuel des excédents associé à la suite et calculons l’indice extrémal. Des propriétés de mélange de la suite sont également discutées.Dans la deuxième partie, nous étudions la convergence presque sûre de différents types de moyennes ergodiques avec poids (aléatoires et/ou déterministes), en développant une nouvelle technique pour donner des vitesses de convergence. Cette technique est basée sur des travaux de Móricz concernant l’étude de sommes de variables aléatoires. Elle nous permet d’établir des résultats sur la vitesse de convergence dans la loi forte des grandes nombres. Nous déduisons ensuite des propriétés de convergence ponctuelle de la transformée de Hilbert unilatérale pondéréeIn this PhD thesis, we establish some limit theorems in Extreme Value Theory and on dynamical systems. This thesis is divided into two parts. The first one deals with extremes of a sequence which does not satisfy the classical properties appearing in Extreme Value Theory. The sequence is generated by a random walk in random scenery. We establish a limit theorem on the point process of exceedances and we make explicit the extremal index. Some mixing properties are also discussed. The second part of this thesis deals with almost sure convergence of various ergodic averages with weights (the weights can be random or deterministic) and is based on new techniques to provide rates of convergence. Our techniques are based on a work due to Móricz dealing with sums of random variables. The same technique allows us to establish results on the rates of convergence for the strong law of large numbers. Then we state several properties for the point convergence of weighted unilateral Hilbert transform
16
Ohno, Tsuyoshi. "Usefulness of breath-hold inversion recovery-prepared T1-weighted two-dimensional gradient echo sequence for detection of hepatocellular carcinoma in Gd-EOB-DTPA-enhanced MR imaging." Kyoto University, 2017. http://hdl.handle.net/2433/218009.
Full text
17
Kuo, Alice Yi-Wen. "Genomic and Physiological Differences for Ghrelin and Leptin Receptor in Lines of Chickens Selected for High and Low Body Weight." Diss., Virginia Tech, 2003. http://hdl.handle.net/10919/30045.
Full textAbstract:
Autonomic nervous system (ANS) activity is related to body weight regulation. Based on the hypothesis that Most Obesities kNown Are Low In Sympathetic Activity (MONA LISA), it has been suggested that most obese subjects and animals have low sympathetic nervous system activity. Leptin, leptin receptor, and ghrelin genes influence the ANS regulation of body weight and food intake. The aim of this study was to investigate whether there are differences in leptin, the leptin receptor, or ghrelin regulation between lines of chickens selected for high (HWS) or low body weight (LWS).
Intraperitoneal injections of reserpine were administrated to chickens from the HWS and LWS lines. Body weight and food intake were then compared to evaluate ANS regulation. While reserpine caused a transitory decrease in food intake and body weight in both lines, the magnitude of the change was greater in the HWS than in the LWS chickens. However, chickens from the LWS line exhibited greater catecholamine and indoleamine level changes in response to reserpine than those from the HWS line. Therefore, HWS chickens were more sensitive to the body weight-reducing effects of reserpine than LWS lines, while LWS chickens appeared to have greater sympathetic nervous system activity.
Food and water intakes were differentially affected in HWS and LWS chickens in response to intracerebroventricular administration of human recombinant leptin. Leptin caused a linear decrease in food intake in the LWS line, but no effect on food intake in the HWS lines. The HWS chickens tended to have reduced water intake following leptin administration. These results suggest that the leptin receptor, or the down-stream neuropeptide regulation pathway mediating the effect of leptin; may be different between chickens from the HWS and LWS lines.
Leptin, insulin like growth factor (IGF)-1, and IGF-2 concentrations in the plasma of HWS and LWS lines of chickens were evaluated. Leptin, IGF-1 and IGF-2 levels were significantly higher in the LWS than HWS chickens. The HWS female leptin concentrations were significantly lower than in HWS males or LWS females. Male chickens had greater IGF-1 concentrations in the plasma than female chickens. However, the concentration of IGF-2 did not differ between sexes. The difference in leptin concentrations in these lines and sexes may explain the differences in age of sexual maturity. Different IGF-1 and IGF-2 concentrations may be involved in the obese and anorexic conditions, fast and slow growth, and high and low food consumption found in these two lines of chickens.
Differences in the gene sequence of the leptin receptor were observed in HWS and LWS lines of chickens. A single nucleotide polymorphism (SNP) in the intron between exon 8 and 9 introduced a restriction site for the enzyme Sel I in the HWS, but not the LWS line. Two SNP were detected in the leptin receptor cDNA region at nucleotides 189 and 234. At nucleotide 189, the LWS line has both a homozygous (T-T) and heterozygous (C-T), whereas the HWS line has only homozygous (T-T) form. The SNP found in nucleotide 234 introduces a restriction site Mse I in the HWS, but not the LWS line. These specific changes may be directly involved or closely linked to differences between the two lines in either the coding or regulatory domains of the leptin receptor.
Differences in the leptin receptor gene expression between HWS and LWS lines of chickens in various organs and ages were observed. Leptin receptor expression in the whole brain was significantly different between sexes at 28 days-of-age in the HWS and LWS lines. The LWS line had higher leptin receptor gene expression in the liver at 2 days-of-age than at 56 and 363 days-of-age, but no differences were observed in the HWS line. In addition, at 2 days-of age, liver leptin receptor gene expression was higher in LWS than HWS chickens, but the reverse was observed at 363 days-of age. In adipose tissue, leptin receptor expression was higher in the LWS than HWS line. Leptin receptor expression in adipose tissue was greater at 363, than 28 and 56 days-of-ages. Our results showed that changes in the regulation of leptin and the leptin receptor were associated with sex, age, and growth.
Differences in the ghrelin gene in the HWS and LWS lines under different feeding conditions were investigated. Both HWS and LWS chickens have six extra base pairs in the 5'-untranslated region. The LWS male ghrelin gene expression was significantly lower than in the LWS female and HWS male. The 84 day-old males had lower gene expression than 84 day-old females and 363 day-old males. When comparing different feeding methods, females allowed ad libitum feed consumption had a lower cycle threshold cycle number (CT) ratio than males allowed ad libitum feeding or fasted females. However, the inflection point cycle number of ad libitum fed females was lower than that of the ad libitum fed males, but greater than the fasted females. Ghrelin gene expression was different between the two lines of chickens, and the expression of ghrelin in chickens was influenced by body weight selection, sex, age, and feeding condition.Ph. D.
18
Anemyr, Mattias. "Optimization of Production Scheduling at IKEA Industry Hultsfred." Thesis, Linköpings universitet, Kommunikations- och transportsystem, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-167145.
Full textAbstract:
IKEA Industry has factories in several locations where one location is in Hultsfred, Småland. IKEA Industry Hultsfred produces IKEA:s wardrobe collection PAX. In 2018, 2.8 million wardrobes were manufactured in Hultsfred. This thesis covers the subject of constructing and developing an optimization model which has the same characteristics as the plinth production at IKEA Industry Hultsfred. This means that the optimization model must consider production sequence; the setup time is different depending on which products that have been produced in the machine earlier. The thesis also covers to investigate how much time that is necessary to produce the plinths to Hultsfred, Portugal, and Germany under different circumstances. This thesis also balances inventory levels and setup time. I.e., how the inventory levels are changed if more emphasis is put into minimizing setup time, and the other way around. The results show that lower inventory levels and setup times are achievable over seven days if the production planning technique is changed.
19
Skoneczka, Jeffrey Allen. "Investigation of Putative Genetic Factors Associated with Soybean [Glycine Max (L.) Merr.] Seed Quality Traits." Diss., Virginia Tech, 2009. http://hdl.handle.net/10919/40338.
Full textAbstract:
Soybeans are an economically important plant, with an annual crop value that consistently exceeds 20 billion dollars in the United States alone. A recent increase in demand for soybeans, stemming from its diverse applications in products such as animal feed, oil, and biofuel, has created an emphasis for soybean breeders in value added cultivars. These cultivars, have improved, or altered, agronomic or seed composition traits, allowing them to be efficiently utilized in a specific niche of the processing industry. Facilitating the development of such cultivars requires a thorough understanding of the genetic factors that affect the manifestation of value added traits. Value added traits investigated in this study include seed sucrose, raffinose, stachyose, and phytate content, seed weight, and maturity.
The objective of the first part of this project was to characterize the source of low seed stachyose in soybean line PI200508. Two F2 populations, developed from PI200508 and soybean introductions which exhibited higher seed stachyose content were utilized in a QTL analysis approach that incorporated the use of the Williams82 whole genome shotgun (WGS) sequence (http://www.phytozome.org) in a candidate gene mapping approach. A predicted soybean galactosyltransferase gene was established as a candidate gene due to its observed segregation with the single low stachyose QTL observed on molecular linkage group (MLG) C2 in both populations. Sequencing of this putative gene revealed a unique 3 bp deletion in PI200508. A marker developed to exploit this deletion accounted for 88% and 94% of the phenotypic variance for seed stachyose content in the two experimental populations, highlighting its potential for use in marker assisted selection of the PI200508 source of low raffinose and stachyose.
The second part of this project involved QTL analysis of seed sucrose, raffinose, stachyose, and phytate content, as well as seed weight in a linkage map for a F8 RIL population developed from the Glycine max line V71-370 and the Glycine soja introduction PI40712. Analysis across all 20 soybean MLG identified 25 QTL for these traits on MLG A1, A2, C2, D1b, D2, F, G, H, I, L, M, O. Nine of these QTL were supported across multiple environments, indicating that they, and their associated markers, could be useful to breeders working with these traits.
The third part of this project used the same F8 RIL linkage map to investigate time to maturity (Reproductive stage R8). V71-370 and PI407162 differ in time to maturity when grown in Virginia, and the RILs developed from this cross displayed a wide range in maturity. Two major QTL were identified on MLG H and L. Examination of the Williams82 WGS sequence in these QTL regions revealed two predicted genes with homology to Arabidopsis thaliana light response and photoperiodism genes which were investigated as candidate soybean maturity genes. Markers developed from these predicted genes showed close association with the observed QTL, and could facilitate the further investigation of this complex trait.Ph. D.
20
Zýková, Petra. "Scoring rules -- pokročilé hlasovací systémy s pořadím kandidátů." Master's thesis, Vysoká škola ekonomická v Praze, 2017. http://www.nusl.cz/ntk/nusl-359345.
Full textAbstract:
This thesis deals with ranked advanced voting systems. The aim is to determine the overall winner and the ranking of candidates based on voters' preferences. The thesis utilises basic voting systems - plurality rules, lexicographical and Borda's method - as well as advanced voting systems with the application of DEA models, specifically DEA/AR model, DEA/AR exclusion model (including variations with penalties), and Llamazares-Peňa model. Compromise programming is used to obtain common vector of weights. The models and their use are demonstrated on Formula One Grand Prix results from season 2016. Formula One World Drivers' Championship and Formula One World Constructors' Championship are being investigated.
21
Morozov, Vyacheslav. "Computational Methods for Inferring Transcription Factor Binding Sites." Thèse, Université d'Ottawa / University of Ottawa, 2012. http://hdl.handle.net/10393/23382.
Full textAbstract:
Position weight matrices (PWMs) have become a tool of choice for the identification of transcription factor binding sites in DNA sequences. PWMs are compiled from experimentally verified and aligned binding sequences. PWMs are then used to computationally discover novel putative binding sites for a given protein. DNA-binding proteins often show degeneracy in their binding requirement, the overall binding specificity of many proteins is unknown and remains an active area of research. Although PWMs are more reliable predictors than consensus string matching, they generally result in a high number of false positive hits. A previous study introduced a novel method to PWM training based on the known motifs to sample additional putative binding sites from a proximal promoter area. The core idea was further developed, implemented and tested in this thesis with a large scale application. Improved mono- and dinucleotide PWMs were computed for Drosophila melanogaster. The Matthews correlation coefficient was used as an optimization criterion in the PWM refinement algorithm. New PWMs keep an account of non-uniform background nucleotide distributions on the promoters and consider a larger number of new binding sites during the refinement steps. The optimization included the PWM motif length, the position on the promoter, the threshold value and the binding site location. The obtained predictions were compared for mono- and dinucleotide PWM versions with initial matrices and with conventional tools. The optimized PWMs predicted new binding sites with better accuracy than conventional PWMs.
22
Derakhshan, Jamal Jon. "Innovations Involving Balanced Steady State Free Precession MRI." Cleveland, Ohio : Case Western Reserve University, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=case1247256364.
Full textAbstract:
Thesis (Ph.D.)--Case Western Reserve University, 2009Title from PDF (viewed on 19 August 2009) Department of Biomedical Engineering Includes abstract Includes bibliographical references Available online via the OhioLINK ETD Center
23
Zhong, Shan. "Measurement calibration/tuning & topology processing in power system state estimation." Texas A&M University, 2003. http://hdl.handle.net/1969.1/1595.
Full textAbstract:
State estimation plays an important role in modern power systems. The errors in the telemetered measurements and the connectivity information of the network will greatly contaminate the estimated system state. This dissertation provides solutions to suppress the influences of these errors.
A two-stage state estimation algorithm has been utilized in topology error identification in the past decade. Chapter II discusses the implementation of this algorithm. A concise substation model is defined for this purpose. A friendly user interface that incorporates the two-stage algorithm into the conventional state estimator is developed.
The performances of the two-stage state estimation algorithms rely on accurate determination of suspect substations. A comprehensive identification procedure is described in chapter III. In order to evaluate the proposed procedure, a topology error library is created. Several identification methods are comparatively tested using this library.
A remote measurement calibration method is presented in chapter IV. The un-calibrated quantities can be related to the true values by the characteristic functions. The conventional state estimation algorithm is modified to include the parameters of these functions. Hence they can be estimated along with the system state variables and used to calibrate the measurements. The measurements taken at different time instants are utilized to minimize the influence of the random errors.
A method for auto tuning of measurement weights in state estimation is described in chapter V. Two alternative ways to estimate the measurement random error variances are discussed. They are both tested on simulation data generated based on IEEE systems. Their performances are compared. A comprehensive solution, which contains an initialization process and a recursively updating process, is presented.
Chapter VI investigates the errors introduced in the positive sequence state estimation due to the usual assumptions of having fully balanced bus loads/generations and continuously transposed transmission lines. Several tests are conducted using different assumptions regarding the availability of single and multi-phase measurements. It is demonstrated that incomplete metering of three-phase system quantities may lead to significant errors in the positive sequence state estimates for certain cases. A novel sequence domain three-phase state estimation algorithm is proposed to solve this problem.
24
Prado, Fabiano Oliveira. "Peso de Drude em anéis unidimensionais com potenciais de substituição e atravessados por fluxo magnético." Universidade Federal de São Carlos, 2002. https://repositorio.ufscar.br/handle/ufscar/5005.
Full textAbstract:
Made available in DSpace on 2016-06-02T20:16:43Z (GMT). No. of bitstreams: 1
1994.pdf: 1761798 bytes, checksum: 183ce1c471cf1079a1302b309c923a68 (MD5)
Previous issue date: 2002-04-11Financiadora de Estudos e Projetos
In the present work the Drude weight is calculated to study the capacity of conduction at finite temperatures in one-dimensional rings with the potencial given by the sequences of different degrees of randomness and threaded by a time independent magnetic flux. In this context, the tight-binding approximation is used to solve the Schrödinger equation,also permitting the potencials, given by substitution sequences, to be implemented in a simple way. We study four situations in which the potencial is given by periodic and random sequence. The transport properties exhibited by the system in each case are to reflect the degree of randomness presented by these potencials, although in a nontrivial manner if one considers a hierarchy of disorder based on the Fourier transform of the sequences. The role played by temperature in the capacity of conduction, as compared with the role played by the potencials, is also described.
No presente trabalho, através do cálculo do peso de Drude estudamos a capacidade de condução a temperaturas finitas, em anéis unidimensionais com potenciais dados por seqüências de diferentes graus de desordem e atravessados por fluxo magnético independente do tempo. Neste contexto, utilizamos o modelo tight-binding na resolução da equação de Schrödinger, o que permite inserir os potenciais, dados por seqüências de substituição, de maneira simples. Estudamos quatro casos em que esse potencial seja dado por seqüências não periódicas. Os resultados são comparados com os dois casos limites de organização, a saber, as seqüências periódica e desordenada. Observa-se que o grau de desordem apresentado por estes potenciais reflete-se nas propriedades de transporte exibidas pelo sistema em cada caso, embora de maneira não trivial se considerada uma hierarquia de desordem baseada na transformada de Fourier das seqüências. Descreve-se também a influência da temperatura, frente à influência dos potenciais, na capacidade de condução.
25
Duvic, Bernard. "Purification et etude de la proteine de transport de la 20-hydroxyecdysone chez un insecte : locusta migratoria." Université Louis Pasteur (Strasbourg) (1971-2008), 1988. http://www.theses.fr/1988STR13160.
Full textAbstract:
La purification du transporteur est realisee a partir d'hemolymphe par differentes techniques (coagulation a temperature ambiante; chromatographie sur colonne echangeuse d'anions; chromatographie sur colonne de gel permeation; hplc sur phase echangeuse d'anions). Le transporteur est une glycoproteine acide (pi=5,6) de 280 kda. C'est un homodimere a 2 sous-unites de 140 kda dont la sequence n-terminale a ete determinee. Un polyserum de lapin et 2 anticorps monoclonaux de souris ont ete obtenus et permettent un dosage elisa du transporteur. Des dosages chez l. M. Montrent que le transporteur et l'ecdysone varient dans le meme sens. L'injection massive d'ecdysone suggere une synthese du transporteur sous le controle des ecdysteroides
26
Schultz, Patrick. "Etudes structurales du minichromosome du virus sv40 et de la chromatine cellulaire : approches en microscopie electronique." Université Louis Pasteur (Strasbourg) (1971-2008), 1987. http://www.theses.fr/1987STR13082.
Full text
27
Jou, Pei-Yuan, and 周培元. "Adaptive Weighted Distance for Feature Vectors of Biological Sequences." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/47274308615858302312.
Full textAbstract:
碩士國立嘉義大學
資訊工程學系研究所
95
Study on biological sequence database similarity searching has received substantial attention in the past decade. The similarity search in the biological databases is an important issue. Similarity search in biology sequences has attention in the recent studies. Sequence alignment is the essential task for searching of similar sequence in bioinformatics. The biological sequence databases have getting larger in past decade. Finding sequences that similar to the query sequence is a time consuming task. By transforming sequences into numeric feature vectors, we can quickly filter out sequences whose feature vectors are far to the feature vector of the query sequence. The numeric feature vector contains three groups of features: Count, Extensible-Relative Position Dispersion (XRPD), and Extensible-Absolute Position Dispersion (XAPD) of a DNA sequence. Each group has four dimensions for A, C, T, and G. When computing distance between two feature vectors, Euclidean distance and L1 distance are commonly used. The author proposed an adaptive weighting distance. The adaptive weighting derives from the four nucleotides from the Count group. And the weighting applied on both XRPD and XAPD. In other words, if a certain kind of nucleotide appears much frequent than the other kinds of nucleotides, the weight for the kind of nucleotide should also be large in XRPD and XAPD groups. Experiments show that such distance of feature vectors helps reflect the distance between sequences.
28
Chen, Kuang-Ti, and 陳曠迪. "Identification of MicroRNA Sequences by Weighted Bayesian Classification Method." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/94905267899885477236.
Full textAbstract:
碩士長庚大學
資訊管理研究所
95
MicroRNAs(miRNAs) are single-stranded, non-coding RNAs averaging 22 nt in length. They play an important role in post-transcriptional regulation of gene expression and are one of the most important discovery in biology. More and more miRNAs are identified by biological experiments, but mass identification is still impossible. Recently, many computational methods for rapidly identifying mass amount of miRNAs using known miRNA sequences are proposed. Some of them include hidden markov model (HMM) and Naïve Bayesian classification method. The used training data for identification contains mature miRNA sequences, hairpin precursors and secondary structure features from a single species. More recently, a method was proposed to combine miRNAs from multiple species for identification. This research presents a method called weighted Bayesian classification method. It is extended from Naïve Bayesian classification method. Each feature is associated with a weight obtained by a genetic algorithm (GA). From our experiments, weighted Bayesian classification method is a stable method relatively. It is less disturbed by incomplete data. It achieves better results than Naïve Bayesian classification method especially for identification of miRNAs from multiple species.
29
Chen, Zih-Yin, and 陳姿吟. "Meta-Prediction of Phosphorylation Sites in Protein Sequences with Multiplicative Weighted Update Algorithms." Thesis, 2012. http://ndltd.ncl.edu.tw/handle/52387104753096278878.
Full textAbstract:
碩士亞洲大學
生物與醫學資訊學系碩士班
100
There are numerous predictors have been developed to the phosphorylation sites prediction. However, there are no developed prediction programs that could make more accurate prediction than other prediction programs in every situation. Wan et al. proposed meta-prediction strategies that integrate results of several prediction tools for phosphorylation sites prediction. Their meta-predictor gained an outstanding prediction performance that surpasses that of all combined prediction programs. They performed a generalized weighted voting strategy with parameters determined by restricted grid search to produce meta-prediction programs. Unfortunately, restricted grid search is time-consuming and the values of restricted grids should be computed using combinatorial analysis. In this paper, we make use of multiplicative update algorithms to learn better parameters for meta-predictions. The experimental results show that the proposed meta-predictor performs better than Wan’s meta-predictors, KinasePhos, KinasePhos 2.0, PPSP, GPS, NetPhosK and AMS 3.0 for S/T kinase families, PKA, PKC, CDK, and CK2.
30
Chang, Chi-Tung, and 張其棟. "Tauberian Theorems in the Statistical Sense for the Weighted Means of Double Sequences." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/40485670113049265585.
Full textAbstract:
碩士國立清華大學
數學系
92
Let p and q be complex sequences which belong to SVA. Assume that s is a double sequence in C (in one of R, a Banach space, and a ordered linear space) such that s statistically converges to t in the (N,p,q;a,b) sense, where (a,b)=(1,1), (1,0) or (0,1). We give sufficient and/or necessary conditions under which s statistically converges to t. The theory developed here is the statistical version of [CH]. Our results generalize [M1].
31
Chacon, Perez Gerardo Roman. "Carleson-type inequalitites in harmonically weighted Dirichlet spaces." 2010. http://trace.tennessee.edu/utk_graddiss/681.
Full textAbstract:
Carleson measures for Harmonically Weighted Dirichlet Spaces are characterized. It is shown a version of a maximal inequality for these spaces. Also, Interpolating Sequences and Closed-Range Composition Operators are studied in this context.
32
Namkung, Sook [Verfasser]. "Superparamagnetic iron oxide (SPIO)-enhanced liver MR imaging with ferucarbotran : efficacy for characterization of focal liver lesions with T2-weighted FSE and T2*-weighted GRE and early dynamic T1-weighted GRE sequences / vorgelegt von Sook Namkung." 2006. http://d-nb.info/98196723X/34.
Full text
33
Bharadwaj, Subramanya B. V. "The Isoperimetric Problem On Trees And Bounded Tree Width Graphs." Thesis, 2008. http://hdl.handle.net/2005/844.
Full textAbstract:
In this thesis we study the isoperimetric problem on trees and graphs with bounded treewidth. Let G = (V,E) be a finite, simple and undirected graph. For let δ(S,G)= {(u,v) ε E : u ε S and v ε V – S }be the edge boundary of S. Given an integer i, 1 ≤ i ≤ | V| , let the edge isoperimetric value of G at I be defined as be(i,G)= mins v;|s|= i | δ(S,G)|. For S V, let φ(S,G) = {u ε V – S : ,such that be the vertex boundary of S. Given an integer i, 1 ≤ i ≤ | V| , let the vertex isoperimetric value of G at I be defined as bv(i,G)=
The edge isoperimetric peak of G is defined as be(G) =. Similarly
the vertex isoperimetric peak of G is defined as bv(G)= .The problem
of determining a lower bound for the vertex isoperimetric peak in complete k-ary trees of depth d,Tdkwas recently considered in[32]. In the first part of this thesis we provide lower bounds for the edge and vertex isoperimetric peaks in complete k-ary trees which improve those in[32]. Our results are then generalized to arbitrary (rooted)trees.
Let i be an integer where . For each i define the connected edge
isoperimetric value and the connected vertex isoperimetric value of
G at i as follows: is connected and is connected A meta-Fibonacci sequence is given by the reccurence a(n)= a(x1(n)+ a1′(n-1))+ a(x2(n)+ a2′(n -2)), where xi: Z+ → Z+ , i =1,2, is a linear function of n and ai′(j)= a(j) or ai′(j)= -a(j), for i=1,2. Sequences belonging to this class have been well studied but in general their properties remain intriguing. In the second part of the thesis we show an interesting connection between the problem of determining and certain meta-Fibonacci sequences.
In the third part of the thesis we study the problem of determining be and bv algorithmically for certain special classes of graphs.
Definition 0.1. A tree decomposition of a graph G = (V,E) is a pair where I is an index set, is a collection of subsets of V and T is a tree whose node set is I such that the following conditions are satisfied:
(For mathematical equations pl see the pdf file)
34
Θεοδωρίδης, Ευάγγελος. "Αποδοτική διαχείριση κειμενικής πληροφορίας, δεικτοδότηση, αποθήκευση, επεξεργασία και εφαρμογές." Thesis, 2009. http://nemertes.lis.upatras.gr/jspui/handle/10889/1656.
Full textAbstract:
Βασική επιδίωξη της παρούσας διατριβής είναι η διερεύνηση των δυνατοτήτων του πεδίου
της επιστήμης των υπολογιστών που πραγματεύεται την αποθήκευση και την επεξεργασία
πληροφορίας, μέσα στο περιβάλλον που έχουν σχηματίσει οι σύγχρονες εφαρμογές. Τα
τελευταία χρόνια, η πληροφορία που είναι διαθέσιμη σε ηλεκτρονική μορφή, έχει γιγαντωθεί με αποτέλεσμα να είναι αναγκαία η ανάπτυξη νέων τεχνικών για την αποτελεσματική
αποθήκευση και επεξεργασία αυτής. Δύο πολύ χαρακτηριστικές και σημαντικές εφαρμογές, στις οποίες ανακύπτουν συνεχώς νέα προβλήματα, είναι η διαχείριση Βιολογικών
δεδομένων, όπως π.χ. οι ακολουθίες γονιδιωμάτων, καθώς και η διαχείριση πληροφορίας
από τον παγκόσμιο ιστό, όπως π.χ. τα έγγραφα HTML, XML ή οι συντομεύσεις (urls).
Στόχος είναι ανάπτυξη δομών δεικτοδότησης πάνω στην πληροφορία έτσι ώστε τα σχετικά
ερωτήματα με αυτή να απαντώνται αποδοτικά και πολύ πιο γρήγορα από το να ψάχναμε εκτενώς μέσα σε αυτή. Χαρακτηριστικά τέτοια ερωτήματα είναι η εύρεση προτύπων (pattern matching) ή ο εντοπισμός επαναλαμβανόμενων μοτίβων (motif extraction). Πιο συγκεκριμένα, τα ϑέματα στα οποία εστίασε η παρούσα διατριβή είναι τα ακόλουϑα:
- Εντοπισμός Περιοδικοτήτων σε συμβολοσειρές. Στην ενότητα αυτή δίνεται μια σειρά από αλγόριθμους για την εξαγωγή περιοδικοτήτων από συμβολοσειρές.
Δίνονται αλγόριθμοι για την εξαγωγή μέγιστων επαναλήψεων, της περιόδου του καλύμματος και της ρίζας μιας συμβολοσειράς. Οι αλγόριθμοι αυτοί χρησιμοποιούν ώς βάση το δένδρο επιθεμάτων και οι περισσότεροι από αυτούς είναι γραμμικοί.
- Δεικτοδότηση Βεβαρημένων Ακολουθιών. Στην επόμενη ενότητα η μελέτη εστιάζει στην δεικτοδότηση βεβαρημένων ακολουθιών, καθώς και στην απάντηση ερωτημάτων σε αυτές όπως η εύρεση προτύπων, η εύρεση επαναλήψεων, η εύρεση καλυμμάτων, κ.α.. Οι βεβαρημένες ακολουθίες είναι ακολουθίες όπου σε κάθε ϑέση
τους έχουμε εμφάνιση όλων των συμβόλων του αλφαβήτου της ακολουθίας, έχοντας λάβει ένα συγκεκριμένο βάρος. Οι βεβαρημένες ακολουθίες αναπαριστούν βιολογικές ακολουθίες είτε νουκλεοτιδίων είτε αμινοξέων και στην ουσία περιγράφουν την πιθανότητα εμφάνισης ενός συμβόλου του αλφαβήτου σε μια συγκεκριμένη ϑέση της ακολουθίας ή κάποιες συγκεκριμένες βιολογικές ιδιότητες που διαθέτουν οι ρυθμιστικές πρωτεΐνες σε κάθε ϑέση της ακολουθίας. Για την διαχείριση αυτών των ιδιόμορφων ακολουθιών προτείνεται ως δομή δεικτοδότησης το βεβαρημένο δένδρο επιθεμάτων (Weighted Suffix Tree), ένα δένδρο με παρόμοια δομικά χαρακτηριστικά με αυτά του γενικευμένου δένδρου επιθεμάτων. Στην παρούσα εργασία δίνεται
ο ορισμός του βεβαρημένου δένδρου επιθεμάτων και αλγόριθμοι κατασκευής του σε γραμμικό χρόνο και χώρο.
-Εξαγωγή μοτίβων από βεβαρημένες Ακολουθίες. Με την χρήση του βεβαρημένου δένδρου επιθεμάτων υλοποιούνται ένα σύνολο αλγόριθμων εξαγωγής επαναληπτικών δομών από βεβαρημένες ακολουθίες. Πιο συγκεκριμένα, δίνονται
αλγόριθμοι για την εύρεση μέγιστων ευγών,επαναλαμβανόμενων μοτίβων και κοινών μοτίβων από περισσότερες της μίας βεβαρημένες ακολουθίες.
- Αλγόριθμοι Σύστασης Σελίδων Παγκόσμιου Ιστού με χρήση τεχνικών επεξεργασίας
συμβολοσειρών. Αρκετές εφαρμογές παγκόσμιου ιστού (συστήματα σύστασης ή συστήματα κρυφής μνήμης) προσπαθούν να προβλέψουν τις προθέσεις ενός επισκέπτη είτε για να του προτείνουν είτε για να προφορτώσουν μία σελίδα. Για το σκοπό αυτό προσπαθούν να εκμεταλλευτούν οποιαδήποτε εμπειρία που έχει καταγραφεί στο σύστημα από προηγούμενες προσπελάσεις. Προτείνεται νέος τρόπος
δεικτοδότησης και αναπαράστασης της πληροφορίας που εξάγεται από τα διαθέσιμα δεδομένα, όπως οι προσβάσεις των χρηστών από τα logfilesκαι το περιεχόμενο
των σελίδων. Για την εξόρυξη γνώσης από τα παραπάνω δεδομένα, αυτά αναπαριστώνται ως συμβολοσειρές και στη συνέχεια επεξεργάζονται και δεικτοδοτούνται από ένα γενικευμένο βεβαρημένο δένδρο επιθεμάτων. Το δένδρο αυτό συμπυκνώνει αποδοτικά τα πιο συχνά αλλά και πιο ουσιαστικά μοτίβα προσπελάσεων και χρησιμοποιείται, αφότου κατασκευαστεί, σαν ένα μοντέλο για την πρόβλεψη των κινήσεων τον επισκεπτών ενός ιστοτόπου.The basic goal of this thesis is to explore the possibilities of the field of computer science that deals with storing and processing information in the environment that formed by the modern applications. In recent years, the information that is available in electronic form, has met an enormous growth. Thus it is necessary to develop new techniques for efficient storage and processing. Two very specific and important applications in which constantly new problems arise are, the management of biological data, such as genome sequences, and the management information from the Web, such as documents HTML, XML or shortcuts (urls). The objective is the development of data structures for indexing information so that the questions are able to be answered in less time than looking explicitly in information. Such questions are to find patterns (pattern matching) or the identification of repeated motifs (motif extraction). In particular, the issues on which this thesis has focused are: - Locating Periodicities in strings. This section provides a series of algorithms for the extraction of periodicities of strings. We propose algorithms for the extraction of maximum repetitions of the cover, period and the seed of a string. The algorithms used are based on suffix tree and they are optimal. - Weighted Sequences indexing. In the next section, the study focuses on indexing of weighted sequences, and to answer questions like finding models, pairs, covers etc. in them. The weighted sequences are sequences where each position consists of all the symbols of the alphabet in sequence, having each one a specific weight. For the management of these sequences a particular indexing structure is proposed with the name Weighted Suffix Tree, a tree with structural features similar to those of the generalized suffix tree. In this work we propose the definition of the weighted suffix tree and construction algorithms in linear time and memory space. With the utilization of weighted suffix tree on a set of weighted sequences we propose algorithms for extracting repetitive structures from a set of weighted sequences. More specifically, we propose algorithms for finding maximum pairs, repeated motifs and common patterns of more than one weighted sequences -Recommendation Algorithms for web pages using strings processing algorithms. Several web applications (Recommendation systems or cache systems) want to predict the intentions of a visitor in order to propose or to preload a webpage. For this purpose systems try to exploit any experience that is recorded in the system from previous accesses. A new method for indexing and representing of information extracted is proposed upon the recorder data, from the user accesses in log files and content pages. For extracting knowledge from these data, the information is represented as strings and then treated and processed as weighted sequences. All these sequences are indexed by a generalized weighted sequence tree.
35
Huang, Po-Kai, and 黃柏凱. "Matrix Operators Acting on Weighted Sequence Besov Spaces and Applications." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/06314132432793658694.
Full textAbstract:
碩士國立花蓮教育大學
數學系碩士班
97
In this article, we study the boundedness of matrix operators acting on weighted sequence Besov spaces $\dot{b}_{p,w}^{\alpha,q}$. First we obtain the necessary and sufficient condition for the boundedness of diagonal matrices acting on weighted sequence Besov space $\dot{b}_{p,w}^{\alpha,q}$, and investigate the duals of $\dot{b}_{p,w}^{\alpha,q}$, where the weight is non-negative and locally integrable. In particular, when $0
36
Liou, Guan-Wei, and 劉冠緯. "The Application of Time-weighted Concept to Re-counting Sequence." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/h8zp5m.
Full textAbstract:
碩士國立臺北科技大學
工業工程與管理研究所
95
In this period when we regard the satisfaction of one to one customer’ needs as a key to competition, we can raise the advantage for business competition if the business managers can effectively control the consuming behavior of customers and offer right services to satisfy customers’ needs at an appropriate time. Therefore, it becomes the essential factor in the profit of enterprises that we understand the change of consuming behavior of customers. In recent years, sequential pattern mining has been one of the research focuses on the rule of customer’s behavior. Nevertheless, it has been hardly discussed that different timing could affect the change of behavior to some extent. Because of that, this research will construct a model of predicting the state of customer’s behavior, which combines the time-weighted concept and re-counting sequence mining. In this model, the main purpose of time-weighted concept is to resolve the problem that the status of customer’s behavior varies in time, which results in obvious variety of sequence data to make analysis performances less desirable. And the re-counting sequence can mine for single customer-sequence, which is able to analyze those high-value or highly loyal customers in a one to one way and raise customer satisfaction. This method divides customer-sequence into several partitions according to time and gives each partition different weight to produce new prediction rules that interest managers.
37
Shen, Ching-Hsuan, and 沈敬軒. "Mining Similar Astronomical Sequence Pattern with Hierarchical Weighted Suffix Tree." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/32287959450721649047.
Full textAbstract:
碩士國立中央大學
資訊工程研究所
99
Astronomical researchers have been manually registering and maintaining observation data for various analysis processes. But with the ongoing construction of observatories from Pan-Starrs projects, the size of observation data has exploded. Manually processing numerous of data each day becomes impractical. Responding to this challenge, we need to construct large scale information management system, as well as the efficient methodology for data analysis. We have the following goals to achieve in this project: 1. Constructing an automatic information preparation system: Because of the movements of earth and astronomical objects, a complete set of observation records requires gathering data from world-wide observatories. Limited by factors such as hardware, weather, time, or temperature, we also need to calibrate and clarify heterogeneous data sources before data integration. Considering the rapidly growing data size, data preparation has to be processed automatically and efficiently. We will implement this preparation system with the accessibility of computer network and perform necessary calibration or transformation based on historical data features. The clarified data then can be integrated for further analysis and researches. 2. Develop astronomical time-series pattern mining and associated rule mining methodologies: Discovering the similarities between astronomical objects, and accordingly classify those objects, is an important process for many astronomical researches. We then integrate concept hierarchy with weighted suffix tree, and made those similar variation trend objects gather in the same branch inside the tree structure. Furthermore, we also implement some functions to help user searching what they are interested in. By using automatic program, the observation data can be simplified. Not only reduce the loading in data analysis, but also improve its efficiency and give those researchers a better solution to handle large data in the future.
38
Lee, En-Shiun Annie. "Training of Template-Specific Weighted Energy Function for Sequence-to-Structure Alignment." Thesis, 2008. http://hdl.handle.net/10012/4060.
Full textAbstract:
Threading is a protein structure prediction method that uses a library of template protein structures in the following steps: first the target sequence is matched to the template library and the best template structure is selected, secondly the predicted target structure of the target sequence is modeled by this selected template structure. The deceleration of new folds which are added to the protein data bank promises completion of the template structure library. This thesis uses a new set of template-specific weights to improve the energy function for sequence-to-structure alignment in the template selection step of the threading process. The weights are estimated using least squares methods with the quality of the modelling step in the threading process as the label. These new weights show an average 12.74% improvement in estimating the label. Further family analysis show a correlation between the performance of the new weights to the number of seeds in pFam.
39
Παναγής, Ιωάννης-Δαμαστιανός. "Δομές δεδομένων για τη διαχείριση συμβολοσειρών και για τη διαχείριση πληροφορίας σε δικτυοκεντρικά πληροφοριακά συστήματα." Thesis, 2006. http://nemertes.lis.upatras.gr/jspui/handle/10889/1426.
Full textAbstract:
Οι Δομές Δεδομένων είναι ένας από τους σημαντικότερους και ιστορικότερους κλάδους της Επιστήμης των Υπολογιστών, με συνεχή εξέλιξη από τη δεκαετία του εβδομήντα μέχρι σήμερα, παρέχοντας λύσεις σε θεμελιώδη προβλήματα σε ταξινόμηση, οργάνωση, διαχείριση και αναζήτηση πληροφορίας.
Παράλληλα, η ανάπτυξη σύγχρονων κλάδων της Επιστήμης των Υπολογιστών όπως τα Σύγχρονα, Δικτυοκεντρικά Πληροφοριακά Συστήματα και η Βιοπληροφορική, έφερε μαζί της την έκρηξη των δεδομένων. Η ανάγκη αποδοτικής διαχείρισης της παρεχόμενης πληροφορίας καθίσταται έτσι πιο επιτακτική από ποτέ.
Στα πλαίσια αυτής της διατριβής αναγνωρίζοντας την ανάγκη για αποδοτική διαχείριση πληροφορίας σε όλα τα επίπεδα, παρουσιάζουμε τη μελέτη και την πρόταση λύσεων σε σύγχρονα προβλήματα στους χώρους: της Διαχείρισης Συμβολοσειρών, της Αναδιοργάνωσης Δικτυακών Τόπων, της Ανακάλυψης Web Services με υποστήριξη χαρακτηριστικών Ποιότητας Υπηρεσίας και της Προσωποποιημένης Ανάκτησης Πληροφορίας στο Διαδίκτυο.
Σε αυτή την κατεύθυνση, στον τομέα της Διαχείρισης Συμβολοσειρών, παραθέτουμε αλγορίθμους σε θεμελιώδη προβλήματα στο χώρο της διαχείρισης Σταθμισμένων Ακολουθιών (weighted sequences), όπως ταίριασμα προτύπου, εύρεση επαναληπτικών δομών, και συνεχίζουμε δίνοντας απλοποιητικές αλλά βέλτιστες λύσεις σε προβλήματα περιοδικοτήτων σε συνήθεις συμβολοσειρές, όπως τα προβλήματα εύρεσης όλων των καλυμμάτων μιας συμβολοσειράς, εύρεσης της περιόδου μιας συμβολοσειράς και εύρεσης όλων των φύτρων μιας συμβολοσειράς.
Στην Αναδιοργάνωση Δικτυακών Τόπων, παραθέτουμε δυο διαφορετικές μετρικές για την αποτίμηση της αντικειμενικής αξίας των ιστοσελίδων του κάθε ιστοτόπου. Αυτές οι μετρικές παραλλάζουν τις προσβάσεις που δέχεται κάποια ιστοσελίδα με τρόπο που καταδεικνύει την αντικειμενική αξία της ιστοσελίδας. Από πειραματική αποτίμηση των μετρικών, προκύπτει ότι παρέχουν ακριβή πληροφόρηση για τα σημεία του δικτυακού τόπου που χρήζουν αναδιοργάνωσης. Στη συνέχεια δίνουμε μια μέθοδο για τον εντοπισμό σημαντικών τμημάτων μεγαλύτερου μεγέθους στο δικτυακό τόπο και παρουσιάζουμε μια σειρά μεθόδων τόσο σε τεχνικό όσο και θεωρητικό επίπεδο για την αναδιοργάνωση ενός δικτυακού τόπου.
Στον τομέα της Ανακάλυψης Web Services, εξετάζουμε την Ανακάλυψη που πληροί περιορισμούς ως προς την παρεχόμενη Ποιότητα Υπηρεσίας. Αρχικά, παρουσιάζονται δυο απλές μέθοδοι για την καταχώριση χαρακτηριστικών ποιότητας υπηρεσίας επεκτείνοντας υπάρχοντα πρότυπα υλοποίησης Web Service. Στη συνέχεια παρουσιάζουμε έναν αλγόριθμο για την ανακάλυψη του σεναρίου εκτέλεσης μιας ακολουθίας (workflow) από συνεχόμενες Web Services, που ελαχιστοποιεί το συνολικό χρόνο εκτέλεσης. Μια σειρά από ευριστικές μεθόδους παρουσιάζονται επίσης, για την υλοποίηση σε πρακτικό επίπεδο του προτεινόμενου αλγορίθμου, οι οποίες αποτιμούνται πειραματικά.
Τέλος, στον τομέα της Προσωποποιημένης Ανάκτησης Πληροφορίας στο Διαδίκτυο εξετάζουμε διαφορετικές τεχνικές προσωποποίησης των αποτελεσμάτων των μηχανών αναζήτησης. Η πρώτη τεχνική εφαρμόζει μετα-κατηγοριοποίηση των αποτελεσμάτων και παρουσίασή τους ανάλογα με τη σειρά ενδιαφέροντος του χρήστη ως προς τις κατηγορίες των αποτελεσμάτων. Η δεύτερη τεχνική, βασίζει την προσωποποίηση στην έμμεση απεικόνιση των ενδιαφερόντων χρήστη στις κατηγορίες του Open Directory Project, επεκτείνει μια τεχνική που έχει πρόσφατα προταθεί, τους ιδεατούς κόμβους συσχέτισης κατηγοριών, και χτίζει πολλαπλά επίπεδα ιδεατών κόμβων για την επίτευξη πιο εκλεπτυσμένης προσωποποίησης. Κλείνοντας, παρουσιάζουμε την επέκταση της λογικής της μεθόδου προσωποποίησης για την κατασκευή εστιασμένων συλλεκτών.Data Structures is one of the most important and most historical sectors of Computer Science, being under continuous development since the seventies. Data Structuring has offered solutions to fundamental problems in sorting, organising, and retrieving information. Meanwhile, the development of the modern fields of Computer Science such as Modern, Net-centric Information Systems and Bioinformatics has signalled a data blow-up. Therefore, the need for efficient information management has become a necessity. In this Thesis, having recognized the need for efficient information management at every level, we present a study and solutions to contemporary problems in the areas of: String Processing, Website Reorganization, Web Service retrieval with support for Quality of Service characteristics, and Personalized Information Retrieval on the Web. In the area of String Processing, we present algorithms for solving fundamental problems in Weighted Sequence Processing, such as Pattern Matching, Repetitive Structures Detection and we continue by giving simplifying yet optimal solutions to periodicity problems in ordinary sequences, namely detecting all covers in a sequence, detecting the period of a sequence and detecting all the seeds of a sequence. In the area of Website Reorganization, we present two different metrics for evaluation of the objective importance of each website's pages. These metrics modify the accesses each page receives in order to present the actual page importance. We have seen from the experimental evaluation of those metrics that they provide accurate information about the areas inside the website in need of reorganization. Furthermore, we present a method to detect larger important parts inside the website and we present methods for website reorganisation both from a technical and from a theoretical viewpoint. In the area of Web Service Retrieval we are coping with retrieval under constraints for the provided Quality of Service (QoS). Firstly, we present two simple methods to register QoS information by extending existing Web Service protocols. Secondly, we present an algorithm to discover the execution scenario for a sequence of contiguous Web Services that minimizes the total execution time. A series of heuristics to implement the above algorithm is also presented. We also present an extensive experimental evaluation of those heuristics. Ultimately, we present different personalization techniques for personalized Web Information Retrieval. The first technique, applies post-categorization of search engine results and presents them according to user preferences with respect to the results' categories. The second technique is based on implicit mapping of user preferences to the categories of the Open Directory Project, it extends a recently proposed technique, namely virtual nodes for associating categories, and builds multiple layers of nodes to achieve more elaborate personalization. Finally, we present the extension of personalization methods in order to build focused crawlers.
40
Chen, Hsia-Hsiang, and 陳夏祥. "Ant Colony System for the Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setups." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/88275802019118675727.
Full textAbstract:
碩士國立臺灣科技大學
工業管理系
90
Ant colony system (ACS) is one of the most recent meta-heuristics for combinatorial optimization problems. In this paper, an ACS algorithm is proposed for the single machine total weighted tardiness problem with sequence-dependent setup times. To the best of our knowledge, this is the first attempt to propose an improved heuristic, as opposed to the construction heuristic, for this problem. To verify the developed algorithm, computational experiments were conducted on different sizes of problems. The experimental results show that the algorithm find optimal solutions for almost all small size problems. For large size problems, the algorithm significantly improves the best solutions obtained by the construction heuristics. Furthermore, we incorporate different dispatching rules into our ACS algorithm. The results verify that the proposed algorithm is an efficient and effective method for this problem.
41
Lai, Jia-Chin, and 賴家欽. "Susceptibility-weighted imaging using magnetic resonanceFast Imaging with Steady-state Precession (FISP)gradient-echo sequence." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/55857857243145359193.
Full textAbstract:
碩士國立臺灣大學
生醫電子與資訊學研究所
103
Susceptibility-weighted imaging (SWI) is now extensively used in clinical neural applications to enhance the depiction of vascular architecture. The traditional procedure of SWI uses the phase information from RF-spoiled gradient-echo (SPGR) sequence to calculate a phase mask for improving contrast of small venous vessels, which is subsequently applied to enhance contrast of the magnitude image. The aim of this study is to investigate potential benefits of using the fast imaging with steady-state free precession (FISP) sequence on SWI application, for its variety of image contrast and high SNR efficiency. To obtain a proper set of MR scan parameters, the numerical simulation were employed to evaluate the signal performance of this proposed FISP sequence. We also presented the comparison in image quality and contrast between the FISP images and a standard SPGR sequence for SWI. The images of FISP-SWI led to a reduction of noise level for all subjects and all regions. Thus, it showed higher image quality such as SNR and CNR in some iron-rich brain tissues in contrast to SPGR-SWI. In conclusion, we expect that this proposed FISP sequence would be a promising imaging probe for other advanced SWI applications, and, meanwhile, this work may contribute to the current developments of the steady-state free-precession (SSFP).
42
Wang, Yu-Tsun, and 王煜樟. "Finding all Maximal Palindromes in a Weighted Sequence with the Constraint of the Probability of Appearance." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/02474560706272355878.
Full textAbstract:
碩士國立臺灣大學
資訊工程學研究所
96
A weighted sequence X is a sequence of positions, and each position stands for a character. Each character associated with a position is assigned a weight. The weight models the probability of appearance of the character associated with that position in a molecular sequence. This model for a weighted sequence can stand for a DNA assembly process. Because DNA is a very large string, only a small amount of DNA can be sequenced in a single read in a laboratory. Thus, a DNA sequence is divided into many short segments and we need to reassemble it to get an entire genome. Reassembling a DNA sequence is a process for handling the uncertainty. The concept of uncertainty associated with some position is considered as that each character has its probability of appearance at that position. The probability of appearance of a word generated from X is calculated by multiplying the relative probability of appearance of each character in every position. In this thesis, we present a linear-time algorithm for finding all maximal palindromes with probability of appearance greater than or equal to 1/k on a weighted sequence. Because palindromes on a DNA sequence may stand for some special meaning for creatures, our algorithm may be a choice for scientists to find all palindromes with the constraint of probability of appearance on a DNA sequence.
43
Wang, Yu-Tsun. "Finding all Maximal Palindromes in a Weighted Sequence with the Constraint of the Probability of Appearance." 2008. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-3107200817302600.
Full text
44
Fan, Su-Hao, and 范書豪. "An I Ching optimization for the single machine total weighted tardiness problem with sequence dependent setup times." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/42319073688908857772.
Full text
45
Huang, Po-Tsun, and 黃柏淳. "Protein Tyrosine Sulfation Sites Predcition: Based on Support Vector Machine and Pairwise Position Weighted Matrix of Amino Acid Sequence." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/30096393732610573630.
Full textAbstract:
碩士國立交通大學
生醫工程研究所
101
Protein tyrosine sulfation is one of the common post-translation modifications. Identifying the tyrosine sulfation sites is important for biologists to predict biochemical interactions. However, the determinant features of tyrosine sulfation sites are unknown. Moreover, the number of experimental sulfotyrosine sites is few, and the number of non-sulfotyrosine sites is 26 times more than the number of sulfotyrosine sites. The thesis presents a prediction method based on support vector machine (SVM) with amino acid sequence encoded by pairwise position weighted matrix (PPWM) to predict tyrosine sulfation sites. Due to the number of sulfotyrosine sites are less than non-sulfotyrosine sites, we incorporates resampling of training data to build multiple SVM models. The final prediction is made by a voting mechanism from those models. A single SVM model achieves an accuracy of 99.2% in average under five-fold cross validation. The proposed method achieves an accuracy of 98.3% when testing all known tyrosine sites with voting. In addition, we discovered that some patterns such as acidic amino acid occurs on each side of tyrosine residue, and Tryptophan (W) couples with acidic amino acid occur more frequently within sulfotyrosine subsequence by analyzing PPWM. The results may help biologists to discover tyrosine sulfation.
46
Tseng, Yu-Cheng, and 曾宇正. "Learning Weight Assignment in Distance Function for Biological Sequence Feature Vector by Genetic Algorithm." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/46409116849928262977.
Full textAbstract:
碩士國立嘉義大學
資訊工程學系研究所
95
Transforming sequences into numeric feature vectors is a promising method in bio-sequence similarity search. The process of transformation will lose some information of the origin sequence. In order to improve the accuracy, weight assignment can be used. Based on this notion, we proposed a weighted distance mechanism which is based on feature vector which is called sequence descriptor that contains three groups of features: Count, RPD, and APD of a DNA sequence [8]. We compute the average of entropy of two sequences and then assign the weights to Count, RPD and APD according to the weight table. The weight tables are then adjusted by Genetic Algorithms [2]. Experiment results shows that such weighted distance mechanism helps reflect the distance of sequences.
47
Pitts, Ernest Gerard. "The nucleotide sequence of a gene encoding a low molecular weight glutenin subunit from hexaploid wheat." 1988. http://hdl.handle.net/2097/22330.
Full text
48
Li, Yue Lun, and 李岳倫. "Isolation, sequence analysis and identification of 18.OkD low molecular weight heat shock protein cDNA from rice." Thesis, 1994. http://ndltd.ncl.edu.tw/handle/43284148380157977611.
Full text
49
Shih, Chi-Huai, and 施智懷. "Using Hybrid Genetic Algorithms with Dynamic Weights to Solve the Problem of Single Machine Scheduling on A Sequence Dependent Setup Environment." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/52943358595691050666.
Full textAbstract:
碩士華梵大學
資訊管理學系碩士班
92
Because of the constant change of the consumer market in recent years, the type of production has already been changed into various and a small amount from original few style volumes. As to enterprises, how to face with the production types of diversification which involve to reorganize and setup cost, earliness cost and tardiness cost, the production Scheduling planning seems extremely important right away. The measure criteria are complicated in solving scheduling problem. Supposing that we just concentrate one of the measure criteria may leads to the loss of the other measure criteria. It is really quite difficult to have the global optimization whole in criterion of exchanging nature in these. In this paper, on the sequence dependent setup time environment, we propose a hybrid genetic algorithms with dynamic weights to solve the global minimization of multi objectives single machine scheduling problem of setup cost、earliness cost and tardiness cost, via experiment we have good results.
50
Meddour, Miriam. "MR-tomographische Darstellung intracerebraler Blutungen mit und ohne Therapie." Doctoral thesis, 2011. http://hdl.handle.net/11858/00-1735-0000-0006-B180-D.
Full text