{"title":"From dimension-free manifolds to dimension-varying control systems","authors":"D. Cheng, Zhengping Ji","doi":"10.4310/cis.2023.v23.n1.a4","DOIUrl":"https://doi.org/10.4310/cis.2023.v23.n1.a4","url":null,"abstract":"Starting from the vector multipliers, the inner product, norm, distance, as well as addition of two vectors of different dimensions are proposed, which makes the spaces into a topological vector space, called the Euclidean space of different dimension (ESDD). An equivalence is obtained via distance. As a quotient space of ESDDs w.r.t. equivalence, the dimension-free Euclidean spaces (DFESs) and dimension-free manifolds (DFMs) are obtained, which have bundled vector spaces as its tangent space at each point. Using the natural projection from a ESDD to a DFES, a fiber bundle structure is obtained, which has ESDD as its total space and DFES as its base space. Classical objects in differential geometry, such as smooth functions, (co-)vector fields, tensor fields, etc., have been extended to the case of DFMs with the help of projections among different dimensional Euclidean spaces. Then the dimension-varying dynamic systems (DVDSs) and dimension-varying control systems (DVCSs) are presented, which have DFM as their state space. The realization, which is a lifting of DVDSs or DVCSs from DFMs into ESDDs, and the projection of DVDSs or DVCSs from ESDDs onto DFMs are investigated.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127711133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TransLoc3D : Point Cloud based Large-scale Place Recognition using Adaptive Receptive Fields","authors":"Tianhan Xu, Yuanchen Guo, Yu-Kun Lai, Song-Hai Zhang","doi":"10.4310/cis.2023.v23.n1.a3","DOIUrl":"https://doi.org/10.4310/cis.2023.v23.n1.a3","url":null,"abstract":"Place recognition plays an essential role in the field of autonomous driving and robot navigation. Point cloud based methods mainly focus on extracting global descriptors from local features of point clouds. Despite having achieved promising results, existing solutions neglect the following aspects, which may cause performance degradation: (1) huge size difference between objects in outdoor scenes; (2) moving objects that are unrelated to place recognition; (3) long-range contextual information. We illustrate that the above aspects bring challenges to extracting discriminative global descriptors. To mitigate these problems, we propose a novel method named TransLoc3D, utilizing adaptive receptive fields with a point-wise reweighting scheme to handle objects of different sizes while suppressing noises, and an external transformer to capture long-range feature dependencies. As opposed to existing architectures which adopt fixed and limited receptive fields, our method benefits from size-adaptive receptive fields as well as global contextual information, and outperforms current state-of-the-arts with significant improvements on popular datasets.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116142139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
B. Jones, Sheik Ahmed Ullah, Siwen Wang, Shan Zhao
{"title":"Adaptive pseudo-time methods for the Poisson-Boltzmann equation with Eulerian solvent excluded surface","authors":"B. Jones, Sheik Ahmed Ullah, Siwen Wang, Shan Zhao","doi":"10.4310/cis.2021.v21.n1.a5","DOIUrl":"https://doi.org/10.4310/cis.2021.v21.n1.a5","url":null,"abstract":"This work further improves the pseudo-transient approach for the Poisson Boltzmann equation (PBE) in the electrostatic analysis of solvated biomolecules. The numerical solution of the nonlinear PBE is known to involve many difficulties, such as exponential nonlinear term, strong singularity by the source terms, and complex dielectric interface. Recently, a pseudo-time ghost-fluid method (GFM) has been developed in [S. Ahmed Ullah and S. Zhao, Applied Mathematics and Computation, 380, 125267, (2020)], by analytically handling both nonlinearity and singular sources. The GFM interface treatment not only captures the discontinuity in the regularized potential and its flux across the molecular surface, but also guarantees the stability and efficiency of the time integration. However, the molecular surface definition based on the MSMS package is known to induce instability in some cases, and a nontrivial Lagrangian-to-Eulerian conversion is indispensable for the GFM finite difference discretization. In this paper, an Eulerian Solvent Excluded Surface (ESES) is implemented to replace the MSMS for defining the dielectric interface. The electrostatic analysis shows that the ESES free energy is more accurate than that of the MSMS, while being free of instability issues. Moreover, this work explores, for the first time in the PBE literature, adaptive time integration techniques for the pseudo-transient simulations. A major finding is that the time increment $Delta t$ should become smaller as the time increases, in order to maintain the temporal accuracy. This is opposite to the common practice for the steady state convergence, and is believed to be due to the PBE nonlinearity and its time splitting treatment. Effective adaptive schemes have been constructed so that the pseudo-time GFM methods become more efficient than the constant $Delta t$ ones.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126444675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Inverted repeats in coronavirus SARS-CoV-2 genome and implications in evolution","authors":"Changchuan Yin, S. Yau","doi":"10.4310/cis.2021.v21.n1.a6","DOIUrl":"https://doi.org/10.4310/cis.2021.v21.n1.a6","url":null,"abstract":"The coronavirus disease (COVID-19) pandemic, caused by the coronavirus SARS-CoV-2, has caused 60 millions of infections and 1.38 millions of fatalities. Genomic analysis of SARS-CoV-2 can provide insights on drug design and vaccine development for controlling the pandemic. Inverted repeats in a genome greatly impact the stability of the genome structure and regulate gene expression. Inverted repeats involve cellular evolution and genetic diversity, genome arrangements, and diseases. Here, we investigate the inverted repeats in the coronavirus SARS-CoV-2 genome. We found that SARS-CoV-2 genome has an abundance of inverted repeats. The inverted repeats are mainly located in the gene of the Spike protein. This result suggests the Spike protein gene undergoes recombination events, therefore, is essential for fast evolution. Comparison of the inverted repeat signatures in human and bat coronaviruses suggest that SARS-CoV-2 is mostly related SARS-related coronavirus, SARSr-CoV/RaTG13. The study also reveals that the recent SARS-related coronavirus, SARSr-CoV/RmYN02, has a high amount of inverted repeats in the spike protein gene. Besides, this study demonstrates that the inverted repeat distribution in a genome can be considered as the genomic signature. This study highlights the significance of inverted repeats in the evolution of SARS-CoV-2 and presents the inverted repeats as the genomic signature in genome analysis.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133585171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Linear-quadratic mean field games with a major player: Nash certainty equivalence versus master equations","authors":"Minyi Huang","doi":"10.4310/CIS.2021.V21.N3.A6","DOIUrl":"https://doi.org/10.4310/CIS.2021.V21.N3.A6","url":null,"abstract":"Mean field games with a major player were introduced in (Huang, 2010) within a linear-quadratic (LQ) modeling framework. Due to the rich structure of major-minor player models, the past ten years have seen significant research efforts for different solution notions and analytical techniques. For LQ models, we address the relation between three solution frameworks: the Nash certainty equivalence (NCE) approach in (Huang, 2010), master equations, and asymptotic solvability, which have been developed starting with different ideas. We establish their equivalence relationships.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123806188","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Neural-PDE: a RNN based neural network for solving time dependent PDEs","authors":"Yihao Hu, Tong Zhao, Shixin Xú, Lizhen Lin, Zhiliang Xu","doi":"10.4310/cis.2022.v22.n2.a3","DOIUrl":"https://doi.org/10.4310/cis.2022.v22.n2.a3","url":null,"abstract":"Partial differential equations (PDEs) play a crucial role in studying a vast number of problems in science and engineering. Numerically solving nonlinear and/or high-dimensional PDEs is often a challenging task. Inspired by the traditional finite difference and finite elements methods and emerging advancements in machine learning, we propose a sequence deep learning framework called Neural-PDE, which allows to automatically learn governing rules of any time-dependent PDE system from existing data by using a bidirectional LSTM encoder, and predict the next n time steps data. One critical feature of our proposed framework is that the Neural-PDE is able to simultaneously learn and simulate the multiscale variables.We test the Neural-PDE by a range of examples from one-dimensional PDEs to a high-dimensional and nonlinear complex fluids model. The results show that the Neural-PDE is capable of learning the initial conditions, boundary conditions and differential operators without the knowledge of the specific form of a PDE system.In our experiments the Neural-PDE can efficiently extract the dynamics within 20 epochs training, and produces accurate predictions. Furthermore, unlike the traditional machine learning approaches in learning PDE such as CNN and MLP which require vast parameters for model precision, Neural-PDE shares parameters across all time steps, thus considerably reduces the computational complexity and leads to a fast learning algorithm.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126903061","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Deep filtering","authors":"L. Wang, G. Yin, Qing Zhang","doi":"10.4310/cis.2021.v21.n4.a6","DOIUrl":"https://doi.org/10.4310/cis.2021.v21.n4.a6","url":null,"abstract":"This paper develops a deep learning method for linear and nonlinear filtering. The idea is to start with a nominal dynamic model and generate Monte Carlo sample paths. Then these samples are used to train a deep neutral network. A least square error is used as a loss function for network training. Then the resulting weights are applied to Monte Carlo sampl es from an actual dynamic model. The deep filter obtained in such a way compares favorably to the traditional Kalman filter in linear cases and the extended Kalman filter in nonlinear cases. Moreover, a switching model with jumps is studied to show the adaptiveness and power of our deep filtering method. A main advantage of deep filtering is its robustness when the nominal model and actual model differ. Another advantage of deep filtering is that real data can be used directly to train the deep neutral network. Therefore, one does not need to calibrate the model.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125301037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, Wojtek Szpankowski
{"title":"Compression and Symmetry of Small-World Graphs and Structures","authors":"Ioannis Kontoyiannis, Yi Heng Lim, Katia Papakonstantinopoulou, Wojtek Szpankowski","doi":"10.4310/cis.2022.v22.n2.a5","DOIUrl":"https://doi.org/10.4310/cis.2022.v22.n2.a5","url":null,"abstract":"For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and finally, given then structure and labeling, the contents of the labels can be described. Determining the amount of information present at each level and quantifying the degree of dependence between them, requires the study of symmetry, graph automorphism, entropy, and graph compressibility. In this paper, we focus on a class of small-world graphs. These are geometric random graphs where vertices are first connected to their nearest neighbors on a circle and then pairs of non-neighbors are connected according to a distance-dependent probability distribution. We establish the degree distribution of this model, and use it to prove the model's asymmetry in an appropriate range of parameters. Then we derive the relevant entropy and structural entropy of these random graphs, in connection with graph compression.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129561444","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Trajectorial dissipation and gradient flow for the relative entropy in Markov chains","authors":"I. Karatzas, J. Maas, W. Schachermayer","doi":"10.4310/CIS.2021.V21.N4.A1","DOIUrl":"https://doi.org/10.4310/CIS.2021.V21.N4.A1","url":null,"abstract":"We study the temporal dissipation of variance and relative entropy for ergodic Markov Chains in continuous time, and compute explicitly the corresponding dissipation rates. These are identified, as is well known, in the case of the variance in terms of an appropriate Hilbertian norm; and in the case of the relative entropy, in terms of a Dirichlet form which morphs into a version of the familiar Fisher information under conditions of detailed balance. Here we obtain trajectorial versions of these results, valid along almost every path of the random motion and most transparent in the backwards direction of time. Martingale arguments and time reversal play crucial roles, as in the recent work of Karatzas, Schachermayer and Tschiderer for conservative diffusions. Extension are developed to general \"convex divergences\" and to countable state-spaces. The steepest descent and gradient flow properties for the variance, the relative entropy, and appropriate generalizations, are studied along with their respective geometries under conditions of detailed balance, leading to a very direct proof for the HWI inequality of Otto and Villani in the present context.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125751598","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On a Fejer-Riesz factorization of generalized trigonometric polynomials","authors":"T. Georgiou, A. Lindquist","doi":"10.4310/CIS.2021.V21.N3.A3","DOIUrl":"https://doi.org/10.4310/CIS.2021.V21.N3.A3","url":null,"abstract":"Function theory on the unit disc proved key to a range of problems in statistics, probability theory, signal processing literature, and applications, and in this, a special place is occupied by trigonometric functions and the Fejer-Riesz theorem that non-negative trigonometric polynomials can be expressed as the modulus of a polynomial of the same degree evaluated on the unit circle. In the present note we consider a natural generalization of non-negative trigonometric polynomials that are matrix-valued with specified non-trivial poles (i.e., other than at the origin or at infinity). We are interested in the corresponding spectral factors and, specifically, we show that the factorization of trigonometric polynomials can be carried out in complete analogy with the Fejer-Riesz theorem. The affinity of the factorization with the Fejer-Riesz theorem and the contrast to classical spectral factorization lies in the fact that the spectral factors have degree smaller than what standard construction in factorization theory would suggest. We provide two juxtaposed proofs of this fundamental theorem, albeit for the case of strict positivity, one that relies on analytic interpolation theory and another that utilizes classical factorization theory based on the Yacubovich-Popov-Kalman (YPK) positive-real lemma.","PeriodicalId":185710,"journal":{"name":"Commun. Inf. Syst.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128193738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}