The aim of this article is to propose a core game theory model of transaction costs wherein it is indicated how direct costs determine the probability of loss and subsequent transaction costs. The existence of optimum is proven, and the way in which exposure influences the location of the optimum is demonstrated. The decisions are described as a two-player game and it is discussed how the transaction cost sharing rule determines whether the optimum point of transaction costs is the same as the equilibrium of the game. The dispute between actors regarding changing the share of transaction costs to be paid by each party is modeled by a non-cooperative bargaining game. Requirements of efficient transaction cost sharing rules are defined, and it is posited that solution exists which is not unique. Policy conclusions are also devised based on principles of design of institutions to influence the nature of transaction costs.

The problem of reliable function computation is extended by imposing privacy, secrecy, and storage constraints on a remote source whose noisy measurements are observed by multiple parties. The main additions to the classic function computation problem include 1) privacy leakage to an eavesdropper is measured with respect to the remote source rather than the transmitting terminals’ observed sequences; 2) the information leakage to a fusion center with respect to the remote source is considered as a new privacy leakage metric; 3) the function computed is allowed to be a distorted version of the target function, which allows to reduce the storage rate as compared to a reliable function computation scenario in addition to reducing secrecy and privacy leakages; 4) two transmitting node observations are used to compute a function. Inner and outer bounds on the rate regions are derived for lossless and lossy single-function computation with two transmitting nodes, which recover previous results in the literature. For special cases that include invertible and partially-invertible functions, and degraded measurement channels, exact lossless and lossy rate regions are characterized, and one exact region is evaluated for an example scenario.

Unsupervised metric learning has been generally studied as a byproduct of dimensionality reduction or manifold learning techniques. Manifold learning techniques like Diusion maps, Laplacian eigenmaps has a special property that embedded space is Euclidean. Although laplacian eigenmaps can provide us with some (dis)similarity information it does not provide with a metric which can further be used on out-of-sample data. On other hand supervised metric learning technique like ITML which can learn a metric needs labeled data for learning. In this work propose methods for incremental unsupervised metric learning. In rst approach Laplacian eigenmaps is used along with Information Theoretic Metric Learning(ITML) to form an unsupervised metric learning method. We rst project data into a low dimensional manifold using Laplacian eigenmaps, in embedded space we use euclidean distance to get an idea of similarity between points. If euclidean distance between points in embedded space is below a threshold t₁ value we consider them as similar points and if it is greater than a certain threshold t₂ we consider them as dissimilar points. Using this we collect a batch of similar and dissimilar points which are then used as a constraints for ITML algorithm and learn a metric. To prove this concept we have tested our approach on various UCI machine learning datasets. In second approach we propose Incremental Diusion Maps by updating SVD in a batch-wise manner.

In this paper we consider the congruence problem that arises in the post-analysis of Bayesian network models reconstructed from different datasets. Apart from the structure, a typical network numerically encodes relationship intensities, assigning numerical score to network edges via the scoring criterion used in the reconstruction process. This scoring is rarely a directly interpretable quantity with proper units of measure and an absolute scale, and often comes short in desirable characteristics of a true metric. This leads to poor portability of edge magnitude considerations between similar networks, originating from different sources. In this work, we address this problem by estimating the effect that data-specific resolution limit has on conditional independence, as reflected by information-theoretic entropy, and by the appropriate modification of MDL score, which removes the inconsistency between the score components in both the meaning and units. We also numerically validate our findings and expose additional performance advantages obtained via this modification.

Using density functional theory (DFT) and the information-theoretic approach (ITA) quantities to appreciate the energetics and properties of biopolymers is still an unaccomplished and ongoing task. To this end, we studied the building blocks of nucleic acid base pairs and small peptides. For base pairs, we have dissected the relative importance of energetic components by using two energy partition schemes in DFT. Our results convincingly show that the exchange-correlation effect predominantly governs the molecular stability of base pairs while the electrostatic potential plays a minor but indispensable role, and the steric effect is trivial. Furthermore, we have revealed that simple density-based ITA functions are in good relationships with molecular polarizabilities for a series of 30 hydrogen-bonded base pairs and all 20 natural α-amino acids, 400 dipeptides, and 8000 tripeptides. Based on these lines, one can easily predict the molecular polarizabilities of larger peptides, even proteins as long as the total molecular wavefunction is available, rather than solving the computationally demanding coupled-perturbed Hartree-Fock (CPHF) equation or its DFT counterpart coupled-perturbed Kohn-Sham (CPKS) equation.

