Given a parametrized family of finite frames, we consider the optimization problem of finding the member of this family whose coefficient space most closely contains a given data vector. This nonlinear least squares p...
详细信息
Single-particle cryo-electron microscopy (cryo-EM) has recently joined X-ray crystallography and NMR spectroscopy as a high-resolution structural method for biological macromolecules. Cryo-EM was selected by Nature Me...
详细信息
We reformulate the renormalization group (RNG) and the e{open}-expansion for derivation of turbulence models. The procedure is developed for the Navier-Stokes equations and the transport equations for the kinetic ener...
详细信息
During the last few years, neural machine translation (NMT) as a notable branch of machine translation has been increasing its popularity both in research and in practice. In particular, neural machine translation bet...
详细信息
This paper studies a class of probabilistic models on graphs, where edge variables depend on incident node variables through a fixed probability kernel. The class includes planted constraint satisfaction problems (CSP...
详细信息
In this paper,we propose a simple energy decaying iterative thresholding algorithm to solve the two-phase minimum compliance *** material domain is implicitly represented by its characteristic function,and the problem...
详细信息
In this paper,we propose a simple energy decaying iterative thresholding algorithm to solve the two-phase minimum compliance *** material domain is implicitly represented by its characteristic function,and the problem is formulated into a minimization problem by the principle of minimum complementary *** prove that the energy is decreasing in each *** effective continuation schemes are proposed to avoid trapping into the local *** results on 2D isotropic linear material demonstrate the effectiveness of the proposed methods.
This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerprogrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- fe...
详细信息
ISBN:
(数字)9783540478676
ISBN:
(纸本)9783540436768
This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerprogrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.
We explore time-based solvers for linear standing-wave problems, especially the oscillatory Helmholtz equation. Here, we show how to accelerate the convergence properties of timestepping. We introduce a new time-based...
We explore time-based solvers for linear standing-wave problems, especially the oscillatory Helmholtz equation. Here, we show how to accelerate the convergence properties of timestepping. We introduce a new time-based solver that we call phase-adjusted time-averaging (PATA), which we couple to timestepping to form the PATA-TS solver. Numerical experiments indicate that the PATA-TS solver is faster than the PATA solver and timestepping by a factor of 1.2 and 1.5 or more, respectively. We also explain why the PATA-TS solver is robust, efficient, and easy to program for a variety of practical applications.
This paper develops upper and lower bounds on the influence measure in a network, more precisely, the expected number of nodes that a seed set can influence in the independent cascade model. In particular, our bounds ...
ISBN:
(纸本)9781510860964
This paper develops upper and lower bounds on the influence measure in a network, more precisely, the expected number of nodes that a seed set can influence in the independent cascade model. In particular, our bounds exploit nonbacktracking walks, Fortuin-Kasteleyn-Ginibre type inequalities, and are computed by message passing algorithms. Nonbacktracking walks have recently allowed for headways in community detection, and this paper shows that their use can also impact the influence computation. Further, we provide parameterized versions of the bounds that control the trade-off between the efficiency and the accuracy. Finally, the tightness of the bounds is illustrated with simulations on various network models.
暂无评论