Saturday 4 June 2011

Heuristic Method for Effective Cellular Network Planning Design

Author Yee Ming Chen, Fang Yun Yeh
On Pages 75-78
Volume No. 1
Issue No. 2
Issue Date May 01, 2011
Publishing Date May 01, 2011
Keywords Channel assignment, cellular network, algorithm, mobile communication




Abstract

Channel allocation has been considered a NP complete problem, and involves a very important issue for the adequate dimensioning of wireless communication networks. In this paper, we apply the formulation of Minimum span problem (MS-CAP) with heuristic method to three benchmarking problems, for some of which interference-free solutions cannot be found but the approach is able to minimize the interference effectively.

Download link:

Securing Watermarked-Relational Data by Using Encryption and Decryption

Author Nagarjuna.Settipalli, R Manjula
On Pages 70-74
Volume No. 1
Issue No. 2
Issue Date May 01, 2011
Publishing Date May 01, 2011
Keywords Ownership rights, relational data, watermarking, security, encryption, decryption, client, server.



Abstract

Ownership rights on outsourced relational database are very crucial issue in today’s internet environment and in many content distribution applications, because the rapid growth of the internet and related technologies offered an unprecedented ability to access and redistribute digital content. In earlier existing systems the relational data will be watermarked and directly send to the client system, in these systems while sending relational data from server to client attacker easily copy the data and create same copy of relational data. Here there is no security to watermarked relational data. In our proposed system before sending the watermarked relational data to client side we encrypt the relational data and send it to the client side, at client side decryption will be done to get the original watermarked data. Because of using this encryption technique even an attacker copy the data he/she may not read the watermarked relational data.
 
Download link:

A Formal Model for Data Flow Diagram Rules

Author Rosziati Ibrahim, Siow Yen Yen
On Pages 60-69
Volume No. 1
Issue No. 2
Issue Date May 01, 2011
Publishing Date May 01, 2011
Keywords Context diagram, data flow diagram, formal method, consistency rules

Abstract

A formal model for data flow diagram (DFD) rules is developed by introducing a syntax and semantics for its rules. DFD has been chosen because it is an approach for specifying, constructing and visualizing the model of a system graphically and has been in practical use on a very wide basis but still lacks formal and precise understanding. This formal model can be used to check the correctness of the diagrams and consistency among the diagrams.
 
Download link:

Wednesday 18 May 2011

Investigation and Computation of Unconditional and Conditional Bayesian Problems of Hypothesis Testing


AuthorKachiashvili K.J.
On Pages47-59
Volume No.1
Issue No.2
Issue DateMay 01, 2011
Publishing DateMay 01, 2011
KeywordsBayesian problem, hypotheses testing, significance level, conditional problem, computation of Bayesian tasks. AMS 2000 Subject Classifications: 62F15; 62F03




Abstract

In Bayesian statement of hypotheses testing, instead of unconditional problem of minimization of average risk caused by the errors of the first and the second types, there is offered to solve the conditional optimization problem when restrictions are imposed on the errors of one type and, under such conditions, the errors of the second type are minimized...

Download Link

Software Architecture Recovery through Graph Mining Technique and Reduction of Complexity Involved in A* Algorithm through Stable Marriage Problem


uthorPavankumar Kolla , Kolla HariPriyanka, R Manjula.
On Pages41-46
Volume No.1
Issue No.2
Issue DateMay 01, 2011
Publishing DateMay 01, 2011
KeywordsReverse Engineering, spanning tree, bipartite graph, AQL, Software Architecture recovery, Graph Matching Problem.




Abstract

This paper represents a technique for recovering the Software Architecture based on Graph Pattern Matching by the help of mining Techniques. Generally Software Architecture is represented in terms of graphs with set of vertices and edges. Finding the frequent data sets is the major step in the software architecture recovery. Many algorithms are proposed for this, for example Apriori based. In this paper to find the frequent data sets and a maximum association between the graphs we used an efficient algorithm called TMGM (tree based Maximal Graph Mining Technique)....

Download Link

An Improved, Prioritized Concurrency Control Scheme with Performance Gain in Mobile Environments


AuthorMohammed Khaja Nizamuddin, Syed Abdul Sattar
On Pages34-40
Volume No.1
Issue No.1
Issue DateApril 01, 2011
Publishing DateApril 01, 2011
KeywordsAbsolute Validity Interval, Priority Value, Semaphore, Mobile Host, Fixed Host




Abstract

In a mobile computing environment, clients can access shared data irrespective of their physical location and can be updated by each client independently. This leads to inconsistency of the data. Several concurrency control techniques are proposed in literature to prevent data inconsistency. In this paper we first analyze the existing scheme of concurrency control without locking and justify its performance limitations....

Download Link

Software Architecture Performance Quality Model: Qualitative Approach


AuthorIshaya Gambo, Abimbola Soriyan, Philip Achimugu
On Pages28-33
Volume No.1
Issue No.1
Issue DateApril 01, 2011
Publishing DateApril 01, 2011
KeywordsSoftware Architecture, Quality Model, SASPUM, PASA, ATAM




Abstract

As a communication vehicle among stakeholders, software architecture gives the entire view of the system’s major components, the behaviour of those components as visible to the rest of the system, and the ways in which these components interact and coordinate to achieve the system’s goal. The architecture determines the non-functional attributes of software systems that are built into quality models. In this paper we consider the performance attribute of a system.

Download Link