iosr-JCE   Volume-10 ~ Issue-4

Abstract: Software engineers and architects have been faced with the problem of IT system complexity for some years. The challenge to build highly complex IT systems, ensure that these systems meet the needs of increasingly complex business processes and do all this in a way that allows everything to adapt quickly to changing market condition coupled with rapid development in information technology has been a problem facing the development and building of workable and functional information systems. Research on this problem has been conducted and it was found to cause large cost of software development project, schedule overrun and outright software project failure. A novel architecture framework was developed as a tool for resolving and managing IT system complexity in the enterprise as the end objective. Comprehensive business system frameworks are necessary to capture the entire complexity of such systems. The framework provides the conceptual foundation necessary for building and managing the integral business system and all its components and also provides an integrated description of enterprise information systems that comprises of the back-end systems, front-end systems, management tools and communication system. The framework provides a detailed process of information system development and defines the necessary subsystems that make up the integrated enterprise information system.

Keywords and phrases: Complexity; Information System; Enterprise Architecture Frameworks Enterprise Architecture, Information Technology

[1]. Oracle (2009). An Oracle White Paper in Enterprise Architecture October.
[2]. Booch G (2005). "The Complexity of Programming Models". Keynote talk at AOSD 2005, Chicago, Il, March 14-18, 2005.
[3]. Card D. N. and R. L. Glass (1990., Measuring Software Design Quality, Englewood Cliffs, NJ:Prentice Hall.
[4]. Coad P. and E. Yourdon (1991). Object-Oriented Design, Englewood Cliffs, NJ:Prentice Hall.
[5]. Chan, J.O (2004). The Analytic Enterprise Model for the Value Chain. Communications of the International Information Management Association, 4(4), 59-69.
[6]. Chan, J.O (2008). An Integrated Architecture for Enterprise Relations Management. Communication of International Information Management Association, 8(2), 55-66.
[7]. DoD Architecture Framework Working Group. DoD Architecture Framework, Feb 2004.
[8]. Kemal A. Delic (2002) .Enterprise It Complexity Zuse H. (1990). Software Complexity Measures and Models, New York, NY: de Gruyter & Co

Abstract: A Wireless Sensor Network(WSN) contains short range energy limited terminals/nodes in which multiple nodes participates one by one to transfer data from source node to Base station. Each node appends some amount of delay which degrades the network performance as the jittered behaviour of network may not be allowed in some applications. Again the faulty nature of tandem nodes may create some severe routing scenarios. Concept of Broad Area Sensor Network (BASN) incorporates a real time communication between sensor node and Base station, which helps to optimize the Quality of Service (QoS). Our goal is to do extensive simulation on performance analysis of such sensor networks and its optimization.

Keywords - WSN ,energy limited terminals, jitter, Quality of service(QoS)

[[1] B. Cook, S. Lanzeisera, and K. Pister, "SoC Issues for RF Smart Dust", Proc. of the IEEE, vol. 94, pp. 117-1196, June 2006.

[2] A. Saipulla, B. Liu and J. Wang, "Barrier Coverage with Airdropped Wireless Sensors", Proc. of Miltary Comms Conf, pp. 1-7, 2008.

[3] K. Martinez, J.K. Hart, and R. Ong, "Environmental Sensor Networks", Computer,Vol.37, Iss.8, August 2004.

[4] R. Nemzek, J. Dreicer, and D. Torney, "Distributed Sensr Networks for Detection of Mobile Radioactive Sources," IEEE Nuclear Science Symposium Conference, Vol. 3, pp. 1462-1467, Oct. 19-25 2003.

Abstract: Sequential pattern mining (SPM) is an important data mining task of discovering time-related behaviours in sequence databases. Sequential pattern mining technology has been applied in many domains, like web-log analysis, the analyses of customer purchase behaviour, process analysis of scientific experiments, medical record analysis, etc. Increased application of sequential pattern mining requires a perfect understanding of the problem and a clear identification of the advantages and disadvantages of existing algorithms. SPM algorithms are broadly categorized into two basic approaches: Apriori based and Pattern growth. Most of the sequential pattern mining methods follow the Apriori based methods, which leads to too many scanning of database and very large amount of candidate sequences generation and testing, which decrease the performance of the algorithms. Pattern growth based methods solve all above problems and in addition, it works on projected database which minimize the search space. Paper reviews the existing SPM techniques, compares various SPM techniques theoretically and practically. It highlights performance evaluation of each of the techniques. Paper also highlights limitation of conventional objective measures and focused on interestingness measures. Finally, a discussion of the current research challenges and pointed out future research direction in the field of SPM.

Keywords: Sequential Pattern Mining, Sequential Pattern Mining Algorithms, Apriori based mining algorithm, FP-Growth based mining algorithm

[1] R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," Proc. 1994 Int‟l Conf. Very Large Data Bases (VLDB ‟94), pp. 487-499, Sept. 1994.

[2] Agrawal R. And Srikant R. "Mining Sequential Patterns.‟, In Proc. of the 11th Int'lConference on Data Engineering, Taipei, Taiwan, March 1995

[3]AYRES, J., FLANNICK, J., GEHRKE, J., AND YIU, T., "Sequential pattern mining using a bitmap representation‟, In Proceedings of the 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining-2002.

[4] Brijs, T., Vanhoof, K. and Wets, G. (2003), "Defining interestingness for association rules‟, International Journal of Information Theories and Applications 10(4), 370–376.

[5] M. Garofalakis, R. Rastogi, and K. Shim, "SPIRIT: Sequential pattern mining with regular expression constraints‟, VLDB'99, 1999. [6] Han J., Dong G., Mortazavi-Asl B., Chen Q., Dayal U., Hsu M.-C.,‟ Freespan: Frequent pattern-projected sequential pattern mining‟, Proceedings 2000 Int. Conf. Knowledge Discovery and Data Mining (KDD‟00), 2000, pp. 355-359.

[7] J. Han, J. Pei, and Y. Yin, "Mining Frequent Patterns without Candidate Generation‟,Proc. 2000 ACM-SIGMOD Int‟l Conf. Management of Data (SIGMOD ‟00), pp. 1-12, May 2000.

[8] J. Pei, J. Han, B. Mortazavi-Asi, H. Pino, "PrefixSpan: Mining Sequential Patterns Efficiently by Prefix- Projected Pattern Growth‟, ICDE'01, 2001.

[9] Ramaswamy, S., Mahajan, S. and Silberschatz, A. (1998), On the discovery of interesting patterns in association rules, in "Proceedings of the 24rd International Conference on Very Large Data Bases‟,Morgan Kaufmann Publishers Inc., pp. 368–379.

[10] Srikant R. and Agrawal R.,‟Mining sequential patterns: Generalizations and performance improvements‟, Proceedings of the 5th International Conference Extending Database Technology, 1996, 1057, 3-17.