482,288 Hits in 5.8 sec

On variants of o-minimality

Dugald Macpherson, Charles Steinhorn
1996 Annals of Pure and Applied Logic  
We also wish to thank the referee fqr a very thoughtful and careful reading of the paper.  ...  Adeleke and Neumann, C-structures provide the best variant of o-minimality.  ...  The main result of Section 2, Theorem 2.3, provides some further motivation for focusing on appropriately minimal expansions of the Jordan structures as candidates for variants of o-minimal&y, and in particular  ... 
doi:10.1016/0168-0072(95)00037-2 fatcat:u5ci7cb7ofenxjejbdziml6gle

Arc minimization in finite-state decoding graphs with cross-word acoustic context

François Yvon, Geoffrey Zweig, George Saon
2004 Computer Speech and Language  
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs.  ...  The use of these techniques in concert with state minimization allows us to statically compile decoding graphs in which the acoustic models utilize a full word of cross-word context.  ...  Each Î À is a set of words, each Ò À is a set of word variants. 1.  ... 
doi:10.1016/j.csl.2003.09.006 fatcat:txb3mdxysfcuxezezb4n6dibjy

MOESM2 of Systematic comparative analysis of single-nucleotide variant detection methods from single-cell RNA sequencing data

Fenglin Liu, Yuanyuan Zhang, Lei Zhang, Ziyi Li, Qiao Fang, Ranran Gao, Zemin Zhang
2019 Figshare  
The performance measurements of variant-calling tools in different functional genomic regions for simulations based on the SMART-seq2 hepatocellular carcinoma dataset.  ...  E p i t h e l i a l c e l l F i b r o b l a s t M a l i g n a n t c eSupplementary Figure 6 . 6 Characteristics of SNVs identified by multiple variant-calling tools.  ... 
doi:10.6084/m9.figshare.10458011 fatcat:zb7i2cnrejgarietfdvwz4wzri

Scheduling on Uniform Nonsimultaneous Parallel Machines [chapter]

Liliana Grigoriu, Donald K. Friesen
2017 Operations Research Proceedings 2016  
We consider the problem of scheduling on uniform processors which may not start processing at the same time with the purpose of minimizing the maximum completion time.  ...  This results from properties of a variant of the Multifit algorithm for scheduling on uniform processors with simultaneous start times.  ...  We show that our Multifit variant for scheduling on uniform nonsimultaneous parallel machines also has a worst-case approximation bound of q when minimizing the maximum completion time.  ... 
doi:10.1007/978-3-319-55702-1_62 dblp:conf/or/GrigoriuF16 fatcat:i3bsbrqvyzhl7ovyclropjajpi

Association of variants in HTRA1 and NOTCH3 with MRI-defined extremes of cerebral small vessel disease in older subjects

2019 Brain  
In conclusion, our proof-of-concept study provides strong evidence that using a novel composite MRI-derived phenotype for extremes of small vessel disease can facilitate the identification of genetic variants  ...  We identified significant associations of a common intronic variant in HTRA1, rs2293871 using single variant association testing (Pdiscovery = 8.21 × 10-5, Preplication = 5.25 × 10-3, Pcombined = 4.72  ...  The generation and management of the exome sequencing data for the Rotterdam Study was executed by the Human Genotyping Facility of the Genetic Laboratory of the Department of Internal Medicine, Erasmus  ... 
doi:10.1093/brain/awz024 pmid:30859180 pmcid:PMC6439324 fatcat:rnfxzokbkbdxtpmry3fsp3pc3m

Variants of the Two Machine Flow Shop Problem connected with factorization of matrix functions

H. Bart, L.G. Kroon
1996 European Journal of Operational Research  
maximum infeasibility of the jobs is to be minimized, whereas in the sum-variant the objective is to minimize the sum of the infeasibilities of the jobs.  ...  The processing times of all operations are given and fixed. The processing times of O) and 0 2 are denoted by s i and tj.  ...  On the other hand, in our variants of 2MFSP a deadline is given and the objective is to minimize the infeasibilities of the jobs, thereby taking into account the given deadline.  ... 
doi:10.1016/0377-2217(94)00340-8 fatcat:kb42xnredna67mytkjvnwosge4

A Novel Approach to Increase Efficiency of OSS/BSS Workflow Planning and Design [chapter]

Tetiana Kot, Andrey Reverchuk, Larysa Globa, Alexander Schill
2012 Lecture Notes in Business Information Processing  
Additionally, mobile operators tend to minimize time of service provision, using constantly improving communication technologies and software applications.  ...  on the service planning stage, such as numerical values of execution time and resources, required for that, and also document and information flows, supporting service provision, and on the other hand  ...  After the time minimization procedure is realized, only one implementation variant for each operation is selected.  ... 
doi:10.1007/978-3-642-30359-3_13 fatcat:tw7jckbkrfb7fbz4aadcyeddne

Synthesis and implementation of recursive linear shift-variant digital filters

Nian-Chyi Huang, J. Aggarwal
1983 IEEE Transactions on Circuits and Systems  
The first technique is based on the minimization of a distance function that is defined as the sum of squared error resulting from the approximation of a given impulse response by a degenerate impulse  ...  Based on this observation, our problem reduces to two basic steps: (1) approximation of a given impulse response by a degenerate sequence; (2) realization of the degenerate sequence as a recursive shift-variant  ...  NONLINEAR MINIMIZATION TECHNIQUE One difficulty in the implementation of shift-variant digital filters is that many filter coefficients need to be stored.  ... 
doi:10.1109/tcs.1983.1085278 fatcat:isyodybjwrgqzbjxxgvquvdvgi

