# J. Y. Han - ICC Durham

## Contact Details

NameJ. Y. Han |
||

AffiliationICC Durham |
||

CityDurham |
||

CountryUnited States |
||

## Pubs By Year |
||

## External Links |
||

## Pub CategoriesComputer Science - Computer Vision and Pattern Recognition (8) Mathematics - Combinatorics (6) Computer Science - Learning (4) Computer Science - Computation and Language (3) High Energy Physics - Experiment (3) Computer Science - Artificial Intelligence (3) Physics - Materials Science (3) Physics - Physics and Society (3) Physics - Optics (2) Statistics - Machine Learning (2) High Energy Physics - Phenomenology (2) High Energy Astrophysical Phenomena (2) Physics - Instrumentation and Detectors (2) Physics - Strongly Correlated Electrons (1) Physics - Statistical Mechanics (1) Physics - Chemical Physics (1) Computer Science - Architecture (1) Physics - Data Analysis; Statistics and Probability (1) Computer Science - Neural and Evolutionary Computing (1) Mathematics - Algebraic Geometry (1) Physics - Atomic Physics (1) Mathematics - Optimization and Control (1) Computer Science - Graphics (1) Astrophysics of Galaxies (1) Computer Science - Cryptography and Security (1) Mathematics - Representation Theory (1) Mathematics - Rings and Algebras (1) Solar and Stellar Astrophysics (1) Computer Science - Discrete Mathematics (1) Computer Science - Information Retrieval (1) Nuclear Experiment (1) Cosmology and Nongalactic Astrophysics (1) Mathematics - Numerical Analysis (1) Computer Science - Software Engineering (1) Physics - Mesoscopic Systems and Quantum Hall Effect (1) |

## Publications Authored By J. Y. Han

Content popularity prediction has been extensively studied due to its importance and interest for both users and hosts of social media sites like Facebook, Instagram, Twitter, and Pinterest. However, existing work mainly focuses on modeling popularity using a single metric such as the total number of likes or shares. In this work, we propose Diffusion-LSTM, a memory-based deep recurrent network that learns to recursively predict the entire diffusion path of an image through a social network. Read More

We show Fujita's spectrum conjecture for $\epsilon$-log canonical pairs and Fujita's log spectrum conjecture for log canonical pairs. Then, we generalize the pseudo-effective threshold of a single divisor to multiple divisors and establish the analogous finiteness and the DCC properties. Read More

In the light of latest data of neutrino oscillation experiments, we carry out a systematic investigation on the texture structures of Majorana neutrino mass matrix $M_{\nu}$, which contain one vanishing neutrino mass and an equality between two matrix elements. Among 15 logically possible patterns, it is found that for norm order ($m_{3}>m_{2}>m_{1}=0$) of neutrino masses only five of them are compatible with recent experimental data at the $3\sigma$ level, while for inverted order ($m_{2}>m_{1}>m_{3}=0$) ten patterns is phenomenologically allowed. In the numerical analysis, we perform a scan over the parameter space of all viable patterns to get a large sample of scattering points. Read More

Service virtualization is an approach that uses virtualized environments to automatically test enterprise services in production-like conditions. Many techniques have been proposed to provide such a realistic environment for enterprise services. The Internet-of-Things (IoT) is an emerging field which connects a diverse set of devices over different transport layers, using a variety of protocols. Read More

We develop a novel deep contour detection algorithm with a top-down fully convolutional encoder-decoder network. Our proposed method, named TD-CEDN, solves two important issues in this low-level vision problem: (1) learning multi-scale and multi-level features; and (2) applying an effective top-down refined approach in the networks. TD-CEDN performs the pixel-wise prediction by means of leveraging features at all layers of the net. Read More

Locations, e.g., countries, states, cities, and point-of-interests, are central to news, emergency events, and people's daily lives. Read More

Visual data such as videos are often sampled from complex manifold. We propose leveraging the manifold structure to constrain the deep action feature learning, thereby minimizing the intra-class variations in the feature space and alleviating the over-fitting problem. Considering that manifold can be transferred, layer by layer, from the data domain to the deep features, the manifold priori is posed from the top layer into the back propagation learning procedure of convolutional neural network (CNN). Read More

Robust object recognition systems usually rely on powerful feature extraction mechanisms from a large number of real images. However, in many realistic applications, collecting sufficient images for ever-growing new classes is unattainable. In this paper, we propose a new Zero-shot learning (ZSL) framework that can synthesise visual features for unseen classes without acquiring real images. Read More

Steerable properties dominate the design of traditional filters, e.g., Gabor filters, and endow features the capability of dealing with spatial transformations. Read More

In this paper we study some variants of the Dirac-type problems in hypergraphs. First, we show that for $k\ge 3$, if $H$ is a $k$-graph on $n\in k\mathbb N$ vertices with independence number at most $n/p$ and minimum codegree at least $(1/p+o(1))n$, where $p$ is the smallest prime factor of $k$, then $H$ contains a perfect matching. Second, we show that if $H$ is a $3$-graph on $n\in 3\mathbb N$ vertices which does not contain any induced copy of $K_4^-$ (the unique $3$-graph with $4$ vertices and $3$ edges) and has minimum codegree at least $(1/3+o(1)))n$, then $H$ contains a perfect matching. Read More

Scotogenic models were proposed by some authors where the tiny Dirac neutrino mass terms arise at loop level. In prototype models, two $ad$ $hoc$ discrete symmetries were introduced, one is responsible for the absence of SM Yukawa couplings $\bar{\nu}_L\nu_R\overline{\phi^0}$ and the other for the stability of intermediate fields as dark matter(DM). In this paper, we construct the one-loop and two-loop scotogenic models for Dirac neutrino mass generation in the context of $U(1)_{B-L}$ extensions of standard model. Read More

We propose a novel adaptive importance sampling algorithm which incorporates Stein variational gradient decent algorithm (SVGD) with importance sampling (IS). Our algorithm leverages the nonparametric transforms in SVGD to iteratively decrease the KL divergence between our importance proposal and the target distribution. The advantages of this algorithm are twofold: first, our algorithm turns SVGD into a standard IS algorithm, allowing us to use standard diagnostic and analytic tools of IS to evaluate and interpret the results; second, we do not restrict the choice of our importance proposal to predefined distribution families like traditional (adaptive) IS methods. Read More

**Authors:**Y. S. Yoon, T. Anderson, A. Barrau, N. B. Conklin, S. Coutu, L. Derome, J. H. Han, J. A. Jeon, K. C. Kim, M. H. Kim, H. Y. Lee, J. Lee, M. H. Lee, S. E. Lee, J. T. Link, A. Menchaca-Rocha, J. W. Mitchell, S. I. Mognet, S. Nutter, I. H. Park, N. Picot-Clemente, A. Putze, E. S. Seo, J. Smith, J. Wu

**Category:**High Energy Astrophysical Phenomena

Primary cosmic-ray elemental spectra have been measured with the balloon-borne Cosmic Ray Energetics And Mass (CREAM) experiment since 2004. The third CREAM payload (CREAM-III) flew for 29 days during the 2007-2008 Antarctic season. Energies of incident particles above 1 TeV are measured with a calorimeter. Read More

Recently, Mubayi and Wang showed that for $r\ge 4$ and $\ell \ge 3$, the number of $n$-vertex $r$-graphs that do not contain any loose cycle of length $\ell$ is at most $2^{O( n^{r-1} (\log n)^{(r-3)/(r-2)})}$. We improve this bound to $2^{O( n^{r-1} \log \log n) }$. Read More

A system of measuring total cross section for thermal neutrons,the photoneutron source (PNS, phase 1),has been developed for the acquisition of nuclear data from the Thorium Molten Salt Reactor(TMSR) at the Shanghai Institute of Applied Physics (SINAP). It is an electron LINAC accelerator pulsed neutron facility that uses the time-of-flight (TOF) technique. It is recording the neutron TOF and identifying neutrons and {\gamma}-rays by using a digital-signal-processing technique. Read More

Recent studies on the magneto-transport properties of topological insulators (TI) have attracted great attention due to the rich spin-orbit physics and promising applications in spintronic devices. Particularly the strongly spin-moment coupled electronic states have been extensively pursued to realize efficient spin-orbit torque (SOT) switching. However, so far current-induced magnetic switching with TI has only been observed at cryogenic temperatures. Read More

We determine spectral indices of 228 pulsars by using Parkes pulsar data observed at 1.4 GHz, among which 200 spectra are newly determined. The indices are distributed in the range from -4. Read More

It is shown that there are no simple mixed modules over the twisted N=1 Schr\"{o}dinger-Neveu-Schwarz algebra, which implies that every irreducible weight module over it with a nontrivial finite-dimensional weight space, is a Harish-Chandra module. Read More

Mining textual patterns in news, tweets, papers, and many other kinds of text corpora has been an active theme in text mining and NLP research. Previous studies adopt a dependency parsing-based pattern discovery approach. However, the parsing results lose rich context around entities in the patterns, and the process is costly for a corpus of large scale. Read More

An intersecting family of sets is trivial if all of its members share a common element. Hilton and Milner proved a strong stability result for the celebrated Erd\H{o}s--Ko--Rado theorem: when $n> 2k$, every non-trivial intersecting family of $k$-subsets of $[n]$ has at most $\binom{n-1}{k-1}-\binom{n-k-1}{k-1}+1$ members. One extremal family $\mathcal{HM}_{n, k}$ consists of a $k$-set $S$ and all $k$-subsets of $[n]$ containing a fixed element $x\not\in S$ and at least one element of $S$. Read More

