Search

Water is essential for almost every aspect of life on our planet and, unsurprisingly, its properties have been studied in great detail. However, disproportionately little remains known about the electrical properties of interfacial and strongly confined water where its structure deviates from that of bulk water, becoming distinctly layered. The structural change is expected to affect water's conductivity and particularly its polarizability, which in turn modifies intermolecular forces that play a crucial role in many physical and chemical processes. Here we use scanning dielectric microscopy to probe the in-plane electrical properties of water confined between atomically flat surfaces separated by distances down to 1 nm. For confinement exceeding a few nm, water exhibits an in-plane dielectric constant close to that of bulk water and its proton conductivity is notably enhanced, gradually increasing with decreasing water thickness. This trend abruptly changes when the confined water becomes only a few molecules thick. Its in-plane dielectric constant reaches giant, ferroelectric-like values of about 1,000 whereas the conductivity peaks at a few S/m, close to values characteristic of superionic liquids. We attribute the enhancement to strongly disordered hydrogen bonding induced by the few-layer confinement, which facilitates both easier in-plane polarization of molecular dipoles and faster proton exchange. This insight into the electrical properties of nanoconfined water is important for understanding many phenomena that occur at aqueous interfaces and in nanoscale pores.

We present a unified rule format for structural operational semantics with terms as labels that guarantees that the associated labelled transition system has some bounded-nondeterminism property. The properties we consider include finite branching, initials finiteness and image finiteness.

The nominal transition systems (NTSs) of Parrow et al. describe the operational semantics of nominal process calculi. We study NTSs in terms of the nominal residual transition systems (NRTSs) that we introduce. We provide rule formats for the specifications of NRTSs that ensure that the associated NRTS is an NTS and apply them to the operational specification of the early pi-calculus. Our study stems from the recent Nominal SOS of Cimini et al. and from earlier works in nominal sets and nominal logic by Gabbay, Pitts and their collaborators., Comment: Conference version of arXiv:1807.02081

Input-output conformance simulation (iocos) has been proposed by Gregorio-Rodr\'iguez, Llana and Mart\'inez-Torres as a simulation-based behavioural preorder underlying model-based testing. This relation is inspired by Tretmans' classic ioco relation, but has better worst-case complexity than ioco and supports stepwise refinement. The goal of this paper is to develop the theory of iocos by studying logical characterisations of this relation, rule formats for it and its compositionality. More specifically, this article presents characterisations of iocos in terms of modal logics and compares them with an existing logical characterisation for ioco proposed by Beohar and Mousavi. It also offers a characteristic-formula construction for iocos over finite processes in an extension of the proposed modal logics with greatest fixed points. A precongruence rule format for iocos and a rule format ensuring that operations take quiescence properly into account are also given. Both rule formats are based on the GSOS format by Bloom, Istrail and Meyer. The general modal decomposition methodology of Fokkink and van Glabbeek is used to show how to check the satisfaction of properties expressed in the logic for iocos in a compositional way for operations specified by rules in the precongruence rule format for iocos ., Comment: Replaced conference version for extended version (this includes a change in the name of the paper plus additional sections and results)

In the setting of the modal logic that characterizes modal refinement over modal transition systems, Boudol and Larsen showed that the formulae for which model checking can be reduced to preorder checking, that is, the characteristic formulae, are exactly the consistent and prime ones. This paper presents general, sufficient conditions guaranteeing that characteristic formulae are exactly the consistent and prime ones. It is shown that the given conditions apply to various behavioural relations in the literature. In particular, characteristic formulae are exactly the prime and consistent ones for all the semantics in van Glabbeek's linear time-branching time spectrum., Comment: Updated conference version with the extended version

This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preorders over labelled transition systems. It is shown that there are mutual translations between modal transition systems and labelled transition systems that preserve, and reflect, refinement and the covariant-contravariant simulation preorder. The translations are also shown to preserve the modal properties that can be expressed in the logics that characterize those preorders. A translation from labelled transition systems modulo the partial bisimulation preorder into the same model modulo the covariant-contravariant simulation preorder is also offered, together with some evidence that the former model is less expressive than the latter. In order to gain more insight into the relationships between modal transition systems modulo refinement and labelled transition systems modulo the covariant-contravariant simulation preorder, their connections are also phrased and studied in the context of institutions., Comment: Replaced conference version with the extended paper published in a journal (This update includes a change in the title of the paper)

