Abstract: In this paper a deterministic polynomial-time
algorithm is presented for the Clique problem. The case is considered
as the problem of omitting the minimum number of vertices from the
input graph so that none of the zeroes on the graph-s adjacency
matrix (except the main diagonal entries) would remain on the
adjacency matrix of the resulting subgraph. The existence of a
deterministic polynomial-time algorithm for the Clique problem, as
an NP-complete problem will prove the equality of P and NP
complexity classes.
Abstract: As there are also graph methods of circuit analysis in
addition to algebraic methods, it is, in theory, clearly possible to
carry out an analysis of a whole switched circuit in two-phase
switching exclusively by the graph method as well. This article deals
with two methods of full-graph solving of switched circuits: by
transformation graphs and by two-graphs. It deals with the circuit
switched capacitors and the switched current, too. All methods are
presented in an equally detailed steps to be able to compare.
Abstract: Bio-demographic diversity which refers to age and gender of members in a team, has been frequently identified to influence team innovation directly. As the theories expanded, biodemographic diversity was suggested to influence team innovation via psychosocial trait and interaction process. This study examines those suggestions, in which psychosocial trait and interaction process were operationalized as 'participation safety climate' and 'team reflexivity' respectively. The role of team reflexivity as a mediator to participation safety climate and team innovation was also assessed. Due to a small number of teams involved in the study, data were analyzed by using a PLS-graph. While the results show only gender is significantly related to the participation safety climate, which in turn influences team reflexivity and team innovation, there is no statistical evidence that team reflexivity mediates the impact of participation safety climate on team innovation.
Abstract: Signal processing applications which are iterative in
nature are best represented by data flow graphs (DFG). In these
applications, the maximum sampling frequency is dependent on the
topology of the DFG, the cyclic dependencies in particular. The
determination of the iteration bound, which is the reciprocal of the
maximum sampling frequency, is critical in the process of hardware
implementation of signal processing applications. In this paper, a
novel technique to compute the iteration bound is proposed. This
technique is different from all previously proposed techniques, in the
sense that it is based on the natural flow of tokens into the DFG
rather than the topology of the graph. The proposed algorithm has
lower run-time complexity than all known algorithms. The
performance of the proposed algorithm is illustrated through
analytical analysis of the time complexity, as well as through
simulation of some benchmark problems.
Abstract: The automatic construction of large, high-resolution
image vistas (mosaics) is an active area of research in the fields of
photogrammetry [1,2], computer vision [1,4], medical image
processing [4], computer graphics [3] and biometrics [8]. Image
stitching is one of the possible options to get image mosaics. Vista
Creation in image processing is used to construct an image with a
large field of view than that could be obtained with a single
photograph. It refers to transforming and stitching multiple images
into a new aggregate image without any visible seam or distortion in
the overlapping areas. Vista creation process aligns two partial
images over each other and blends them together. Image mosaics
allow one to compensate for differences in viewing geometry. Thus
they can be used to simplify tasks by simulating the condition in
which the scene is viewed from a fixed position with single camera.
While obtaining partial images the geometric anomalies like rotation,
scaling are bound to happen. To nullify effect of rotation of partial
images on process of vista creation, we are proposing rotation
invariant vista creation algorithm in this paper. Rotation of partial
image parts in the proposed method of vista creation may introduce
some missing region in the vista. To correct this error, that is to fill
the missing region further we have used image inpainting method on
the created vista. This missing view regeneration method also
overcomes the problem of missing view [31] in vista due to cropping,
irregular boundaries of partial image parts and errors in digitization
[35]. The method of missing view regeneration generates the missing
view of vista using the information present in vista itself.
Abstract: The Minimum Vertex Cover (MVC) problem is a classic
graph optimization NP - complete problem. In this paper a competent
algorithm, called Vertex Support Algorithm (VSA), is designed to
find the smallest vertex cover of a graph. The VSA is tested on a
large number of random graphs and DIMACS benchmark graphs.
Comparative study of this algorithm with the other existing methods
has been carried out. Extensive simulation results show that the VSA
can yield better solutions than other existing algorithms found in the
literature for solving the minimum vertex cover problem.
Abstract: The Maximum Weighted Independent Set (MWIS)
problem is a classic graph optimization NP-hard problem. Given an
undirected graph G = (V, E) and weighting function defined on the
vertex set, the MWIS problem is to find a vertex set S V whose total
weight is maximum subject to no two vertices in S are adjacent. This
paper presents a novel approach to approximate the MWIS of a graph
using minimum weighted vertex cover of the graph. Computational
experiments are designed and conducted to study the performance
of our proposed algorithm. Extensive simulation results show that
the proposed algorithm can yield better solutions than other existing
algorithms found in the literature for solving the MWIS.
Abstract: In this study four Holstein steers with rumen fistula
fed 7 kg of dry matter (DM) of diets differing in concentrate to
alfalfa hay ratios as 60:40, 70:30, 80:20, and 90:10 in a 4 × 4 latin
square design. The pH of the ruminal fluid was measured before
the morning feeding (0.0 h) to 8 h post feeding. In this study, a
two-layered feed-forward neural network trained by the
Levenberg-Marquardt algorithm was used for modelling of ruminal
pH. The input variables of the network were time, concentrate to
alfalfa hay ratios (C/F), non fiber carbohydrate (NFC) and neutral
detergent fiber (NDF). The output variable was the ruminal pH.
The modeling results showed that there was excellent agreement
between the experimental data and predicted values, with a high
determination coefficient (R2 >0.96). Therefore, we suggest using
these model-derived biological values to summarize continuously
recorded pH data.
Abstract: A P0-matrix is a real square matrix all of whose principle minors are nonnegative. In this paper, we consider the class of P0-matrix. Our main aim is to determine which sign pattern matrices are admissible for this class of real matrices.
Abstract: Bond graph models of an electrical transformer including
the nonlinear saturation are presented. The transformer
using electrical and magnetic circuits are modelled. These models
determine the relation between self and mutual inductances, and
the leakage and magnetizing inductances of power transformers
with two windings using the properties of a bond graph. The
equivalence between electrical and magnetic variables is given.
The modelling and analysis using this methodology to three phase
power transformers can be extended.
Abstract: The human friendly interaction is the key function of a human-centered system. Over the years, it has received much attention to develop the convenient interaction through intention recognition. Intention recognition processes multimodal inputs including speech, face images, and body gestures. In this paper, we suggest a novel approach of intention recognition using a graph representation called Intention Graph. A concept of valid intention is proposed, as a target of intention recognition. Our approach has two phases: goal recognition phase and intention recognition phase. In the goal recognition phase, we generate an action graph based on the observed actions, and then the candidate goals and their plans are recognized. In the intention recognition phase, the intention is recognized with relevant goals and user profile. We show that the algorithm has polynomial time complexity. The intention graph is applied to a simple briefcase domain to test our model.
Abstract: The classification of the protein structure is commonly
not performed for the whole protein but for structural domains, i.e.,
compact functional units preserved during evolution. Hence, a first
step to a protein structure classification is the separation of the
protein into its domains. We approach the problem of protein domain
identification by proposing a novel graph theoretical algorithm. We
represent the protein structure as an undirected, unweighted and
unlabeled graph which nodes correspond the secondary structure
elements of the protein. This graph is call the protein graph. The
domains are then identified as partitions of the graph corresponding
to vertices sets obtained by the maximization of an objective function,
which mutually maximizes the cycle distributions found in the
partitions of the graph. Our algorithm does not utilize any other kind
of information besides the cycle-distribution to find the partitions. If
a partition is found, the algorithm is iteratively applied to each of
the resulting subgraphs. As stop criterion, we calculate numerically
a significance level which indicates the stability of the predicted
partition against a random rewiring of the protein graph. Hence,
our algorithm terminates automatically its iterative application. We
present results for one and two domain proteins and compare our
results with the manually assigned domains by the SCOP database
and differences are discussed.
Abstract: An n×n matrix is called an N1 0 -matrix if all principal minors are non-positive and each entry is non-positive. In this paper, we study the partial non-combinatorially symmetric N1 0 -matrix completion problems if the graph of its specified entries is a transitive tournament or a double cycle. In general, these digraphs do not have N1 0 -completion. Therefore, we have given sufficient conditions that guarantee the existence of the N1 0 -completion for these digraphs.
Abstract: The Minimum Weighted Vertex Cover (MWVC) problem is a classic graph optimization NP - complete problem. Given an undirected graph G = (V, E) and weighting function defined on the vertex set, the minimum weighted vertex cover problem is to find a vertex set S V whose total weight is minimum subject to every edge of G has at least one end point in S. In this paper an effective algorithm, called Support Ratio Algorithm (SRA), is designed to find the minimum weighted vertex cover of a graph. Computational experiments are designed and conducted to study the performance of our proposed algorithm. Extensive simulation results show that the SRA can yield better solutions than other existing algorithms found in the literature for solving the minimum vertex cover problem.
Abstract: Let G be a fuzzy graph. Then D Ôèå V is said to be a strong (weak) fuzzy dominating set of G if every vertex v ∈ V -D is strongly (weakly) dominated by some vertex u in D. We denote a strong (weak) fuzzy dominating set by sfd-set (wfd-set). The minimum scalar cardinality of a sfd-set (wfd-set) is called the strong (weak) fuzzy domination number of G and it is denoted by γsf (G)γwf (G). In this paper we introduce the concept of strong (weak) domination in fuzzy graphs and obtain some interesting results for this new parameter in fuzzy graphs.
Abstract: With the proliferation of the mobile device
technologies, mobile learning can be used to complement and
improve traditional learning problems. Both students and teachers
need a proper and handy system to monitor and keep track the
performance of the students. This paper presents an implementation
of M-learning for primary school in Malaysia by using an open
source technology. It focuses on learning mathematics using
handheld devices for primary schools- students aged 11 and 12 years
old. Main users for this system include students, teachers and the
administrator. This application suggests a new mobile learning
environment with mobile graph for tracking the students- progress
and performance. The purpose of this system is not to replace
traditional classroom but to complement the learning process. In a
testing conducted, students who used this system performed better in
their examination.
Abstract: The investigation results of high-density hydrogen
heating by high-current electric arc are presented at initial pressure
from 5 MPa to 160 MPa with current amplitude up to 1.6 MA and
current rate of rise 109-1011 A/s. When changing the initial pressure
and current rate of rise, channel temperature varies from several
electronvolts to hundreds electronvolts. Arc channel radius is several
millimeters. But the radius of the discharge chamber greater than the
radius of the arc channel on approximately order of magnitude. High
efficiency of gas heating is caused by radiation absorption of
hydrogen surrounding the arc. Current channel consist from vapor of
the initiating wire. At current rate of rise of 109 A/s and relatively
small current amplitude gas heating occurs due to radiation
absorption in the band transparency of hydrogen by the wire vapours
with photon energies less than 13.6 eV. At current rate of rise of
1011 A/s gas heating is due to hydrogen absorption of soft X-rays
from discharge channel.
Abstract: Water samples were collected from river Pandu at six
stations where human and animal activities were high. Composite
samples were analyzed for dissolved oxygen (DO), biochemical
oxygen demand (BOD), chemical oxygen demand (COD) , pH values
during dry and wet seasons as well as the harmattan period. The total
data points were used to establish relationships between the
parameters and data were also subjected to statistical analysis and
expressed as mean ± standard error of mean (SEM) at a level of
significance of p
Abstract: Run-offs are considered as important hydrological factors in feasibility studies of river engineering and irrigation-related projects under arid and semi-arid condition. Flood control is one of the crucial factor, the management of which while mitigates its destructive consequences, abstracts considerable volume of renewable water resources. The methodology applied here was based on Mizumura, which applied a mathematical model for simple tank to simulate the rainfall-run-off process in a particular water basin using the data from the observational hydrograph. The model was applied in the Dez River water basin adjacent to Greater Dezful region, Iran in order to simulate and estimate the floods. Results indicated that the calculated hydrographs using the simple tank method, SCS-CN model and the observation hydrographs had a close proximity. It was also found that on average the flood time and discharge peaks in the simple tank were closer to the observational data than the CN method. On the other hand, the calculated flood volume in the CN model was significantly closer to the observational data than the simple tank model.
Abstract: Pregnancy is considered a special period in a woman’s life. There are myths about pregnancy that describe gender predictions, dietary beliefs, pregnancy signs, and risk of magic or witchcraft. Majority of these myths is in connection with the early childcare. In traditional societies midwives and experienced women practice and teach these myths to young mothers. Mother who feel special and vulnerable, at the same time feel secure in following these socially transmitted myths. Rural Punjab, a province of Pakistan has a culture rich with beliefs and myths. Myths about pregnancy are significant in rural culture and pregnancy care is seen as mother and childcare. This paper presents my research reflections that I did as a part of my Ph.D studies about early childcare beliefs and rituals practiced in rural Punjab, Pakistan.