Spontaneous self-assembly of designed cyclic dipeptide (Phg-Phg) into two-dimensional nano- and mesosheets

In this study, we present the spontaneous self-assembly of designed simplest aromatic cyclic dipeptides of (L-Phg-L-Phg) and (D-Phg-L-Phg) to form highly stable two-dimensional (2D) nano- and mesosheets with large lateral surface area. Various microscopy data revealed that the morphology of 2D mesosheets resembles the hierarchical natural materials with layered structure. Solution and solid-state NMR studies on cyclo(L-Phg-L-Phg) revealed the presence of strong (N-H-O) hydrogen-bonded molecular chains supported by aromatic pi-pi interactions to form 2D mesosheets. Interestingly, cyclo(D-Phg-L-Phg) self-assembles to form single-crystalline as well as non-crystalline 2D rhomboid sheets with large lateral dimension. X-ray diffraction analysis revealed the stacking of (N-H-O) hydrogen-bonded molecular layers along c-axis supported by aromatic pi-pi interactions. The thermogravimetric analysis shows two transitions with overall high thermal stability attributed to layered hierarchy found in 2D mesosheets.

On the SIG-dimension of trees under the L (a)-metric

Let where be a set of points in d-dimensional space with a given metric rho. For a point let r (p) be the distance of p with respect to rho from its nearest neighbor in Let B(p,r (p) ) be the open ball with respect to rho centered at p and having the radius r (p) . We define the sphere-of-influence graph (SIG) of as the intersection graph of the family of sets Given a graph G, a set of points in d-dimensional space with the metric rho is called a d-dimensional SIG-representation of G, if G is isomorphic to the SIG of It is known that the absence of isolated vertices is a necessary and sufficient condition for a graph to have a SIG-representation under the L (a)-metric in some space of finite dimension. The SIG-dimension under the L (a)-metric of a graph G without isolated vertices is defined to be the minimum positive integer d such that G has a d-dimensional SIG-representation under the L (a)-metric. It is denoted by SIG (a)(G). We study the SIG-dimension of trees under the L (a)-metric and almost completely answer an open problem posed by Michael and Quint (Discrete Appl Math 127:447-460, 2003). Let T be a tree with at least two vertices. For each let leaf-degree(v) denote the number of neighbors of v that are leaves. We define the maximum leaf-degree as leaf-degree(x). Let leaf-degree{(v) = alpha}. If |S| = 1, we define beta(T) = alpha(T) - 1. Otherwise define beta(T) = alpha(T). We show that for a tree where beta = beta (T), provided beta is not of the form 2 (k) - 1, for some positive integer k a parts per thousand yen 1. If beta = 2 (k) - 1, then We show that both values are possible.

Matrix Crack Detection in Composite Plate with Spatially Random Material Properties using Fractal Dimension

Fractal dimension based damage detection method is investigated for a composite plate with random material properties. Composite material shows spatially varying random material properties because of complex manufacturing processes. Matrix cracks are considered as damage in the composite plate. Such cracks are often seen as the initial damage mechanism in composites under fatigue loading and also occur due to low velocity impact. Static deflection of the cantilevered composite plate with uniform loading is calculated using the finite element method. Damage detection is carried out based on sliding window fractal dimension operator using the static deflection. Two dimensional homogeneous Gaussian random field is generated using Karhunen-Loeve (KL) expansion to represent the spatial variation of composite material property. The robustness of fractal dimension based damage detection method is demonstrated considering the composite material properties as a two dimensional random field.

Matrix crack detection in spatially random composite structures using fractal dimension

Fractal dimension based damage detection method is studied for a composite structure with random material properties. A composite plate with localized matrix crack is considered. Matrix cracks are often seen as the initial damage mechanism in composites. Fractal dimension based method is applied to the static deformation curve of the structure to detect localized damage. Static deflection of a cantilevered composite plate under uniform loading is calculated using the finite element method. Composite material shows spatially varying random material properties because of complex manufacturing processes. Spatial variation of material property is represented as a two dimensional homogeneous Gaussian random field. Karhunen-Loeve (KL) expansion is used to generate a random field. The robustness of fractal dimension based damage detection methods is studied considering the composite plate with spatial variation in material properties.

A robust layer adapted difference method for singularly perturbed two-parameter parabolic problems