In today's dynamic ICT environments, the ability to control users' access to resources becomes ever important. On the one hand, it should adapt to the users' changing needs; on the other hand, it should not be compromised. Therefore, it is essential to have a flexible access control model, incorporating dynamically changing context information. Read More

We measure momentum-resolved Raman spectra of a spin-polarized degenerate Fermi gas of $^{173}$Yb atoms for a wide range of magnetic fields, where the atoms are irradiated by a pair of counterpropagating Raman laser beams as in the conventional spin-orbit coupling scheme. Double resonance of first- and second-order Raman transitions occurs at a certain magnetic field and the spectrum exhibits a doublet splitting for high laser intensities. The measured spectral splitting is quantitatively accounted for by the Autler-Townes effect. Read More

Weakly-supervised object detection (WOD) is a challenging problems in computer vision. The key problem is to simultaneously infer the exact object locations in the training images and train the object detectors, given only the training images with weak image-level labels. Intuitively, by simulating the selective attention mechanism of human visual system, saliency detection technique can select attractive objects in scenes and thus is a potential way to provide useful priors for WOD. Read More

Understanding structural controllability of a complex network requires to identify a Minimum Input nodes Set (MIS) of the network. It has been suggested that finding an MIS is equivalent to computing a maximum matching of the network, where the unmatched nodes constitute an MIS. However, maximum matching of a network is often not unique, and finding all MISs may provide deep insights to the controllability of the network. Read More

