DESCRIPTION Update of the 2003 U.S. Preventive Services Task Force (USPSTF) recommendation statement on screening for obesity and overweight in adults. METHODS The USPSTF reviewed new evidence on the benefits and harms of screening and primary care–feasible or referable nonsurgical weight-loss interventions. RECOMMENDATION The USPSTF recommends screening all adults for obesity. Clinicians s...

A new proportionate-type affine projection algorithm with intermittent update of the weight coefficients is proposed. It takes into account the “history” of the proportionate factors and uses a fast recursive filtering procedure. Also, the effect of using dichotomous coordinate descent iterations is investigated. Simulation results indicate that the proposed algorithm has improved performance a...

Weight gain and body composition changes are common during the first year after breast cancer diagnosis. Women who are overweight or obese at the time of diagnosis or who gain weight following diagnosis are at higher risk for adverse clinical outcomes. Unhealthy weight conditions, compounded or caused by weight gain after diagnosis, are a considerable challenge for women with breast cancer duri...

We present an incremental algorithm that updates the betweenness centrality (BC) score of all vertices in a graph G when a new edge is added to G, or the weight of an existing edge is reduced. Our incremental algorithm runs in O(ν∗ · n) time, where ν∗ is bounded by m∗, the number of edges that lie on a shortest path in G. We achieve the same bound for the more general incremental vertex update ...

We discuss herein filtering problems involving the emulation of nonlinear systems which have embedded dynamics and where the truth model consists only of an input and output sequence. It has been shown [1] that steepest descent training algorithms such as BackpropagationThrough-Time (BPTT) are locally H optimal for applications where training inputs vary at each weight update, or training epoch...

The vehicle routing problem (VRP), a well-known combinatorial optimization problem, holds a central place in logistics management. This paper proposes an improved ant colony optimization (IACO), which possesses a new strategy to update the increased pheromone, called ant-weight strategy, and a mutation operation, to solve VRP. The computational results for fourteen benchmark problems are report...

In this paper, we present several methods for computing a solution to the protein side chain packing problem, with all methods having a common solution approach of breaking the polymer into subpolymers and using maximum edge weight cliques to prune the search space for the optimal side chain packing. We characterize the graph sizes generated for each method and compare their prediction accuraci...

In this paper we propose an algorithm to classify tensor data. Our methodology is built on recent studies about matrix classification with the trace norm constrained weight matrix and the tensor trace norm. Similar to matrix classification, the tensor classification is formulated as a convex optimization problem which can be solved by using the off-the-shelf accelerated proximal gradient (APG) ...

In this work we introduce a new data structure, named RoadSigns, which allows us to efficiently update the Arc-Flags of a graph in a dynamic scenario. Road-Signs can be used to compute Arc-Flags, can be efficiently updated and do not require large space consumption for many real-world graphs like, e.g., graphs arising from road networks. In detail, we define an algorithm to preprocess Road-Sign...

The complexity of mobile applications often lies in the user interface (UI). To update function provided by UI or just fix bugs related to UI, software maintainers primarily need to obtain the location of source code implementation and detect change set. Since UI related feature is tightly related to the class containing the declaration of the UI component, this paper proposes a topic matching ...