Adaptive XML to relational mapping: an integrated approach

Storing and querying XML (eXtensible Markup Language) data in relational form can exploit various services offered by modern relational database management systems (RDBMSs). Due to structural complexity of XML, there are many equivalent relational mapping schemes for the same XML data and queries. In this paper, we propose the adaptive XML to relational mapping (AX2RM) system, which considers finding optimal XML to relational (X2R) mapping as four separate but correlated procedures: logical database design, data scale estimation, workload transformation, and physical database design. We view the whole process as an autonomic computing problem and formalize the adaptive X2R mapping problem. Search spaces for each procedure are investigated individually, and five approaches for finding the optimal mapping are studied. We propose an integrated approach with greedy pruning (IT-GP), which views the mapping procedures as a whole and exploits heuristic rules in each procedure to prune impossible mappings as early as possible. Evaluation of these approaches shows the validity and high efficiency of IT-GP.

Research on the Mapping Technology of CIM and Relational Database in Power Grid

With the development of electric power industry,the requirement of information sharing and application integration between each application system is salience.To realize the real "sharing information,data maintenance uniform",and effectively eliminate "island of information",a standard,open information model of power system should be followed urgently by different systems,and a common data interface should be provided.The Common Information Model(CIM) proposed by standard of IEC-61970 solve the problem effectively.The characteristics of the CIM Model and relational database of power system are analyzed,a mapping method between CIM model based on standard of IEC61970 and relational database is proposed,and corresponding problems between object-oriented model and the relational model are solved flexiblely.

An Approach for Automatically Generating R2RML-Based Direct Mapping from Relational Databases

For integrating relational databases (RDBs) into semantic web applications, the W3C RDB2RDF Working Group recommended two approaches, Direct Mapping (DM) and R2RML. The DM provides a set of mapping rules according to RDB schema, while the R2RML allows users to manually define mappings according to existing target ontology. The major problem to use R2RML is the effort for creating R2RML mapping documents manually. This may lead to appearance of many mistakes in the R2RML documents and requires domain experts. In this paper, we propose and implement an approach to generate an R2RML mapping documents automatically from RDB schema. The R2RML mapping reflects the behavior of the DM specification and allows any R2RML parser to generate a set of RDF triples from relational data.The input of generating approach is DBsInfo class that automatically generated from relational schema. An experimental prototype is developed and shows the effectiveness of our approach algorithms.

Iterative convergence theorems for maximal monotone operators and relatively nonexpansive mappings

In this paper, some iterative schemes for approximating the common element of the set of zero points of maximal monotone operators and the set of fixed points of relatively nonexpansive mappings in a real uniformly smooth and uniformly convex Banach space are proposed. Some strong convergence theorems are obtained, to extend the previous work.

Evaluation and mapping of relative sensitivity of the terrestrial ecosystems to acidic deposition in Fujian

Based on the semi-quantitative approach, four environmental factors of sites (i.e. bedrock lithology, soil type, land use, and rainfall) were categorized, weighted and combined to determine and assess the relative sensitivity of the terrestrial ecosystems to acidic deposition in Fujian Province. Then the factors have been digitized and combined to assign an overall value for each mesh square (16.77 km×18.39 km) by using the geographic information system (GIS) The results indicated that the most sensitive area in Fujian was mainly located in the southeast, and the least: ensitive area was distributed sporadically in the east along the coast. Due to slow weathering rate of siliceous rocks, acid to weakly acid reactions of the soils, along with the greater percent of coniferous forests, more than 80 percent of the total area exhibits higher sensitivity classes (4–7).

Ontology mapping approach based on set & relation theory and OCL

An ontology mapping approach based on set & relation theory and OCL is introduced,then an ontology mapping meta-model is established which is composed of ontology related elements,mapping related elements and definition rule related elements.This ontology mapping meta-model can be regarded as a unified mechanism to realize different kinds of ontology mappings.The powerful computation capability of set and relation theory and the flexible expressive capability of OCL can be used in the computation of ontology mapping meta-model to realize the unified mapping among different ontology models.Based on the mapping meta-model,a general mapping management framework is developed to provide a common mapping storage mechanism,some mapping APIs and mapping rule APIs.

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 MAPPING RELATION AMONG SOLUTION OF SOME NONLINEAR EQUATIONS

Among the solutions of three kinds of nonlinear equations in one dimensional systems, cubic nonlinear Klein-Gordon (including Φ~4), Sine-Gordon and double Sine-Gordon, some mapping relations exist. When a solution of any one equation is known, so are the other two.

