Databases of 2D material-substrate interfaces and 2D charged building blocks

Discovery of materials using“bottom-up”or“top-down”approach is of great interest in materials science.Layered materials consisting of two-dimensional(2D)building blocks provide a good platform to explore new materials in this respect.In van der Waals(vdW)layered materials,these building blocks are charge neutral and can be isolated from their bulk phase(top-down),but usually grow on substrate.In ionic layered materials,they are charged and usually cannot exist independently but can serve as motifs to construct new materials(bottom-up).In this paper,we introduce our recently constructed databases for 2D material-substrate interface(2DMSI),and 2D charged building blocks.For 2DMSI database,we systematically build a workflow to predict appropriate substrates and their geometries at substrates,and construct the 2DMSI database.For the 2D charged building block database,1208 entries from bulk material database are identified.Information of crystal structure,valence state,source,dimension and so on is provided for each entry with a json format.We also show its application in designing and searching for new functional layered materials.The 2DMSI database,building block database,and designed layered materials are available in Science Data Bank at https://doi.org/10.57760/sciencedb.j00113.00188.

Type-2 Neutrosophic Set and Their Applications in Medical Databases Deadlock Resolution

Electronic patient data gives many advantages,but also new difficulties.Deadlocks may delay procedures like acquiring patient information.Distributed deadlock resolution solutions introduce uncertainty due to inaccurate transaction properties.Soft computing-based solutions have been developed to solve this challenge.In a single framework,ambiguous,vague,incomplete,and inconsistent transaction attribute information has received minimal attention.The work presented in this paper employed type-2 neutrosophic logic,an extension of type-1 neutrosophic logic,to handle uncertainty in real-time deadlock-resolving systems.The proposed method is structured to reflect multiple types of knowledge and relations among transactions’features that include validation factor degree,slackness degree,degree of deadline-missed transaction based on the degree of membership of truthiness,degree ofmembership of indeterminacy,and degree ofmembership of falsity.Here,the footprint of uncertainty(FOU)for truth,indeterminacy,and falsity represents the level of uncertainty that exists in the value of a grade of membership.We employed a distributed real-time transaction processing simulator(DRTTPS)to conduct the simulations and conducted experiments using the benchmark Pima Indians diabetes dataset(PIDD).As the results showed,there is an increase in detection rate and a large drop in rollback rate when this new strategy is used.The performance of Type-2 neutrosophicbased resolution is better than the Type-1 neutrosophic-based approach on the execution ratio scale.The improvement rate has reached 10%to 20%,depending on the number of arrived transactions.

Analysis of E2F3 gene variants,expression and clinical significance in melanoma based on multiple databases

Objective:To investigate the variation,expression and clinical significance of E2F3 gene in melanoma.Methods:Firstly,cBioportal database,Oncomine database and GEO database were used to analyze the variation and expression level of E2F3 gene in melanoma.OSskcm database and TISIDB database were used to analyze the relationship between E2F3 and melanoma prognosis and tumor immune infiltrating cells.Then,the LinkedOmics database was used to identify the differential genes related to E2F3 expression in melanoma and analyze their biological functions.Finally,small molecule compounds for the treatment of melanoma were screened through the CMap database.Results:The mutation rate of E2F3 gene in melanoma is about 4%,and there are 21 mutation sites.Compared with normal skin tissues,the expression of E2F3 gene in melanoma was significantly increased(P<0.01).The mutation and increased expression of E2F3 gene were associated with the shortened overall survival(OS)of melanoma patients(P<0.05).The CNA level of E2F3 was negatively correlated with the expression levels of lymphocytes such as pDC,Neutrophil,Act DC and Th17,and negatively correlated with the expression levels of chemokines such as CXCL5,CCL13 and CCR1.The methylation level of E2F3 was positively correlated with the expression levels of Th1,Neutrophil,Act DC and other lymphocytes,and positively correlated with the expression levels of CXCL16,CXCL12,CCR1 and other chemokines.The expression level of E2F3 was negatively correlated with the expression levels of lymphocytes such as Th17,Tcm CD4 and Th1,and negatively correlated with the expression levels of chemokines such as CXCL 16,CCL 22 and CCL 2.The expression of 96 genes such as UHRF1BP1 in melanoma was significantly correlated with the expression of E2F3(|cor|0.5,P<0.05).The above genes were mainly related to RNA transport,eukaryotic ribosome biogenesis,cell cycle and other pathways.Among them,WDR12,WDR43,RBM28,UTP18,DKC1,PAK1IP1,DDX31,TEX10,TRUB1 and TRMT61B were the top 10 hub genes.YC-1,simvastatin,cytochalasin-d,Deforolimus and cytochalasin-b may be five small molecule compounds for the treatment of melanoma.Conclusion:The mutation and increased expression level of E2F3 gene are related to the poor prognosis of melanoma and participate in the occurrence and development of melanoma by affecting the expression of different tumor immune infiltrating cell subtypes,which may be a potential diagnostic marker and therapeutic target for melanoma.

