Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Chandran, A." wg kryterium: Autor


Wyświetlanie 1-8 z 8
Tytuł:
Flexural behaviour of strengthened RC beams with multi-directional basalt fibre-reinforced polymer composites
Autorzy:
Chandran, A.
Neelamegam, M.
Powiązania:
https://bibliotekanauki.pl/articles/230925.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
włókno bazaltowe
kompozyt polimerowy
wzmocnienie wielokierunkowe
sztywność
belka wzmocniona
basalt fibre
reinforced polymer composite
multidirectional reinforcing
stiffness
strengthened beam
Opis:
The paper describes an experimental behaviour of the basalt fibre reinforced polymer composite by external strengthening to the concrete beams. The BFRP composite is wrapped at the bottom face of R.C beam as one layer, two layers, three layers and four layers. The different characteristics - are studied in - first crack load, ultimate load, tensile and compressive strain, cracks propagation, crack spacing and number of cracks etc. To - investigate, total of five beams size 100mmx 160mmx 1700mm were cast. One beam is taken as control and others are strengthened with BFRP composite with layers. From this investigation, the first crack load is increased depending on the increment in layers from 6.79% to 47.98%. Similarly, the ultimate load carrying - capacity is increased from 5.66% to 20%. The crack’s spacing is also reduced with an increase in the number of layers.
Źródło:
Archives of Civil Engineering; 2015, 61, 1; 45-58
1230-2945
Pojawia się w:
Archives of Civil Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Diversity of Recent Benthic Foraminifera and its Environmental Condition of Selected Estuaries in Tamil Nadu, India
Autorzy:
Yoganandan, V.
Chandran, A. Siva
Arunkarthik, P.
Kavinila, S.
Powiązania:
https://bibliotekanauki.pl/articles/1031823.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Distribution and Ecology
Foraminifera
Systematic Paleontology
Opis:
Micropaleontological investigation has been carried out, for the first time to study the systematic of recent Benthic Foraminifera from the southeast coast flowing river estuaries Cauvery, Athankarai and Thamirabarani, Tamil Nadu, India. Totally 16 sediment samples were collected during December 2018. Benthic foraminiferal species, belonging to 14 species, 7 families and 5 Sub-orders are identified. Among this Miliolida (>75%) occupies the dominant place followed by Rotaliida (<25%). The higher species are observed in the rivermouth area particularly in the Cauvery estuary sample (365 species of Ammonia beccarii). The following species are abundantly distributed in this region namely Ammonia beccarii, Quinqueloculina and Miliolinella subrotunda. The abundance of species in the river mouth may be due to the mixing of marine and nearshore environment.
Źródło:
World News of Natural Sciences; 2020, 30, 2; 75-88
2543-5426
Pojawia się w:
World News of Natural Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The vertex detour hull number of a graph
Autorzy:
Santhakumaran, A.
Ullas Chandran, S.
Powiązania:
https://bibliotekanauki.pl/articles/743332.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
detour
detour number
detour hull number
x-detour number
x-detour hull number
Opis:
For vertices x and y in a connected graph G, the detour distance D(x,y) is the length of a longest x - y path in G. An x - y path of length D(x,y) is an x - y detour. The closed detour interval I_D[x,y] consists of x,y, and all vertices lying on some x -y detour of G; while for S ⊆ V(G), $I_D[S] = ⋃_{x,y ∈ S} I_D[x,y]$. A set S of vertices is a detour convex set if $I_D[S] = S$. The detour convex hull $[S]_D$ is the smallest detour convex set containing S. The detour hull number dh(G) is the minimum cardinality among subsets S of V(G) with $[S]_D = V(G)$. Let x be any vertex in a connected graph G. For a vertex y in G, denoted by $I_D[y]^x$, the set of all vertices distinct from x that lie on some x - y detour of G; while for S ⊆ V(G), $I_D[S]^x = ⋃_{y ∈ S} I_D[y]^x$. For x ∉ S, S is an x-detour convex set if $I_D[S]^x = S$. The x-detour convex hull of S, $[S]^x_D$ is the smallest x-detour convex set containing S. A set S is an x-detour hull set if $[S]^x_D = V(G) -{x}$ and the minimum cardinality of x-detour hull sets is the x-detour hull number dhₓ(G) of G. For x ∉ S, S is an x-detour set of G if $I_D[S]^x = V(G) - {x}$ and the minimum cardinality of x-detour sets is the x-detour number dₓ(G) of G. Certain general properties of the x-detour hull number of a graph are studied. It is shown that for each pair of positive integers a,b with 2 ≤ a ≤ b+1, there exist a connected graph G and a vertex x such that dh(G) = a and dhₓ(G) = b. It is proved that every two integers a and b with 1 ≤ a ≤ b, are realizable as the x-detour hull number and the x-detour number respectively. Also, it is shown that for integers a,b and n with 1 ≤ a ≤ n -b and b ≥ 3, there exist a connected graph G of order n and a vertex x such that dhₓ(G) = a and the detour eccentricity of x, $e_D(x) = b$. We determine bounds for dhₓ(G) and characterize graphs G which realize these bounds.
Źródło:
Discussiones Mathematicae Graph Theory; 2012, 32, 2; 321-330
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The hull number of strong product graphs
Autorzy:
Santhakumaran, A.
Ullas Chandran, S.
Powiązania:
https://bibliotekanauki.pl/articles/743965.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
strong product
geodetic number
hull number
extreme hull graph
Opis:
For a connected graph G with at least two vertices and S a subset of vertices, the convex hull $[S]_G$ is the smallest convex set containing S. The hull number h(G) is the minimum cardinality among the subsets S of V(G) with $[S]_G = V(G)$. Upper bound for the hull number of strong product G ⊠ H of two graphs G and H is obtainted. Improved upper bounds are obtained for some class of strong product graphs. Exact values for the hull number of some special classes of strong product graphs are obtained. Graphs G and H for which h(G⊠ H) = h(G)h(H) are characterized.
Źródło:
Discussiones Mathematicae Graph Theory; 2011, 31, 3; 493-507
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The geodetic number of strong product graphs
Autorzy:
Santhakumaran, A.
Ullas Chandran, S.
Powiązania:
https://bibliotekanauki.pl/articles/744104.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
geodetic number
extreme vertex
extreme geodesic graph
open geodetic number
double domination number
Opis:
For two vertices u and v of a connected graph G, the set $I_G[u,v]$ consists of all those vertices lying on u-v geodesics in G. Given a set S of vertices of G, the union of all sets $I_G[u,v]$ for u,v ∈ S is denoted by $I_G[S]$. A set S ⊆ V(G) is a geodetic set if $I_G[S] = V(G)$ and the minimum cardinality of a geodetic set is its geodetic number g(G) of G. Bounds for the geodetic number of strong product graphs are obtainted and for several classes improved bounds and exact values are obtained.
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 4; 687-700
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The edge geodetic number and Cartesian product of graphs
Autorzy:
Santhakumaran, A.
Ullas Chandran, S.
Powiązania:
https://bibliotekanauki.pl/articles/744517.pdf
Data publikacji:
2010
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
geodetic number
edge geodetic number
linear edge geodetic set
perfect edge geodetic set
(edge, vertex)-geodetic set
superior edge geodetic set
Opis:
For a nontrivial connected graph G = (V(G),E(G)), a set S⊆ V(G) is called an edge geodetic set of G if every edge of G is contained in a geodesic joining some pair of vertices in S. The edge geodetic number g₁(G) of G is the minimum order of its edge geodetic sets. Bounds for the edge geodetic number of Cartesian product graphs are proved and improved upper bounds are determined for a special class of graphs. Exact values of the edge geodetic number of Cartesian product are obtained for several classes of graphs. Also we obtain a necessary condition of G for which g₁(G ☐ K₂) = g₁(G).
Źródło:
Discussiones Mathematicae Graph Theory; 2010, 30, 1; 55-73
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Gaze-J2K: gaze-influenced image coding using eye trackers and JPEG 2000
Autorzy:
Nguyen, A.
Chandran, V.
Sridharan, S.
Powiązania:
https://bibliotekanauki.pl/articles/309070.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
eye tracking
image compression
importance map
JPEG 2000
region of interest
Opis:
The use of visual content in applications of the digital computer has increased dramatically with the advent of the Internet and world wide web. Image coding standards such as JPEG 2000 have been developed to provide scalable and progressive compression of imagery. Advances in image and video analysis are also making human-computer interaction multi-modal rather than through the use of a keyboard or mouse. An eye tracker is an example input device that can be used by an application that displays visual content to adapt to the viewer. Many features are required of the format to facilitate this adaptation, and some are already part of image coding standards such as JPEG 2000. This paper presents a system incorporating the use of eye tracking and JPEG 2000, called Gaze-J2K, to allow a customised encoding of an image by using a user's gaze pattern. The gaze pattern is used to automatically determine and assign importance to fixated regions in an image, and subsequently constrain the encoding of the image to these regions.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 1; 3-10
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Natural convection in a hydrodynamically and thermally anisotropic non-rectangular porous cavity: effect of internal heat generation/absorption
Autorzy:
Chandran, P.
Sacheti, N. C.
Bhadauria, B. S.
Singh, A. K.
Powiązania:
https://bibliotekanauki.pl/articles/264468.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
konwekcja naturalna
materiały porowate
przepuszczalność
dyfuzyjność cieplna
źródło ciepła
natural convection
trapezoidal cavity
porous medium
permeability
thermal diffusivity
Darcy's law
heat source/sink
Opis:
Laminar natural convection in a trapezoidal porous vertical cavity has been investigated in this work. It is assumed that the porous enclosure is filled up with a permeable material subject to hydrodynamic and thermal anisotropy, the flow being governed by the Darcy law as applicable to a non-isotropic medium. It is further assumed that (i) there is heating at the left vertical wall and cooling at the right wall of the enclosure and (ii) the flow domain is subject to the presence of heat source or heat sink. The partial differential equations governing the resulting free convection have been solved numerically in the non-dimensional forms. There arises a number of parameters relating to buoyancy, internal heating, cavity aspect ratio and inclination of the upper surface to the horizontal. The influence of these parameters has been illustrated and analyzed through contours of streamlines and isotherms. We have also discussed the role of internal heating as well as anisotropy on the heat transfer characteristics.
Źródło:
International Journal of Applied Mechanics and Engineering; 2018, 23, 3; 595-609
1734-4492
2353-9003
Pojawia się w:
International Journal of Applied Mechanics and Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-8 z 8

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies