Data Flow Sequences: A Revision of Data Flow Diagrams for Modelling Applications using XML
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2013, Vol 4, Issue 5
Abstract
Data Flow Diagrams were developed in the 1970’s as a method of modelling data flow when developing information systems. While DFDs are still being used, the modern web-based which is client-server based means that DFDs are not as useful. This paper proposes a modified form of DFD that incorporates, amongst other features sequences. The proposed system, called Data Flow Sequences (DFS) is better able to model real world systems in a way that simplifies application development. The paper also proposes an XML implementation for DFS which allows analytical tools to be used to analyse the DFS diagrams. The paper discusses a tool that is able to detect orphan data flow sequences and other potential problems.
Authors and Affiliations
James Coleman
Keywords
Related Articles
- EP ID EP104049
- DOI 10.14569/IJACSA.2013.040504
- Views 219
- Downloads 0
Comparative Analysis of Network Libraries for Offloading Efficiency in Mobile Cloud Environment
In the modern era, smartphones are increasingly becoming an integral and essential part of our daily life. Although the hardware capabilities of the smartphones (i.e., processing, memory, battery, and communication) are...
Automatic Image Registration Using Mexican Hat Wavelet, Invariant Moment, and Radon Transform
Image registration is an important and fundamental task in image processing used to match two different images. Given two or more different images to be registered, image registration estimates the parameters...
Performances Comparison of IEEE 802.15.6 and IEEE 802.15.4 Optimization and Exploitation in Healthcare and Medical Applications
In this paper, we simulate the energy consumption, throughput and reliability for both, Zigbee IEEE 802.15.4 Mac protocol and BAN IEEE 802.15.6 exploited in medical applications using Guaranteed Time Slot (GTS) and polli...
Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover
The Traveling salesman problem (TSP) is to find a tour of a given number of cities (visiting each city exactly once) where the length of this tour is minimized. Testing every possibility for an N city tour would be...
Conditions Facilitating the Aversion of Unpopular Norms: An Agent-Based Simulation Study
People mostly facilitate and manage their social lives adhering to the prevalent norms. There are some norms which are unpopular, yet people adhere to them. Ironically, people at individual level do not agree to these no...