QQ客服 官方微博 反馈留言

	New models and efficient algorithms for hazard detection
	Ju wenqi; Fan chenglin; Liu shuguang; Liu jinfei
	2012
会议名称	2012 20th International Conference on Geoinformatics, Geoinformatics 2012
会议地点	Hong Kong
英文摘要	Many environmental factors such as deficiency of some elements (certain vitamins), radioactive contamination accidents, infectious disease epidemics and so on can make people sick. Finding out the possible positions of environmental hazards is very important because it can help researchers to identify the causes of environmental hazards and furthermore to remove them. However, it is not an easy task without the help of computers because the amount of information people must handle and analyze is massive in modern society. In order to help to find out hazards by computers, many models and algorithms are designed. For example, analysis of clusters of diseases is an important method. However, current cluster analysis methods ignore mobility of people, which is an important feature of modern society. Therefore, the methods cannot pinpoint the exact areas responsible for the development of a disease and how much possibilities hazards appear in the areas. In this paper, we propose novel models and algorithms based on the patients' residential history, mobility of locations of people and disease principles. Ourmodels and algorithms differ from previous ones in the following ways. First, we consider more complex situations such as multiple hazards and outliers and so on. Second, our algorithms not only output the possible areas responsible for diseases but also output the how much possibilities hazards appear in the areas. © 2012 IEEE.(15 refs)
收录类别	EI
语种	英语
内容类型	会议论文
源URL	[http://ir.siat.ac.cn:8080/handle/172644/4216]
专题	深圳先进技术研究院_数字所
作者单位	2012
推荐引用方式 GB/T 7714	Ju wenqi,Fan chenglin,Liu shuguang,et al. New models and efficient algorithms for hazard detection[C]. 见:2012 20th International Conference on Geoinformatics, Geoinformatics 2012. Hong Kong.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。