A finite difference method for a time-dependent singularly perturbed convection-diffusion-reaction problem involving two small parameters in one space dimension is considered. We use the classical implicit Euler method for time discretization and upwind scheme on the Shishkin-Bakhvalov mesh for spatial discretization. The method is analysed for convergence and is shown to be uniform with respect to both the perturbation parameters. The use of the Shishkin-Bakhvalov mesh gives first-order convergence unlike the Shishkin mesh where convergence is deteriorated due to the presence of a logarithmic factor. Numerical results are presented to validate the theoretical estimates obtained.

SEPARATION DIMENSION OF BOUNDED DEGREE GRAPHS

The separation dimension of a graph G is the smallest natural number k for which the vertices of G can be embedded in R-k such that any pair of disjoint edges in G can be separated by a hyperplane normal to one of the axes. Equivalently, it is the smallest possible cardinality of a family F of total orders of the vertices of G such that for any two disjoint edges of G, there exists at least one total order in F in which all the vertices in one edge precede those in the other. In general, the maximum separation dimension of a graph on n vertices is Theta(log n). In this article, we focus on bounded degree graphs and show that the separation dimension of a graph with maximum degree d is at most 2(9) (log*d)d. We also demonstrate that the above bound is nearly tight by showing that, for every d, almost all d-regular graphs have separation dimension at least d/2]

A generalized Hausdorff dimension for functions and sets

Let E be a compact subset of the n-dimensional unit cube, 1_n, and let C be a collection of convex bodies, all of positive n-dimensional Lebesgue measure, such that C contains bodies with arbitrarily small measure. The dimension of E with respect to the covering class C is defined to be the number

d_C(E) = sup(β:H_{β, C}(E) > 0),

where H_{β, C} is the outer measure

inf(Ʃm(C_i)^β:UC_i Ↄ E, C_i ϵ C) .

Only the one and two-dimensional cases are studied. Moreover, the covering classes considered are those consisting of intervals and rectangles, parallel to the coordinate axes, and those closed under translations. A covering class is identified with a set of points in the left-open portion, 1’_n, of 1_n, whose closure intersects 1_n - 1’_n. For n = 2, the outer measure H_{β, C} is adopted in place of the usual:

Inf(Ʃ(diam. (C_i))^β: UC_i Ↄ E, C_i ϵ C),

for the purpose of studying the influence of the shape of the covering sets on the dimension d_C(E).

If E is a closed set in 1₁, let M(E) be the class of all non-decreasing functions μ(x), supported on E with μ(x) = 0, x ≤ 0 and μ(x) = 1, x ≥ 1. Define for each μ ϵ M(E),

d_C(μ) = lim/c → inf/0 log ∆μ(c)/log c , (c ϵ C)

where ∆μ(c) = v/x (μ(x+c) – μ(x)). It is shown that

d_C(E) = sup (d_C(μ):μ ϵ M(E)).

This notion of dimension is extended to a certain class Ӻ of sub-additive functions, and the problem of studying the behavior of d_C(E) as a function of the covering class C is reduced to the study of d_C(f) where f ϵ Ӻ. Specifically, the set of points in 1₁,

(*) {d_B(F), d_C(f)): f ϵ Ӻ}

is characterized by a comparison of the relative positions of the points of B and C. A region of the form (*) is always closed and doubly-starred with respect to the points (0, 0) and (1, 1). Conversely, given any closed region in 1₂, doubly-starred with respect to (0, 0) and (1, 1), there are covering classes B and C such that (*) is exactly that region. All of the results are shown to apply to the dimension of closed sets E. Similar results can be obtained when a finite number of covering classes are considered.

In two dimensions, the notion of dimension is extended to the class M, of functions f(x, y), non-decreasing in x and y, supported on 1₂ with f(x, y) = 0 for x · y = 0 and f(1, 1) = 1, by the formula

d_C(f) = lim/s · t → inf/0 log ∆f(s, t)/log s · t , (s, t) ϵ C

where

∆f(s, t) = V/x, y (f(x+s, y+t) – f(x+s, y) – f(x, y+t) + f(x, t)).

A characterization of the equivalence d_C1(f) = d_C2(f) for all f ϵ M, is given by comparison of the gaps in the sets of products s · t and quotients s/t, (s, t) ϵ C_i (I = 1, 2).

