Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888684
Haeng-Kon Kim
Software development projects tend to grow larger and more time consuming over time. Many companies have turned to software generation techniques to save time and costs. Software generation techniques take information from one area of the application, and make intelligent decisions to automatically generate a different area. Considerable achievements have been made in the areas of object-relational mappers to generate business objects from their relational database equivalents, and vice versa. There are also many products that can generate business objects and databases using the domain model of the application. Domain engineering is the foundation for emerging “product line” software development approaches and affects the maintainability, understandability, usability, and reusability characteristics of family of similar systems [1]. In this paper, we suggest a method that systematically defines, analyzes and designs a domain to enhance reusability effectively in Mobile Business Domain Modeling (MBDM) in AHMS(Adaptive Human Management Systems) requirements phase. For this, we extract information objectively that can be reused in a domain from the requirement analysis phase. We sustain and refine the information, and match them to artifacts of each phase in domain engineering. Through this method, reusable domain components and malleable domain architecture can be produced. In addition, we show the practical applicability and features of our approach.
随着时间的推移，软件开发项目趋向于变得更大、更耗时。许多公司已经转向软件生成技术，以节省时间和成本。软件生成技术从应用程序的一个区域获取信息，并做出智能决策以自动生成不同的区域。在对象-关系映射器领域已经取得了相当大的成就，可以从它们的关系数据库等效物生成业务对象，反之亦然。还有许多产品可以使用应用程序的域模型生成业务对象和数据库。领域工程是新兴的“产品线”软件开发方法的基础，影响着类似系统家族的可维护性、可理解性、可用性和可重用性特征[1]。本文提出了一种系统地定义、分析和设计领域的方法，以有效提高移动业务领域建模(MBDM)在AHMS(Adaptive Human Management Systems)需求阶段的可重用性。为此，我们从需求分析阶段客观地提取可以在域中重用的信息。我们维持和细化信息，并将它们与领域工程中每个阶段的工件相匹配。通过该方法，可以生成可重用的领域组件和具有延展性的领域体系结构。此外，我们还展示了我们的方法的实用性和特点。
{"title":"Effective Domain Modeling for Mobile Business AHMS (Adaptive Human Management Systems) requirements","authors":"Haeng-Kon Kim","doi":"10.1109/SNPD.2014.6888684","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888684","url":null,"abstract":"Software development projects tend to grow larger and more time consuming over time. Many companies have turned to software generation techniques to save time and costs. Software generation techniques take information from one area of the application, and make intelligent decisions to automatically generate a different area. Considerable achievements have been made in the areas of object-relational mappers to generate business objects from their relational database equivalents, and vice versa. There are also many products that can generate business objects and databases using the domain model of the application. Domain engineering is the foundation for emerging “product line” software development approaches and affects the maintainability, understandability, usability, and reusability characteristics of family of similar systems [1]. In this paper, we suggest a method that systematically defines, analyzes and designs a domain to enhance reusability effectively in Mobile Business Domain Modeling (MBDM) in AHMS(Adaptive Human Management Systems) requirements phase. For this, we extract information objectively that can be reused in a domain from the requirement analysis phase. We sustain and refine the information, and match them to artifacts of each phase in domain engineering. Through this method, reusable domain components and malleable domain architecture can be produced. In addition, we show the practical applicability and features of our approach.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"361 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124542867","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}
Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888734
Zhuang Heliang, F. Sugimoto, Chieko Kato, K. Tsuchida
Psychodiagnostic tests are used by hospitals, schools, companies, etc. Their effectiveness has been observed as tests that can reveal the internal and external status of the subject in detail. The data or the results of psychodiagnostic tests are very difficult to interpret by non-professionals. The resulting data is numerous, making it very difficult to read and interpret. The levels of understanding will vary depending on the cognitive ability and experience of the researcher or counselor interpreting the results. This study takes the results from psychodiagnostic tests and displays them as an easily understood 3D graph. The 3D graph is displayed as a spiral shape through `Processing'. The Uchida-Kraepelin psychodiagnostic test (U-K test) is used on over one million people each year by hospitals, schools, companies, etc. The purpose of this study is to use the 3D spiral to display the U-K test's calculation of workload and to emphasize the use of color on the 3D spiral visualization. A version with colors visible to colorblind people is used in conjunction with the 3D spiral visualization; the usage of color displays the U-K calculation of workload for non-colorblind people, while a colorblind-accessible version is used for colorblind people. The graphs produced in the study were given to professionals, non-professionals and colorblind people for evaluation.
{"title":"An application of 3D spiral visualization to the Uchida-Kraepelin psychodiagnostic test","authors":"Zhuang Heliang, F. Sugimoto, Chieko Kato, K. Tsuchida","doi":"10.1109/SNPD.2014.6888734","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888734","url":null,"abstract":"Psychodiagnostic tests are used by hospitals, schools, companies, etc. Their effectiveness has been observed as tests that can reveal the internal and external status of the subject in detail. The data or the results of psychodiagnostic tests are very difficult to interpret by non-professionals. The resulting data is numerous, making it very difficult to read and interpret. The levels of understanding will vary depending on the cognitive ability and experience of the researcher or counselor interpreting the results. This study takes the results from psychodiagnostic tests and displays them as an easily understood 3D graph. The 3D graph is displayed as a spiral shape through `Processing'. The Uchida-Kraepelin psychodiagnostic test (U-K test) is used on over one million people each year by hospitals, schools, companies, etc. The purpose of this study is to use the 3D spiral to display the U-K test's calculation of workload and to emphasize the use of color on the 3D spiral visualization. A version with colors visible to colorblind people is used in conjunction with the 3D spiral visualization; the usage of color displays the U-K calculation of workload for non-colorblind people, while a colorblind-accessible version is used for colorblind people. The graphs produced in the study were given to professionals, non-professionals and colorblind people for evaluation.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123230342","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}
Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888678
Mengxing Huang, Longfei Sun, Wencai Du
Aiming at the shortcomings of datasets sparsity and cold start in the traditional Item-based collaborative filtering recommendation algorithm, to improve the calculating accuracy of similarity and recommendation quality, taking attribute theory as theoretical basis, a collaborative filtering recommendation algorithm based on item attributes is proposed. Through analyzing the items, the attributes are listed and attribute weights are calculated, the similarity between items is calculated by taking advantage of attribute barycenter coordinate model and item attribute weights, and then produce recommendations forecasts. Finally, the experimental results show that the compared with traditional algorithm the proposed algorithm can effectively alleviate the user rating data sparsity problem and improve the quality of recommendation system.
{"title":"Collaborative filtering recommendation algorithm based on item attributes","authors":"Mengxing Huang, Longfei Sun, Wencai Du","doi":"10.1109/SNPD.2014.6888678","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888678","url":null,"abstract":"Aiming at the shortcomings of datasets sparsity and cold start in the traditional Item-based collaborative filtering recommendation algorithm, to improve the calculating accuracy of similarity and recommendation quality, taking attribute theory as theoretical basis, a collaborative filtering recommendation algorithm based on item attributes is proposed. Through analyzing the items, the attributes are listed and attribute weights are calculated, the similarity between items is calculated by taking advantage of attribute barycenter coordinate model and item attribute weights, and then produce recommendations forecasts. Finally, the experimental results show that the compared with traditional algorithm the proposed algorithm can effectively alleviate the user rating data sparsity problem and improve the quality of recommendation system.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116838899","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}
Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888681
C. A. Fowler, R. Hammell
In today's world there is an unprecedented volume of information available to organizations of all sizes; the “information overload” problem is well documented. This problem is especially challenging in the world of network intrusion detection. In this realm, we must not only deal with sifting through vast amounts of data, but we must also do it in a timely manner even when at times we are not sure what exactly it is we are trying to find. In the grander scheme of our work we intend to demonstrate that several different data mining algorithms reporting to an overarching layer will yield more accurate results than anyone data mining application (or algorithm) acting on its own. The system will operate in the domain of offline network and computer forensic data mining, under the guidance of a hybrid intelligence/multi-agent, systems based, for interpretation and interpolation of the findings. Toward that end, in this paper we build upon earlier work, undertaking the steps required for generating and preparing suitably minable data. Specifically, we are concerned with extracting as much useful data as possible out of a PCAP (Packet capture) for importing into Weka. While a PCAP may have thousands of field/value pairs, Wireshark and tshark's csv (comma separated value) output module only renders a small percentage of these fields and their values by default. We introduce a tool of our own making which enumerates every field (with or without a value) in any PCAP and generates an ARFF (Attribute-Relation File Format - Weka default). This code represents a component of a larger application we are designing (future work) which will ingest a PCAP, semi-autonomously preprocess it and feed it into Weka for processing/mining using several different algorithms.
{"title":"Converting PCAPs into Weka mineable data","authors":"C. A. Fowler, R. Hammell","doi":"10.1109/SNPD.2014.6888681","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888681","url":null,"abstract":"In today's world there is an unprecedented volume of information available to organizations of all sizes; the “information overload” problem is well documented. This problem is especially challenging in the world of network intrusion detection. In this realm, we must not only deal with sifting through vast amounts of data, but we must also do it in a timely manner even when at times we are not sure what exactly it is we are trying to find. In the grander scheme of our work we intend to demonstrate that several different data mining algorithms reporting to an overarching layer will yield more accurate results than anyone data mining application (or algorithm) acting on its own. The system will operate in the domain of offline network and computer forensic data mining, under the guidance of a hybrid intelligence/multi-agent, systems based, for interpretation and interpolation of the findings. Toward that end, in this paper we build upon earlier work, undertaking the steps required for generating and preparing suitably minable data. Specifically, we are concerned with extracting as much useful data as possible out of a PCAP (Packet capture) for importing into Weka. While a PCAP may have thousands of field/value pairs, Wireshark and tshark's csv (comma separated value) output module only renders a small percentage of these fields and their values by default. We introduce a tool of our own making which enumerates every field (with or without a value) in any PCAP and generates an ARFF (Attribute-Relation File Format - Weka default). This code represents a component of a larger application we are designing (future work) which will ingest a PCAP, semi-autonomously preprocess it and feed it into Weka for processing/mining using several different algorithms.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114579355","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}
Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888713
A. Martella, Roberto Paiano, Andrea Pandurino
Kraft [1] defines the User Experience - UX - as the set of sensations that the end user feels using a product. These sensations dominate so much the UX curve, to generate spikes or dips depending on how positive or negative such feelings are. The UX, therefore, represents a likelihood index of the user willing to continue to use a product. Ansuini [2] defines a legacy application - LA - as an information system of value inherited from the past. Nowadays, most of the companies make use of LAs, which on one side are characterized by high reliability and specialization, but on the other have an equally high degree of obsolescence, also with regard to the user interface. This paper introduces a framework for the UX reengineering of a LA, using the methodology Interactive Dialogue Model - IDM. The framework enables the definition and the implementation of the UX reengineering operations through a specific process, characterized by a series of steps. The reengineering process can take place in an almost fully automatic way, even if, in some phases, is still guaranteed the possibility to the designer to intervene on the intermediate diagrams. Given the reiteration of the reengineering process, it is necessary to historicize the changes made by the designer, and automatically applies them, when necessary, without any manual intervention. At this purpose, the implemented editor generates some extra runtime ATL - ATLAS Transformation Language - rules, in order to keep track of the customizations made on the model by the designer.
{"title":"A dialogue-based framework for the user experience reengineering of a legacy application","authors":"A. Martella, Roberto Paiano, Andrea Pandurino","doi":"10.1109/SNPD.2014.6888713","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888713","url":null,"abstract":"Kraft [1] defines the User Experience - UX - as the set of sensations that the end user feels using a product. These sensations dominate so much the UX curve, to generate spikes or dips depending on how positive or negative such feelings are. The UX, therefore, represents a likelihood index of the user willing to continue to use a product. Ansuini [2] defines a legacy application - LA - as an information system of value inherited from the past. Nowadays, most of the companies make use of LAs, which on one side are characterized by high reliability and specialization, but on the other have an equally high degree of obsolescence, also with regard to the user interface. This paper introduces a framework for the UX reengineering of a LA, using the methodology Interactive Dialogue Model - IDM. The framework enables the definition and the implementation of the UX reengineering operations through a specific process, characterized by a series of steps. The reengineering process can take place in an almost fully automatic way, even if, in some phases, is still guaranteed the possibility to the designer to intervene on the intermediate diagrams. Given the reiteration of the reengineering process, it is necessary to historicize the changes made by the designer, and automatically applies them, when necessary, without any manual intervention. At this purpose, the implemented editor generates some extra runtime ATL - ATLAS Transformation Language - rules, in order to keep track of the customizations made on the model by the designer.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":" 34","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120826471","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}
Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888714
Jinyu Kai, Huai-kou Miao, Honghao Gao
The language of Live Sequence Chart (LSC), a multi-modal extension of MSC, introduces the distinction between mandatory and possible on the level of the whole chart and for the chart elements. While the LSC still extend the MSC qualitatively, when it comes to capturing the quantitative behaviors, the deficiency emerges. As for the probabilistic systems, i.e., systems that exhibit probabilistic aspects, probabilistic properties are considered as the most important requirements and need to be captured quantitatively. To address this, we propose a requirements description language called pLSC. Supported by the measure theory and the probability theory, the language pLSC describes the interactions quantitatively to suit the probabilistic systems from two dimensions of probabilistic branches and three-stage events. The paper introduces the graphical and textual presentation of the pLSC.
{"title":"A requirements description language pLSC for probabilistic branches and three-stage events","authors":"Jinyu Kai, Huai-kou Miao, Honghao Gao","doi":"10.1109/SNPD.2014.6888714","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888714","url":null,"abstract":"The language of Live Sequence Chart (LSC), a multi-modal extension of MSC, introduces the distinction between mandatory and possible on the level of the whole chart and for the chart elements. While the LSC still extend the MSC qualitatively, when it comes to capturing the quantitative behaviors, the deficiency emerges. As for the probabilistic systems, i.e., systems that exhibit probabilistic aspects, probabilistic properties are considered as the most important requirements and need to be captured quantitatively. To address this, we propose a requirements description language called pLSC. Supported by the measure theory and the probability theory, the language pLSC describes the interactions quantitatively to suit the probabilistic systems from two dimensions of probabilistic branches and three-stage events. The paper introduces the graphical and textual presentation of the pLSC.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"59 20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115071923","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}
Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888687
Zhi Qiao, Shuwen Liang, Spencer Davis, Hai Jiang
In Attribute Based Encryption, a set of descriptive attributes is used as an identity to generate a secret key, as well as serving as the access structure that performs access control. It successfully integrates Encryption and Access Control and is ideal for sharing secrets among groups, especially in a Cloud environment. Most developed ABE schemes support key-policy or ciphertext-policy access control in addition to other features such as decentralized authority, efficient revocation and key delegation. This paper surveys mainstream papers, analyzes main features for desired ABE systems, and classifies them into different categories. With this high-level guidance, future researchers can treat these features as individual modules and select related ones to build their ABE systems on demand.
{"title":"Survey of attribute based encryption","authors":"Zhi Qiao, Shuwen Liang, Spencer Davis, Hai Jiang","doi":"10.1109/SNPD.2014.6888687","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888687","url":null,"abstract":"In Attribute Based Encryption, a set of descriptive attributes is used as an identity to generate a secret key, as well as serving as the access structure that performs access control. It successfully integrates Encryption and Access Control and is ideal for sharing secrets among groups, especially in a Cloud environment. Most developed ABE schemes support key-policy or ciphertext-policy access control in addition to other features such as decentralized authority, efficient revocation and key delegation. This paper surveys mainstream papers, analyzes main features for desired ABE systems, and classifies them into different categories. With this high-level guidance, future researchers can treat these features as individual modules and select related ones to build their ABE systems on demand.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122251610","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}
Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888704
Soumya Saha, L. McLauchlan
Energy efficiency in Wireless Sensor Networks (WSNs) is an important area of research for practical WSN deployment for extended periods of time. Appropriate topology control (TC), consisting of topology construction and maintenance, facilitates an energy aware and load balanced network while ensuring connectivity and coverage. In this research, the authors propose a novel load balanced TC protocol for connectivity - EAST (Energy Aware Spanning Tree). The EAST protocol's goal is to balance the load while reducing energy utilization for the network. The EAST protocol builds upon the Minimal Spanning Tree (MST) construction method. A Connected Dominating Set (CDS) is constructed while taking into account the energy level of each parent branch to form the communication backbone. The aim of this EAST protocol is to place as many nodes into sleep mode while maintaining the communication backbone of active nodes as determined based on an energy metric. Dynamic Global Topology Recreation (DGTRec) was implemented as the topology maintenance protocol which periodically builds a new communication backbone. The proposed EAST algorithm was simulated and compared with Simple Tree, Random Nearest Neighbor Tree (Random NNT) and Euclidian Minimal Spanning Tree (Euclidian MST). The simulation results demonstrate that the EAST algorithm improves load balancing and event coverage as compared to the other tested algorithms.
{"title":"An energy balanced topology construction protocol for Wireless Sensor Networks","authors":"Soumya Saha, L. McLauchlan","doi":"10.1109/SNPD.2014.6888704","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888704","url":null,"abstract":"Energy efficiency in Wireless Sensor Networks (WSNs) is an important area of research for practical WSN deployment for extended periods of time. Appropriate topology control (TC), consisting of topology construction and maintenance, facilitates an energy aware and load balanced network while ensuring connectivity and coverage. In this research, the authors propose a novel load balanced TC protocol for connectivity - EAST (Energy Aware Spanning Tree). The EAST protocol's goal is to balance the load while reducing energy utilization for the network. The EAST protocol builds upon the Minimal Spanning Tree (MST) construction method. A Connected Dominating Set (CDS) is constructed while taking into account the energy level of each parent branch to form the communication backbone. The aim of this EAST protocol is to place as many nodes into sleep mode while maintaining the communication backbone of active nodes as determined based on an energy metric. Dynamic Global Topology Recreation (DGTRec) was implemented as the topology maintenance protocol which periodically builds a new communication backbone. The proposed EAST algorithm was simulated and compared with Simple Tree, Random Nearest Neighbor Tree (Random NNT) and Euclidian Minimal Spanning Tree (Euclidian MST). The simulation results demonstrate that the EAST algorithm improves load balancing and event coverage as compared to the other tested algorithms.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127311685","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}
Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888682
Tofig Hasanov, Motoyuki Ozeki, N. Oka
The task of automated risk assessment is attracting significant attention in the light of the recent microloan popularity growth. The industry requires a real time method for the timely processing of the extensive number of applicants for short-term small loans. Owing to the vast number of applications, manual verification is not a viable option. In cooperation with a microloan company in Azerbaijan, we have researched automated risk assessment using crowdsourcing. The principal concept behind this approach is the fact that a significant amount of information relating to a particular applicant can be retrieved from the social networks. The suggested approach can be divided into three parts: First, applicant information is collected on social networks such as LinkedIn and Facebook. This can only occur with the applicant's permission. Then, this data is processed using a program that extracts the relevant information segments. Finally, these information segments are evaluated using crowdsourcing. We attempted to evaluate the information segments using social networks. To that end, we automatically posted requests on the social networks regarding certain information segments and evaluated the community response by counting “likes” and “shares”. For example, we posted the status, “Do you think that a person who has worked at ABC Company is more likely to repay a loan? Please “like” this post if you agree.” From the results, we were able to estimate public opinion. Once evaluated, each information segment was then given a weight factor that was optimized using available loan-repay test data provided to us by a company. We then tested the proposed system on a set of 400 applicants. Using a second crowdsourcing approach, we were able to confirm that the resulting solution provided a 92.5% correct assessment, with 6.45% false positives and 11.11% false negatives, with an assessment duration of 24 hours.
{"title":"Microcredit risk assessment using crowdsourcing and social networks","authors":"Tofig Hasanov, Motoyuki Ozeki, N. Oka","doi":"10.1109/SNPD.2014.6888682","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888682","url":null,"abstract":"The task of automated risk assessment is attracting significant attention in the light of the recent microloan popularity growth. The industry requires a real time method for the timely processing of the extensive number of applicants for short-term small loans. Owing to the vast number of applications, manual verification is not a viable option. In cooperation with a microloan company in Azerbaijan, we have researched automated risk assessment using crowdsourcing. The principal concept behind this approach is the fact that a significant amount of information relating to a particular applicant can be retrieved from the social networks. The suggested approach can be divided into three parts: First, applicant information is collected on social networks such as LinkedIn and Facebook. This can only occur with the applicant's permission. Then, this data is processed using a program that extracts the relevant information segments. Finally, these information segments are evaluated using crowdsourcing. We attempted to evaluate the information segments using social networks. To that end, we automatically posted requests on the social networks regarding certain information segments and evaluated the community response by counting “likes” and “shares”. For example, we posted the status, “Do you think that a person who has worked at ABC Company is more likely to repay a loan? Please “like” this post if you agree.” From the results, we were able to estimate public opinion. Once evaluated, each information segment was then given a weight factor that was optimized using available loan-repay test data provided to us by a company. We then tested the proposed system on a set of 400 applicants. Using a second crowdsourcing approach, we were able to confirm that the resulting solution provided a 92.5% correct assessment, with 6.45% false positives and 11.11% false negatives, with an assessment duration of 24 hours.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129001156","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}
Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888718
Tahir Jameel, Mengxiang Lin, He Li, Xiaomei Hou
This paper presents a novel technique to generate test images using segmental symbolic evaluation for testing of image processing applications. Images are multidimensional and diverse in nature, which leads to different challenges for the testing process. A technique is required to generate test images capable of finding program paths derived by image pixels. The proposed technique is based on symbolic execution which is extensively used for test data generation in recent years. In image processing applications, pixel operations such as averaging, convolution etc. are applied on a segment of input image pixels called window for a single iteration and repeated for the entire image. Our key idea is to imitate operations on pixel window using symbolic values rather than concrete ones to generate path constraints in the program under test. The path constraints generated for different paths are solved for concrete values using our simple SAT solver and the solutions are capable to guide program execution to the specific paths. The solutions of path constraints are used to generate synthetic test images for each identified path and the paths constraints which are not solvable for concrete pixel values are reported as infeasible paths. We have developed a tool IMSUITthat takes an image processing function as input and executes the program symbolically for the given pixels window to generate test images. Effectiveness of IMSUIT is tested on different modules of an optical character recognition system and the result shows that it can successfully create test images for each path of the program under test and capable of identifying infeasible paths.
{"title":"Test image generation using segmental symbolic evaluation for unit testing","authors":"Tahir Jameel, Mengxiang Lin, He Li, Xiaomei Hou","doi":"10.1109/SNPD.2014.6888718","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888718","url":null,"abstract":"This paper presents a novel technique to generate test images using segmental symbolic evaluation for testing of image processing applications. Images are multidimensional and diverse in nature, which leads to different challenges for the testing process. A technique is required to generate test images capable of finding program paths derived by image pixels. The proposed technique is based on symbolic execution which is extensively used for test data generation in recent years. In image processing applications, pixel operations such as averaging, convolution etc. are applied on a segment of input image pixels called window for a single iteration and repeated for the entire image. Our key idea is to imitate operations on pixel window using symbolic values rather than concrete ones to generate path constraints in the program under test. The path constraints generated for different paths are solved for concrete values using our simple SAT solver and the solutions are capable to guide program execution to the specific paths. The solutions of path constraints are used to generate synthetic test images for each identified path and the paths constraints which are not solvable for concrete pixel values are reported as infeasible paths. We have developed a tool IMSUITthat takes an image processing function as input and executes the program symbolically for the given pixels window to generate test images. Effectiveness of IMSUIT is tested on different modules of an optical character recognition system and the result shows that it can successfully create test images for each path of the program under test and capable of identifying infeasible paths.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129808277","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
扫码关注我们
求助内容：
应助结果提醒方式：