DOCSLIB.ORG

ISSN 1816-353X (Print) Vol. 21, No. 1 (Jan. 2019) ISSN 1816-3548 (Online)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
ISSN 1816-353X (Print) Vol. 21, No. 1 (Jan. 2019) ISSN 1816-3548 (Online) ISSN 1816-353X (Print) Vol. 21, No. 1 (Jan. 2019) ISSN 1816-3548 (Online) INTERNATIONAL JOURNAL OF NETWORK SECURITY Editor-in-Chief Gregorio Martinez Prof. Min-Shiang Hwang University of Murcia (UMU) (Spain) Department of Computer Science & Information Engineering, Asia Sabah M.A. Mohammed University, Taiwan Department of Computer Science, Lakehead University (Canada) Co-Editor-in-Chief: Lakshmi Narasimhan Prof. Chin-Chen Chang (IEEE Fellow) School of Electrical Engineering and Computer Science, University of Department of Information Engineering and Computer Science, Newcastle (Australia) Feng Chia University, Taiwan Khaled E. A. Negm Publishing Editors Etisalat University College (United Arab Emirates) Shu-Fen Chiou, Chia-Chun Wu, Cheng-Yi Yang Joon S. Park School of Information Studies, Syracuse University (USA) Board of Editors Antonio Pescapè University of Napoli "Federico II" (Italy) Ajith Abraham Zuhua Shao School of Computer Science and Engineering, Chung-Ang University Department of Computer and Electronic Engineering, Zhejiang University (Korea) of Science and Technology (China) Wael Adi Mukesh Singhal Institute for Computer and Communication Network Engineering, Technical Department of Computer Science, University of Kentucky (USA) University of Braunschweig (Germany) Nicolas Sklavos Sheikh Iqbal Ahamed Informatics & MM Department, Technological Educational Institute of Department of Math., Stat. and Computer Sc. Marquette University, Patras, Hellas (Greece) Milwaukee (USA) Tony Thomas Vijay Atluri School of Computer Engineering, Nanyang Technological University MSIS Department Research Director, CIMIC Rutgers University (USA) (Singapore) Mauro Barni Mohsen Toorani Dipartimento di Ingegneria dell’Informazione, Università di Siena (Italy) Department of Informatics, University of Bergen (Norway) Andrew Blyth Shuozhong Wang Information Security Research Group, School of Computing, University of School of Communication and Information Engineering, Shanghai Glamorgan (UK) University (China) Soon Ae Chun Zhi-Hui Wang College of Staten Island, City University of New York, Staten Island, NY School of Software, Dalian University of Technology (China) (USA) Chuan-Kun Wu Stefanos Gritzalis Chinese Academy of Sciences (P.R. China) and Department of Computer University of the Aegean (Greece) Science, National Australian University (Australia) Lakhmi Jain Chou-Chen Yang School of Electrical and Information Engineering, Department of Management of Information Systems, National Chung Hsing University of South Australia (Australia) University (Taiwan) James B D Joshi Sherali Zeadally Dept. of Information Science and Telecommunications, University of Department of Computer Science and Information Technology, University Pittsburgh (USA) of the District of Columbia, USA Ç etin Kaya Koç Jianping Zeng School of EECS, Oregon State University (USA) School of Computer Science, Fudan University (China) Shahram Latifi Justin Zhan Department of Electrical and Computer Engineering, University of Nevada, School of Information Technology & Engineering, University of Ottawa Las Vegas (USA) (Canada) Cheng-Chi Lee Mingwu Zhang Department of Library and Information Science, Fu Jen Catholic University College of Information, South China Agric University (China) (Taiwan) Yan Zhang Chun-Ta Li Wireless Communications Laboratory, NICT (Singapore) Department of Information Management, Tainan University of Technology (Taiwan) PUBLISHING OFFICE Iuon-Chang Lin Min-Shiang Hwang Department of Management of Information Systems, National Chung Hsing Department of Computer Science & Information Engineering, Asia University (Taiwan) University, Taichung 41354, Taiwan, R.O.C. John C.S. Lui Email: [email protected] Department of Computer Science & Engineering, Chinese University of Hong Kong (Hong Kong) International Journal of Network Security is published both in traditional Kia Makki paper form (ISSN 1816-353X) and in Internet (ISSN 1816-3548) at Telecommunications and Information Technology Institute, College of http://ijns.jalaxy.com.tw Engineering, Florida International University (USA) PUBLISHER: Candy C. H. Lin © Jalaxy Technology Co., Ltd., Taiwan 2005 23-75, P.O. Box, Taichung, Taiwan 40199, R.O.C. Volume: 21, No: 1 (January 1, 2019) International Journal of Network Security 1. 2-Adic Complexity of Sequences Generated by T-Functions Yan Wang, Xueming Ren, Shunbo Li, Vol. 21, No. 1, 2019, pp. 1-6 Fully Secure Anonymous Identity Based Broadcast Encryption with Group of 2. Prime Order Yang Ming and Hongping Yuan, Vol. 21, No. 1, 2019, pp. 7-16 3. On The Secrecy Performance of Wireless Powered Device to Device Systems Dinh-Thuan Do, Vol. 21, No. 1, 2019, pp. 17-21 An Image Encryption Scheme Based on The Three-dimensional Chaotic 4. Logistic Map Chunhu Li, Guangchun Luo, and Chunbao Li, Vol. 21, No. 1, 2019, pp. 22-29 5. Granger Causality in TCP Flooding Attack Rup Kumar Deka, Dhruba Kumar Bhattacharyya, and Jugal Kumar Kalita, Vol. 21, No. 1, 2019, pp. 30-39 6. New Hierarchical Identity Based Encryption with maximum hierarchy Dasari Kalyani and R. Sridevi, Vol. 21, No. 1, 2019, pp. 40-46 A Selective Self-adaptive Image Cryptosystem Based on Bit-planes 7. Decomposition Hossam Diab, Vol. 21, No. 1, 2019, pp. 47-61 8. Privacy-Preserving and Dynamic Authentication Scheme for Smart Metering Xiuxia Tian, Fuliang Tian, Anqin Zhang, and Xi Chen, Vol. 21, No. 1, 2019, pp. 62-70 9. Multi-party Fair Exchange Protocol with Smart Contract on Bitcoin Lijuan Guo, Xuelian Li, and Juntao Gao, Vol. 21, No. 1, 2019, pp. 71-82 Medical Image Encryption Scheme Based on Multiple Chaos and DNA 10. Coding Joshua C. Dagadu, Jian-Ping Li, Emelia O. Aboagye, Faith K. Deynu, Vol. 21, No. 1, 2019, pp. 83-90 11. An Efficient Fully Homomorphic Encryption Scheme Ahmed El-Yahyaoui and Mohamed Dafir Ech-Cherif El Kettani, Vol. 21, No. 1, 2019, pp. 91-99 Cryptanalysis of the Mutual Authentication and Key Agreement Protocol 12. with Smart Cards for Wireless Communications Shu-Fen Chiou, Hsieh-Tsen Pan, Eko Fajar Cahyadi, and Min-Shiang Hwang, Vol. 21, No. 1, 2019, pp. 100-104 Secure and Efficient Ranked Keyword Search over Outsourced Cloud Data 13. by Chaos Based Arithmetic Coding and Confusion Mengting Hu, Hang Gao, Tiegang Gao , Vol. 21, No. 1, 2019, pp. 105-114 Three Kinds of Network Security Situation Awareness Model Based on Big 14. Data Bowen Zhu, Yonghong Chen, Yiqiao Cai, Vol. 21, No. 1, 2019, pp. 115-121 NPKG: Novel Pairwise Key Generation for Resisting Key-based Threats in 15. Wireless Sensor Network M. Vaneeta and S. Swapna Kumar, Vol. 21, No. 1, 2019, pp. 122-129 Cryptography Security Designs and Enhancements of DNP3-SA Protocol 16. Based on Trusted Computing Ye Lu and Tao Feng, Vol. 21, No. 1, 2019, pp. 130-136 Multimedia Social Network Authorization Scheme of Comparison-based 17. Encryption Cheng Li, Zhiyong Zhang, and Guoqin Chang, Vol. 21, No. 1, 2019, pp. 137-144 A Provable Secure Short Signature Scheme Based on Bilinear Pairing over 18. Elliptic Curve Subhas Chandra Sahana and Bubu Bhuyan, Vol. 21, No. 1, 2019, pp. 145-152 Identification and Processing of Network Abnormal Events Based on 19. Network Intrusion Detection Algorithm Yunbin He, Vol. 21, No. 1, 2019, pp. 153-159 Safety Protection of E-Commerce Logistics Information Data Under The 20. Background Of Big Data Yuan Zhao and Yanyan Zhang, Vol. 21, No. 1, 2019, pp. 160-165 A Context Establishment Framework for Cloud Computing Information 21. Security Risk Management Based on the STOPE View Bader Saeed Alghamdi, Mohamed Elnamaky, Mohammed Amer Arafah, Maazen Alsabaan, Saad Haj Bakry, Vol. 21, No. 1, 2019, pp. 166-176 International Journal of Network Security, Vol.21, No.1, PP.1-6, Jan. 2019 (DOI: 10.6633/IJNS.201901 21(1).01) 1 2-Adic Complexity of Sequences Generated by T-Functions Yan Wang, Xueming Ren, Shunbo Li, Song Zhao (Corresponding author: Yan Wang) Department of Mathematics, Xi'an University of Architecture and Technology 13, YanTa Road, Xi'an 710055, China (Email: [email protected]) (Received July 12, 2017; revised and accepted Dec. 8, 2017) Abstract pher and Hash functions to be the substitution of Linear Feedback Shift Register (LFSR). Single cycle T-functions are cryptographic primitives which can generate maximum periodic sequences. 2-Adic Sequences generated by single cycle T-function are complexity of a sequence measures the difficulty of out- studied from the point of cryptographic criterion. The putting a binary sequence using a feedback with carry autocorrelation property of coordinate sequences is stud- shift register. Based on the special properties of single ied by Kolokotronis and Wang [8,14], and the results show cycle T-functions, this paper investigates the 2-adic com- that such sequence is not so pseudorandom as people ex- plexity of sequences generated by single cycle T-functions pected. Linear complexity of sequences generated by sin- from the kth coordinate sequence to the state output se- gle cycle T-function has been discussed in [1, 9, 15{17], quence using the primality of Fermat number. It is shown which all show sequences generated by single cycle T- that the state output sequence of a T-function is far from function have quite high linear complexity. As for 2- high 2-adic complexity. adic complexity of a sequence, Dong [3] studied the k- Keywords: 2-Adic Complexity; Fermat Number; Se- error 2-adic complexity of a binary sequence of a period quence; T-Function pn. Anashin [2] present a new criteria for a T-function to be bijective or transitive. Jang and Jeong et al. [4] give a characterization of 1-Lipschitz functions on Fq[T ] 1 Introduction in terms of the van der Put expansion and use this re- sult to give sufficient conditions for measure-preserving The security of a stream cipher depends on the unpre- 1-Lipschitz function on Fq[T ] in terms of the three well dictability of the pseudo-random bit sequence. To ver- known bases, Carlitz polynomials, digit derivatives and ify the pseudo-randomness of a sequence, criterions of digit shifts. Sopin [12] presented the criteria of measure- pseudo-random sequence are proposed such as linear com- preserving(Haar) for pk−Lipschitz maps on the cartesian plexity, autocorrelation, 2-adic complexity and so on.
Load more

