Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361902
Sukamol Srikwan, M. Jakobsson, A. Albrecht, Mehmet M. Dalkilic
We describe a long-felt but largely neglected problem in conservation biology, and explain how it can be addressed using incentive mechanisms inspired by techniques in computer security and cryptography. The result is a new type of database suitable for highly distributed contributions of data, in which researchers are incentivised to submit data by the guarantees extended by a conflict resolution mechanism that allows for accurate determinations of data origination
{"title":"Trust Establishment in Data Sharing: An Incentive Model for Biodiversity Information Systems","authors":"Sukamol Srikwan, M. Jakobsson, A. Albrecht, Mehmet M. Dalkilic","doi":"10.1109/COLCOM.2006.361902","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361902","url":null,"abstract":"We describe a long-felt but largely neglected problem in conservation biology, and explain how it can be addressed using incentive mechanisms inspired by techniques in computer security and cryptography. The result is a new type of database suitable for highly distributed contributions of data, in which researchers are incentivised to submit data by the guarantees extended by a conflict resolution mechanism that allows for accurate determinations of data origination","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"21 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114018861","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361847
James J. Gardner, A. Krowne, Li Xiong
Collaborative online encyclopedias such as Wikipedia and PlanetMath are becoming increasingly popular. In order to understand an article in a corpus a user must understand the related and underlying concepts through linked articles. In this paper, we introduce NNexus, a generalization of the automatic linking component of PlanetMath.org and the first system that automates the process of linking encyclopedia entries into a semantic network of concepts. We discuss the challenges, present the conceptual models as well as specific mechanisms of NNexus system, and discuss some of our ongoing and completed works
{"title":"NNexus: Towards an Automatic Linker for a Massively-Distributed Collaborative Corpus","authors":"James J. Gardner, A. Krowne, Li Xiong","doi":"10.1109/COLCOM.2006.361847","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361847","url":null,"abstract":"Collaborative online encyclopedias such as Wikipedia and PlanetMath are becoming increasingly popular. In order to understand an article in a corpus a user must understand the related and underlying concepts through linked articles. In this paper, we introduce NNexus, a generalization of the automatic linking component of PlanetMath.org and the first system that automates the process of linking encyclopedia entries into a semantic network of concepts. We discuss the challenges, present the conceptual models as well as specific mechanisms of NNexus system, and discuss some of our ongoing and completed works","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122460097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361890
Honglei Zeng, Maher A. Alhossaini, R. Fikes, D. McGuinness
Wikis are a type of collaborative repository system that enables users to create and edit shared content on the Web. The popularity and proliferation of Wikis have created a new set of challenges for trust research because the content in a Wiki can be contributed by a wide variety of users and can change rapidly. Nevertheless, most Wikis lack explicit trust management to help users decide how much they should trust an article or a fragment of an article. In this paper, we investigate the dynamic nature of revisions as we explore ways of utilizing revision history to develop an article fragment trust model. We use our model to compute trustworthiness of articles and article fragments. We also augment Wikis with a trust view layer with which users can visually identify text fragments of an article and view trust values computed by our model
{"title":"Mining Revision History to Assess Trustworthiness of Article Fragments","authors":"Honglei Zeng, Maher A. Alhossaini, R. Fikes, D. McGuinness","doi":"10.1109/COLCOM.2006.361890","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361890","url":null,"abstract":"Wikis are a type of collaborative repository system that enables users to create and edit shared content on the Web. The popularity and proliferation of Wikis have created a new set of challenges for trust research because the content in a Wiki can be contributed by a wide variety of users and can change rapidly. Nevertheless, most Wikis lack explicit trust management to help users decide how much they should trust an article or a fragment of an article. In this paper, we investigate the dynamic nature of revisions as we explore ways of utilizing revision history to develop an article fragment trust model. We use our model to compute trustworthiness of articles and article fragments. We also augment Wikis with a trust view layer with which users can visually identify text fragments of an article and view trust values computed by our model","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131246427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361848
Jiangtao Li, M. Atallah
The growth of the Internet has created tremendous opportunities for online collaborations. These often involve collaborative optimizations where the two parties are, for example, jointly minimizing costs without violating their own particular constraints (e.g., one party may have too much inventory, another too little inventory but too much production capacity, etc). Many of these optimizations can be formulated as linear programming problems, or, rather, as collaborative linear programming, in which two parties need to jointly optimize based on their own private inputs. It is often important to have online collaboration techniques and protocols that carry this out without either party revealing to the other anything about their own private inputs to the optimization (other than, unavoidably, what can be deduced from the collaboratively computed optimal solution). For example, two organizations who jointly invest in a project may want to minimize some linear objective function while satisfying both organizations' private and confidential constraints. Constraints are usually private when they reveal too much about the organizations' financial health, its future business strategy, etc. Linear programming problems have been widely studied in the literature. However, the existing solutions (e.g., the simplex method) do not extend to the above-mentioned framework in which the linear constraints are shared by the two parties, who do not want to disclose their own to the other party. In this paper, we give an efficient protocol for solving linear programming problems in the honest-but-curious model, such that neither party reveals anything about their private input to the other party (other than what can be inferred from the result). The amount of communication and computation done by our protocol is proportional to the time complexity of the simplex method, a widely used linear programming algorithm. We also provide a practical solution that prevents certain malicious behavior of the participants. The use of the known general circuit-simulation solutions to secure function evaluation is unacceptable for the simplex method, as it implies an exponential size circuit
{"title":"Secure and Private Collaborative Linear Programming","authors":"Jiangtao Li, M. Atallah","doi":"10.1109/COLCOM.2006.361848","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361848","url":null,"abstract":"The growth of the Internet has created tremendous opportunities for online collaborations. These often involve collaborative optimizations where the two parties are, for example, jointly minimizing costs without violating their own particular constraints (e.g., one party may have too much inventory, another too little inventory but too much production capacity, etc). Many of these optimizations can be formulated as linear programming problems, or, rather, as collaborative linear programming, in which two parties need to jointly optimize based on their own private inputs. It is often important to have online collaboration techniques and protocols that carry this out without either party revealing to the other anything about their own private inputs to the optimization (other than, unavoidably, what can be deduced from the collaboratively computed optimal solution). For example, two organizations who jointly invest in a project may want to minimize some linear objective function while satisfying both organizations' private and confidential constraints. Constraints are usually private when they reveal too much about the organizations' financial health, its future business strategy, etc. Linear programming problems have been widely studied in the literature. However, the existing solutions (e.g., the simplex method) do not extend to the above-mentioned framework in which the linear constraints are shared by the two parties, who do not want to disclose their own to the other party. In this paper, we give an efficient protocol for solving linear programming problems in the honest-but-curious model, such that neither party reveals anything about their private input to the other party (other than what can be inferred from the result). The amount of communication and computation done by our protocol is proportional to the time complexity of the simplex method, a widely used linear programming algorithm. We also provide a practical solution that prevents certain malicious behavior of the participants. The use of the known general circuit-simulation solutions to secure function evaluation is unacceptable for the simplex method, as it implies an exponential size circuit","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"236 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123198468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361863
Masahiro Sasabe, N. Wakamiya, M. Murata
Since a peer searches for its desired file in a P2P file sharing system, the structure of an overlay network determines the effectiveness of search. In this paper, based on the Barabasi-Albert (BA) model, we propose a novel scheme (LLR) to construct a low-diameter and location-aware overlay network where peers can easily find physically-close file holders. LLR has a rewiring method to improve the structure of an overlay network and a recovery method to cope with disappearance of peers. Through several simulation experiments using real physical topologies, we found that LLR could construct an overlay network that had the higher reachability than BA and the higher correlation between physical and logical distances
{"title":"LLR: A Construction Scheme of a Low-Diameter, Location-Aware, and Resilient P2P Network","authors":"Masahiro Sasabe, N. Wakamiya, M. Murata","doi":"10.1109/COLCOM.2006.361863","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361863","url":null,"abstract":"Since a peer searches for its desired file in a P2P file sharing system, the structure of an overlay network determines the effectiveness of search. In this paper, based on the Barabasi-Albert (BA) model, we propose a novel scheme (LLR) to construct a low-diameter and location-aware overlay network where peers can easily find physically-close file holders. LLR has a rewiring method to improve the structure of an overlay network and a recovery method to cope with disappearance of peers. Through several simulation experiments using real physical topologies, we found that LLR could construct an overlay network that had the higher reachability than BA and the higher correlation between physical and logical distances","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116836810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361893
Ge Chen, Tiande Guo, Wenguo Yang, Tong Zhao
Routing in wireless sensor networks (WSNs) is very challenging due to their inherent characteristics of large scale, no global identification, dynamic topology, and very limited power, memory, and computational capacities for each sensor. Recent research on WSNs routing protocol has proved that data-centric technologies are needed for performing in-network aggregation of data to yield energy-efficient dissemination. As an effective distributed approach, ant colony optimization (ACO) algorithms have been introduced to the design of data-centric routing protocol and have got many achievements, but still have some shortcomings blocking their further application in the large scale WSNs. To overcome the flaws of conventional ant-based data-centric routing algorithms, we proposed an improved protocol by adding a new type of ant, search ant, to supply prior information to the following ants. Besides, we introduced the strategy of simulating global pheromone update to accelerate the convergence of our algorithm and defined a "retry" rule to avoid dead-lock of the protocol. All of these modifications made the routing protocol scalable, practicable and energy-conservative. Simulation results showed the great advantages of the new protocol
{"title":"An improved ant-based routing protocol in Wireless Sensor Networks","authors":"Ge Chen, Tiande Guo, Wenguo Yang, Tong Zhao","doi":"10.1109/COLCOM.2006.361893","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361893","url":null,"abstract":"Routing in wireless sensor networks (WSNs) is very challenging due to their inherent characteristics of large scale, no global identification, dynamic topology, and very limited power, memory, and computational capacities for each sensor. Recent research on WSNs routing protocol has proved that data-centric technologies are needed for performing in-network aggregation of data to yield energy-efficient dissemination. As an effective distributed approach, ant colony optimization (ACO) algorithms have been introduced to the design of data-centric routing protocol and have got many achievements, but still have some shortcomings blocking their further application in the large scale WSNs. To overcome the flaws of conventional ant-based data-centric routing algorithms, we proposed an improved protocol by adding a new type of ant, search ant, to supply prior information to the following ants. Besides, we introduced the strategy of simulating global pheromone update to accelerate the convergence of our algorithm and defined a \"retry\" rule to avoid dead-lock of the protocol. All of these modifications made the routing protocol scalable, practicable and energy-conservative. Simulation results showed the great advantages of the new protocol","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132700646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361831
M. Pichiliani, C. Hirata
Building a collaborative application from scratch is a hard task. In the last decade many advances have been made to help the developers to construct collaborative applications, however little effort has been made to extend existing single-user applications to support real-time collaboration. This work presents a mapping from the main components of an existing single-user model-view-controller based application to multiuser real-time components of the collaborative application. The mapping allows reuse of existing single-user components by facilitating the construction of collaborative applications. This paper describes the mapping, the extension of an existing single-user application and discusses an experiment of the prototype application where the mapping was applied
{"title":"A Guide to Map Application Components to Support Multi-User Real-Time Collaboration","authors":"M. Pichiliani, C. Hirata","doi":"10.1109/COLCOM.2006.361831","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361831","url":null,"abstract":"Building a collaborative application from scratch is a hard task. In the last decade many advances have been made to help the developers to construct collaborative applications, however little effort has been made to extend existing single-user applications to support real-time collaboration. This work presents a mapping from the main components of an existing single-user model-view-controller based application to multiuser real-time components of the collaborative application. The mapping allows reuse of existing single-user components by facilitating the construction of collaborative applications. This paper describes the mapping, the extension of an existing single-user application and discusses an experiment of the prototype application where the mapping was applied","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134647211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361898
P. Padmanabhan, L. Gruenwald
A mobile ad-hoc network (MANET) is a collection of wireless autonomous nodes without any fixed backbone infrastructure. All the nodes in MANET are mobile and power restricted and thus, disconnection and network partitioning occur frequently. In addition, many MANET database transactions have time constraints. In this paper, a data replication technique for real-time ad-hoc mobile databases (DREAM) is proposed that addresses all those issues. It improves data accessibility while considering the issue of energy limitation by replicating hot data items at servers that have higher remaining power. It addresses disconnection and network partitioning by introducing new data and transaction types and by considering the stability of wireless link. It handles the real-time transaction issue by replicating data items that are accessed frequently by firm transactions before those accessed frequently by soft transactions. DREAM is prototyped on laptops and PDAs and compared with two existing replication techniques using a military database application. The results show that DREAM performs the best in terms of percentage of successfully executed transactions, servers' and clients' energy consumption, and balance of energy consumption distribution among servers
{"title":"Managing Data Replication in Mobile Ad-Hoc Network Databases","authors":"P. Padmanabhan, L. Gruenwald","doi":"10.1109/COLCOM.2006.361898","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361898","url":null,"abstract":"A mobile ad-hoc network (MANET) is a collection of wireless autonomous nodes without any fixed backbone infrastructure. All the nodes in MANET are mobile and power restricted and thus, disconnection and network partitioning occur frequently. In addition, many MANET database transactions have time constraints. In this paper, a data replication technique for real-time ad-hoc mobile databases (DREAM) is proposed that addresses all those issues. It improves data accessibility while considering the issue of energy limitation by replicating hot data items at servers that have higher remaining power. It addresses disconnection and network partitioning by introducing new data and transaction types and by considering the stability of wireless link. It handles the real-time transaction issue by replicating data items that are accessed frequently by firm transactions before those accessed frequently by soft transactions. DREAM is prototyped on laptops and PDAs and compared with two existing replication techniques using a military database application. The results show that DREAM performs the best in terms of percentage of successfully executed transactions, servers' and clients' energy consumption, and balance of energy consumption distribution among servers","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131601718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361876
Kai Lin, David Chen, R. Dromey, Chengzheng Sun
Constraints are very useful in real-time collaborative editing systems. They are able to automatically enforce semantic rules and properties. A specific type of constraint is dataflow constraint. Any property that can be expressed as an equation can be represented as a dataflow constraint. However, ensuring multi-way dataflow constraint satisfaction and consistency maintenance in a replicated collaborative environment is a challenge. This paper presents a novel method for computing multi-way dataflow constraint propagation for real-time collaborative editing systems. This method produces convergent result that is consistent with syntax level effect, irrespective of the operation execution order. This method is generic and is applied to enforce object placement and label name consistency in a realtime collaborative CASE system
{"title":"Multi-way Dataflow Constraint Propagation in Real-time Collaborative Systems","authors":"Kai Lin, David Chen, R. Dromey, Chengzheng Sun","doi":"10.1109/COLCOM.2006.361876","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361876","url":null,"abstract":"Constraints are very useful in real-time collaborative editing systems. They are able to automatically enforce semantic rules and properties. A specific type of constraint is dataflow constraint. Any property that can be expressed as an equation can be represented as a dataflow constraint. However, ensuring multi-way dataflow constraint satisfaction and consistency maintenance in a replicated collaborative environment is a challenge. This paper presents a novel method for computing multi-way dataflow constraint propagation for real-time collaborative editing systems. This method produces convergent result that is consistent with syntax level effect, irrespective of the operation execution order. This method is generic and is applied to enforce object placement and label name consistency in a realtime collaborative CASE system","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114677703","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2006-11-01DOI: 10.1109/COLCOM.2006.361861
Dimitrios Georgakopoulos, M. Nodine, D. Baker, A. Cichocki
Awareness-enabled coordination (AEC) is a platform designed to address the problem of scaling collaboration to large multi-organizational teams. Such collaboration is inhibited by the complexity in multi-organizational environments and lack of efficiency in achieving team objectives. AEC provides a contextualization mechanism that deals with such complex, real world environments where teams involve humans, tools, software services, and agents that come from different organizations, are subject to multiple jurisdictions, and provide diverse expertise. To provide efficiency in achieving team objectives, AEC provides situation- and project-related awareness, as well as process-based coordination and automation. We describe the AEC architecture and discuss AEC models and mechanisms for computing awareness and coordinating action. We use examples from the homeland security domain to illustrate these AEC technical capabilities and their benefits
{"title":"Awareness-based Collaboration Driving Process-based Coordination","authors":"Dimitrios Georgakopoulos, M. Nodine, D. Baker, A. Cichocki","doi":"10.1109/COLCOM.2006.361861","DOIUrl":"https://doi.org/10.1109/COLCOM.2006.361861","url":null,"abstract":"Awareness-enabled coordination (AEC) is a platform designed to address the problem of scaling collaboration to large multi-organizational teams. Such collaboration is inhibited by the complexity in multi-organizational environments and lack of efficiency in achieving team objectives. AEC provides a contextualization mechanism that deals with such complex, real world environments where teams involve humans, tools, software services, and agents that come from different organizations, are subject to multiple jurisdictions, and provide diverse expertise. To provide efficiency in achieving team objectives, AEC provides situation- and project-related awareness, as well as process-based coordination and automation. We describe the AEC architecture and discuss AEC models and mechanisms for computing awareness and coordinating action. We use examples from the homeland security domain to illustrate these AEC technical capabilities and their benefits","PeriodicalId":315775,"journal":{"name":"2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127563664","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：