text stringlengths 1 3.05k | source stringclasses 4
values |
|---|---|
a similar question was asked on mathematica. stackexchange. my answer over there evolved and got quite long in the end, so i'll summarize the algorithm here. abstract the basic idea is : find the label. find the borders of the label find a mapping that maps image coordinates to cylinder coordinates so that it maps the ... | https://api.stackexchange.com |
, { - 1 } } ] ] ; bottomborder = deletesmallcomponents [ imageconvolve [ labelmask, { { - 1 }, { 1 } } ] ] ; leftborder = deletesmallcomponents [ imageconvolve [ labelmask, { { 1, - 1 } } ] ] ; rightborder = deletesmallcomponents [ imageconvolve [ labelmask, { { - 1, 1 } } ] ] ; this is a little helper function that fi... | https://api.stackexchange.com |
to approximate the arc sine, because i couldn't get the optimization working with arcsin directly. the clip calls are my ad - hoc attempt to prevent complex numbers during the optimization. there's a trade - off here : on the one hand, the function should be as close to an exact cylindrical mapping as possible, to give... | https://api.stackexchange.com |
##mean = mean [ masktopoints [ bottomborder ] ] [ [ 2 ] ] ; solution = findminimum [ total [ errorfunction ], { { c1, 0 }, { c2, rightmean - leftmean }, { c3, 0 }, { c4, 0 }, { cx, ( leftmean + rightmean ) / 2 }, { top, topmean }, { r, rightmean - leftmean }, { height, bottommean - topmean }, { tilt1, 0 }, { tilt2, 0 }... | https://api.stackexchange.com |
results as shown above. manually assisted version the algorithm above is full - automatic. no adjustments required. it works reasonably well as long as the picture is taken from above or below. but if it's a frontal shot, the radius of the jar can not be estimated from the shape of the label. in these cases, i get much... | https://api.stackexchange.com |
i found a good way of thinking intuitively of kalman gain $ k $. if you write $ k $ this way $ \ displaystyle \ quad \ \ bf { k _ k } = \ bf { p _ k ^ - \, h _ k ^ { \ rm t } ( h _ k p _ k ^ - \, h _ k ^ { \ rm t } + r _ k ) ^ { - 1 } } = \ bf { \ frac { p _ k ^ - \, h _ k ^ { \ rm t } } { h _ k p _ k ^ - \, h _ k ^ { ... | https://api.stackexchange.com |
state ( $ x _ k⁻ $ ). | https://api.stackexchange.com |
it's for on - the - go, to select which device is the host or slave : the otg cable has a micro - a plug on one side, and a micro - b plug on the other ( it cannot have two plugs of the same type ). otg adds a fifth pin to the standard usb connector, called the id - pin ; the micro - a plug has the id pin grounded, whi... | https://api.stackexchange.com |
i found this page answers your question clearly. i quote the relevant parts below. the bc1. 2 outlines three distinct types of usb port and two key monikers. a " charging " port is one that delivers currents higher than 500ma. a " downstream " port signals data as per usb 2. 0. the bc1. 2 specification also establishes... | https://api.stackexchange.com |
line. on the other hand, a voltage dividing network clamps the voltage at a safe 2. 5v. for more details, check out the page i sourced or take a look at usb. org's pdf describing the usb battery charging bc 1. 2 specification | https://api.stackexchange.com |
let me first answer why i think c + + interfaces to mpi have generally not been overly successful, having thought about the issue for a good long time when trying to decide whether we should just use the standard c bindings of mpi or building on something at higher level : when you look at real - world mpi codes ( say,... | https://api.stackexchange.com |
actually satisfies all of these. i think if it were a header - only library, it'd be a lot more popular in practice. it would also help if it supported post - mpi 1. 0 functions, but let's be honest : this covers most of what we need most of the time. | https://api.stackexchange.com |
the simple answer is that unlike rgb, hsv separates luma, or the image intensity, from chroma or the color information. this is very useful in many applications. for example, if you want to do histogram equalization of a color image, you probably want to do that only on the intensity component, and leave the color comp... | https://api.stackexchange.com |
i'm not entirely familiar with what's now done for cubatures ( multidimensional integration ), so i'll restrict myself to quadrature formulae. there are a number of effective methods for the quadrature of oscillatory integrals. there are methods suited for finite oscillatory integrals, and there are methods for infinit... | https://api.stackexchange.com |
##llatory integrals. i will edit this answer later if i remember them. | https://api.stackexchange.com |
understanding why this works turns out to be quite deep. this answer is kind of a long story, but there's no maths. at the end ('a more formal approach') there is an outline of how the maths works : skip to that if you don't want the story. insect geometry consider a little insect or something who lives on the surface ... | https://api.stackexchange.com |
wrong : the paper is flat, even when we think it's curved. what i mean by this is that there is no measurement you can do, on the surface of the paper which will tell you if it is'curved'or'flat '. so now shake the paper, and cause one of the insects to fall off and land on a tomato. this insect starts doing its geomet... | https://api.stackexchange.com |
a critical thing about the difference between intrinsically flat and intrinsically curved surfaces which i've mentioned in passing above : the area inside shapes is different. what this means is that the surface is stretched or compressed : in the case of the tomato there is more area inside triangles than there is for... | https://api.stackexchange.com |
##nsically curve the paper so that any further extrinsic curvature involves intrinsic curvature too, which paper does not like to do. why all this is important as i said at the start, this is quite a deep question. the mathematics behind this is absolutely fascinating and beautiful while being relatively easy to unders... | https://api.stackexchange.com |
r _ 2 $ are called the two principal curvatures of the surface. then the quantity $ k = r _ 1r _ 2 $ is called the gaussian curvature of the surface, and the theorema egregium says that this quantity is intrinsic to the surface : you can measure it just by measuring angles et cetera on the surface. the reason the theor... | https://api.stackexchange.com |
here : i have not defined how you compute $ r $, and i've not shown that there is not some other curve you can draw along the paper which has $ r = 0 $ apart from the obvious one. ) one of the reasons that this is all quite interesting is that this maths is the beginning of the maths you need to understand general rela... | https://api.stackexchange.com |
the first rom devices had to have information placed in them via some mechanical, photolithographic, or other means ( before integrated circuits, it was common to use a grid where diodes could be selectively installed or omitted ). the first major improvement was a " fuse - prom " - - a chip containing a grid of fused ... | https://api.stackexchange.com |
would be typical of eeprom devices ( many eeprom devices would take 1 - 10ms to write a byte, and 5 - 50ms to erase ; flash devices would generally require less than 100us to write, but some required hundreds of milliseconds to erase ). i don't know that there's a clear dividing line between flash and eeprom, since som... | https://api.stackexchange.com |
to answer the question as asked, for people googling. for bed6, in python : # contigs. tsv contians chromosome names and lengths in two columns for line in open ( " contigs. tsv " ) : fields = line. strip ( ). split ( " \ t " ) print fields [ 0 ], ". ", " contig ", " 1 ", str ( fields [ 1 ] ), ". ", " + ", ". ", " id =... | https://api.stackexchange.com |
" ) ) block _ sizes = map ( int, fields [ 10 ]. split ( ", " ) ) for ( block, ( bstart, blen ) ) in enumerate ( zip ( block _ starts, block _ sizes ) ) : bend = start + bstart + blen print contig, " bed ", " block ", str ( start + bstart ), str ( bend ), score, strand, ". ", " id = % s _ % i ; parent = % s " % ( name, ... | https://api.stackexchange.com |
i'd say the most well known barriers to solving $ p = np $ are relativization ( as mentioned by ran g. ) natural proofs - under certain cryptographic assumptions, rudich and razborov proved that we cannot prove $ p \ neq np $ using a class of proofs called natural proofs. algebrization - by scott aaronson and avi wigde... | https://api.stackexchange.com |
your example makes me think of graphs. imagine some nice, helpful fellow came along, and made a big graph of every math concept ever, where each concept is one node and related concepts are connected by edges. now you can take a copy of this graph, and color every node green based on whether you " know " that concept (... | https://api.stackexchange.com |
choice. so, the solution to your problem is straightforward - use a more appropriate search algorithm! immediately obvious is breadth - first search. this means, when reading an article ( or page, or book chapter ), don't rush off to look up every new term as soon as you see it. circle it or make a note of it on a sepa... | https://api.stackexchange.com |
##jkstra or a *. when you have the list of topics, can you order them by how promising they seem? chances are you can, and chances are, your intuition will be right. another thing to do - since ultimately, your aim is to link up with some green nodes, why not try to prioritize topics which seem like they would be getti... | https://api.stackexchange.com |
nope. alcohols consist of an - $ \ ce { oh } $ group bonded to a saturated carbon ( $ \ mathrm { sp ^ 3 } $ hybridized, no multiple bonds ). iupac says : alcohols compounds in which a hydroxy group, - $ \ ce { oh } $, is attached to a saturated carbon atom $ \ ce { r3coh } $. the term'hydroxyl'refers to the radical spe... | https://api.stackexchange.com |
. | https://api.stackexchange.com |
see ( sorry, i would have put that in a comment but i've registered just to post this so i can't post comments yet ). but since i'm writing it as an answer, i'll also write the method : $ $ e = \ frac { m _ { 00 } + m _ { 11 } } { 2 } ; f = \ frac { m _ { 00 } - m _ { 11 } } { 2 } ; g = \ frac { m _ { 10 } + m _ { 01 }... | https://api.stackexchange.com |
want the positive singular values, just take the absolute value of $ s _ y $. | https://api.stackexchange.com |
elephant, rhinoceros, & c all have much thicker legs in proportion. the answer, i think, lies in the fact that the animals you mention all evolved as cursorial animals ( that is, they run to escape predators ). less mass in the lower leg means it swings easier, so the animal can run faster. there are two things you're ... | https://api.stackexchange.com |
the important thing when choosing iterative solvers is the spectrum of the operator, see this paper. however, there are so many negative results, see this paper where no iterative solver wins for all problems and this paper in which they prove they can get any convergence curve for gmres for any spectrum. thus, it seem... | https://api.stackexchange.com |
translating code to mathematics given a ( more or less ) formal operational semantics you can translate an algorithm's ( pseudo - ) code quite literally into a mathematical expression that gives you the result, provided you can manipulate the expression into a useful form. this works well for additive cost measures suc... | https://api.stackexchange.com |
often apply without thinking or talking about it. with a similar translation as above we come to the following formula : $ \ qquad \ displaystyle c _ { \ text { swaps } } ( a ) = \ sum _ { i = 0 } ^ { n - 2 } \ sum _ { j = 0 } ^ { n - i - 2 } c _ { 5, 9 } ( a ^ { ( i, j ) } ) $. $ a ^ { ( i, j ) } $ denotes the array's... | https://api.stackexchange.com |
^ { n - 2 } \ sum _ { j = 0 } ^ { n - i - 2 } 1 = \ frac { n ( n - 1 ) } { 2 } = \ binom { n } { 2 } $. but can this happen, i. e. is there an $ a $ for this upper bound is attained? as it turns out, yes : if we input an inversely sorted array of pairwise distinct elements, every iteration must perform a swap¹. therefo... | https://api.stackexchange.com |
_ { \ text { swaps } } ] = \ frac { 1 } { n! } \ sum _ { a } \ operatorname { inv } ( a ) $. lucky for us, the average number of inversions has been determined to be $ \ qquad \ displaystyle \ mathbb { e } [ c _ { \ text { swaps } } ] = \ frac { 1 } { 2 } \ cdot \ binom { n } { 2 } $ which is our final result. note tha... | https://api.stackexchange.com |
psi ) $. note that the operation cost $ c _ { \ circ } $ may not be constant but depend on the values of $ e _ 1 $ and $ e _ 2 $ and evaluation of expressions may change the state in many languages, so you may have to be flexible with this rule. sequence given a program p as sequence of programs q ; r, you add the cost... | https://api.stackexchange.com |
program p of the form while a do q end, assign costs $ \ qquad \ displaystyle c _ p ( \ psi ) \ \ \ qquad \ = c _ a ( \ psi ) + \ begin { cases } 0 &, \ mathtt { a } \ text { evaluates to false under } \ psi \ \ c _ q ( \ psi / \ mathtt { a } ) + c _ p ( \ psi / \ mathtt { a ; q } ) &, \ text { else } \ end { cases } $... | https://api.stackexchange.com |
_ { 1, 4 } ( \ psi ) = \ lceil \ log _ 2 \ psi ( x ) \ rceil \ cdot ( c _ > + c _ { + = } + c _ / ) + c _ > $, reintroducing the full state symbolically ; if $ \ psi = \ { \ dots, x : = 5, \ dots \ } $, then $ \ psi ( x ) = 5 $. procedure calls given a program p of the form m ( x ) for some parameter ( s ) x where m is... | https://api.stackexchange.com |
_ { \ leq } + \ begin { cases } c _ { \ text { return } } &, n _ 0 \ leq 1 \ \ c _ { \ text { return } } + c _ * + c _ { \ text { call } } + c _ { \ text { fac } } ( \ { n : = n _ 0 - 1 \ } ) &, \ text { else } \ end { cases } \ end { align * } $ note that we disregard global state, as fac clearly does not access any. ... | https://api.stackexchange.com |
to a constant factor and in the limit ( roughly speaking, " for big $ n $ " ). this is ( often ) fair since abstract statements have some ( generally unknown ) costs in reality, depending on machine, operating system and other factors, and short runtimes may be dominated by the operating system setting up the process i... | https://api.stackexchange.com |
that's a grommet, not to be confused with gromit. gromit, of wallace and gromit fame. | https://api.stackexchange.com |
the simplest manner is to not use a wald test, but rather an lrt with a reduced model lacking the factor of interest : dds = deseq ( dds, test = " lrt " reduced = ~ geno + geno : treatment ) the above would give you results for treatment regardless of level while still accounting for a possible interaction ( i. e., a "... | https://api.stackexchange.com |
great picture and great find. but unfortunately i don't think that is a new species of bird... or even a bird at all! it looks like a hummingbird hawk - moth, macroglossum stellatarum. here you can really see the'little trunk'( as you described it ) known as a proboscis, which it uses to feed on flowers. fun fact : it'... | https://api.stackexchange.com |
first of all i wish to thanks aron ahmadia for pointing me to this thread. as for opencl in scientific code : opencl is meant to be a low - level api, thus it is crucial to wrap this functionality in some way in order to reach a reasonable productivity. moreover, as soon as several compute kernels are involved, code ca... | https://api.stackexchange.com |
is also partly due to the fact that cuda is tailored to the architecture of nvidia products, while opencl represents in some sense a reasonable compromise between different many - core architectures. overall, viennacl is at present slower than magma, particularly at blas level 3. the reasons is the different focus of v... | https://api.stackexchange.com |
##u is minimized. these savings can significantly outweigh any performance penalty ( if any ) compared to cusp and magma. ( it has also be mentioned in the thread on unit testing that code development time is a precious resource in science. ) there are certainly a number of ideological issues ( e. g. cuda vs. opencl, b... | https://api.stackexchange.com |
a few possibilities : falcon try falcon and falcon - unzip. these are designed exactly for your problem and your data : not falcon if you think you have assembled haplotypes ( which seems reasonable to expect given enough coverage ), you should be able to see the two haplotypes by just doing all pairwise alignments of ... | https://api.stackexchange.com |
there are a number of well - studied strategies ; which is best in your application depends on circumstance. improve worst case runtime using problem - specific insight, you can often improve the naive algorithm. for instance, there are $ o ( c ^ n ) $ algorithms for vertex cover with $ c < 1. 3 $ [ 1 ] ; this is a hug... | https://api.stackexchange.com |
$ 5 $ plus the optimum " ) bounds on the error. for many problems it is open how well they can be approximated. there are some that can be approximated arbitrarily well in polynomial time, while others are known to not allow that ; check the theory of polynomial - time approximation schemes. refer to algorithmics for h... | https://api.stackexchange.com |
not sure if this is what you're asking, but yes, when the battery is connected, an electric field wave travels from the battery down the wires to the load. part of the electrical energy is absorbed by the load ( depending on ohm's law ), and the rest is reflected off the load and travels back to the battery, some is ab... | https://api.stackexchange.com |
the differential equation for a pendulum is $ $ \ ddot { \ phi } ( t ) = - \ frac { g } { l } \ cdot \ sin { \ phi ( t ) } $ $ if you solve this, you will get $ $ \ omega = \ sqrt { \ frac { g } { l } } $ $ or $ $ t _ { 1 / 2 } = \ pi \ sqrt { \ frac { l } { g } } $ $ $ $ g = \ pi ^ 2 \ frac { l } { t _ { 1 / 2 } ^ 2 }... | https://api.stackexchange.com |
according kinetics, mechanism, and spectroscopy of the reversible binding of nitric oxide to aquated iron ( ii ). an undergraduate text book reaction revisited the correct structure is $ \ ce { [ fe ^ { iii } ( h _ 2o ) _ 5 ( no ^ { - } ) ] ^ { 2 + } } $ for many years it was thought that iron was reduced to $ \ ce { f... | https://api.stackexchange.com |
on the top of this answer, you can see a section of updated links, where artificial intelligence, machine intelligence, deep learning or and database machine learning progressively step of the grounds of traditional signal processing / image analysis / computer vision. below, variations on the original answer. for a sh... | https://api.stackexchange.com |
to natural adversarial examples. future research is required to enable robust generalization to this hard imagenet test set. 2019 / 05 / 03 : deep learning : the final frontier for signal processing and time series analysis? " in this article, i want to show several areas where signals or time series are vital " 2018 /... | https://api.stackexchange.com |
things work, what is the content of a piece of data, etc. deep learning used too require ( huge ) well - tagged databases. any time you do craftwork on single or singular images ( i. e. without a huge database behind ), especially in places unlikely to yield " free user - based tagged images " ( in the complementary se... | https://api.stackexchange.com |
error. with all due respect to " deep learning ", think about " mass production responding to a registered, known, mass - validable or expected behaviour " versus " singular piece of craft ". none is better ( yet ) in a single index scale. both may have to coexist for a while. however, deep learning pervades many novel... | https://api.stackexchange.com |
i can think of a few courses that would need calculus, directly. i have used bold face for the usually obligatory disciplines for a computer science degree, and italics for the usually optional ones. computer graphics / image processing, and here you will also need analytic geometry and linear algebra, heavily! if you ... | https://api.stackexchange.com |
the hough transform and the radon transform are indeed very similar to each other and their relation can be loosely defined as the former being a discretized form of the latter. the radon transform is a mathematical integral transform, defined for continuous functions on $ \ mathbb { r } ^ n $ on hyperplanes in $ \ mat... | https://api.stackexchange.com |
. van vliet, a short introduction to the radon and hough transforms and how they relate to each other, quantitative imaging group, imaging science & technology department, tu delft the authors argue that although the two are very closely related ( in their original definitions ) and equivalent if you write the hough tr... | https://api.stackexchange.com |
based on your description, i may have found the article you originally saw, or at least one very similar. researchers from dartmouth college published a paper $ \ mathrm { ^ 1 } $ in which they report, among other things, the results of viewing sunlit white paper through two 3 meter lengths of plexiglass ; one filled w... | https://api.stackexchange.com |
off the top of head as a medical professional i can imagine the following mechanisms ( everything is just speculative reasoning ) : insects don't have blood. instead, they have hemolymph whose primary role is not oxygen transport ( they have an additional tracheal system for this purpose ), but rather that of nutrients... | https://api.stackexchange.com |
##tes. [ a ] - - meaning that is has secreted peptides in their hemolymph that protect them [ b ] - - there are phagocytes, somewhat similar to tissue magrophages in humans, but the rest of the cell chains in immune response in vertrebrates, like t - and b - cells, are completely missing. those are responsible for the ... | https://api.stackexchange.com |
the key / value / query formulation of attention is from the paper attention is all you need. how should one understand the queries, keys, and values the key / value / query concept is analogous to retrieval systems. for example, when you search for videos on youtube, the search engine will map your query ( text in the... | https://api.stackexchange.com |
j ) ^ t $ $ so we only have to compute $ g ( h _ j ) $ $ m $ times and $ f ( s _ i ) $ $ n $ times to get the projection vectors and $ e _ { ij } $ can be computed efficiently by matrix multiplication. this is essentially the approach proposed by the second paper ( vaswani et al. 2017 ), where the two projection vector... | https://api.stackexchange.com |
applies another attention where $ q $ is from the target sequence and $ k, v $ are from the source sequence. for recommendation systems, $ q $ can be from the target items, $ k, v $ can be from the user profile and history. | https://api.stackexchange.com |
it's a bad idea because vector needs to allocate as many objects in space as there are rows in your matrix. allocation is expensive, but primarily it is a bad idea because the data of your matrix now exists in a number of arrays scattered around memory, rather than all in one place where the processor cache can easily ... | https://api.stackexchange.com |
it's hard to ignore the wealth of statistical packages available in r / cran. that said, i spend a lot of time in python land and would never dissuade anyone from having as much fun as i do. : ) here are some libraries / links you might find useful for statistical work. there's plenty of other stuff out there, but this... | https://api.stackexchange.com |
you pretty much have to buy pre - made modules, you can't expect to wire up your own transmitter / receiver from a few transistors and a crystal, rf circuit design is unforgiving and all but requires a custom pcb ( or custom ic ) to do. you could probably build your own rf module on a pcb if you did some work, but at t... | https://api.stackexchange.com |
bwa mem is newer, faster, and [ should be ] more accurate, particularly for longer reads. from the bwa man page ( presumably in heng li's own words ) : bwa is a software package for mapping low - divergent sequences against a large reference genome, such as the human genome. it consists of three algorithms : bwa - back... | https://api.stackexchange.com |
this is a bit complex. basically, there are a number of limiting factors : the io lines from the microcontroller ( i. e. the analog and digital pins ) have both an aggregate ( e. g. total ) current limit, and an per - pin limit : from the atmega328p datasheet. however, depending on how you define the arduino " pins ", ... | https://api.stackexchange.com |
for any arduino based off the atmega328 microcontroller. | https://api.stackexchange.com |
since this question has multiple sub - questions in edits, comments on answers, etc., and these have not been addressed, here goes. matched filters consider a finite - energy signal $ s ( t ) $ that is the input to a ( linear time - invariant bibo - stable ) filter with impulse response $ h ( t ) $, transfer function $... | https://api.stackexchange.com |
| h ( t ) | ^ 2 \, \ mathrm dt } = \ mathbb e $ $ with equality occurring if $ h ( t ) = \ lambda s ( t _ 0 - t ) $ with $ \ lambda > 0 $ where from ( 2 ) we get that $ \ lambda = 1 $, that is, the filter with impulse response $ h ( t ) = s ( t _ 0 - t ) $ produces the maximal response $ y ( t _ 0 ) = \ mathbb e $ at t... | https://api.stackexchange.com |
( 0 ) = \ mathbb e $ at time $ t = 0 $. furthermore, $ $ y ( t ) = \ int _ { - \ infty } ^ \ infty s ( t - \ tau ) s ( - \ tau ) \, \ mathrm d \ tau = \ int _ { - \ infty } ^ \ infty s ( \ tau - t ) s ( \ tau ) \, \ mathrm d \ tau = r _ s ( t ) $ $ is the autocorrelation function of the signal $ s ( t ) $. it is well -... | https://api.stackexchange.com |
signal $ s ( t ) $ plus additive white gaussian noise with two - sided power spectral density $ \ frac { n _ 0 } { 2 } $ is processed through a filter with impulse response $ h ( t ) $, then the output noise process is a zero - mean stationary gaussian process with autocorrelation function $ \ frac { n _ 0 } { 2 } r _ ... | https://api.stackexchange.com |
, the filter that is matched to $ s ( t ) $ at time $ t _ 0 $!! note that $ \ sigma ^ 2 = \ mathbb en _ 0 / 2 $. if we use this matched filter for our desired sample time, then at other times $ t _ 1 $, the snr will be $ y ( t _ 1 ) / \ sigma < y ( t _ 0 ) / \ sigma = \ sqrt { \ frac { 2 \ mathbb e } { n _ 0 } } $. cou... | https://api.stackexchange.com |
maximum. " for nrz data and rectangular pulses, the matched filter impulse response is also a rectangular pulse. the integrate - and - dump circuit is a correlator whose output equals the matched filter output only at the sampling instants, and not in - between. see the figure below. if you sample the correlator output... | https://api.stackexchange.com |
a quick and general answers without mathematical abstractions. there are several options to impose boundary conditions, e. g. strictly speaking the galerkin method requires that you choose a set of basis functions which satisfy the bc of the problem ( e. g. via basis recombination and / or splitting of the approximatio... | https://api.stackexchange.com |
this is a well - framed question and a very useful thing to understand. korrok is correct to refer you to von neumann analysis and leveque's book. i can add a bit more to that. i'd like to write a detailed answer, but at the moment i only have time for a short one : with $ \ alpha = \ beta = 1 / 2 $, you get a method t... | https://api.stackexchange.com |
first, to dispel a possible cognitive dissonance : reasoning about infinite structures is not a problem, we do it all the time. as long as the structure is finitely describable, that's not a problem. here are a few common types of infinite structures : languages ( sets of strings over some alphabet, which may be finite... | https://api.stackexchange.com |
coinduction looks at destructors. note how the duality not only changes smaller to larger but also inputs to outputs. for example, the reason the flipflop and from definitions above are well - formed is that the corecursive call is guarded by a call to the cocons constructor in both cases. where statements about induct... | https://api.stackexchange.com |
lts $ \ mathscr { b } $ if every transition of the second lts admits a corresponding transition in the first. formally, let $ s $ be the disjoint union of the states of the two lts, $ l $ the ( common ) set of labels and $ \ rightarrow $ the transition relation. the relation $ r \ subseteq s \ times s $ is a simulation... | https://api.stackexchange.com |
. ch. 13. [ website ] [ amazon ] eduardo gimenez. an application of co - inductive types in coq : verification of the alternating bit protocol. in workshop on types for proofs and programs, number 1158 in lecture notes in computer science, pages 135 – 152. springer - verlag, 1995. [ google books ] eduardo gimenez and p... | https://api.stackexchange.com |
what i'd go with is essentially jason r's " random resampler ", which in turn is a presampled - signal based implementation of yoda's stochastic sampling. i've used simple cubic interpolation to one random point between each two samples. for a primitive synth sound ( decaying from a saturated non - bandlimited square -... | https://api.stackexchange.com |
i we did the experiment. ( early results indicate that dipping may win, though the final conclusion remains uncertain. ) $ \ mathrm { h _ 2o } $ ice bath canning jar thermometer pot of boiling water stop watch there were four trials, each lasting 10 minutes. boiling water was poured into the canning jar, and the spoon ... | https://api.stackexchange.com |
152 & 66. 67 & 149 & 65 \ \ 9'& 153 & 67. 22 & 151 & 66. 11 & 150 & 65. 56 & 146 & 63. 33 \ \ 10'& 151 & 66. 11 & 149 & 65 & 147 & 63. 89 & 143 & 61. 67 \ \ \ hline \ end { array } $ $ | https://api.stackexchange.com |
given an image $ i ( m, n ) $ with $ m, n $ integers, the interpolation of that image at any arbitrary point $ m ', n'$ can be written as $ $ \ tilde { i } ( m ', n') = \ sum _ { m = \ left \ lfloor m'\ right \ rfloor - w + 1 } ^ { \ left \ lfloor m'\ right \ rfloor + w } \ \ sum _ { n = \ left \ lfloor n'\ right \ rfl... | https://api.stackexchange.com |
choice is basically a trade - off between frequency filtering ( attenuation of sidelobes ), spatial localization ( width of mainlobe ) and reducing other effects such as ringing ( gibbs effect ), aliasing, blurring, etc. for example, a kernel with oscillations such as the sinc kernel and the lanczos4 kernel will introd... | https://api.stackexchange.com |
new addition : a big list of freely available online courses on algebraic geometry, from introduction to advanced topics, has been compiled in this other answer. and a digression on motivation for studying the subject along with a self - learning guide of books is in this new answer. there are other similar questions, ... | https://api.stackexchange.com |
affine, euclidean and projective cases ( over the real and complex numbers ) is the first actual algebraic geometry problem that every student is introduced to : the classification of all possible canonical forms of polynomials of degree 2 ( either under affine transformations or isometries in variables $ ( x, y ) $, o... | https://api.stackexchange.com |
surfaces of complex analysis with the differential geometry of real surfaces, the algebraic topology of 2 - manifolds and the algebraic geometry of algebraic curves! here one finds wonderful relations and deep results like all the consequences of the concept of degree, index and curvature, linking together the mileston... | https://api.stackexchange.com |
numbers of generic zero loci of characteristic classes over the variety. besides all this, since the foundational immense work of alexandre grothendieck, the subject has got very solid and abstract foundations so powerful to fuse algebraic geometry with number theory, as many were hoping before. thus, the abstract alge... | https://api.stackexchange.com |
i. e. quantum field theory with general relativity ; even abstract and categorical algebraic geometry play a role in topics like homological mirror symmetry and quantum cohomology, which originated in physics ). therefore, the kind of problems mathematicians try to solve in algebraic geometry are related to much of eve... | https://api.stackexchange.com |
motivates you enough to dive into this deep ocean of the mathematical world and to corroborate it yourself. best luck! | https://api.stackexchange.com |
consider the following : clam - project. org : clam ( c + + library for audio and music ) is a full - fledged software framework for research and application development in the audio and music domain. it offers a conceptual model as well as tools for the analysis, synthesis and processing of audio signals. marf : marf ... | https://api.stackexchange.com |
i think that you need a liftover chain file to transform your coordinates. you can obtain such a file using bcftools consensus with the - c parameter : - c, - - chain < file > write a chain file for liftover then you can use it to transform coordinates in various genomic formats using crossmap. | https://api.stackexchange.com |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.