Recommended publications
  • Measuring, Modelling and Understanding Internet Traffic
    PRODUCED ON ACID-FREE PAPER MEASURING, UNDERSTANDING AND MODELLING INTERNET TRAFFIC Nicolas Hohn SUBMITTED IN TOTAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY JULY 2004 DEPARTMENT OF ELECTRICAL AND ELECTRONIC ENGINEERING THE UNIVERSITY OF MELBOURNE AUSTRALIA A mes parents, pour leur amour, encouragement et constant support, sans qui rien ne serait. iii Abstract This thesis concerns measuring, understanding and modelling Internet traffic. We first study the origins of the statistical properties of Internet traffic, in particular its scaling behaviour, and propose a constructive model of packet traffic with physically motivated parameters. We base our analysis on a large amount of empirical data measured on different networks, and use a so called semi-experimental approach to isolate certain features of traffic we seek to model. These results lead to the choice of a particular Poisson cluster process, known as Bartlett-Lewis point process, for a new packet traffic model. This model has a small number of parameters with simple networking meaning, and is mathematically tractable. It allows us to gain valuable insight on the underlying mechanisms creating the observed statistics. In practice, Internet traffic measurements are limited by the very large amount of data generated by high bandwidth links. This leads us to also investigate traffic sampling strate- gies and their respective inversion methods. We argue that the packet sampling mechanism currently implemented in Internet routers is not practical when one wants to infer the sta- tistics of the full traffic from partial measurements. We advocate the use of flow sampling for many purposes. We show that such sampling strategy is much easier to invert and can give reasonable estimates of higher order traffic statistics such as distribution of number of packets per flow and spectral density of the packet arrival process.
    [Show full text]
  • Formative Evaluation of Optical Network Projects in Metropolitan Area
    D. »urepiÊ, I. Boπnjak, T. Bauk: Formative Evaluation of Optical Network Projects in Metropolitan Area DANKO »UREPI∆, B.Eng. Traffic Infrastructure Hrvatske telekomunikacije Review Planinska 1a, 10000 Zagreb, Republika Hrvatska U.D.C.: 629.052.3 IVAN BO©NJAK, D.Sc. Accepted: Jun. 23, 2003 Fakultet prometnih znanosti Approved: Dec. 15, 2003 VukeliÊeva 4, 10000 Zagreb, Republika Hrvatska TON»I BAUK, B.Eng. Hrvatske telekomunikacije Planinska 1a, 10000 Zagreb, Republika Hrvatska FORMATIVE EVALUATION OF OPTICAL NETWORK PROJECTS IN METROPOLITAN AREA ABSTRACT Unlike most of the old approaches to planning network facilities, we adapt new paradigm with for- The paper discusses the approach to formative and sum- mative evaluation where teletraffic engineering and mative evaluation of alternative solutions for next generation service management interact in different levels of optical access network. Unlike most of the old approaches systems description. Beyond the standardised techni- to planning of network facilities, we adapt the new paradigm cal solutions at the physical and logical layer, huge where teletraffic engineering and service management inter- act at different levels of systems description. The basic thesis work has to deliver effective solutions to customers is that formative traffic evaluation has to be the key part of and other stakeholders: network operators, service initial and ongoing project activities in deploying new tech- providers, vendors, local community, etc. nological solutions in urban telecommunications network. The basic thesis is that formative traffic evalua- Passive Optical Network (PON) is analysed as one effective tion has to be part of initial and ongoing project ac- solution because it satisfies the broadband traffic require- tivities in developing and deploying new solutions in ments with minimal amount of optical equipment and fiber metropolitan area access networks.
    [Show full text]
  • Network Traffic Modeling
    Chapter in The Handbook of Computer Networks, Hossein Bidgoli (ed.), Wiley, to appear 2007 Network Traffic Modeling Thomas M. Chen Southern Methodist University, Dallas, Texas OUTLINE: 1. Introduction 1.1. Packets, flows, and sessions 1.2. The modeling process 1.3. Uses of traffic models 2. Source Traffic Statistics 2.1. Simple statistics 2.2. Burstiness measures 2.3. Long range dependence and self similarity 2.4. Multiresolution timescale 2.5. Scaling 3. Continuous-Time Source Models 3.1. Traditional Poisson process 3.2. Simple on/off model 3.3. Markov modulated Poisson process (MMPP) 3.4. Stochastic fluid model 3.5. Fractional Brownian motion 4. Discrete-Time Source Models 4.1. Time series 4.2. Box-Jenkins methodology 5. Application-Specific Models 5.1. Web traffic 5.2. Peer-to-peer traffic 5.3. Video 6. Access Regulated Sources 6.1. Leaky bucket regulated sources 6.2. Bounding-interval-dependent (BIND) model 7. Congestion-Dependent Flows 7.1. TCP flows with congestion avoidance 7.2. TCP flows with active queue management 8. Conclusions 1 KEY WORDS: traffic model, burstiness, long range dependence, policing, self similarity, stochastic fluid, time series, Poisson process, Markov modulated process, transmission control protocol (TCP). ABSTRACT From the viewpoint of a service provider, demands on the network are not entirely predictable. Traffic modeling is the problem of representing our understanding of dynamic demands by stochastic processes. Accurate traffic models are necessary for service providers to properly maintain quality of service. Many traffic models have been developed based on traffic measurement data. This chapter gives an overview of a number of common continuous-time and discrete-time traffic models.
    [Show full text]
  • A Survey of Architectural Styles.V4
    Survey of Architectural Styles Alexander Bird, Bianca Esguerra, Jack Li Liu, Vergil Marana, Jack Kha Nguyen, Neil Oluwagbeminiyi Okikiolu, Navid Pourmantaz Department of Software Engineering University of Calgary Calgary, Canada Abstract— In software engineering, an architectural style is a and implementation; the capabilities and experience of highest-level description of an accepted solution to a common developers; and the infrastructure and organizational software problem. This paper describes and compares a selection constraints [30]. These styles are not presented as out-of-the- of nine accepted architectural styles selected by the authors and box solutions, but rather a framework within which a specific applicable in various domains. Each pattern is presented in a software design may be made. If one were to say “that cannot general sense and with a domain example, and then evaluated in be called a layered architecture because the such and such a terms of benefits and drawbacks. Then, the styles are compared layer must communicate with an object other than the layer in a condensed table of advantages and disadvantages which is above and below it” then one would have missed the point of useful both as a summary of the architectural styles as well as a architectural styles and design patterns. They are not intended tool for selecting a style to apply to a particular project. The to be definitive and final, but rather suggestive and a starting paper is written to accomplish the following purposes: (1) to give readers a general sense of several architectural styles and when point, not to be used as a rule book but rather a source of and when not to apply them, (2) to facilitate software system inspiration.
    [Show full text]
  • Mastering JEE Design Patterns
    "Charting the Course ... ... to Your Success!" Mastering JEE Design Patterns Course Summary Description Geared for experienced enterprise Java (JEE) developers, Mastering JEE Design Patterns is a lab- intensive Java / JEE design patterns training course which explores the many sophisticated JEE-oriented design patterns and how to use these patterns to develop solid, robust and reusable JEE applications. Technologies such as JPA and EJB3, as well as frameworks such as Spring, web services and rich interfaces, have significantly impacted previous generations of design patterns. Many of these technologies were heavily influenced by the very problems that previous design patterns addressed. While the basic patterns still ring true, the more advanced patterns have evolved into more robust solutions for secure, stable and scalable enterprise applications. Working in a hands-on environment, developers will explore key patterns in each of the different JEE layers and how they are used most effectively in building robust, reusable JEE applications. Objectives Working in a dynamic, interactive discussion and hands-on programming environment, let by our JEE expert team, students will explore the following pattern categories: Crosscutting Business Tier Presentation Tier Integration Tier Topics Introduction to Design Patterns Integration Tier Patterns “Gang of Four” Design Patterns Presentation Tier Patterns Base Patterns Crosscutting Patterns Business Tier Patterns Working with Patterns Audience This is an intermediate level Java EE (JEE) developer course, designed for experienced Java developers, new to JEE, that need to further extend their skills in web development and Struts. Prerequisites Attendees should have an extensive working knowledge in developing basic Java applications. Duration Five days Due to the nature of this material, this document refers to numerous hardware and software products by their trade names.
    [Show full text]
  • Diplomarbeit Im Fachbereich Elektrotechnik & Informatik an Der
    Bachelor Thesis Prannoy Mulmi Design and Implementation of an Archive Microservice solution for the Multi-Agent Research and Simulation Distributed System Fakultät Technik und Informatik Faculty of Engineering and Computer Science Department Informations- und Department of Information and Elektrotechnik Electrical Engineering Prannoy Mulmi Design and Implementation of an Archive Microservice solution for the Multi-Agent Research and Simulation Distributed System Bachelor Thesis based on the study regulations for the Bachelor of Engineering degree programme Information Engineering at the Department of Information and Electrical Engineering of the Faculty of Engineering and Computer Science of the Hamburg University of Applied Sciences Supervising examiner : Prof. Dr. rer. nat. Henning Dierks Second Examiner : Prof. Dr. rer. nat. Thomas Clemen Day of delivery 23. Juli 2018 Prannoy Mulmi Title of the Bachelor Thesis Design and Implementation of an Archive Microservice solution for the Multi-Agent Research and Simulation Distributed System Keywords Distributed System, Microservice, Two-Phase commit protocol, Archive, Decentrali- zed data, Multi-Agent Research and Simulation (MARS) Abstract This thesis introduces the design and implementation of an Archive Microservice in the Multi-Agent Research and Simulation (MARS) framework. Due to the distributed architecture of the system, the process of the archive and restore is complex to imple- ment and maintain as there multiple possibilities of failure. This thesis uses different strategies to
    [Show full text]
  • Methods & Tools
    METHODS & TOOLS Practical knowledge for the software developer, tester and project manager ISSN 1661-402X Spring 2011 (Volume 19 - number 1) www.methodsandtools.com The Salesmen/Developers Ratio at Software Vendors Many of us might think that software is a technological industry. Maybe. But maybe not. If you consider Oracle or Microsoft, I suppose that few of us would consider them as technology leaders, but we will all recognize their financial strength and marketing power. Long lasting organizations in the software industry might have more financial strength than technological capabilities. The recent conflict between Oracle and the creator of Hudson, an open source continuous integration server, is just another episode in the opposition between developers- and salesmen-driven software companies. On one side you have Oracle, for which Hudson is just small project inherited from the Sun buyout and that owns the "Hudson" brand. On the other side, you find Kohsuke Kawaguchi, who created Hudson and wants keep some control on its development. Hudson has been "forked", the open source code being used to start another project. You now have a Jenkins CI project that includes most of the active Hudson contributors and a Hudson CI project backed by Oracle and Sonatype, the commercial company behind the Maven project. Everything is however not black and white. Kohsuke Kawaguchi has joined Cloudbees, a company that has some management and financing coming from ex-JBoss managers, people that know how to make money with open source software. These people are not working hard for the only sake of technology evolution. You can judge the main orientation of a company looking at its salesmen/developers ratios.
    [Show full text]
  • Teletraffic Engineering Course Brief and Outline
    f Electr o ica ol l a School of Electrical and Information Engineering o h n c d S University of the Witwatersrand, Johannesburg I n g f n o i r r m ee at in ion Eng ELEN7015 { Teletraffic Engineering Course Brief and Outline: 2015 Course Lecturer: Dr L. Cheng Room: CM4 380 Tel: 011 7177228 Email: [email protected] 1 Course Background and Purpose Teletraffic engineering, based on teletraffic theory, provides the means to analyse, design and monitor networks to ensure that the networks carry end user and signalling information to the satisfaction of end users. Teletraffic started early in the history of telephony with a Danish School- master wondering about the capacity of the village telephone exchange. As switched circuits grew in complexity, a large body of theory and practice emerged for engineering telephone networks to carry voice traffic with acceptable quality of service using measures such as the probability of an attempt to make a call failing because all equipment is busy. With the emergence of packet switched networks the subject expanded. Approaches to engineering packet switched networks to carry user packets have much in common with switched circuit networks but required extensions. Engineering of packet networks for traffic also has its own nuances. Teletraffic theory is rooted in probability. Ideally, the student should be well versed in probability concepts. However, as this is often not the case, the course is structure with the opportunity to learn or refresh key concepts in probablity and to reinforce this learning through computer exercises. 2 Course Outcomes By the end of the course the student will demonstrate ability to: 1.
    [Show full text]
  • Design Optimizations of Enterprise Applications – a Literature Survey
    Design Optimizations of Enterprise Applications – A Literature Survey Willie (Phong) Tu Dept. of Computer Science, University of Calgary [email protected] Abstract Another dimension is the performance improvement for the single user versus multiple users, in other words, Software design patterns have been defined as scalability. The design optimization patterns noted here possible solutions to reoccurring problems. One aspect will focus on actual running time of operations for of the problems is performance. This can be arguably single user performance and multi-user scalability true in high volume enterprise applications. This paper improvements. will explore the current discussions and research in The organization of the findings is categorized utilization of software design patterns to optimize through the usage of an architectural pattern, which is enterprise applications. defined as layer [5]. The layers used are the primary three-layer architecture for information systems [10,21], which includes the data access layer, domain layer, and 1. Introduction presentation layer. Design optimization patterns that spans layers will be elaborated first, then a bottom up First, let’s define what is design optimization. In this approach starting with the data access layer, followed by context, design optimization is the improvement of an the domain layer, and finally the presentation layer. We application’s design and performance using software will then continue on with findings from different design patterns. Design improvements can be subjective, enterprise applications. After which, we will summarize thus the main qualifier is the utilization of software the current state in design optimizations of enterprise design patterns to improve the performance of an applications based on the findings.
    [Show full text]
  • Enterprise Application Design Patterns: Improved and Applied
    Enterprise Application Design Patterns: Improved and Applied Stuart Thiel A Thesis in The Department of Computer Science and Software Engineering Presented in Partial Fulfillment of the Requirements for the Degree of Master of Computer Science at Concordia University Montreal, Quebec, Canada January 2010 © Stuart Thiel, 2010 i CONCORDIA UNIVERSITY School of Graduate Studies This is to certify that the thesis prepared By: Stuart Thiel Entitled: Enterprise Application Design Patterns: Improved and Applied and submitted in partial fulfillment of the requirements for the degree of Master of Computer Science complies with the regulations of the University and meets the accepted standards with respect to originality and quality. Signed by the final examining committee: ______________________________________________Chair Dr. Nematollaah Shiri ______________________________________________Examiner Dr. Greg Butler ______________________________________________Examiner Dr. Yuhong Yan ______________________________________________Supervisor Dr. Patrice Chalin Approved by __________________________________________ Chair of Department or Graduate Program Director _____________________________________ Dr. Robin Drew, Dean Faculty of Engineering and Computer Science Date ______________________________________________ i ii Abstract Enterprise Application Design Patterns: Improved and Applied Stuart Thiel Providing developers with proper tools is of ever increasing importance as software integrates itself further into all aspects of our lives. Aside from conventional hardware and software tools, architectural and design patterns have been identified over the years as a means to communicate knowledge of known problems and their solutions. In this thesis, we present several refinements and additions to these patterns, building primarily on Martin Fowler’s Patterns of Enterprise Application Architecture (2003). We present a practical implementation approach to using these patterns and discuss a framework that we have developed to aid practitioners in following this methodology.
    [Show full text]
  • Prospectus for Undergraduate Admissions 2021
    NED UNIVERSITY of Engineering & Technology 1921-2021 www.neduet.edu.pk At •FOREWORD NED University of Engineering & Technology is one of the oldest engineering universities of Pakistan with its impact and reputation completing hundred years in 2021. In its centennial year, the University has maintained its prominence in the Times Impact Ranking which evaluates academic institute against the Sustainable Development Goals. Correspondingly, in the renowned and reliable QS Ranking, NED University is among the top 2.5 percent institutions in Asia. Our alumni are placed across the globe and have been contributing in various professional capacities in almost every sector making a difference to engineering, technology, economy and ultimately society and humanity at large. The success stories and global presence of our alumni reflect the quality of graduates being educated and trained at this prestigious institution. The University with its strong academia-industry linkage enhances student learning through industry-exposure opportunities and industry engagement on demand-based research for the industry. State-of-the-art laboratories established in various departments in collaboration with the partner industries and the NED Alumni with the recent ones including National Centre for AI, Cyber Security, Robotics, Data Analysis, Virtual Reality Centre and Centre for Infectious Disease Modelling are actively engaged in doing research on pressing, emerging and critical problems. The newly founded constituent college of the University; Thar Institute of Engineering, Sciences and Technology (TIEST) at Islamkot, Thar has completed its second year of establishment. The students admitted at TIEST are fully facilitated with modern and state- of-the-art academic and relevant equipment aligned with the University’s commitment to provide its students, applied, analytical, design, and computing skills that underpin modern engineering practices, while encouraging their creativity and problem-solving skills essential for contemporary engineers and professionals in allied disciplines.
    [Show full text]
  • Mutable Class Design Pattern Nikolay Malitsky Nova Southeastern University, [email protected]
    Nova Southeastern University NSUWorks CEC Theses and Dissertations College of Engineering and Computing 2016 Mutable Class Design Pattern Nikolay Malitsky Nova Southeastern University, [email protected] This document is a product of extensive research conducted at the Nova Southeastern University College of Engineering and Computing. For more information on research and degree programs at the NSU College of Engineering and Computing, please click here. Follow this and additional works at: https://nsuworks.nova.edu/gscis_etd Part of the Other Computer Sciences Commons, and the Theory and Algorithms Commons Share Feedback About This Item NSUWorks Citation Nikolay Malitsky. 2016. Mutable Class Design Pattern. Doctoral dissertation. Nova Southeastern University. Retrieved from NSUWorks, College of Engineering and Computing. (956) https://nsuworks.nova.edu/gscis_etd/956. This Dissertation is brought to you by the College of Engineering and Computing at NSUWorks. It has been accepted for inclusion in CEC Theses and Dissertations by an authorized administrator of NSUWorks. For more information, please contact [email protected]. Mutable Class Design Pattern by Nikolay Malitsky A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science Graduate School of Computer and Information Sciences Nova Southeastern University 2016 We hereby certify that this dissertation, submitted by Nikolay Malitsky, conforms to acceptable standards and is fully adequate in scope and quality to fulfill the dissertation requirements for the degree of Doctor of Philosophy. _____________________________________________ ________________ Michael J. Laszlo, Ph.D. Date Chairperson of Dissertation Committee _____________________________________________ ________________ Francisco J. Mitropoulos, Ph.D. Date Dissertation Committee Member _____________________________________________ ________________ Amon B.
    [Show full text]