{"title":"Theoretical Analysis of a Soft Cut Discretization","authors":"Xuguang Chen","doi":"10.1145/3077286.3077572","DOIUrl":"https://doi.org/10.1145/3077286.3077572","url":null,"abstract":"Crisp discretization is widely-used and easy to implement, but it cannot work well on some situations, for example, when there is no clear boundary between attribute values or the attribute values are close to a cut point and possibly affected by random noise. A discretization method named Softcut was proposed to accommodate such situations and has been applied to face recognition. Softcut introduced a parameter τ that defined a symmetrical interval (0.5-τ, 0.5+τ) named uncertain interval. The attribute values in (0.5-τ, 0.5+τ) were undiscretizable. However, because the performance of Softcut may deteriorate in some situations, an extension named eSoftcut was proposed, in which the uncertain interval was defined by two parameters, (τj1, τj2). In this article, the theoretical aspects of eSoftcut including its definition, algorithm, and properties are introduced.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"26 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78459379","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":"Introducing Design Patterns and Best Practices in Unity","authors":"Nick Bucher","doi":"10.1145/3077286.3077322","DOIUrl":"https://doi.org/10.1145/3077286.3077322","url":null,"abstract":"The introduction of easy access game engines over the past several years is increasingly inspiring people to take up game development who may not have otherwise expressed an interest. Many of these independent game developers choose to use the Unity game engine due to its large asset store, wide variety of platforms to which it can port, as well as Unity's simple and inexpensive license. Using Unity-specific design patterns to inform design decisions can help developers increase productivity when designing a Unity project. The contribution of the work described in this paper is a set of new design patterns and best practices for beginning or intermediate level Unity developers. The implementation of these design patterns has the potential to reduce development time, allow for scalability, and reduce code complexity in many Unity projects, especially for beginning developers.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"27 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76380632","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 Comparison of Fuzzy Hashes: Evaluation, Guidelines, and Future Suggestions","authors":"Amanda Lee, T. Atkison","doi":"10.1145/3077286.3077289","DOIUrl":"https://doi.org/10.1145/3077286.3077289","url":null,"abstract":"Fuzzy hashes are gaining recognition in the realm of digital forensics as an alternative method of recognizing similar or nearly identical files. However, despite a high diversity of algorithms in existence, only SSDEEP and sdhash are widely used. This paper describes several viable fuzzy hashes not in wide use and compares them in detail, examining both security and non-security flaws. Finally, we develop guidelines to put these hashes to practical use, as well as suggesting improvements to several of the hashes.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"85 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80987229","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":"Dataset and Metrics for Adult Age-Progression Evaluation","authors":"Eric Patterson, Devin Simpson","doi":"10.1145/3077286.3077304","DOIUrl":"https://doi.org/10.1145/3077286.3077304","url":null,"abstract":"Automated age-progression has been a growing area of research, however quantitative measures and common datasets for evaluating methods are undeveloped. We present possible metrics and information about a dataset designed for such comparison, a collection of images that spans a wide range of aging for a variety of individuals. We present initial results of these metrics on the dataset and invite other researchers to collaborate to compare techniques.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"42 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87802072","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":"Empowering Requirements Elicitation for Populations with Special Needs by Using Virtual Reality","authors":"Aman Bhimani, P. Spoletini","doi":"10.1145/3077286.3078467","DOIUrl":"https://doi.org/10.1145/3077286.3078467","url":null,"abstract":"Requirements elicitation is the process of discovering requirements for a system by accessing available knowledge sources and communicating with stakeholders who have a direct or indirect influence on such requirements. Although requirements elicitation is by no means a new concept and many techniques are available for this activity (e.g., interviews, observations, focus groups, questionnaires), there is no silver bullet which guarantees collecting a set of complete and correct requirements. When software is being developed for a special needs population, individuals with mental or physical impairments, the task becomes even tougher. In this scenario, techniques other than the traditional ones must be used to support the elicitation process. To ease the task of collecting requirements from special needs populations, we propose the use of Virtual Reality (VR) environments as elicitation technique. Our research is not to propose that VR is the silver bullet for collection of requirements; however, VR can definitely complement other elicitation techniques to develop a complete set of requirements specification. The following proposal explains the benefits of VR, why it can be useful with elicitation activities, how it can benefit special needs population, and what it can contribute towards the requirements process.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87662818","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":"Evaluation of Firefox Browser Forensics Tools","authors":"S. Mahaju, T. Atkison","doi":"10.1145/3077286.3077310","DOIUrl":"https://doi.org/10.1145/3077286.3077310","url":null,"abstract":"Web browsers store web surfing data and history to facilitate the users ease of operation such as instant website recommendations or quicker access to previously visited sites. Since cyber-criminals or suspects, in general, may use the browser to search for any number of crime methods or visit different websites to collect information, this is a good source of electronic evidence used in lawsuits and other crime related investigations. For this reason, web browser forensics is an important field of Digital Forensics. It is crucial to know about the different web browsing analysis tools that are available and have a clear understanding of which tool would be more productive and suitable for which cases and situations. Therefore, this paper presents a survey of web browser forensics analysis tools for Firefox, as well as evaluates the performance of the tools and the system while the tool is being run. These tools are tested against different criteria such as time constraints, memory consumption, and availability. The evaluation result is varied with respect to different sets of criteria. Each of the tools in this survey had their own strengths and weaknesses. However, if one is to be chosen which could be suitable enough for all the jobs, then FoxAnalysis would be the choice.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81441613","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}
Yogesh S. Kale, Xiangfeng Dai, B. Meyer, Samantha E. Petrie, M. Bikdash, M. D. Topal
{"title":"An Extensible Recommendation System for Health Research","authors":"Yogesh S. Kale, Xiangfeng Dai, B. Meyer, Samantha E. Petrie, M. Bikdash, M. D. Topal","doi":"10.1145/3077286.3077296","DOIUrl":"https://doi.org/10.1145/3077286.3077296","url":null,"abstract":"A challenge for basic and clinical biomedical researchers is to determine the particular technologies that can play a role in their research. Core facilities house, centralize, and specialize in particular services and technologies important to biomedical research. At the University of North Carolina at Chapel Hill, over 70 core facilities are available for such use, many with multiple technologies and services. In this paper, we design an Extensible Recommendation System (ERS) to aid investigators in finding which core facilities may impact their research. Recommendation techniques are applied to enhance the process of recognition of technologies and collaborators in a modern biomedical research environment. The architecture of the system has two parts: a core foundation module and extensible module. The foundation module follows from a CMS framework called Plone that handles the basic functions like database queries, user login, etc. The extensible module has a few components such as search component, a recommendation component, etc. The extensible module is designed to be flexible, in that it can be extended by as many recommendation algorithms as we need. In this paper, we compare several recommender systems for biomedical core research facilities. Our simulation results show that the recommender system based on Graph-Theoretic performs best amongst few similar recommenders.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"137 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80390779","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":"An Artificial Neural Network-based Stock Trading System Using Technical Analysis and Big Data Framework","authors":"Omer Berat Sezer, A. Ozbayoglu, Erdogan Dogdu","doi":"10.1145/3077286.3077294","DOIUrl":"https://doi.org/10.1145/3077286.3077294","url":null,"abstract":"In this paper, a neural network-based stock price prediction and trading system using technical analysis indicators is presented. The model developed first converts the financial time series data into a series of buy-sell-hold trigger signals using the most commonly preferred technical analysis indicators. Then, a Multilayer Perceptron (MLP) artificial neural network (ANN) model is trained in the learning stage on the daily stock prices between 1997 and 2007 for all of the Dow30 stocks. Apache Spark big data framework is used in the training stage. The trained model is then tested with data from 2007 to 2017. The results indicate that by choosing the most appropriate technical indicators, the neural network model can achieve comparable results against the Buy and Hold strategy in most of the cases. Furthermore, fine tuning the technical indicators and/or optimization strategy can enhance the overall trading performance.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"131 ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91466875","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":"Removing Object Bouncing from Indoor Tracking Data","authors":"A. Baba","doi":"10.1145/3077286.3077568","DOIUrl":"https://doi.org/10.1145/3077286.3077568","url":null,"abstract":"Radio Frequency Identification (RFID) has evolved as a primary object tracking technology over the years. A Number of real world applications such as airport passenger baggage tracking have adapted RFID as a main technological tool for tracking and monitoring. However, the data generated by the RFID tracking contains errors. Therefore, it is important to remove such errors before data is used for any business processing. The primary focus of this paper is object bouncing problem, which happens when the object with attached RFID tag is detected by two or more RFID readers simultaneously or within a short period of time. Due to the bouncing, object appears to go back and forth between several locations in very short time, which is not realistically possible. To cater bouncing problem we exploit the reachability time constraints implied by the deployed readers in an indoor space. We evaluate the proposed work using the synthetically generated RFID data. The results shows that the approach is effective and efficient.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"261 2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77537373","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":"Streaming Video Identification for Caching and Sharing","authors":"P. Subedi, X. Hong","doi":"10.1145/3077286.3077570","DOIUrl":"https://doi.org/10.1145/3077286.3077570","url":null,"abstract":"Video streaming is the major network traffic in the present days. Thus understanding the video traffic and optimizing the video traffic can help controlling the bandwidth utilization. In this paper, we present a method to identify videos of common interest so that bandwidth-saving methods can be developed. The paper introduces a way to recreate the initial part of the video, from which frames are extracted. These frames that come from various different video traces are compared to finalize whether two different traces of video traffic belong to the same video content or not. The analyzed result is then utilized by the router to manage the caching and sharing of these contents for multiple users in a LAN. Further, multicast is proposed to be used inside the LAN.","PeriodicalId":91384,"journal":{"name":"Proceedings of the 2014 ACM Southeast Regional Conference","volume":"29 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81573679","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}