Search

This paper addresses the question of whether large language model-powered chatbots are capable of assertion. According to what we call the Thesis of Chatbot Assertion (TCA), chatbots are the kinds of things that can assert, and at least some of the output produced by current-generation chatbots qualifies as assertion. We provide some motivation for TCA, arguing that it ought to be taken seriously and not simply dismissed. We also review recent objections to TCA, arguing that these objections are weighty. We thus confront the following dilemma: how can we do justice to both the considerations for and against TCA? We consider two influential responses to this dilemma - the first appeals to the notion of proxy-assertion; the second appeals to fictionalism - and argue that neither is satisfactory. Instead, reflecting on the ontogenesis of assertion, we argue that we need to make space for a category of proto-assertion. We then apply the category of proto-assertion to chatbots, arguing that treating chatbots as proto-assertors provides a satisfactory resolution to the dilemma of chatbot assertion.

We explore the bound neutrons decay into invisible particles (e.g., $n\rightarrow 3 \nu$ or $nn \rightarrow 2 \nu$) in the JUNO liquid scintillator detector. The invisible decay includes two decay modes: $ n \rightarrow { inv} $ and $ nn \rightarrow { inv} $. The invisible decays of $s$-shell neutrons in $^{12}{\rm C}$ will leave a highly excited residual nucleus. Subsequently, some de-excitation modes of the excited residual nuclei can produce a time- and space-correlated triple coincidence signal in the JUNO detector. Based on a full Monte Carlo simulation informed with the latest available data, we estimate all backgrounds, including inverse beta decay events of the reactor antineutrino $\bar{\nu}_e$, natural radioactivity, cosmogenic isotopes and neutral current interactions of atmospheric neutrinos. Pulse shape discrimination and multivariate analysis techniques are employed to further suppress backgrounds. With two years of exposure, JUNO is expected to give an order of magnitude improvement compared to the current best limits. After 10 years of data taking, the JUNO expected sensitivities at a 90% confidence level are $\tau/B( n \rightarrow { inv} ) > 5.0 \times 10^{31} \, {\rm yr}$ and $\tau/B( nn \rightarrow { inv} ) > 1.4 \times 10^{32} \, {\rm yr}$., Comment: 28 pages, 7 figures, 4 tables

The core-collapse supernova (CCSN) is considered one of the most energetic astrophysical events in the universe. The early and prompt detection of neutrinos before (pre-SN) and during the supernova (SN) burst presents a unique opportunity for multi-messenger observations of CCSN events. In this study, we describe the monitoring concept and present the sensitivity of the system to pre-SN and SN neutrinos at the Jiangmen Underground Neutrino Observatory (JUNO), a 20 kton liquid scintillator detector currently under construction in South China. The real-time monitoring system is designed to ensure both prompt alert speed and comprehensive coverage of progenitor stars. It incorporates prompt monitors on the electronic board as well as online monitors at the data acquisition stage. Assuming a false alert rate of 1 per year, this monitoring system exhibits sensitivity to pre-SN neutrinos up to a distance of approximately 1.6 (0.9) kiloparsecs and SN neutrinos up to about 370 (360) kiloparsecs for a progenitor mass of 30 solar masses, considering both normal and inverted mass ordering scenarios. The pointing ability of the CCSN is evaluated by analyzing the accumulated event anisotropy of inverse beta decay interactions from pre-SN or SN neutrinos. This, along with the early alert, can play a crucial role in facilitating follow-up multi-messenger observations of the next galactic or nearby extragalactic CCSN., Comment: 24 pages, 9 figures, accepted for the publication at JCAP

We define the dart $D(a)$ to be the nonconvex quadrilateral whose vertices are $(0,1), (1,1), (1,0), (a,a)$ (in counterclockwise order), with $a>1$. Such a dart can be dissected into any even number of equal-area triangles. Here we investigate darts that can be dissected into an odd number of equal-area triangle.

Digital signal theory is an extension of the analysis of continuous signals. This extension is provided by discretization and sampling. The sampling of signals can be mathematically described by a series of Dirac impulses and is well known. Properties of the Dirac impulse, such as sampling, are derived in distribution theory. The theory generalizes differential calculus to functions that are not differentiable in the classical sense such as the Heaviside step function. Therefore, distribution theory allows one to adopt analog analysis concepts to digital signals. In this report, we extend the concept of Dirac combs, a series of Dirac impulses as known from signal theory, to performance analysis of computers. The goal is to connect methods from electrical engineering or physics to different models of computation such as graphs, and network as well as real-time calculus.

With the dynamic demands and stringent requirements of various applications, networks need to be high-performance, scalable, and adaptive to changes. Researchers and industries view network softwarization as the best enabler for the evolution of networking to tackle current and prospective challenges. Network softwarization must provide programmability and flexibility to network infrastructures and allow agile management, along with higher control for operators. While satisfying the demands and requirements of network services, energy cannot be overlooked, considering the effects on the sustainability of the environment and business. This paper discusses energy efficiency in modern and future networks with three network softwarization technologies: SDN, NFV, and NS, introduced in an energy-oriented context. With that framework in mind, we review the literature based on network scenarios, control/MANO layers, and energy-efficiency strategies. Following that, we compare the references regarding approach, evaluation method, criterion, and metric attributes to demonstrate the state-of-the-art. Last, we analyze the classified literature, summarize lessons learned, and present ten essential concerns to open discussions about future research opportunities on energy-efficient softwarized networks., Comment: Accepted draft for publication in TNSM with minor updates and editing