**Authors:**CDF Collaboration, T. Aaltonen, M. G. Albrow, S. Amerio, D. Amidei, A. Anastassov, A. Annovi, J. Antos, G. Apollinari, J. A. Appel, T. Arisawa, A. Artikov, J. Asaadi, W. Ashmanskas, B. Auerbach, A. Aurisano, F. Azfar, W. Badgett, T. Bae, A. Barbaro-Galtieri, V. E. Barnes, B. A. Barnett, P. Barria, P. Bartos, M. Bauce, F. Bedeschi, S. Behari, G. Bellettini, J. Bellinger, D. Benjamin, A. Beretvas, A. Bhatti, K. R. Bland, B. Blumenfeld, A. Bocci, A. Bodek, D. Bortoletto, J. Boudreau, A. Boveia, L. Brigliadori, C. Bromberg, E. Brucken, J. Budagov, H. S. Budd, K. Burkett, G. Busetto, P. Bussey, P. Butti, A. Buzatu, A. Calamba, S. Camarda, M. Campanelli, F. Canelli, B. Carls, D. Carlsmith, R. Carosi, S. Carrillo, B. Casal, M. Casarsa, A. Castro, P. Catastini, D. Cauz, V. Cavaliere, A. Cerri, L. Cerrito, Y. C. Chen, M. Chertok, G. Chiarelli, G. Chlachidze, K. Cho, D. Chokheli, A. Clark, C. Clarke, M. E. Convery, J. Conway, M. Corbo, M. Cordelli, C. A. Cox, D. J. Cox, M. Cremonesi, D. Cruz, J. Cuevas, R. Culbertson, N. d'Ascenzo, M. Datta, P. de Barbaro, L. Demortier, M. Deninno, F. Devoto, M. D'Errico, A. Di Canto, B. Di Ruzza, J. R. Dittmann, M. D'Onofrio, S. Donati, M. Dorigo, A. Driutti, K. Ebina, R. Edgar, R. Erbacher, S. Errede, B. Esham, S. Farrington, J. P. Fernández Ramos, R. Field, G. Flanagan, R. Forrest, M. Franklin, J. C. Freeman, H. Frisch, Y. Funakoshi, C. Galloni, A. F. Garfinkel, P. Garosi, H. Gerberich, E. Gerchtein, S. Giagu, V. Giakoumopoulou, K. Gibson, C. M. Ginsburg, N. Giokaris, P. Giromini, V. Glagolev, D. Glenzinski, M. Gold, D. Goldin, A. Golossanov, G. Gomez, G. Gomez-Ceballos, M. Goncharov, O. González López, I. Gorelov, A. T. Goshaw, K. Goulianos, E. Gramellini, C. Grosso-Pilcher, J. Guimaraes da Costa, S. R. Hahn, J. Y. Han, F. Happacher, K. Hara, M. Hare, R. F. Harr, T. Harrington-Taber, K. Hatakeyama, C. Hays, J. Heinrich, M. Herndon, A. Hocker, Z. Hong, W. Hopkins, S. Hou, R. E. Hughes, U. Husemann, M. Hussein, J. Huston, G. Introzzi, M. Iori, A. Ivanov, E. James, D. Jang, B. Jayatilaka, E. J. Jeon, S. Jindariani, M. Jones, K. K. Joo, S. Y. Jun, T. R. Junk, M. Kambeitz, T. Kamon, P. E. Karchin, A. Kasmi, Y. Kato, W. Ketchum, J. Keung, B. Kilminster, D. H. Kim, H. S. Kim, J. E. Kim, M. J. Kim, S. B. Kim, S. H. Kim, Y. K. Kim, Y. J. Kim, N. Kimura, M. Kirby, K. Kondo, D. J. Kong, J. Konigsberg, A. V. Kotwal, M. Kreps, J. Kroll, M. Kruse, T. Kuhr, M. Kurata, A. T. Laasanen, S. Lammel, M. Lancaster, K. Lannon, G. Latino, H. S. Lee, J. S. Lee, S. Leo, S. Leone, J. D. Lewis, A. Limosani, E. Lipeles, A. Lister, Q. Liu, T. Liu, S. Lockwitz, A. Loginov, A. Lucà, D. Lucchesi, J. Lueck, P. Lujan, P. Lukens, G. Lungu, J. Lys, R. Lysak, R. Madrak, P. Maestro, S. Malik, G. Manca, A. Manousakis-Katsikakis, L. Marchese, F. Margaroli, P. Marino, K. Matera, M. E. Mattson, A. Mazzacane, P. Mazzanti, R. McNulty, A. Mehta, P. Mehtala, C. Mesropian, T. Miao, D. Mietlicki, A. Mitra, H. Miyake, S. Moed, N. Moggi, C. S. Moon, R. Moore, M. J. Morello, A. Mukherjee, Th. Muller, P. Murat, M. Mussini, J. Nachtman, Y. Nagai, J. Naganoma, I. Nakano, A. Napier, J. Nett, T. Nigmanov, L. Nodulman, S. Y. Noh, O. Norniella, L. Oakes, S. H. Oh, Y. D. Oh, T. Okusawa, R. Orava, L. Ortolan, C. Pagliarone, E. Palencia, P. Palni, V. Papadimitriou, W. Parker, G. Pauletta, M. Paulini, C. Paus, T. J. Phillips, G. Piacentino, E. Pianori, J. Pilot, K. Pitts, C. Plager, L. Pondrom, S. Poprocki, K. Potamianos, F. Prokoshin, A. Pranko, F. Ptohos, G. Punzi, I. Redondo Fernández, P. Renton, M. Rescigno, F. Rimondi, L. Ristori, A. Robson, T. Rodriguez, S. Rolli, M. Ronzani, R. Roser, J. L. Rosner, F. Ruffini, A. Ruiz, J. Russ, V. Rusu, W. K. Sakumoto, Y. Sakurai, L. Santi, K. Sato, V. Saveliev, A. Savoy-Navarro, P. Schlabach, E. E. Schmidt, T. Schwarz, L. Scodellaro, F. Scuri, S. Seidel, Y. Seiya, A. Semenov, F. Sforza, S. Z. Shalhout, T. Shears, P. F. Shepard, M. Shimojima, M. Shochet, I. Shreyber-Tecker, A. Simonenko, P. Sinervo, K. Sliwa, J. R. Smith, F. D. Snider, V. Sorin, H. Song, M. Stancari, R. St. Denis, D. Stentz, J. Strologas, Y. Sudo, A. Sukhanov, I. Suslov, K. Takemasa, Y. Takeuchi, J. Tang, M. Tecchio, P. K. Teng, J. Thom, E. Thomson, V. Thukral, D. Toback, S. Tokar, K. Tollefson, T. Tomura, D. Tonelli, S. Torre, D. Torretta, P. Totaro, M. Trovato, F. Ukegawa, S. Uozumi, F. Vázquez, G. Velev, C. Vellidis, C. Vernieri, M. Vidal, R. Vilar, J. Vizán, M. Vogel, G. Volpi, P. Wagner, R. Wallny, S. M. Wang, D. Waters, W. C. Wester III, D. Whiteson, A. B. Wicklund, S. Wilbur, H. H. Williams, J. S. Wilson, P. Wilson, B. L. Winer, P. Wittich, S. Wolbers, H. Wolfe, T. Wright, X. Wu, Z. Wu, K. Yamamoto, D. Yamato, T. Yang, U. K. Yang, Y. C. Yang, W. -M. Yao, G. P. Yeh, K. Yi, J. Yoh, K. Yorita, T. Yoshida, G. B. Yu, I. Yu, A. M. Zanetti, Y. Zeng, C. Zhou, S. Zucchelli

**Category:**High Energy Physics - Experiment

A measurement of the inclusive production cross section of isolated prompt photons in proton-antiproton collisions at center-of-mass energy $\sqrt{s}$=1.96TeV is presented. The results are obtained using the full Run II data sample collected with the Collider Detector at the Fermilab Tevatron, which corresponds to an integrated luminosity of 9. Read More

