scholarly journals (Behavioural) Design Patterns as Composition Operators

2010 ◽  
pp. 232-251 ◽  
Author(s):  
Kung-Kiu Lau ◽  
Ioannis Ntalamagkas ◽  
Cuong M. Tran ◽  
Tauseef Rana
Keyword(s):  
Design Patterns ◽  
Composition Operators

ANALYZING AND IMPROVING WEB APPLICATION QUALITY USING DESIGN PATTERNS

2012 ◽  
Vol 2 (2) ◽  
pp. 112-116
Author(s):  
Shikha Bhatia ◽  
Mr. Harshpreet Singh
Keyword(s):  
Web Application ◽  
Design Pattern ◽  
Design Patterns ◽  
Web Applications ◽  
Past Research ◽  
Software Systems ◽  
Interactive Software ◽  
Web Based ◽  
Software Application ◽  
Execution Speed

With the mounting demand of web applications, a number of issues allied to its quality have came in existence. In the meadow of web applications, it is very thorny to develop high quality web applications. A design pattern is a general repeatable solution to a generally stirring problem in software design. It should be noted that design pattern is not a finished product that can be directly transformed into source code. Rather design pattern is a depiction or template that describes how to find solution of a problem that can be used in many different situations. Past research has shown that design patterns greatly improved the execution speed of a software application. Design pattern are classified as creational design patterns, structural design pattern, behavioral design pattern, etc. MVC design pattern is very productive for architecting interactive software systems and web applications. This design pattern is partition-independent, because it is expressed in terms of an interactive application running in a single address space. We will design and analyze an algorithm by using MVC approach to improve the performance of web based application. The objective of our study will be to reduce one of the major object oriented features i.e. coupling between model and view segments of web based application. The implementation for the same will be done in by using .NET framework.

JAVASCRIPT ASYNCHRONOUS PROGRAMMING

2019 ◽  
Vol 128 (2B) ◽  
pp. 5-16
Author(s):  
Tran Thanh Luong ◽  
Le My Canh
Keyword(s):  
Design Patterns ◽  
Source Code ◽  
Object Oriented ◽  
Exception Handling ◽  
Code Smells ◽  
Asynchronous Programming ◽  
Event Driven ◽  
Programming Patterns ◽  
The Impact

JavaScript has become more and more popular in recent years because its wealthy features as being dynamic, interpreted and object-oriented with first-class functions. Furthermore, JavaScript is designed with event-driven and I/O non-blocking model that boosts the performance of overall application especially in the case of Node.js. To take advantage of these characteristics, many design patterns that implement asynchronous programming for JavaScript were proposed. However, choosing a right pattern and implementing a good asynchronous source code is a challenge and thus easily lead into less robust application and low quality source code. Extended from our previous works on exception handling code smells in JavaScript and exception handling code smells in JavaScript asynchronous programming with promise, this research aims at studying the impact of three JavaScript asynchronous programming patterns on quality of source code and application.

MDA Based Design Patterns Modeling and Model Transformation

2008 ◽  
Vol 19 (9) ◽  
pp. 2203-2217 ◽  
Author(s):  
Tian ZHANG ◽  
Yan ZHANG ◽  
Xiao-Feng YU ◽  
Lin-Zhang WANG ◽  
Xuan-Dong LI
Keyword(s):  
Design Patterns ◽  
Model Transformation

Essential norms of weighted differentiation composition operators between Zygmund type spaces and Bloch type spaces

Filomat ◽  
2017 ◽  
Vol 31 (9) ◽  
pp. 2877-2889 ◽  
Author(s):  
Amir Sanatpour ◽  
Mostafa Hassanlou
Keyword(s):  
Composition Operators ◽  
Sufficient Conditions ◽  
Essential Norm ◽  
Necessary And Sufficient Conditions ◽  
Norm Estimates ◽  
Type Spaces ◽  
Necessary And Sufficient

We study boundedness of weighted differentiation composition operators Dk?,u between Zygmund type spaces Z? and Bloch type spaces ?. We also give essential norm estimates of such operators in different cases of k ? N and 0 < ?,? < ?. Applying our essential norm estimates, we get necessary and sufficient conditions for the compactness of these operators.

Sign in / Sign up

Export Citation Format

Share Document