Comprehensive analysis of advanced glycation end-products in commonly consumed foods:presenting a database for dietary AGEs and associated exposure assessment

Advanced glycation end-products(AGEs)are a group of heterogeneous compounds formed in heatprocessed foods and are proven to be detrimental to human health.Currently,there is no comprehensive database for AGEs in foods that covers the entire range of food categories,which limits the accurate risk assessment of dietary AGEs in human diseases.In this study,we first established an isotope dilution UHPLCQq Q-MS/MS-based method for simultaneous quantification of 10 major AGEs in foods.The contents of these AGEs were detected in 334 foods covering all main groups consumed in Western and Chinese populations.Nε-Carboxymethyllysine,methylglyoxal-derived hydroimidazolone isomers,and glyoxal-derived hydroimidazolone-1 are predominant AGEs found in most foodstuffs.Total amounts of AGEs were high in processed nuts,bakery products,and certain types of cereals and meats(>150 mg/kg),while low in dairy products,vegetables,fruits,and beverages(<40 mg/kg).Assessment of estimated daily intake implied that the contribution of food groups to daily AGE intake varied a lot under different eating patterns,and selection of high-AGE foods leads to up to a 2.7-fold higher intake of AGEs through daily meals.The presented AGE database allows accurate assessment of dietary exposure to these glycotoxins to explore their physiological impacts on human health.

A dynamic database of solid-state electrolyte(DDSE)picturing all-solid-state batteries

All-solid-state batteries(ASSBs)are a class of safer and higher-energy-density materials compared to conventional devices,from which solid-state electrolytes(SSEs)are their essential components.To date,investigations to search for high ion-conducting solid-state electrolytes have attracted broad concern.However,obtaining SSEs with high ionic conductivity is challenging due to the complex structural information and the less-explored structure-performance relationship.To provide a solution to these challenges,developing a database containing typical SSEs from available experimental reports would be a new avenue to understand the structureperformance relationships and find out new design guidelines for reasonable SSEs.Herein,a dynamic experimental database containing>600 materials was developed in a wide range of temperatures(132.40–1261.60 K),including mono-and divalent cations(e.g.,Li^(+),Na^(+),K^(+),Ag^(+),Ca^(2+),Mg^(2+),and Zn^(2+))and various types of anions(e.g.,halide,hydride,sulfide,and oxide).Data-mining was conducted to explore the relationships among different variates(e.g.,transport ion,composition,activation energy,and conductivity).Overall,we expect that this database can provide essential guidelines for the design and development of high-performance SSEs in ASSB applications.This database is dynamically updated,which can be accessed via our open-source online system.

Impact of index admission cholecystectomy vs interval cholecystectomy on readmission rate in acute cholangitis: National Readmission Database survey

BACKGROUND Elective cholecystectomy(CCY)is recommended for patients with gallstone-related acute cholangitis(AC)following endoscopic decompression to prevent recurrent biliary events.However,the optimal timing and implications of CCY remain unclear.AIM To examine the impact of same-admission CCY compared to interval CCY on patients with gallstone-related AC using the National Readmission Database(NRD).METHODS We queried the NRD to identify all gallstone-related AC hospitalizations in adult patients with and without the same admission CCY between 2016 and 2020.Our primary outcome was all-cause 30-d readmission rates,and secondary outcomes included in-hospital mortality,length of stay(LOS),and hospitalization cost.RESULTS Among the 124964 gallstone-related AC hospitalizations,only 14.67%underwent the same admission CCY.The all-cause 30-d readmissions in the same admission CCY group were almost half that of the non-CCY group(5.56%vs 11.50%).Patients in the same admission CCY group had a longer mean LOS and higher hospitalization costs attrib-utable to surgery.Although the most common reason for readmission was sepsis in both groups,the second most common reason was AC in the interval CCY group.CONCLUSION Our study suggests that patients with gallstone-related AC who do not undergo the same admission CCY have twice the risk of readmission compared to those who undergo CCY during the same admission.These readmis-sions can potentially be prevented by performing same-admission CCY in appropriate patients,which may reduce subsequent hospitalization costs secondary to readmissions.

Scaling up the DBSCAN Algorithm for Clustering Large Spatial Databases Based on Sampling Technique

