tilting and refined donaldson thomas invariants abstract we study tilting for the heart a of the canonical t structure of the finite dimensional derived category of the ginzburg algebra for a quiver with potential q w we give conditions on that the stable objects for a central charge on a define a sequence of simple tilts from a to a 1 on that conditions the refined donaldson thomas invariant associated to q w is independent of the chosen central charge

minimum probability of error for asynchronous gaussian multiple access channels consider a gaussian multiple access channel shared by k users who transmit asynchronously independent data streams by modulating a set of assigned signal waveforms the uncoded probability of error achievable by optimum multiuser detectors is investigated it is shown that the k user maximum likelihood sequence detector consists of a bank of single user matched filters followed by a viterbi algorithm whose complexity per binary decision is o 2 k the upper bound analysis of this detector follows an approach based on the decomposition of error sequences the issues of convergence and tightness of the bounds are examined and it is shown that the minimum multiuser error probability is equivalent in the iow noise region to that of a single user system with reduced power these results show that the proposed multiuser detectors afford important performance gains over conventional single user systems in which the signal constellation carries the entire burden of complexity required to achieve a given performance level

the two machine flowshop total completion time problem improved lower bounds and a branch and bound algorithm abstract this paper presents a branch and bound algorithm for the two machine flowshop scheduling problem with the objective of minimizing the sum of completion times the main feature of the branch and bound algorithm is a new lower bounding scheme that is based on a network formulation of the problem with extensive computational tests we demonstrate that the branch and bound algorithm can solve problems with up to 60 45 jobs where processing times are uniformly distributed in the 1 10 1 100 range

a subspace method for signature waveform estimation in synchronous cdma systems synchronous code division multiple access cdma techniques possess intrinsic protection against co channel interference due to orthogonal codes employed and thus offers higher capacity than existing frequency division multiple access fdma or time division multiple access tdma systems in the presence of multipath however each signal is subject to frequency selective fading and the orthogonality condition does not necessarily hold leading to increased cross correlation in these scenarios multiuser detection need to be performed to suppress interference and recover the message symbols to implement such a technique explicit knowledge of the nonorthogonal signature waveforms of all users is required we propose a blind estimation scheme that provides closed form estimates of the signature waveforms by exploiting the structure information of the data output in particular we show that the subspace of the data matrix contains sufficient information for unique determination of the signature waveforms based on this observation a multiple signal classification music like algorithm is derived performance analysis of the new approach is also presented

the two machine flowshop scheduling problem with sequence independent setup times new lower bounding strategies abstract the two machine flowshop environment with sequence independent setup times has been intensely investigated both from theoretical and practical perspectives in the scheduling literature nevertheless very scant attention has been devoted to deriving effective lower bounding strategies in this paper we propose new lower bounds for the total completion time minimization criterion these bounds are based on three relaxation schemes namely the waiting time based relaxation scheme the single machine based relaxation scheme and the lagrangian relaxation scheme extensive computational study carried on instances with up to 500 jobs reveals that embedding the waiting time based bounding strategy within the lagrangian relaxation framework yields the best performance while requiring negligible cpu time

stronger lagrangian bounds by use of slack variables applications to machine scheduling problems lagrangian relaxation is a powerful bounding technique that has been applied successfully to manynp hard combinatorial optimization problems the basic idea is to see annp hard problem as an easy to solve problem complicated by a number of nasty side constraints we show that reformulating nasty inequality constraints as equalities by using slack variables leads to stronger lower bounds the trick is widely applicable but we focus on a broad class of machine scheduling problems for which it is particularly useful we provide promising computational results for three problems belonging to this class for which lagrangian bounds have appeared in the literature the single machine problem of minimizing total weighted completion time subject to precedence constraints the two machine flow shop problem of minimizing total completion time and the single machine problem of minimizing total weighted tardiness

the two machine flowshop total completion time problem branch and bound algorithms based on network flow formulation abstract we consider the flowshop problem on two machines with sequence independent setup times to minimize total completion time large scale network flow formulations of the problem are suggested together with strong lagrangian bounds based on these formulations to cope with their size filtering procedures are developed to solve the problem to optimality we embed the lagrangian bounds into two branch and bound algorithms the best algorithm is able to solve all 100 job instances of our testbed with setup times and all 140 job instances without setup times thus significantly outperforming the best algorithms in the literature

identification of linear stochastic systems via second and fourth order cumulant matching the identification problem for time invariant single input single output linear stochastic systems driven by non gaussian white noise is considered the system is not restricted to be minimum phase and it is allowed to contain all pass components a least squares criterion that involves matching the second and the fourth order cumulant functions of the noisy observations is proposed knowledge of the probability distribution of the driving noise is not required an order determination criterion that is a modification of the akaike information criterion is also proposed strong consistency of the proposed estimator is proved under certain sufficient conditions simulation results are presented to illustrate the method

the space of stability conditions on the local projective plane we study the space of stability conditions on the total space of the canonical bundle over the projective plane we explicitly describe a chamber of geometric stability conditions and show that its translates via autoequivalences cover a whole connected component we prove that this connected component is simply connected we determine the group of autoequivalences preserving this connected component which turns out to be closely related to 1 3 finally we show that there is a submanifold isomorphic to the univer sal covering of a moduli space of elliptic curves with 1 3 level struc ture the morphism is 1 3 equivariant and is given by solutions of picard fuchs equations this result is motivated by the notion of stability and by mirror symmetry

