GDSF#, A BETTER
CACHING ALGORITHM THAT OPTIMIZES BOTH HIT RATE AND BYTE HIT RATE IN WEB
J. B. Patil and B. V.
Abstract: Web proxy caching is used
to improve the performance of the Web infrastructure. It aims to reduce
network traffic, server load, and user perceived retrieval delays. The
heart of a caching system is its page replacement policy, which needs
to make good replacement decisions when its cache is full and a new
document needs to be stored. The latest and most popular replacement
policies like GDSF use the file size, access frequency, and age in the
decision process. The effectiveness of any replacement policy can be
evaluated using two metrics: hit ratio (HR) and byte hit ratio (BHR).
There is always a trade-off between HR and BHR. In this paper, using
three different proxy server logs, we use trace driven analysis to
evaluate the effects of different replacement policies on the
performance of a Web server. We propose a modification of GDSF policy,
GDSF#, which allows augmenting or weakening the impact of size or
frequency or both on HR and BHR. Our simulation results show that our
proposed replacement policy GDSF# gives close to perfect performance in
both the important metrics: HR and BHR.
JERIM-320: A NEW 320-BIT HASH FUNCTION COMPARED TO HASH FUNCTIONS WITH
Sheena Mathew and
K. Poulose Jacob.
Abstract: This paper describes
JERIM-320, a new 320-bit hash function used for ensuring message
integrity and details a comparison with popular hash functions of
similar design. JERIM-320 and FORK-256 operate on four parallel lines
of message processing while RIPEMD-320 operates on two parallel lines.
Popular hash functions like MD5 and SHA-1 use serial successive
iteration for designing compression functions and hence are less
secure. The parallel branches help JERIM-320 to achieve higher level of
security using multiple iterations and processing on the message
blocks. The focus of this work is to prove the ability of JERIM 320 in
ensuring the integrity of messages to a higher degree to suit the fast
growing internet applications.
A SECURE GATEWAY SOLUTION FOR WIRELESS AD-HOC NETWORKS.
Sandip Vijay and S. C.
Abstract: This paper reviewed the
secure characteristics of mobile devices that can use wireless networks
almost anywhere and anytime by using one or more wireless network
technologies. These technologies enable the use of infrastructured
networks and ad-hoc networks. Further it describes the characteristics
of wireless ad-hoc networks and the environment for the different
possible gateway implementation. The gateway implementation provides a
secure generic solution for accessing the infrastructured network from
the ad-hoc network, and it provides multiple security levels that
enable different security levels for different networking environments.
It describes the environment in which the gateway is used, introduces
potential gateway solutions, and chooses the most appropriate gateway
solution and provides the gateway specification for the wireless ad hoc
network. The minimum, essential and additional functional requirements
are chosen for effective functionality of gateway. At the end, optional
functional requirements are not implemented, but they are described
with their features that may be implemented in the future.
OPTIMISED EIGENSTRUCTURE ASSIGNMENT BY ANT SYSTEM AND LQR APPROACHES.
Douik Ali, Liouane Hend
and Messaoud Hassani.
Abstract: Recently, it has been
verified that applications of metaheuristics for finding optimal or
suboptimal solutions for NP-hard optimisation problems is one of the
most promising research fields. Using the ant system metaheuristic,
this paper proposes a new design method for state feedback control law
which simultaneously achieves the linear quadratic stabilisation and an
eigenstructure assignment corresponding to partial closed-loop
eigenvalues and eigenvectors. As a typical application of the method,
flight control design for an aircraft state space model is presented to
illustrate the application of the Ant System and LQR method, the
purpose of which is to find a state feedback controller that leads to a
specified eigenstructure assignment.
PREDICTIVE MODELING OF INTER-TRANSACTION ASSOCIATION RULES – A BUSINESS
D. Bhanu and P.
Abstract: Traditional association
rules are mostly mining intra-transaction associations i.e.,
associations among items within the same transaction where the idea
behind the transaction could be the items bought by the same customer.
In our work, we utilize the framework of inter-transaction association
rules, which associate events across a window of transaction. The new
association relationship breaks the barriers of transaction and can be
used for prediction. Typically, the rules generated are derived from
the patterns in a particular dataset. A major issue that needs more
attention is the soundness of the rules outside of the dataset from
which they are generated. When new phenomenon happens, the change in
set of rules generated from the new dataset becomes more significant.
In this paper, we provide a model for understanding how the differences
between different situations affect the changes of the rules based on
the concept of groups what we call factions. Also we provide a
technique called Coalescent dataset, to generate set of rules for a new
situation. Various experimental results are reported by comparing with
real life and synthetic datasets, and we show the effectiveness of our
work in generating rules and in finding acceptable set of rules under