搜索结果：center

This work presents DCIM 3.0, a unified framework integrating semantic reasoning, predictive analytics, autonomous orchestration, and unified connectivity for next-generation AI data center management. The framework addresses critical challenges in infrastructure automation, sustainability, and digital-twin design through knowledge graph-based intelligence, thermal modeling, and the Unified Device Connectivity Protocol (UDCP).Keywords-Data Center Infrastructure Management, DCIM, AI Data Centers, Knowledge Graphs, Digital Twin, Thermal Management, Infrastructure Automation, Sustainability, GPU Computing, Data Center

We introduce CallCenterEN, a large-scale (91,706 conversations, corresponding to 10448 audio hours), real-world English call center transcript dataset designed to support research and development in customer support and sales AI systems. This is the largest release to-date of open source call center transcript data of this kind. The dataset includes inbound and outbound calls between agents and customers, with accents from India, the Philippines and the United States. The dataset includes high-quality, PII-redacted human-readable transcriptions. All personally identifiable information (PII) has been rigorously removed to ensure compliance with global data protection laws. The audio is not included in the public release due to biometric privacy concerns. Given the scarcity of publicly available real-world call center datasets, CallCenterEN fills a critical gap in the landscape of available ASR corpora, and is released under a CC BY-NC 4.0 license for non-commercial research use.

Silicon-based semiconductor nanofabrication technology has achieved a remarkable level of sophistication and maturity, and color centers in silicon naturally inherit this advantage. Besides, their emissions appear in telecommunication bands, which makes them play a crucial role in the construction of quantum network. To address the challenge of weak spontaneous emission, different optical cavities are fabricated to enhance the emission rate. However, the relative location between cavity and emitter is random, which greatly reduce the success probability of enhancement. Here, we report on a fluorescence-localization technique (FLT) for precisely locating single G center in silicon and embedding it in the center of a circular Bragg grating cavity in situ, achieving 240-times improvement of the success probability. We observe a 30-fold enhancement in luminescence intensity, 2.5-fold acceleration of the emission from single G center, corresponding to a Purcell factor exceeding 11. Our findings pave the way for the large-scale integration of quantum light sources including those with spins.

3I/ATLAS is the third known interstellar object to pass through our Solar System. NASA's Transiting Exoplanet Survey Satellite (TESS) made dedicated observations of 3I/ATLAS between 15 -- 22 January 2026 (Sector 1751), capturing high-cadence observations at 200s and 20s cadence. We present two High Level Science Products (HLSPs): (1) comet-centered image time series, corrected for background scattered light and stars; and (2) aperture light curves extracted from the corrected images. We created these data products using the official TESS products and they are publicly available at the Mikulski Archive for Space Telescopes (MAST). TESS's high-precision, near-continuous photometry will provide unique insights into the comet's activity following its closest approach to the Sun. The TESS Science Support Center (TSSC) has created these data products to facilitate scientific analyses by the TESS and Solar System communities.

This work aims to improve a data center's efficiency by optimizing the server upgrade plan: determine the optimal timing for replacing old servers with new ones. The opportunity presented by this approach is demonstrated through a study based on historical server data. The study establishes a significant opportunity to increase the QPS/(TCOxCO2) metric by formulating a global upgrade plan at the data center's design time covering its entire life cycle. This plan leverages information, such as server entry year, performance, and active power consumption for both existing and future servers. Our findings reveal that an optimal global upgrade plan, may involve upgrades at non fixed time periods and outperforms local upgrade plans. Local upgrade plans follow a fixed, equal-length cycle and make decisions based only on currently available server models. These local plans select the best available server at each upgrade cycle without accounting for future server releases.

Data centers are nowadays referred to as the digital world's cornerstone. Quantum key distribution (QKD) is a method that solves the problem of distributing cryptographic keys between two entities, with the security rooted in the laws of quantum physics. This document provides an assessment of the need and opportunity for ushering QKD in data centers. Together with technical examples and inputs on how QKD has and could be integrated into data-center like environments, the document also discusses the creation of value through future-proof data security as well as the market potential that QKD brings on the table through e.g., crypto-agility. While primarily addressed to data center owners/operators, the document also offers a knowledge base to QKD vendors planning to diversify to the data center market segment.

We present an algorithm for explicitly computing the categorical (Drinfeld) center of a pivotal fusion category. Our approach is based on decomposing the images of simple objects under the induction functor from the category to its center. We have implemented this algorithm in a general-purpose software framework TensorCategories.jl for tensor categories that we develop within the open-source computer algebra system OSCAR. We compute explicit models for the centers in form of the tuples $(X,γ)$ where $X$ is an object and $γ$ is a half-braiding. From these models we can compute the $F$-symbols and $R$-symbols. Using the data from the AnyonWiki, we were able to compute the center together with its $F$-symbols and $R$-symbols for all the 279 multiplicity-free fusion categories up to rank 5, and furthermore some chosen examples of rank 6, including the Haagerup subfactor (presented in a separate paper).