The rising demand for electric vehicles (EVs) worldwide necessitates the development of robust and accessible charging infrastructure, particularly in developing countries where electricity disruptions pose a significant challenge. Earlier charging infrastructure optimization studies do not rigorously address such service disruption characteristics, resulting in suboptimal infrastructure designs. To address this issue, we propose an efficient simulation-based optimization model that estimates candidate stations' service reliability and incorporates it into the objective function and constraints. We employ the control variates (CV) variance reduction technique to enhance simulation efficiency. Our model provides a highly robust solution that buffers against uncertain electricity disruptions, even when candidate station service reliability is subject to underestimation or overestimation. Using a dataset from Surabaya, Indonesia, our numerical experiment demonstrates that the proposed model achieves a 13% higher average objective value compared to the non-robust solution. Furthermore, the CV technique successfully reduces the simulation sample size up to 10 times compared to Monte Carlo, allowing the model to solve efficiently using a standard MIP solver. Our study provides a robust and efficient solution for designing EV charging infrastructure that can thrive even in developing countries with uncertain electricity disruptions.

We discussed a method to accelerate an adiabatic quantum dynamics of XY spin model by using the fast-forward method proposed by Masuda and Nakamura. The Accelerated scheme is constructed by adding the driving Hamiltonian to the original Hamiltonian and speeding it up with a large time-scaling factor and an adiabatic parameter that realizes adiabatic quantum dynamics in a shortened time. Accelerated adiabatic dynamics start by assuming the candidate of driving Hamiltonian consists of the pair-wise exchange interaction and magnetic field. The driving Hamiltonian terms multiplied by the velocity function together with the original Hamiltonian give fast-forward driving for adiabatic states. We apply our method to XY spin model by considering three spin systems on the Kagome lattice. In this model, we obtained the XY pair-wise exchange interaction of nearest neighbors and next-nearest neighbors should be added to the original Hamiltonian as a driving interaction to accelerate the adiabatic motion. This pair-wise driving interaction in the fast-forward scheme guarantees the complete fidelity of accelerated states.

Recently Kauers, Koutschan and Spahn announced a significant increase in the length of the so-called {\em gerrymander sequence}, given as A348456 in the OEIS, extending the sequence from 3 terms to 7 terms. We give a further extension to 11 terms, but more significantly prove that the coefficients grow as $\lambda^{4L^2},$ where $\lambda \approx 1.7445498, $ and is equal to the corresponding quantity for self-avoiding walks crossing a square (WCAS), or self-avoiding polygons crossing a square (PCAS). These are, respectively, OEIS sequences A007764 and A333323. Thus we have established a close connection between these previously separate problems. We have also related the sub-dominant behaviour to that of WCAS and PCAS, allowing us to conjecture that the coefficients of the gerrymander sequence A348456 grow as $\lambda^{4L^2+dL+e} \cdot L^g,$ where $d=-8.08708 \pm 0.0002,$ $e \approx 7.69$ and $g = 0.75 \pm 0.01,$ with $g$ almost certainly $3/4$ exactly. We also have generated 26 terms in the related gerrymander polynomial (defined below), and have been able to predict the asymptotic behaviour with a satisfying degree of precision. Indeed, it behaves exactly as $L$ times the corresponding coefficient of the generalised gerrymander sequence. The improved algorithm we give for counting these sequences is a variation of that which we recently developed for extending a number of sequences for SAWs and SAPs crossing a domain of the square or hexagonal lattices. It makes use of a minimal perfect hash function and in-place memory updating of the arrays for the counts of the number of paths., Comment: 26 pages, 13 figures

We report the synthesis, structure and nonlinear optical properties of cadmium sulphide (CdS) nanocrystallines (NCs) synthesized electrochemically both with and without detergent ATLAS G3300. Relevant structural and morphological features are explored by X-ray diffraction and scanning electron microscopy (SEM) techniques. The efficiency of the second harmonic generation (SHG) appears to be strongly dependent on the energy density of the incident fundamental laser radiation and NC sizes., Comment: 2020 IEEE 15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET), Conference Location: Lviv-Slavske, Ukraine, 25-29 February 2020, 5 pages, 8 figures, 3 tables

The rapid development of electric vehicle (EV) technologies promises cleaner air and more efficient transportation systems, especially for polluted and congested urban areas. To capitalize on this potential, the Indonesian government has appointed PLN, its largest state-owned electricity provider, to accelerate the preparation of Indonesia's EV infrastructure. With a mission of providing reliable, accessible, and cost-effective EV charging station infrastructure throughout the country, the company is prototyping a location-optimized model to simulate how well its infrastructure design reaches customers, fulfills demands, and generates revenue. In this work, we study how PLN could maximize profit by optimally placing EV charging stations in urban areas by adopting a maximal covering location model. In our experiments, we use data from Surabaya, Indonesia, and consider the two main transportation modes for the locals to charge: electric motorcycles and electric cars. Numerical experiments show that only four charging stations are needed to cover the whole city, given the charging technology that PLN has acquired. However, consumers' time-to-travel is exceptionally high (about 35 minutes), which could lead to poor consumer service and hindrance toward EV technologies. Sensitivity analysis reveals that building more charging stations could reduce the time but comes with higher costs due to extra facility installations. Adding layers of redundancy to buffer against outages or other disruptions also incurs higher costs but could be an appealing option to design a more reliable and thriving EV infrastructure. The model can provide insights to decision-makers to devise the most reliable and cost-effective infrastructure designs to support the deployment of electric vehicles and much more advanced intelligent transportation systems in the near future.

