Axisymmetric free vibrations of infinite thermoelastic plate

The propagation of axisymmetric free vibrations in an infinite homogeneous isotropic micropolar thermoelastic plate without energy dissipation subjected to stress free and rigidly fixed boundary conditions is investigated. The secular equations for homogeneous isotropic micropolar thermoelastic plate without energy dissipation in closed form for symmetric and skew symmetric wave modes of propagation are derived. The different regions of secular equations are obtained. At short wavelength limits, the secular equations for symmetric and skew symmetric modes of wave propagation in a stress free insulated and isothermal plate reduce to Rayleigh surface wave frequency equation. The results for thermoelastic, micropolar elastic and elastic materials are obtained as particular cases from the derived secular equations. The amplitudes of displacement components, microrotation and temperature distribution are also computed during the symmetric and skew symmetric motion of the plate. The dispersion curves for symmetric and skew symmetric modes and amplitudes of displacement components, microrotation and temperature distribution in case of fundamental symmetric and skew symmetric modes are presented graphically. The analytical and numerical results are found to be in close agreement.     

Integrated Access to Genomic and Other Bioinformation: An Essential Ingredient of the Drug Discovery Process

Abstract

Due to the high rate of data production and the need of researchers to have rapid access to new data, public databases have become the major medium through which genome mapping and sequencing data as well as macromolecular structural data are published. There are now more than 250 databases of biomolecular, structural, genetic, or phenotypic data, many of which are doubling in size annually. These databases, many of which were created and are maintained by experimentalists for their own research use, provide valuable collections of organized, validated data. However, the very number and diversity of databases now make efficient data resource discovery as important as effective data resource use. Existing autonomous biological databases contain related data which are more valuable when interconnected than when isolated. Political and scientific realities dictate that these databases will be built by different teams, in different locations, for different purposes, and using different data models and supporting DBMSs. As a consequence, connecting the related data they contain is not straightforward. Experience with existing biological databases indicates that it is possible to form useful queries across these databases, but that doing so usually requires expertise in the semantic structure of each source database. Advancing to the next level of integration among biological information resources poses significant technical and sociological challenges.     

Determining Causal Skeletons with Information Theory

Modeling a causal association as arising from a communication process between cause and effect, simplifies the discovery of causal skeletons. The communication channels enabling these communication processes, are fully characterized by stochastic tensors, and therefore allow us to use linear algebra. This tensor-based approach reduces the dimensionality of the data needed to test for conditional independence, e.g., for systems comprising three variables, pair-wise determined tensors suffice to infer the causal skeleton. The only thing needed is a minor extension to information theory, namely the concept of path information.     

Optimizing Age Penalty in Time-Varying Networks with Markovian and Error-Prone Channel State

In this paper, we consider a scenario where the base station (BS) collects time-sensitive data from multiple sensors through time-varying and error-prone channels. We characterize the data freshness at the terminal end through a class of monotone increasing functions related to Age of information (AoI). Our goal is to design an optimal policy to minimize the average age penalty of all sensors in infinite horizon under bandwidth and power constraint. By formulating the scheduling problem into a constrained Markov decision process (CMDP), we reveal the threshold structure for the optimal policy and approximate the optimal decision by solving a truncated linear programming (LP). Finally, a bandwidth-truncated policy is proposed to satisfy both power and bandwidth constraint. Through theoretical analysis and numerical simulations, we prove the proposed policy is asymptotic optimal in the large sensor regime.     

Avoiding problems with hydrogen misplacement in reporting crystal structures

Intermolecular hydrogen bonding is an integral part of many crystal structures. Hydrogen bonding sometimes results in one‐, two‐ or three‐dimensional supramolecular assemblies, a common feature of which is positional disorder of H atoms related to space‐group symmetry. Yet some reported structures fail to include all possible donor–acceptor close contacts, or to seek H‐atom electron densities associated with apparent D—H...A trios, while some H‐atom positions violate principles of chemistry or crystal physics. Modern diffraction equipment and sophisticated computing systems provide high‐quality data; thus, failure to characterize and report fully an accurate, complete and physically correct hydrogen‐bonding model should not be acceptable. We illustrate the relevant issues with three published examples in the hope of slowing the proliferation of these problems, with the scientifically desirable goal of improving the accuracy of crystallographic models while also providing improved search keys for information retrieval.     

