Search

We verify a recent conjecture of Sehrawat, Kumar and Ahlawat on the minimum bisection width (a notion that was rediscovered in 2020 by Acharya and Kureethara under the name of rna number) of powers of cycles., Comment: 3 pages

The $d$-Cut problem is to decide if a graph has an edge cut such that each vertex has at most $d$ neighbours at the opposite side of the cut. If $d=1$, we obtain the intensively studied Matching Cut problem. The $d$-Cut problem has been studied as well, but a systematic study for special graph classes was lacking. We initiate such a study and consider classes of bounded diameter, bounded radius and $H$-free graphs. We prove that for all $d\geq 2$, $d$-Cut is polynomial-time solvable for graphs of diameter $2$, $(P_3+P_4)$-free graphs and $P_5$-free graphs. These results extend known results for $d=1$. However, we also prove several NP-hardness results for $d$-Cut that contrast known polynomial-time results for $d=1$. Our results lead to full dichotomies for bounded diameter and bounded radius and to almost-complete dichotomies for $H$-free graphs.

In recent years, convolutional neural networks for semantic segmentation of breast ultrasound (BUS) images have shown great success; however, two major challenges still exist. 1) Most current approaches inherently lack the ability to utilize tissue anatomy, resulting in misclassified image regions. 2) They struggle to produce accurate boundaries due to the repeated down-sampling operations. To address these issues, we propose a novel breast anatomy-aware network for capturing fine image details and a new smoothness term that encodes breast anatomy. It incorporates context information across multiple spatial scales to generate more accurate semantic boundaries. Extensive experiments are conducted to compare the proposed method and eight state-of-the-art approaches using a BUS dataset with 325 images. The results demonstrate the proposed method significantly improves the segmentation of the muscle, mammary, and tumor classes and produces more accurate fine details of tissue boundaries.

A matching cut in a graph G is an edge cut of G that is also a matching. This short survey gives an overview of old and new results and open problems for Maximum Matching Cut, which is to determine the size of a largest matching cut in a graph. We also compare this problem with the related problems Matching Cut, Minimum Matching Cut, and Perfect Matching Cut, which are to determine if a graph has a matching cut; the size of a smallest matching cut in a graph; and if a graph has a matching cut that is a perfect matching, respectively. Moreover, we discuss a relationship between Maximum Matching Cut and Max Cut, which is to determine the size of a largest edge cut in a graph, as well as a relationship between Minimum Matching Cut and Min Cut, which is to determine the size of a smallest edge cut in a graph.

In this paper, we consider the following two problems: (i) Deletion Blocker($\alpha$) where we are given an undirected graph $G=(V,E)$ and two integers $k,d\geq 1$ and ask whether there exists a subset of vertices $S\subseteq V$ with $|S|\leq k$ such that $\alpha(G-S) \leq \alpha(G)-d$, that is the independence number of $G$ decreases by at least $d$ after having removed the vertices from $S$; (ii) Transversal($\alpha$) where we are given an undirected graph $G=(V,E)$ and two integers $k,d\geq 1$ and ask whether there exists a subset of vertices $S\subseteq V$ with $|S|\leq k$ such that for every maximum independent set $I$ we have $|I\cap S| \geq d$. We show that both problems are polynomial-time solvable in the class of co-comparability graphs by reducing them to the well-known Vertex Cut problem. Our results generalize a result of [Chang et al., Maximum clique transversals, Lecture Notes in Computer Science 2204, pp. 32-43, WG 2001] and a recent result of [Hoang et al., Assistance and interdiction problems on interval graphs, Discrete Applied Mathematics 340, pp. 153-170, 2023].

In healthcare, the ability to care for oneself is reflected in the "Activities of Daily Living (ADL)," which serve as a measure of functional ability (functioning). A lack of functioning may lead to poor living conditions requiring personal care and assistance. To accurately identify those in need of support, assistance programs continuously evaluate participants' functioning across various domains. However, the assessment process may encounter consistency issues when multiple assessors with varying levels of expertise are involved. Novice assessors, in particular, may lack the necessary preparation for real-world interactions with participants. To address this issue, we developed a dialogue system that simulates interactions between assessors and individuals of varying functioning in a natural and reproducible way. The dialogue system consists of two major modules, one for natural language understanding (NLU) and one for natural language generation (NLG), respectively. In order to generate responses consistent with the underlying knowledge base, the dialogue system requires both an understanding of the user's query and of biographical details of an individual being simulated. To fulfill this requirement, we experimented with query classification and generated responses based on those biographical details using some recently released InstructGPT-like models., Comment: Accepted to ACL 2023 DialDoc Workshop

The (Perfect) Matching Cut problem is to decide if a graph $G$ has a (perfect) matching cut, i.e., a (perfect) matching that is also an edge cut of $G$. Both Matching Cut and Perfect Matching Cut are known to be NP-complete. A perfect matching cut is also a matching cut with maximum number of edges. To increase our understanding of the relationship between the two problems, we perform a complexity study for the Maximum Matching Cut problem, which is to determine a largest matching cut in a graph. Our results yield full dichotomies of Maximum Matching Cut for graphs of bounded diameter, bounded radius and $H$-free graphs. A disconnected perfect matching of a graph $G$ is a perfect matching that contains a matching cut of $G$. We also show how our new techniques can be used for finding a disconnected perfect matching with a largest matching cut for special graph classes. In this way we can prove that the decision problem Disconnected Perfect Matching is polynomial-time solvable for $(P_6+sP_2)$-free graphs for every $s\geq 0$, extending a known result for $P_5$-free graphs (Bouquet and Picouleau, 2020).

The (Perfect) Matching Cut problem is to decide if a connected graph has a (perfect) matching that is also an edge cut. The Disconnected Perfect Matching problem is to decide if a connected graph has a perfect matching that contains a matching cut. Both Matching Cut and Disconnected Perfect Matching are NP-complete for planar graphs of girth 5, whereas Perfect Matching Cut is known to be NP-complete even for subcubic bipartite graphs of arbitrarily large fixed girth. We prove that Matching Cut and Disconnected Perfect Matching are also NP-complete for bipartite graphs of arbitrarily large fixed girth and bounded maximum degree. Our result for Matching Cut resolves a 20-year old open problem. We also show that the more general problem $d$-Cut, for every fixed $d \geq 1$, is NP-complete for bipartite graphs of arbitrarily large fixed girth and bounded maximum degree. Furthermore, we show that Matching Cut, Perfect Matching Cut and Disconnected Perfect Matching are NP-complete for $H$-free graphs whenever $H$ contains a connected component with two vertices of degree at least 3. Afterwards, we update the state-of-the-art summaries for $H$-free graphs and compare them with each other, and with a known and full classification of the Maximum Matching Cut problem, which is to determine a largest matching cut of a graph $G$. Finally, by combining existing results, we obtain a complete complexity classification of Perfect Matching Cut for $H$-subgraph-free graphs where $H$ is any finite set of graphs.

We consider the following problem: for a given graph $G$ and two integers $k$ and $d$, can we apply a fixed graph operation at most $k$ times in order to reduce a given graph parameter $\pi$ by at least $d$? We show that this problem is NP-hard when the parameter is the independence number and the graph operation is vertex deletion or edge contraction, even for fixed $d=1$ and when restricted to chordal graphs. We give a polynomial time algorithm for bipartite graphs when the operation is edge contraction, the parameter is the independence number and $d$ is fixed. Further, we complete the complexity dichotomy on $H$-free graphs when the parameter is the clique number and the operation is edge contraction by showing that this problem is NP-hard in $(C_3+P_1)$-free graphs even for fixed $d=1$. When the operation is edge deletion and the parameter is the chromatic number, we determine the computational complexity of the associated problem on cographs and complete multipartite graphs. Our results answer several open questions stated in [Diner et al., Theoretical Computer Science, 746, p. 49-72 (2012)]., Comment: 26 pages, 4 figures. arXiv admin note: substantial text overlap with arXiv:2202.08574

The NP-complete problem Matching Cut is to decide if a graph has a matching that is also an edge cut of the graph. We prove new complexity results for Matching Cut restricted to $H$-free graphs, that is, graphs that do not contain some fixed graph $H$ as an induced subgraph. We also prove new complexity results for two recently studied variants of Matching Cut, on $H$-free graphs. The first variant requires that the matching cut must be extendable to a perfect matching of the graph. The second variant requires the matching cut to be a perfect matching. In particular, we prove that there exists a small constant $r>0$ such that the first variant is NP-complete for $P_r$-free graphs. This addresses a question of Bouquet and Picouleau (arXiv, 2020). For all three problems, we give state-of-the-art summaries of their computational complexity for $H$-free graphs.

For a connected graph $G=(V,E)$, a matching $M\subseteq E$ is a matching cut of $G$ if $G-M$ is disconnected. It is known that for an integer $d$, the corresponding decision problem Matching Cut is polynomial-time solvable for graphs of diameter at most $d$ if $d\leq 2$ and NP-complete if $d\geq 3$. We prove the same dichotomy for graphs of bounded radius. For a graph $H$, a graph is $H$-free if it does not contain $H$ as an induced subgraph. As a consequence of our result, we can solve Matching Cut in polynomial time for $P_6$-free graphs, extending a recent result of Feghali for $P_5$-free graphs. We then extend our result to hold even for $(sP_3+P_6)$-free graphs for every $s\geq 0$ and initiate a complexity classification of Matching Cut for $H$-free graphs.

We consider the following problem: for a given graph G and two integers k and d, can we apply a fixed graph operation at most k times in order to reduce a given graph parameter $\pi$ by at least d? We show that this problem is NP-hard when the parameter is the independence number and the graph operation is vertex deletion or edge contraction, even for fixed d=1 and when restricted to chordal graphs. We also give a polynomial time algorithm for bipartite graphs when the operation is edge contraction, the parameter is the independence number and d is fixed. Further, we complete the complexity dichotomy on H-free graphs when the parameter is the clique number and the operation is edge contraction by showing that this problem is NP-hard in ($C_3+P_1$)-free graphs even for fixed d=1. Our results answer several open questions stated in [Diner et al., Theoretical Computer Science, 746, p. 49-72 (2012)]., Comment: 13 pages, 2 figures

Selection on the Cartesian product is a classic problem in computer science. Recently, an optimal algorithm for selection on $X+Y$, based on soft heaps, was introduced. By combining this approach with layer-ordered heaps (LOHs), an algorithm using a balanced binary tree of $X+Y$ selections was proposed to perform $k$-selection on $X_1+X_2+\cdots+X_m$ in $o(n\cdot m + k\cdot m)$, where $X_i$ have length $n$. Here, that $o(n\cdot m + k\cdot m)$ algorithm is combined with a novel, optimal LOH-based algorithm for selection on $X+Y$ (without a soft heap). Performance of algorithms for selection on $X_1+X_2+\cdots+X_m$ are compared empirically, demonstrating the benefit of the algorithm proposed here.

The layer-ordered heap (LOH) is a simple, recently proposed data structure used in optimal selection on $X+Y$, thealgorithm with the best known runtime for selection on $X_1+X_2+\cdots+X_m$, and the fastest method in practice for computing the most abundant isotope peaks in a chemical compound. Here, we introduce a few algorithms for constructing LOHs, analyze their complexity, and demonstrate that one algorithm is optimal for building a LOH of any rank $\alpha$. These results are shown to correspond with empirical experiments of runtimes when applying the LOH construction algorithms to a common task in machine learning.

The theoretical computation of isotopic distribution of compounds is crucial in many important applications of mass spectrometry, especially as machine precision grows. A considerable amount of good tools have been created in the last decade for doing so. In this paper we present a novel algorithm for calculating the top $k$ peaks of a given compound. The algorithm takes advantage of layer-ordered heaps used in an optimal method of selection on $X+Y$ and is able to efficiently calculate the top $k$ peaks on very large molecules. Among its peers, this algorithm shows a significant speedup on molecules whose elements have many isotopes. The algorithm obtains a speedup of more than 31x when compared to $\textsc{IsoSpec}$ on \ch{Au2Ca10Ga10Pd76} when computing 47409787 peaks, which covers 0.999 of the total abundance.

Selection on $X_1+X_2+\cdots + X_m$ is an important problem with many applications in areas such as max-convolution, max-product Bayesian inference, calculating most probable isotopes, and computing non-parametric test statistics, among others. Faster-than-na\"{i}ve approaches exist for $m=2$: Frederickson (1993) published the optimal algorithm with runtime $O(k)$ and Kaplan \emph{et al.} (2018) has since published a much simpler algorithm which makes use of Chazelle's soft heaps (2003). No fast methods exist for $m>2$. Johnson \& Mizoguchi (1978) introduced a method to compute the single $k^{th}$ value when $m>2$, but that method runs in $O(m\cdot n^{\lceil\frac{m}{2}\rceil} \log(n))$ time and is inefficient when $m \gg 1$ and $k \ll n^{\lceil\frac{m}{2}\rceil}$. In this paper, we introduce the first efficient methods, both in theory and practice, for problems with $m>2$. We introduce the ``layer-ordered heap,'' a simple special class of heap with which we produce a new, fast selection algorithm on the Cartesian product. Using this new algorithm to perform $k$-selection on the Cartesian product of $m$ arrays of length $n$ has runtime $\in o(k\cdot m)$. We also provide implementations of the algorithms proposed and evaluate their performance in practice.

The isotope masses and relative abundances for each element are fundamental chemical knowledge. Computing the isotope masses of a compound and their relative abundances is an important and difficult analytical chemistry problem. We demonstrate that this problem is equivalent to sorting $Y=X_1+X_2+\cdots+X_m$. We introduce a novel, practically efficient method for computing the top values in $Y$. then demonstrate the applicability of this method by computing the most abundant isotope masses (and their abundances) from compounds of nontrivial size.

Many architects believe that major improvements in cost-energy-performance must now come from domain-specific hardware. This paper evaluates a custom ASIC---called a Tensor Processing Unit (TPU)---deployed in datacenters since 2015 that accelerates the inference phase of neural networks (NN). The heart of the TPU is a 65,536 8-bit MAC matrix multiply unit that offers a peak throughput of 92 TeraOps/second (TOPS) and a large (28 MiB) software-managed on-chip memory. The TPU's deterministic execution model is a better match to the 99th-percentile response-time requirement of our NN applications than are the time-varying optimizations of CPUs and GPUs (caches, out-of-order execution, multithreading, multiprocessing, prefetching, ...) that help average throughput more than guaranteed latency. The lack of such features helps explain why, despite having myriad MACs and a big memory, the TPU is relatively small and low power. We compare the TPU to a server-class Intel Haswell CPU and an Nvidia K80 GPU, which are contemporaries deployed in the same datacenters. Our workload, written in the high-level TensorFlow framework, uses production NN applications (MLPs, CNNs, and LSTMs) that represent 95% of our datacenters' NN inference demand. Despite low utilization for some applications, the TPU is on average about 15X - 30X faster than its contemporary GPU or CPU, with TOPS/Watt about 30X - 80X higher. Moreover, using the GPU's GDDR5 memory in the TPU would triple achieved TOPS and raise TOPS/Watt to nearly 70X the GPU and 200X the CPU., Comment: 17 pages, 11 figures, 8 tables. To appear at the 44th International Symposium on Computer Architecture (ISCA), Toronto, Canada, June 24-28, 2017

IceCube Collaboration Contributions to the 2009 International Cosmic Ray Conference, Comment: Index file for IceCube contributions to the 2009 ICRC; corrected author list

Treatments of Fraunhofer diffraction normally approximate the inclination factor in the diffraction integral by 1, but this is not necessary. In this paper, the Rayleigh-Sommerfeld diffraction integral is used and a complete description of Fraunhofer diffraction is given, with the minimum possible number of approximations made. A focused wave is examined before, at, and after its focal point to elucidate the exact role of the Fourier transform in describing Fraunhofer diffraction and to derive the Guoy phase shift., Comment: 8 pages, 1 figure

The survey, using data gathered from state foreign language association presidents and state foreign language supervisors and a number of other sources, investigated issues in professional development for language teachers. Forty-six out of 50 states responded to the survey, but not all of the states responded to each quotation. The survey consisted of questions on teacher shortages, recruitment, certification, bilingual education, and American Sign Language. Results indicate that teacher shortages are affecting most states, and increasing student enrollments in elementary, middle, and high schools exacerbate this problem. Largest shortages are in Spanish and Japanese, followed by French, German, Latin, Chinese, Arabic, Italian, and Korean. Despite increased enrollment figures, foreign language requirements at any level are not common. Approximately 89 percent of all language teachers are certified; of the remainder, half are emergency certified and half are uncertified. Emergency certification is commonplace, and most school districts provide alternative methods for language teacher certification. While professional development is being addressed in the states, how it is supported and treated varies greatly. It includes training through workshops and conferences, inservice opportunities, and federally-funded programs. Obstacles faced by teachers in obtaining professional development include competition with other disciplines, treatment of languages as outside the core curriculum, poor program information dissemination, and lack of financial support. (MSE)

A quantum-mechanical Gaussian wave-packet approach to the theoretical description of nuclear motions in a condensed-phase environment is developed. General expressions for the time-dependent reduced density matrix are given for a harmonic potential surface, and the exact quantum dynamics is found for a microscopic system-plus-bath model. Particular attention is devoted to the influence of initial correlations between system and bath for the outcome of a pump-probe experiment. We show that the standard factorized preparation, compared to a more realistic correlated preparation, leads to significantly different stimulated emission spectra at high temperatures. Recent experiments for the reaction center are analyzed using this formalism., Comment: 12 page, 13 figures

The observability of electronic coherence in electron transfer reactions is discussed. We show that under appropriate circumstances large-amplitude oscillations can be found in the electronic occupation probabilities. The initial preparation of the system is of crucial importance for this effect, and we discuss conditions under which experiments detecting electronic coherence should be feasible. The Feynman-Vernon influence functional formalism is extended to examine more general and experimentally relevant initial preparations. Analytical expressions and path integral quantum dynamics simulations were developed to study the effects of various initial preparations on the observability of electronic coherence., Comment: 14 pages, 9 figures, to be published in J. Chem. Phys

The invaded cluster algorithm, a new method for simulating phase transitions, is described in detail. Theoretical, albeit nonrigorous, justification of the method is presented and the algorithm is applied to Potts models in two and three dimensions. The algorithm is shown to be useful for both first-order and continuous transitions and evidently provides an efficient way to distinguish between these possibilities. The dynamic properties of the invaded cluster algorithm are studied. Numerical evidence suggests that the algorithm has no critical slowing for Ising models., Comment: 39 pages, revtex, 15 figures available on request from machta@phast.umass.edu, to appear in Phys. Rev. E

We describe an approach to classify (meromorphic) representations of a given vertex operator algebra by calculating Zhu's algebra explicitly. We demonstrate this for FKS lattice theories and subtheories corresponding to the Z_2 reflection twist and the Z_3 twist. Our work is mainly offering a novel uniqueness tool, but, as shown in the Z_3 case, it can also be used to extract enough information to construct new representations. We prove the existence and some properties of a new non-unitary representation of the Z_3-invariant subtheory of the (two dimensional) Heisenberg algebra., Comment: 60 pages, Latex

A new cluster algorithm based on invasion percolation is described. The algorithm samples the critical point of a spin system without a priori knowledge of the critical temperature and provides an efficient way to determine the critical temperature and other observables in the critical region. The method is illustrated for the two- and three-dimensional Ising models. The algorithm equilibrates spin configurations much faster than the closely related Swendsen-Wang algorithm., Comment: 13 pages RevTex and 4 Postscript figures. Submitted to Phys. Rev. Lett. Replacement corrects problem in printing figures

I compare heatkernel regularization with sharp gauge invariant cutoffs in the Hamiltonian formulation of the Coulomb gauged Schwinger model on a circle. The effective potential for the zero mode of the gauge field in a given fermionic configuration is different in these two regularizations, the difference being independent of the chosen fermionic configuration. In the continuum limit the gauge field can be localized or delocalized depending on the regulator., Comment: 7 pages, latex , (revised because of TEX problem)