We have analysed the recently extended series for the number of self-avoiding walks (SAWs) $C_L(1)$ that cross an $L \times L$ square between diagonally opposed corners. The number of such walks is known to grow as $\lambda_S^{L^2}.$ We have made more precise the estimate of $\lambda_S,$ based on additional series coefficients provided by several authors, and refined analysis techniques. We estimate that $\lambda_S = 1.7445498 \pm 0.0000012.$ We have also studied the subdominant behaviour, and conjecture that $$ C_L(1) \sim \lambda_S^{L^2+bL+c}\cdot L^g,$$ where $b=-0.04354 \pm 0.0001,$ $c=0.5624 \pm 0.0005,$ and $g=0.000 \pm 0.005.$ We implemented a very efficient algorithm for enumerating paths on the square and hexagonal lattices making use of a minimal perfect hash function and in-place memory updating of the arrays for the counts of the number of paths. Using this algorithm we extended and then analysed series for SAWs spanning the square lattice and self-avoiding polygons (SAPs) crossing the square lattice. These are known to also grow as $\lambda_S^{L^2}.$ The sub-dominant term $\lambda^b$ is found to be the same as for SAWs crossing the square, while the exponent $g = 1.75\pm 0.01$ for spanning SAWs and $g = -0.500 \pm 0.005$ for SAPs. We have also studied the analogous problems on the hexagonal lattice, and generated series for a number of geometries. In particular, we study SAWs and SAPs crossing rhomboidal, triangular and square domains on the hexagonal lattice, as well as SAWs spanning a rhombus. We estimate that the analogous growth constant $\lambda_H=1.38724951 \pm 0.00000005,$ so an even more precise estimate than found for the square lattice. We also give estimates of the sub-dominant terms., Comment: 58 pages, 30 figures

In this paper we consider the central force problem in the special theory of relativity. We derive the special relativistic version of the Binet equation describing the orbit of a body. Then, the motion of a planet in a solar-like system where the gravitational potential is modified by adding a term that is proportional to the inverse of the square of the radial coordinate is discussed. Using perturbative method, we obtain the explicit orbital function. At the end, the orbital precession of the planet and its relation to the result from general relativity are also discussed.

We have studied self-avoiding walks contained within an $L \times L$ square whose end-points can lie anywhere within, or on, the boundaries of the square. We prove that such walks behave, asymptotically, as walks crossing a square (WCAS), being those walks whose end-points lie at the south-east and north-west corners of the square. We provide numerical data, enumerating all such walks, and analyse the sequence of coefficients in order to estimate the asymptotic behaviour. We also studied a subset of these walks, those that must contain at least one edge on all four boundaries of the square. We provide compelling evidence that these two classes of walks grow identically. From our analysis we conjecture that the number of such walks $C_L$, for both problems, behaves as $$ C_L \sim \lambda^{L^2+bL+c}\cdot L^g,$$ where $\lambda= 1.7445498 \pm 0.0000012,$ $b=-0.04354 \pm 0.0005,$ $c=-1.35 \pm 0.45,$ and $g=3.9 \pm 0.1.$ Finally, we also studied the equivalent problem for self-avoiding polygons, also known as cycles in a square grid. The asymptotic behaviour of cycles has the same form as walks, but with different values of the parameters $c$, and $g$. Our numerical analysis shows that $\lambda$ and $b$ have the same values as for WCAS and that $c=1.776 \pm 0.002$ while $g=-0.500\pm 0.005$ and hence probably equals $-\frac12$., Comment: 17 pages, 11 figures

We describe some ideas of John Hammersley for proving the existence of critical exponents for two-dimensional self-avoiding walks and provide numerical evidence for their correctness., Comment: 19 pages, 5 figures

Polarization is an unprecedented coding technique in that it not only achieves channel capacity, but also does so at a faster speed of convergence than any other coding technique. This speed is measured by the ``scaling exponent'' and its importance is three-fold. Firstly, estimating the scaling exponent is challenging and demands a deeper understanding of the dynamics of communication channels. Secondly, scaling exponents serve as a benchmark for different variants of polar codes that helps us select the proper variant for real-life applications. Thirdly, the need to optimize for the scaling exponent sheds light on how to reinforce the design of polar codes. In this paper, we generalize the binary erasure channel (BEC), the simplest communication channel and the protagonist of many coding theory studies, to the ``tetrahedral erasure channel'' (TEC). We then invoke Mori--Tanaka's $2 \times 2$ matrix over GF$(4)$ to construct polar codes over TEC. Our main contribution is showing that the dynamic of TECs converges to an almost--one-parameter family of channels, which then leads to an upper bound of $3.328$ on the scaling exponent. This is the first non-binary matrix whose scaling exponent is upper-bounded. It also polarizes BEC faster than all known binary matrices up to $23 \times 23$ in size. Our result indicates that expanding the alphabet is a more effective and practical alternative to enlarging the matrix in order to achieve faster polarization., Comment: 22 pages, 4 figures. Accepted to RANDOM 2022. v2: 29 pages, 5 figures, 1 table; address comments from JSAIT

The construction of large-scale liquid scintillator detectors is complicated by the need to separate the scintillation region from photomultiplier tubes (PMTs) due to their intrinsic radioactivity. This is generally done using acrylic or nylon barriers, whose own activity can also lead to substantial reduction of the fiducial detection volume for a number of low energy (MeV) studies, and whose construction becomes increasingly difficult and expensive for larger detector volumes. Here we present an initial simulation study of an alternative geometric construction known as SLIPS (Stratified LIquid Plane Scintillator), which aims to avoid such physical barriers entirely by instead using layers of lipophobic liquids to separate PMTs from the scintillation region.