Remote sensing image scene classification plays an important role in a wide range of applications and hence has been receiving remarkable attention. During the past years, significant efforts have been made to develop various datasets or present a variety of approaches for scene classification from remote sensing images. However, a systematic review of the literature concerning datasets and methods for scene classification is still lacking. Read More

In this paper two types of multgrid methods, i.e., the Rayleigh quotient iteration and the inverse iteration with fixed shift, are developed for solving the Maxwell eigenvalue problem with discontinuous relative magnetic permeability and electric permittivity. Read More

As one of the fundamental tasks in text analysis, phrase mining aims at extracting quality phrases from a text corpus. Phrase mining is important in various tasks such as information extraction/retrieval, taxonomy construction, and topic modeling. Most existing methods rely on complex, trained linguistic analyzers, and thus likely have unsatisfactory performance on text corpora of new domains and genres without extra but expensive adaption. Read More

**Affiliations:**

^{1}ICC, Durham,

^{2}ICC, Durham,

^{3}Kavli, U Tokyo and ICC, Durham

In certain theories of modified gravity, solar system constraints on deviations from general relativity (GR) are satisfied by virtue of a so-called screening mechanism, which enables the theory to revert to GR in regions where the matter density is high or the gravitational potential is deep. In the case of chameleon theories, the screening has two contributions -- self-screening, which is due to the mass of an object itself, and environmental screening, which is caused by the surrounding matter -- which are often entangled, with the second contribution being more crucial for less massive objects. A quantitative understanding of the effect of the environment on the screening can prove critical in observational tests of such theories using systems such as the Local Group and dwarf galaxies, for which the environment may be inferred in various ways. Read More

As a result of several successful applications in computer vision and image processing, sparse representation (SR) has attracted significant attention in multi-sensor image fusion. Unlike the traditional multiscale transforms (MSTs) that presume the basis functions, SR learns an over-complete dictionary from a set of training images for image fusion, and it achieves more stable and meaningful representations of the source images. By doing so, the SR-based fusion methods generally outperform the traditional MST-based image fusion methods in both subjective and objective tests. Read More

A high-modulation-efficiency optical modulator integrated on silicon (Si) is a key enabler for low-power and high-capacity optical interconnects. However, Si-based optical modulators suffer from low phase modulation efficiency owing to the weak plasma dispersion effect in Si. Therefore, it is essential to find a novel modulation scheme that is compatible with a Si photonics platform. Read More

Spin information carried by magnons is attractive for computing technology and the development of magnon-based computing circuits is of great interest. However, magnon transport in insulators has been challenging, different from the clear physical picture for spin transport in conductors. Here we investigate the lateral transport properties of thermally excited magnons in yttrium iron garnet (YIG), a model magnetic insulator. Read More

Efficient methods for converting microwave and terahertz radiation into optical fields and vice versa have a tremendous potential for developing next-generation classical and quantum technologies. For example, these methods would facilitate the detection and imaging of millimeter waves with various applications in medicine, security screening and avionics. In the quantum domain, coherent microwave-optical conversion is essential for realizing quantum hybrid systems where spin systems or superconducting qubits are coupled to optical photons that can be transported with low noise in optical fibres. Read More

Given $3 \leq k \leq s$, we say that a $k$-uniform hypergraph $C^k_s$ is a tight cycle on $s$ vertices if there is a cyclic ordering of the vertices of $C^k_s$ such that every $k$ consecutive vertices under this ordering form an edge. We prove that if $k \ge 3$ and $s \ge 2k^2$, then every $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $(1/2 + o(1))n$ has the property that every vertex is covered by a copy of $C^k_s$. Our result is asymptotically best possible for infinitely many pairs of $s$ and $k$, e. Read More

**Authors:**Minerva Collaboration, L. Ren, L. Aliaga, O. Altinok, L. Bellantoni, A. Bercellie, M. Betancourt, A. Bodek, A. Bravar, H. Budd, T. Cai, M. F. Carneiro, H. da Motta, S. A. Dytman, G. A. Diaz, B. Eberly, E. Endress, J. Felix, L. Fields, R. Fine, A. M. Gago, R. Galindo, H. Gallagher, A. Ghosh, T. Golan, R. Gran, J. Y. Han, D. A. Harris, K. Hurtado, M. Kiveni, J. Kleykamp, M. Kordosky, T. Le, E. Maher, S. Manly, W. A. Mann, C. M. Marshall, D. A. Martinez Caicedo, K. S. McFarland, C. L. McGivern, A. M. McGowan, B. Messerly, J. Miller, A. Mislivec, J. G. Morfin, J. Mousseau, D. Naples, J. K. Nelson, A. Norrick, Nuruzzaman, V. Paolone, J. Park, C. E. Patrick, G. N. Perdue, M. A. Ramirez, R. D. Ransome, H. Ray, D. Rimal, P. A. Rodrigues, D. Ruterbories, H. Schellman, C. J. Solano Salinas, M. Sultana, S. Sanchez Falero, E. Valencia, T. Walton, J. Wolcott, M. Wospakrik, B. Yaeggy