Major Gene Identification and Quantitative Trait Locus Mapping for YieldRelated Traits in Upland Cotton(Gossypium hirsutum L.)

Segregation analysis of the mixed genetic model of major gene plus polygene was used to identify the major genes for cotton yield-related traits using six generations P1, P2, F1, B1, B2, and F2 generated from the cross of Baimian 1 x TM-1. In addition to boll size and seed index, the major genes for the other five traits were detected： one each for seed yield, lint percentage, boll number, lint index; and two for lint yield. Quantitative trait locus/loci （QTL） mapping was performed in the F2 and F2：3 populations of above cross through molecular marker technology, and a total of 50 QTL （26 suggestive and 24 significant） for yield-related traits were detected. Four common QTL were discovered： qLP-3b（F2）/qLP-3（F2：3） and qLP-19b （F2）/qLP-19（F2：3） for lint percentage, qBN-17（F2）/qBN-17（F2：3） for boll number, and qBS-26b（F2）/qBS-26（F2：3） for boll size. Especially, qLP- 3b（Fz）/qLP-3（F2：3）, not only had LOD scores 〉3 but also exceeded the permutation threshold （5.13 and 5.29, respectively）, correspondingly explaining 23.47 and 29.55% of phenotypic variation. This QTL should be considered preferentially in marker assisted selection （MAS）. Segregation analysis and QTL mapping could mutually complement and verify, which provides a theoretical basis for genetic improvement of cotton yield-related traits by using major genes （QTL）.

Aircraft Landing Gear Control with Multi-Objective Optimization Using Generalized Cell Mapping

This paper presents a numerical algorithm tuning aircraft landing gear control system with three objectives,including reducing relative vibration, reducing hydraulic strut force and controlling energy consumption. Sliding mode control is applied to the vibration control of a simplified landing gear model with uncertainty. A two-stage generalized cell mapping algorithm is applied to search the Pareto set with gradient-free scheme. Drop test simulations over uneven runway show that the vibration and force interaction can be considerably reduced, and the Pareto optimum form a tight range in time domain.

Multi-objective Optimal Design of Vibration Absorber with Simple Cell Mapping Algorithm

In this paper, we investigate a multi-objective optimal design of a tuned vibration absorber for a two degrees-of-freedom linear system, in which we take white Gaussian noise as the excitation. We use the simple cell mapping method to obtain solutions to the multi-objective optimization problem. We optimize tuned vibration absorbers in two different configurations. As our objective, we take various features of the response of the power spectrum density function. Our results show that the primary mass vibration with the optimally designed absorber has a lower peak power spectrum value. In addition, the two natural frequencies of the optimized system are further apart than in the non-optimized system, which implies that the absorber has a wider effective region in the frequency domain. © 2017, Tianjin University and Springer-Verlag GmbH Germany.

Experimental Evaluation of Objective Functions for Well-balanced Mapping

High performance of parallel computing on a message-passing multicomputer System relies on the balance of the workloads located on the processing elements of the System and the minimum communication ovcrheads among them. Mapping is the technology to partition the problem domain wellbalanced into multiple distinct execution tasks based on some measures. In mapping, a good objective function is the criterion to guarantce the distinct execution tasks equitable. In this paper, we evaluate five categories of those existed objective functions with three different problem subjects using experiments and find an objective function is much suitable for all kinds of problems.

PORLES:A Parallel Object Relational Database System

We developed a parallel object relational DBMS named PORLES. It uses BSP model as its parallel computing model, and monoid calculus as its basis of data model. In this paper, we introduce its data model, parallel query optimization, transaction processing system and parallel access method in detail.

A General Method for QTL Mapping in Multiple Related Populations Derived from Multiple Parents

It＇s well known that incorporating some existing populations derived from multiple parents may improve QTL mapping and QTL-based breeding programs. However, no general maximum likelihood method has been available for this strategy. Based on the QTL mapping in multiple related populations derived from two parents, a maximum likelihood estimation method was proposed, which can incorporate several populations derived from three or more parents and also can be used to handle different mating designs. Taking a circle design as an example, we conducted simulation studies to study the effect of QTL heritability and sample size upon the proposed method. The results showed that under the same heritability, enhanced power of QTL detection and more precise and accurate estimation of parameters could be obtained when three F2 populations were jointly analyzed, compared with the joint analysis of any two F2 populations. Higher heritability, especially with larger sample sizes, would increase the ability of QTL detection and improve the estimation of parameters. Potential advantages of the method are as follows： firstly, the existing results of QTL mapping in single population can be compared and integrated with each other with the proposed method, therefore the ability of QTL detection and precision of QTL mapping can be improved. Secondly, owing to multiple alleles in multiple parents, the method can exploit gene resource more adequately, which will lay an important genetic groundwork for plant improvement.