Covariant-contravariant simulation and conformance simulation are two generalizations of the simple notion of simulation which aim at capturing the fact that it is not always the case that "the larger the number of behaviors, the better". Therefore, they can be considered to be more adequate to express the fact that a system is a correct implementation of some specification. We have previously shown that these two more elaborated notions fit well within the categorical framework developed to study the notion of simulation in a generic way. Now we show that their behaviors have also simple and natural logical characterizations, though more elaborated than those for the plain simulation semantics.

We present a study of the notion of coalgebraic simulation introduced by Hughes and Jacobs. Although in their original paper they allow any functorial order in their definition of coalgebraic simulation, for the simulation relations to have good properties they focus their attention on functors with orders which are strongly stable. This guarantees a so-called "composition-preserving" property from which all the desired good properties follow. We have noticed that the notion of strong stability not only ensures such good properties but also "distinguishes the direction" of the simulation. For example, the classic notion of simulation for labeled transition systems, the relation "p is simulated by q", can be defined as a coalgebraic simulation relation by means of a strongly stable order, whereas the opposite relation, "p simulates q", cannot. Our study was motivated by some interesting classes of simulations that illustrate the application of these results: covariant-contravariant simulations and conformance simulations.

Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For that we show how to relate the underlying powerset and probabilistic distributions functors with the multiset functor by means of adequate natural transformations. This leads us to the general topic that we investigate in the paper: a natural transformation from a functor F to another G transforms F-bisimulations into G-bisimulations but, in general, it is not possible to express G-bisimulations in terms of F-bisimulations. However, they can be characterized by considering Hughes and Jacobs' notion of simulation, taking as the order on the functor F the equivalence induced by the epi-mono decomposition of the natural transformation relating F and G. We also consider the case of alternating probabilistic systems where non-deterministic and probabilistic choices are mixed, although only in a partial way, and extend all these results to categorical simulations.

Our objective is to extend the standard results of preservation and reflection of properties by bisimulations to the coalgebraic setting, as well as to study under what conditions these results hold for simulations. The notion of bisimulation is the classical one, while for simulations we use that proposed by Hughes and Jacobs. As for properties, we start by using a generalization of linear temporal logic to arbitrary coalgebras suggested by Jacobs, and then an extension by Kurtz which includes atomic propositions too.

In this work we prove local and global well-posedness results for the Cauchy problem of a family of regularized nonlinear Benjamin-type equations in both periodic and nonperiodic Sobolev spaces., Comment: 22 pages

We show that for a wide range of channels and code ensembles with pairwise-independent codewords, with probability tending to 1 with the code length, expurgating an arbitrarily small fraction of codewords from a randomly selected code results in a code attaining the expurgated exponent.

We find the exact typical error exponent of constant composition generalized random Gilbert-Varshamov (RGV) codes over DMCs channels with generalized likelihood decoding. We show that the typical error exponent of the RGV ensemble is equal to the expurgated error exponent, provided that the RGV codebook parameters are chosen appropriately. We also prove that the random coding exponent converges in probability to the typical error exponent, and the corresponding non-asymptotic concentration rates are derived. Our results show that the decay rate of the lower tail is exponential while that of the upper tail is double exponential above the expurgated error exponent. The explicit dependence of the decay rates on the RGV distance functions is characterized., Comment: 60 pages, 2 figures

We propose a universal classifier for binary Neyman-Pearson classification where null distribution is known while only a training sequence is available for the alternative distribution. The proposed classifier interpolates between Hoeffding's classifier and the likelihood ratio test and attains the same error probability prefactor as the likelihood ratio test, i.e., the same prefactor as if both distributions were known. In addition, like Hoeffding's universal hypothesis test, the proposed classifier is shown to attain the optimal error exponent tradeoff attained by the likelihood ratio test whenever the ratio of training to observation samples exceeds a certain value. We propose a lower bound and an upper bound to the training to observation ratio. In addition, we propose a sequential classifier that attains the optimal error exponent tradeoff.