Giant shell CdSe/CdS quantum dots are bright and flexible emitters, with near-unity quantum yield and suppressed blinking, but their single photon purity is reduced by efficient multiexcitonic emission. We report the observation, at the single dot level, of a large blueshift of the photoluminescence biexciton spectrum ($24\pm5$ nm over a sample of 32 dots) for pure-phase wurtzite quantum dots. By spectral filtering, we demonstrate a 2.3 times reduction of the biexciton quantum yield relative to the exciton emission, while preserving as much as 60% of the exciton single photon emission, thus improving the purity from $g_2(0)=0.07\pm0.01$ to $g_2(0)=0.03\pm0.01$. At larger pump fluency the spectral purification is even more effective with up to a 6.6 times reduction in $g_2(0)$, which is due to the suppression of higher order excitons and shell states experiencing even larger blueshift. Our results indicate the potential for synthesis engineered giant shell quantum dots, with further increased biexciton blueshift, for quantum optical applications requiring both high purity and brightness., Comment: Supporting information is available

A Heron triangle is a triangle whose side lengths and area are integers. Two Heron triangles are amicable if the perimeter of one is the area of the other. We show, using elementary techniques, that there is only one pair of amicable Heron triangles., Comment: 2 figures

To multiply astronomic matrices using parallel workers subject to straggling, we recommend interleaving checksums with some fast matrix multiplication algorithms. Nesting the parity-checked algorithms, we weave a product code flavor protection. Two demonstrative configurations are as follows: (A) $9$ workers multiply two $2\times 2$ matrices; each worker multiplies two linear combinations of entries therein. Then the entry products sent from any $8$ workers suffice to assemble the matrix product. (B) $754$ workers multiply two $9\times 9$ matrices. With empirical frequency $99.8\%$, $729$ workers suffice, wherein $729$ is the complexity of the schoolbook algorithm. In general, we propose probability-wisely favorable configurations whose numbers of workers are close to, if not less than, the thresholds of other codes (e.g., entangled polynomial code and PolyDot code). Our proposed scheme applies recursively, respects worker locality, incurs moderate pre- and post-processes, and extends over small finite fields., Comment: 40 pages, 18 figures, 2 tables; v2 adds MSC and applies corrections; v3 applies corrections

Aims. The existence of asteroid complexes produced by the disruption of these comets suggests that evolved comets could also produce high-strength materials able to survive as meteorites. We chose as an example comet 2P/Encke, one of the largest object of the so-called Taurid complex. We compare the reflectance spectrum of this comet with the laboratory spectra of some Antarctic ungrouped carbonaceous chondrites to investigate whether some of these meteorites could be associated with evolved comets. Methods. We compared the spectral behaviour of 2P/Encke with laboratory spectra of carbonaceous chondrites. Different specimens of the common carbonaceous chondrite groups do not match the overall features and slope of comet 2P/Encke. Trying anomalous carbonaceous chondrites, we found two meteorites, Meteorite Hills 01017 and Grosvenor Mountains 95551, which could be good proxies for the dark materials forming this short-period comet. We hypothesise that these two meteorites could be rare surviving samples, either from the Taurid complex or another compositionally similar body. In any case, it is difficult to get rid of the effects of terrestrial weathering in these Antarctic finds, and further studies are needed. Future sample return from the so-called dormant comets could be also useful to establish a ground truth on the materials forming evolved short-period comets. Results. As a natural outcome, we think that identifying good proxies of 2P/Encke-forming materials might have interesting implications for future sample-return missions to evolved, potentially dormant or extinct comets. To understand the compositional nature of evolved comets is particularly relevant in the context of the future mitigation of impact hazard from these dark and dangerous projectiles., Comment: Accepted for publication in A&A on July 6, 2020

An $(n, k, d, \alpha)$-MSR (minimum storage regeneration) code is a set of $n$ nodes used to store a file. For a file of total size $k\alpha$, each node stores $\alpha$ symbols, any $k$ nodes recover the file, and any $d$ nodes can repair any other node via each sending out $\alpha/(d-k+1)$ symbols. In this work, we explore various ways to re-express the infamous product-matrix construction using skew-symmetric matrices, polynomials, symmetric algebras, and exterior algebras. We then introduce a multilinear algebra foundation to produce $\bigl(n, k, \frac{(k-1)t}{t-1}, \binom{k-1}{t-1}\bigr)$-MSR codes for general $t\geq2$. At the $t=2$ end, they include the product-matrix construction as a special case. At the $t=k$ end, we recover determinant codes of mode $m=k$; further restriction to $n=k+1$ makes it identical to the layered code at the MSR point. Our codes' sub-packetization level---$\alpha$---is independent of $n$ and small. It is less than $L^{2.8(d-k+1)}$, where $L$ is Alrabiah--Guruswami's lower bound on $\alpha$. Furthermore, it is less than other MSR codes' $\alpha$ for a subset of practical parameters. We offer hints on how our code repairs multiple failures at once., Comment: 36 pages, 9 figures, 3 tables

An $(n, k, d, \alpha, \beta, M)$-ERRC (exact-repair regenerating code) is a collection of $n$ nodes used to store a file. For a file of total size $M$, each node stores $\alpha$ symbols, any $k$ nodes recover the file, and any $d$ nodes repair any other node via sending out $\beta$ symbols. We establish a multilinear algebra foundation to assemble $(n, k, d, \alpha, \beta, M)$-ERRCs for all meaningful $(n, k, d)$ tuples. Our ERRCs tie the $\alpha/M$-versus-$\beta/M$ trade-off with cascade codes, the best known construction for this trade-off. We give directions on how these ERRCs repair multiple failures., Comment: 33 pages, 6 figures, 1 table

