10,862 research outputs found
A note on cancellation of reflexive modules
We prove that cancellation of reflexive modules over affine rings holds under
some restrictions. We construct examples to show that this is false even over
polynomial rings without the extra assumptions.Comment: 6 page
Affine like Surfaces
We classify smooth surfaces whose higher cohomologies of i-forms for all i
vanish. We show that if such a surface is not affine, then it has essentially
two possibilities.Comment: 16 pages, LaTe
A methodology to identify the level of reuse using template factors
To build large scale software systems, Component Based Software Engineering
(CBSE) has played a vital role. The current practices of software industry
demands more development of a software within time and budget which is highly
productive to them. It became so necessary to achieve how effectively the
software component is reusable. In order to meet this, the component level
reuse, in terms of both class and method level can be possibly done. The
traditional approaches are presented in the literature upto the level of extent
of achievement of reuse. Any how still effective reuse is a challenging issue
as a part. In this paper, a methodology has proposed for the identification of
reuse level which has been considered by the using reuse metrics such as the
Class Template Factor(CTF) and Method Template Factor(MTF). By considering
these measures makes easy to identify the level of reuse so that helps in the
growth the productivity in the organization.Comment: arXiv admin note: text overlap with arXiv:1203.1328, arXiv:1207.4938,
arXiv:1202.560
Contraction based stabilization of nonlinear singularly perturbed systems and application to high gain feedback
Recent development of contraction theory based analysis of singularly
perturbed system has opened the door for inspecting differential behavior of
multi time-scale systems. In this paper a contraction theory based framework is
proposed for stabilization of singularly perturbed systems. The primary
objective is to design a feedback controller to achieve bounded tracking error
for both standard and non-standard singularly perturbed systems. This framework
provides relaxation over traditional quadratic Lyapunov based method as there
is no need to satisfy interconnection conditions during controller design
algorithm. Moreover, the stability bound does not depend on smallness of
singularly perturbed parameter. Combined with high gain scaling, the proposed
technique is shown to assure contraction of approximate feedback linearizable
systems. These findings extend the class of nonlinear systems which can be made
contracting
A New Fault-Tolerant M-network and its Analysis
This paper introduces a new class of efficient inter connection networks
called as M-graphs for large multi-processor systems.The concept of M-matrix
and M-graph is an extension of Mn-matrices and Mn-graphs.We analyze these
M-graphs regarding their suitability for large multi-processor systems. An(p,N)
M-graph consists of N nodes, where p is the degree of each node.The topology is
found to be having many attractive features prominent among them is the
capability of maximal fault-tolerance, high density and constant diameter.It is
found that these combinatorial structures exibit some properties like
symmetry,and an inter-relation with the nodes, and degree of the concerned
graph, which can be utilized for the purposes of inter connected networks.But
many of the properties of these mathematical and graphical structures still
remained unexplored and the present aim of the paper is to study and analyze
some of the properties of these M-graphs and explore their application in
networks and multi-processor systems
On Multi-resident Activity Recognition in Ambient Smart-Homes
Increasing attention to the research on activity monitoring in smart homes
has motivated the employment of ambient intelligence to reduce the deployment
cost and solve the privacy issue. Several approaches have been proposed for
multi-resident activity recognition, however, there still lacks a comprehensive
benchmark for future research and practical selection of models. In this paper
we study different methods for multi-resident activity recognition and evaluate
them on same sets of data. The experimental results show that recurrent neural
network with gated recurrent units is better than other models and also
considerably efficient, and that using combined activities as single labels is
more effective than represent them as separate labels
Estimation of Plasma Properties and Magnetic Field in a Prominence-like Structure as Observed by SDO/AIA
We analyze a prominence-like cool plasma structure as observed by Atmospheric
Imaging Assembly (AIA) onboard the Solar Dynamics Observatory (SDO). We perform
the Differential Emission Measure (DEM) analysis using various filters of AIA,
and also deduce the temperature and density structure in and around the
observed flux-tube. In addition to deducing plasma parameters, we also find an
evidence of multiple harmonics of fast magnetoacoustic kink waves in the
observed prominence-like magnetic structure. Making use of estimated plasma
parameters and observed wave parameters, under the baseline of MHD seismology,
we deduce magnetic field in the flux-tube. The wave period ratio P1/P2 = 2.18
is also observed in the flux-tube, which carries the signature of magnetic
field divergence where we estimate the tube expansion factor as 1.27. We
discuss constraints in the estimation of plasma and magnetic field properties
in such a structure in the current observational perspective, which may shed
new light on the localized plasma dynamics and heating scenario in the solar
atmosphere.Comment: 3 Pages; Paper for the proceedings of IAU Symposium 300 : Nature of
prominences and their role in space weather; Eds. B. Schmieder, J.M.
Melherbe, S. W
Certain t-partite graphs
By making use of the generalized concept of orthogonality in Latin squares,
certain t-partite graphs have been constructed and a suggestion for a net work
system and some applications have been made
Listing All Spanning Trees in Halin Graphs - Sequential and Parallel view
For a connected labelled graph , a {\em spanning tree} is a connected
and an acyclic subgraph that spans all vertices of . In this paper, we
consider a classical combinatorial problem which is to list all spanning trees
of . A Halin graph is a graph obtained from a tree with no degree two
vertices and by joining all leaves with a cycle. We present a sequential and
parallel algorithm to enumerate all spanning trees in Halin graphs. Our
approach enumerates without repetitions and we make use of
processors for parallel algorithmics, where and are the depth, the
number of leaves, respectively, of the Halin graph. We also prove that the
number of spanning trees in Halin graphs is .Comment: 13 pages, 5 figure
Arithmetically Cohen-Macaulay Bundles on Hypersurfaces
We prove that any rank two arithmetically Cohen-Macaulay vector bundle on a
general hypersurface of degree at least three in must be split.Comment: 14 page
- …