Given a random n-variate degree-d homogeneous polynomial f , we study the following problem:

A sum rule relation is proposed for direct CP asymmetries in B → Kπ decays. Leading terms are identical in the isospin symmetry limit, while subleading terms are equal in the flavor SU(3) and heavy quark limits. The sum rule predicts ACP(B 0 → Kπ) = −0.17±0.06 using current asymmetry measurements for the other three B → Kπ decays. A violation of the sum rule would be evidence for New Physics in...

In this paper we consider the absolute variation statistics of a composition σ = σ1 · · ·σm of n which is a measure of the sum of absolute differences between each consecutive pair of parts in a composition. This and some related statistics which we discuss, can also be interpreted within the context of bargraph polygons and bargraph walks of area n. In this context, absolute variation correspo...

We discuss a problem of handling resource reservations. The resource can be reserved for some time, it can be freed or it can be queried what is the largest amount of reserved resource during a time interval. We show that the problem has a lower bound of Ω(log n) per operation on average and we give a matching upper bound algorithm. Our solution also solves a dynamic version of the related prob...

In this talk I will motivate the the need for the constituent quark structure. I will also summarize results from the NJL model for the composites of the constituent quark and present an alternative QCD sum rule approach.

In 1985, Chor et al 2] conjectured that the only 1-resilient symmetric functions are the exclusive-or of all n variables and its negation. In this note the existence of symmetric resilient functions is shown to be equivalent to the existence of a solution to a simultaneous subset sum problem. Then, using arithmetic properties of certain binomial coeecients, an innnite class of counterexamples t...

We give an O( √ n)-approximation algorithm for the Sparsest Cut Problem on directed graphs. A näıve reduction from Sparsest Cut to Minimum Multicut would only give an approximation ratio of O( √ n log D), where D is the sum of the demands. We obtain the improvement using a novel LP-rounding method for fractional Sparsest Cut, the dual of Maximum Concurrent Flow.

In the paper we consider strongly NP-hard flow shop problem with the criterion of minimization of the sum of job’s finishing times. We present the parallel algorithm based on the scatter search method. Obtained results are compared to the best known from the literature. Superlinear speedup has been observed in the parallel calculations.

OBJECTIVES Low mean bypass graft flow (Q) and high pulsatility index (PI) measured by the transit time flow measurement method are not specific for anastomotic stenosis, but occur with competitive flow and poor coronary run-off. We hypothesized that graft compliance is responsible for these changes and that flow measured at the proximal end of the coronary bypass can be viewed as a sum of the g...

an integrated model for magnetoencephalography (meg) and functional magnetic resonance imaging (fmri) is proposed. in the proposed model, meg and fmri outputs are related to the corresponding aspects of neural activities in a voxel. post synaptic potentials (psps) and action potentials (aps) are two main signals generated by neural activities. in the model, both of meg and fmri are related to t...