J. Ikonen, Petri Ryhänen, Janne Parkkila, Antti Knutas
This study presents a concept for linking individual physical activities and video games together to build an ecosystem to motivate players to exercise. We used a systematic mapping study to establish current state of art and a user questionnaire to understand how players feel about digital rewards from physical exercises. In addition we implemented a prototype to demonstrate the applicability. The results suggest that combining games and physical activity trackers together is technologically feasible, and there is an audience who would be willing to exercise in order to receive rewards in games.
{"title":"Linking physical activities and video games","authors":"J. Ikonen, Petri Ryhänen, Janne Parkkila, Antti Knutas","doi":"10.1145/2812428.2812457","DOIUrl":"https://doi.org/10.1145/2812428.2812457","url":null,"abstract":"This study presents a concept for linking individual physical activities and video games together to build an ecosystem to motivate players to exercise. We used a systematic mapping study to establish current state of art and a user questionnaire to understand how players feel about digital rewards from physical exercises. In addition we implemented a prototype to demonstrate the applicability. The results suggest that combining games and physical activity trackers together is technologically feasible, and there is an audience who would be willing to exercise in order to receive rewards in games.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114993419","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}
Nowadays, Service Oriented Architecture (SOA) has become a preferable way of building information systems because they enable enterprises to rapidly response to the business' changes. However, the more complex SOA develops, the more likely are data quality (DQ) issues to be encountered. Despite the huge number of studies that have been done on SOA, very little has been investigated about the DQ aspect. In this paper we address issues concerning the detection of data quality problems. Hence, we propose a DQ methodology in the SOA context which will assess semantic (business) data.
{"title":"A methodology for analyzing and measuring semantic data quality in service oriented architectures","authors":"P. Petkov, M. Helfert","doi":"10.1145/2516775.2516782","DOIUrl":"https://doi.org/10.1145/2516775.2516782","url":null,"abstract":"Nowadays, Service Oriented Architecture (SOA) has become a preferable way of building information systems because they enable enterprises to rapidly response to the business' changes. However, the more complex SOA develops, the more likely are data quality (DQ) issues to be encountered. Despite the huge number of studies that have been done on SOA, very little has been investigated about the DQ aspect. In this paper we address issues concerning the detection of data quality problems. Hence, we propose a DQ methodology in the SOA context which will assess semantic (business) data.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132076542","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}
Service compositions are increasingly used for the fast development of loosely-coupled dynamic distributed applications. Providing their quality is a challenging task due to various problems at infrastructure, service and orchestration levels as well as necessity of performance of different types of testing in unknown context and environment. This paper proposes a methodology for testing web service compositions, described with Business Process Execution Language for Web Services (WS-BPEL). Its feasibility is proved through a case study, showing how the methodology's steps can be performed though automated tools in order to achieve functional, performance and robustness testing.
{"title":"Testing web service's compositions following TASSA methodology","authors":"D. Manova, S. Ilieva, D. Petrova-Antonova","doi":"10.1145/2516775.2516817","DOIUrl":"https://doi.org/10.1145/2516775.2516817","url":null,"abstract":"Service compositions are increasingly used for the fast development of loosely-coupled dynamic distributed applications. Providing their quality is a challenging task due to various problems at infrastructure, service and orchestration levels as well as necessity of performance of different types of testing in unknown context and environment. This paper proposes a methodology for testing web service compositions, described with Business Process Execution Language for Web Services (WS-BPEL). Its feasibility is proved through a case study, showing how the methodology's steps can be performed though automated tools in order to achieve functional, performance and robustness testing.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124518324","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}
The article presents a description of a practical realization of small EDK type computer program, intended to leverage the process of embedded PicoBlaze type microprocessor system development. It is capable to create the configuration file directly from a block diagram sketch of the developed system. Based on the information contained in to the configuration file the program is capable to create a template for assembler program of the embedded microprocessor core.
{"title":"A program for an automatic PicoBlaze type embedded system generation","authors":"V. Ivanov","doi":"10.1145/2516775.2516784","DOIUrl":"https://doi.org/10.1145/2516775.2516784","url":null,"abstract":"The article presents a description of a practical realization of small EDK type computer program, intended to leverage the process of embedded PicoBlaze type microprocessor system development. It is capable to create the configuration file directly from a block diagram sketch of the developed system. Based on the information contained in to the configuration file the program is capable to create a template for assembler program of the embedded microprocessor core.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125869130","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}
In this paper, we propose a three dimensional storage-on-chip design that provides systems with high integration. The main memory and disk storage are stacked on-chip with through silicon vias. We analyse implementation feasibility, a 3D chip with multiple layers of DRAM and NAND storage is modelled accordingly. We use a sophisticated simulation toolset to analyse the performance of various architectures. Full system evaluation using SPLASH-2 benchmarks shows that, compared to conventional off-chip main memory and disk storage, our design can reduce the overall execution time by 38.3% on average.
{"title":"MMSoC: a multi-layer multi-core storage-on-chip design for systems with high integration","authors":"T. Xu, P. Liljeberg, J. Plosila, H. Tenhunen","doi":"10.1145/2516775.2516800","DOIUrl":"https://doi.org/10.1145/2516775.2516800","url":null,"abstract":"In this paper, we propose a three dimensional storage-on-chip design that provides systems with high integration. The main memory and disk storage are stacked on-chip with through silicon vias. We analyse implementation feasibility, a 3D chip with multiple layers of DRAM and NAND storage is modelled accordingly. We use a sophisticated simulation toolset to analyse the performance of various architectures. Full system evaluation using SPLASH-2 benchmarks shows that, compared to conventional off-chip main memory and disk storage, our design can reduce the overall execution time by 38.3% on average.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114167867","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}
Detelin Luchev, D. Paneva-Marinova, Lilia Pavlova-Draganova, R. Pavlov
The contemporary information space provides a special place for the fashion art exhibitions. The fashion art reflects not only the choice of the society for the clothes, but it is a valuable cultural heritage - a long-term commitment for dress designers. Preserving and presenting this treasure is not new task, but the digital world gives a new vision on fashion creation and performing. In this paper we presented the first attempt in Bulgaria to be developed a multimedia digital library, keeping fashion objects, created by students of the National Art Academy. During the process on fashion study of young people it is often discovered new lines, talented creators, innovative fashion tendencies and new performing ideas that have to be advertised and popularized.
{"title":"New digital fashion world","authors":"Detelin Luchev, D. Paneva-Marinova, Lilia Pavlova-Draganova, R. Pavlov","doi":"10.1145/2516775.2516803","DOIUrl":"https://doi.org/10.1145/2516775.2516803","url":null,"abstract":"The contemporary information space provides a special place for the fashion art exhibitions. The fashion art reflects not only the choice of the society for the clothes, but it is a valuable cultural heritage - a long-term commitment for dress designers. Preserving and presenting this treasure is not new task, but the digital world gives a new vision on fashion creation and performing. In this paper we presented the first attempt in Bulgaria to be developed a multimedia digital library, keeping fashion objects, created by students of the National Art Academy. During the process on fashion study of young people it is often discovered new lines, talented creators, innovative fashion tendencies and new performing ideas that have to be advertised and popularized.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122773428","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 model of a camera and a projector, accounting for the inherent geometric distortions of devices, is presented. The model includes coordinates of an optical center for the device and matrices with the values and the coordinates of the individual image pixels, considered in a plane at a given distance from the optical center and perpendicular to the optical axis of the device. The parameters of the model are determined experimentally. The model can successfully be used for the purposes of computer vision.
{"title":"Pixel-based representation of geometrical distortions in a camera/projector model","authors":"Hristian Rusev","doi":"10.1145/2516775.2516810","DOIUrl":"https://doi.org/10.1145/2516775.2516810","url":null,"abstract":"A model of a camera and a projector, accounting for the inherent geometric distortions of devices, is presented. The model includes coordinates of an optical center for the device and matrices with the values and the coordinates of the individual image pixels, considered in a plane at a given distance from the optical center and perpendicular to the optical axis of the device. The parameters of the model are determined experimentally. The model can successfully be used for the purposes of computer vision.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127649035","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 software tool for investigation of the clearance in mechanical joints is created. It works in the integrated environment of the software system Matlab. In this study, the advanced signal processing methods are used. They allow to implement the presented algorithm in real time microprocessor systems. Also an investigation of vibration signatures of health teeth and of a tooth with a crack is realized based on the finite element method and on the software system Abaqus.
{"title":"Scientific software tools for machinery vibration diagnostic","authors":"S. Stoyanov","doi":"10.1145/2516775.2516812","DOIUrl":"https://doi.org/10.1145/2516775.2516812","url":null,"abstract":"A software tool for investigation of the clearance in mechanical joints is created. It works in the integrated environment of the software system Matlab. In this study, the advanced signal processing methods are used. They allow to implement the presented algorithm in real time microprocessor systems. Also an investigation of vibration signatures of health teeth and of a tooth with a crack is realized based on the finite element method and on the software system Abaqus.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134429260","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}
User mode linux (UML) is a open source software that allows to run Linux in a "virtual machine" on top of a physical Linux box. UML allows one to run Linux kernels as user mode processes under a host Linux kernel, giving a simple way to run several independent virtual machines on a single piece of physical hardware. So, with the help of UML, we can simulate large no. of computers (PCs). In this paper we give a methodology to simulate large no. of PCs using UML. These PCs are actually virtual machines running on top of a host. We studied maximum no. of PCs that can be simulated on a host with given RAM. We configure various functions on these PCs such as access to the internet, executing commands on these PCs simultaneously. This simulation is useful in many scenarios especially for experimentation purposes. One application of software will be in testing MPP, a product developed at HSR, Switzerland. It enables users to buy access to the internet at Hotspots. But right now, there is a problem when no. of clients trying to connect simultaneously to a server, exceed a given limit. So, a software to simulate this environment has to be designed to avoid use of large no. of physical computers which is expensive and infeasible.
{"title":"'N' client simulation using user mode Linux","authors":"S. Aggarwal","doi":"10.1145/2516775.2516820","DOIUrl":"https://doi.org/10.1145/2516775.2516820","url":null,"abstract":"User mode linux (UML) is a open source software that allows to run Linux in a \"virtual machine\" on top of a physical Linux box. UML allows one to run Linux kernels as user mode processes under a host Linux kernel, giving a simple way to run several independent virtual machines on a single piece of physical hardware. So, with the help of UML, we can simulate large no. of computers (PCs). In this paper we give a methodology to simulate large no. of PCs using UML. These PCs are actually virtual machines running on top of a host. We studied maximum no. of PCs that can be simulated on a host with given RAM. We configure various functions on these PCs such as access to the internet, executing commands on these PCs simultaneously. This simulation is useful in many scenarios especially for experimentation purposes. One application of software will be in testing MPP, a product developed at HSR, Switzerland. It enables users to buy access to the internet at Hotspots. But right now, there is a problem when no. of clients trying to connect simultaneously to a server, exceed a given limit. So, a software to simulate this environment has to be designed to avoid use of large no. of physical computers which is expensive and infeasible.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133401257","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 the increased use of encryption in business, key recovery has emerged as a critical issue to users. As encryption is deployed to protect files and network communications, users must include safeguards that prevent the inadvertent loss of data and use of the network for malicious intent. This paper explains what key recovery is, presents a refined practical model of a key recovery scheme and describes a new key recovery scheme compliant with this model. A novel feature of this key recovery scheme is that it is resistant to online guessing attack. Most of key recovery schemes used today are able to detect online guessing attack but not able to prevent it. Consequently, users face the problem of denial of service which occurs when key recovery server shuts down the service to legitimate users though temporarily as a security measure. Key recovery server also, often ask users to change password which was attacked causing further inconvenience. So, a security solution Captcha is employed in this new key recovery scheme to make it secure against online guessing attack.
{"title":"A key recovery scheme","authors":"S. Aggarwal","doi":"10.1145/2516775.2516781","DOIUrl":"https://doi.org/10.1145/2516775.2516781","url":null,"abstract":"With the increased use of encryption in business, key recovery has emerged as a critical issue to users. As encryption is deployed to protect files and network communications, users must include safeguards that prevent the inadvertent loss of data and use of the network for malicious intent. This paper explains what key recovery is, presents a refined practical model of a key recovery scheme and describes a new key recovery scheme compliant with this model. A novel feature of this key recovery scheme is that it is resistant to online guessing attack. Most of key recovery schemes used today are able to detect online guessing attack but not able to prevent it. Consequently, users face the problem of denial of service which occurs when key recovery server shuts down the service to legitimate users though temporarily as a security measure. Key recovery server also, often ask users to change password which was attacked causing further inconvenience. So, a security solution Captcha is employed in this new key recovery scheme to make it secure against online guessing attack.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131765660","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}