*********************

Lingping ZHONG
On The Harmonic Index and The Girth for Graphs
pp. 253–260

 

 

Abstract.The harmonic index of a graph G is defined as the sum of the weights  of all edges uv of G, where d(u) denotes the degree of a vertex u in G. In this work, we present the minimum and maximum values of the harmonic index for connected graphs with girth at least k (), and characterize the corresponding extremal graphs. Using this result, we obtain several relations between the harmonic index and the girth of a graph. Read the pdf.

 

 

 

 

 

 

 

 

 

 

 

*********************

Andrei ALEXANDRU, Gabriel CIOBANU
Nominal Techniques for -Calculus
pp. 261–286

 

Abstract. We present a new semantics of the πI-calculus, namely the nominal semantics. A set of compact transition rules is given in terms of nominal logic by using a specific nominal quantifier. Based on several nominal techniques, it is proved an equivalence between the new nominal semantics and the original semantics of the πI-calculus, emphasizing the benefits of presenting the transition rules by using the nominal techniques. Read the pdf.

 

 

 

 

 

 

 

 

 

 

 

*********************

Hitendra GARG, Suneeta AGARWAL
A Secure Image Based Watermarking for 3D Polygon Mesh
pp. 287–303

 

Abstract. The proposed watermarking algorithm is based on geometrical properties of 3D mesh. The vertices of 3D mesh surface are categorized into flat, peak and deeper region. We first compare the perceivable distortion due to watermark insertion in the vertices of deep surfaces and the vertices belonging to either flat or peak surfaces. Our comparative analysis shows that insertion of watermark in deeper surface have less distortion in comparison to watermark insertion in flat and peak surfaces. In view of the fact, these vertices are categorized into three mutually exclusive groups. The first group (S1) is composed by the vertices of deeper area. For obtaining the vertices of second group (S2), the vertex normal is represented in IEEE-754 representation and nth bit of mantissa is considered as ‘1’. The third set (S3) contains the remaining vertices. The
vertices from S1 and S2 are selected for watermark embedding according to the secure code, which is obtained from hash function applied over the secure image (I). The vertices of S3 remain intact. The watermark embedding is done by repositioning the selected vertices from their original positions according to the category they belong to. The robustness is assessed against different distortion and distortionless attacks. The subjective (MoS) and objective (Hausdorff distance, RMS) assessment of watermarked object are also done to measure the extend of similarity between original object and watermarked object. Read the pdf

 

 

 

 

 

 

 

 

 

 

 

*********************

Mugurel Ionuţ ANDREICA, Nicolae ŢĂPUŞ
Sequential Algorithms for Constructing an “Out-of-Place” Multidimensional
Quad-Tree Index for Answering Exact and Approximate Fixed-Radius Nearest Neighbor Queries
pp. 304–323

 

Abstract. Answering nearest neighbor queries is an important problem in many areas, ranging from geographic systems to similarity searching in object data-bases (e.g. image and video databases). In order to answer such queries efficiently, an index data structure is usually constructed over the searched objects. In this paper we present novel top-down and bottom-up sequential algorithms for constructing a multidimensional quad-tree index. In all the algorithms the objects may be indexed in association with both quad-tree nodes which they intersect and those which they do not intersect. The common aspect of all the
algorithms is that, in order to answer a query, only a single node of the index will need to be searched. The work presented in this paper continues the work presented in [21]. Read the pdf

 

 

 

 

 

 

 

 

 

 

 

*********************

Kan WU, Peng GONG, Jiantao WANG, Xiaopeng YAN, Ping LI
An Improved Authentication Protocol for Session Initiation Protocol Using Smart
Card and Elliptic Curve Cryptography
pp. 324–335

 

