{"title":"A smart display component model for embedded systems modeling and simulation","authors":"Mohamed Feredj","doi":"10.1109/SAI.2016.7556020","DOIUrl":"https://doi.org/10.1109/SAI.2016.7556020","url":null,"abstract":"Embedded systems are in continuous interaction with their environment and mix several technical domains. So, they are heterogeneous and very complex. The tools and the platforms of the embedded systems modeling must make tasks of the designer easy by proposing new component models and new modeling approaches. The process of embedded systems modeling ends with a validation step. The validation by simulation must use display components to show the output data produced by the model of system. However, since the output data are heterogeneous and they have different semantics (e. g. continuous semantic, discrete semantic, data flow semantic, etc.), we must use for each output data type a display specific component. Consequently, this increases the number of display specific components and annoys the designer and reduces the reusability. In this paper, we propose a smart display component that has the capability to display any output data type. It is able to adapt its behavior and structure to the semantic of output data type. It is not a competitor to display specific components but it resolves their weakness and it simplifies the complexity of their use. Also, it allows the reusability of the display components in embedded systems modeling and simulation. Its design is based on the application of the separation of concerns principle to the display specific components. Indeed, the designer uses a single display component to display any output data type of its systems instead of use several display specific components. We also present an implementation and a validation of the smart display component in the Ptolemy II platform.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"1678 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129352064","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":"Adaptation of harmony search algorithm for DNA fragment assembly problem","authors":"E. D. Ulker","doi":"10.1109/SAI.2016.7555973","DOIUrl":"https://doi.org/10.1109/SAI.2016.7555973","url":null,"abstract":"DNA Fragment Assembly Problem (FAP) is an attractive research topic in the field of bioinformatics. The aim of DNA FAP is to generate DNA sequences as close to the original sequence among the given fragments. Various metaheuristic algorithms are applied to DNA Fragment Assembly Problem to find the best matching scores as well as the optimum fragment orders to obtain the original DNA sequence. In this paper, Harmony Search (HS) algorithm is adapted to DNA FAP by using Smallest Position Value (SPV) rule. SPV is used to convert continuous harmonics to the discrete orders of fragments. The algorithm is tested on three real DNA data sets to ensure its efficiency on FAP. Experimental results show that HS provides good matching scores and can be a good candidate for DNA fragment assembly problems.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122055400","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. Quezada-Sarmiento, Liliana Enciso-Quispe, J. Garbajosa, H. Washizaki
{"title":"Curricular design based in bodies of knowledge: Engineering education for the innovation and the industry","authors":"P. Quezada-Sarmiento, Liliana Enciso-Quispe, J. Garbajosa, H. Washizaki","doi":"10.1109/SAI.2016.7556077","DOIUrl":"https://doi.org/10.1109/SAI.2016.7556077","url":null,"abstract":"Bodies of Knowledge (BOK), contain the relevant knowledge for a disciplines as example Software Engineering (SE), System Information (SI), Information Technology (IT), Computer Science (CS), Medicine, Economics, and others areas of knowledge. BOK describes relevant knowledge for a discipline, and will need show the consensus in the Knowledge Areas (KA), and related disciplines. The development of this consensus is a prerequisite to the adoption of coherent skills development in the education context, and continuing professional programs both in public and private organizations. In this context a systematic mapping study (SMS), it was performed to evaluate quantity and types of primary studies in an area of interest. SMS will be used as the research method within this research. The research method proposed will allow to sort and classify the information referent to the topics of this research. This paper is an attempt to analyze existing proposals on BOK contents, structure, and make a proposal what the kind of contents it should have, and how it should be structured so that this consensus among all parties can be described and best achieved. In the same way the relevance, and useful of the BOK in the curricular design for the innovation, and the industry context is present.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123660191","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":"Action selection through affective states modelling","authors":"C. Headleand, W. Teahan","doi":"10.1109/SAI.2016.7556024","DOIUrl":"https://doi.org/10.1109/SAI.2016.7556024","url":null,"abstract":"We introduce an action selection framework for the advanced behavioural animation of virtual creatures. In modern creative media, the behavioural animation of characters which act in a believable fashion is an ongoing challenge. Traditional action selection approaches which attempt to make an agent act rationally often fall short of the believability required for the modern consumer. Often the most believable action is not the most rational one, and our judgement of an agent's behaviour may also be based on the perception of its personality. Our approach, Affective Spaces Modelling, addresses these issues by creating a multi-dimensional environment constructed of aspect dimensions, with each aspect dimension representing a linear scale of a single component of the agent's internal state. Affective states can then be modelled by placing them in a single point in this environment. As the agent's state changes within the affective state space, different affects trigger appropriate actions. We demonstrate through a case study how the technique can be used to simulate different types of agent behaviour, operating both individually and as part of a group. Our case studies focus on groups of agents, allowing for the direct comparison of different personalities and examples of behavioural phenomena.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123839669","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":"Understanding sporting fandom in social media: A UK perspective of professional Rugby League clubs","authors":"D. Ineson, Mark Anderson","doi":"10.1109/SAI.2016.7556137","DOIUrl":"https://doi.org/10.1109/SAI.2016.7556137","url":null,"abstract":"The purpose of this research is to examine the ability of Social Networking Technologies in relation to its capability to generate revenue for Rugby League (RL) organisations within the United Kingdom. Social Networking Technologies have blossomed over the past decade, as they have become an integral part of their everyday lives. Organisations are now viewing this technology as a new marketing method to push content and promotions towards the target market, and sporting organisations are no expectation. This research concentrates on how these RL organisations are harnessing similar technologies with a particular focus on Twitter in order to develop a dedicated fandom for their organisation, and whether fandoms can be harnessed to increase revenue for the club. This research used a mixed method approach to gather a wide source of data from both the clubs and the fans perspective. The data was collected using face-to-face interviews with the social networking managers at professional RL organisations, as well as electronic questionnaires to get the fans perception of the content that is being generated. Furthermore, the Twitter feeds of these RL organisations were also examined to gain further insight into how conversations between the team and the fans were being generated online. The results show that RL teams, which were developing fandom on Twitter, perceive it to be an effective tool to increase revenue for the organisation. However, they indicate that it is important to not overuse Social Networking Sites (SNS) as a means to generate sales, as their sites should be primarily used to communicate with fans of the clubs. This is due to other key business sectors provide larger revenue percentages in comparison to SNS, such as increased media coverage and sponsorship deals.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124855651","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":"Mobile web application with shortest path finder","authors":"Wook-Sung Yoo, Lina Kloub","doi":"10.1109/SAI.2016.7556094","DOIUrl":"https://doi.org/10.1109/SAI.2016.7556094","url":null,"abstract":"The location tracking functionality of modern mobile devices provides an unprecedented opportunity to the individual's mobility in daily life. With the fast growing popularity of the smart phone, individuals have easy access to the handy GPS navigation system through various GPS mobile apps. The Traveler's Sidekick is a mobile GPS application with a built-in Shortest Path Finder for travelers visiting multiple locations. The application was initially targeted on realtors. A significant portion of a realtor's expense is the gas cost that accumulates while visiting various real estate locations. Most realtors manually pick a route to visit multiple locations and a wrong route may increase the travel time and eventually gas expense. Any app that provides a better route with even 10% gas saving will be of great financial benefit to the realtors. To resolve this problem, Traveler's Sidekick, a mobile GPS application with shortest path finder, was developed as a mobile web application using HTML5, CSS, and jQuery in .NET environment integrated with SQL database and Google Map service. A newly developed Two Stage Divide and Conquer (TSDC) algorithm was utilized to determine the shortest path. Experimental results are presented and future enhancement is discussed.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"653 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129931576","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":"Soft robotic finger fabrication with PDMS and IPMC actuator for gripping","authors":"Srijan Bhattacharya, B. Bepari, S. Bhaumik","doi":"10.1109/SAI.2016.7556013","DOIUrl":"https://doi.org/10.1109/SAI.2016.7556013","url":null,"abstract":"Scientific community has become very contemplative about the new breakthrough of micro scale actuations in engineering and biomedical applications, such micro systems with micro actuators are becoming very useful for handling and manipulating micro objects including biological cells. For the development of such devices, it is important to select proper materials, actuators and sensing elements which play an important role in designing micro gripper. In the present discussion a survey of micro gripping is highlighted. At the same time a unique approach of micro finger design with Polydimethyl Siloxane (PDMS) is reported with experimental results. Those results are shown while the Ionic Polymer Metal Composite (IPMC) actuators are excited with mechanical and electrical stimuli.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120862250","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":"Statistical approach towards malware classification and detection","authors":"Vida Ghanaei, C. Iliopoulos, R. Overill","doi":"10.1109/SAI.2016.7556114","DOIUrl":"https://doi.org/10.1109/SAI.2016.7556114","url":null,"abstract":"Anti-virus companies receive extensive quantities of malware variants daily; therefore, it is essential to automatically classify them into their corresponding malware family. Here, we apply an efficient statistical approach to identify and render critical malicious patterns into malware families, which are essential elements of automated classification of known and unknown malware variants in large quantities. Critical malicious patterns are the most frequent basic blocks, which are present most often in one specific malware family, and comparatively less in all other malware families. By computing the distribution frequency of each distinct basic block residing in all the malware families, the importance of being a potential representative of a critical malicious pattern for a specific malware family is measured. This value is carefully computed by considering the population of each malware family, and the distribution frequency ratio of every distinct basic block among the different malware families. The results show that known and unknown malware variants can be effectively and accurately classified into their related malware family using this approach.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123118748","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":"Camera self-calibration with varying intrinsic parameters and arc of the circle","authors":"A. El Abderrahmani, K. Satori","doi":"10.1109/SAI.2016.7556149","DOIUrl":"https://doi.org/10.1109/SAI.2016.7556149","url":null,"abstract":"This paper presents a robust and important method for the self-calibration of a numerical camera using a tridimensional unknown scene. The particularity of our technique resides in the use of an arc of the circle and the localization of some of the matching points detected in the use of an ensemble of images in order to define in an automated way the intrinsic parameters, which are unknown and variable. Our approach is based on minimizing the constraints of the self-calibration of the camera with the projection of the two extremities of chord of each pair of images. It is obvious that in order to produce good results from the simulations we have made the choice of the right programming language would be of prime importance. Our main criteria were simplicity, stability and performing algorithms. The results have proven that the selection of the aforementioned criteria was successful.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131470591","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. Chua, Snehasish Banerjee, Ang Han Guan, Liew Jun Xian, Peng Peng
{"title":"Intention to trust and share health-related online rumors: Studying the role of risk propensity","authors":"A. Chua, Snehasish Banerjee, Ang Han Guan, Liew Jun Xian, Peng Peng","doi":"10.1109/SAI.2016.7556120","DOIUrl":"https://doi.org/10.1109/SAI.2016.7556120","url":null,"abstract":"As the Internet has become a popular avenue for users to seek health-related information, the prevalence of online rumors represents a growing concern. If users trust and share bogus health information on the Internet, repurcussions could be serious. Therefore, this paper examines how users' intention to trust and share rumors vary as a function of three factors: length, sentiment of rumors, and presence of pictures. The individual difference of risk propensity is also taken into account. Data were collected from 110 participants using a 2 (length of rumors: short or long) × 2 (rumor sentiments: positive or negative) × 2 (presence of pictures: present or absent) within-participants web-based experiment. Results indicate that long rumors as well as those without pictures were likely to be trusted and shared regardless of individuals' risk propensity. However, the relationship between rumor sentiment and intention was not always consistent between risk-averse and risk-seeking individuals. Implications of the results for both theory and practice are highlighted.","PeriodicalId":219896,"journal":{"name":"2016 SAI Computing Conference (SAI)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126637540","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}