This paper shows that the probability that the error exponent of a given code randomly generated from a pairwise independent ensemble being smaller than a lower bound on the typical random-coding exponent tends to zero as the codeword length tends to infinity. This lower bound is known to be tight for i.i.d. ensembles over the binary symmetric channel and for constant-composition codes over memoryless channels. Our results recover both as special cases and remain valid for arbitrary alphabets, arbitrary channels -- for example finite-state channels with memory -- and arbitrary pairwise-independent ensembles. We specialize our results to the i.i.d., constant-composition and cost-constrained ensembles over discrete memoryless channels and to ensembles over finite-state channels., Comment: 31 pages, 1 figure

This paper studies the concentration properties of random codes. Specifically, we show that, for discrete memoryless channels, the error exponent of a randomly generated code with pairwise-independent codewords converges in probability to its expectation -- the typical error exponent. For high rates, the result is a consequence of the fact that the random-coding error exponent and the sphere-packing error exponent coincide. For low rates, instead, the convergence is based on the fact that the union bound accurately characterizes the probability of error. The paper also zooms into the behavior at asymptotically low rates and shows that the error exponent converges in distribution to a Gaussian-like distribution. Finally, we present several results on the convergence of the error probability and error exponent for generic ensembles and channels., Comment: 98 pages

This paper describes the operational evaluation of a door-opening system based on a low-cost inkless fingerprint sensor. This system has been developed and installed for access control to one of our laboratories. Experimental results reveal that the system is working fine and no special cleaning requirements neither components replacement is needed. It can support more than 50 users, and an average of 74,5 access attempts per day in a 14-hour 5-day-per-week working. Emphasize is also given on some important facts to be taken into consideration when comparing and evaluating different products from different vendors., Comment: 3 pages

In this paper we simulate a real biometric verification system based on on-line signatures. For this purpose we have split the MCYT signature database in three subsets: one for classifier training, another for system adjustment and a third one for system testing simulating enrollment and verification. This context corresponds to a real operation, where a new user tries to enroll an existing system and must be automatically guided by the system in order to detect the failure to enroll situations. The main contribution of this work is the management of failure to enroll situations by means of a new proposal, called intelligent enrollment, which consists of consistency checking in order to automatically reject low quality samples. This strategy lets to enhance the verification errors up to 22% when leaving out 8% of the users. In this situation 8% of the people cannot be enrolled in the system and must be verified by other biometrics or by human abilities. These people are identified with intelligent enrollment and the situation can be thus managed. In addition we also propose a DCT-based feature extractor with threshold coding and discriminability criteria., Comment: 35 pages

Polymer nanocomposite materials based on metallic nanowires are widely investigated as transparent and flexible electrodes or as stretchable conductors and dielectrics for biosensing. Here we show that Scanning Dielectric Microscopy (SDM) can map the depth distribution of metallic nanowires within the nanocomposites in a non-destructive way. This is achieved by a quantitative analysis of sub-surface electrostatic force microscopy measurements with finite-element numerical calculations. As an application we determined the three-dimensional spatial distribution of around 50 nm diameter silver nanowires in 100 - 250 nm thick gelatin films. The characterization is done both under dry ambient conditions, where gelatin shows a relatively low dielectric constant, epsilon around 5, and under humid ambient conditions, where its dielectric constant increases up to epsilon around 14. The present results show that SDM can be a valuable non-destructive subsurface characterization technique for nanowire-based nanocomposite materials, which can contribute to the optimization of these materials for applications in fields such as wearable electronics, solar cell technologies or printable electronics.