Two and Three Finger Caging of Polygons and Polyhedra

Multi-finger caging offers a rigorous and robust approach to robot grasping. This thesis provides several novel algorithms for caging polygons and polyhedra in two and three dimensions. Caging refers to a robotic grasp that does not necessarily immobilize an object, but prevents it from escaping to infinity. The first algorithm considers caging a polygon in two dimensions using two point fingers. The second algorithm extends the first to three dimensions. The third algorithm considers caging a convex polygon in two dimensions using three point fingers, and considers robustness of this cage to variations in the relative positions of the fingers.

This thesis describes an algorithm for finding all two-finger cage formations of planar polygonal objects based on a contact-space formulation. It shows that two-finger cages have several useful properties in contact space. First, the critical points of the cage representation in the hand’s configuration space appear as critical points of the inter-finger distance function in contact space. Second, these critical points can be graphically characterized directly on the object’s boundary. Third, contact space admits a natural rectangular decomposition such that all critical points lie on the rectangle boundaries, and the sublevel sets of contact space and free space are topologically equivalent. These properties lead to a caging graph that can be readily constructed in contact space. Starting from a desired immobilizing grasp of a polygonal object, the caging graph is searched for the minimal, intermediate, and maximal caging regions surrounding the immobilizing grasp. An example constructed from real-world data illustrates and validates the method.

A second algorithm is developed for finding caging formations of a 3D polyhedron for two point fingers using a lower dimensional contact-space formulation. Results from the two-dimensional algorithm are extended to three dimension. Critical points of the inter-finger distance function are shown to be identical to the critical points of the cage. A decomposition of contact space into 4D regions having useful properties is demonstrated. A geometric analysis of the critical points of the inter-finger distance function results in a catalog of grasps in which the cages change topology, leading to a simple test to classify critical points. With these properties established, the search algorithm from the two-dimensional case may be applied to the three-dimensional problem. An implemented example demonstrates the method.

This thesis also presents a study of cages of convex polygonal objects using three point fingers. It considers a three-parameter model of the relative position of the fingers, which gives complete generality for three point fingers in the plane. It analyzes robustness of caging grasps to variations in the relative position of the fingers without breaking the cage. Using a simple decomposition of free space around the polygon, we present an algorithm which gives all caging placements of the fingers and a characterization of the robustness of these cages.

Application of Entropy and Fractal Dimension Analyses to the Pattern Recognition of Contaminated Fish Responses in Aquaculture

The objective of the work was to develop a non-invasive methodology for image acquisition, processing and nonlinear trajectory analysis of the collective fish response to a stochastic event. Object detection and motion estimation were performed by an optical flow algorithm in order to detect moving fish and simultaneously eliminate background, noise and artifacts. The Entropy and the Fractal Dimension (FD) of the trajectory followed by the centroids of the groups of fish were calculated using Shannon and permutation Entropy and the Katz, Higuchi and Katz-Castiglioni's FD algorithms respectively. The methodology was tested on three case groups of European sea bass (Dicentrarchus labrax), two of which were similar (C1 control and C2 tagged fish) and very different from the third (C3, tagged fish submerged in methylmercury contaminated water). The results indicate that Shannon entropy and Katz-Castiglioni were the most sensitive algorithms and proved to be promising tools for the non-invasive identification and quantification of differences in fish responses. In conclusion, we believe that this methodology has the potential to be embedded in online/real time architecture for contaminant monitoring programs in the aquaculture industry.

Socio-economic dimension of fish farming in Assam

Information on socio-economic framework of the fish farmer community forms a benchmark for policy formulation to develop this economically backward sector. Very few studies have been conducted on the socio-economic aspect of fish farming. Two districts of Assam, Darrang and Nagaon, were selected for this study where 120 respondents from each district were selected randomly. The characteristics representing the personnel and socio-economic attributes of the fish farmers are presented in this paper. The socio-economic status of fish farmers has to be improved by bringing the modern concepts of fish farming to the doorstep of farmers.

Comparison of free spectral range and quality factor for two-dimensional square and circular microcavities

Free spectral range of whispering-gallery (WG)-like modes in a two-dimensional (2D) square microcavity is found to be twice that in a 2D circular microcavity. The quality factor of the WG-like mode with the low mode number in a 2D square microcavity, calculated by the finite-difference time-domain (FDTD) technique and the Pade approximation method, is found to exceed that of the WG mode in 2D circular microcavity with the same cavity dimension and close mode wavelength.