A tiling of the unit square is an MTP tiling if the smallest tile can tile all the other tiles. We look at the function $f(n)=\max \sum s_i$, where $s_i$ is the side length of the $i$th tile and the sum is taken over all MTP tilings with $n$ tiles. If $n=k^2+3$, it was conjectured that $f(k^2+3)=k+1/k$. We show that any tiling that violates the conjecture must consist of at least three tile sizes and has exactly one minimal tile., Comment: 5 pages

Resistive switching memories allow electrical control of the conductivity of a material, by inducing a high resistance (OFF) or a low resistance (ON) state, using electrochemical and ion transport processes. As alternative to high temperature and vacuum-based physical sulphurization methods of silver (Ag), here we propose, as resistive switching medium, a layer built from colloidal Ag$_{2-x}$S nanocrystals -compatible with solution-processed approaches. The effect of the electrode size (from macro- to micro-scale), composition (Ag, Ti and Pt) and geometry on the device performance together with the electrochemical mechanisms involved are evaluated. We achieved an optimized Ag/Ti bowtie proof-of-concept configuration by e-beam lithography, which fulfils the general requirements for ReRAM devices in terms of low power consumption and reliable $I_{ON}/I_{OFF}$ ratio. This configuration demonstrates reproducible switching between ON and OFF states with data endurance of at least 20 cycles; and an $I_{ON}/I_{OFF}$ ratio up to 10$^3$ at low power consumption (0.1V readout), which outperforms previous results in literature for devices with resistive layers fabricated from silver chalcogenide nanoparticles.

The interaction between excitons and phonons in semiconductor nanocrystals plays a crucial role in the exciton energy spectrum and dynamics, and thus in their optical properties. We investigate the exciton2 phonon coupling in giant-shell CdSe/CdS core-shell nanocrystals via resonant Raman spectroscopy. The Huang-Rhys parameter is evaluated by the intensity ratio of the longitudinal-optical (LO) phonon of CdS with its first multiscattering (2LO) replica. We used four different excitation wavelengths in the range from the onset of the CdS shell absorption to well above the CdS shell band edge to get insight into resonance effects of the CdS LO phonon with high energy excitonic transitions. The isotropic spherical giant-shell nanocrystals show consistently stronger exciton-phonon coupling as compared to the anisotropic rod-shaped dot-in-rod (DiR) architecture, and the 2LO/LO intensity ratio decreases for excitation wavelengths approaching the CdS band edge. The strong exciton-phonon coupling in the spherical giant-shell nanocrystals can be related to the delocalization of the electronic wave functions. Furthermore, we observe the radial breathing modes of the GS nanocrystals and their overtones by ultralow frequency Raman spectroscopy with nonresonant excitation, using laser energies well below the band gap of the heteronanocrystals, and highlight the differences between higher order, Comment: 16 pages, 3 figures

The photoluminescence (PL), color purity, and stability of lead halide perovskite nanocrystals depend critically on the surface passivation. We present a study on the temperature dependent PL and PL decay dynamics of lead bromide perovskite nanocrystals characterized by different types of A cations, surface ligands, and nanocrystal sizes. Throughout, we observe a single emission peak from cryogenic to ambient temperature. The PL decay dynamics are dominated by the surface passivation, and a post-synthesis ligand exchange with a quaternary ammonium bromide (QAB) results in a more stable passivation over a larger temperature range. The PL intensity is highest from 50K-250K, which indicates that the ligand binding competes with the thermal energy at ambient temperature. Despite the favorable PL dynamics of nanocrystals passivated with QAB ligands (monoexponential PL decay over a large temperature range, increased PL intensity and stability), the surface passivation still needs improvement toward increased emission intensity in nanocrystal films., Comment: 19 pages, 5 figures

Colloidal core/shell nanocrystals are key materials for optoelectronics, enabling control over essential properties via precise engineering of the shape, thickness, and crystal lattice structure of their shell. Here, we apply the growth protocol for CdS branched nanocrystals on CdSe nanoplatelet seeds and obtain bone-shaped heterostructures with a highly anisotropic shell. Surprisingly, the nanoplatelets withstand the high growth temperature of 350 {\deg}C and we obtain structures with a CdSe nanoplatelet core that is overcoated by a shell of cubic CdS, on top of which tetrahedral CdS structures with hexagonal lattice are formed. These complex core/shell nanocrystals show a bandedge emission around 657 nm with a photoluminescence quantum yield of ca. 42 % in solution, which is also retained in thin films. Interestingly, the nanocrystals manifest simultaneous red and green emission, and the relatively long wavelength of the green emission indicates charge recombination at the cubic/hexagonal interface of the CdS shell. The nanocrystal films show amplified spontaneous emission, random lasing, and distributed feedback lasing when the material is deposited on suitable gratings. Our work stimulates the design and fabrication of more exotic core/shell heterostructures where charge carrier delocalization, dipole moment, and other optical and electrical properties can be engineered., Comment: 26 pages, 6 figures, 1 table