The boundary conditions imposed on the diffraction problem in order to obtain the Fresnel-Kirchhoff (FK) solution are well-known to be mathematically inconsistent and to be violated by the solution when the observation point is close to the diffracting screen 1-3. These problems are absent in the Rayleigh-Sommerfeld (RS) solution. The difference between RS and FK is in the inclination factor and is usually immaterial because the inclination factor is approximated by unity. But when this approximation is not valid, FK can lead to unacceptable answers. Calculating the on-axis intensity of Poisson s spot provides a critical test, a test passed by RS and failed by FK. FK fails because (a) convergence of the integral depends on how it is evaluated and (b) when the convergence problem is xed, the predicted amplitude at points near the obscuring disk is not consistent with the assumed boundary conditions.

Our recommendations to NPOESS for the sensors it should adopt to meet threshold requirements for global monitoring of ozone and, to some extent, of aerosols and of atmospheric temperature, pressure, and water vapor content are summarized in this report. The degree to which these sensors fulfill other NPOESS requirements than ozone is also summarized. The number of sensors that should be in the constellation is discussed in terms of desired reliability, continuity of coverage, and the ability to cross-calibrate successive sensors. Our recommendations for specific ozone measurement requirements, IORD item 4.1.6.2.28, are given. We make the case that the monitoring of three minor constituents in the upper atmosphere (N20, ClO or ClONO2, and HNO3) should be added to the list of NPOESS requirements because of their importance to long-term ozone studies and the small additional cost required (ozone sensors are already designed to measure them). Specific measurement requirements, which should be regarded as supplementary to the ozone requirement, are given here. The necessity of using two types of sensors, nadir-viewers and limb-scanners, for atmospheric studies is discussed.

The Strategic Defense Initiative Organization has created data centers for midcourse, plumes, and backgrounds phenomenologies. The Backgrounds Data Center (BDC) has been designated as the prime archive for data collected by SDIO programs. The BDC maintains a Summary Catalog that contains 'metadata,' that is, information about data, such as when the data were obtained, what the spectral range of the data is, and what region of the Earth or sky was observed. Queries to this catalog result in a listing of all data sets (from all experiments in the Summary Catalog) that satisfy the specified criteria. Thus, the user can identify different experiments that made similar observations and order them from the BDC for analysis. On-site users can use the Science Analysis Facility (SAFE for this purpose. For some programs, the BDC maintains a Program Catalog, which can classify data in as many ways as desired (rather than just by position, time, and spectral range as in the Summary Catalog). For example, data sets could be tagged with such diverse parameters as solar illumination angle, signal level, or the value of a particular spectral ratio, as long as these quantities can be read from the digital record or calculated from it by the ingest program. All unclassified catalogs and unclassified data will be remotely accessible.

Comparing two or more images, either by differencing or ratioing, is important to many remote sensing problems. Because the pixel sample points for the images are (almost) always separated by some nonzero shift, a resampling, or interpolation, process must be performed if one image is to be accurately compared to another. Considered in Fourier space, an interpolator acts as a filter that attenuates some frequencies (usually high) of the image. Thus, when the shifted and unshifted images are compared, the former has been filtered, while the latter has not; the effect of this difference is called interpolation error. The key idea of this paper is to apply a filter to the unshifted image that matches the filtering effect of applying the interpolator to the shifted image, thereby drastically reducing interpolation error. The resulting interpolators, called filtering interpolators, are derived and discussed in detail elsewhere. Basic results will be given in this presentation.

For most imaging sensors, a constant (dc) pointing error is unimportant (unless large), but time-dependent (ac) errors degrade performance by either distorting or smearing the image. When properly quantified, the separation of the root-mean-square effects of random line-of-sight motions into dc and ac components can be used to obtain the minimum necessary line-of-sight stability specifications. The relation between stability requirements and sensor resolution is discussed, with a view to improving communication between the data analyst and the control systems engineer.

Discusses the merit of using the Representative Tax System to measure state fiscal capacity instead of the traditional measure of per capita income. The conclusion is that the Representative Tax System can play a major role in determining the allocation of federal grants. (MJL)