Table 1: Comparison of sum of cluster densities for MDS Peeling+DPRP and for the best of 10 Density-FM runs. Results for avq.small benchmark using Density-FM would require many days of SPARC-10 time. Bounded Size Maximum Density Subhyper-graph (BMDS) problem : Given a hypergraph H(V; E) and an integer B, nd the subhypergraph of H with maximum density and size B. While MDS was polynomial time so...

background domestic violence appears to be a major social problem. researches in the last 10 years have uncovered multiple effects of witnessing domestic violence on children, ranging in severity from little or no effect to sever psychological harm. objectives this study aimed to measure the prevalence of exposure to domestic violence among high school students in tehran. materials and methods ...

nineteen lymph node biopsies, 3 curetting, 15 blood samples obtained from patients with lymphadenitis and high titers of toxoplasma antibodies, and 27 tonsillar tissues removed from patients because of chronic tonsillitis were inoculated intraperitoneally into mice for isolation of toxoplasma gondii. toxoplasms were isolated from 5 lymph node biopsies, one curettage material, 2 tonsillar tissue...

Packet loss in mobile IPv6 is a huge problem during mobile node handover, especially for real-time packets. When the mobile node moves from one subnet to another, it cannot receive packets that the correspondent node sent to it. This unreachable problem remains until the mobile node gets new address and sends its binding updates to inform the correspondent node about its new address. In real-ti...

Given an n-node undirected simple graph G and a positive integer k, the k-connectivity labeling problem for G seeks short labels for the nodes of G such that whether any two nodes are k-connected in G can be determined merely by their labels. For k = 1, an optimal solution to the problem is to give each node in the same connected component of G a common log2 n -bit label, uniquely chosen for th...

We consider the problem of human-assisted graph search: given a directed acyclic graph with some (unknown) target node(s), we consider the problem of finding the target node(s) by asking an omniscient human questions of the form “Is there a target node that is reachable from the current node?”. This general problem has applications in many domains that can utilize human intelligence, including ...

This article presents a new method for determining optimal transit routes. The Transit Route Arc-Node Service Maximization model is a mathematical model that maximizes the service value of a route, rather than minimizing cost. Cost (distance) is considered as a budget constraint on the extent of the route. The mathematical formulation modifies and exploits the structure of linear programming pr...

Lymphoscintigraphy for sentinel node (SN) localization was performed on a 60-y-old man with a melanoma on his back. Skin contamination occurred as a result of the radiopharmaceutical dose administration. Skin contamination could result in a misinterpretation of the SN location. Careful observation of the procedure avoided a misinterpretation with this study.

In this paper, we focus on a particular version of the Dynamic Service Network Design (DSND) problem, namely the case of a single-terminal that dispatches services to a number of customers and other terminals. We present a time-dependent, stochastic formulation that aims to optimize the problem over a given planning horizon, and propose a solution approach based on dynamic programming principle...