Among the large family of transition metal dichalcogenides (TMDCs), recently ReS2 has stood out due to its nearly layer-independent optoelectronic and physicochemical properties. These are related to its 1T distorted octahedral structure, which leads to strong in-plane anisotropy and the presence of active sites at its surface, which makes ReS2 interesting for applications such as gas sensors and catalysts for H2 production. However, the current fabrication methods for ReS2 use chemical or physical vapor deposition (CVD or PVD) processes that are costly and involve complex and lengthy fabrication procedures, therefore limiting their large-scale production and exploitation. To address this issue, we developed a colloidal synthesis approach, which allows the production of ReS2 to be attained at temperatures below 360 Celsius degrees and with reaction times < 2 h, resulting in a more cost-efficient strategy than the CVD and PVD methods. By combining the solution-based synthesis with surface functionalization strategies, we demonstrate the feasibility of colloidal ReS2 nanosheet films for gas sensing of different toxic gases, moisture and other volatile compounds with highly competitive performance in comparison with devices built with CVD-grown ReS2 and MoS2. In addition, the integration of the ReS2 nanosheet films in assemblies, in which they are deposited on top of networks of carbon nanotubes, allowed us to fabricate electrodes for electrocatalysis for H2 production in both acid and alkaline conditions. Results from proof-of-principle devices show an electrocatalytic overpotential that is competitive with devices based on ReS2 produced by CVD, and even with MoS2, WS2 and MoSe2 electrocatalysts.

Electron transfer to an individual quantum dot promotes the formation of charged excitons with enhanced recombination pathways and reduced lifetimes. Excitons with only one or two extra charges have been observed and exploited for very efficient lasing or single quantum dot LEDs. Here, by room-temperature time-resolved experiments on individual giant-shell CdSe/CdS quantum dots, we show the electrochemical formation of highly charged excitons containing more than twelve electrons and one hole. We report the control over intensity blinking, along with a deterministic manipulation of quantum dot photodynamics, with an observed 210-fold increase of the decay rate, accompanied by 12-fold decrease of the emission intensity, while preserving single-photon emission characteristics. These results pave the way for deterministic control over the charge state, and room-temperature decay-rate engineering for colloidal quantum dot-based classical and quantum communication technologies.

The efficient excitation of quantum sources such as quantum dots or single molecules requires high NA optics which is often a challenge in cryogenics, or in ultrafast optics. Here we propose a 3.2 um wide parabolic mirror, with a 0.8 um focal length, fabricated by direct laser writing on CdSe/CdS colloidal quantum dots, capable of focusing the excitation light to a sub-wavelength spot and to extract the generated emission by collimating it into a narrow beam. This mirror is fabricated via in-situ volumetric optical lithography, which can be aligned to individual emitters, and it can be easily adapted to other geometries beyond the paraboloid. This compact solid-state transducer from far-field to the emitter has important applications in objective-free quantum technologies.

Learning Machines is developing a flexible, cross-industry, advanced analytics platform, targeted during stealth-stage at a limited number of specific vertical applications. In this paper, we aim to integrate a general machine system to learn a variant of tasks from simulation to real world. In such a machine system, it involves real-time robot vision, sensor fusion, and learning algorithms (reinforcement learning). To this end, we demonstrate the general machine system on three fundamental tasks including obstacle avoidance, foraging, and predator-prey robot. The proposed solutions are implemented on Robobo robots with mobile device (smartphone with camera) as interface and built-in infrared (IR) sensors. The agent is trained in a virtual environment. In order to assess its performance, the learned agent is tested in the virtual environment and reproduce the same results in a real environment. The results show that the reinforcement learning algorithm can be reliably used for a variety of tasks in unknown environments.

Each year, there are about 400'000 new cases of kidney cancer worldwide causing around 175'000 deaths. For clinical decision making it is important to understand the morphometry of the tumor, which involves the time-consuming task of delineating tumor and kidney in 3D CT images. Automatic segmentation could be an important tool for clinicians and researchers to also study the correlations between tumor morphometry and clinical outcomes. We present a segmentation method which combines the popular U-Net convolutional neural network architecture with post-processing based on statistical constraints of the available training data. The full implementation, based on PyTorch, and the trained weights can be found on GitHub., Comment: KiTS 2019 challenge

A square tiling of the unit square is said to have the minimal tile property if the smallest tile can tile all the other tiles. We show that in such a tiling, the smallest tile cannot be too small.

We define a Johnson graph code as a subspace of labelings of the vertices in a Johnson graph with the property that labelings are uniquely determined by their restriction to vertex neighborhoods specified by the parameters of the code. We give a construction and main properties for the codes and show their role in the concatenation of layered codes that are used in distributed storage systems. A similar class of codes for the Hamming graph is discussed in an appendix. Codes of the latter type are in general different from affine Reed-Muller codes, but for the special case of the hypercube they agree with binary Reed-Muller codes., Comment: 33 pages

Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Quantitatively, for any constants $\pi,\rho>0$ such that $\pi+2\rho<1$, we construct a sequence of error correction codes with block length $N$ approaching infinity, block error probability $\exp(-N^\pi)$, code rate $N^{-\rho}$ less than the Shannon capacity, and encoding and decoding complexity $O(N\log N)$ per code block. The putative codes take uniform $\varsigma$-ary messages for sender's choice of prime $\varsigma$. The putative codes are optimal in the following manner: Should $\pi+2\rho>1$, no such codes exist for generic channels regardless of alphabet and complexity., Comment: 55 pages, 8 figures, 2 tables

We investigate, by series methods, the behaviour of interacting self-avoiding walks (ISAWs) on the honeycomb lattice and on the square lattice. This is the first such investigation of ISAWs on the honeycomb lattice. We have generated data for ISAWs up to 75 steps on this lattice, and 55 steps on the square lattice. For the hexagonal lattice we find the $\theta$-point to be at $u_\mathrm{c} = 2.767 \pm 0.002.$ The honeycomb lattice is unique among the regular two-dimensional lattices in that the exact growth constant is known for non-interacting walks, and is $\sqrt{2+\sqrt{2}}$, while for half-plane walks interacting with a surface, the critical fugacity, again for the honeycomb lattice, is $1+\sqrt{2}$. We could not help but notice that $\sqrt{2+4\sqrt{2}} = 2.767\ldots .$ We discuss the difficulties of trying to prove, or disprove, this possibility. For square lattice ISAWs we find $u_\mathrm{c}=1.9474 \pm 0.001,$ which is consistent with the best Monte Carlo analysis. We also study bridges and terminally-attached walks (TAWs) on the square lattice at the $\theta$-point. We estimate the exponents to be $\gamma_b=0.00 \pm 0.03,$ and $\gamma_1=0.55 \pm 0.03$ respectively. The latter result is consistent with the prediction $\gamma_1(\theta) = \nu =\frac47$, albeit for a modified version of the problem, while the former estimate appears to be new., Comment: 21 pages, 9 figures (v3 with series data included as ancillary files)

