{"title":"Adaptive semi supervised opinion classifier with forgetting mechanism","authors":"Max Zimmermann, Eirini Ntoutsi, M. Spiliopoulou","doi":"10.1145/2554850.2555039","DOIUrl":"https://doi.org/10.1145/2554850.2555039","url":null,"abstract":"Opinion stream classification methods face the challenge of learning with a limited amount of labeled data: inspecting and labeling opinions is a tedious task, so systems analyzing opinions must devise mechanisms that label the arriving stream of opinionated documents with minimal human intervention. We propose an opinion stream classifier that only uses a seed of labeled documents as input and thereafter adapts itself, as it reads documents with unknown labels. Since the stream of opinions is subject to concept drift, we use two adaptation mechanisms: forward adaptation, where the classifier incorporates to the training set only those un-labeled documents that it considers informative enough in comparison to those seen thus far; and backward adaptation, where the classifier gradually forgets old documents by eliminating them from the model. We evaluate our method on opinionated tweets and show that it performs comparably or even better than a fully supervised baseline.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123263486","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}
D. A. D. Costa, U. Kulesza, E. Aranha, Roberta Coelho
{"title":"Unveiling developers contributions behind code commits: an exploratory study","authors":"D. A. D. Costa, U. Kulesza, E. Aranha, Roberta Coelho","doi":"10.1145/2554850.2555030","DOIUrl":"https://doi.org/10.1145/2554850.2555030","url":null,"abstract":"The process and activities of software development are very dynamic and diverse. For instance, source code has to be written, tested and revised, e-mails have to be sent, bugs have to be communicated, managed and fixed. As a consequence, the contributions of the developers are very diversified. This paper describes an empirical study whose goal was to assess and compare the contributions of the developers through software repository mining. Two medium-sized projects -- an open source and a commercial project -- were analyzed. Overall, 17,490 commits and 10,308 bugs reports were analyzed. In the first part of our study, we have classified the developers based on their contribution to the software repository in three groups -- core, active and peripheral developers. After that, we have collected a series of metrics -- code contribution, buggy commits and resolution of priority bugs -- for all the developers of the investigated projects. Finally, we have analyzed the collected metrics for the different developer groups. Our study findings show significant differences in the contribution provided by the developers groups considering the open-source and the commercial project.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121454300","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":"Session details: Volume I: Artificial intelligence & agents, distributed systems, and information systems: wireless communications and networking track","authors":"Dongkyun Kim, Wei Wang","doi":"10.1145/3255884","DOIUrl":"https://doi.org/10.1145/3255884","url":null,"abstract":"","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121130728","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":"Recommend-Me: recommending query regions for image search","authors":"T. Ngo, Sang Phan Le, Duy-Dinh Le, S. Satoh","doi":"10.1145/2554850.2555005","DOIUrl":"https://doi.org/10.1145/2554850.2555005","url":null,"abstract":"In typical image retrieval systems, to search for an object, users must specify a region bounding the object in an input image. There are situations that the queried region does not have any match with regions in images of the retrieved database. Finding a region in the input image to form a good query, which certainly returns relevant results, is a tedious task because users need to try all possible query regions without prior knowledge about what objects are really existed in the database. This paper presents a novel recommendation system, named Recommend-Me, which automatically recommends good query regions to users. To realize good query regions, their matches in the database must be found. A greedy solution based on evaluating all possible region pairs, given a pair is formed by one candidate region in the input image and one region in an image of the database, is infeasible. To avoid that, we propose a two-stage approach to significantly reduce the search space and the number of similarity evaluations. Specifically, we first use inverted index technique to quickly filter out a large number of images having insufficient similarities with the input image. We then propose and apply a novel branch-and-bound based algorithm to efficiently identify region pairs with highest scores. We demonstrate the scalability and performance of our system on two public datasets of over 100K and 1 million images.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"3 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113967718","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 novel double linear-cubic convolution interpolation for digital image scaling","authors":"H. Moon, Kyeong-Ri Ko, Juhyun Shin, S. Pan","doi":"10.1145/2554850.2559913","DOIUrl":"https://doi.org/10.1145/2554850.2559913","url":null,"abstract":"As the better high quality image is required for digital image scaling, longer processing time is required so the technology that can make the high quality image quickly is needed. We propose the double linear--cubic convolution interpolation creating the high quality image with low complexity. When compared to peak signal-to-noise ratio(PSNR) and computation time, the proposed interpolation provided better PSNR and low complexity than bicubic convolution interpolation.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131500099","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}
Mohammad Adibuzzaman, Sheikh Iqbal Ahamed, Richard R. Love
{"title":"A personalized model for monitoring vital signs using camera of the smart phone","authors":"Mohammad Adibuzzaman, Sheikh Iqbal Ahamed, Richard R. Love","doi":"10.1145/2554850.2555019","DOIUrl":"https://doi.org/10.1145/2554850.2555019","url":null,"abstract":"Smart phones with optical sensors have created new opportunities for low cost and remote monitoring of vital signs. In this paper, we present a novel approach to find heart rate, perfusion index and oxygen saturation using the video images captured by the camera of the smart phones with mathematical models. We use a technique called principal component analysis (PCA) to find the band that contain most plethysmographic information. Also, we showed a personalized regression model works best for accurately detecting perfusion index and oxygen saturation. Our model has high accuracy of the physiological parameters compared to the traditional pulse oxymeter. Also, an important relationship between frame rate for image capture, minimum peak to peak distance in the pulse wave form and accuracy has been established. We showed that there is an optimal value for minimum peak to peak distance for detecting heart rate accurately. Moreover, we present the evaluation of our personalized models.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131628267","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":"WSN-based flutter control application for aircraft wings structural health monitoring","authors":"Dhouha Krichen, W. Abdallah, N. Boudriga","doi":"10.1145/2554850.2554960","DOIUrl":"https://doi.org/10.1145/2554850.2554960","url":null,"abstract":"This paper presents the design of a wireless sensor network architecture suitable for structural health monitoring of air-crafts. The main objective is to improve airplane safety by detecting flutter phenomenon along the wings and communicating this information to the cockpit computer to react before vibration reaches resonance. Therefore, study of network deployment in specific types of wings is performed. Furthermore, in order to enhance the reactiveness of the flight control process, a medium access protocol based on game theory is developed. Performance evaluation work shows that the proposed game-based communication scheme enhances packets transmission efficiency in terms of loss ratio and average delay, and ensures fair access for all nodes.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127822327","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}
J. Liu, Zongnong Meng, Yan-Xing Hu, Yulin He, S. Shiu, Vincent W. S. Cho
{"title":"A hybrid algorithm for recommendation twitter peers","authors":"J. Liu, Zongnong Meng, Yan-Xing Hu, Yulin He, S. Shiu, Vincent W. S. Cho","doi":"10.1145/2554850.2555138","DOIUrl":"https://doi.org/10.1145/2554850.2555138","url":null,"abstract":"This paper presents a hybrid algorithm in the area of peer recommendation in Twitter. Due to the big data issue on Twitter, we define a filtering strategy to reduce the number of candidates who might be recommended to the target user. Meanwhile, we refine the content-based similarity and graph-based similarity algorithms proposed by other academics. Moreover, we define a user model and weighting formula to leverage these two algorithms. According to the similarity degree between the candidates and the target user, we recommend the top k most similar candidates to the target user as our focused peers. In order to evaluate the effectiveness of our proposed algorithms and other algorithms, we conduct a personalized survey and employ measurements like recall, precision and F1 metric. The evaluation results demonstrate that our hybrid algorithm is better than the pure content-based similarity algorithm and pure graph-based similarity algorithm.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128048600","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 catalog of security requirements patterns for the domain of cloud computing systems","authors":"Kristian Beckers, Isabelle Côté, Ludger Goeke","doi":"10.1145/2554850.2554921","DOIUrl":"https://doi.org/10.1145/2554850.2554921","url":null,"abstract":"Security and privacy concerns are essential in cloud computing scenarios, because cloud customers and end customers have to trust the cloud provider with their critical business data and even their IT infrastructure. In projects these are often addressed late in the software development life-cycle, because these are difficult to elicit in cloud scenarios, due to the large amount of stakeholders and technologies involved. We contribute a catalog of security and privacy requirement patterns that support software engineers in eliciting these requirements. As requirements patterns provide artifacts for re-using requirements. This paper shows how these requirements can be classified according to cloud security and privacy goals. Furthermore, we provide a structured method on how to elicit the right requirements for a given scenario. We mined these requirements patterns from existing security analysis of public organizations such as ENISA and the Cloud Security Alliance, from our practical experience in the cloud domain, and from our previous research in cloud security. We validate our requirements patterns in co-operation with industrial partners of the ClouDAT project.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128110559","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":"Automatic construction of timing diagrams from UML/MARTE models for real-time embedded software","authors":"Minh Chau Nguyen, Eunkyoung Jee, Jinho Choi, Doo-Hwan Bae","doi":"10.1145/2554850.2555011","DOIUrl":"https://doi.org/10.1145/2554850.2555011","url":null,"abstract":"Analysis of timing constraints is an essential part in developing real-time embedded software. Performing the timing analysis during the early development phases prevents timing violations and enhances software quality. In the development of real-time embedded software, UML timing diagrams can play a significant role since they can provide not only intuitive specifications for timing constraints, but also valuable information for verifying system requirements. However, as software complexity increases, modeling timing diagrams is becoming difficult and costly. We propose an automated construction approach of timing diagrams from UML sequence diagrams and state machine diagrams with MARTE annotations. The proposed approach enables developers of RTES to save time required for modeling timing diagrams and prevents making mistakes in construction of timing diagrams.","PeriodicalId":285655,"journal":{"name":"Proceedings of the 29th Annual ACM Symposium on Applied Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133127034","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}