Hiroaki Nishino, K. Shihara, Tsuneo Kagawa, K. Utsumiya
We propose a method to provide an intuitive computer graphics authoring environment usable on tiny mobile devices. We adopted a 3D authoring method based on interactive evolutionary computation (IEC). It allows users to intuitively produce high quality graphics contents on site by evolving a set of 3D models using genetic algorithm (GA). The proposed system enables the users to easily design 3D graphics contents by using a mobile device anywhere at any time without sacrificing visual quality. The proposed system employed "thin client" architecture because the computing power of the mobile devices is not enough to render realistic 3D objects. The mobile client plays a role for handling user interactions and transmitting data to/from the server whereas the server is responsible for heavy graphics processing. Providing good user interface is a crucial factor for mobile software design. We prototyped three different GUI layouts and conducted a comparative experiment to figure out which design is preferable.
{"title":"A Ubiquitous 3D Graphics Modeler for Mobile Devices","authors":"Hiroaki Nishino, K. Shihara, Tsuneo Kagawa, K. Utsumiya","doi":"10.1109/ISPA.2008.83","DOIUrl":"https://doi.org/10.1109/ISPA.2008.83","url":null,"abstract":"We propose a method to provide an intuitive computer graphics authoring environment usable on tiny mobile devices. We adopted a 3D authoring method based on interactive evolutionary computation (IEC). It allows users to intuitively produce high quality graphics contents on site by evolving a set of 3D models using genetic algorithm (GA). The proposed system enables the users to easily design 3D graphics contents by using a mobile device anywhere at any time without sacrificing visual quality. The proposed system employed \"thin client\" architecture because the computing power of the mobile devices is not enough to render realistic 3D objects. The mobile client plays a role for handling user interactions and transmitting data to/from the server whereas the server is responsible for heavy graphics processing. Providing good user interface is a crucial factor for mobile software design. We prototyped three different GUI layouts and conducted a comparative experiment to figure out which design is preferable.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121062601","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}
ManKyu Park, Y. Choi, Jae Yong Lee, Byungchul Kim, Daeyoung Kim, J. H. Kim
Next-generation mobile communication networks are supposed to provide various high capacity multimedia services to mobile users using various kinds of access networks. Among them, the WiNGS system developed by ETRI as one of 4G mobile system provides high performance RATs (Radio Access Technology) and network architecture with IP connectivity for merging them. In this paper, we propose a new link layer Selective-Repeat Automatic Repeat Request (SR-ARQ) mechanism that solves packet re-ordering problems during handovers and enhances handover performance in WiNGS system. In the proposed mechanism, we adopt an adaptive timer in the sending node in order to prevent unnecessary packet retransmission during handovers, and a delayed NAK scheme in the receiving node to prevent detection of temporal packet reordering due to handover delay. We implemented the proposed SR-ARQ mechanism in ns-2 simulator for performance evaluation. The simulation results show that the proposed SR-ARQ enhances handover performance for the WiNGS system by preventing unnecessary retransmission and reordering.
{"title":"Design of an Enhanced Handover Algorithm Based on a New Adaptive SR-ARQ for Next-Generation Mobile Communication Networks","authors":"ManKyu Park, Y. Choi, Jae Yong Lee, Byungchul Kim, Daeyoung Kim, J. H. Kim","doi":"10.1109/ISPA.2008.24","DOIUrl":"https://doi.org/10.1109/ISPA.2008.24","url":null,"abstract":"Next-generation mobile communication networks are supposed to provide various high capacity multimedia services to mobile users using various kinds of access networks. Among them, the WiNGS system developed by ETRI as one of 4G mobile system provides high performance RATs (Radio Access Technology) and network architecture with IP connectivity for merging them. In this paper, we propose a new link layer Selective-Repeat Automatic Repeat Request (SR-ARQ) mechanism that solves packet re-ordering problems during handovers and enhances handover performance in WiNGS system. In the proposed mechanism, we adopt an adaptive timer in the sending node in order to prevent unnecessary packet retransmission during handovers, and a delayed NAK scheme in the receiving node to prevent detection of temporal packet reordering due to handover delay. We implemented the proposed SR-ARQ mechanism in ns-2 simulator for performance evaluation. The simulation results show that the proposed SR-ARQ enhances handover performance for the WiNGS system by preventing unnecessary retransmission and reordering.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"8 18","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120842699","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}
E. P. Freitas, A. Binotto, C. Pereira, A. Stork, Tony Larsson
Many modern applications require high-performance platforms to deal with a variety of algorithms requiring massive calculations. Moreover, low-cost powerful hardware (e.g., GPU, PPU) and CPUs with multiple cores have become abundant, and can be combined in heterogeneous architectures. To cope with this, reconfigurable computing is a potential paradigm as it can provide flexibility to explore the computational resources on hybrid and multi-core desktop architectures. The workload can optimally be (re)distributed over heterogeneous cores along the lifecycle of an application, aiming for best performance. As the first step towards a run-time reconfigurable load-balancing framework, application requirements and crosscutting concerns related to timing play an important role for task allocation decisions. In this paper, we present the use of aspect-oriented paradigms to address non-functional application timing constraints in the design phase. The DERAF aspectspsila framework is extended to support reconfiguration requirements; and a strategy for load-balancing is described. In addition, we present preliminary evaluation using an Unmanned Aerial Vehicle (UAV) based surveillance system as case study.
{"title":"Dynamic Reconfiguration of Tasks Applied to an UAV System Using Aspect Orientation","authors":"E. P. Freitas, A. Binotto, C. Pereira, A. Stork, Tony Larsson","doi":"10.1109/ISPA.2008.69","DOIUrl":"https://doi.org/10.1109/ISPA.2008.69","url":null,"abstract":"Many modern applications require high-performance platforms to deal with a variety of algorithms requiring massive calculations. Moreover, low-cost powerful hardware (e.g., GPU, PPU) and CPUs with multiple cores have become abundant, and can be combined in heterogeneous architectures. To cope with this, reconfigurable computing is a potential paradigm as it can provide flexibility to explore the computational resources on hybrid and multi-core desktop architectures. The workload can optimally be (re)distributed over heterogeneous cores along the lifecycle of an application, aiming for best performance. As the first step towards a run-time reconfigurable load-balancing framework, application requirements and crosscutting concerns related to timing play an important role for task allocation decisions. In this paper, we present the use of aspect-oriented paradigms to address non-functional application timing constraints in the design phase. The DERAF aspectspsila framework is extended to support reconfiguration requirements; and a strategy for load-balancing is described. In addition, we present preliminary evaluation using an Unmanned Aerial Vehicle (UAV) based surveillance system as case study.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133711337","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}
L. Xiang, K. Udagepola, Chaoguang Men, Stephen Lovatt
In any Active Geographical Information System the reliability of any results of queries, analysis or reasoning depends on data quality (up-to-date data with properties of positional accuracy, consistency and so on). A system is built for violation detection under Topo-Semantic consistency with specific checking and correcting processes using a SSRO-Tree structure for spatial data access. Results indicate that the developed Constraint Violation Detection (CVD) system is powerful when compared with popular conventional systems. Three kinds of errors are identified which lead to three kinds of consistency, namely structural consistency, geometric consistency and Topo-Semantic consistency.
{"title":"Topo-Semantic Constraints Checking","authors":"L. Xiang, K. Udagepola, Chaoguang Men, Stephen Lovatt","doi":"10.1109/ISPA.2008.98","DOIUrl":"https://doi.org/10.1109/ISPA.2008.98","url":null,"abstract":"In any Active Geographical Information System the reliability of any results of queries, analysis or reasoning depends on data quality (up-to-date data with properties of positional accuracy, consistency and so on). A system is built for violation detection under Topo-Semantic consistency with specific checking and correcting processes using a SSRO-Tree structure for spatial data access. Results indicate that the developed Constraint Violation Detection (CVD) system is powerful when compared with popular conventional systems. Three kinds of errors are identified which lead to three kinds of consistency, namely structural consistency, geometric consistency and Topo-Semantic consistency.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134448640","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}
P. Combes, E. Caron, F. Desprez, B. Chopard, J. Zory
SystemC has become a very popular standardized language for the modeling of system-on-chip (SoC) devices. However, due to the ever increasing complexity of SoC designs, the ever longer simulation times affect SoC exploration potential and time-to-market. In order to reduce these times, we have developed a parallel SystemC kernel. Because the SystemC semantics require a high level of synchronization which can dramatically affect the performance gains, we investigate in this paper some ways to reduce the synchronization overheads. We validate then our approaches against an academic design model and a real, industrial application.
{"title":"Relaxing Synchronization in a Parallel SystemC Kernel","authors":"P. Combes, E. Caron, F. Desprez, B. Chopard, J. Zory","doi":"10.1109/ISPA.2008.124","DOIUrl":"https://doi.org/10.1109/ISPA.2008.124","url":null,"abstract":"SystemC has become a very popular standardized language for the modeling of system-on-chip (SoC) devices. However, due to the ever increasing complexity of SoC designs, the ever longer simulation times affect SoC exploration potential and time-to-market. In order to reduce these times, we have developed a parallel SystemC kernel. Because the SystemC semantics require a high level of synchronization which can dramatically affect the performance gains, we investigate in this paper some ways to reduce the synchronization overheads. We validate then our approaches against an academic design model and a real, industrial application.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132603438","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}
With a camera mobile phone, which has become a "must-have" device, 2D-barcode works as an interface to bridge the physical and digital world. As the notion of ubiquitous computing has permeated, developing a new 2D-barcode and its applications has been a growing trend worldwide. A 2D-barcode symbol consists of two broad areas: data area and guide area. The components of the latter is collectively called "finder pattern" and used in locating the 2D-barcode symbol. The failure of finding the target symbol prevents a barcode reader from successfully decoding the barcode. Hence, designing a functional finder pattern is one of the key for improving the robustness of barcode reading, and thus, the entire 2D-barcode system. We have designed a novel finder pattern integrated with a color 2D-barcode for camera mobile phone applications. Through the development and evaluation of the finder pattern for effective color 2D-barcode detection, this paper discusses keys to improve the functionality and reliability of finder patterns, which should be kept in mind when designing a finder pattern for any 2D-barcode symbol.
{"title":"Development of a Novel Finder Pattern for Effective Color 2D-Barcode Detection","authors":"H. Kato, K. T. Tan, Douglas Chai","doi":"10.1109/ISPA.2008.140","DOIUrl":"https://doi.org/10.1109/ISPA.2008.140","url":null,"abstract":"With a camera mobile phone, which has become a \"must-have\" device, 2D-barcode works as an interface to bridge the physical and digital world. As the notion of ubiquitous computing has permeated, developing a new 2D-barcode and its applications has been a growing trend worldwide. A 2D-barcode symbol consists of two broad areas: data area and guide area. The components of the latter is collectively called \"finder pattern\" and used in locating the 2D-barcode symbol. The failure of finding the target symbol prevents a barcode reader from successfully decoding the barcode. Hence, designing a functional finder pattern is one of the key for improving the robustness of barcode reading, and thus, the entire 2D-barcode system. We have designed a novel finder pattern integrated with a color 2D-barcode for camera mobile phone applications. Through the development and evaluation of the finder pattern for effective color 2D-barcode detection, this paper discusses keys to improve the functionality and reliability of finder patterns, which should be kept in mind when designing a finder pattern for any 2D-barcode symbol.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129547197","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}
Inspired by rule-based access control models, this paper proposes a universal policy model and an access protection framework to secure dataspace. The key components and processes for this framework, policy organization, policy indexing and two resource searching strategies with access decision-making, are illustrated and experimented to harmonize the contradiction between security and efficiency.
{"title":"Secure Dataspace with Access Policies","authors":"Lei Jin, Yawei Zhang, Xiaojun Ye","doi":"10.1109/ISPA.2008.28","DOIUrl":"https://doi.org/10.1109/ISPA.2008.28","url":null,"abstract":"Inspired by rule-based access control models, this paper proposes a universal policy model and an access protection framework to secure dataspace. The key components and processes for this framework, policy organization, policy indexing and two resource searching strategies with access decision-making, are illustrated and experimented to harmonize the contradiction between security and efficiency.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124519619","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}
S. L. Mirtaheri, Ehsan Mousavi Khaneghah, M. Sharifi, M. A. Azgomi
Parallel programming and distributed programming are two solutions for scientific applications to provide high performance and fast response time in parallel systems and distributed systems. Parallel and distributed systems must provide inter process communication (IPC) mechanisms like message passing mechanism as underlying platforms to enable communication between local and especially geographically dispersed and physically distributed processes. Communication overhead is the major problem in these systems and there are a lot of efforts to develop more efficient message passing mechanisms or to improve the network communication speed. This paper provides hard evidence that an efficient implementation of message passing mechanism on multi-computers reduces the execution time of a molecular dynamics code. A well-known program for macromolecular dynamics and mechanics called CHARMm is executed on a networked cluster. The performance of CHARMm is measured with two distributed implementations of message passing, namely a kernel-level implementation called DIPC2006 and a renowned library level implementation called MPI. It is shown that the performance of CHARMm on a DIPC2006 configured cluster is by far better than its performance on an optimized MPI configured similar cluster. Even ignoring the favorable points of kernel-level implementations, like safety, privilege, reliability, and primitiveness, the insight is twofold. Scientists are nowadays faced with more computational complexity and look for more efficient systems and mechanisms. Efficient distributed IPC mechanisms have direct effect on running scientistspsila simulations faster, and computer engineers may try harder to develop more efficient distributed implementations of IPC.
{"title":"The Influence of Efficient Message Passing Mechanisms on High Performance Distributed Scientific Computing","authors":"S. L. Mirtaheri, Ehsan Mousavi Khaneghah, M. Sharifi, M. A. Azgomi","doi":"10.1109/ISPA.2008.131","DOIUrl":"https://doi.org/10.1109/ISPA.2008.131","url":null,"abstract":"Parallel programming and distributed programming are two solutions for scientific applications to provide high performance and fast response time in parallel systems and distributed systems. Parallel and distributed systems must provide inter process communication (IPC) mechanisms like message passing mechanism as underlying platforms to enable communication between local and especially geographically dispersed and physically distributed processes. Communication overhead is the major problem in these systems and there are a lot of efforts to develop more efficient message passing mechanisms or to improve the network communication speed. This paper provides hard evidence that an efficient implementation of message passing mechanism on multi-computers reduces the execution time of a molecular dynamics code. A well-known program for macromolecular dynamics and mechanics called CHARMm is executed on a networked cluster. The performance of CHARMm is measured with two distributed implementations of message passing, namely a kernel-level implementation called DIPC2006 and a renowned library level implementation called MPI. It is shown that the performance of CHARMm on a DIPC2006 configured cluster is by far better than its performance on an optimized MPI configured similar cluster. Even ignoring the favorable points of kernel-level implementations, like safety, privilege, reliability, and primitiveness, the insight is twofold. Scientists are nowadays faced with more computational complexity and look for more efficient systems and mechanisms. Efficient distributed IPC mechanisms have direct effect on running scientistspsila simulations faster, and computer engineers may try harder to develop more efficient distributed implementations of IPC.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115795602","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}
For many scientific applications, the fast Fourier transformation (FFT) of multi-dimensional data is the kernel that limits scalability on a large number of processors. This paper investigates the extent of performance improvements for a parallel three-dimensional FFT (3D-FFT) implementation when using customized MPI task mappings. The MPI tasks are mapped in a customized fashion from the two-dimensional virtual processor grid of the algorithm to the physical hardware of a system with a mesh interconnect. We compare and analyze the outcomes on Blue Gene/P with those from previous investigations on Blue Gene/L. The performance analysis is based on bandwidth considerations. The results demonstrate that on Blue Gene/P, a carefully chosen MPI task mapping with regards to the network characteristics is more important compared to Blue Gene/L and yields significant improvement.
{"title":"Custom Assignment of MPI Ranks for Parallel Multi-dimensional FFTs: Evaluation of BG/P versus BG/L","authors":"Heike Jagode, J. Hein","doi":"10.1109/ISPA.2008.136","DOIUrl":"https://doi.org/10.1109/ISPA.2008.136","url":null,"abstract":"For many scientific applications, the fast Fourier transformation (FFT) of multi-dimensional data is the kernel that limits scalability on a large number of processors. This paper investigates the extent of performance improvements for a parallel three-dimensional FFT (3D-FFT) implementation when using customized MPI task mappings. The MPI tasks are mapped in a customized fashion from the two-dimensional virtual processor grid of the algorithm to the physical hardware of a system with a mesh interconnect. We compare and analyze the outcomes on Blue Gene/P with those from previous investigations on Blue Gene/L. The performance analysis is based on bandwidth considerations. The results demonstrate that on Blue Gene/P, a carefully chosen MPI task mapping with regards to the network characteristics is more important compared to Blue Gene/L and yields significant improvement.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114910231","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. Lugmayr, Simon Reymann, S. Kemper, T. Dorsch, Pablo Roman
This article approaches the way how to think about collaboration with pervasive technology in a new way. It introduces ambient media as new form of media, where the media as such is linked to physical worlds, and smartly aggregated rather than generated with a push or pull model. Collaboration between human man and technology becomes a issue of collaboration, rather than a question of human-computer interaction. As far user contributed content was mostly seen as process, where consumers contribute to online Web forums or create their own videos and upload it to YouTube. The user actively contributes and collaborates to create the content of the media. However, pervasive technology enables much more: pervasive technology allows implicit collaboration, thus the collection of consumer data passively and aggregate the content of the media. One example is the open source platform Portable Personality (P2), whose goal is to generate a personality profile of the implicit collected contextual information. P2 will offer the possibility of personality profiles, rather than simple usage history information or sensor data input. Within the context of this article, the notion of ambient media is introduced. As a practical example to underline the new way of thinking about media, P2 is introduced and the underlying principles explained.
{"title":"Bits of Personality Everywhere: Implicit User-Generated Content in the Age of Ambient Media","authors":"A. Lugmayr, Simon Reymann, S. Kemper, T. Dorsch, Pablo Roman","doi":"10.1109/ISPA.2008.141","DOIUrl":"https://doi.org/10.1109/ISPA.2008.141","url":null,"abstract":"This article approaches the way how to think about collaboration with pervasive technology in a new way. It introduces ambient media as new form of media, where the media as such is linked to physical worlds, and smartly aggregated rather than generated with a push or pull model. Collaboration between human man and technology becomes a issue of collaboration, rather than a question of human-computer interaction. As far user contributed content was mostly seen as process, where consumers contribute to online Web forums or create their own videos and upload it to YouTube. The user actively contributes and collaborates to create the content of the media. However, pervasive technology enables much more: pervasive technology allows implicit collaboration, thus the collection of consumer data passively and aggregate the content of the media. One example is the open source platform Portable Personality (P2), whose goal is to generate a personality profile of the implicit collected contextual information. P2 will offer the possibility of personality profiles, rather than simple usage history information or sensor data input. Within the context of this article, the notion of ambient media is introduced. As a practical example to underline the new way of thinking about media, P2 is introduced and the underlying principles explained.","PeriodicalId":345341,"journal":{"name":"2008 IEEE International Symposium on Parallel and Distributed Processing with Applications","volume":"114 16","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120826884","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
扫码关注我们
求助内容：
应助结果提醒方式：