3,980 research outputs found
Characteristic of partition-circuit matroid through approximation number
Rough set theory is a useful tool to deal with uncertain, granular and
incomplete knowledge in information systems. And it is based on equivalence
relations or partitions. Matroid theory is a structure that generalizes linear
independence in vector spaces, and has a variety of applications in many
fields. In this paper, we propose a new type of matroids, namely,
partition-circuit matroids, which are induced by partitions. Firstly, a
partition satisfies circuit axioms in matroid theory, then it can induce a
matroid which is called a partition-circuit matroid. A partition and an
equivalence relation on the same universe are one-to-one corresponding, then
some characteristics of partition-circuit matroids are studied through rough
sets. Secondly, similar to the upper approximation number which is proposed by
Wang and Zhu, we define the lower approximation number. Some characteristics of
partition-circuit matroids and the dual matroids of them are investigated
through the lower approximation number and the upper approximation number.Comment: 12 page
Multiscale modeling of granular flows with application to crowd dynamics
In this paper a new multiscale modeling technique is proposed. It relies on a
recently introduced measure-theoretic approach, which allows to manage the
microscopic and the macroscopic scale under a unique framework. In the
resulting coupled model the two scales coexist and share information. This
allows to perform numerical simulations in which the trajectories and the
density of the particles affect each other. Crowd dynamics is the motivating
application throughout the paper.Comment: 30 pages, 9 figure
Identification of control targets in Boolean molecular network models via computational algebra
Motivation: Many problems in biomedicine and other areas of the life sciences
can be characterized as control problems, with the goal of finding strategies
to change a disease or otherwise undesirable state of a biological system into
another, more desirable, state through an intervention, such as a drug or other
therapeutic treatment. The identification of such strategies is typically based
on a mathematical model of the process to be altered through targeted control
inputs. This paper focuses on processes at the molecular level that determine
the state of an individual cell, involving signaling or gene regulation. The
mathematical model type considered is that of Boolean networks. The potential
control targets can be represented by a set of nodes and edges that can be
manipulated to produce a desired effect on the system. Experimentally, node
manipulation requires technology to completely repress or fully activate a
particular gene product while edge manipulations only require a drug that
inactivates the interaction between two gene products. Results: This paper
presents a method for the identification of potential intervention targets in
Boolean molecular network models using algebraic techniques. The approach
exploits an algebraic representation of Boolean networks to encode the control
candidates in the network wiring diagram as the solutions of a system of
polynomials equations, and then uses computational algebra techniques to find
such controllers. The control methods in this paper are validated through the
identification of combinatorial interventions in the signaling pathways of
previously reported control targets in two well studied systems, a p53-mdm2
network and a blood T cell lymphocyte granular leukemia survival signaling
network.Comment: 12 pages, 4 figures, 2 table
Multiscale modeling of granular flows with application to crowd dynamics
In this paper a new multiscale modeling technique is proposed. It relies on a
recently introduced measure-theoretic approach, which allows to manage the
microscopic and the macroscopic scale under a unique framework. In the
resulting coupled model the two scales coexist and share information. This
allows to perform numerical simulations in which the trajectories and the
density of the particles affect each other. Crowd dynamics is the motivating
application throughout the paper.Comment: 30 pages, 9 figure
Algebraic, Topological, and Mereological Foundations of Existential Granules
In this research, new concepts of existential granules that determine
themselves are invented, and are characterized from algebraic, topological, and
mereological perspectives. Existential granules are those that determine
themselves initially, and interact with their environment subsequently.
Examples of the concept, such as those of granular balls, though inadequately
defined, algorithmically established, and insufficiently theorized in earlier
works by others, are already used in applications of rough sets and soft
computing. It is shown that they fit into multiple theoretical frameworks
(axiomatic, adaptive, and others) of granular computing. The characterization
is intended for algorithm development, application to classification problems
and possible mathematical foundations of generalizations of the approach.
Additionally, many open problems are posed and directions provided.Comment: 15 Pages. Accepted IJCRS 202
- …