摘要 :
A challenging issue in web is the integration of XML data sources. In this paper we ad-dress this issue when the XML data sources conform to schemas. This is a challengingproblem because the XML documents may have significant stru...
展开
A challenging issue in web is the integration of XML data sources. In this paper we ad-dress this issue when the XML data sources conform to schemas. This is a challengingproblem because the XML documents may have significant structural differences even ifthey represent data from the same knowledge domain. We deal with it by (a) adding se-mantic information to the document schemas that allows the grouping of schema elementsinto the so called schema dimensions, and (b)using a query language that allows a partialspecification of tree patterns. We show how the schema dimensions can form a dimensiongraph for all the data sources that acts as a global schema. Users posing their queries on thisglobal schema have the flexibility of specifing structural constraints fully, partially or notat all. Our approach allows querying data sources with different schemas in an integratedway. We show how these queries can be translated into sets of branching paths expressionsto be evaluated on the XML documents of the data sources. Our approach can be easilyimplemented on top of an XQuery engine.
收起
摘要 :
XML has become a standard for data representation and exchange on the Internet. Thefunctional dependency is the most important part of the research on XML databasenormalization and there is already some research work on this topic...
展开
XML has become a standard for data representation and exchange on the Internet. Thefunctional dependency is the most important part of the research on XML databasenormalization and there is already some research work on this topic. According to thetypes of existing complicated functional dependency constraint, the features of the dataconstraint are analyzed. A definition of XML functional dependency (XDF) is proposedwhich is based on a DTD path language. Compared with formal definitions alreadyproposed, XFD proposed in this paper can express more XML dependencies, whichmakes it more suitable for further research work.
收起
摘要 :
Material Recognition is an intriguing problem in Computer Vision. While traditional approaches prefer an ensemble of networks to capture essential properties such as texture, more recent approaches leverage the power of Deep Learn...
展开
Material Recognition is an intriguing problem in Computer Vision. While traditional approaches prefer an ensemble of networks to capture essential properties such as texture, more recent approaches leverage the power of Deep Learning to design end-to-end models. We do the same, and propose Dilated Iterative Contextual Encoding Network, a novel end-to-end framework for material recognition. As a result of gathering extensive knowledge on various characteristics of materials, our approach combines different components on the base network to address specific properties, which also helps in general recognition tasks. The traditional ResNet is replaced by a Dilated Residual Network to help capture fine-grained material information. Iterative deep aggregation helps capture and fuse global homogeneous material properties across multiple resolutions and scales. To enhance the discriminatory power of the learnt latent representation, we propose gramedial loss which is intuitively applied on a texture vector space. Spatial similarity loss is applied on strategic intermediate feature maps to effectively capture local non-homogeneous texture features from a global context, crucial for the primary classification task. Extensive experiments conducted on golden material datasets such as the FMD, MINC-2500, KTH-TIPS-2b, DTD and GTOS indicate improved performances over state of the art approaches on large datasets and two small datasets, while achieving compatible accuracies on the challenging FMD. Furthermore, our architecture also performed convincingly while categorizing general indoor and object classification datasets such as MIT-Indoor and CalTech-101.
收起
摘要 :
Because of big SVG document storing spatial data in WebGis, the searching by attribute is low efficiency and need the high quality hardware in the client. In order to solve the two problems, by making use of the rules mapping DTD ...
展开
Because of big SVG document storing spatial data in WebGis, the searching by attribute is low efficiency and need the high quality hardware in the client. In order to solve the two problems, by making use of the rules mapping DTD of SVG document to relation schema extended for being fitted for SVG document, we complete storing SVG document in Object-relational database. Finally, we realized management of the spatial data by tag document to by Objected Relational database and achieved the expected results.
收起
摘要 :
Because of big SVG document storing spatial data in WebGis, The searching by attribute is low efficiency and need the high quality hardware in the client. In order to solve the two problems, by making use of the rules mapping DTD ...
展开
Because of big SVG document storing spatial data in WebGis, The searching by attribute is low efficiency and need the high quality hardware in the client. In order to solve the two problems, by making use of the rules mapping DTD of SVG document to relation schema extended for being fitted for SVG document, we complete storing SVG document in Object-relational database. Finally, we realized management of the spatial data by tag document to by Objected Relational database and achieved the expected results.
收起
摘要 :
In this paper we present a Structured Information Retrieval (SIR) model based on graph matching. Our approach combines content propagation, which handles sibling relationships, with a document-query structure matching process. The...
展开
In this paper we present a Structured Information Retrieval (SIR) model based on graph matching. Our approach combines content propagation, which handles sibling relationships, with a document-query structure matching process. The latter is based on Tree-Edit Distance (TED) which is the minimum set of insert, delete, and replace operations to turn one tree to another. To our knowledge this algorithm has never been used in ad-hoc SIR. As the effectiveness of TED relies both on the input tree and the edit costs, we first present a focused subtree extraction technique which selects the most representative elements of the document w.r.t the query. We then describe our TED costs setting based on the Document Type Definition (DTD). Finally we discuss our results according to the type of the collection (data-oriented or textoriented). Experiments are conducted on two INEX test sets: the 2010 Datacentric collection and the 2005 Ad-hoc one.
收起
摘要 :
For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that the answer of q on t is nonempty. Evaluating an unsatisfiable XPath expression is meaningles...
展开
For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that the answer of q on t is nonempty. Evaluating an unsatisfiable XPath expression is meaningless, since such an expression can always be replaced by an empty set without evaluating it. However, it is shown that the XPath satisfiability problem is intractable for a large number of XPath fragments. In this paper, we consider simple XPath fragments under two restrictions; (i) only a label can be specified as a node test and (ii) operators such as qualifier ([]) and union (∪) are not allowed. We first show that, for some small XPath fragments under the above restrictions, the satisfiability problem is still NP-complete. Then we show that there exist XPath fragments, containing the above small fragments, for which the satisfiability problem is in PTIME under duplicate-free DTDs.
收起
摘要 :
For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that the answer of q on t is nonempty. Evaluating an unsatisfiable XPath expression is meaningles...
展开
For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that the answer of q on t is nonempty. Evaluating an unsatisfiable XPath expression is meaningless, since such an expression can always be replaced by an empty set without evaluating it. However, it is shown that the XPath satisfiability problem is intractable for a large number of XPath fragments. In this paper, we consider simple XPath fragments under two restrictions; (i) only a label can be specified as a node test and (ii) operators such as qualifier ([]) and union (∪) are not allowed. We first show that, for some small XPath fragments under the above restrictions, the satisfiability problem is still NP-complete. Then we show that there exist XPath fragments, containing the above small fragments, for which the satisfiability problem is in PTIME under duplicate-free DTDs.
收起
摘要 :
To access XML documents of a domain, we constructed a special DTD which is universally applicable to the XML documents when they contain information of a same domain even when they have different structures and attributes. Then, f...
展开
To access XML documents of a domain, we constructed a special DTD which is universally applicable to the XML documents when they contain information of a same domain even when they have different structures and attributes. Then, for the selected documents, we tried to access XML documents through the semantic queries expanded by conceptual structuring and association. We tested the effectiveness and efficiency of the proposed method on sample XML documents.
收起
摘要 :
To access XML documents of a domain, we constructed a special DTD which is universally applicable to the XML documents when they contain information of a same domain even when they have different structures and attributes. Then, f...
展开
To access XML documents of a domain, we constructed a special DTD which is universally applicable to the XML documents when they contain information of a same domain even when they have different structures and attributes. Then, for the selected documents, we tried to access XML documents through the semantic queries expanded by conceptual structuring and association. We tested the effectiveness and efficiency of the proposed method on sample XML documents.
收起
原文获取