Abstract: Cryptographic algorithms play a crucial role in the
information society by providing protection from unauthorized
access to sensitive data. It is clear that information technology will
become increasingly pervasive, Hence we can expect the emergence
of ubiquitous or pervasive computing, ambient intelligence. These
new environments and applications will present new security
challenges, and there is no doubt that cryptographic algorithms and
protocols will form a part of the solution. The efficiency of a public
key cryptosystem is mainly measured in computational overheads,
key size and bandwidth. In particular the RSA algorithm is used in
many applications for providing the security. Although the security
of RSA is beyond doubt, the evolution in computing power has
caused a growth in the necessary key length. The fact that most chips
on smart cards can-t process key extending 1024 bit shows that there
is need for alternative. NTRU is such an alternative and it is a
collection of mathematical algorithm based on manipulating lists of
very small integers and polynomials. This allows NTRU to high
speeds with the use of minimal computing power. NTRU (Nth degree
Truncated Polynomial Ring Unit) is the first secure public key
cryptosystem not based on factorization or discrete logarithm
problem. This means that given sufficient computational resources
and time, an adversary, should not be able to break the key. The
multi-party communication and requirement of optimal resource
utilization necessitated the need for the present day demand of
applications that need security enforcement technique .and can be
enhanced with high-end computing. This has promoted us to develop
high-performance NTRU schemes using approaches such as the use
of high-end computing hardware. Peer-to-peer (P2P) or enterprise
grids are proven as one of the approaches for developing high-end
computing systems. By utilizing them one can improve the
performance of NTRU through parallel execution. In this paper we
propose and develop an application for NTRU using enterprise grid
middleware called Alchemi. An analysis and comparison of its
performance for various text files is presented.
Abstract: In this paper, linear multistep technique using power
series as the basis function is used to develop the block methods
which are suitable for generating direct solution of the special second
order ordinary differential equations of the form y′′ = f(x,y), a < = x < = b with associated initial or boundary conditions. The continuaous hybrid formulations enable us to differentiate and evaluate at some
grids and off – grid points to obtain two different three discrete
schemes, each of order (4,4,4)T, which were used in block form for
parallel or sequential solutions of the problems. The computational
burden and computer time wastage involved in the usual reduction of
second order problem into system of first order equations are avoided
by this approach. Furthermore, a stability analysis and efficiency of
the block method are tested on linear and non-linear ordinary
differential equations whose solutions are oscillatory or nearly
periodic in nature, and the results obtained compared favourably with
the exact solution.
Abstract: Octree compression techniques have been used
for several years for compressing large three dimensional data
sets into homogeneous regions. This compression technique
is ideally suited to datasets which have similar values in
clusters. Oil engineers represent reservoirs as a three dimensional
grid where hydrocarbons occur naturally in clusters. This
research looks at the efficiency of storing these grids using
octree compression techniques where grid cells are broken
into active and inactive regions. Initial experiments yielded
high compression ratios as only active leaf nodes and their
ancestor, header nodes are stored as a bitstream to file on
disk. Savings in computational time and memory were possible
at decompression, as only active leaf nodes are sent to the
graphics card eliminating the need of reconstructing the original
matrix. This results in a more compact vertex table, which can
be loaded into the graphics card quicker and generating shorter
refresh delay times.
Abstract: Workload and resource management are two essential functions provided at the service level of the grid software infrastructure. To improve the global throughput of these software environments, workloads have to be evenly scheduled among the available resources. To realize this goal several load balancing strategies and algorithms have been proposed. Most strategies were developed in mind, assuming homogeneous set of sites linked with homogeneous and fast networks. However for computational grids we must address main new issues, namely: heterogeneity, scalability and adaptability. In this paper, we propose a layered algorithm which achieve dynamic load balancing in grid computing. Based on a tree model, our algorithm presents the following main features: (i) it is layered; (ii) it supports heterogeneity and scalability; and, (iii) it is totally independent from any physical architecture of a grid.
Abstract: The optimal bisection width of r-dimensional N×
· · ·× N grid is known to be Nr-1 when N is even, but when
N is odd, only approximate values are available. This paper
shows that the exact bisection width of grid is Nr
-1
N-1 when N is odd.
Abstract: Circle grid space filling plate is a flow conditioner with a fractal pattern and used to eliminate turbulence originating from pipe fittings in experimental fluid flow applications. In this paper, steady state, incompressible, swirling turbulent flow through circle grid space filling plate has been studied. The solution and the analysis were carried out using finite volume CFD solver FLUENT 6.2. Three turbulence models were used in the numerical investigation and their results were compared with the pressure drop correlation of BS EN ISO 5167-2:2003. The turbulence models investigated here are the standard k-ε, realizable k-ε, and the Reynolds Stress Model (RSM). The results showed that the RSM model gave the best agreement with the ISO pressure drop correlation. The effects of circle grids space filling plate thickness and Reynolds number on the flow characteristics have been investigated as well.
Abstract: Social, mobility and information aggregation inside
business environment need to converge to reach the next step of
collaboration to enhance interaction and innovation. The following
article is based on the “Assemblage" concept seen as a framework to
formalize new user interfaces and applications. The area of research
is the Energy Social Business Environment, especially the Energy
Smart Grids, which are considered as functional and technical
foundations of the revolution of the Energy Sector of tomorrow. The
assemblages are modelized by means of mereology and simplicial
complexes. Its objective is to offer new central attention and
decision-making tools to end-users.
Abstract: This paper proposes a visual cryptography by random
grids scheme with identifiable shares. The method encodes an image
O in two shares that exhibits the following features: (1) each generated
share has the same scale as O, (2) any share singly has noise-like
appearance that reveals no secret information on O, (3) the secrets can
be revealed by superimposing the two shares, (4) folding a share up
can disclose some identification patterns, and (5) both of the secret
information and the designated identification patterns are recognized
by naked eye without any computation. The property to show up
identification patterns on folded shares establishes a simple and
friendly interface for users to manage the numerous shares created by
VC schemes.
Abstract: In this paper we present an extension to Vision Based
LRTA* (VLRTA*) known as Vision Based Moving Target Search
(VMTS) for capturing unknown moving target in unknown territory
with randomly generated obstacles. Target position is unknown to the
agents and they cannot predict its position using any probability
method. Agents have omni directional vision but can see in one
direction at some point in time. Agent-s vision will be blocked by the
obstacles in the search space so agent can not see through the
obstacles. Proposed algorithm is evaluated on large number of
scenarios. Scenarios include grids of sizes from 10x10 to 100x100.
Grids had obstacles randomly placed, occupying 0% to 50%, in
increments of 10%, of the search space. Experiments used 2 to 9
agents for each randomly generated maze with same obstacle ratio.
Observed results suggests that VMTS is effective in locate target
time, solution quality and virtual target. In addition, VMTS becomes
more efficient if the number of agents is increased with proportion to
obstacle ratio.
Abstract: A Web-services based grid infrastructure is evolving to be readily available in the near future. In this approach, the Web services are inherited (encapsulated or functioned) into the same existing Grid services class. In practice there is not much difference between the existing Web and grid infrastructure. Grid services emerged as stateful web services. In this paper, we present the key components of web-services based grid and also how the resource discovery is performed on web-services based grid considering resource discovery, as a critical service, to be provided by any type of grid.
Abstract: Phase-Contrast MR imaging methods are widely used
for measurement of blood flow velocity components. Also there are
some other tools such as CT and Ultrasound for velocity map
detection in intravascular studies. These data are used in deriving
flow characteristics. Some clinical applications are investigated
which use pressure distribution in diagnosis of intravascular disorders
such as vascular stenosis. In this paper an approach to the problem of
measurement of intravascular pressure field by using velocity field
obtained from flow images is proposed. The method presented in this
paper uses an algorithm to calculate nonlinear equations of Navier-
Stokes, assuming blood as an incompressible and Newtonian fluid.
Flow images usually suffer the lack of spatial resolution. Our
attempt is to consider the effect of spatial resolution on the pressure
distribution estimated from this method. In order to achieve this aim,
velocity map of a numerical phantom is derived at six different
spatial resolutions. To determine the effects of vascular stenoses on
pressure distribution, a stenotic phantom geometry is considered. A
comparison between the pressure distribution obtained from the
phantom and the pressure resulted from the algorithm is presented. In
this regard we also compared the effects of collocated and staggered
computational grids on the pressure distribution resulted from this
algorithm.
Abstract: Grid environments include aggregation of
geographical distributed resources. Grid is put forward in three types
of computational, data and storage. This paper presents a research on
data grid. Data grid is used for covering and securing accessibility to
data from among many heterogeneous sources. Users are not worry
on the place where data is located in it, provided that, they should get
access to the data. Metadata is used for getting access to data in data
grid. Presently, application metadata catalogue and SRB middle-ware
package are used in data grids for management of metadata. At this
paper, possibility of updating, streamlining and searching is provided
simultaneously and rapidly through classified table of preserving
metadata and conversion of each table to numerous tables.
Meanwhile, with regard to the specific application, the most
appropriate and best division is set and determined. Concurrency of
implementation of some of requests and execution of pipeline is
adaptability as a result of this technique.
Abstract: Some meta-schedulers query the information system of individual supercomputers in order to submit jobs to the least busy supercomputer on a computational Grid. However, this information can become outdated by the time a job starts due to changes in scheduling priorities. The MSR scheme is based on Multiple Simultaneous Requests and can take advantage of opportunities resulting from these priorities changes. This paper presents the SWARM meta-scheduler, which can speed up the execution of large sets of tasks by minimizing the job queuing time through the submission of multiple requests. Performance tests have shown that this new meta-scheduler is faster than an implementation of the MSR scheme and the gLite meta-scheduler. SWARM has been used through the GridQTL project beta-testing portal during the past year. Statistics are provided for this usage and demonstrate its capacity to achieve reliably a substantial reduction of the execution time in production conditions.