Outcomes of repeated decision--making processes may be affected by adversarial actors, without being noticed. Adversaries may try to gain knowledge about a particular decision--making process, identify its decision--makers, and guess which underlying decision support model is used. Then they can simulate the process, and craft different scenarios to affect its decision outcomes. Therefore, designers of decision support systems need to incorporate this in the decision modeling phase. The purpose of this study is to demonstrate this for the repeated decision--making in a patent application process. In this process, two sequential decision outcomes can be affected by adversarial actors: a company's decision to which type of patent office to send a patent request to, and the decision of a specialized patent officer to grant an application, or not. It is motivated that the company's decision--maker is \emph{bounded} rational. A theory for information--theoretic bounded rational decision--making under uncertainty proposed by Ortega et al.\ is adopted to model this type of decision--maker. A framework is provided to simulate a number of scenarios that adversaries may deploy to affect decision outcomes of a repeated patent application decision--making process. The framework is also utilized for statistically testing the presence of the scenarios, and to demonstrate how to discourage adversaries from deploying them.

Rigid-body visual tracking is an active research field with many practical applications including visual surveillance and intelligent transport system. In this paper, we define a new problem domain, called visual growth tracking, to track different parts of an object that grow non-uniformly over space and time for application in image-based plant phenotyping. The paper introduces a novel method to detect and track each leaf of a plant for automated leaf stage monitoring. The method has four phases: optimal view selection, plant architecture determination, leaf tracking and generation of a leaf status report. The proposed method uses a graph theoretic approach to reliably detect and track individual leaves by overcoming the challenge of leaf-losses based on temporal image sequence analysis for automatically generating the leaf status report containing the following phenotypes, i.e., the emergence timing of each leaf, total number of leaves present at any time, the day on which a particular leaf stopped growing, and the length and relative growth rate of individual leaves. The proposed method demonstrates high accuracy in detecting leaves and tracking them through the early vegetative stages of maize plants based on experimental evaluation on a publicly available benchmark dataset.

Noisy data is always encountered in real applications, such as bioinformatics, neuroimage and remote sensing. Existing methods mainly consider linear or generalized linear errors-in-variables regression, while relatively little attention is paid for the multivariate response case, and how to evaluate the estimation performance under perturbed covariates is still an open question. In this paper, we consider the information-theoretic limitations of estimating a low-rank matrix in the multi-response errors-in-variables regression model. By application of the information theory and statistical techniques on concentration inequalities, the minimax lower bound is provided in terms of the squared Frobenius loss, which recaptures the rate provided under the clean covariate assumption in previous literatures. Hence our result further indicates that though under the more realistic errors-in-variables situation, no more samples are required so as to achieve a rate-optimal estimation.

The search for new materials that could improve the energy density of Li-ion batteries (LIB) is one of today’s most challenging issues. Recently, cation-disordered lithium-excess metal oxides have emerged as a promising new class of cathode materials for LIB, due to their high reversible capacities and nice structural stability. However, a full structural model of the Li-transition metal (TM) sharing sublattice and the origin of short range ordering (SRO) of cation ions requires further investigation. In this work, we put forward a Monte Carlo strategy of building a cation-disordered rocksalt material supercell model. The cation ions of Li_1.0Ti_0.5Ni_0.5O₂ (LTNO) are placed at the FCC sublattice sites with the constraint of Pauling’s electroneutrality rule, instead of a random way. This constraint causes the Li-Ti and Ni-Ni clustering (the cation short range ordering). Based on this model, we discussed the relationship between the short range ordering, the local distorting, the theoretic capacity and the order-disorder strengths. A unified understanding of these factors in cation-disordered materials may enable a better design of disordered-electrode materials with high capacity and high energy density.