**Category:**High Energy Physics - Experiment

We present measurements of the neutrino and antineutrino total charged-current cross sections on carbon and their ratio using the MINERvA scintillator-tracker. The measurements span the energy range 2-22 GeV and were performed using forward and reversed horn focusing modes of the Fermilab low-energy NuMI beam to obtain large neutrino and antineutrino samples. The flux is obtained using a sub-sample of charged-current events at low hadronic energy transfer along with precise higher energy external neutrino cross section data overlapping with our energy range between 12-22 GeV. Read More

Stable luminescent pi-radicals with doublet emission have aroused a growing interest for functional molecular materials. We have demonstrated a neutral pi-radical dye (4-N-carbazolyl-2,6-dichlorophenyl)bis(2,4,6-trichlorophenyl)-methyl (TTM-1Cz) with remarkable doublet emission, which could be used as triplet sensitizer to initiate the photophysical process of triplet-triplet annihilation photon upconversion (TTA-UC). Dexter-like excited doublet-triplet energy transfer (DTET) was confirmed by theoretical calculation. Read More

Strain engineering has attracted great attention, particularly for epitaxial films grown on a different substrate. Residual strains of SiC have been widely employed to form ultra-high frequency and high Q factor resonators. However, to date the highest residual strain of SiC was reported to be limited to approximately 0. Read More

Given two $k$-graphs ($k$-uniform hypergraphs) $F$ and $H$, a perfect $F$-tiling (or an $F$-factor) in $H$ is a set of vertex disjoint copies of $F$ that together cover the vertex set of $H$. For all complete $k$-partite $k$-graphs $K$, Mycroft proved a minimum codegree condition that guarantees a $K$-factor in an $n$-vertex $k$-graph, which is tight up to an error term $o(n)$. In this paper we improve the error term in Mycroft's result to a sub-linear term that relates to the Tur\'an number of $K$ when the differences of the sizes of the vertex classes of $K$ are co-prime. Read More

The trimer resonating valence bond (tRVB) state consisting of an equal-weight superposition of trimer coverings on a square lattice is proposed. A model Hamiltonian of the Rokhsar-Kivelson type for which the tRVB becomes the exact ground state is written. The state is shown to have $9^g$ topological degeneracy on genus g surface and support $Z_3$ vortex excitations. Read More

In the last decade we have witnessed a rapid growth in data center systems, requiring new and highly complex networking devices. The need to refresh networking infrastructure whenever new protocols or functions are introduced, and the increasing costs that this entails, are of a concern to all data center providers. New generations of Systems on Chip (SoC), integrating microprocessors and higher bandwidth interfaces, are an emerging solution to this problem. Read More

Aiming at improving the efficiency and accuracy of community detection in complex networks, we proposed a new algorithm, which is based on the idea that communities could be detected from subnetworks by comparing the internal and external cohesion of each subnetwork. In our method, similar nodes are firstly gathered into meta-communities, which are then decided to be retained or merged through a multilevel label propagation process, until all of them meet our community criterion. Our algorithm requires neither any priori information of communities nor optimization of any objective function. Read More

This paper proposes a shoulder inverse kinematics (IK) technique. Shoulder complex is comprised of the sternum, clavicle, ribs, scapula, humerus, and four joints. The shoulder complex shows specific motion pattern, such as Scapulo humeral rhythm. Read More

The label propagation algorithm (LPA) has been proved to be a fast and effective method for detecting communities in large complex networks. However, its performance is subject to the non-stable and trivial solutions of the problem. In this paper, we propose a modified label propagation algorithm LPAf to efficiently detect community structures in networks. Read More

For $k\ge 3$ and $\epsilon>0$, let $H$ be a $k$-partite $k$-graph with parts $V_1,\dots, V_k$ each of size $n$, where $n$ is sufficiently large. Assume that for each $i\in [k]$, every $(k-1)$-set in $\prod_{j\in [k]\setminus \{i\}} V_i$ lies in at least $a_i$ edges, and $a_1\ge a_2\ge \cdots \ge a_k$. We show that if $a_1, a_2\ge \epsilon n$, then $H$ contains a matching of size $\min\{n-1, \sum_{i\in [k]}a_i\}$. Read More

Many real world stochastic control problems suffer from the "curse of dimensionality". To overcome this difficulty, we develop a deep learning approach that directly solves high-dimensional stochastic control problems based on Monte-Carlo sampling. We approximate the time-dependent controls as feedforward neural networks and stack these networks together through model dynamics. Read More

