To see the other types of publications on this topic, follow the link: Consecutive.
Dissertations / Theses on the topic 'Consecutive'
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 'Consecutive.'
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
Oswald, Marcus. "Weighted consecutive ones problems." [S.l.] : [s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=968318274.
Full text
2
Dom, Michael. "Recognition, generation, and application of binary matrices with the consecutive ones property." Göttingen Cuvillier, 2009. http://d-nb.info/994011954/04.
Full text
3
Peck, A. S. "On the differences between consecutive primes." Thesis, University of Oxford, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.339255.
Full text
4
Ünal, Melis. "Coherence in consecutive interpreting : a comparative study of short and long consecutive interpretations of English texts into Turkish." Thesis, University of Surrey, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608343.
Full textAbstract:
This study addresses the consecutive mode of interpreting. With a novel three-way approach to assessing coherence, it investigates whether different ways of delivering the target text - short and long consecutive interpreting - contribute to or impede coherence. Cohesion, paralinguistic features and background knowledge are investigated as possible contributing factors to coherence. Accordingly. the study consists of three parts. The first part involves an analysis of cohesive ties in Turkish and English speeches, and in short and long consecutive interpretations of the English speeches into Turkish. The original English and Turkish speeches are used as a benchmark for comparison between non-interpreted and interpreted speech. Part two of the study involves the textual analysis of para linguistic features ill the short and long consecutive interpretations. Part three is a reception study which assesses the participants' perception of coherence in the short and long renditions. The participants of the reception study form two different groups: participants who had specialised background knowledge of the topics discussed in the texts and those who had not. The cohesion analysis shows that long consecutive interpretations are more cohesive when compared with short consecutive interpretations. The analysis of para linguistic features reveals that hesitation markers, pauses, false starts, slips of the tongue, sc1frepairs, drawn out syllables and word repetitions are more frequent in short consecutive interpretations. The reception study shows that the longer renditions are perceived as being more coherent than the shorter renditions, and this perception is higher for participants with relevant background knowledge. The results of the study thus suggest that specialised background knowledge and cohesion contribute to coherence creation whilst the frequent use of para linguistic features impedes coherence. This study contributes to filling the knowledge gaps in relation to coherence in consecutive interpreting and Turkish interpretations of English spoken texts. In particular, it contributes to our understanding of the difference between short and long consecutive interpretations with respect to coherence.
5
Elizalde, Torrent Sergi. "Consecutive patterns and statistics on restricted permutations." Doctoral thesis, Universitat Politècnica de Catalunya, 2004. http://hdl.handle.net/10803/5839.
Full textAbstract:
El tema d'aquesta tesi és l'enumeració de permutacions amb subseqüències prohibides respecte a certs estadístics, i l'enumeració de permutacions que eviten subseqüències generalitzades.<br/>Després d'introduir algunes definicions sobre subseqüències i estadístics en permutacions i camins de Dyck, comencem estudiant la distribució dels estadístics -nombre de punts fixos' i -nombre d'excedències' en permutacions que eviten una subseqüència de longitud 3. Un dels resultats principals és que la distribució conjunta d'aquest parell de paràmetres és la mateixa en permutacions que eviten 321 que en permutacions que eviten 132. Això generalitza un teorema recent de Robertson, Saracino i Zeilberger. Demostrem aquest resultat donant una bijecció que preserva els dos estadístics en qüestió i un altre paràmetre. La idea clau consisteix en introduir una nova classe d'estadístics en camins de Dyck, basada en el que anomenem túnel.<br/>A continuació considerem el mateix parell d'estadístics en permutacions que eviten simultàniament dues o més subseqüències de longitud 3. Resolem tots els casos donant les funcions generadores corresponents. Alguns casos són generalitzats a subseqüències de longitud arbitrària. També descrivim la distribució d'aquests paràmetres en involucions que eviten qualsevol subconjunt de subseqüències de longitud 3. La tècnica principal consisteix en fer servir bijeccions entre permutacions amb subseqüències prohibides i certs tipus de camins de Dyck, de manera que els estadístics en permutacions que considerem corresponen a estadístics en camins de Dyck que són més fàcils d'enumerar.<br/>Tot seguit presentem una nova família de bijeccions del conjunt de camins de Dyck a sí mateix, que envien estadístics que apareixen en l'estudi de permutacions amb subseqüències prohibides a estadístics clàssics en camins de Dyck, la distribució dels quals s'obté fàcilment. En particular, això ens dóna una prova bijectiva senzilla de l'equidistribució de punts fixos en les permutacions que eviten 321 i en les que eviten 132. A continuació donem noves interpretacions dels nombres de Catalan i dels nombres de Fine. Considerem una classe de permutacions definida en termes d'aparellaments de 2n punts en una circumferència sense creuaments. N'estudiem l'estructura i algunes propietats, i donem la distribució de diversos estadístics en aquests permutacions.<br/>En la següent part de la tesi introduïm una noció diferent de subseqüències prohibides, amb el requeriment que els elements que formen la subseqüència han d'aparèixer en posicions consecutives a la permutació. Més en general, estudiem la distribució del nombre d'ocurrències de subparaules (subseqüències consecutives) en permutacions. Resolem el problema en diversos casos segons la forma de la subparaula, obtenint-ne les funcions generadores exponencials bivariades corresponents com a solucions de certes equacions diferencials lineals. El mètode està basat en la representació de permutacions com a arbres binaris creixents i en mètodes simbòlics.<br/>La part final tracta de subseqüències generalitzades, que extenen tant la noció de subseqüències clàssiques com la de subparaules. Per algunes subseqüències obtenim nous resultats enumeratius. Finalment estudiem el comportament assimptòtic del nombre de permutacions de mida n que eviten una subseqüència generalitzada fixa quan n tendeix a infinit. També donem fites inferiors i superiors en el nombre de permutacions que eviten certes subseqüències.
6
Hughes-Jones, Robin. "The sizes of consecutive repeat-free codes." Thesis, Royal Holloway, University of London, 2009. http://digirep.rhul.ac.uk/items/acd01faa-158b-5e71-43b1-93fd1b5221bc/1/.
Full textAbstract:
The notions of strongly consecutive repeat free code and weakly consecutive repeat free code were introduced by Pebody in his paper in the Journal of Combinatorial Theory Series A in 2006. This thesis aims to investigate the the maximum sizes of such codes, in particular in the case when the length is fixed and the alphabet size is large. Pebody constructs a strongly consecutive repeat free code of maximal size, which he calls the alternating code. We show that the size of an alternating code is polynomial in the alphabet size, give methods for computing this polynomial and explicitly determine the most significant coefficients of this polynomial in terms of the sequence of 'up/down numbers' and related sequences. Pebody defines a family of codes (which we call Pebody codes) that are weakly consecutive repeat free codes. Pebody conjectures that for all parameters there exists a member of this family that is a weakly consecutive repeat free code of maximal size. We show that the maximal size of a Pebody code agrees closely with the maximal size of a strongly consecutive repeat free code. We use techniques from combinatorics and functional analysis, together with computational results, to give estimates for the leading terms of the maximal size of a Pebody code of fixed length when the alphabet size is large.
7
Jin, Ya-shyuan. "Is working memory working in consecutive interpreting?" Thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4451.
Full textAbstract:
It is generally agreed that language interpreting is cognitively demanding; how- ever, to date there is little evidence to indicate how working memory is involved in the task, perhaps due to methodological limitations. Based on a full considera- tion of key components of interpreting, two series of experiments were conducted to explore how working memory might play a role in discourse and sentence inter- preting. If working memory is implicated both in grammatical encoding into the target language, and in temporary storage of the discourse content, then higher demand in one function might compromise the other. Thus discourses that di er in word orders between languages could increase the processing load and leave less resource for memory maintenance, a ecting recall performance. In Experiment 1, Chinese-English bilingual participants' memory performance was compared when they translated passages from Chinese to English and from English to Chinese, where the expected word order was either congruent or incongruent between source and target. Recall was not sensitive to word order or direction of translation. Per- haps surprisingly, memory for incongruent discourses was numerically better than that for congruent sentences. Experiment 2 showed that interpreting trainees per- formed just like the participants in Experiment 1 did, suggesting that memory performance was not modulated by translation direction in pro cient translators. Experiment 3 explored the relationship between surface form transformation and recall. As discourse paraphrasing did not result in better recall than verbatim recall, it was concluded that the better memory performance for incongruent discourse in- terpreting suggested by Experiment 1 was not the result of active manipulation of word form or word order in interpreting. Finally, a free recall task among native English speakers showed that the incongruent discourses tested in earlier experi- ments were intrinsically more memorable than congruent discourses (Experiment 4). Despite this confound, this series of experiments highlighted the importance of comprehension in interpreting, but it did not rule out the role of working memory in the task. The role of working memory in interpreting was further explored using on-line measures in Experiments 5-8. Experiment 5 replicated a self-paced reading study by Ruiz, Paredes, Macizo, and Bajo (2008), comparing participants’ times to read sentences for translation to those to read them normally. The data showed that participants accessed lexical and syntactic properties of a target language in the reading-for-translation condition when resources were available to them. In order to explore the role of working memory in sentence interpreting, a dual-task paradigm was used in Experiment 6. When participants' working memory was occupied by a secondary task (digit preload), reading times were only different numerically between congruent and incongruent sentences. Crucially, reading times decreased as digit preload increased. Since there were no differences in the interpretations produced or in digit recall, it appears that participants were flexible in their resource allocation, suggesting that processing can be tuned up to optimise performance for concurrent tasks. Experiment 7 refined the procedure in the order of responses for the dual tasks but replicated the results of Experiment 6. A closer examination of participants’ interpretation responses showed that devices that could reduce processing load in target language production may have been strategically employed. Finally, another set of sentences were used in Experiment 8 in an attempt to replicate Experiment 5. A failure to replicate the earlier findings suggested that working memory demand might differ for different syntactic structures in sentence interpreting. All in all, this thesis shows that research in language interpreting benefits by taking a full account of the key components of interpreting. The use of on-line measures allowed us to take a ne-grained approach to the investigation of interpretation processes. It is proposed in this thesis that interpreting research may gain more insight from the data by incorporating some of the theories and methods typically used in research into language production.
8
Merkel, Benjamin E. "Probabilities of Consecutive Events in Coin Flipping." University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1307442290.
Full text
9
Reza-Alikhani, Hamid-Reza. "Motion compensation for image compression : pel-recursive motion estimation algorithm." Thesis, Loughborough University, 2002. https://dspace.lboro.ac.uk/2134/33721.
Full textAbstract:
In motion pictures there is a certain amount of redundancy between consecutive frames. These redundancies can be exploited by using interframe prediction techniques. To further enhance the efficiency of interframe prediction, motion estimation and compensation, various motion compensation techniques can be used. There are two distinct techniques for motion estimation block matching and pel-recursive block matching has been widely used as it produces a better signal-to-noise ratio or a lower bit rate for transmission than the pel-recursive method. In this thesis, various pel-recursive motion estimation techniques such as steepest descent gradient algorithm have been considered and simulated.
10
TOUCAS, ARGENTERO SYLVIE. "Les exotropies consecutives : etude retrospective de 160 cas." Aix-Marseille 2, 1989. http://www.theses.fr/1989AIX20707.
Full text
11
Vartiainen, J. (Johanna). "Concentrated signal extraction using consecutive mean excision algorithms." Doctoral thesis, Oulun yliopisto, 2010. http://urn.fi/urn:isbn:9789514263491.
Full textAbstract:
Abstract
Spread spectrum communication systems may be affected by other types of signals called outliers. These coexisting signals are typically narrow (or concentrated) in the considered domain. This thesis considers two areas of outlier detection, namely the concentrated interference suppression (IS) and concentrated signal detection. The focus is on concentrated signal extraction using blind, iterative and low-complex consecutive mean excision (CME) -based algorithms that can be applied to both IS and detection.
A summary of results obtained from studying the performance of the existing IS methods, namely the CME, the forward CME (FCME) and the transform selective IS algorithms (TSISA), is presented. Accurate threshold parameter values for the FCME algorithm are defined. These accurate values are able to control the false alarm rate. The signal detection capability of the CME algorithms is studied and analyzed. It is noticed that the CME algorithms are able to detect signals, but they are not able to estimate signal parameters such as the bandwidth. The presented generic shape-based analysis leads to the limits of detection in which the concentrated signals can be detected. These limits enable checking fast whether the signal is detectable or not without time consuming computer simulations. The performance of the TSISA method is evaluated. Simulation results demonstrate that the TSISA method is able to suppress several types of concentrated interfering signals with a reasonable computational complexity.
Finally, new CME-based methods are proposed and evaluated. The proposed methods are the extended TSISA method for IS and the localization algorithm based on double-thresholding (LAD), LAD with normalized thresholds (LAD NT), LAD with adjacent cluster combining (LAD ACC) and two-dimensional (2-D) LAD methods for detection. The simulations indicate that the extended TSISA method has a good performance against several types of concentrated interfering signals. The narrowband signal detection capability of the LAD methods is studied. Numerical results show that the proposed LAD methods are able to detect and localize signals in their domain, and they are able to estimate the number of narrowband signals and their parameters, including, for example, bandwidths and signal-to-noise ratio (SNR) values. The simulations show that the LAD methods outperform the CME algorithms, and ACC and 2-D LAD methods outperform the original LAD method. The LAD methods are also proposed to be used for spectrum sensing purposes in cognitive radios.
12
Russell, Debra L. "Interpreting in legal contexts, consecutive and simultaneous interpretation." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ54808.pdf.
Full text
13
Nagaki, Aiichiro. "Control of competitive consecutive reaction in organic synthesis." 京都大学 (Kyoto University), 2005. http://hdl.handle.net/2433/144941.
Full textAbstract:
Kyoto University (京都大学)<br>0048<br>新制・課程博士<br>博士(工学)<br>甲第11597号<br>工博第2543号<br>新制||工||1346(附属図書館)<br>23240<br>UT51-2005-D346<br>京都大学大学院工学研究科合成･生物化学専攻<br>(主査)教授 吉田 潤一, 教授 杉野 目道紀, 教授 前 一廣<br>学位規則第4条第1項該当
14
MELIS, NICOLA. "Synthesis and consecutive reactions of α-aminocyclobutanone derivatives". Doctoral thesis, Università degli Studi di Cagliari, 2017. http://hdl.handle.net/11584/249599.
Full textAbstract:
The thesis deals with the development and the application of new synthetic methodologies in organic chemistry. The first part describes an organocatalytic enantioselective synthesis of α-(benzylamino) cyclobutanones by employing a tandem condensation/intramolecular rearrangement/proton transfer reaction and starting from α-hydroxycyclobutanone and a selection of benzylamines. In the second part, a practical method for the synthesis of optically active cyclobutanones α-aminoacid esters is presented, via an organocatalytic asymmetric condensation reaction between racemic α-hydroxycyclobutanone and chiral N-alkyl-α-amino ester derivatives. Therefore, an original synthetic protocol for the preparation of highly functionalized tryptamines from α-hydroxycyclobutanone and secondary arylamines via a solvent-free Brønsted acid catalysed two-step reaction sequence is reported in the third part. Finally, the last part covers the synthesis of novel bicyclic oxetanes though Paternò-Büchi reaction and their preliminary evaluation as intermediates for post-functionalization reactions.<br>The thesis deals with the development and the application of new synthetic methodologies in organic chemistry. The first part describes an organocatalytic enantioselective synthesis of α-(benzylamino) cyclobutanones by employing a tandem condensation/intramolecular rearrangement/proton transfer reaction and starting from α-hydroxycyclobutanone and a selection of benzylamines. In the second part, a practical method for the synthesis of optically active cyclobutanones α-aminoacid esters is presented, via an organocatalytic asymmetric condensation reaction between racemic α-hydroxycyclobutanone and chiral N-alkyl-α-amino ester derivatives. Therefore, an original synthetic protocol for the preparation of highly functionalized tryptamines from α-hydroxycyclobutanone and secondary arylamines via a solvent-free Brønsted acid catalysed two-step reaction sequence is reported in the third part. Finally, the last part covers the synthesis of novel bicyclic oxetanes though Paternò-Büchi reaction and their preliminary evaluation as intermediates for post-functionalization reactions.
15
He, Yuan William. "A corpus-assisted study on modal verbs in consecutive interpreting." Thesis, University of Macau, 2018. http://umaclib3.umac.mo/record=b3953519.
Full text
16
Eraslan, Seyda. "International knowledge transfer in turkey the consecutive interpreter's role in context." Doctoral thesis, Universitat Rovira i Virgili, 2011. http://hdl.handle.net/10803/37342.
Full textAbstract:
This thesis aims to explore the complex role of consecutive interpreters in relation to context. Context shapes how interpreters are positioned within an interaction, conceived of as a multi-level framework comprising the textual level, the interactional level, and the institutional level. The empirical focus is interpreting in seminars run by a Turkish public institution and supported by an international organization in the framework of the country’s development towards EU accession. The case study relies on the triangulation of several types of data, different research methods and settings in order to provide a deeper understanding of the interpreter’s role in context. In accordance with the fieldwork strategy, the focus is on naturally occurring data, including user and interpreter surveys, interviews, and video-recordings of interpreted interactions. The findings of the study reveal that there may be a gap between the general role definitions of interpreters and the strategies they are expected to adopt. User expectations vary depending on situational factors and the role perceptions of interpreters do not necessarily match reality. The analysis of the interpreter’s role in two different events exhibiting a varying degree of formality and interactivity but sharing the same institutional context, interpreting mode, and interpreter, demonstrates the influence of context on the interpreter’s role.
17
Ayik, Mehmet. "Exploiting consecutive ones structure in the set partitioning problem." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2000. http://handle.dtic.mil/100.2/ADA387501.
Full text
18
Mehmetcik, Erdal. "Speech Enhancement Utilizing Phase Continuity Between Consecutive Analysis Windows." Master's thesis, METU, 2011. http://etd.lib.metu.edu.tr/upload/12613605/index.pdf.
Full textAbstract:
It is commonly accepted that the induced noise on DFT phase spectrum has a negligible effect on speech intelligibility for short durations of analysis windows, as the early intelligibility studies pointed out. This fact is confirmed by recent intelligibility studies as well. Based on this phenomenon, classical speech enhancement algorithms do not modify DFT phase spectrum and only make changes in the DFT magnitude spectrum. However, in recent studies it is also indicated that these classical speech enhancement algorithms are not capable of improving the intelligibility scores of noise degraded speech signals. In other words, the contained information in a noise degraded signal cannot be increased by classical enhancement methods. Instead the ease of listening, i.e. quality, can be improved. Hence additional effort can be made to increase the amount of quality improvement using both DFT magnitude and DFT phase. Therefore if the performances of the classical methods are to be improved in terms of speech quality, the effect of DFT phase on speech quality needs to be studied.
In this work, the contribution of DFT phase on speech quality is investigated through some simulations using an objective quality assessment criterion. It is concluded from these simulations that, the phase spectrum has a significant effect on speech quality for short durations of analysis windows. Furthermore, phase values of low frequency components are found to have the largest contribution to this quality improvement. Under the motivation of these results, a new enhancement method is proposed which modifies the phase of certain low frequency components as well as the magnitude spectrum. The proposed algorithm is implemented in MATLAB environment. The results indicate that the proposed system improves the performance of the classical methods in terms of speech quality.
19
Patel, Vandita. "Perfect powers that are sums of consecutive like powers." Thesis, University of Warwick, 2017. http://wrap.warwick.ac.uk/95153/.
Full textAbstract:
This thesis is concerned with finding integer solutions to certain Diophantine equations. In doing so, we will use a variety of techniques. Unfortunately, we are not able to mention all of them - there are many techniques in solving Diophantine equations! Combining analytic methods with classic and modern algebraic approaches proves fruitful in a number of cases.
20
Martin, Patrice. "Fibrose retroperitoneale consecutive aux derives de l'ergot de seigle." Nantes, 1990. http://www.theses.fr/1990NANT046M.
Full text
21
Niedzialomski, Amanda Jean. "Consecutive radio labelings and the Cartesian product of graphs." Diss., University of Iowa, 2013. https://ir.uiowa.edu/etd/4886.
Full textAbstract:
For k∈{Z}+ and G a simple connected graph, a k-radio labeling f:VG→Z+ of G requires all pairs of distinct vertices u and v to satisfy |f(u)-f(v)|≥ k+1-d(u,v). When k=1, this requirement gives rise to the familiar labeling known as vertex coloring for which each vertex of a graph is labeled so that adjacent vertices have different "colors". We consider k-radio labelings of G when k=diam(G). In this setting, no two vertices can have the same label, so graphs that have radio labelings of consecutive integers are one extreme on the spectrum of possibilities; graphs that can be labeled with such a labeling are called radio graceful. In this thesis, we give four main results on the existence of radio graceful graphs, which focus on Hamming graphs (Cartesian products of complete graphs) and a generalization of the Petersen graph. In particular, we prove the existence of radio graceful graphs of arbitrary diameter, a result previously unknown. Two of these main results show that, under certain conditions, the tth Cartesian power Gt of a radio graceful graph G is also radio graceful. We will also speak to occasions when Gt is not radio graceful despite G being so, as well as some partial results about necessary and sufficient conditions for a graph G so that Gt is radio graceful.
22
Khairallah, Maureen. "Effect of load reductions over consecutive sets on repetition performance /." View online, 2009. http://repository.eiu.edu/theses/docs/32211131565118.pdf.
Full text
23
Schürch, Roland. "Review of 197 consecutive free flap reconstructions in the lower extremity /." [S.l.] : [s.n.], 2009. http://www.ub.unibe.ch/content/bibliotheken_sammlungen/sondersammlungen/dissen_bestellformular/index_ger.html.
Full text
24
Li, Xiaobin. "Preparedness to teach, a comparison between consecutive and concurrent education students." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp04/MQ33406.pdf.
Full text
25
Pütz, Volker, Matthias Weise, Rüdiger von Kummer, and Georg Gahn. "Effective Treatment with Abciximab for Consecutive Bilateral Middle Cerebral Artery Occlusion." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2014. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-135290.
Full text
26
RONCALLA, WILFREDO BARDALES. "ON THE LOWER BOUND FOR THE MAXIMUM CONSECUTIVE SUB-SUMS PROBLEM." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2013. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=23833@1.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO<br>COORDENAÇÃO DE APERFEIÇOAMENTO DO PESSOAL DE ENSINO SUPERIOR<br>PROGRAMA DE EXCELENCIA ACADEMICA<br>O Problema das Sub-somas Consecutivas Máximas (MCSP) surge em cenários de interesse teórico e prático, por exemplo, no casamento aproximado de padrões, identificação de proteínas e análise de dados
estatísticos apenas para nomear alguns. Dada uma sequência de n números reais não negativos, O MCSP consiste em calcular as somas consecutivas máximas de tamanho 1 até n. Como existem implementações triviais que permitem encontrar o máximo para um comprimento fixo, existe um procedimento quadrático simples que permite resolver o MCSP. Apesar dos esforços dedicados ao problema, não é conhecido nenhum algoritmo significativamente melhor que a solução simples. Portanto, uma pergunta natural é se existe um limite inferior superlinear para o MCSP. Neste trabalho reportamos nossas pesquisas no sentido de provar tal limite.<br>The Maximum Consecutive Subsums Problem (MCSP) arises in scenarios of both theoretical and practical interest, for example, approximate pattern matching, protein identification and analysis of statistical data to cite a few. Given a sequence of n non-negative real numbers, The MCSP asks for the computation of the maximum consecutive sums of lengths 1 through n. Since trivial implementations allow to compute the maximum for a fixed length value, it follows that there exists a naive quadratic procedure to solve the MCSP. Notwithstanding the effort devoted to the problem, no algorithm is known which is significantly better than the naive solution. Therefore, a natural question is whether there exists a superlinear lower bound for the MCSP. In this work we report our research in the direction of proving such a
ower bound.
27
Pütz, Volker, Matthias Weise, Rüdiger von Kummer, and Georg Gahn. "Effective Treatment with Abciximab for Consecutive Bilateral Middle Cerebral Artery Occlusion." Karger, 2006. https://tud.qucosa.de/id/qucosa%3A27636.
Full text
28
Tedeschi, Beatrice. "Note-taking in consecutive interpretation; advantages and disadvantages of various techniques." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8131/.
Full textAbstract:
The objective of this thesis is to investigate which contexts should be used for different kinds of note-taking and to study the evolution of the various types of note-taking. Moreover, the final aim of this thesis is to understand which method is used most commonly during the interpreting process, with a special focus on consecutive and community interpreting in the sector of public service and healthcare.
The belief that stands behind this thesis is that the most complete method is Rozan’s, which is also the most theorized and used by interpreters. Through the analysis of the different rules of this practice, the importance of this method is shown. Moreover, the analysis demonstrates how these techniques can assist the interpreters in their jobs.
This thesis starts from an overview of what note-taking means in the different settings of interpreting and a short history of note-taking is presented. The section that follows analyzes three different well-known types of note-taking methods outside the interpreting environment, that is: linear, non-linear and shorthand. Subsequent to the comparison, Rozan’s 7 principles are analyzed.
To authenticate this thesis and the hypotheses herein, data was collected through a survey that was conducted on a sample of a group of graduated students in Linguistic and Intercultural Mediation at the University of Bologna “Scuola Superiore di Lingue Moderne per Interpreti e Traduttori”.
29
Notodarmojo, Suprihanto. "Modelling phosphorus transport in soil and groundwater with two consecutive reactions." Thesis, Notodarmojo, Suprihanto (1992) Modelling phosphorus transport in soil and groundwater with two consecutive reactions. PhD thesis, Murdoch University, 1992. https://researchrepository.murdoch.edu.au/id/eprint/51421/.
Full textAbstract:
A one-dimensional model of phosphorus transport in soils and groundwater applicable for steady state or transient unsaturated waterflow conditions has been developed. Convective transport, hydrodynamic dispersion and time-dependent phosphorus sorption are accounted for in the model formulation. Time-dependent sorption of phosphorus is considered to follow the empirical model of Barrow and Shaw (1979), which can be described by S = k.Cnt.m The assumed sorption model allows model parameters to be obtained by independent batch and column experiments.
Numerical techniques were used to solve the solute transport equations. For the steady state model, a correction to the numerical dispersion to improve the numerical solution is presented. Analytical solutions for a simplified case are also presented and used to test the numerical solution. For the transient mode 1, numerical solutions of water and solute transport are tested against published data. Parameter sensitivity analysis conducted for the steady state model shows that influent concentration and the parameter k strongly affect the initial breakthrough time for the solute.
The above solute transport equations which assume that the contact time between the entire soil in the column and solute starts when the solute is introduced into the column are also corrected for, by initiating the contact time for every segment in the column when the soil solution is greater than zero. Numerical solutions of the solute transport equations with corrected and non-corrected contact time are also compared. For the range of laboratory soil column experiments, it was found that the difference is small.
Batch experiments and miscible displacement experiments using soil column techniques and sectioned columns were conducted to verify the applicability of the model. For steady state condition, P transport under saturated and unsaturated waterflow conditions were examined. Miscible displacement experiments using soils which had been previously waterlogged for 30 days to see the effect of waterlogging were also conducted. For transient waterflow condition, solute and water transport during infiltration was investigated. Gavin and Joel sandy soils from the Bassendean soil system (Western Australia) and 3 different volcanic soils from Bandung (Indonesia) were used.
Experimental results show that Barrow and Shaw's sorption model can be used to describe phosphorus sorption in batch experiments. The transport model formulated in this study adequately describes the movement of phosphorus in Australian sandy soils, and one of the Indonesian soils. The steady state model, however, fails to simulate the phosphorus movement in other Indonesian soils. In most cases, experimental breakthrough lags behind theoretical curve. The failure of the model is due to the different conditions between continuous miscible displacement experiment in the soil columns and batch shaking experiments. It is recommended that a procedure to carry out batch experiments which minimizes the effect of the presence of antecedent anions and soil-to-solution ratio be developed.
30
O'Reilly, Małgorzata Marzena. "Necessary conditions for the variant optimal design of linear consecutive systems." Title page, contents and summary only, 2001. http://web4.library.adelaide.edu.au/theses/09PH/09pho668.pdf.
Full textAbstract:
"October 2001." Bibliography: leaves 99-103. Establishes several sets of conditioning relating to the variant optimal deign of linear consecutive-k-out-of-n systems and includes a review of existing research in the theory of variant optimal design of linear consecutive-k-out-of-n systems.
31
Chang, Li-Wen. "Investigating note-taking in consecutive interpreting : using the concept of visual grammar." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/investigating-notetaking-in-consecutive-interpreting--using-the-concept-of-visual-grammar(51a04db9-f880-45cf-9976-b6cd1cfffb14).html.
Full textAbstract:
Interpreting studies has so far tended to concentrate on simultaneous interpreting over the consecutive mode. Note-taking – an integral part of consecutive interpreting – has therefore received very little scholarly attention. As an indispensable tool in consecutive interpreting, note-taking plays an important role in supporting the interpreter’s memory. This study argues, however, that the interpreter's notes should not be viewed merely as a memory storage tool, but as a third visual language with its own logic and meaning-making practices that need interpreting. The way in which interpreters read their notes is explored here from the perspective of Social Semiotics for two reasons. Firstly, Social Semiotics conceptualises signs as meaning-making resources which are realized in specific communicative contexts to convey specific communicative intentions – unlike previous approaches to note-taking, that have tended to categorise signs as static constituents of relatively finite sign codes. Secondly, Social Semiotics not only accounts for how written language is used in notes, but also how the pictorial component of communication is encoded and interpreted through interpreter’s notes. The interpreter, as a viewer, has to make use of semiotic resources deployed in the notes in order to reconstruct the information given by the speaker and to produce the target speech for the audience. Therefore, the interpreters’ note-reading stage, based on the interaction between signs, can be conceptualised by reference to the concept of visual grammar. This study draws on visual grammar (Kress and van Leeuwen 2006) to analyse interpreter’s notes with a view to gaining a better understanding of how linguistic and visual semiotic resources are deployed in the process of note-taking. Insight into interpreters’ meaning-making practices and note-taking patterns is gained through an experimental study of the notes produced by nine qualified, practising conference interpreters, during a consecutive interpreting task from English into Chinese. The patterns identified in my data set are then compared with the established prescriptive approaches to note-taking training – which are typically based on relatively stable correspondences between note-taking signs/symbols and their meaning. The analysis focuses on certain elements of the source speech (concepts that can be noted down through the use of vectors, geometrical shapes, specific classificational structures, margin, and salience) as reflected in the notes. The way in which interpreters read their notes involves the interaction between two core modes, such as image and language, and a range of sub-modes, such as vectors, geometrical shapes, composition, framing, salience and calligraphy. The results of the analysis indicate that the way in which interpreters arrange the contents of their notes reflects the depth of the information processing effort required by the note-taking process. The findings suggest that the narrative structure in notes seems to assist interpreters in retrieving information at a micro, lexical level, whereas the visual structure would appear to assist interpreters in retrieving information at a macro, contextual level, e.g. in representing the hierarchies of information value, constructing the structure of rendition, and showing the importance of specific signs.
32
Gladbach, Anja. "Individual fitness correlates in consecutive years of pair bond in Upland Geese." Diss., lmu, 2011. http://nbn-resolving.de/urn:nbn:de:bvb:19-134889.
Full text
33
Kim, Seongil. "Difficult uses of perfect with waw-consecutive in 1 and 2 Samuel." Theological Research Exchange Network (TREN), 1998. http://www.tren.com.
Full text
34
Coda, Angelica. "Le disfluenze e la percezione degli ascoltatori. Valutazione di tre interpretazioni consecutive." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amslaurea.unibo.it/8242/.
Full textAbstract:
This study aims at exploring listeners’ perception of disfluencies, i.e. ungrammatical pauses, filled pauses, repairs, false starts and repetitions, which can irritate listeners and impede comprehension. As professional communicators, conference interpreters should be competent public speakers. This means that their speech should be easily understood by listeners and not contain elements that may be considered irritating.
The aim of this study was to understand to what extent listeners notice disfluencies and consider them irritating, and to examine whether there are differences between interpreters and non-interpreters and between different age groups.
A survey was therefore carried out among professional interpreters, students of interpreting and people who regularly attend conferences. The respondents were asked to answer a questionnaire after listening to three speeches: three consecutive interpretations delivered during the final exams held at the Advanced School of Languages, Literature, Translation and Interpretation (SSLLTI) in Forlì. Since conference interpreters’ public speaking skills should be at least as good as those of the speakers at a conference, the speeches were presented to the listeners as speeches delivered during a conference, with no mention of interpreting being made.
The study is divided into five chapters. Chapter I outlines the characteristics of the interpreter as a professional communicator. The quality criterion “user-friendliness” is explored, with a focus on features that make a speech more user-friendly: fluency, intonation, coherence and cohesion. The Chapter also focuses on listeners’ quality expectations and evaluations. In Chapter II the methodology of the study is described. Chapter III contains a detailed analysis of the texts used for the study, focusing on those elements that may irritate listeners or impede comprehension, namely disfluencies, the wrong use of intonation and a lack of coherence or cohesion. Chapter IV outlines the results of the survey, while Chapter V presents our conclusions.
35
Liu, Yu-Ru, and 劉育儒. "The Influence from Consecutive and Non-consecutive Unexpected Earnings on Future Returns." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/w962pu.
Full textAbstract:
碩士<br>國立高雄大學<br>金融管理學系碩士班<br>106<br>The gambler’s fallacy and hot hand effect have been extensively explored and studied in the past. This paper utilizes the Taiwanese sample to test whether the gambler’s fallacy and the hot hand effect affect the anomalous returns earned by using standardized unexpected earnings (SUE). The empirical results show that investors possess the gambler’s fallacy when facing the consecutive SUE. Such behavior can be exploited to earn significant risk-adjusted returns by constructing a zero-investment portfolio. Buying the longest consecutive positive SUE with the highest SUE and selling the longest consecutive negative SUE with the lowest SUE earns 1.512%, per month. This profit cannot be explained by various asset pricing models. We further uncovers that such profit possibly stems from limited attention of investors.
36
Makwarela, Vhangani Petrus. "The consecutive in Venda." Thesis, 2014. http://hdl.handle.net/10210/9777.
Full text
37
Mathibela, Matlhodi Ammania. "The consecutive in Setswana." Thesis, 2014. http://hdl.handle.net/10210/11787.
Full text
38
Chang, Hsun-Wen, and 張薰文. "Optimal Assignments of Consecutive-k Systems." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/70809039762557548152.
Full textAbstract:
博士<br>國立交通大學<br>資訊工程系<br>88<br>A consecutive-k system consists of n components arranged in a line. A consecutive-k-out-of-n:F (con(k/n:F)) system fails if and only if some consecutive k components are all failed. A consecutive-k-out-of-n:G (con(k/n:G)) system works if and only if some consecutive k components are all working. Consecutive-k systems are used in several applications, such as telecommunication, space relay stations, monitoring systems, and so on. That is why they have attracted many researchers.
In 1982, Derman, Lieberman and Ross proposed the optimal assignment problem which is to assign the n functionally exchangeable components to the n positions in a line to maximize the system reliability. The dissertation first addresses the existence of invariant series systems. It is known that a consecutive-k-out-of-n:G system has an invariant optimal assignment if and only if k￡n￡2k. In Chapter 2, we discuss the consecutive-ki-out-of-ni:G series system with ki ￡ ni ￡ 2ki and completely characterize the existence of invariant optimal assignments.
Many consecutive-k systems, however, do not have invariant optimal assignments. At the present, we consider heuristic algorithms for optimal assignments. In Chapter 3, we summarize our knowledge of the combinatorial case (p=1/2) and the uniform case (0<p<1), propose the new half-line case (p31/2), present some new results and conjectures, and use our extensive computer-generated data to give counterexamples to some plausible conjectures for con(k/n:F) systems.
After we have studied the structural Birnbaum importance on the cases p=1/2 and p31/2, we look into the rare-event case (pR0) in Chapter 4 to complete the spectrum of examining uniform Birnbaum importance over the whole range of p. Moreover, we propose the path importance to strengthen the rare-event case in Chapter 5.
39
Chang, Jen-Chun, and 張仁俊. "Reliability Algorithms for Consecutive-k Systems." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/36061694916231560147.
Full textAbstract:
博士<br>國立交通大學<br>資訊工程系<br>89<br>Reliability algorithms are useful tools in reliability analyses and reliability optimizations. In this dissertation, we study and design efficient reliability algorithms for consecutive-k-out-of-n:F systems, weighted-consecutive-k-out-of-n:F systems, f-or-consecutive-k-out-of-n:F systems, f-within-consecutive-k-out-of-n:F systems, consecutive-k-out-of-n:F networks, consecutive-k-out-of-n:F flow networks, consecutive-k-r-out-of-n:DFM systems, and other reliability systems which do not have the “consecutive-k” property. We use two general approaches to develop our reliability algorithms: the first is the recursive equation approach, and second is the Markov chain approach. By carefully designed recursive equations and heterogeneous Markov chains, and under the supports of computation theory, automata theory, and sparse matrix data structures, our reliability algorithms are simpler and (or) more efficient than other published corresponding ones.
In addition, we think that designing reliability algorithms case by case is a messy work. Therefore, we propose a “regular reliability model”. It is not a system, but a tool to specify the structures of various systems which may not have the “consecutive-k” property. When analyzing the reliability of a system, we first specify the system structure with the regular reliability model, and apply the automata theory to derive a minimal state heterogeneous Markov chain, then an efficient reliability algorithm can be obtained by implementing the Markov chain approach with the sparse matrix data structure.
English Abstract ii
Acknowledgements iii
Contents iv
1. Introduction 1
1.1 Historical background 1
1.2 The problems and the methodologies 3
1.3 Outline of this dissertation 4
2. The consecutive-k-out-of-n:F system 6
2.1 Assumptions and notation 8
2.2 The linear consecutive-k-out-of-n:F system 10
2.2.1 Shanthikumar’s O(nk) time algorithm 11
2.2.2 Hwang’s O(n) time algorithm 12
2.2.3 A linear component replacement algorithm 13
2.3 The circular consecutive-k-out-of-n:F system 16
2.3.1 Hwang’s O(nk2) time algorithm 17
2.3.2 Antonopoulou and Papastavridis’s O(n2k) time algorithm 18
2.3.3 Wu and Chen’s O(nk) time algorithm 19
2.3.4 Hwang’s O(nk) time algorithm 20
2.3.5 Wu and Chen’s second O(nk) time algorithm 21
2.3.6 A simpler O(nk) time algorithm 22
2.3.7 A circular component replacement algorithm 25
3. The weighted-consecutive-k-out-of-n:F system 30
3.1 Assumptions and notation 32
3.2 The linear weighted-consecutive-k-out-of-n:F system 34
3.2.1 Wu and Chen’s O(n) time algorithm 35
3.3 The circular weighted-consecutive-k-out-of-n:F system 37
3.3.1 Wu and Chen’s incomplete O(min{n, k}·n) time algorithm 38
3.3.2 An O(Tn) time algorithm 41
4. The f-or-consecutive-k-out-of-n:F system ……………………………...…… 46
4.1 Assumptions and notation 47
4.2 Chang, Cui and Hwang’s O(f2k2n) time algorithm 49
4.3 An O(fkn) time algorithm 52
4.4 Another O(fkn) time algorithm 53
4.5 An O((fk)kn) time algorithm 55
5. The f-within-consecutive-k-out-of-n:F system 59
5.1 Assumptions and notation 61
5.2 Hwang and Wright’s O(23kn) time algorithm 62
5.3 An O( n) time algorithm 64
6. The consecutive-k-out-of-n:F network 76
6.1 Assumptions and notation 78
6.2 Chen, Hwang and Li’s algorithm for k = 2 80
6.3 An O(2kn) time algorithm 83
7. The consecutive-k-out-of-n:F flow network 91
7.1 Assumptions and notation 92
7.2 An O( n) time f-flow-reliability algorithm 93
7.3 An O(k) time on-line routing algorithm 96
8. The consecutive-k-r-out-of-n:DFM system 99
8.1 Assumptions and notation 101
8.2 Koutras’s O((k+r)n) time algorithm 102
8.3 An O((k+r)n) time algorithm 103
8.4 An O(n) time algorithm 108
9. The regular reliability model 111
9.1 The regular reliability model 113
9.2 The F reliability model and the G reliability model 115
9.3 The relations among F models, G models, and regular models 118
9.4 An efficient reliability algorithm for the regular model 120
9.5 Applications 121
9.5.1 The f-or-consecutive-k:F model 121
9.5.2 The f-within-consecutive-k:F model 123
9.5.3 The k-mod-q model 125
9.5.4 Logic circuits 126
10. Conclusions 128
Bibliography 130
Vita 141
Publications 143
40
Tsai, Yi-lin, and 蔡宜霖. "Threshold group testing with consecutive positives." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/66300153934466049026.
Full textAbstract:
碩士<br>國立高雄大學<br>應用數學系碩士班<br>102<br>Threshold group testing introduced by Damaschke (2006) is a generalization of classical group testing where a group test yields a positive (negative) outcome if it contains at least u (at most l) positive items, and an arbitrary outcome for otherwise.
Motivated by applications to DNA sequencing, group testing with consecutive positives has been proposed by Balding and Torney (1997) and Colbourn (1999) where n items are linearly ordered and all up to d positive items are consecutive in the order. In this thesis, we use threshold-constrained group tests to deal with group testing with consecutive positives. We prove that all positive items can be identifed in ⌈log2(⌈
41
"Sums of Squares of Consecutive Integers." Master's thesis, 2010. http://hdl.handle.net/2286/R.I.8629.
Full textAbstract:
abstract: ABSTRACT This thesis attempts to answer two questions based upon the historical observation that 1^2 +2^2 +· · ·+24^2 = 70^2. The first question considers changing the starting number of the left hand side of the equation from 1 to any perfect square in the range 1 to 10000. On this question, I attempt to determine which perfect square to end the left hand side of the equation with so that the right hand side of the equation is a perfect square. Mathematically, Question #1 can be written as follows: Given a positive integer r with 1 less than or equal to r less than or equal to 100, find all nontrivial solutions (N,M), if any, of r^2+(r+1)^2+···+N^2 =M^2 with N,M elements of Z+. The second question considers changing the number of terms on the left hand side of the equation to any fixed whole number in the range 1 to 100. On this question, I attempt to determine which perfect square to start the left hand side of the equation with so that the right hand side of the equation is a perfect square. Mathematically, Question #2 can be written as follows: Given a positive integer r with 1 less than or equal to r less than or equal to 100, find all solutions (u, v), if any, of u^2 +(u+1)^2 +(u+2)^2 +···+(u+r-1)^2 =v^2 with u,v elements of Z+. The two questions addressed by this thesis have been on the minds of many mathematicians for over 100 years. As a result of their efforts to obtain answers to these questions, a lot of mathematics has been developed. This research was done to organize that mathematics into one easily accessible place. My findings on Question #1 can hopefully be used by future mathematicians in order to completely answer Question #1. In addition, my findings on Question #2 can hopefully be used by future mathematicians as they attempt to answer Question #2 for values of r greater than 100.<br>Dissertation/Thesis<br>M.A. Mathematics 2010
42
Palfreyman, JL. "Consecutive bright pulses in the Vela pulsar." Thesis, 2012. https://eprints.utas.edu.au/16158/3/whole-palfreyman-inclpub-thesis-2012.pdf.
Full textAbstract:
We report on the discovery of consecutive bright radio pulses from the Vela pulsar, a new phenomenon that may lead to a greater understanding of the pulsar emission mechanism. This results from a total of 345 hours worth of observations of the Vela pulsar using the University of Tasmania’s 26 m radio telescope to study the frequency and statistics of abnormally bright pulses and sub-pulses. The bright pulses show a tendency to appear consecutively. The observations found two groups of six consecutive bright pulses and many groups of two to five bright pulses in a row. The strong radio emission process that produces the six bright pulses lasts between 0.4 and 0.6 seconds. The numbers of bright pulses in sequence far exceed what would be expected if individual bright pulses were independent random events. Consecutive bright pulses must be generated by an emission process that is long-lived relative to the rotation period of the neutron star.
We also confirm the existence of giant micro pulses previously observed in Vela, and also the apparent change in bright pulse occurrences after a glitch.
43
"Consecutive patterns and statistics on restricted permutations." Universitat Politècnica de Catalunya, 2004. http://www.tesisenxarxa.net/TDX-0908104-084442/.
Full text
44
S, C. H., and 石佳弘. "Multigrid Approach in two consecutive Obstacles Fluid." Thesis, 1998. http://ndltd.ncl.edu.tw/handle/25353686482144138570.
Full textAbstract:
碩士<br>國立中興大學<br>土木工程學系<br>86<br>The Multigrid method combining with the automatic, adaptive mesh
refinement technique is used to simulate the behaviors of two-
dimensional unstaedy ,incompressible ,viscous laminar flow .The
governing equations of continuity and momentum are transformed
into stream-continuity and vorticity transport equation.The
multigrid approach requires a data structure that is simple
enough to imple- mentefficiently,yet flexible enough to premit
the very complicated patterns of local mesh refinement that
would be generated by an adaptive mesh refinement strategy .The
adaptive mesh refinement criterion is based on estimates of the
first order derivative error .The finite differences method is
applied in the models.ADI(Alternating Direction Implicition)
method and SOR(Successive Over-Relaxa-tion) method are applied
in solving the continuity equatuion and vorticity equation
separately.The model is verified with an analytical solution of
potencial flow,firstly.Then it is applied to simulating one or
two consecutive obstacles fluid,and discussthe positions of
reattch point after the obstacles.In this paper,we discuss the
change of reattch point with three difference Reynold number,and
change the distance of obstacles to discuss the change of fluid
in difference situations.The model of multigrid approach
combined with automatic adaptive refinement technique can
produce an efficient and stable solution strategy for solving
the steady-state and unsteady-steady incompressible Navier-
Stokes equations.Considerable memory savings as well as a
reduction in the total CPU time are achieved. To use the local
refinementof mesh to detect the locations where sharp velocity
gradient exists.
45
chang, Ho-Yi, and 張和逸. "Efficient Approaches for Mining Consecutive Sequential Patterns." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/78324196880827314175.
Full textAbstract:
碩士<br>南台科技大學<br>資訊管理系<br>96<br>Consecutive sequential patterns exist in many applications. Air routes, ship routes, or websites browsing routes are kinds of consecutive sequential patterns. However, few studies have been done on consecutive sequential patterns. The TFA algorithm is the one of few algorithms which attempts to mine consecutive sequential patterns.
The purpose of this thesis is to improve the defects of the TFA algorithm. The TFA algorithm is one of the most efficient algorithms, but it still has two problems. First, the performance of TFA algorithm is getting worse when transaction length is getting longer. Second, it generates the consecutive sub-sequences by decompose duplicate transactions. Therefore performance of TFA algorithm can be improved.
First, we propose a new algorithm – CFP（Mining Consecutive Sequence Using Filtered and Pruning the mechanism）that is improved from TFA algorithm. Using Filtered and Pruning mechanism in earlier stage CFP algorithm accumulates the same shortened transactions of databases. CFP algorithm is very suitable to mine the sequences of databases whose record length is very long, and it will not generate the consecutive sub-sequences by decompose duplicate transactions. It only scans database four times and avoids generating any unnecessary candidate consecutive sub-sequence in mining process. The size of the databases in the real world is always greater than the size of the memory. In order to solve this problem, the CFP algorithm divides a large database into many sub-databases and mines rules from those sub-databases. The CFP algorithm only scans database four times and will not be affected by the length of frequent sub-sequences. The CFP algorithm avoids wasting a lot of I/O time and increases the efficiency and the practicability in application.
The CFP algorithm is one of the most efficient algorithms, but it still has one problem which is that CFP needs to inspect the same sub-sequence repeatedly in order to eliminate infrequent consecutive sub-sequences. Therefore performance of CFP algorithm can be improved. So we propose a new algorithm – CNP（Mining Consecutive Sequence Using New Filtered and Produce the mechanism）which uses a new filtering and producing mechanism to reduce frequency of inspection when eliminating infrequent consecutive sub-sequences.
Comprehensive experiments have been conducted to assess the performance of the proposed algorithm. The experimental results show that algorithms which we proposed outperform previous algorithms in the experiments.
46
Lan, Wei-cheng, and 藍偉誠. "Interval group testing and consecutive positives model." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/47628036901934933858.
Full textAbstract:
碩士<br>國立高雄大學<br>應用數學系碩士班<br>104<br>Cicalese et al. (2007) studied interval group testing where n items are linearly ordered, each of them is either positive or negative. In interval group testing model, each query has the form “does a set of consecutive items contain any positive item?” Motivated by applications to DNA sequencing, group testing with consecutive positives has been proposed by Balding and Torney (1997) and Colbourn (1999) where n items are linearly ordered and all positive items are consecutive in the order. In this thesis, we study one- and two-stage fault tolerant interval group testing for consecutive positives.
47
Pechenick, Eitan. "Equality of Number-Theoretic Functions over Consecutive Integers." Thesis, 2009. http://hdl.handle.net/10012/4378.
Full textAbstract:
This thesis will survey a group of problems related to certain number-theoretic functions. In particular, for said functions, these problems take the form of when and how often they are equal over consecutive integers, n and n+1. The first chapter will introduce the functions and the histories of the related problems. The second chapter will take on a variant of the Ruth-Aaron pairs problem, which asks how often sums of primes of two consecutive integers are equal. The third chapter will examine, in depth, a proof by D.R. Heath-Brown of the infinitude of consecutive integer pairs with the same number of divisors---i.e. such that d(n)=d(n+1). After that we examine a similar proof of the infinitude of pairs with the same number of prime factors---ω(n)=ω(n+1).
48
Oswald, Marcus [Verfasser]. "Weighted consecutive ones problems / vorgelegt von Marcus Oswald." 2003. http://d-nb.info/968318274/34.
Full text
49
Hsu, H. S., and 許泓森. "Modified HDA Based on Consecutive Outputs from Decoders." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/09585163401928698313.
Full textAbstract:
碩士<br>國立中正大學<br>電機工程研究所<br>92<br>Turbo-codes was presented by Berrou, Glavieux and Thitimajshima in 1993. It is attached important to all circles for its outstanding error-correcting decoding performance near SHANNON limit. Turbo-codes’ performance bases on several iterations between two decoders and it needs lots of computations in each decoder, so finding a simple and effective stopping criterion is the target we run after. In this research, we modify the Hard-Decision-Aided(HDA) stopping criterion in standard of cdma2000, presenting the Modified HDA based on consecutive outputs from decoders for stopping iteration earlier and saving time cost on iteration.
50
Li, Chia-Hui, and 李佳惠. "Consecutive Changes in Insider Holdings and Earnings Persistence." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/90750724097907723507.
Full textAbstract:
碩士<br>輔仁大學<br>會計學系碩士班<br>103<br>The literature in the past explore the issue that when those firms whose shares holdings of managers have changed and last for 2 years, does it means that managers of these firms manipulate their earnings opportunistically or signally ? Their empirical results show that holding percentage-decreasing firms manage earnings opportunistically. This study is motivated to examine the effect of consecutive changes in insider holdings on firms’ earnings persistence.
The empirical results of this study show that firms with continuous changes in insider holdings, including continuous increase or continuous decrease, have lower earnings persistence. Furthermore, the reduction of their earnings persistence is related to the magnitude of discretionary accruals. These empirical results support that those firms whose shares holdings of managers have changed and last for 2 years manage earnings opportunistically.