Clustering, in data mining, is a useful technique for discovering interesting data distributions and patterns in the underlying data, and has many application fields, such as statistical data analysis, pattern recognition, image processing, and etc. We combine sampling technique with DBSCAN algorithm to cluster large spatial databases, and two sampling based DBSCAN (SDBSCAN) algorithms are developed. One algorithm introduces sampling technique inside DBSCAN, and the other uses sampling procedure outside DBSCAN. Experimental results demonstrate that our algorithms are effective and efficient in clustering large scale spatial databases.

DATA MODEL AND VISUALIZATION OF 3D CITY LANDSCAPE BASED ON INTEGRATED DATABASES

Data acquisition and modeling are the two important, difficult and costful aspects in a Cybercity project. 2D-GIS is mature and can manage a lot of spatial data. Thus 3D-GIS should make the best of data and technology of 2D-GIS. Construction of a useful synthetic environment requires integration of multiple types of information like DEM, texture images and 3D representation of objects such as buildings. In this paper, the method for 3D city landscape data model and visualization based on integrated databases is presented. Since the data volume of raster are very huge, special strategies(for example, pyramid gridded method) must be adopted in order to manage raster data efficiently. Three different methods of data acquisition, the proper data structure and a simple modeling method are presented as well. At last, a pilot project of Shanghai Cybercity is illustrated.

Rules-based object-relational databases ontology construction

To solve the problems of shaving and reusing information in the information system, a rules-based ontology constructing approach from object-relational databases is proposed. A 3-tuple ontology constructing model is proposed first. Then, four types of ontology constructing rules including class, property, property characteristics, and property restrictions ave formalized according to the model. Experiment results described in Web ontology language prove that our proposed approach is feasible for applying in the semantic objects project of semantic computing laboratory in UC Irvine. Our approach reduces about twenty percent constructing time compared with the ontology construction from relational databases.

THE OPTIMAL TRUNCATED LOW-DIMENSIONAL DYNAMICAL SYSTEMS BASED ON FLOW DATABASES

A new theory on the construction of optimal truncated Low-Dimensional Dynamical Systems (LDDSs) with different physical meanings has been developed, The physical properties of the optimal bases are reflected in the user-defined optimal conditions, Through the analysis of linear and nonlinear examples, it is shown that the LDDSs constructed by using the Proper Orthogonal Decomposition (POD) method are not the optimum. After comparing the errors of LDDSs based on the new theory POD and Fourier methods, it is concluded that the LDDSs based on the new theory are optimally truncated and catch the desired physical properties of the systems.

Cache-Conscious Index Mechanism for Main-Memory Databases

Recent studies have addressed that the cache be havior is important in the design of main memory index structures. Cache-conscious indices such as the CSB^＋-tree are shown to outperform conventional main memory indices such as the AVL-tree and the T-tree. This paper proposes a cacheconscious version of the T-tree, CST-tree, defined according to the cache-conscious definition. To separate the keys within a node into two parts, the CST-tree can gain higher cache hit ratio.

Time series analysis of mantle cycles Part Ⅰ:Periodicities and correlations among seven global isotopic databases

In this study,seven isotopic databases are presented and analyzed to identify mantle and crustal episodes on a global scale by focusing on periodicity ranging from 70 to 200 million years(Myr).The databases are the largest,or among the largest,compiled for each type of data-with an objective of finding some samples from every region of every continent,to make each database as global as conceivably possible.The databases contain zircon Lu/Hf isotopic data,whole-rock Sm/Nd isotopic data,U/Pb detrital zircon ages,U/Pb igneous zircon ages,U/Pb non-zircon ages,whole-rock Re/Os isotopic data,and large igneous province ages.Part I of this study focuses on the periodicities of age histograms and geochemical averages developed from the seven databases,via spectral and cross-correlation analyses.Natural physical cycles often propagate in exact integer multiples of a fundamental cycle,referred to as harmonics.The tests show that harmonic geological cycles of^93.5 and^187 Myr have persisted throughout terrestrial history,and the cyclicities are statistically significant for U/Pb igneous zircon ages,U/Pb detrital zircon ages,U/Pb zircon-rim ages,large igneous province ages,meanεHf(t)for all samples,meanεHf(t)values for igneous-only samples,and relative abundance of mafic rocks.Equally important,cross-correlation analyses show these seven time-series are nearly synchronous(±7 Myr)with a model consisting of periodicities of 93.5 and 187 Myr.Additionally,the similarities between peaks in the 93.5 and 187 Myr mantle cycles and terminal ages of established and suspected superchrons provide a framework for predicting and testing superchron periodicity.

Routing Protocols for Transmitting Large Databases or Multi databases Systems