The surface of nominally diamagnetic colloidal CdSe nanoplatelets can demonstrate paramagnetism owing to the uncompensated spins of dangling bonds (DBSs). We reveal that by optical spectroscopy in high magnetic fields up to 15 Tesla using the exciton spin as probe of the surface magnetism. The strongly nonlinear magnetic field dependence of the circular polarization of the exciton emission is determined by the DBS and exciton spin polarization as well as by the spin-dependent recombination of dark excitons. The sign of the exciton-DBS exchange interaction can be adjusted by the nanoplatelet growth conditions.

The ability to gain insights into the 3D properties of artificial or biological systems is often critical. However, 3D structures are difficult to retrieve at low dose and with extremely fast processing, as most techniques are based on acquiring and computing hundreds of 2D angular projections. This is even more challenging with ultrashort X-rays which allow realizing nanometre scale studies and ultrafast time resolved 2D movies. Here we show that computer stereo vision concepts can be transposed to X-rays. We demonstrate nanoscale three-dimensional reconstruction from a single ultrafast acquisition. Two diffraction patterns are recorded simultaneously on a single CCD camera and after phase retrieval two stereo images are reconstructed. A 3D representation of the sample is then computed from quantitative disparity maps with about 130x130x380nm3 voxel resolution in a snapshot of 20 femtoseconds. We extend our demonstration to phase contrast X-ray stereo imaging and reveal hidden 3D features of a sample. Computed phase stereo imaging will find scientific applications at X-ray free electron lasers, synchrotrons and laser-based sources, but also in fast industrial and medical 3D diagnostics.

Consider a complete flag $\{0\} = C_0 < C_1 < \cdots < C_n = \mathbb{F}^n$ of one-point AG codes of length $n$ over the finite field $\mathbb{F}$. The codes are defined by evaluating functions with poles at a given point $Q$ in points $P_1,\dots,P_n$ distinct from $Q$. A flag has the isometry-dual property if the given flag and the corresponding dual flag are the same up to isometry. For several curves, including the projective line, Hermitian curves, Suzuki curves, Ree curves, and the Klein curve over the field of eight elements, the maximal flag, obtained by evaluation in all rational points different from the point $Q$, is self-dual. More generally, we ask whether a flag obtained by evaluation in a proper subset of rational points is isometry-dual. In [3] it is shown, for a curve of genus $g$, that a flag of one-point AG codes defined with a subset of $n > 2g+2$ rational points is isometry-dual if and only if the last code $C_n$ in the flag is defined with functions of pole order at most $n+2g-1$. Using a different approach, we extend this characterization to all subsets of size $n \geq 2g+2$. Moreover we show that this is best possible by giving examples of isometry-dual flags with $n=2g+1$ such that $C_n$ is generated by functions of pole order at most $n+2g-2$. We also prove a necessary condition, formulated in terms of maximum sparse ideals of the Weierstrass semigroup of $Q$, under which a flag of punctured one-point AG codes inherits the isometry-dual property from the original unpunctured flag., Comment: 25 pages

The fast forward scheme of adiabatic quantum dynamics is applied to finite regular spin clusters with various geometries and the nature of driving interactions is elucidated. The fast forward is the quasi-adiabatic dynamics guaranteed by regularization terms added to the reference Hamiltonian, followed by a rescaling of time with use of a large scaling factor. With help of the regularization terms consisting of pair-wise and 3-body interactions, we apply the proposed formula (Phys. Rev.A 96, 052106(2017)) to regular triangle and open linear chain for N = 3 spin systems, and to triangular pyramid, square, primary star graph and open linear chain for N = 4 spin systems. The geometry-induced symmetry greatly decreases the rank of coefficient matrix of the linear algebraic equation for regularization terms. Choosing a transverse Ising Hamiltonian as a reference, we find: (1) for N = 3 spin clusters, the driving interaction consists of only the geometry-dependent pairwise interactions and there is no need for the 3-body interaction; (2) for N = 4 spin clusters, the geometry-dependent pair-wise interactions again constitute major part of the driving interaction, whereas the universal 3-body interaction free from the geometry is necessary but plays a subsidiary role. Our scheme predicts the practical driving interaction in accelerating the adiabatic quantum dynamics of structured regular spin clusters., Comment: 17 pages 20 figures. In Press in Phys.Rev.A

