Refine your search
Collections
Co-Authors
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Khare, Akhil
- Mining Software Quality at Design Phase by Recognizing Architectural Patterns and Computing Pattern Software Metrics
Abstract Views :139 |
PDF Views:3
Authors
Affiliations
1 Bharati Vidyapeeth University College of Engineering, Pune, IN
2 Vishwakarma Institute of Technology, Pune, IN
1 Bharati Vidyapeeth University College of Engineering, Pune, IN
2 Vishwakarma Institute of Technology, Pune, IN
Source
Software Engineering, Vol 2, No 11 (2010), Pagination: 307-317Abstract
Clients need Software to be developed within few days and that too of good quality. And here lies the need for reusability, not only at code level but also at model level. This reusability can be achieved with the help of the use of Design Patterns, which further speeds up the process of product development by providing the pre-tested footsteps to follow. Design patterns show their effectiveness from design phase to maintenance. We propose that the quality of the software design can be determined by presence of Design patterns, which symbolizes good arrangement of data and control as a part of software structure. The software structure contributing to a design pattern should form a cohesive unit serving towards a single purpose and should pose less amount of coupling with the rest of the software elements. In this paper, we provide a metric based study of assessing quality of software structure by detecting the presence of the design patterns and finding the amount of cohesion and coupling of each design pattern. Higher is the quality of the used design pattern higher will be the quality of the product, with more flexibility towards change and maintenance. An early feedback at the design phase regarding software design quality would help in risk analysis as well as quality assurance.Keywords
Software Quality, Design Pattern, Cohesion and Coupling, Object Oriented Metrics.- Amalgam Version of Itinerant Augmented Reality
Abstract Views :178 |
PDF Views:1
Authors
Affiliations
1 Department of Computer Science, JNU, Jodhpur, IN
1 Department of Computer Science, JNU, Jodhpur, IN
Source
Oriental Journal of Computer Science and Technology, Vol 4, No 1 (2011), Pagination: 91-98Abstract
Augmented reality is a powerful user interface technology that augments the user’s environment with computer generated entities In this venture we investigate building indoor location based applications for a mobile augmented reality system. Augmented reality is a natural interface to visualize special information such as position or direction of locations and objects for location based applications that process and present information based on the user’s position in the real world. To enable such applications we construct an indoor tracking system that covers a substantial part of a building. It is based on visual tracking of fiducial markers enhanced with an inertial sensor for fast rotational updates This is especially problematic for mobile augmented reality systems, which ideally require extremely precise position tracking for the user’s head, but which may not always be able to achieve the necessary level of accuracy. While it is possible to ignore variable positional accuracy in an augmented reality user interface, this can make for a confusing system; for example, when accuracy is low, virtual objects that are nominally registered with real ones may be too far off to be of use. Our system uses inferencing and path planning to guide users toward targets that they choose.Keywords
Location Aware Mobile Computing, Outdoor Augmented Reality, Hybrid Sensors, Augmenting Buildings with Infrared Information, Virtual Object Manipulation.- JPEG Compression Steganography
Abstract Views :161 |
PDF Views:0
Authors
Affiliations
1 Department of IT, Bharati Vidyapeeth, University & College of Engineering, Pune - 411 043, IN
2 Department of E & TC, SSSIST, Bhopal - 462 039, IN
1 Department of IT, Bharati Vidyapeeth, University & College of Engineering, Pune - 411 043, IN
2 Department of E & TC, SSSIST, Bhopal - 462 039, IN
Source
Oriental Journal of Computer Science and Technology, Vol 3, No 1 (2010), Pagination: 1-4Abstract
In any communication, security is the most important issue in today’s world. Lots of data security and data hiding algorithms have been developed in the last decade, which worked as motivation for our research. In this project, named “JPEG Compression Steganography”, we have designed a system that will allow an average user to securely transfer text messages by hiding them in a digital image file using the local characteristics within an image. This project is a combination of steganography and encryption algorithms, which provides a strong backbone for its security. The proposed system not only hides large volume of data within an image, but also limits the perceivable distortion that might occur in an image while processing it. This software has an advantage over other information security software because the hidden text is in the form of images, which are not obvious text information carriers. The project contains several challenges that make it interesting to develop. The central task is to research available steganography and encryption algorithms to pick the one the offer the best combination of strong encryption, usability and performance. The main advantage of this project is a simple, powerful and user-friendly GUI that plays a very large role in the success of the application.Keywords
JPEG Compression Steganography.- Software Prefetching Using Jump Pointers in Linked Data Structures
Abstract Views :164 |
PDF Views:0
Authors
Affiliations
1 Department of Information Technology, Bharati Vidyapeeth College of Engineering, Pune - 411 043, IN
1 Department of Information Technology, Bharati Vidyapeeth College of Engineering, Pune - 411 043, IN
Source
Oriental Journal of Computer Science and Technology, Vol 3, No 1 (2010), Pagination: 45-52Abstract
During linked data structures(LDS) traversals, prefetching improves the performance by reducing memory latency. We will discuss about the jump pointer prefetching which hides additional load latency by using an extra pointer to prefetch objects further than a single link away. Jump pointers can be implemented in Binary tress by adding jump pointers at creation time and in LDS by adding jump pointers at traversal time. Prefetch Arrays are also used to store jump pointers. It has two approaches hardware and software. Both the approaches have highly improved the performance of prefetching with the use of jump pointers. Prefetching in pointer-based codes(java programs) is difficult because separate dynamically allocated objects are disjoint, and the access patterns are thus less regular and predictable. However, according to experimental results, the largest performance improvement is 48% with jump- pointers in java programs, but consistent improvements are difficult to obtain.Keywords
Jump Pointers, Linked Data Structures, Software Prefetching.- A Metrics Suite for Measuring Class Interaction at Run Time through DCM
Abstract Views :171 |
PDF Views:0
Authors
Affiliations
1 Department of Information Technology, Bharati Vidyapeeth College of Engineering, Pune, IN
2 Department of IT, BVUCOE, Pune, IN
3 Department of E&TC, SSSIST, Bhopal, IN
1 Department of Information Technology, Bharati Vidyapeeth College of Engineering, Pune, IN
2 Department of IT, BVUCOE, Pune, IN
3 Department of E&TC, SSSIST, Bhopal, IN
Source
Oriental Journal of Computer Science and Technology, Vol 3, No 1 (2010), Pagination: 75-82Abstract
The first step taken while developing software, by an analyst is to construct a sequence diagram which describes the interaction that must occur between classes. The sequence diagram does not show the interaction of classes at run time. It shows static coupling, i.e. it only acknowledges the number of interactions between the classes. There have been many studies done regarding the relationship between coupling and external quality factors of object-oriented software. A common way to define and measure coupling is through structural properties and static code analysis. However, because of polymorphism, dynamic binding, and the common presence of unused or dead code in commercial software, the resulting coupling measures are not precise as they do not perfectly reflect the actual coupling taking place among classes dynamically. This paper proposes the use of the estimated frequency of the use cases and propagates these frequencies through the sequence diagram to estimate dynamic coupling. This can be done by using Dynamic Clustering Mechanism (DCM) in which classes which interact with high frequency are clustered or grouped together (called as hot spots), which are highly dynamically coupled. With this evaluation we will be able to determine which hot spot are indeed relevant and actually deserves close attention from the designer w.r.t design of each class.Keywords
Dynamic Coupling Measurement, DCM, Class Interaction at Run Time, Re-Engineering, Dynamic Clustering Mechanism.- Static Analysis and Run-Time Coupling Metrics
Abstract Views :151 |
PDF Views:1
Authors
Affiliations
1 Department of Information Technology, Bharati Vidyapeeth College of Engineering, Pune - 411 043, IN
2 Department of Information Technology, Bharati Vidyapeeth College of Engineering, Pune - 411 043, IN
1 Department of Information Technology, Bharati Vidyapeeth College of Engineering, Pune - 411 043, IN
2 Department of Information Technology, Bharati Vidyapeeth College of Engineering, Pune - 411 043, IN