A spatial entropy reflecting distribution of spatial objects

Decision trees are mainly used to classify data and predict data classes. A spatial decision tree has been designed using Euclidean distance between objects for reflecting spatial data characteristic. Even though this method explains the distance of objects in spatial dimension, it fails to represent distributions of spatial data and their relationships. But distributions of spatial data and relationships with their neighborhoods are very important in real world. This paper proposes decision tree based on spatial entropy that represents distributions of spatial data with dispersion and dissimilarity. The rate of dispersion by dissimilarity presents how related distribution of spatial data and non-spatial attributes. The experiment evaluates the accuracy and building time of decision tree as compared to previous methods and it shows that the proposed method makes efficient and scalable classification for spatial decision support.     

Design and implementation of highway distress and preventive measures decision support system based on WebGIS 

A highway distress and preventive measures decision support system based on WebGIS and J2EE architecture were studied, and the key issues for the system are presented. Such issues as spatial data and attribute data organization, technology of enhancing user experience, database connection pool were investigated. The feasibility of the theories and methods were tested through the system.     

Five amino acids in three HLA proteins explain most of the association between MHC and seropositive rheumatoid arthritis

The genetic association of the major histocompatibility complex (MHC) to rheumatoid arthritis risk has commonly been attributed to alleles in HLA-DRB1. However, debate persists about the identity of the causal variants in HLA-DRB1 and the presence of independent effects elsewhere in the MHC. Using existing genome-wide SNP data in 5,018 individuals with seropositive rheumatoid arthritis (cases) and 14,974 unaffected controls, we imputed and tested classical alleles and amino acid polymorphisms in HLA-A, HLA-B, HLA-C, HLA-DPA1, HLA-DPB1, HLA-DQA1, HLA-DQB1 and HLA-DRB1, as well as 3,117 SNPs across the MHC. Conditional and haplotype analyses identified that three amino acid positions (11, 71 and 74) in HLA-DRβ1 and single-amino-acid polymorphisms in HLA-B (at position 9) and HLA-DPβ1 (at position 9), which are all located in peptide-binding grooves, almost completely explain the MHC association to rheumatoid arthritis risk. This study shows how imputation of functional variation from large reference panels can help fine map association signals in the MHC.     

Histamine activates HinK to promote the virulence of Pseudomonas aeruginosa

During infections,bacteria stimulate host cells to produce and release histamine,which is a key mediator of vital cellular processes in animals.However,the mech...     

Genus Promalactis Meyrick (Lepidoptera: Oecophoridae) from Cambodia,Part II: five new species,checklist and taxonomic key for the species in Cambodia

This study is the second report on the genus Promalactis, which includes five new species, P. ceratiscus sp. nov., P. flavidius sp. nov., P. latifasciata sp. nov., P. mecodigita sp. nov. and P. petasumella sp. nov., from western and southern Cambodia. Also provided is a taxonomic key to all species of Cambodian Promalactis.

http://www.zoobank.org/urn:lsid:zoobank.org:pub:72474144-5D65-48BE-9021-0490952AAA3C     

A graph-based sliding window multi-join over data stream

Join operation is a critical problem when dealing with sliding window over data streams. There have been many optimization strategies for sliding window join in the literature, but a simple heuristic is always used for selecting the join sequence of many sliding windows, which is ineffectively. The graph-based approach is proposed to process the problem. The sliding window join model is introduced primarily. In this model vertex represent join operator and edge indicated the join relationship among sliding windows. Vertex weight and edge weight represent the cost of join and the reciprocity of join operators respectively. Then good query plan with minimal cost can be found in the model. Thus a complete join algorithm combining setting up model, finding optimal query plan and executing query plan is shown. Experiments show that the graph-based approach is feasible and can work better in above environment.     

Association of a functional variant downstream of TNFAIP3 with systemic lupus erythematosus

Systemic lupus erythematosus (SLE, MIM152700) is an autoimmune disease characterized by self-reactive antibodies resulting in systemic inflammation and organ failure. TNFAIP3, encoding the ubiquitin-modifying enzyme A20, is an established susceptibility locus for SLE. By fine mapping and genomic re-sequencing in ethnically diverse populations, we fully characterized the TNFAIP3 risk haplotype and identified a TT>A polymorphic dinucleotide (deletion T followed by a T to A transversion) associated with SLE in subjects of European (P = 1.58 × 10(-8), odds ratio = 1.70) and Korean (P = 8.33 × 10(-10), odds ratio = 2.54) ancestry. This variant, located in a region of high conservation and regulatory potential, bound a nuclear protein complex composed of NF-κB subunits with reduced avidity. Further, compared with the non-risk haplotype, the haplotype carrying this variant resulted in reduced TNFAIP3 mRNA and A20 protein expression. These results establish this TT>A variant as the most likely functional polymorphism responsible for the association between TNFAIP3 and SLE.     

Services oriented architecture of foundation data platform of digital city

Digital city, a large complex system, is comprised many subsystem of different fields. It involves common field data, flexible field processes, seamless intra-organization and inter-organization collaborations, and increasing connectivity and interoperability between distributed or decentralized systems. All above these are involved Foundation Data of Digital city. To promote the sustainable development of Digital City, this paper investigates to the construction of Foundation Data Platform {FDP） from the view of the architecture. The paper introduces the concep- tions, characteristics and underlying problems of the FDP, and discusses the key issues of the architecture paradigms what FDP might adopted via comparing Object-Oriented Architecture {OOA）, Component-Based Architecture （CBA） , and Service-based Architecture （SBA）. The Process Embedded Service-Oriented Architecture （SOA）, one of the recent SOA Application Architecture is introduced. The results indicate that the Process Embedded SOA could promote the sustainable development of Digital City and accommodate the dynamic development environments of different fields which constantly changes requirements.     

Operator scheduling strategy for LBS based intelligent transportation system

With the development of location technologies, advanced LBSbased ITS increasingly requires the capability of database technologies to manage the continuously arrived vehicles' location, traffic jam and other interrelated information of large amounts of traffic in the following years. And some burst arrival stream data will challenge the realtime performance and the allocation of limited resource. However, choosing a desirable database operator scheduling strategy can significantly improve the performance of the system. The path capability strategy was chosen and improved as ITS' operator scheduling strategy to meet the realtime response and the minimal memory requirement of the system.      

A spatial entropy reflecting distribution of spatial objects

Decision trees are mainly used to classify data and predict data classes. A spatial decision tree has been designed using Euclidean distance between objects for reflecting spatial data characteristic. Even though this method explains the distance of objects in spatial dimension, it fails to represent distributions of spatial data and their relationships. But distributions of spatial data and relationships with their neighborhoods are very important in real world. This paper proposes decision tree based on spatial entropy that represents distributions of spatial data with dispersion and dissimilarity. The rate of dispersion by dissimilarity presents how related distribution of spatial data and nonspatial attributes. The experiment evaluates the accuracy and building time of decision tree as compared to previous methods and it shows that the proposed method makes efficient and scalable classification for spatial decision support.