cssi/SciSciGPT-SciSciNet huggingface dataset:
Wiretap channel capacity: Secrecy criteria, strong converse, and phase change

This paper employs equal-image-size source partitioning techniques to derive the capacities of the general discrete memoryless wiretap channel (DM-WTC) under four different secrecy criteria. These criteria respectively specify requirements on the expected values and tail probabilities of the differences, in absolute value and in exponent, between the joint probability of the secret message and the eavesdropper's observation and the corresponding probability if they were independent. Some of these criteria reduce back to the standard leakage and variation distance constraints that have been previously considered in the literature. The capacities under these secrecy criteria are found to be different when non-vanishing error and secrecy tolerances are allowed. Based on these new results, we are able to conclude that the strong converse property generally holds for the DM-WTC only under the two secrecy criteria based on constraining the tail probabilities. Under the secrecy criteria based on the expected values, an interesting phase change phenomenon is observed as the tolerance values vary.
User Effort and Network Structure Mediate Access to Information in Networks

Individuals' access to information in a social network depends on its distributed and where in the network individuals position themselves. However, individuals have limited capacity to manage their social connections and process information. In this work, we study how this limited capacity and network structure interact to affect the diversity of information social media users receive. Previous studies of the role of networks in information access were limited in their ability to measure the diversity of information. We address this problem by learning the topics of interest to social media users by observing messages they share online with their followers. We present a probabilistic model that incorporates human cognitive constraints in a generative model of information sharing. We then use the topics learned by the model to measure the diversity of information users receive from their social media contacts.We confirm that users in structurally diverse network positions, which bridge otherwise disconnected regions of the follower graph, are exposed to more diverse information. In addition, we identify user effort as an important variable that mediates access to diverse information in social media.Users who invest more effort into their activity on the site not only place themselves in more structurally diverse positions within the network than the less engaged users, but they also receive more diverse information when located in similar network positions.These findings indicate that the relationship between network structure and access to information in networks is more nuanced than previously thought.
Poset pattern-avoidance problems posed by Yakoubov

Extending the work of Yakoubov, we enumerate the linear extensions of comb posets that avoid certain length-$3$ patterns. We resolve many of Yakoubov's open problems and prove both of the conjectures from her paper.
Chromatic quasisymmetric functions

Abstract We introduce a quasisymmetric refinement of Stanley's chromatic symmetric function. We derive refinements of both Gasharov's Schur-basis expansion of the chromatic symmetric function and Chow's expansion in Gessel's basis of fundamental quasisymmetric functions. We present a conjectural refinement of Stanley's power sum basis expansion, which we prove in special cases. We describe connections between the chromatic quasisymmetric function and both the q-Eulerian polynomials introduced in our earlier work and, conjecturally, representations of symmetric groups on cohomology of regular semisimple Hessenberg varieties, which have been studied by Tymoczko and others. We discuss an approach, using the results and conjectures herein, to the e-positivity conjecture of Stanley and Stembridge for incomparability graphs of ( 3 + 1 ) -free posets.
Neural networks and rational functions

Neural networks and rational functions efficiently approximate each other. In more detail, it is shown here that for any ReLU network, there exists a rational function of degree $O(\text{polylog}(1/\epsilon))$ which is $\epsilon$-close, and similarly for any rational function there exists a ReLU network of size $O(\text{polylog}(1/\epsilon))$ which is $\epsilon$-close. By contrast, polynomials need degree $\Omega(\text{poly}(1/\epsilon))$ to approximate even a single ReLU. When converting a ReLU network to a rational function as above, the hidden constants depend exponentially on the number of layers, which is shown to be tight; in other words, a compositional representation can be beneficial even for rational functions.
Global Regularity for 2d Water Waves with Surface Tension

We consider the full irrotational water waves system with surface tension and no gravity in dimension two (the capillary waves system), and prove global regularity and modified scattering for suitably small and localized perturbations of a flat interface. An important point of our analysis is to develop a sufficiently robust method (the “quasilinear I-method”) which allows us to deal with strong singularities arising from time resonances in the applications of the normal form method (the so-called “division problem”). As a result, we are able to consider a suitable class of perturbations with finite energy, but no other momentum conditions. Part of our analysis relies on a new treatment of the Dirichlet-Neumann operator in dimension two which is of independent interest. As a consequence, the results in this paper are self-contained.
Physics Beyond the Standard Model and Dark Matter

This chapter discusses the physics beyond the standard model and dark matter. The dark matter of the universe is established to be not made of particles requiting physics beyond the standard model. The main paradigm for dark matter is weakly interactive massive particle (WIMPs), TeV-scale particles produced by the Big Bang that naturally give the correct order of magnitude for its abundance. The examples of physics beyond the standard model discussed are: supersymmetry, composite Higgs; and extra dimensions. The chapter provides the evidence for dark matter. WIMP is the main current paradigm for explaining dark matter of the universe. With respect to the WIMP model, the chapter solves the Boltzmann equations numerically and studies a concrete model of a new particle for dark matter candidate. Dark horse candidates such as gravitino, axion, and some other candidates are discussed. In addition, the chapter discusses cosmic coincidence.
Coinvariants of Lie algebras of vector fields on algebraic varieties