Most real-world data can be modeled as heterogeneous information networks (HINs) consisting of vertices of multiple types and their relationships. Search for similar vertices of the same type in large HINs, such as bibliographic networks and business-review networks, is a fundamental problem with broad applications. Although similarity search in HINs has been studied previously, most existing approaches neither explore rich semantic information embedded in the network structures nor take user's preference as a guidance. Read More

In the literature, two series of models have been proposed to address prediction problems including classification and regression. Simple models, such as generalized linear models, have ordinary performance but strong interpretability on a set of simple features. The other series, including tree-based models, organize numerical, categorical and high dimensional features into a comprehensive structure with rich interpretable information in the data. Read More

Extracting entities and relations for types of interest from text is important for understanding massive text corpora. Traditionally, systems of entity relation extraction have relied on human-annotated corpora for training and adopted an incremental pipeline. Such systems require additional human expertise to be ported to a new domain, and are vulnerable to errors cascading down the pipeline. Read More

**Authors:**CDF Collaboration, T. Aaltonen, S. Amerio, D. Amidei, A. Anastassov, A. Annovi, J. Antos, G. Apollinari, J. A. Appel, T. Arisawa, A. Artikov, J. Asaadi, W. Ashmanskas, B. Auerbach, A. Aurisano, F. Azfar, W. Badgett, T. Bae, A. Barbaro-Galtieri, V. E. Barnes, B. A. Barnett, P. Barria, P. Bartos, M. Bauce, F. Bedeschi, S. Behari, G. Bellettini, J. Bellinger, D. Benjamin, A. Beretvas, A. Bhatti, K. R. Bland, B. Blumenfeld, A. Bocci, A. Bodek, D. Bortoletto, J. Boudreau, A. Boveia, L. Brigliadori, C. Bromberg, E. Brucken, J. Budagov, H. S. Budd, K. Burkett, G. Busetto, P. Bussey, P. Butti, A. Buzatu, A. Calamba, S. Camarda, M. Campanelli, F. Canelli, B. Carls, D. Carlsmith, R. Carosi, S. Carrillo, B. Casal, M. Casarsa, A. Castro, P. Catastini, D. Cauz, V. Cavaliere, A. Cerri, L. Cerrito, Y. C. Chen, M. Chertok, G. Chiarelli, G. Chlachidze, K. Cho, D. Chokheli, A. Clark, C. Clarke, M. E. Convery, J. Conway, M. Corbo, M. Cordelli, C. A. Cox, D. J. Cox, M. Cremonesi, D. Cruz, J. Cuevas, R. Culbertson, N. d'Ascenzo, M. Datta, P. de Barbaro, L. Demortier, M. Deninno, F. Devoto, M. D'Errico, A. Di Canto, B. Di Ruzza, J. R. Dittmann, M. D'Onofrio, S. Donati, M. Dorigo, A. Driutti, K. Ebina, R. Edgar, R. Erbacher, S. Errede, B. Esham, S. Farrington, J. P. Fernández Ramos, R. Field, G. Flanagan, R. Forrest, M. Franklin, J. C. Freeman, H. Frisch, Y. Funakoshi, C. Galloni, A. F. Garfinkel, P. Garosi, H. Gerberich, E. Gerchtein, S. Giagu, V. Giakoumopoulou, K. Gibson, C. M. Ginsburg, N. Giokaris, P. Giromini, V. Glagolev, D. Glenzinski, M. Gold, D. Goldin, A. Golossanov, G. Gomez, G. Gomez-Ceballos, M. Goncharov, O. González López, I. Gorelov, A. T. Goshaw, K. Goulianos, E. Gramellini, C. Grosso-Pilcher, J. Guimaraes da Costa, S. R. Hahn, J. Y. Han, F. Happacher, K. Hara, M. Hare, R. F. Harr, T. Harrington-Taber, K. Hatakeyama, C. Hays, J. Heinrich, M. Herndon, A. Hocker, Z. Hong, W. Hopkins, S. Hou, R. E. Hughes, U. Husemann, M. Hussein, J. Huston, G. Introzzi, M. Iori, A. Ivanov, E. James, D. Jang, B. Jayatilaka, E. J. Jeon, S. Jindariani, M. Jones, K. K. Joo, S. Y. Jun, T. R. Junk, M. Kambeitz, T. Kamon, P. E. Karchin, A. Kasmi, Y. Kato, W. Ketchum, J. Keung, B. Kilminster, D. H. Kim, H. S. Kim, J. E. Kim, M. J. Kim, S. B. Kim, S. H. Kim, Y. K. Kim, Y. J. Kim, N. Kimura, M. Kirby, K. Kondo, D. J. Kong, J. Konigsberg, A. V. Kotwal, M. Kreps, J. Kroll, M. Kruse, T. Kuhr, M. Kurata, A. T. Laasanen, S. Lammel, M. Lancaster, K. Lannon, G. Latino, H. S. Lee, J. S. Lee, S. Leo, S. Leone, J. D. Lewis, A. Limosani, E. Lipeles, A. Lister, Q. Liu, T. Liu, S. Lockwitz, A. Loginov, A. Lucà, D. Lucchesi, J. Lueck, P. Lujan, P. Lukens, G. Lungu, J. Lys, R. Lysak, R. Madrak, P. Maestro, S. Malik, G. Manca, A. Manousakis-Katsikakis, L. Marchese, F. Margaroli, P. Marino, K. Matera, M. E. Mattson, A. Mazzacane, P. Mazzanti, R. McNulty, A. Mehta, P. Mehtala, C. Mesropian, T. Miao, D. Mietlicki, A. Mitra, H. Miyake, S. Moed, N. Moggi, C. S. Moon, R. Moore, M. J. Morello, A. Mukherjee, Th. Muller, P. Murat, M. Mussini, J. Nachtman, Y. Nagai, J. Naganoma, I. Nakano, A. Napier, J. Nett, T. Nigmanov, L. Nodulman, S. Y. Noh, O. Norniella, L. Oakes, S. H. Oh, Y. D. Oh, T. Okusawa, R. Orava, L. Ortolan, C. Pagliarone, E. Palencia, P. Palni, V. Papadimitriou, W. Parker, G. Pauletta, M. Paulini, C. Paus, T. J. Phillips, G. Piacentino, E. Pianori, J. Pilot, K. Pitts, C. Plager, L. Pondrom, S. Poprocki, K. Potamianos, F. Prokoshin, A. Pranko, F. Ptohos, G. Punzi, I. Redondo Fernández, P. Renton, M. Rescigno, F. Rimondi, L. Ristori, A. Robson, T. Rodriguez, S. Rolli, M. Ronzani, R. Roser, J. L. Rosner, F. Ruffini, A. Ruiz, J. Russ, V. Rusu, W. K. Sakumoto, Y. Sakurai, L. Santi, K. Sato, V. Saveliev, A. Savoy-Navarro, P. Schlabach, E. E. Schmidt, T. Schwarz, L. Scodellaro, F. Scuri, S. Seidel, Y. Seiya, A. Semenov, F. Sforza, S. Z. Shalhout, T. Shears, P. F. Shepard, M. Shimojima, M. Shochet, I. Shreyber-Tecker, A. Simonenko, K. Sliwa, J. R. Smith, F. D. Snider, V. Sorin, H. Song, M. Stancari, R. St. Denis, D. Stentz, J. Strologas, Y. Sudo, A. Sukhanov, I. Suslov, K. Takemasa, Y. Takeuchi, J. Tang, M. Tecchio, P. K. Teng, J. Thom, E. Thomson, V. Thukral, D. Toback, S. Tokar, K. Tollefson, T. Tomura, D. Tonelli, S. Torre, D. Torretta, P. Totaro, M. Trovato, F. Ukegawa, S. Uozumi, F. Vázquez, G. Velev, C. Vellidis, C. Vernieri, M. Vidal, R. Vilar, J. Vizán, M. Vogel, G. Volpi, P. Wagner, R. Wallny, S. M. Wang, D. Waters, W. C. Wester III, D. Whiteson, A. B. Wicklund, S. Wilbur, H. H. Williams, J. S. Wilson, P. Wilson, B. L. Winer, P. Wittich, S. Wolbers, H. Wolfe, T. Wright, X. Wu, Z. Wu, K. Yamamoto, D. Yamato, T. Yang, U. K. Yang, Y. C. Yang, W. -M. Yao, G. P. Yeh, K. Yi, J. Yoh, K. Yorita, T. Yoshida, G. B. Yu, I. Yu, A. M. Zanetti, Y. Zeng, C. Zhou, S. Zucchelli

**Category:**High Energy Physics - Experiment

We report on a measurement of the $D^{+}$-meson production cross section as a function of transverse momentum ($p_T$) in proton-antiproton ($p\bar{p}$) collisions at 1.96 TeV center-of-mass energy, using the full data set collected by the Collider Detector at Fermilab in Tevatron Run II and corresponding to 10 fb$^{-1}$ of integrated luminosity. We use $D^{+} \to K^-\pi^+\pi^+$ decays fully reconstructed in the central rapidity region $|y|<1$ with transverse momentum down to 1. Read More

Many countries are suffering from severe air pollution. Understanding how different air pollutants accumulate and propagate is critical to making relevant public policies. In this paper, we use urban big data (air quality data and meteorological data) to identify the \emph{spatiotemporal (ST) causal pathways} for air pollutants. Read More