WebGIS是GIS的一个重要的发展方向.本文主要研究基于ArcGIS Server Java ADF和JSF框架的Web-GIS产品开发的关键性技术。文章首先介绍了JSF和ArcGIS Server Java ADF的基本知识,然后对ArcGIS Server Ja-va ADF基本开发技术进行了深入分析...WebGIS是GIS的一个重要的发展方向.本文主要研究基于ArcGIS Server Java ADF和JSF框架的Web-GIS产品开发的关键性技术。文章首先介绍了JSF和ArcGIS Server Java ADF的基本知识,然后对ArcGIS Server Ja-va ADF基本开发技术进行了深入分析,最后以村镇民俗旅游资源空间化分析系统为例,总结了开发此类程序的基本框架。展开更多
提高数据挖掘的效率是目前信息技术研究的热点问题之一。介绍了数据挖掘的概念、过程模型以及体系结构,讨论了基于Microsoft SQL Server 2005的数据挖掘方案和采用SQL Server分析服务实现数据挖掘的相关技术。采用SQLServer分析服务的...提高数据挖掘的效率是目前信息技术研究的热点问题之一。介绍了数据挖掘的概念、过程模型以及体系结构,讨论了基于Microsoft SQL Server 2005的数据挖掘方案和采用SQL Server分析服务实现数据挖掘的相关技术。采用SQLServer分析服务的数据挖掘,实现了数据挖掘、数据仓库与应用程序的紧密耦合,从而大大提高了数据挖掘的效率。展开更多
We study a novel replication mechanism to ensure service continuity against multiple simultaneous server failures.In this mechanism,each item represents a computing task and is replicated intoξ+1 servers for some int...We study a novel replication mechanism to ensure service continuity against multiple simultaneous server failures.In this mechanism,each item represents a computing task and is replicated intoξ+1 servers for some integerξ≥1,with workloads specified by the amount of required resources.If one or more servers fail,the affected workloads can be redirected to other servers that host replicas associated with the same item,such that the service is not interrupted by the failure of up toξservers.This requires that any feasible assignment algorithm must reserve some capacity in each server to accommodate the workload redirected from potential failed servers without overloading,and determining the optimal method for reserving capacity becomes a key issue.Unlike existing algorithms that assume that no two servers share replicas of more than one item,we first formulate capacity reservation for a general arbitrary scenario.Due to the combinatorial nature of this problem,finding the optimal solution is difficult.To this end,we propose a Generalized and Simple Calculating Reserved Capacity(GSCRC)algorithm,with a time complexity only related to the number of items packed in the server.In conjunction with GSCRC,we propose a robust replica packing algorithm with capacity optimization(RobustPack),which aims to minimize the number of servers hosting replicas and tolerate multiple server failures.Through theoretical analysis and experimental evaluations,we show that the RobustPack algorithm can achieve better performance.展开更多
文摘WebGIS是GIS的一个重要的发展方向.本文主要研究基于ArcGIS Server Java ADF和JSF框架的Web-GIS产品开发的关键性技术。文章首先介绍了JSF和ArcGIS Server Java ADF的基本知识,然后对ArcGIS Server Ja-va ADF基本开发技术进行了深入分析,最后以村镇民俗旅游资源空间化分析系统为例,总结了开发此类程序的基本框架。
文摘提高数据挖掘的效率是目前信息技术研究的热点问题之一。介绍了数据挖掘的概念、过程模型以及体系结构,讨论了基于Microsoft SQL Server 2005的数据挖掘方案和采用SQL Server分析服务实现数据挖掘的相关技术。采用SQLServer分析服务的数据挖掘,实现了数据挖掘、数据仓库与应用程序的紧密耦合,从而大大提高了数据挖掘的效率。
基金supported in part by the National Key R&D Program of China under No.2023YFB2703800the National Science Foundation of China under Grants U22B2027,62172297,62102262,61902276 and 62272311+3 种基金Tianjin Intelligent Manufacturing Special Fund Project under Grants 20211097the China Guangxi Science and Technology Plan Project(Guangxi Science and Technology Base and Talent Special Project)under Grant AD23026096(Application Number 2022AC20001)Henan Provincial Natural Science Foundation of China under Grant 622RC616CCF-Nsfocus Kunpeng Fund Project under Grants CCF-NSFOCUS202207。
文摘We study a novel replication mechanism to ensure service continuity against multiple simultaneous server failures.In this mechanism,each item represents a computing task and is replicated intoξ+1 servers for some integerξ≥1,with workloads specified by the amount of required resources.If one or more servers fail,the affected workloads can be redirected to other servers that host replicas associated with the same item,such that the service is not interrupted by the failure of up toξservers.This requires that any feasible assignment algorithm must reserve some capacity in each server to accommodate the workload redirected from potential failed servers without overloading,and determining the optimal method for reserving capacity becomes a key issue.Unlike existing algorithms that assume that no two servers share replicas of more than one item,we first formulate capacity reservation for a general arbitrary scenario.Due to the combinatorial nature of this problem,finding the optimal solution is difficult.To this end,we propose a Generalized and Simple Calculating Reserved Capacity(GSCRC)algorithm,with a time complexity only related to the number of items packed in the server.In conjunction with GSCRC,we propose a robust replica packing algorithm with capacity optimization(RobustPack),which aims to minimize the number of servers hosting replicas and tolerate multiple server failures.Through theoretical analysis and experimental evaluations,we show that the RobustPack algorithm can achieve better performance.
