12 resultados para partially ordered sets
em Cochin University of Science
Resumo:
A new approach, the multipole theory (MT) method, is presented for the computation of cutoff wavenumbers of waveguides partially filled with dielectric. The MT formulation of the eigenvalue problem of an inhomogeneous waveguide is derived. Representative computational examples, including dielectric-rod-loaded rectangular and double-ridged waveguides, are given to validate the theory, and to demonstrate the degree of its efficiency
Resumo:
In this study we combine the notions of fuzzy order and fuzzy topology of Chang and define fuzzy ordered fuzzy topological space. Its various properties are analysed. Product, quotient, union and intersection of fuzzy orders are introduced. Besides, fuzzy order preserving maps and various fuzzy completeness are investigated. Finally an attempt is made to study the notion of generalized fuzzy ordered fuzzy topological space by considering fuzzy order defined on a fuzzy subset.
Resumo:
To meet the challenges related to the chemical industry,development of efficient catalysts is necessary.The mesoporous materials like SBA-15 are considered as good catalyst candidates of 21st century.SBA-15 mesoporous materials are catalytically inactive,but allow the dispersion of catalytically active phases into the framework.So these materials can be considered as an interesting alternative for preparing catalytically active metal nanoparticles in-situ into it.In the present work various transition metals are incorporated to improve the catalytic activity of SBA-15 material.The fundamental aspects of the preparation,characterization and the activity studies are briefly viewed in this thesis. Systematic investigation of the physico-chemical properties and catalytic activity studies of the prepared materials were carried out and presented in this Study.
Resumo:
Mesoporous materials are of great interest to the materials community because of their potential applications for catalysis,separation of large molecules,medical implants,semiconductors,magnetoelectric devices.The thesis entitled 'Ordered Mesoporous Silica as supports for immobilization of Biocatalyst' presents how the pore size can be tuned without the loss in ordered structure for the entrapment of an industially important biocatalyst-amylase.Immobilization of enzymes on ordered mesoporous material has triggered new ooportunities for stabilizing enzymes with improved intrinsic and operational stabilities.
Resumo:
Nanoparticulate drug delivery systems provide wide opportunities for solving problems associated with drug stability or disease states and create great expectations in the area of drug delivery (Bosselmann & Williams, 2012). Nanotechnology, in a simple way, explains the technology that deals with one billionth of a meter scale (Ochekpe, et al., 2009). Fewer side effects, poor bioavailability, absorption at intestine, solubility, specific delivery to site of action with good pharmacological efficiency, slow release, degradation of drug and effective therapeutic outcome, are the major challenges faced by most of the drug delivery systems. To a great extent, biopolymer coated drug delivery systems coupled with nanotechnology alleviate the major drawbacks of the common delivery methods. Chitosan, deacetylated chitin, is a copolymer of β-(1, 4) linked glucosamine (deacetylated unit) and N- acetyl glucosamine (acetylated unit) (Radhakumary et al., 2005). Chitosan is biodegradable, non-toxic and bio compatible. Owing to the removal of acetyl moieties that are present in the amine functional groups of chitin, chitosan is readily soluble in aqueous acidic solution. The solubilisation occurs through the protonation of amino groups on the C-2 position of D-glucosamine residues whereby polysaccharide is converted into polycation in acidic media. Chitosan interacts with many active compounds due to the presence of amine group in it. The presence of this active amine group in chitosan was exploited for the interaction with the active molecules in the present study. Nanoparticles of chitosan coupled drugs are utilized for drug delivery in eye, brain, liver, cancer tissues, treatment of spinal cord injury and infections (Sharma et al., 2007; Li, et a., 2009; Paolicelli et al., 2009; Cho et al., 2010). To deliver drugs directly to the intended site of action and to improve pharmacological efficiency by minimizing undesired side effects elsewhere in the body and decrease the long-term use of many drugs, polymeric drug delivery systems can be used (Thatte et al., 2005).
Resumo:
This paper discusses our research in developing a generalized and systematic method for anomaly detection. The key ideas are to represent normal program behaviour using system call frequencies and to incorporate probabilistic techniques for classification to detect anomalies and intrusions. Using experiments on the sendmail system call data, we demonstrate that concise and accurate classifiers can be constructed to detect anomalies. An overview of the approach that we have implemented is provided.
Resumo:
The median (antimedian) set of a profile π = (u1, . . . , uk) of vertices of a graphG is the set of vertices x that minimize (maximize) the remoteness i d(x,ui ). Two algorithms for median graphs G of complexity O(nidim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes
Resumo:
This paper highlights the prediction of learning disabilities (LD) in school-age children using rough set theory (RST) with an emphasis on application of data mining. In rough sets, data analysis start from a data table called an information system, which contains data about objects of interest, characterized in terms of attributes. These attributes consist of the properties of learning disabilities. By finding the relationship between these attributes, the redundant attributes can be eliminated and core attributes determined. Also, rule mining is performed in rough sets using the algorithm LEM1. The prediction of LD is accurately done by using Rosetta, the rough set tool kit for analysis of data. The result obtained from this study is compared with the output of a similar study conducted by us using Support Vector Machine (SVM) with Sequential Minimal Optimisation (SMO) algorithm. It is found that, using the concepts of reduct and global covering, we can easily predict the learning disabilities in children
Resumo:
A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.
Resumo:
For a set S of vertices and the vertex v in a connected graph G, max x2S d(x, v) is called the S-eccentricity of v in G. The set of vertices with minimum S-eccentricity is called the S-center of G. Any set A of vertices of G such that A is an S-center for some set S of vertices of G is called a center set. We identify the center sets of certain classes of graphs namely, Block graphs, Km,n, Kn −e, wheel graphs, odd cycles and symmetric even graphs and enumerate them for many of these graph classes. We also introduce the concept of center number which is defined as the number of distinct center sets of a graph and determine the center number of some graph classes
Resumo:
Given a non empty set S of vertices of a graph, the partiality of a vertex with respect to S is the di erence between maximum and minimum of the distances of the vertex to the vertices of S. The vertices with minimum partiality constitute the fair center of the set. Any vertex set which is the fair center of some set of vertices is called a fair set. In this paper we prove that the induced subgraph of any fair set is connected in the case of trees and characterise block graphs as the class of chordal graphs for which the induced subgraph of all fair sets are connected. The fair sets of Kn, Km;n, Kn e, wheel graphs, odd cycles and symmetric even graphs are identi ed. The fair sets of the Cartesian product graphs are also discussed
Resumo:
The magnetic properties of amorphous Fe–Ni–B based metallic glass nanostructures were investigated. The nanostructures underwent a spin-glass transition at temperatures below 100 K and revealed an irreversible temperature following the linear de Almeida–Thouless dependence. When the nanostructures were cooled below 25 K in a magnetic field, they exhibited an exchange bias effect with enhanced coercivity. The observed onset of exchange bias is associated with the coexistence of the spin-glass phase along with the appearance of another spin-glass phase formed by oxidation of the structurally disordered surface layer, displaying a distinct training effect and cooling field dependence. The latter showed a maximum in exchange bias field and coercivity, which is probably due to competing multiple equivalent spin configurations at the boundary between the two spin-glass phases