Crystallographic analysis on the primary and secondary extension twin variants in Mg alloys

Q L Huang, G Chen, R L Xin
2018 IOP Conference Series: Materials Science and Engineering  
The detwinning of PT ed and ST also have such type of orientation. Moreover, the PT ing and the selected ST have almost opposite shear directions with the angle of 151.1 o .  ...  {10-12}-{10-12} double twins (DTs) are observed in AZ31 Mg alloys after one path uniaxial tension.  ...  Acknowledgements This project was supported financially by the National Natural Science Foundations of China (Project No. 51571045 and 51421001).  ... 
doi:10.1088/1757-899x/375/1/012021 fatcat:bdeaggndcrbkzga6o7yr6b6a3q

A bloated FM-index reducing the number of cache misses during the search [article]

Szymon Grabowski, Aleksander Cisłak
2015 arXiv   pre-print
The second presented variant requires O(n n) bits of space.  ...  In this paper, we are interested in speeding up the FM-index by working on q-grams rather than individual characters, at the cost of using more space.  ...  We propose two variants, one with O(m/|CL|+log n log m) misses in the worst case, but also O(n log 2 n) bits of space, which makes it hardly practical, the other with O(m/|CL| + (m/q ) log n) misses on  ... 
arXiv:1512.01996v1 fatcat:yoyfcqcmgfct5m5hf3e6v3t3im

Level of adaptability of five conic map projection variants on Macedonian national area as state map projection

2018 Micro, Macro & Mezzo Geoinformation  
The goal of this paper is the comparison of the state projection with all variants of conformal cone projections while analyzing the results.  ...  From the obtained results, it is defined that the average linear deformation in the first variant is 1.98 cm/km, in the second variant is 1.96 cm/km, in the third variant 2.61 cm/km, in the fourth variant  ...  ., 2012): radius of the point that lies on the southern parallel r n -the radius of the point that lies on the northern parallel r o -the radius of the parallel with the minimal linear scale f o -the geographical  ... 
doaj:6d569dbd79394c77817b6bbf01e8a253 fatcat:goqyc5ly7ngnrcs2legofycezi

Using syncmers improves long-read mapping [article]

David Pellow, Abhinav Dutta, Ron Shamir
2022 bioRxiv   pre-print
In tests on simulated and real long read data from a variety of genomes, the syncmer-based algorithms reduced unmapped reads by 20-60% at high compression while using less memory.  ...  A key idea in mapping algorithms is to sketch sequences with their minimizers.  ...  We work with the nucleotide alphabet: Σ = {A, C, G, T }. k-mer order: Given a one-to-one hash function on k-mers o : Σ k → R, we say that k-mer x 1 is less than x 2 if o(x 1 ) < o(x 2 ).  ... 
doi:10.1101/2022.01.10.475696 fatcat:evol4gqjzjatxlzjkejikmebie

Stochastic minimization with adaptive memory

R. Brunelli, G.P. Tecchiolli
1995 Journal of Computational and Applied Mathematics  
A common feature of random search algorithms is that little or no use is made of information on the local structure of the function to be minimized.  ...  To overcome this deficiency, we propose a random minimization algorithm with adaptive memory: the algorithm decides by itself how much of the information gathered through the process of minimizing the  ...  In fact, this problem is equivalent to the minimization of the Rayleigh functional R : 7-/--. N given by (~, H¢)u R[~b] -(O,O)n ' (9) with O E 7-/and (.,.)~ being the Herrnitean product of ~.  ... 
doi:10.1016/0377-0427(93)e0203-x fatcat:kylqymdmdrgjfgkb4jofcog3de

Early introduction and rise of the Omicron SARS-CoV-2 variant in highly vaccinated university populations

Brittany A. Petros, Jacquelyn Turcinovic, Nicole L. Welch, Laura F. White, Eric D. Kolaczyk, Matthew R. Bauer, Michael Cleary, Sabrina T. Dobbins, Lynn Doucette-Stamm, Mitch Gore, Parvathy Nair, Tien G. Nguyen (+18 others)
2022 Clinical Infectious Diseases  
Conclusions We document the rapid takeover of the Omicron variant at IHEs, reaching near-fixation within the span of 9.5-12.5 days despite lower viral loads, on average, than the previously dominant Delta  ...  Delta variant cases on college campuses, and identify lower viral loads among college affiliates harboring Omicron infections.  ...  All submitters of data may be contacted directly via Access to patient sample metadata was facilitated by the Massachusetts  ... 
doi:10.1093/cid/ciac413 pmid:35616119 fatcat:vbclpj2zzrc4xkhdbm7nmlhho4

Towards early emergent property understanding

Georg Hackenberg, Denis Bytschkow
2012 Proceedings of the 2012 Extreme Modeling Workshop on - XM '12  
In particular, when it comes to constraints on the result of interactions between distributed components (emergent properties) current software engineering approaches provide limited support.  ...  During early phases of complex systems engineering typically many structural and behavioral aspects are unclear.  ...  According to this relationship variant V1 is dominated by variant V 2 if ∀OO the following equation holds: equals ∈ A(O) ⇒ OV 1 (t) = OV 2 (t) minimize ∈ A(O) ⇒ OV 1 (t) ≥ OV 2 (t) maximize ∈ A(O) ⇒  ... 
doi:10.1145/2467307.2467315 fatcat:ikgdnhyalrcwbmbp5zzydaep5u
« Previous Showing results 1 — 15 out of 482,288 results