The success of source protection in ensuring safe drinking water is centered around being able to understand the hazards present in the catchment then plan and implement control measures to manage water quality risk to levels which can be controlled through downstream barriers. The programs in place to manage source protection are complex sociotechnical systems involving policy, standards, regulators, technology, human factors and so on. This study uses System Theoretic Process Analysis (STPA) to analyze the operational hazards of a typical drinking water source protection (DWSP) program and identify control measures to ensure safe operations. To validate the results a questionnaire was developed and distributed to specialists in DWSP in Taiwan, Australia and Greece. Using Principle Components Analysis (PCA) of the questionnaire responses, the study identified four critical success factors (CSFs) for DWSP. The four factors identified are ‘Policy and Government Agency Support of Source Protection’, ‘Catchment Risk Monitoring and Information’, ‘Support of Operational Field Activities’ and ‘Response to Water Quality Threats’. The results of this study provide insight into the approach of grouping of source protection measures to identify a series of targeted CSF for operational source protection programs. Using CSF can aide catchment management agencies in ensuring that the risk level in the catchment is managed effectively and that threats to public health from drinking water are managed appropriately.

Information geometry (IG) seeks to characterize the structure of statistical geodesic models from a differential geometric point of view. By considering families of probability distributions as manifolds with coordinate charts determined by the parameters of each individual model, the tools of differential geometry, such as divergences and metric tensors, provide effective means of studying their characteristics. The research undertaken in this paper presents a novel approach to the modelling study of information geometrics of a queueing system. In this context, the manifold of a stable M/G/1queue is characterised from the viewpoint of IG. The Fisher Information matrix (FIM) as well as the inverse of (FIM), (IFIM) of stable M/G/1 queue manifold are devised. In addition to that, new results that uncovered the significant impact of stability of M/G/1 queue manifold on the existence of (IFIM) are obtained. The Kullback’s divergence (KD), and J-divergence (JD).New result has been devised on the significant impact of both server utilization and squared coefficient of variation of the underlying M/G/1 queue manifold on both (KD) and (KD) are devised. Also, it is revealed that stable M/G/1 QM is developable (i.e., has a zero Gaussian curvature) and has a non-zero Ricci Curvature Tensor (RCT). Novel stability dynamics of M/G/1 queue manifold is revealed by discovering the mutual dual impact between the behaviour of (RCT) and the stability and the instability phases of the underlying M/G/1 queue manifold. Furthermore, a new discovery that presents the significant impact of stability of M/G/1 queue manifold and the continuity of the unique representation between M/G/1 queue manifold and Ricci Curvature Tensor (RCT). The information matrix exponential (IME) is devised. It is also shown that the obtained (IME) is unstable. Also, it is shown that stability of the devised (IME) enforces the instability of M/G/1 queue manifold. Unifying IG with Queueing Theory enables the study of dynamics of queueing system from a novel Riemannian Geometric (RG) point of view, leading to the analysis of the stable M/G/1 queue, based on the Theory of Relativity (TR).Extending the study over two new additional divergence measures, namely and together with a complete illustrative numerical results for all these measures including KD, JD. This links Queueing theory, IG with deep machine learning and metric learning. Furthermore, this reveals the revolutionary approach of queue learning. Full analytic study of Gaussian curvatures subject to both Angular and Monge techniques together with the overall stability dynamics impact on these curvatures. Full analytic study of Einestein Tensor and Stress Energy Tensor together with the overall stability dynamics impact on these curvatures. The inclusion of the definitions of Gaussian and Ricci, Ricci scalar curvatures and Einstein Tensor together with their physical interpretations; The proposed novel approach for the pioneer visualization of queueing systems via computational information geometry. The determination of new important links between classical queueing theory and other mathematical disciplines, such as IG, matrix theory Riemannian geometry and the THEORY OF RELATIVITY by providing for first time i) The full detailed derivations of the Gaussian curvature ii) The Ricci curvature tensor and iii) The full physical as well as the geometric interpretation of these new results. The provision of a novel link between Ricci Curvature (RCT) and the stability analysis of the stable M/G/1 QM. The full investigation of the newly introduced QT-IG unifiers together with the impact of stability/ instability of the underlying M/G/1 QM on them. The full investigation of the newly introduced (QIGU) unifiers together with the impact of stability/ instability of the underlying M/G/1 QM on them.