In this contribution, we revisit the model of a dust-enshrouded star orbiting a low-luminosity galactic nucleus (Zajaček et al. 2014, 2016, 2017). Although it is quite challenging for dust to survive in hot X-ray-emitting plasma surrounding supermassive black holes (SMBHs), we now have an observational evidence that compact dusty objects or ``G'' objects can approach the SMBH in the Galactic center (Sgr A*) on the scale of a few 1000 gravitational radii. Since there are about ten G objects in the Galactic center, it is more likely that they are dust-enshrouded stars whose gaseous-dusty envelopes are stable within the corresponding tidal (Hill) radii of the order of a few astronomical units. Such a length-scale is consistent with their infrared broad-band spectral energy distributions. Broad emission lines, in particular Br$γ$ recombination line, can be interpreted to arise within the accretion stream from the circumstellar envelopes forming a compact disc that is truncated by the stellar magnetic field. Alternatively, they could also be associated with circumstellar accretion-disc outflows as well as the material within a denser bow shock ahead of the star. In comparison with the l

In the matroid center problem, which generalizes the $k$-center problem, we need to pick a set of centers that is an independent set of a matroid with rank $r$. We study this problem in streaming, where elements of the ground set arrive in the stream. We first show that any randomized one-pass streaming algorithm that computes a better than $Δ$-approximation for partition-matroid center must use $Ω(r^2)$ bits of space, where $Δ$ is the aspect ratio of the metric and can be arbitrarily large. This shows a quadratic separation between matroid center and $k$-center, for which the Doubling algorithm gives an $8$-approximation using $O(k)$-space and one pass. To complement this, we give a one-pass algorithm for matroid center that stores at most $O(r^2\log(1/\varepsilon)/\varepsilon)$ points (viz., stream summary) among which a $(7+\varepsilon)$-approximate solution exists, which can be found by brute force, or a $(17+\varepsilon)$-approximation can be found with an efficient algorithm. If we are allowed a second pass, we can compute a $(3+\varepsilon)$-approximation efficiently; this also achieves almost the known-best approximation ratio (of $3+\varepsilon$) with total running time of

The success of deep learning hinges on enormous data and large models, which require labor-intensive annotations and heavy computation costs. Subset selection is a fundamental problem that can play a key role in identifying smaller portions of the training data, which can then be used to produce similar models as the ones trained with full data. Two prior methods are shown to achieve impressive results: (1) margin sampling that focuses on selecting points with high uncertainty, and (2) core-sets or clustering methods such as k-center for informative and diverse subsets. We are not aware of any work that combines these methods in a principled manner. To this end, we develop a novel and efficient factor 3-approximation algorithm to compute subsets based on the weighted sum of both k-center and uncertainty sampling objective functions. To handle large datasets, we show a parallel algorithm to run on multiple machines with approximation guarantees. The proposed algorithm achieves similar or better performance compared to other strong baselines on vision datasets such as CIFAR-10, CIFAR-100, and ImageNet.

It is natural to ask whether the center of mass of a convex body $K\subset \mathbb{R}^n$ lies in its John ellipsoid $B_K$, i.e., in the maximal volume ellipsoid contained in $K$. This question is relevant to the efficiency of many algorithms for convex bodies. In this paper, we obtain an unexpected negative result. There exists a convex body $K\subset \mathbb{R}^n$ such that its center of mass does not lie in the John ellipsoid $B_K$ inflated $(1-C\sqrt{\frac{\log(n)} {n}})n$ times about the center of $B_K$. Moreover, there exists a polytope $P \subset \mathbb{R}^n$ with $O(n^2)$ facets whose center of mass is not contained in the John ellipsoid $B_P$ inflated $O(\frac{n}{\log(n)})$ times about the center of $B_P$.

Central nodes are critical in establishing structural connectivity in a complex network. Attacking such nodes can create real havoc in a complex system. We propose attack strategies based on four types of centers, namely betweenness center, degree center, median, and center. We study the vulnerability of synthetic as well as real-world networks in these center-based attacks. These attacks are node-removal attacks which involve identifying the central node set and removing them from the network. We observed that the attacks based on recalculated network information are more efficient than ones based on initial network information. This work shows that the median-based attack, which is a novel strategy proposed in this work, is highly destructive in real as well as synthetic networks.

For a set P of n points in R^2, the Euclidean 2-center problem computes a pair of congruent disks of the minimal radius that cover P. We extend this to the (2,k)-center problem where we compute the minimal radius pair of congruent disks to cover n-k points of P. We present a randomized algorithm with O(n k^7 log^3 n) expected running time for the (2,k)-center problem. We also study the (p,k)-center problem in R}^2 under the \ell_\infty-metric. We give solutions for p=4 in O(k^{O(1)} n log n) time and for p=5 in O(k^{O(1)} n log^5 n) time.