Most knowledgeable people agree that networking and routing technologies have been around about 25 years. Routing is simultaneously the most complicated function of a network and the most important. It is of the same kind that more than 70% of computer application fields are MIS applications. So the challenge in building and using a MIS in the network is developing the means to find, access, and communicate large databases or multi databases systems. Because general databases are not time continuous, in fact, they can not be streaming, so we can't obtain reliable and secure quality of service by deleting some unimportant datagrams in the databases transmission. In this article, we will discuss which kind of routing protocol is the best type for large databases or multi databases systems transmission in the networks.

A Weighted Algorithm for Watermarking Relational Databases

A weighted algorithm for watermarking relational databases for copyright protection is presented. The possibility of watermarking an attribute is assigned according to its weight decided by the owner of the database. A one-way hash function and a secret key known only to the owner of the data are used to select tuples and bits to mark. By assigning high weight to significant attributes, the scheme ensures that important attributes take more chance to be marked than less important ones. Experimental results show that the proposed scheme is robust against various forms of attacks, and has perfect immunity to subset attack.

Query Acceleration of Graph Databases by ID Caching Technology

In this paper, we approach the design of ID caching technology(IDCT) for graph databases, with the purpose of accelerating the queries on graph database data and avoiding redundant graph database query operations which will consume great computer resources. Traditional graph database caching technology(GDCT)needs a large memory to store data and has the problems of serious data consistency and low cache utilization. To address these issues, in the paper we propose a new technology which focuses on ID allocation mechanism and high-speed queries of ID on graph databases. Specifically, ID of the query result is cached in memory and data consistency is achieved through the real-time synchronization and cache memory adaptation. In addition, we set up complex queries and simple queries to satisfy all query requirements and design a mechanism of cache replacement based on query action time, query times, and memory capacity, thus improving the performance furthermore.Extensive experiments show the superiority of our techniques compared with the traditional query approach of graph databases.

Federated Spatial Databases and Interoperability

It is a period of information explosion. Especially for spatial information science, information can be acquired through many ways, such as man made planet, aeroplane, laser, digital photogrammetry and so on. Spatial data sources are usually distributed and heterogeneous. Federated database is the best resolution for the share and interoperation of spatial database. In this paper, the concepts of federated database and interoperability are introduced. Three heterogeneous kinds of spatial data, vector, image and DEM are used to create integrated database. A data model of federated spatial databases is given.

Knowledge Discovery from Communication Network Alarm Databases

The technique of Knowlege Discovery in Databases (KDD) to learn valuable knowledge hidden in network alarm databases is introduced. To get such knowledge, we propose an efficient method based on sliding windows (named as Slidwin) to discover different episode rules from time squential alarm data. The experimental results show that given different thresholds parameters, large amount of different rules could be discovered quickly.

Materials databases for the computational materials scientist

Until recently, many computational materials scientists have shown little interest in materials databases. This is now changing be-cause the amount of computational data is rapidly increasing and the potential for data mining provides unique opportunities for discovery and optimization. Here, a few examples of such opportunities are discussed relating to structural analysis and classification, discovery of correlations between materials properties, and discovery of unsuspected compounds.

A Storage Optimization Scheme for Blockchain Transaction Databases

As the typical peer-to-peer distributed networks, blockchain systemsrequire each node to copy a complete transaction database, so as to ensure newtransactions can by verified independently. In a blockchain system (e.g., bitcoinsystem), the node does not rely on any central organization, and every node keepsan entire copy of the transaction database. However, this feature determines thatthe size of blockchain transaction database is growing rapidly. Therefore, with thecontinuous system operations, the node memory also needs to be expanded tosupport the system running. Especially in the big data era, the increasing networktraffic will lead to faster transaction growth rate. This paper analyzes blockchaintransaction databases and proposes a storage optimization scheme. The proposedscheme divides blockchain transaction database into cold zone and hot zone usingexpiration recognition method based on Least Recently Used (LRU) algorithm. Itcan achieve storage optimization by moving unspent transaction outputs outsidethe in-memory transaction databases. We present the theoretical analysis on theoptimization method to validate the effectiveness. Extensive experiments showour proposed method outperforms the current mechanism for the blockchaintransaction databases.

Processing Constrained K Closest Pairs Query in Spatial Databases

In this paper, constrained K closest pairs query is introduced, wbich retrieves the K closest pairs satisfying the given spatial constraint from two datasets. For data sets indexed by R trees in spatial databases, three algorithms are presented for answering this kind of query. Among of them, two-phase Range＋Join and Join＋Range algorithms adopt the strategy that changes the execution order of range and closest pairs queries, and constrained heap-based algorithm utilizes extended distance functions to prune search space and minimize the pruning distance. Experimental results show that constrained heap-base algorithm has better applicability and performance than two-phase algorithms.