Strong convergence theorem for relatively nonexpansive mapping and inverse-strongly-monotone mapping in a Banach space

In this paper, we introduce an iterative sequence for finding a common element of the set of fixed points of a relatively nonexpansive mapping and the set of solutions of the variational inequality for an inverse-strongly-monotone mapping in a Banach space. Then, we show that the sequence converges strongly to a common element of the two sets. Our results improve and extend the corresponding results reported by many others.

Design of Lattice Structures Using Local Relative Density Mapping Method

In order to solve the problem of substantial computational resources of lattice structure during optimization, a local relative density mapping(LRDM) method is proposed. The proposed method uses solid isotropic microstructures with penalization to optimize a model at the macroscopic scale. The local relative density information is obtained from the topology optimization result. The contour lines of an optimized model are extracted using a density contour approach, and the triangular mesh is generated using a mesh generator. A local mapping relationship between the elements’ relative density and the struts’ relative cross?sectional area is established to automatically determine the diameter of each individual strut in the lattice structures. The proposed LRDM method can be applied to local finite element meshes and local density elements, but it is also suitable for global ones. In addition, some cases are con?sidered in order to test the e ectiveness of the LRDM method. The results show that the solution time of the LRDM is lower than the RDM method by approximately 50%. The proposed method provides instructions for the design of more complex lattice structures.

CONVERGENCE ANALYSIS FOR SYSTEM OF EQUILIBRIUM PROBLEMS AND LEFT BREGMAN STRONGLY RELATIVELY NONEXPANSIVE MAPPING

In this paper, we prove strong convergence theorems for approximation of a fixed point of a left Bregman strongly relatively nonexpansive mapping which is also a solution to a finite system of equilibrium problems in the framework of reflexive real Banach spaces. We also discuss the approximation of a common fixed point of a family of left Bregman strongly nonexpansive mappings which is also solution to a finite system of equilibrium problems in reflexive real Banach spaces. Our results complement many known recent results in the literature.

QoS-oriented service composition based on mapping relation tree

Service composition is a hot and active research area in service-oriented computing which has gained great momentum. An quality of service (QoS) oriented and tree-based approach was proposed to implement service composition efficiently. Firstly, service descriptions were transformed to mapping relations which denote the association between input and output concepts. Then, the service composition problems were resolved by building mapping relation tree dynamically based on the divide and conquer method, and all mapping relation trees were combined without redundant branch to obtain the composition scheme. Finally, the optimal composition scheme was chosen based on quality of service attributes including the preference of service request. Experiment results illustrate that this method can improve the composition efficiency and reduce the searching time by increasing the number of services in repository.

New iterative schemes for strongly relatively nonexpansive mappings and maximal monotone operators

In this paper, some new iterative schemes for approximating the common element of the set of fixed points of strongly relatively nonexpansive mappings and the set of zero points of maximal monotone operators in a real uniformly smooth and uniformly convex Banach space are proposed. Some weak convergence theorems are obtained, which extend and complement some previous work.

Salient Object Detection Based on a Novel Combination Framework Using the Perceptual Matching and Subjective-Objective Mapping Technologies

The integrity and fineness characterization of non-connected regions and contours is a major challenge for existing salient object detection.The key to address is how to make full use of the subjective and objective structural information obtained in different steps.Therefore,by simulating the human visual mechanism,this paper proposes a novel multi-decoder matching correction network and subjective structural loss.Specifically,the loss pays different attentions to the foreground,boundary,and background of ground truth map in a top-down structure.And the perceived saliency is mapped to the corresponding objective structure of the prediction map,which is extracted in a bottom-up manner.Thus,multi-level salient features can be effectively detected with the loss as constraint.And then,through the mapping of improved binary cross entropy loss,the differences between salient regions and objects are checked to pay attention to the error prone region to achieve excellent error sensitivity.Finally,through tracking the identifying feature horizontally and vertically,the subjective and objective interaction is maximized.Extensive experiments on five benchmark datasets demonstrate that compared with 12 state-of-the-art methods,the algorithm has higher recall and precision,less error and strong robustness and generalization ability,and can predict complete and refined saliency maps.