Pub Date : 2014-09-01DOI: 10.1109/SNPD.2014.6888731
Jun Lin, Han Yu, Zhiqi Shen, C. Miao
Agile methodologies use user stories to capture software requirements. This often results in team members over emphasizing their understanding of the goals, without proper incorporation of goals from other stakeholders or customers. Existing UML or other goal oriented modeling methods tend to be overly complex for non-technical stakeholders to properly express their goals and communicate them to the agile team. In this paper, we propose a light weight Goal Net based method to model goal requirements in agile software development process to address this problem. It can be used to decompose complex processes into phased goals, and model low level user stories to high level hierarchy goal structures. Our preliminary analysis and studies in educational software engineering contexts show that it can improve agile team's group awareness to project goals and, thus, improve team productivity and artifact quality. The proposed approach was evaluated in university level agile software engineering projects. It has achieved an improvement of over 50 percentage points in terms of the proportion of high quality user stories generated by students compared to the standard user story template used in Scrum.
{"title":"Using goal net to model user stories in agile software development","authors":"Jun Lin, Han Yu, Zhiqi Shen, C. Miao","doi":"10.1109/SNPD.2014.6888731","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888731","url":null,"abstract":"Agile methodologies use user stories to capture software requirements. This often results in team members over emphasizing their understanding of the goals, without proper incorporation of goals from other stakeholders or customers. Existing UML or other goal oriented modeling methods tend to be overly complex for non-technical stakeholders to properly express their goals and communicate them to the agile team. In this paper, we propose a light weight Goal Net based method to model goal requirements in agile software development process to address this problem. It can be used to decompose complex processes into phased goals, and model low level user stories to high level hierarchy goal structures. Our preliminary analysis and studies in educational software engineering contexts show that it can improve agile team's group awareness to project goals and, thus, improve team productivity and artifact quality. The proposed approach was evaluated in university level agile software engineering projects. It has achieved an improvement of over 50 percentage points in terms of the proportion of high quality user stories generated by students compared to the standard user story template used in Scrum.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"54 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":"116729471","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.6888703
Hao Qian, Daniel Andresen
Mobile device users consistently desire faster results and longer battery life, which is frequently accomplished by of-floading computation to cloud-based servers. However, in common cases (Internet connectivity slow/unavailable, priva-cy/security issues), users have multiple devices with heterogeneous battery and computational capabilities independent of the cloud. Android provides mechanisms for creating mobile code, but lacks a native scheduling mechanism for determining where code should be executed. In this paper we present the results of an investigation into adding sophisticated scheduling capabilities to Android apps, which provides scheduling balancing energy and performance across networked mobile devices. Jade monitors and adapts to workload variation, communication costs, and energy status in a distributed ad-hoc network of Android mobile devices for supporting distributed computation. We show how the two goals can be integrated, and present several algorithms indicating a major advantage (over 75% improvement in energy use) can be achieved through the use of dynamic scheduling information for remote computational devices. We provide a detailed discussion of our system architecture and implementation, and briefly summarize the experimental results which have been achieved.
{"title":"Jade: An efficient energy-aware computation offloading system with heterogeneous network interface bonding for ad-hoc networked mobile devices","authors":"Hao Qian, Daniel Andresen","doi":"10.1109/SNPD.2014.6888703","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888703","url":null,"abstract":"Mobile device users consistently desire faster results and longer battery life, which is frequently accomplished by of-floading computation to cloud-based servers. However, in common cases (Internet connectivity slow/unavailable, priva-cy/security issues), users have multiple devices with heterogeneous battery and computational capabilities independent of the cloud. Android provides mechanisms for creating mobile code, but lacks a native scheduling mechanism for determining where code should be executed. In this paper we present the results of an investigation into adding sophisticated scheduling capabilities to Android apps, which provides scheduling balancing energy and performance across networked mobile devices. Jade monitors and adapts to workload variation, communication costs, and energy status in a distributed ad-hoc network of Android mobile devices for supporting distributed computation. We show how the two goals can be integrated, and present several algorithms indicating a major advantage (over 75% improvement in energy use) can be achieved through the use of dynamic scheduling information for remote computational devices. We provide a detailed discussion of our system architecture and implementation, and briefly summarize the experimental results which have been achieved.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"85 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":"128374670","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.6888725
Hiroki Takatsuka, S. Saiki, S. Matsumoto, Masahide Nakamura
With the spread of Machine-to-Machine (M2M) systems and cloud services, various kinds of data are available through Web services. A context-aware service recognizes a real-world context from such data and behaves autonomously based on the context. However, it has been challenging to manage contexts and services defined on the heterogeneous and distributed Web services. In this paper, we propose a framework, called RuCAS, which systematically creates and manages context-aware service using various Web services (e.g. information services, sensor services, networked appliances, etc.). The framework describes every context-aware service by an ECA (Event-Condition-Action) rule. For this, an event is a context triggering the service, a condition is a set of contexts to be satisfied for execution, and the action is a set of Web services to be executed by the service. Thus, every context-aware service is simply managed in a uniform manner. Since the RuCAS is published as a Web service, it is easy for various applications to reuse and integrate created contexts and services. As a case study, RuCAS is applied to creating context-aware services in a real home network system.
{"title":"A rule-based framework for managing context-aware services based on heterogeneous and distributed Web services","authors":"Hiroki Takatsuka, S. Saiki, S. Matsumoto, Masahide Nakamura","doi":"10.1109/SNPD.2014.6888725","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888725","url":null,"abstract":"With the spread of Machine-to-Machine (M2M) systems and cloud services, various kinds of data are available through Web services. A context-aware service recognizes a real-world context from such data and behaves autonomously based on the context. However, it has been challenging to manage contexts and services defined on the heterogeneous and distributed Web services. In this paper, we propose a framework, called RuCAS, which systematically creates and manages context-aware service using various Web services (e.g. information services, sensor services, networked appliances, etc.). The framework describes every context-aware service by an ECA (Event-Condition-Action) rule. For this, an event is a context triggering the service, a condition is a set of contexts to be satisfied for execution, and the action is a set of Web services to be executed by the service. Thus, every context-aware service is simply managed in a uniform manner. Since the RuCAS is published as a Web service, it is easy for various applications to reuse and integrate created contexts and services. As a case study, RuCAS is applied to creating context-aware services in a real home network system.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"111 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":"127689419","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.6888699
Sidney C. Smith, R. Hammell, Travis W. Parker, L. Marvel
In this paper we review the problem of packet loss as it pertains to Network Intrusion Detection, seeking to answer two fundamental research questions which are stepping stones towards building a model that can be used to predict the rate of alert loss based upon the rate of packet loss. The first question deals with how the packet loss rate affects the sensor alert rate, and the second considers how the network traffic composition affects the results of the first question. Potential places where packet loss may occur are examined by dividing the problem into network, host, and sensor based packets loss. We posit theories about how packet loss may present itself and develop the Packet Dropper that induces packet loss into a dataset. Drop rates ranging from 0% to 100% are applied to four different data sets and the resulting abridged data sets are analyzed with Snort to collect alert loss rate. Conclusions are drawn about the importance of the distribution of packet loss and the effect of the network traffic composition.
{"title":"A theoretical exploration of the impact of packet loss on network intrusion detection","authors":"Sidney C. Smith, R. Hammell, Travis W. Parker, L. Marvel","doi":"10.1109/SNPD.2014.6888699","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888699","url":null,"abstract":"In this paper we review the problem of packet loss as it pertains to Network Intrusion Detection, seeking to answer two fundamental research questions which are stepping stones towards building a model that can be used to predict the rate of alert loss based upon the rate of packet loss. The first question deals with how the packet loss rate affects the sensor alert rate, and the second considers how the network traffic composition affects the results of the first question. Potential places where packet loss may occur are examined by dividing the problem into network, host, and sensor based packets loss. We posit theories about how packet loss may present itself and develop the Packet Dropper that induces packet loss into a dataset. Drop rates ranging from 0% to 100% are applied to four different data sets and the resulting abridged data sets are analyzed with Snort to collect alert loss rate. Conclusions are drawn about the importance of the distribution of packet loss and the effect of the network traffic composition.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"2014 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":"129774866","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.6888691
Carl Lee, Chin-I Cheng, A. Zeleke
Qualitative research methodology is commonly used for education research. The main advantage is that it is capable of gaining more rigorous insights of research objectives when compared with quantitative research. However, due to the extensive time required, the sample size for a qualitative research is usually very small, and can be as small as two subjects. As a consequence, the results are difficult to be inferred to the population. Text mining methodology is a modern technique to analyze text data. It has been successfully applied to a wide variety of business problems. However, it has not yet been applied as a tool for qualitative research in education. In this study, we attempt to apply text mining method to analyze students' written reasons of a question related to the concept of variation. Four sections of an introductory statistics course participated in the study (n = 218). The results suggest text mining method can be an alternative, if applied appropriately. The strength and weakness of using text mining for qualitative research are investigated.
{"title":"Can text mining technique be used as an alternative tool for qualitative research in education?","authors":"Carl Lee, Chin-I Cheng, A. Zeleke","doi":"10.1109/SNPD.2014.6888691","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888691","url":null,"abstract":"Qualitative research methodology is commonly used for education research. The main advantage is that it is capable of gaining more rigorous insights of research objectives when compared with quantitative research. However, due to the extensive time required, the sample size for a qualitative research is usually very small, and can be as small as two subjects. As a consequence, the results are difficult to be inferred to the population. Text mining methodology is a modern technique to analyze text data. It has been successfully applied to a wide variety of business problems. However, it has not yet been applied as a tool for qualitative research in education. In this study, we attempt to apply text mining method to analyze students' written reasons of a question related to the concept of variation. Four sections of an introductory statistics course participated in the study (n = 218). The results suggest text mining method can be an alternative, if applied appropriately. The strength and weakness of using text mining for qualitative research are investigated.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"53 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":"132873041","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.6888712
Donghwoon Kwon, R. Hammell
Previous research proposed a framework for the objective and accurate estimation of software project schedules in the proposal preparation stage of large-sized software development projects. A probabilistic approach was used to take into account the uncertainty inherent in the early stage of such projects. This work illustrates how to use the framework in the later planning stage when additional, more detailed information is available via the design documentation. The process continues to use the International Function Point User Group (IFPUG) function point analysis and the International Software Benchmarking Standards Group (ISBSG) regression equations to calculate project size and resource effort, but substitutes the more accurate adjusted function point information for the previously used unadjusted function point data. The use of the proposed framework in the planning stage provides for the reassessment, verification and/or refinement of the estimated schedule produced in the early stage.
{"title":"Refinement/verification of early stage probabilistic software project schedules in the planning stage","authors":"Donghwoon Kwon, R. Hammell","doi":"10.1109/SNPD.2014.6888712","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888712","url":null,"abstract":"Previous research proposed a framework for the objective and accurate estimation of software project schedules in the proposal preparation stage of large-sized software development projects. A probabilistic approach was used to take into account the uncertainty inherent in the early stage of such projects. This work illustrates how to use the framework in the later planning stage when additional, more detailed information is available via the design documentation. The process continues to use the International Function Point User Group (IFPUG) function point analysis and the International Software Benchmarking Standards Group (ISBSG) regression equations to calculate project size and resource effort, but substitutes the more accurate adjusted function point information for the previously used unadjusted function point data. The use of the proposed framework in the planning stage provides for the reassessment, verification and/or refinement of the estimated schedule produced in the early stage.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"81 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":"134593663","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.6888744
Xiaolin Wang, Hong-wei Zeng
Test case prioritization technology is to sort the test cases before the software testing designed to improve test efficiency. This paper presents a dynamic test case prioritization technique based on multi-objective. It integrates several traditional single-objective technologies so that makes it more flexible. This technology, from five dimensions, calculates prioritization values of test cases separately. Then a weighted sum is made to the values and it sorts the test cases according to the values. The results return to the storage in order to dynamically adjust the sort of test cases. This technology not only meets the high demands of regression testing, but also ensures the high efficiency of the test results.
{"title":"Dynamic test case prioritization based on multi-objective","authors":"Xiaolin Wang, Hong-wei Zeng","doi":"10.1109/SNPD.2014.6888744","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888744","url":null,"abstract":"Test case prioritization technology is to sort the test cases before the software testing designed to improve test efficiency. This paper presents a dynamic test case prioritization technique based on multi-objective. It integrates several traditional single-objective technologies so that makes it more flexible. This technology, from five dimensions, calculates prioritization values of test cases separately. Then a weighted sum is made to the values and it sorts the test cases according to the values. The results return to the storage in order to dynamically adjust the sort of test cases. This technology not only meets the high demands of regression testing, but also ensures the high efficiency of the test results.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"4 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":"127459894","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.6888689
M. Yoshikawa, Hikaru Goto, K. Asahi
The advanced encryption standard (AES) has been sufficiently studied to confirm that its decryption is computationally impossible. However, its vulnerability against fault analysis attacks has been pointed out in recent years. To verify the vulnerability of electronic devices in the future, into which cryptographic circuits have been incorporated, fault Analysis attacks must be thoroughly studied. The present study proposes a new fault analysis attack method which utilizes the tendency of an operation error due to a glitch. The present study also verifies the validity of the proposed method by performing evaluation experiments using FPGA.
{"title":"Error value driven fault analysis attack","authors":"M. Yoshikawa, Hikaru Goto, K. Asahi","doi":"10.1109/SNPD.2014.6888689","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888689","url":null,"abstract":"The advanced encryption standard (AES) has been sufficiently studied to confirm that its decryption is computationally impossible. However, its vulnerability against fault analysis attacks has been pointed out in recent years. To verify the vulnerability of electronic devices in the future, into which cryptographic circuits have been incorporated, fault Analysis attacks must be thoroughly studied. The present study proposes a new fault analysis attack method which utilizes the tendency of an operation error due to a glitch. The present study also verifies the validity of the proposed method by performing evaluation experiments using FPGA.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"26 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":"125854703","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.6888742
K. Fukushima, N. Shirahama
The main purpose of this study is to develop the inexpensive eye-gaze input interface for disabled people. The eye-gaze inputting can suit many situations, and it has little load for user because it is non-contact input interface. Many projects about the eye-gaze have been studied recently. Most of the productions of eye-gaze inputting use infra-red rays (IR) to detect the iris in the eyes. However the harm of IR for human eyes has been pointed out. In addition, if the interface requires the camera which has IR, the users must purchase the specific devices. Therefore we adopted a PC and the camera doesn't have the IR function. We propose the system by using the motion-template that is one of the functions of OpenCV library for tracking motion. However this function can't recognize the point where the user watches on monitor. It can recognize only the motion. That's why we made calibrate function to relate the eye-gaze with the monitor. We propose two methods to recognize eye-gaze. Both methods require the iris binary image. This image shows the iris shape and we expect that user's visual point can be calculated from this iris image. One method uses gravity point to calculate the point. Other method uses the rectangular approximation to calculate it. We did experiments for some subjects by both methods and compared the results to validate which method is proper and how much the calibrate function is accurate. In the experiment, the function randomly spotted a blue target on the monitor. The target position changes on a regular basis. In this experiment, the user stares at the target and we check the accuracy. If this function or methods are proper, the function correctly recognizes the user stare at target or near. For more accuracy, we will consider about how to detect the iris correctly in the future.
{"title":"Proposal of eye-gaze recognize method for input interface without infra-red ray equipment","authors":"K. Fukushima, N. Shirahama","doi":"10.1109/SNPD.2014.6888742","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888742","url":null,"abstract":"The main purpose of this study is to develop the inexpensive eye-gaze input interface for disabled people. The eye-gaze inputting can suit many situations, and it has little load for user because it is non-contact input interface. Many projects about the eye-gaze have been studied recently. Most of the productions of eye-gaze inputting use infra-red rays (IR) to detect the iris in the eyes. However the harm of IR for human eyes has been pointed out. In addition, if the interface requires the camera which has IR, the users must purchase the specific devices. Therefore we adopted a PC and the camera doesn't have the IR function. We propose the system by using the motion-template that is one of the functions of OpenCV library for tracking motion. However this function can't recognize the point where the user watches on monitor. It can recognize only the motion. That's why we made calibrate function to relate the eye-gaze with the monitor. We propose two methods to recognize eye-gaze. Both methods require the iris binary image. This image shows the iris shape and we expect that user's visual point can be calculated from this iris image. One method uses gravity point to calculate the point. Other method uses the rectangular approximation to calculate it. We did experiments for some subjects by both methods and compared the results to validate which method is proper and how much the calibrate function is accurate. In the experiment, the function randomly spotted a blue target on the monitor. The target position changes on a regular basis. In this experiment, the user stares at the target and we check the accuracy. If this function or methods are proper, the function correctly recognizes the user stare at target or near. For more accuracy, we will consider about how to detect the iris correctly in the future.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"30 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":"115226678","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.6888696
Wafa Tebourski, W. Karaa, H. Ghézala
Decision making has become a strategic need for any business. Indeed, it is among the priorities of capital business. The establishment of decision information systems facilitates the data exploitation and analysis. We distinguish data warehouses as the core system of business intelligence to ensure the structuring and analysis of multidimensional data. Consequently, the design of data warehouses has become a major problem, leading to the development of appropriate approaches to implement data warehouses. In this paper, we propose an approach to design and to construct data warehouses based on a descriptive statistics technique for the analysis of multidimensional data in the Principal Components Analysis (PCA). The findings of this article appear in two main areas: (i) a conceptual model data warehouse, (ii) an algorithm for the determination of measures and dimensions. A case study is used to validate our proposal.
{"title":"New data warehouse designing approach based on principal component analysis","authors":"Wafa Tebourski, W. Karaa, H. Ghézala","doi":"10.1109/SNPD.2014.6888696","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888696","url":null,"abstract":"Decision making has become a strategic need for any business. Indeed, it is among the priorities of capital business. The establishment of decision information systems facilitates the data exploitation and analysis. We distinguish data warehouses as the core system of business intelligence to ensure the structuring and analysis of multidimensional data. Consequently, the design of data warehouses has become a major problem, leading to the development of appropriate approaches to implement data warehouses. In this paper, we propose an approach to design and to construct data warehouses based on a descriptive statistics technique for the analysis of multidimensional data in the Principal Components Analysis (PCA). The findings of this article appear in two main areas: (i) a conceptual model data warehouse, (ii) an algorithm for the determination of measures and dimensions. A case study is used to validate our proposal.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"11 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":"121896789","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
扫码关注我们
求助内容：
应助结果提醒方式：