We prove that the space of coinvariants of functions on an affine variety by a Lie algebra of vector fields whose flow generates finitely many leaves is finite-dimensional. Cases of the theorem include Poisson (or more generally Jacobi) varieties with finitely many symplectic leaves under Hamiltonian flow, complete intersections in Calabi-Yau varieties with isolated singularities under the flow of incompressible vector fields, quotients of Calabi-Yau varieties by finite volume-preserving groups under the incompressible vector fields, and arbitrary varieties with isolated singularities under the flow of all vector fields. We compute this quotient explicitly in many of these cases. The proofs involve constructing a natural D-module representing the invariants under the flow of the vector fields, which we prove is holonomic if it has finitely many leaves (and whose holonomicity we study in more detail). We give many counterexamples to naive generalizations of our results. These examples have been a source of motivation for us.
TIE-POINTS AND FIXED-POINTS IN N ⁄

Abstract A point x is a (bow) tie-point of a space X if X ∖ { x } can be partitioned into relatively clopen sets each with x in its closure. Tie-points have appeared in the construction of non-trivial autohomeomorphisms of β N ∖ N (e.g. [S. Shelah, J. Steprāns, Martin's axiom is consistent with the existence of nowhere trivial automorphisms, Proc. Amer. Math. Soc. 130 (7) (2002) 2097–2106 (electronic). MR 1896046 (2003k:03063), B. Velickovic, OCA and automorphisms of P ( ω ) / fin , Topology Appl. 49 (1) (1993) 1–13]) and in the recent study of (precisely) 2-to-1 maps on β N ∖ N . In these cases the tie-points have been the unique fixed point of an involution on β N ∖ N . This paper is motivated by the search for 2-to-1 maps and obtaining tie-points of strikingly differing characteristics.
Proof of a conjecture on monomial graphs

Abstract Let e be a positive integer, p be an odd prime, q = p e , and F q be the finite field of q elements. Let f , g ∈ F q [ X , Y ] . The graph G q ( f , g ) is a bipartite graph with vertex partitions P = F q 3 and L = F q 3 , and edges defined as follows: a vertex ( p ) = ( p 1 , p 2 , p 3 ) ∈ P is adjacent to a vertex [ l ] = [ l 1 , l 2 , l 3 ] ∈ L if and only if p 2 + l 2 = f ( p 1 , l 1 ) and p 3 + l 3 = g ( p 1 , l 1 ) . If f = X Y and g = X Y 2 , the graph G q ( X Y , X Y 2 ) contains no cycles of length less than eight and is edge-transitive. Motivated by certain questions in extremal graph theory and finite geometry, people search for examples of graphs G q ( f , g ) containing no cycles of length less than eight and not isomorphic to the graph G q ( X Y , X Y 2 ) , even without requiring them to be edge-transitive. So far, no such graphs G q ( f , g ) have been found. It was conjectured that if both f and g are monomials, then no such graphs exist. In this paper we prove the conjecture.
LARGER PLANET RADII INFERRED FROM STELLAR ''FLICKER'' BRIGHTNESS VARIATIONS OF BRIGHT PLANET-HOST STARS

Most extrasolar planets have been detected by their influence on their parent star, typically either gravitationally (the Doppler method) or by the small dip in brightness as the planet blocks a portion of the star (the transit method). Therefore, the accuracy with which we know the masses and radii of extrasolar planets depends directly on how well we know those of the stars, the latter usually determined from the measured stellar surface gravity, log g. Recent work has demonstrated that the short-timescale brightness variations ({sup f}licker{sup )} of stars can be used to measure log g to a high accuracy of ∼0.1-0.2 dex. Here, we use flicker measurements of 289 bright (Kepmag < 13) candidate planet-hosting stars with T {sub eff} = 4500-6650 K to re-assess the stellar parameters and determine the resulting impact on derived planet properties. This re-assessment reveals that for the brightest planet-host stars, Malmquist bias contaminates the stellar sample with evolved stars: nearly 50% of the bright planet-host stars are subgiants. As a result, the stellar radii, and hence the radii of the planets orbiting these stars, are on average 20%-30% larger than previous measurements had suggested.
DISCRETE SOLITONS IN INFINITE REDUCED WORDS

We consider a discrete dynamical system where the roles of the states and the carrier are played by translations in an affine Weyl group of type A. The Coxeter generators are enriched by parameters, and the interactions with the carrier are realized using Lusztig’s braid move (a, b, c) ↦ (bc/(a+c), a+c, ab/(a+c)). We use wiring diagrams on a cylinder to interpret chamber variables as τ-functions. This allows us to realize our systems as reductions of the Hirota bilinear difference equation and thus obtain N-soliton solutions.
A deep reinforcement learning-based framework for content caching

Content caching at the edge nodes is a promising technique to reduce the data traffic in next-generation wireless networks. Inspired by the success of Deep Reinforcement Learning (DRL) in solving complicated control problems, this work presents a DRL-based framework with Wolpertinger architecture for content caching at the base station. The proposed framework is aimed at maximizing the long-term cache hit rate, and it requires no knowledge of the content popularity distribution. To evaluate the proposed framework, we compare the performance with other caching algorithms, including Least Recently Used (LRU), Least Frequently Used (LFU), and First-In First-Out (FIFO) caching strategies. Meanwhile, since the Wolpertinger architecture can effectively limit the action space size, we also compare the performance with Deep Q-Network to identify the impact of dropping a portion of the actions. Our results show that the proposed framework can achieve improved short-term cache hit rate and improved and stable long-term cache hit rate in comparison with LRU, LFU, and FIFO schemes. Additionally, the performance is shown to be competitive in comparison to Deep Q-learning, while the proposed framework can provide significant savings in runtime.
$L^2$-reducibility and localization for quasiperiodic operators

We give a simple argument that if a quasiperiodic multi-frequency Schrodinger cocycle is reducible to a constant rotation for almost all energies with respect to the density of states measure, then the spectrum of the dual operator is purely point for Lebesgue almost all values of the ergodic parameter θ. The result holds in the L setting provided, in addition, that the conjugation preserves the fibered rotation number. Corollaries include localization for (long-range) 1D analytic potentials with dual ac spectrum and Diophantine frequency as well as a new result on multidimensional localization.
A simple proof of the closed graph theorem

Assume that A is a closed linear operator defined on all of a Hilbert space H . Then, A is bounded. This classical theorem is proved on the basis of uniform boundedness principle. The proof is easily extended to Banach spaces.
Unparticle-enhanced black holes at the LHC

Abstract Based on the idea that tensor unparticles can enhance the gravitational interactions between standard model particles, potential black hole formation in high energy collisions is examined. Modifications to the horizon radius r H are derived, and the corresponding geometric cross-sections of such objects are calculated. It is shown that r H increases dramatically to the electroweak scale for masses M BH ∼ 1 – 10 TeV , yielding a geometric cross-section σ BH = π r H 2 on the order of ⩽ 50 pb . This suggests that unparticle physics provides a mechanism for black hole formation in future accelerators, without the requirement of extra spatial dimensions.
Homomorphism Complexes and k-Cores

Abstract For any fixed graph G , we prove that the topological connectivity of the graph homomorphism complex Hom( G , K m ) is at least m − D ( G ) − 2 , where D ( G ) = max H ⊆ G δ ( H ) , for δ ( H ) the minimum degree of a vertex in a subgraph H . This generalizes a theorem of Cukic and Kozlov, in which the maximum degree Δ ( G ) was used in place of D ( G ) , and provides a high-dimensional analogue of the graph theoretic bound for chromatic number, χ ( G ) ≤ D ( G ) + 1 , as χ ( G ) = min { m : Hom ( G , K m ) ≠ ∅ } . Furthermore, we use this result to examine homological phase transitions in the random polyhedral complexes Hom ( G ( n , p ) , K m ) when p = c ∕ n for a fixed constant c > 0 .
A differential analysis of the power flow equations

The AC power flow equations are fundamental in all aspects of power systems planning and operations. They are routinely solved using Newton-Raphson like methods. However, there is little theoretical understanding of when these algorithms are guaranteed to find a solution of the power flow equations or how long they may take to converge. Further, it is known that in general these equations have multiple solutions and can exhibit chaotic behavior. In this paper, we show that the power flow equations can be solved efficiently provided that the solution lies in a certain set. We introduce a family of convex domains, characterized by Linear Matrix Inequalities, in the space of voltages such that there is at most one power flow solution in each of these domains. Further, if a solution exists in one of these domains, it can be found efficiently, and if one does not exist, a certificate of non-existence can also be obtained efficiently. The approach is based on the theory of monotone operators and related algorithms for solving variational inequalities involving monotone operators. We validate our approach on IEEE test networks and show that practical power flow solutions lie within an appropriately chosen convex domain.
On factor-free Dyck words with half-integer slope

Abstract We study a class of rational Dyck paths with slope 2 m + 1 2 corresponding to factor-free Dyck words, as introduced by P. Duchon. We show that, for the slopes considered in this paper, the language of factor-free Dyck words is generated by an auxiliary language that we examine from the algebraic and combinatorial points of view. We provide a lattice path description of this language, and give an explicit enumeration formula in terms of partial Bell polynomials. As a corollary, we obtain new formulas for the number of associated factor-free generalized Dyck words.
Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees

Decision making using simulation analysis faces the risk of being adversely affected by insufficiently calibrated input models. This risk is especially significant when only limited historical obse...
Advanced datapath synthesis using graph isomorphism

This paper presents an advanced DAG-based algorithm for datapath synthesis that targets area minimization using logic-level resource sharing. The problem of identifying common specification logic is formulated using unweighted graph isomorphism problem, in contrast to a weighted graph isomorphism using AIGs. In the context of gate-level datapath circuits, our algorithm solves the unweighted graph isomorphism problem in linear time. The experiments are conducted within an industrial synthesis flow that includes the complete high-level synthesis, logic synthesis and placement and route procedures. Experimental results show a significant runtime improvements compared to the existing datapath synthesis algorithms.
A refinement of sharply $F$-pure and strongly $F$-regular pairs

We point out that the usual argument used to prove that R is strongly F- regular if and only if RQ is strongly F-regular for every prime ideal Q 2 SpecR, does not generalize to the case of pairs (R, a t ). The author's definition of sharp F-purity for pairs (R, a t ) suffers from the same defect. We therefore propose different definitions of sharply F-pure and strongly F-regular pairs. Our new definitions agree with the old definitions in several common contexts, including the case that R is a local ring.
Optimized solar photovoltaic generation in a real local distribution network

Remarkable penetration of renewable energy in electric networks, despite its valuable opportunities, such as power loss reduction and loadability improvements, has raised concerns for system operators. Such huge penetration can lead to a violation of the grid requirements, such as voltage and current limits and reverse power flow. Optimal placement and sizing of Distributed Generation (DG) are one of the best ways to strengthen the efficiency of the power systems. This paper builds a simulation model for the local distribution network based on obtained load profiles, GIS information, solar insolation, feeder and voltage settings, and define the optimization problem of solar PVDG installation to determine the optimal siting and sizing for different penetration levels with different objective functions. The objective functions include voltage profile improvement and energy loss minimization and the considered constraints include the physical distribution network constraints (AC power flow), the PV capacity constraint, and the voltage and reverse power flow constraints.
Tweeting the Mind and Instagramming the Heart: Exploring Differentiated Content Sharing on Social Media

Understanding the usage of multiple Online Social Networks (OSNs) is of significant research interest as it helps in identifying the distinguishing traits of each social media platform that contribute to its continued existence. A comparison between two OSNs is particularly useful when it is done on the representative set of users holding active accounts on both the platforms. In this research, we collected a set of users holding accounts on both Twitter and Instagram. An extensive textual and visual analysis on the media content posted by these users reveals that these platforms are indeed perceived differently at a fundamental level with Instagram engaging more of the users' heart and Twitter capturing more of their mind. These differences get reflected in the linguistic, topical and visual aspects of the user posts.
End-to-end Neural Coreference Resolution

We introduce the first end-to-end coreference resolution model and show that it significantly outperforms all previous work without using a syntactic parser or hand-engineered mention detector. The key idea is to directly consider all spans in a document as potential mentions and learn distributions over possible antecedents for each. The model computes span embeddings that combine context-dependent boundary representations with a head-finding attention mechanism. It is trained to maximize the marginal likelihood of gold antecedent spans from coreference clusters and is factored to enable aggressive pruning of potential mentions. Experiments demonstrate state-of-the-art performance, with a gain of 1.5 F1 on the OntoNotes benchmark and by 3.1 F1 using a 5-model ensemble, despite the fact that this is the first approach to be successfully trained with no external resources.
Separating a Voronoi Diagram via Local Search

Given a set P of n points in R^d , we show how to insert a set Z of O(n^(1-1/d)) additional points, such that P can be broken into two sets P1 and P2 , of roughly equal size, such that in the Voronoi diagram V(P u Z), the cells of P1 do not touch the cells of P2; that is, Z separates P1 from P2 in the Voronoi diagram (and also in the dual Delaunay triangulation). In addition, given such a partition (P1,P2) of P , we present an approximation algorithm to compute a minimum size separator realizing this partition. We also present a simple local search algorithm that is a PTAS for approximating the optimal Voronoi partition.
Weak Rudin-Keisler reductions on projective ideals

We consider a slightly modified form of the standard Rudin-Keisler order on ideals and demonstrate the existence of complete (with respect to this order) ideals in various projective classes. Using our methods, we obtain a simple proof of Hjorth's theorem on the existence of a complete $\mathbf \Pi^1_1$ equivalence relation. Our proof of Hjorth's theorem enables us (under PD) to generalize his result to the classes of $\mathbf \Pi^1_{2n+1}$ equivalence relations.
SIGMA WEB INTERFACE FOR REACTOR DATA APPLICATIONS

We present Sigma Web interface which provides user-friendly access for online analysis and plotting of the evaluated and experimental nuclear reaction data stored in the ENDF-6 and EXFOR formats. The interface includes advanced browsing and search capabilities, interactive plots of cross sections, angular distributions and spectra, nubars, comparisons between evaluated and experimental data, computations for cross section data sets, pre-calculated integral quantities, neutron cross section uncertainties plots and visualization of covariance matrices. Sigma is publicly available at the National Nuclear Data Center website at http://www.nndc.bnl.gov/sigma.
Fractional elliptic equations, Caccioppoli estimates and regularity

Abstract Let L = − div x ( A ( x ) ∇ x ) be a uniformly elliptic operator in divergence form in a bounded domain Ω. We consider the fractional nonlocal equations { L s u = f , in Ω , u = 0 , on ∂ Ω , and { L s u = f , in Ω , ∂ A u = 0 , on ∂ Ω . Here L s , 0 s 1 , is the fractional power of L and ∂ A u is the conormal derivative of u with respect to the coefficients A ( x ) . We reproduce Caccioppoli type estimates that allow us to develop the regularity theory. Indeed, we prove interior and boundary Schauder regularity estimates depending on the smoothness of the coefficients A ( x ) , the right hand side f and the boundary of the domain. Moreover, we establish estimates for fundamental solutions in the spirit of the classical result by Littman–Stampacchia–Weinberger and we obtain nonlocal integro-differential formulas for L s u ( x ) . Essential tools in the analysis are the semigroup language approach and the extension problem.
A vector–host epidemic model with spatial structure and age of infection

Abstract In this paper we study a diffusive age structured epidemic model with disease transmission between vector and host populations. The dynamics of the populations are described by reaction–diffusion equations, with infection age structure of the host population incorporated to account for incubation periods. The disease is transmitted between vector and host populations in crisscross fashion. The existence of solutions of the model is studied by operator semigroup methods, and the asymptotic behavior of the solution is investigated.
Classification of Fixed Point Network Dynamics from Multiple Node Timeseries Data

Fixed point networks are dynamic networks encoding stimuli via distinct output patterns. Although such networks are common in neural systems, their structures are typically unknown or poorly characterized. It is thereby valuable to use a supervised approach for resolving how a network encodes inputs of interest and the superposition of those inputs from sampled multiple node time series. In this paper, we show that accomplishing such a task involves finding a low-dimensional state space from supervised noisy recordings. We demonstrate that while standard methods for dimension reduction are unable to provide optimal separation of fixed points and transient trajectories approaching them, the combination of dimension reduction with selection (clustering) and optimization can successfully provide such functionality. Specifically, we propose two methods: Exclusive Threshold Reduction (ETR) and Optimal Exclusive Threshold Reduction (OETR) for finding a basis for the classification state space. We show that the classification space -- constructed through the combination of dimension reduction and optimal separation -- can directly facilitate recognition of stimuli, and classify complex inputs (mixtures) into similarity classes. We test our methodology on a benchmark data-set recorded from the olfactory system. We also use the benchmark to compare our results with the state-of-the-art. The comparison shows that our methods are capable to construct classification spaces and perform recognition at a significantly better rate than previously proposed approaches.
An Algebra Model for the Higher-Order Sum Rules

We introduce an algebra model to study higher-order sum rules for orthogonal polynomials on the unit circle. We build the relation between the algebra model and sum rules, and prove an equivalent expression on the algebra side for the sum rules involving a Hall–Littlewood type polynomial. By this expression, we recover an earlier result by Golinskii and Zlatos and prove a new case - half of the Lukic conjecture in the case of a single critical point with arbitrary order.
The World Bank Macro-Fiscal Model Technical Description

This paper outlines the structure and economic foundation of the World Bank's macroeconomic and fiscal model (MFMod). MFMod consists of individual country models for 181 countries. The models are used by country economists within the World Bank's Macroeconomics, Trade and Investment Global Practice to (i) generate country forecasts and (ii) simulate various policies. Each model has a similar structure and functional form, with variation reflecting data availability and economic specialization (notably for oil exporters). Although the functional forms are similar, the parameters are country specific and estimated at the country level. Forecasts across countries are live-linked, with the export market growth of each country calculated as a trade-weighted average of imports of each of its trading partners. Remittance inflows and outflows are balanced across countries through a similar mechanism. Other cross-country linkages come through the real effective exchange rate and export and import prices, which are a function of world commodity prices and local cost considerations.
Imaging in Suspected Renal Colic: Systematic Review of the Literature and Multispecialty Consensus

Abstract Background Renal colic is common, and CT is frequently utilized when the diagnosis of kidney stones is suspected. CT is accurate but exposes patients to ionizing radiation and has not been shown to alter either interventional approaches or hospital admission rates. This multi-organizational transdisciplinary collaboration sought evidence-based, multispecialty consensus on optimal imaging across different clinical scenarios in patients with suspected renal colic in the acute setting. Methods In conjunction with the American College of Emergency Physicians (ACEP) eQual network, we formed a nine-member panel with three physician representatives each from ACEP, the ACR, and the American Urology Association. A systematic literature review was used as the basis for a three-step modified Delphi process to seek consensus on optimal imaging in 29 specific clinical scenarios. Results From an initial search yielding 6,337 records, there were 232 relevant articles of acceptable evidence quality to guide the literature summary. At the completion of the Delphi process consensus, agreement was rated as perfect in 15 (52%), excellent in 8 (28%), good in 3 (10%), and moderate in 3 (10%) of the 29 scenarios. There were no scenarios where at least moderate consensus was not reached. CT was recommended in 7 scenarios (24%), with ultrasound in 9 (31%) and no further imaging needed in 12 (45%). Summary Evidence and multispecialty consensus support ultrasound or no further imaging in specific clinical scenarios, with reduced-radiation dose CT to be employed when CT is needed in patients with suspected renal colic.
Hierarchical optimization for Whole-Body Control of Wheeled Inverted Pendulum Humanoids

In this paper, we present a whole-body control framework for Wheeled Inverted Pendulum (WIP) Humanoids. WIP Humanoids are redundant manipulators dynamically balancing themselves on wheels. Characterized by several degrees of freedom, they have the ability to perform several tasks simultaneously, such as balancing, maintaining a body pose, controlling the gaze, lifting a load or maintaining end-effector configuration in operation space. The problem of whole-body control is to enable simultaneous performance of these tasks with optimal participation of all degrees of freedom at specified priorities for each objective. The control also has to obey constraint of angle and torque limits on each joint. The proposed approach is hierarchical with a low level controller for body joints manipulation and a high-level controller that defines center of mass (CoM) targets for the low-level controller to control zero dynamics of the system driving the wheels. The low-level controller plans for shorter horizons while considering more complete dynamics of the system, while the high-level controller plans for longer horizon based on an approximate model of the robot for computational efficiency.
ICeD-T Provides Accurate Estimates of Immune Cell Abundance in Tumor Samples by Allowing for Aberrant Gene Expression Patterns.

Immunotherapies have attracted lots of research interests recently. The need to understand the underlying mechanisms of immunotherapies and to develop precision immunotherapy regimens has spurred g...
Adding a point to configurations in closed balls

We answer the question of when a new point can be added in a continuous way to configurations of n distinct points in a closed ball of arbitrary dimension. We show that this is possible given an ordered configuration of n points if and only if n ≠ 1. On the other hand, when the points are not ordered and the dimension of the ball is at least 2, a point can be added continuously if and only if n = 2. These results generalize the Brouwer fixed-point theorem, which gives the negative answer when n = 1. We also show that when n = 2, there is a unique solution to both the ordered and unordered versions of the problem up to homotopy.
On Measuring Global Poverty

This article critically assesses prevailing measures of global poverty. A welfarist interpretation of global poverty lines is augmented by the idea of normative functionings, the cost of which vari...
Super-Resolution Imaging Through the Human Skull

High-resolution transcranial ultrasound imaging in humans has been a persistent challenge for ultrasound due to the imaging degradation effects from aberration and reverberation. These mechanisms depend strongly on skull morphology and have high variability across individuals. Here, we demonstrate the feasibility of human transcranial super-resolution imaging using a geometrical focusing approach to efficiently concentrate energy at the region of interest, and a phase correction focusing approach that takes the skull morphology into account. It is shown that using the proposed focused super-resolution method, we can image a 208- $\mu \text{m}$ microtube behind a human skull phantom in both an out-of-plane and an in-plane configuration. Individual phase correction profiles for the temporal region of the human skull were calculated and subsequently applied to transmit–receive a custom focused super-resolution imaging sequence through a human skull phantom, targeting the 208- $\mu \text{m}$ diameter microtube at 68.5 mm in depth and at 2.5 MHz. Microbubble contrast agents were diluted to a concentration of $1.6\times 10^{6}$ bubbles/mL and perfused through the microtube. It is shown that by correcting for the skull aberration, the RF signal amplitude from the tube improved by a factor of 1.6 in the out-of-plane focused emission case. The lateral registration error of the tube’s position, which in the uncorrected case was 990 $\mu \text{m}$ , was reduced to as low as 50 $\mu \text{m}$ in the corrected case as measured in the B-mode images. Sensitivity in microbubble detection for the phase-corrected case increased by a factor of 1.48 in the out-of-plane imaging case, while, in the in-plane target case, it improved by a factor of 1.31 while achieving an axial registration correction from an initial 1885- $\mu \text{m}$ error for the uncorrected emission, to a 284- $\mu \text{m}$ error for the corrected counterpart. These findings suggest that super-resolution imaging may be used far more generally as a clinical imaging modality in the brain.
Latent multi-criteria ratings for recommendations

Multi-criteria recommender systems have been increasingly valuable for helping consumers identify the most relevant items based on different dimensions of user experiences. However, previously proposed multi-criteria models did not take into account latent embeddings generated from user reviews, which capture latent semantic relations between users and items. To address these concerns, we utilize variational autoencoders to map user reviews into latent embeddings, which are subsequently compressed into low-dimensional discrete vectors. The resulting compressed vectors constitute latent multi-criteria ratings that we use for the recommendation purposes via standard multi-criteria recommendation methods. We show that the proposed latent multi-criteria rating approach outperforms several baselines significantly and consistently across different datasets and performance evaluation measures.
Phase Stability and Electronic Structure of Tin Sulfide Compounds for Li-ion Batteries

Tin is an important component of a variety of promising anode and solid-electrolyte chemistries for Li and Na-ion batteries. Here, we report on a first-principles investigation of phase stability a...
Long-Term Implications of the Revenue Transfer Methodology in the Affordable Care Act

The Affordable Care Act introduced a revenue transfer formula that requires insurance plans with generally healthier enrollees to pay funds into a revenue transfer pool to reimburse plans with gene...
Correlation of a macroscopic dent in a wedge with mixed boundary conditions

As part of our ongoing work on the enumeration of symmetry classes of lozenge tilings of hexagons with certain four-lobed structures removed from their center, we consider the case of the tilings which are both vertically and horizontally symmetric. In order to handle this, we need an extension of Kuo's graphical condensation method, which works in the presence of free boundary. Our results allow us to compute exactly the correlation in a sea of dimers of a macroscopic dent in a 90 degree wedge with mixed boundary conditions. We use previous results to compute the correlation of the corresponding symmetrized system with no boundary, and show that its fourth root has the same log-asymptotics as the correlation of the dent in the 90 degree wedge. This is the first result of this kind involving a macroscopic defect. It suggests that the connections between dimer systems with gaps and 2D electrostatics may be deeper that previously thought.
Seesaw: rapid one-handed synchronous gesture interface for smartwatches.

We present SeeSaw, a synchronous gesture interface for commodity smartwatches to support watch-hand only input with no additional hardware. Our algorithm, which uses correlation to determine whether the user is rotating their wrist in synchrony with a tactile and visual prompt, minimizes false-trigger events while maintaining fast input during situational impairments. Results from a 12 person evaluation of the system, used to respond to notifications on the watch during walking and simulated driving, show interaction speeds of 4.0 s - 5.5 s, which is comparable to the swipe-based interface control condition. SeeSaw is also evaluated as an input interface for watches used in conjunction with a head-worn display. A six subject study showed a 95% success rate in dismissing notifications and a 3.57 s mean dismissal time.
Process Design of Laser Powder Bed Fusion of Stainless Steel Using a Gaussian Process-Based Machine Learning Model

In this work, a Gaussian process (GP)-based machine learning model is developed to predict the remelted depth of single tracks, as a function of combined laser power and laser scan speed in a laser powder bed fusion process. The GP model is trained by both simulation and experimental data from the literature. The mean absolute prediction error magnified by the GP model is only 0.6 μm for a powder bed with layer thickness of 30 μm, suggesting the adequacy of the GP model. Then, the process design maps of two metals, 316L and 17-4 PH stainless steels, are developed using the trained model. The normalized enthalpy criterion of identifying keyhole mode is evaluated for both stainless steels. For 316L, the result suggests that the $$ \frac{\Delta H}{{h_{s} }} \ge 30 $$ criterion should be related to the powder layer thickness. For 17-4 PH, the criterion should be revised to $$ \frac{\Delta H}{{h_{s} }} \ge 25 $$.
How often does random assignment fail? Estimates and recommendations

Abstract A fundamental goal of the scientific process is to make causal inferences. Random assignment to experimental conditions has been taken to be a gold-standard technique for establishing causality. Despite this, it is unclear how often random assignment fails to eliminate non-trivial differences between experimental conditions. Further, it is unknown to what extent larger sample sizes mitigates this issue. Chance differences between experimental conditions may be especially important when investigating topics that are highly sample-dependent, such as climate change and other politicized issues. Three studies examine simulated data (Study 1), three real datasets from original environmental psychology experiments (Study 2), and one nationally-representative dataset (Study 3) and find that differences between conditions that remain after random assignment are surprisingly common for sample sizes typical of social psychological scientific experiments. Methods and practices for identifying and mitigating such differences are discussed, and point to implications that are especially relevant to experiments in social and environmental psychology.
On Estimation under Noisy Order Statistics

This paper presents an estimation framework to assess the performance of the sorting function over data that is perturbed. In particular, the performance is measured in terms of the Minimum Mean Square Error (MMSE) between the values of the sorting function computed on the data without perturbation and the estimate that uses the sorting function applied to the perturbed data. It is first shown that, under certain conditions satisfied by the practically relevant Gaussian noise perturbation, the optimal estimator can be expressed as a linear combination of estimators on the unsorted data. Then, a suboptimal estimator is proposed, and its performance is evaluated and compared to the optimal estimator. Finally, a lower bound on the desired MMSE is derived when data is i.i.d. and has a Gaussian distribution. This is accomplished by solving a new problem that consists of estimating the norm of an unsorted vector from a noisy observation of it.
Levelset based segmentation using data driven shape prior on feature histograms

We develop a new data driven shape prior for use in image segmentation. This prior is designed to penalize the differences between the distributions of contour features obtained from training data shapes and those of a segmenting curve. We incorporate this prior into a level set segmentation framework and present an efficient method for its implementation.
A Possible Holarchy Representing Morphic Resonance as One Side of the Poised Realm

The theory of morphic resonance is unified with warm-body quantum mechanics following the ontological basis that describes the poised realm that depicts a balancing act involving quantum coherence and decoherence. Morphic resonance more properly belongs to the side of quantum coherence, leaving the other side the place where classical mechanics applies. This equally turns time into something two-sided, leaving open the possibility that proto-emotion sources the middle-term that holds the sides together.
Tracing Community Genealogy: How New Communities Emerge from the Old

The process by which new communities emerge is a central research issue in the social sciences. While a growing body of research analyzes the formation of a single community by examining social networks between individuals, we introduce a novel community-centered perspective. We highlight the fact that the context in which a new community emerges contains numerous existing communities. We reveal the emerging process of communities by tracing their early members' previous community memberships. Our testbed is Reddit, a website that consists of tens of thousands of user-created communities. We analyze a dataset that spans over a decade and includes the posting history of users on Reddit from its inception to April 2017. We first propose a computational framework for building genealogy graphs between communities. We present the first large-scale characterization of such genealogy graphs. Surprisingly, basic graph properties, such as the number of parents and max parent weight, converge quickly despite the fact that the number of communities increases rapidly over time. Furthermore, we investigate the connection between a community's origin and its future growth. Our results show that strong parent connections are associated with future community growth, confirming the importance of existing community structures in which a new community emerges. Finally, we turn to the individual level and examine the characteristics of early members. We find that a diverse portfolio across existing communities is the most important predictor for becoming an early member in a new community.
Bequest expectations among the U.S. older adults: The roles of generational differences and personality traits

This study used the 2012 and 2014 panels of the Health and Retirement Study, a nationally representative dataset, to examine the associations between personality traits, generational cohorts, and bequest expectations among elderly households in the United States. The results indicated that neuroticism was associated with a lower subjective probability of leaving a bequest, and extroversion was associated with a higher subjective probability of leaving a bequest. Income, assets, and educational attainment were also positively associated with self‐reported bequest expectations. Generational differences were observed in the subjective probabilities of leaving bequests. The results of this study help in understanding the psychosocial factors associated with leaving bequests in an aging society, and provide implications for financial planners, practitioners, and policy makers. Full Text Available Here: https://doi.org/10.1002/cfp2.1057
Non-separable Lattices, Gabor Orthonormal Bases and Tilings

Let $$K\subset {\mathbb {R}}^d$$ be a bounded set with positive Lebesgue measure. Let $$\Lambda =M({\mathbb {Z}}^{2d})$$ be a lattice in $${\mathbb {R}}^{2d}$$ with density dens$$(\Lambda )=1$$. It is well-known that if M is a diagonal block matrix with diagonal matrices A and B, then $${\mathcal {G}}(|K|^{-1/2}\chi _K, \Lambda )$$ is an orthonormal basis for $$L^2({\mathbb {R}}^d)$$ if and only if K tiles both by $$A({\mathbb {Z}}^d)$$ and $$B^{-t}({\mathbb {Z}}^d)$$. However, there has not been any intensive study when M is not a diagonal matrix. We investigate this problem for a large class of important cases of M. In particular, if M is any lower block triangular matrix with diagonal matrices A and B, we prove that if $${\mathcal {G}}(|K|^{-1/2}\chi _K, \Lambda )$$ is an orthonormal basis, then K can be written as a finite union of fundamental domains of $$A({{\mathbb {Z}}}^d)$$ and at the same time, as a finite union of fundamental domains of $$B^{-t}({{\mathbb {Z}}}^d)$$. If $$A^tB$$ is an integer matrix, then there is only one common fundamental domain, which means K tiles by a lattice and is spectral. However, surprisingly, we will also illustrate by an example that a union of more than one fundamental domain is also possible. We also provide a constructive way for forming a Gabor window function for a given upper triangular lattice. Our study is related to a Fuglede’s type problem in Gabor setting and we give a partial answer to this problem in the case of lattices.
Visually Representing the Landscape of Mathematical Structures

The information technology explosion has dramatically increased the application of areas of mathematics traditionally labeled ?pure” or ?theoretical” to wide ranges of fields, which has created a critical need to make abstract mathematics readily accessible to a broader community. This paper presents a method for categorizing and diagramming mathematical structures that enable students and professionals to rapidly understand relationships among and between mathematical structures. This paper also presents 11 maps diagramming 187 mathematical structures through the method described in the paper.
A priori estimates for a relativistic liquid with free surface boundary

We prove energy estimates for a relativistic free liquid body with sufficiently small fluid velocity in a general Lorentz spacetime. These estimates control Sobolev norms of the fluid velocity and ...