Sivakumar Nagarajan

  • Citations Per Year
Learn More
The fabrication of mesoporous silica films with well-defined morphologies offers tremendous opportunity for device structures. In particular the generation of a mesoporous silica film with cylindrical nanochannels of prescribed diameters oriented normal to the substrate holds great promise for applications in catalysis, bio-molecular separations, sensors,(More)
This paper proposes two different parallel genetic algorithms (PGAs) for constrained ordering problems. Constrained ordering problems are constraint optimization problems (COPs) for which it is possible represent a candidate solution as a permutation of objects. A decoder is used to decode this permutation into an instantiafion of the COP vm-iables. Two(More)
In the title compound, C17H12ClNO2, the dihedral angle between the mean planes of the quinoline ring system and the benzene ring is 68.7 (7)°. The mean plane of the carboxyl-ate group is twisted from the latter planes by 14.0 (1) and 80.2 (4)°, respectively. In the crystal, weak C-H⋯O inter-actions are observed, forming chains along [001]. In addition, π-π(More)
The present study demonstrates an original approach by which Au nanoparticles (approximately 10 nm) are embedded into TiO2 fibers via electrospinning. The photocatalytic performance of the resultant fibrous material was studied and related to the architecture and the nature of the internal interfaces in the composite. It was found that embedment of nano Au(More)
The Szeged index of a graph G is defined as S z(G) = ∑ uv = e ∈ E(G) nu(e)nv(e), where nu(e) is number of vertices of G whose distance to the vertex u is less than the distance to the vertex v in G. Similarly, the revised Szeged index of G is defined as S z∗(G) = ∑ uv = e ∈ E(G) ( nu(e) + nG(e) 2 ) ( nv(e) + nG(e) 2 ) , where nG(e) is the number of(More)
Non binary constraints have recently been studied quite extensively since they represent real life problems very naturally. Specifically, extensions to binary arc consistency into generalised arc consistency (GAC), and forward checking that incorporates a limited amount of GAC have been proposed, to handle non-binary constraints directly. Enforcing arc(More)
In this paper we present a synthesis based randomised algorithm for general constraint satisfaction problems, which is amenable to parallelisation. The algorithm is based on Pang's synthesis algorithm CDGT which produces solutions on the total set of variables by constructing partial solutions on subsets of variables and then joining them. The intent of our(More)