We derive a sphere-packing error exponent for coded transmission over discrete memoryless channels with a fixed decoding metric. By studying the error probability of the code over an auxiliary channel, we find a lower bound to the probability of error of mismatched decoding. The bound is shown to decay exponentially for coding rates smaller than a new upper bound to the mismatch capacity which is established in this paper. For rates higher than the new upper bound, the error probability is shown to be bounded away from zero. The new upper bound is shown to improve over previous upper bounds to the mismatch capacity.

We study a variation of Bayesian M-ary hypothesis testing in which the test outputs a list of L candidates out of the M possible upon processing the observation. We study the minimum error probability of list hypothesis testing, where an error is defined as the event where the true hypothesis is not in the list output by the test. We derive two exact expressions of the minimum probability or error. The first is expressed as the error probability of a certain non-Bayesian binary hypothesis test, and is reminiscent of the meta-converse bound. The second, is expressed as the tail probability of the likelihood ratio between the two distributions involved in the aforementioned non-Bayesian binary hypothesis test., Comment: 11 pages, submitted to Information and Inference: a journal of the IMA

We study the problem of mismatched binary hypothesis testing between i.i.d. distributions. We analyze the tradeoff between the pairwise error probability exponents when the actual distributions generating the observation are different from the distributions used in the likelihood ratio test, sequential probability ratio test, and Hoeffding's generalized likelihood ratio test in the composite setting. When the real distributions are within a small divergence ball of the test distributions, we find the deviation of the worst-case error exponent of each test with respect to the matched error exponent. In addition, we consider the case where an adversary tampers with the observation, again within a divergence ball of the observation type. We show that the tests are more sensitive to distribution mismatch than to adversarial observation tampering., Comment: arXiv admin note: text overlap with arXiv:2001.03917

This is a methodological guide to the use of deep neural networks in the processing of pulsed dipolar spectroscopy (PDS) data encountered in structural biology, organic photovoltaics, photosynthesis research, and other domains featuring long-lived radical pairs and paramagnetic metal ions. PDS uses distance dependence of magnetic dipolar interactions; measuring a single well-defined distance is straightforward, but extracting distance distributions is a hard and mathematically ill-posed problem requiring careful regularisation and background fitting. Neural networks do this exceptionally well, but their "robust black box" reputation hides the complexity of their design and training - particularly when the training dataset is effectively infinite. The objective of this paper is to give insight into training against simulated databases, to discuss network architecture choices, to describe options for handling DEER (double electron-electron resonance) and RIDME (relaxation-induced dipolar modulation enhancement) experiments, and to provide a practical data processing flowchart.

We derive an upper bound on the reliability function of mismatched decoding for zero-rate codes. The bound is based on a result by Koml\'os that shows the existence of a subcode with certain symmetry properties. The bound is shown to coincide with the expurgated exponent at rate zero for a broad family of channel-decoding metric pairs.

The study aims to develop an application that will serve as an alternative learning tool for learning Asian Studies. The delivery of lessons into a virtual reality game depends on the pace of students. The developed application comprises several more features that enable users to get valuable information from an immersive environment. The researchers used Rapid Application Development (RAD) in developing the application. It follows phases such as requirement planning, user design, construction, and cutover. Two sets of questionnaires were developed, one for the teachers and another for the students. Then, testing and evaluation were conducted through purposive sampling to select the respondents. The application was overall rated as 3.56 which is verbally interpreted as very good. The result was based on the system evaluation using ISO 9126 in terms of functionality, usability, content, reliability, and performance. The developed application meets the objectives to provide an alternative learning tool for learning Asian Studies. The application is well commended and accepted by the end-users to provide an interactive and immersive environment for students to learn at their own pace. Further enhancement of the audio, gameplay, and graphics of the tool. Schools should take into consideration the adoption of the Asian Studies Virtual Reality is a good alternative tool for their teachers and students to teach and learn Asian Studies. The use of more 3D objects relevant to the given information to enhance the game experience may be considered. A databank for the quiz questions that will be loaded into the game should also be considered., Comment: 14 pages, 10 figures, presented in International Science, Technology and Engineering Conference ISTEC 2019, and published in International Journal of Computing Sciences Research