A pruned variant of polar coding is proposed for binary erasure channels. For sufficiently small $\varepsilon>0$, we construct a series of capacity achieving codes with block length $N=\varepsilon^{-5}$, code rate $R=\text{Capacity}-\varepsilon$, error probability $P=\varepsilon$, and encoding and decoding time complexity $\text{bC}=O(\log\left|\log\varepsilon\right|)$ per information bit. The given per-bit complexity $\text{bC}$ is log-logarithmic in $N$, in $\text{Capacity}-R$, and in $P$; no known family of codes possesses this property. It is also the second lowest $\text{bC}$ after repeat-accumulate codes and their variants. While random codes and classical polar codes are the only two families of capacity-achieving codes whose $N$, $R$, $P$, and $\text{bC}$ were written down as explicit functions, our construction gives the third family. Then we generalize the result to: Fix a prime $q$ and fix a $q$-ary-input discrete symmetric memoryless channel. For sufficiently small $\varepsilon>0$, we construct a series of capacity achieving codes with block length $N=\varepsilon^{-O(1)}$, code rate $R=\text{Capacity}-\varepsilon$, error probability $P=\varepsilon$, and encoding and decoding time complexity $\text{bC}=O(\log\left|\log\varepsilon\right|)$ per information bit. The later construction gives the fastest family of capacity-achieving codes to date on those channels., Comment: 13 pages, 13 figures; we extend arXiv:1812.08106 and remove "BEC" from title

Rising water demands and depleting freshwater resources have brought desalination and wastewater treatment technologies to the forefront. For sustainable water management, there is a global push towards Zero Liquid Discharge (ZLD) with the goal to maximize water recovery for reuse, and to produce solid waste that lowers the environmental impact of wastewater disposal. Evaporation ponds harvest solar energy as heat for ZLD, but require large land areas due to low evaporation rates. Here, we demonstrate a passive and non-contact approach to enhance evaporation by more than 100% using a photo-thermal umbrella. By converting sunlight into only mid-infrared radiation where water is strongly absorbing, efficient utilization of solar energy and heat localization at the water surface through radiative coupling are achieved. The non-contact nature of the device makes it uniquely suited to treat a wide range of wastewater, and the use of commercially available materials enables a potentially low cost and scalable technology for the sustainable disposal of wastewater, with the added benefit of salt recovery.

We report on the effect of ligand exchange of copper sulphide selenide as well as copper selenide nanocrystals with the organic pi-system Cobalt beta-tetraaminophthalocyanine and analyse changes in the structural, optical as well as electric properties of thin films of these hybrid materials. A strong ligand interaction with the surface of the nanocrystals is revealed by UV-vis absorption and Raman spectroscopy. Grazing-incidence small-angle X-ray scattering studies show a significant contraction in the interparticle distance upon ligand exchange. For copper-deficient copper selenide, this contraction has a negligible effect on electric transport, while for copper-deficient copper sulphide selenide, the conductivity increases by eight orders of magnitude and results in metal-like temperature-dependent transport. We discuss these differences in the light of varying contributions of electronic vs. ionic transport in the two materials and highlight their effect on the stability of the transport properties under ambient conditions. With photocurrent measurements, we demonstrate high optical responsivities of 200-400 A W-1 for the phthalocyanine-capped copper sulphide selenide and emphasize the beneficial role of the organic pi-system in this respect, which acts as an electronic linker and an optical sensitizer at the same time., Comment: 28 pages, 11 Figures

A principal possibility of formation the nanostructures on the surfaces of 50PbO-25Bi$_2$O$_3$-20Ga$_2$O$_3$-5BaO (doped by Eu3+, Er3+, Dy3+) is demonstrated by using multi-coherent beams. As a sources of the photoinducing coherent light we have used nanosecond Nd:YAG and Er:Yb lasers generating at 1064 nm and 1540 nm, respectively. The morphology of the photoinduced surfaces is sensitive to the type of rare earth ions. The thickness of the layer was about 20-30 nm. Possible mechanisms are explained by coherent photoinduction of the valence electrons.

Degenerate plasmas, in which quantum effects dictate the behavior of free electrons, are ubiquitous on earth and throughout space. Transitions between bound and free electron states determine basic plasma properties, yet the effects of degeneracy on these transitions have only been theorized. Here, we use an x-ray free electron laser to create and characterize a degenerate plasma. We observe a core electron fluorescence spectrum that cannot be reproduced by models that ignore free electron degeneracy.We show that degeneracy acts to restrict the available electron energy states, thereby slowing the rate of transitions to and from the continuum. We couple degeneracy and bound electron dynamics in an existing collisional-radiative code, which agrees well with observations. The impact of the shape of the cross section, and hence the magnitude of the correction due to degeneracy, is also discussed. This study shows that degeneracy in plasmas can significantly influence experimental observables such as the emission spectra, and that these effects can be included parametrically in well-established atomic physics codes. This work narrows the gap in understanding between the condensed-matter and plasma phases, which coexist in myriad scenarios.

This note considers cartel stability when the cartelized products are vertically differentiated. If market shares are maintained at pre-collusive levels, then the firm with the lowest competitive price-cost margin has the strongest incentive to deviate from the collusive agreement. The lowest-quality supplier has the tightest incentive constraint when the difference in unit production costs is sufficiently small., Comment: 17 pages, including 3 additional Appendices

A pruned variant of polar coding is reinvented for all binary erasure channels. For small $\varepsilon>0$, we construct codes with block length $\varepsilon^{-5}$, code rate $\text{Capacity}-\varepsilon$, error probability $\varepsilon$, and encoding and decoding time complexity $O(N\log|\log\varepsilon|)$ per block, equivalently $O(\log|\log\varepsilon|)$ per information bit (Propositions 5 to 8). This result also follows if one applies systematic polar coding [Ar{\i}kan 10.1109/LCOMM.2011.061611.110862] with simplified successive cancelation decoding [Alamdar-Yazdi-Kschischang 10.1109/LCOMM.2011.101811.111480], and then analyzes the performance using [Guruswami-Xia arXiv:1304.4321] or [Mondelli-Hassani-Urbanke arXiv:1501.02444]., Comment: 16 pages, 144 figures