Information geometry theory of high-dimension space and application for speaker independent continuous digit speech recognition

In the light of descriptive geometry and notions in set theory, this paper re-defines the basic elements in space such as curve and surface and so on, presents some fundamental notions with respect to the point cover based on the High-dimension space (HDS) point covering theory, finally takes points from mapping part of speech signals to HDS, so as to analyze distribution information of these speech points in HDS, and various geometric covering objects for speech points and their relationship. Besides, this paper also proposes a new algorithm for speaker independent continuous digit speech recognition based on the HDS point dynamic searching theory without end-points detection and segmentation. First from the different digit syllables in real continuous digit speech, we establish the covering area in feature space for continuous speech. During recognition, we make use of the point covering dynamic searching theory in HDS to do recognition, and then get the satisfying recognized results. At last, compared to HMM (Hidden Markov models)-based method, from the development trend of the comparing results, as sample amount increasing, the difference of recognition rate between two methods will decrease slowly, while sample amount approaching to be very large, two recognition rates all close to 100% little by little. As seen from the results, the recognition rate of HDS point covering method is higher than that of in HMM (Hidden Markov models) based method, because, the point covering describes the morphological distribution for speech in HDS, whereas HMM-based method is only a probability distribution, whose accuracy is certainly inferior to point covering.

Two-dimensional capillary electrophoresis involving capillary isoelectric focusing and capillary zone electrophoresis

Capillary isoelectric focusing (cIEF) and capillary zone electrophoresis (CZE) was on-line hyphenated by a dialysis interface to achieve a 2D capillary electrophoresis (CE) system. The system was used with just one high-voltage power supply and three electrodes (one cathode shared by the two dimensions). The focused zone in the first dimension (i.e. the cIEF) was driven to the dialysis interface by electroosmotic flow (EOF), besides chemical mobilization from the first anode to the shared cathode. And then in the second dimension (i.e. the CZE), the separated zone was further separated and driven by an inverted EOF, which originated from the charged layer of a cationic surfactant adsorbed onto the inner wall of the capillary. Finally, a solution of ribonuclease was rapidly separated to assess the feasibility of the two-dimensional CE implement. (C) 2003 Elsevier B.V. All rights reserved.

Branched crystal morphology of linear polyethylene crystallized in a two-dimensional diffusion-controlled growth field

The branched crystal morphology of linear polyethylene formed at various temperatures from thin films has been studied by atomic-force microscopy (AFM), transmission electron microscopy (TEM), electron diffraction (ED) pattern and polymer decoration technique. Two types of branched patterns, i.e. dendrite and seaweed patterns, have been visualized. The fractal dimension d(f) = 1.65 of both dendrite and some of seaweed patterns was obtained by using the box-counting method, although most of the seaweed patterns are compact. Selected-area ED patterns indicate that the fold stems tilt about 34.5degrees around the b-axis and polymer decoration patterns show that the chain folding direction and regularity in two (200). regions are quite different from each other. Because of chain tilting, branched crystals show three striking features: 1) the lamella-like branches show two (200) regions with different thickness; 2) the crystals usually bend towards the thin region; 3) the thick region grows faster by developing branches, thus branches usually occur outside the thick region. The branched patterns show a characteristic width w, which gives a linear relationship with the crystallization temperature on a semilogarithmic plot.

Deconvolution of overlapped peaks based on the exponentially modified Gaussian model in comprehensive two-dimensional gas chromatography

Comprehensive two-dimensional gas chromatography (GC x GC) has attracted much attention for the analys is of complex samples. Even with a large peak capacity in GC x GC, peak overlapping is often met. In this paper, a new method was developed to resolve overlapped peaks based on the mass conservation and the exponentially modified Gaussian (EMG) model. Linear relationships between the calculated sigma, tau of primary peaks with the corresponding retention time (t(R)) were obtained, and the correlation coefficients were over 0.99. Based on such relationships, the elution profile of each compound in overlapped peaks could be simulated, even for the peak never separated on the second-dimension. The proposed method has proven to offer more accurate peak area than the general data processing method. (c) 2005 Elsevier B.V. All rights reserved.