{"title":"Session 1","authors":"Shallcross","doi":"10.2491/jjsth1970.5.295","DOIUrl":"https://doi.org/10.2491/jjsth1970.5.295","url":null,"abstract":"0206: THE EARLY YEARS ENRICHED CURRICULUM EVALUATION PROJECT 1) Walsh GMDL*, 2) Sproule L, 3) Trew K, 4) Rafferty H, 5) MacGuinness C, 6) Sheehy N 1) Stranmillis University College, Belfast, United Kingdom, 2) Queens University Belfast, Belfast, United Kingdom, 3) Queens Univserity Belfast, Belfast, United Kingdom, 4) Queens Univserity Belfast, Belfast, United Kingdom, 5) Queens University Belfast, Belfast, United Kingdom, 6) Queens University Belfast, Belfast, United Kingdom","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124693203","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}
{"title":"Supporting collaborative work through flexible Process Execution","authors":"S. Jablonski, Michael Igler, Christoph Günther","doi":"10.4108/ICST.COLLABORATECOM2009.8299","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8299","url":null,"abstract":"In this paper we present how a combination of declarative and imperative process modeling constructs facilitate compact presentation of complex process based applications. We show how to effectively implement such constructs in Prolog. Since our concept implicates a new way of interaction between process management system and user we also present our new concept of a worklist. It guides process executors through the execution of complex processes. Through this flexible way of executing processes collaborative work is much better supported than in traditional process management systems.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127116416","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}
A. M. AbdelRahman, M. A. El-Nasr, Ossama M. Ismail
{"title":"A novel forwarding/dropping decision engine for wireless multi-hop ad-hoc networks","authors":"A. M. AbdelRahman, M. A. El-Nasr, Ossama M. Ismail","doi":"10.4108/ICST.COLLABORATECOM2009.8379","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8379","url":null,"abstract":"Ad-hoc networks have been massively used in the last couple of years. The noticeable increase of wireless devices including PDAs, mobile phones, cellular devices, notebooks, etc has directed researchers to start considering various kinds of such ad-hoc networks including wireless mesh networks, multi-hop ad-hoc networks, etc. In this paper, we introduce a new approach for the forwarding and dropping dilemma that faces every node participating in a MANET. We assume that nodes in an ad hoc network behave as if they are in a competitive environment where each node seeks maximum delivery of its destined packets and minimum power consumption due to forwarding. The strategy makes use of data gathered from neighboring nodes that speaks about their behavior. Our strategy will eventually exclude selfish nodes and include cooperative nodes in accordance to the decision it makes.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127210768","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}
{"title":"Improvement of HRV methodology for positive/negative emotion assessment","authors":"Wanqing Wu, Jungtae Lee","doi":"10.4108/ICST.COLLABORATECOM2009.8296","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8296","url":null,"abstract":"Heart rate variability (HRV) dynamics are particularly sensitive to changes in emotional states, and positive and negative emotions can readily be distinguished by changes in heart rhythm patterns. In this paper, we proposed an improved methodology which is a full set of methods from hardware design to software development for HRV analysis. Firstly, a multi-channel ECG acquisition device has been designed for ECG signal collection, and then we developed a full-featured ECG monitoring system which suitable for real-time ECG display, signal pre-processing, high accuracy R wave detection and HRV analysis in time and frequency domain. Moreover, this study investigates the relationship between HRV and positive/negative emotion. The experiment consists of three tasks: eyes-open, pleasant images and unpleasant images. 15 healthy, right-handed volunteers (female 5, male 10) participated in the experiment; all of them are college student between 18 and 25 years. We find that there is significant correlation between HRV and positive/negative emotion. Subjects who had high SDNN and high LF exhibit greater activation of autonomic nervous system and vice versa. These results which demonstrated the relationship between automatic nervous system and psychological response on positive/negative stimulus can help us for self-emotion management and regulation, as well as determine the clinical utility of psychological intervention.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122493038","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}
Wolfgang Reinhardt, Matthias Moi, Tobias Varlemann
{"title":"Artefact-Actor-Networks as tie between social networks and artefact networks","authors":"Wolfgang Reinhardt, Matthias Moi, Tobias Varlemann","doi":"10.4108/ICST.COLLABORATECOM2009.8308","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8308","url":null,"abstract":"Social networks reflect communication, cooperation and loose acquaintances in networked communities. Numerous metrics allow to expose connections, important persons or clusters within these communities. Furthermore, networks can be spanned to connect documents, blog entries or wiki articles. We call such a network an artefact network. In this paper we introduce the approach of Artefact-Actor-Networks that tries to connect social networks and artefact networks in order to make claims on the semantical connections between persons and manifold artefacts. We present practical use cases for Artefact-Actor-Networks and discuss generic and specific semantical requirements and added values through the existence of Artefact-Actor-Networks.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128513345","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}
{"title":"Bio-inspired true coalition formation on intrusion detection by mobile robots","authors":"Xiannuan Liang, Yang Xiao","doi":"10.4108/ICST.COLLABORATECOM2009.8291","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8291","url":null,"abstract":"In this paper, we study a true coalition formation of three robots (i.e., 2 robots vs. 1 robot) in order to detect and capture intrusions in a curved loop. A coalition benefits robots by increasing detection and capture strength, but it has a tradeoff of paying an investment cost for each individual. We derive that a true coalition only arises when an interior evolutionarily stable strategy exists. We also find out the conditions under which an interior evolutionarily stable strategy exists.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121395068","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}
{"title":"DISCERN: A collaborative visualization system for learning cryptographic protocols","authors":"G. Cattaneo, A. D. Santis, U. F. Petrillo","doi":"10.4108/ICST.COLLABORATECOM2009.8360","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8360","url":null,"abstract":"In this paper we propose a novel approach to the learning of cryptographic protocols, based on a collaborative role-based visualization system, DISCERN, that helps students to understand a protocol by actively engaging them in a simulation of its execution. In DISCERN, each student shares a visual exemplification of a real-world scenario with other students and impersonates one of the parties involved in the execution of a protocol. Students may take the role of legal or malicious parties and are provided with primitives that are useful for the implementation of several protocols. To achieve a certain security goal correctly, legal parties have to collaborate and carefully execute the steps required by the implemented protocol in the correct order. If any error is made, the security of the protocol is exposed to the threats coming from other students impersonating malicious parties. The entire process is run under the supervision of the teacher.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126458841","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}
{"title":"A collaborative framework for enforcing server commitments, and for regulating server interactive behavior in SOA-based systems","authors":"Tin-hon. Lam, N. Minsky","doi":"10.4108/ICST.COLLABORATECOM2009.8347","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8347","url":null,"abstract":"We are presenting a collaborative framework to enforce server commitments, and to regulate server interactive behavior in SOA systems. Trusted components collaborate to establish a network of enforcement components, one per server, to maintain proofs of what servers have committed with their clients and peer servers. The trusted components and the enforcement components also collaborate to make servers accountable for their commitments, and to enforce policies on the interactions between the servers and their clients/peer servers. In our framework, such collaborative efforts are explicitly stated in the form of policies to ease the management of collaborative processes. Our implementation is based on the LGI mechanism, complies with SOA standards, and does not require any change of the conventional SOAP-based protocol, the UDDI server, or the programs employed by servers and their clients.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128076387","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}
{"title":"Trusted computing - opportunities & risks","authors":"N. Awang","doi":"10.4108/ICST.COLLABORATECOM2009.8402","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8402","url":null,"abstract":"Computer security is undeniably important in IT era nowdays. Most computer users today are fighting for - either by battling viruses, spam, phishing or other malware, or by fending off schemes to compromise privacy and extract confidential information. With these worries in mind, the Trusted Computing Group (TCG) was established to develop specifications for trusted computing building blocks and software interfaces that could address the problems and aims to enhance security by using the transitive properties of trust. However, the implementation of this technology seems to have consequences for many people. At present, there is no standard mechanism for establishing trust in the Trusted Computing (TC) on a particular machine. The TC specification is not rigidly defined when it comes to implementation, leaving many open issues for research and development efforts. There are major issues, especially related to privacy. One big worry is the potential loss of anonymity and the threat of unwanted surveillance and even control. TC also affects areas other than purely technical ones. The capabilities of TC technology have legal as well as economic consequences. The main legal concerns are copyright, anti-trust law, data privacy law and digital rights management, the impact on which are not yet clear. This paper will discuss the TC in concept and study on the opportunities and risks of the system in existing computing system environment particularly related to security matters.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128145353","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}
{"title":"DiSK: A distributed shared disk cache for HPC environments","authors":"B. Szeliga, Tung Nguyen, Weisong Shi","doi":"10.4108/ICST.COLLABORATECOM2009.8307","DOIUrl":"https://doi.org/10.4108/ICST.COLLABORATECOM2009.8307","url":null,"abstract":"Data movement within high performance environments can be a large bottleneck to the overall performance of programs. With the addition of continuous storage and usage of older data, the back end storage is becoming a larger problem than the improving network and computational nodes. This has led us to develop a Distributed Shared Disk Cache, DiSK, to reduce the dependence on these back end storage systems. With DiSK requested files will be distributed across nodes in order to reduce the amount of requests directed to the archives. DiSK has two key components. One is a Distributed Metadata Management, DIMM, scheme that allows a centralized manager to access what data is available in the system. This is accomplished through the use of a counter-based bloomfilter with locality checks in order to reduce false positives and false negatives. The second component is a method of replication called Differentiable Replication, DiR. The novelty of DiR is that the requirements of the files and capabilities of underlying nodes are taken into consideration for replication. This allows for a varying degree of replication depending on the file. This customization of DiSK yields better performance than the conventional archive system.","PeriodicalId":232795,"journal":{"name":"2009 5th International Conference on Collaborative Computing: Networking, Applications and Worksharing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134277859","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}