The Experts below are selected from a list of 133569 Experts worldwide ranked by ideXlab platform
Haibin Sun - One of the best experts on this subject based on the ideXlab platform.
-
Efficient algorithms for spatial Configuration Information retrieval
Knowledge-Based Systems, 2009Co-Authors: Haibin SunAbstract:The problem of spatial Configuration Information retrieval is a constraint satisfaction problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data can be reorganized using index techniques like R-tree and the spatial data are approximated by their minimum bounding rectangles (MBRs), so the spatial Configuration Information retrieval is actually based on the MBRs and some special techniques can be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Three algorithms are designed and studied, and their performances are compared.
-
SNPD (1) - Research on Technologies of Spatial Configuration Information Retrieval
Eighth ACIS International Conference on Software Engineering Artificial Intelligence Networking and Parallel Distributed Computing (SNPD 2007), 2007Co-Authors: Haibin Sun, Xin ChenAbstract:The problem of spatial Configuration Information retrieval is a constraint satisfaction problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data are generally reorganized using index techniques like R-tree to improve the efficiency of query answering in spatial Information systems, especially geographic Information system (GIS), and the spatial data are approximated by their minimum bounding rectangles (MBRs), so the spatial Configuration Information retrieval is actually based on the MBRs and some special techniques should be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Based on these study results, three search algorithms are designed and presented.
-
International Conference on Computational Science (2) - Research on Technologies of Spatial Configuration Information Retrieval
Computational Science – ICCS 2007, 2007Co-Authors: Haibin SunAbstract:The problem of spatial Configuration Information retrieval is a Constraint Satisfaction Problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data can be reorganized using index techniques like R-tree and the spatial data are approximated by their Minimum Bounding Rectangles (MBRs), so the spatial Configuration Information retrieval is actually based on the MBRs and some special techniques can be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree.
-
BIS - Efficient algorithms for spatial Configuration Information retrieval
Business Information Systems, 1Co-Authors: Haibin Sun, Xin ChenAbstract:The problem of spatial Configuration Information retrieval is a Constraint Satisfaction Problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data can be reorganized using index techniques like R-tree and the spatial data are approximated by their Minimum Bounding Rectangles (MBRs), so the spatial Configuration Information retrieval is actually based on the MBRs and some special techniques can be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Three algorithms are designed and studied, and their performances are compared.
He Guo-hui - One of the best experts on this subject based on the ideXlab platform.
-
Method for DTD Description of Software Configuration Information and Relation Model Mapping
Computer Engineering, 2007Co-Authors: He Guo-huiAbstract:XML has advantages of expansibility,convenience and self-descriptions,whereas DTD can set up rules for element attribute,element topology structure of XML document.Combined with the predominance of XML and DTD,a method for describing software Configuration management Information is presented.Meanwhile,the realization of relation storage approach is discussed by way of DTD.Thus the purpose of effective management software Configuration Information can be attained.
Dennis Heimbigner - One of the best experts on this subject based on the ideXlab platform.
-
SCM - Applications of Configuration Information to security
Lecture Notes in Computer Science, 2003Co-Authors: Dennis HeimbignerAbstract:Securing software systems against malicious attack, corruption, and subversion has been an ongoing research problem. Novel applications of software Configuration technology may provide solutions to these problems. Three interesting problems and potentials solutions are presented. The problems are intrusion tolerance, misuse protection, and cyber-forensics. The first two can be addressed using dynamic reConfiguration to modify the behavior of a software system. The last problem can be addressed using Configuration Information as a comprehensive framework on which to hang a variety of other Information necessary for forensic analysis.
Priti Shah - One of the best experts on this subject based on the ideXlab platform.
-
Effects of spatial Configurations on visual change detection: an account of bias changes.
Memory & cognition, 2009Co-Authors: Aysecan Boduroglu, Priti ShahAbstract:In order to determine whether people encode spatial Configuration Information when encoding visual displays, in four experiments, we investigated whether changes in task-irrelevant spatial Configuration Information would influence color change detection accuracy. In a change detection task, when objects in the test display were presented in new random locations, rather than identical or different locations preserving the overall Configuration, participants were more likely to report that the colors had changed. This consistent bias across four experiments suggested that people encode task-irrelevant spatial Configuration along with object Information. Experiment 4 also demonstrated that only a low-false-alarm group of participants effectively bound spatial Configuration Information to object Information, suggesting that these types of binding processes are open to strategic influences.
Xin Chen - One of the best experts on this subject based on the ideXlab platform.
-
SNPD (1) - Research on Technologies of Spatial Configuration Information Retrieval
Eighth ACIS International Conference on Software Engineering Artificial Intelligence Networking and Parallel Distributed Computing (SNPD 2007), 2007Co-Authors: Haibin Sun, Xin ChenAbstract:The problem of spatial Configuration Information retrieval is a constraint satisfaction problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data are generally reorganized using index techniques like R-tree to improve the efficiency of query answering in spatial Information systems, especially geographic Information system (GIS), and the spatial data are approximated by their minimum bounding rectangles (MBRs), so the spatial Configuration Information retrieval is actually based on the MBRs and some special techniques should be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Based on these study results, three search algorithms are designed and presented.
-
BIS - Efficient algorithms for spatial Configuration Information retrieval
Business Information Systems, 1Co-Authors: Haibin Sun, Xin ChenAbstract:The problem of spatial Configuration Information retrieval is a Constraint Satisfaction Problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data can be reorganized using index techniques like R-tree and the spatial data are approximated by their Minimum Bounding Rectangles (MBRs), so the spatial Configuration Information retrieval is actually based on the MBRs and some special techniques can be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Three algorithms are designed and studied, and their performances are compared.