the two machine total completion time flow shop problem in this paper we study the np hard scheduling problem of minimizing total completion time in a two machine flow shop five known lower bounds are discussed and two new ones are presented a new dominance criterion is also proposed several versions of a branch and bound method are derived by applying both individually and combined these lower bounds a heuristic procedure is also presented that uses a constructive o n2 time method which computes a good starting solution together with a neighborhood search based on pairwise interchanges computational results show that the exact method can handle problems of up to 30 jobs in size within a reasonable amount of time and that the heuristic procedure has an average error of less than 0 5 from the optimal value and less than 2 7 from the lower bound

asymptotically optimal estimation of ma and arma parameters of non gaussian processes from high order moments a description is given of an asymptotically minimum variance algorithm for estimating the ma moving average and arma autoregressive moving average parameters of non gaussian processes from sample high order moments the algorithm uses the statistical properties covariances and cross covariances of the sample moments explicitly a simpler alternative algorithm that requires only linear operations is also presented the latter algorithm is asymptotically minimum variance in the class of weighted least squares algorithms

stability conditions on k3 surfaces this article contains a description of one connected component of the space of stability conditions on the bounded derived category of coherent sheaves on a complex algebraic k3 surface

noniterative subspace tracking a rank one spherical subspace update that is appropriate for subspace based methods like music and minimum norm is introduced this noniterative highly parallel numerically stabilized subspace update is closely related to rank one eigenstructure updating however a rank one subspace update involves less computation than simple rank one correlation accumulation moreover the frequency tracking capabilities of the noniterative subspace update are virtually identical to and in some case more robust than the more computationally expensive eigen based methods

stability conditions and quantum dilogarithm identities for dynkin quivers abstract we study the fundamental groups of the exchange graphs for the bounded derived category d q of a dynkin quiver q and the finite dimensional derived category d n q of the calabi yau n ginzburg algebra associated to q in the case of d q we prove that its space of stability conditions in the sense of bridgeland is simply connected as an application we show that the donaldson thomas type invariant associated to q can be calculated as a quantum dilogarithm function on its exchange graph in the case of d n q we show that the faithfulness of the seidel thomas braid group action which is known for q of type a or n 2 implies the simply connectedness of the space of stability conditions

braid group actions on derived categories of coherent sheaves this paper gives a construction of braid group actions on the derived category of coherent sheaves on a variety x the motivation for this is m kontsevich s homological mirror conjecture together with the occurrence of certain braid group actions in symplectic geometry one of the main results is that when dim x geq 2 our braid group actions are always faithful we describe conjectural mirror symmetries between smoothings and resolutions of singularities which lead us to find examples of braid group actions arising from crepant resolutions of various singularities relations with the mckay correspondence and with exceptional sheaves on fano manifolds are given moreover the case of an elliptic curve is worked out in some detail

t structures on some local calabi yau varieties abstract let z be a smooth fano variety satisfying the condition that the rank of the grothendieck group of z is one more than the dimension of z let z denote the total space of the canonical line bundle of z considered as a non compact calabi yau variety we use the theory of exceptional collections to describe t structures on the derived category of coherent sheaves on z the combinatorics of these t structures is determined by a natural action of an affine braid group closely related to the well known action of the artin braid group on the set of exceptional collections on z

mutations vs seiberg duality abstract for a quiver with potential derksen weyman and zelevinsky defined in h derksen j weyman a zelevinsky quivers with potentials and their representations i mutations arxiv 0704 0649v2 math ra a combinatorial transformation mutations mukhopadhyay and ray on the other hand tell us how to compute seiberg dual quivers for some quivers with potentials through a tilting procedure thus obtaining derived equivalent algebras in this text we compare mutations with the concept of seiberg duality given by s mukhopadhyay k ray seiberg duality as derived equivalence for some quiver gauge theories arxiv hep th 0309191v2 concluding that for a certain class of potentials the good ones mutations coincide with seiberg duality therefore giving derived equivalences

an improved branch and bound algorithm for the two machine total completion time flow shop problem we consider the two machine total completion time flow shop scheduling problem this problem is known to be np hard in the strong sense an improved lagrangean relaxation approach is proposed two new dominance criteria are introduced to curtail the enumeration tree a branch and bound algorithm capable of solving to optimality medium size problem instances is presented

blind channel estimation for long code multiuser cdma systems in cdma systems with long codes the users signatures change in each bit period impeding the estimation of the time invariant multipath parameters in this paper correlation matching methods are employed to blindly estimate those multipath parameters for given code sequences the output correlation matrix parameterized by the unknown channel coefficients is compared with its instantaneous approximation by minimizing the frobenius norm of the resulting error matrix the channel parameters can be estimated up to a complex scalar ambiguity both batch and adaptive algorithms are derived under the assumption of i i d code sequences identifiability up to a complex scalar ambiguity for each channel is guaranteed and the asymptotic convergence of the proposed algorithm is established furthermore step size selection for the adaptive version is investigated when only the code sequence of the user of interest is available a single user receiver is also derived simulation results verify those claims and provide comparisons with other methods

the harder narasimhan system in quantum groups and cohomology of quiver moduli methods of harder and narasimhan from the theory of moduli of vector bundles are applied to moduli of quiver representations using the hall algebra approach to quantum groups an analog of the harder narasimhan recursion is constructed inside the quantized enveloping algebra of a kac moody algebra this leads to a canonical orthogonal system the hn system in this algebra using a resolution of the recursion an explicit formula for the hn system is given as an application explicit formulas for betti numbers of the cohomology of quiver moduli are derived generalizing several results on the cohomology of quotients in linear algebra type situations