Concurrent separation logic is distinguished by transfer of state ownership upon parallel composition and framing. The algebraic structure that underpins ownership transfer is that of partial commutative monoids (PCMs). Extant research considers ownership transfer primarily from the logical perspective while comparatively less attention is drawn to the algebraic considerations. This paper provides an algebraic formalization of ownership transfer in concurrent separation logic by means of structure-preserving partial functions (i.e., morphisms) between PCMs, and an associated notion of separating relations. Morphisms of structures are a standard concept in algebra and category theory, but haven't seen ubiquitous use in separation logic before. Separating relations are binary relations that generalize disjointness and characterize the inputs on which morphisms preserve structure. The two abstractions facilitate verification by enabling concise ways of writing specs, by providing abstract views of threads' states that are preserved under ownership transfer, and by enabling user-level construction of new PCMs out of existing ones., Comment: 35 pages

When two-dimensional crystals are brought into close proximity, their interaction results in strong reconstruction of electronic spectrum and local crystal structure. Such reconstruction strongly depends on the twist angle between the two crystals and has received growing attention due to new interesting electronic and optical properties that arise in graphene and transitional metal dichalcogenides. Similarly, novel and potentially useful properties are expected to appear in insulating crystals. Here we study two insulating crystals of hexagonal boron nitride (hBN) stacked at a small twist angle. Using electrostatic force microscopy, we observe ferroelectric-like domains arranged in triangular superlattices with a large surface potential that is independent on the size and orientation of the domains as well as the thickness of the twisted hBN crystals. The observation is attributed to interfacial elastic deformations that result in domains with a large density of out-of-plane polarized dipoles formed by pairs of boron and nitrogen atoms belonging to the opposite interfacial surfaces. This effectively creates a bilayer-thick ferroelectric with oppositely polarized (BN and NB) dipoles in neighbouring domains, in agreement with our modelling. The demonstrated electrostatic domains and their superlattices offer many new possibilities in designing novel van der Waals heterostructures.

We derive a single-letter upper bound to the mismatched-decoding capacity for discrete memoryless channels. The bound is expressed as the mutual information of a transformation of the channel, such that a maximum-likelihood decoding error on the translated channel implies a mismatched-decoding error in the original channel. In particular, a strong converse is shown to hold for this upper-bound: if the rate exceeds the upper-bound, the probability of error tends to 1 exponentially when the block-length tends to infinity. We also show that the underlying optimization problem is a convex-concave problem and that an efficient iterative algorithm converges to the optimal solution. In addition, we show that, unlike achievable rates in the literature, the multiletter version of the bound does not improve. A number of examples are discussed throughout the paper.

Shannon's channel coding theorem characterizes the maximal rate of information that can be reliably transmitted over a communication channel when optimal encoding and decoding strategies are used. In many scenarios, however, practical considerations such as channel uncertainty and implementation constraints rule out the use of an optimal decoder. The mismatched decoding problem addresses such scenarios by considering the case that the decoder cannot be optimized, but is instead fixed as part of the problem statement. This problem is not only of direct interest in its own right, but also has close connections with other long-standing theoretical problems in information theory. In this monograph, we survey both classical literature and recent developments on the mismatched decoding problem, with an emphasis on achievable random-coding rates for memoryless channels. We present two widely-considered achievable rates known as the generalized mutual information (GMI) and the LM rate, and overview their derivations and properties. In addition, we survey several improved rates via multi-user coding techniques, as well as recent developments and challenges in establishing upper bounds on the mismatch capacity, and an analogous mismatched encoding problem in rate-distortion theory. Throughout the monograph, we highlight a variety of applications and connections with other prominent information theory problems., Comment: Published in Foundations and Trends in Communications and Information Theory (Volume 17, Issue 2-3)

We study the problem of mismatched likelihood ratio test. We analyze the type-\RNum{1} and \RNum{2} error exponents when the actual distributions generating the observation are different from the distributions used in the test. We derive the worst-case error exponents when the actual distributions generating the data are within a relative entropy ball of the test distributions. In addition, we study the sensitivity of the test for small relative entropy balls.