排序方式: 共有17条查询结果,搜索用时 417 毫秒
1.
2.
3.
4.
Janakiraman Vivekanandan Arunachalam Mahudeswaran Xiao-Yan Tang Sangamesh G. Kumbar Pachanoor Subbaian Vijayanand 《Chemical Papers》2015,69(7):964-972
Novel copolymers of poly(aniline-co-m-chloroaniline)-doped dodecylbenzenesulphonic acid (DBSA) with embedded silver nanoparticles were synthesised using the in situ chemical oxidative method. The structural properties of the copolymers were characterised using the UV-VIS and FTIR spectroscopic methods. The crystalline nature of the copolymer was demonstrated by way of the X-ray diffraction (XRD) pattern. Scanning electron microscopy (SEM) revealed the presence of particle agglomerates measuring 50 nm to 100 nm on the surface of the nanocomposites. The electrical conductivity of the copolymer was dependent on the monomer composition and was found to be in the range of 10?2 S cm?1 to 10?6 S cm?1 with an increasing chloroaniline content and exhibiting improved solubility. 相似文献
5.
Biswal Rasmita Nayak Debasis Janakiraman S. Chaudhary N. Vijay Prakash Ghosh Sudipto Adyam Venimadhav 《Journal of Solid State Electrochemistry》2021,25(2):561-573
Journal of Solid State Electrochemistry - The tin oxide (SnO2) thin films have been prepared by the pulsed laser deposition (PLD) at deposition temperatures (Td) ranging from 300 to... 相似文献
6.
Paul A. Catlin Iqbalunnisa T. N. Janakiraman N. Srinivasan 《Journal of Graph Theory》1990,14(3):347-364
Let G be an undirected connected graph that is not a path. We define h(G) (respectively, s(G)) to be the least integer m such that the iterated line graph Lm(G) has a Hamiltonian cycle (respectively, a spanning closed trail). To obtain upper bounds on h(G) and s(G), we characterize the least integer m such that Lm(G) has a connected subgraph H, in which each edge of H is in a 3-cycle and V(H) contains all vertices of degree not 2 in Lm(G). We characterize the graphs G such that h(G) — 1 (respectively, s(G)) is greater than the radius of G. 相似文献
7.
Roughness analysis of fracture in precursor-derived amorphous and phase segregated Si–C–N ceramics using fractal methods is reported, towards examining the possible correlations between fractal scaling of roughness and fracture properties as well as fracture damage mechanisms. Topography of the fracture surfaces created at a crack velocity of ~10?4 m/s was recorded using atomic force microscopy, and analyzed using RMS roughness and second order height–height correlation functions. The evolution of roughness was well correlated with the evolution of structural and compositional inhomogeneities in the amorphous materials, and the formation of second phases in the phase segregated materials. All the investigated fracture surfaces displayed self-affine scaling with a correlation length of ~50–100 nm and a roughness exponent of 0.8 ± 0.1, commensurate with the universal exponent conjectured by Bouchaud et al. corresponding to dynamic damage regime. No correlation was observed between the roughness exponents and the fracture toughness of the corresponding materials. Examination of the crack opening near the tip region revealed no persistent damage cavities assignable to ‘plastic deformation’ preceding fracture, suggesting that the fracture in the Si–C–N ceramics proceeds in a brittle manner at the employed crack velocities. 相似文献
8.
Hariharan R Janakiraman A Nilakantan R Singh B Varghese S Landrum G Schuffenhauer A 《Journal of chemical information and modeling》2011,51(4):788-806
Several efficient correspondence graph-based algorithms for determining the maximum common substructure (MCS) of a pair of molecules have been published in the literature. The extension of the problem to three or more molecules is however nontrivial; heuristics used to increase the efficiency in the two-molecule case are either inapplicable to the many-molecule case or do not provide significant speedups. Our specific algorithmic contribution is two-fold. First, we show how the correspondence graph approach for the two-molecule case can be generalized to obtain an algorithm that is guaranteed to find the optimum connected MCS of multiple molecules, and that runs fast on most families of molecules using a new divide-and-conquer strategy that has hitherto not been reported in this context. Second, we provide a characterization of those compound families for which the algorithm might run slowly, along with a heuristic for speeding up computations on these families. We also extend the above algorithm to a heuristic algorithm to find the disconnected MCS of multiple molecules and to an algorithm for clustering molecules into groups, with each group sharing a substantial MCS. Our methods are flexible in that they provide exquisite control on various matching criteria used to define a common substructure. 相似文献
9.
S. Janakiraman Ravi S. Nanjundiah A.S. Vasudeva Murthy 《Journal of computational physics》2012,231(7):2794-2810
A variable resolution global spectral method is created on the sphere using High resolution Tropical Belt Transformation (HTBT). HTBT belongs to a class of map called reparametrisation maps. HTBT parametrisation of the sphere generates a clustering of points in the entire tropical belt; the density of the grid point distribution decreases smoothly in the domain outside the tropics. This variable resolution method creates finer resolution in the tropics and coarser resolution at the poles. The use of FFT procedure and Gaussian quadrature for the spectral computations retains the numerical efficiency available with the standard global spectral method. Accuracy of the method for meteorological computations are demonstrated by solving Helmholtz equation and non-divergent barotropic vorticity equation on the sphere. 相似文献
10.
Prabhu Janakiraman 《Transactions of the American Mathematical Society》2006,358(5):1937-1952
The following limit result holds for the weak-type (1,1) constant of dilation-commuting singular integral operator in : for , , For the maximal operator , the corresponding result is