The Self-Information Weighting-Based Node Importance Ranking Method for Graph Data

Due to their wide application in many disciplines, how to make an efficient ranking for nodes, especially for nodes in graph data, has aroused lots of attention. To overcome the shortcoming that most traditional ranking methods only consider the mutual influence between nodes but ignore the influence of edges, this paper proposes a self-information weighting-based method to rank all nodes in graph data. In the first place, the graph data are weighted by regarding the self-information of edges in terms of node degree. On this base, the information entropy of nodes is constructed to measure the importance of each node and in which case all nodes can be ranked. To verify the effectiveness of this proposed ranking method, we compare it with six existing methods on nine real-world datasets. The experimental results show that our method performs well on all of these nine datasets, especially for datasets with more nodes.     

Predicting Bitcoin (BTC) Price in the Context of Economic Theories: A Machine Learning Approach

Bitcoin (BTC)—the first cryptocurrency—is a decentralized network used to make private, anonymous, peer-to-peer transactions worldwide, yet there are numerous issues in its pricing due to its arbitrary nature, thus limiting its use due to skepticism among businesses and households. However, there is a vast scope of machine learning approaches to predict future prices precisely. One of the major problems with previous research on BTC price predictions is that they are primarily empirical research lacking sufficient analytical support to back up the claims. Therefore, this study aims to solve the BTC price prediction problem in the context of both macroeconomic and microeconomic theories by applying new machine learning methods. Previous work, however, shows mixed evidence of the superiority of machine learning over statistical analysis and vice versa, so more research is needed. This paper applies comparative approaches, including ordinary least squares (OLS), Ensemble learning, support vector regression (SVR), and multilayer perceptron (MLP), to investigate whether the macroeconomic, microeconomic, technical, and blockchain indicators based on economic theories predict the BTC price or not. The findings point out that some technical indicators are significant short-run BTC price predictors, thus confirming the validity of technical analysis. Moreover, macroeconomic and blockchain indicators are found to be significant long-term predictors, implying that supply, demand, and cost-based pricing theories are the underlying theories of BTC price prediction. Likewise, SVR is found to be superior to other machine learning and traditional models. This research’s innovation is looking at BTC price prediction through theoretical aspects. The overall findings show that SVR is superior to other machine learning models and traditional models. This paper has several contributions. It can contribute to international finance to be used as a reference for setting asset pricing and improved investment decision-making. It also contributes to the economics of BTC price prediction by introducing its theoretical background. Moreover, as the authors still doubt whether machine learning can beat the traditional methods in BTC price prediction, this research contributes to machine learning configuration and helping developers use it as a benchmark.     

The Consensus Problem in Polities of Agents with Dissimilar Cognitive Architectures

Agents interacting with their environments, machine or otherwise, arrive at decisions based on their incomplete access to data and their particular cognitive architecture, including data sampling frequency and memory storage limitations. In particular, the same data streams, sampled and stored differently, may cause agents to arrive at different conclusions and to take different actions. This phenomenon has a drastic impact on polities—populations of agents predicated on the sharing of information. We show that, even under ideal conditions, polities consisting of epistemic agents with heterogeneous cognitive architectures might not achieve consensus concerning what conclusions to draw from datastreams. Transfer entropy applied to a toy model of a polity is analyzed to showcase this effect when the dynamics of the environment is known. As an illustration where the dynamics is not known, we examine empirical data streams relevant to climate and show the consensus problem manifest.     

Logical Entropy of Information Sources

In this paper, we present the concept of the logical entropy of order m, logical mutual information, and the logical entropy for information sources. We found upper and lower bounds for the logical entropy of a random variable by using convex functions. We show that the logical entropy of the joint distributions X1 and X2 is always less than the sum of the logical entropy of the variables X1 and X2. We define the logical Shannon entropy and logical metric permutation entropy to an information system and examine the properties of this kind of entropy. Finally, we examine the amount of the logical metric entropy and permutation logical entropy for maps.