Abstract. The authenticated key agreement protocol is an important security protocol for the session initiation protocol, which allows the and the server to authenticate each other and generate a shared session key for privacy, integrity, and non-repudiation in their communications. Recently, Zhang et al. proposed a new authenticated key agreement protocol for the session initiation protocol using smart card and claimed their protocol was secure against various attacks. However, we found that Zhang et al.'s protocol cannot withstand the user impersonation attack, i. e., a malicious user could impersonate any other user to the server. We also propose a new authenticated key agreement protocol
using smart card for SIP which is immune to the presented attack. Besides, the proposed protocol also has better performance than Zhang et al.'s protocol. Read the pdf.

 

 

 

 

 

 

 

 

 

 

 

*********************

Călin BÎRĂ, Lucian PETRICĂ, Radu HOBINCU
OPINCAA: A Light-Weight and Flexible Programming Environment For Parallel
SIMD Accelerators
pp. 336–350

 

Abstract. The programming environment is often a key enabler of productivity and performance in any software development project. In a hardwaresoftware co-design scenario, the programming environment must easily adapt to changes in the parameters of the underlying hardware computation platform, and must be able to accurately measure the performance of the hardware in order to guide software development. In this paper we present OPINCAA, a framework for programming parallel accelerators which implement the ConnexArray architecture. OPINCAA provides a C++ syntax for accelerator software development, and the infrastructure for dispatching instructions to the accelerator.
OPINCAA is also designed to easily interface with architectural and circuit-level simulators, and provides tools for performance analysis and automatic tuning of accelerator code. We evaluate OPINCAA in conjunction with a FPGA implementation
of the ConnexArray, and demonstrate how it can be used to develop, debug and optimize vector applications. Read the pdf

 

 

 

 

 

 

 

 

 

 

 

*********************

Jianshu MAO, Bo ZHOU
Ordering Trees by Sum-Connectivity Indices
pp. 351–364

 

Abstract. The sum-connectivity index of graph G is defined as the sum of the weights of the edges of G, where the weight of an edge uv of G is  with dG(u) being the degree of vertex u in G. We determine the n-vertex trees with the fourth for , the fifth for , the sixth, and the seventh for maximum sum-connectivity indices, and the n-vertex trees with the fourth, the fifth, the sixth, and the seventh for , and the eighth for minimum sum-connectivity indices. Read the pdf.

 

 

 

 

 

 

 

 

 

 

 

*********************

Angel Martin DEL REY
A Note on the Reversibility of Elementary Cellular Automaton 150 with Periodic
Boundary Conditions
pp. 365–372

 

Abstract. In this work, the reversibility problem for the elementary cellular automaton with rule number 150 is tackled. Although this problem was solved before, we will introduce in this work an alternative construction of the inverse cellular automaton by means of the transition matrices instead of transition dipolynomials. This new approach allows one to obtain a more efficient and effective algorithm to compute the inverse cellular automaton. Read the pdf.

 

 

 

 

 

 

 

 

 

 

 

*********************

Sunita BANSAL, Chittaranjan HOTA
Distributed Scheduling on Utility Grids
pp. 373–392

 

Abstract. Grid computing aggregates the power of widely distributed resources and provides non-trivial services to the users. Resource management and scheduling play a crucial role in Grid computing environment. It becomes more challenging in Utility Grids, where consumer wants to pay minimum amount and providers want to earn maximum amount. Many existing scheduling approaches are dedicated to either single criterion or multi-criteria. Existing multi-criteria systems give weight to each criterion according to its relative importance. Users need not worry about the choice of these criteria. These algorithms are less efficient in terms of time complexity and memory utilization. In this paper, we propose an efficient distributed scheduling algorithm on Utility Grids based on Technique for Order Preference by Similarity to Ideal Solution (TOPSIS). We have introduced a new parameter called Processing Element (PE) weight. The objective of this parameter is to select the resource that carves out smallest possible free PE cluster that satisfies the user requirements. User and system defined weights are used to select resource and evaluate the performance of the algorithm. The GridSim toolkit with standard workload model is used to simulate the Grid environment. The simulation results show that our algorithms perform better over existing approaches in terms of user satisfaction and number of application failures. Read the pdf.