Designing closed, laser-induced optical cycling transitions in trapped atoms or molecules is useful for quantum information processing, precision measurement, and quantum sensing. Larger molecules that feature such closed transitions are particularly desirable, as they extend the scope of applicability of such systems. The search for molecules with robust optically cycling centers has been a challenge, and requires design principles beyond trial-and-error. Here, two design principles are proposed for the particular architecture of M-O-R, where M is an alkaline earth metal radical, and R is a ligand: 1) Fairly large saturated hydrocarbons can serve as ligands, R, due to a substantial HOMO-LUMO gap that encloses the cycling transition, so long as the R group is rigid. 2) Electron-withdrawing groups, via induction, can enhance Franck-Condon factors (FCFs) of the optical cycling transition, as long as they do not disturb the locally linear structure in the M-O-R motif. With these tools in mind, larger molecules can be trapped and used as optical cycling centers, sometimes with higher FCFs than smaller molecules.

We report the discovery of a new filamentary structure, G358.85+0.47, consisting of at least three mutually parallel but bent `strands', located about 1.5 degrees SW of the Sgr A complex. Unlike all the other known Galactic center filaments, G358.85+0.47 is oriented parallel to the galactic plane. This orientation of the filament may have implications for the large scale structure of the magnetic field near the Galactic Center. This feature was identified in a new wide-field image of the Galactic Center region at 90 cm. Further higher resolution observations at 20 cm revealed a filamentary structure which is similar to several other known linear features in the vicinity of the Galactic center. Based on its appearance in a 20 cm image, we give it the name 'the Pelican' for further reference.

The (relativistic) center of mass of an asymptotically flat Riemannian manifold is often defined by certain surface integral expressions evaluated along a foliation of the manifold near infinity, e. g. by Arnowitt, Deser, and Misner (ADM). There are also what we call 'abstract' definitions of the center of mass in terms of a foliation near infinity itself, going back to the constant mean curvature (CMC-) foliation studied by Huisken and Yau; these give rise to surface integral expressions when equipped with suitable systems of coordinates. We discuss subtle asymptotic convergence issues regarding the ADM- and the coordinate expressions related to the CMC-center of mass. In particular, we give explicit examples demonstrating that both can diverge -- in a setting where Einstein's equation is satisfied. We also give explicit examples of the same asymptotic order of decay with prescribed mass and center of mass. We illustrate both phenomena by providing analogous examples in Newtonian gravity. Our examples conflict with some results in the literature.

We construct a smooth gauge for the adjoint field which is free of ambiguities on the lattice. In this Laplacian Center Gauge, center vortices and monopoles appear together as local gauge defects. A numerical study of center vortices in SU(2) and SU(3) supports equality of the $Z_N$ and SU(N) string tensions in the continuum limit, and only then.

Our Galactic center contains young stars, including the few million year old clockwise disk between 0.05 and 0.5 pc from the Galactic center, and the S-star cluster of B-type stars at a galactocentric distance of ~0.01 pc. Recent observations suggest the S-stars are remnants of tidally disrupted binaries from the clockwise disk. In particular, Koposov et al. 2020 discovered a hypervelocity star that was ejected from the Galactic center 5 Myr ago, with a velocity vector consistent with the disk. We perform a detailed study of this binary disruption scenario. First, we quantify the plausible range of binary semimajor axes in the disk. Dynamical evaporation of such binaries is dominated by other disk stars rather than by the isotropic stellar population. For the expected range of semimajor axes in the disk, binary tidal disruptions can reproduce the observed S-star semimajor axis distribution. Reproducing the observed thermal eccentricity distribution of the S-stars requires an additional relaxation process. The flight time of the Koposov star suggests that this process must be effective within 10 Myr. We consider three possibilities: (i) scalar resonant relaxation from the observed i

We study a commuting family of elements of the walled Brauer algebra $B_{r,s}(δ)$, called the Jucys-Murphy elements, and show that the supersymmetric polynomials in these elements belong to the center of the walled Brauer algebra. When $B_{r,s}(δ)$ is semisimple, we show that those supersymmetric polynomials generate the center. Under the same assumption,we define a maximal commutative subalgebra of $B_{r,s}(δ)$, called the \emph{Gelfand-Zetlin subalgebra}, and show that it is generated by the Jucys-Murphy elements. As an application, we construct a complete set of primitive orthogonal idempotents of $B_{r,s}(δ)$, when it is semisimple. We also give an alternative proof of a part of the classification theorem of blocks of $B_{r,s}(δ)$ in non-semisimple cases, which appeared in the work of Cox-De~Visscher-Doty-Martin.Finally, we present an analogue of Jucys-Murpy elements for the quantized walled Brauer algebra $H_{r,s}(q,ρ)$ over $\mathbb C(q, ρ)$ and by taking the classical limit we show that the supersymmetric polynomials in these elements generates the center. It follows that H. Morton conjecture, which appeared in the study of the relation between the framed HOMFLY skein on the