Optimizational Model of Transit Line Chosen

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.178-181.1887 ◽

2012 ◽

Vol 178-181 ◽

pp. 1887-1890

Author(s):

Wen Bin Liu

Keyword(s):

Graph Theory ◽

Computational Model ◽

Set Theory ◽

Search Algorithm ◽

Timing Function ◽

Left And Right ◽

Walking Time

In the paper,using graph theory,set theory and iteration,we give gradual search algorithm with number of transfer acting as parameter. Through dealing with data of traffic line, line is united in algorithm,and computational model is simplified. Through optimization of left and right in circuit site and same line repeating site, the shortest timing function in circuit is realized. We consider the subway and walking time of all sites furtherly.

Download Full-text

Multimodal biometric system combining left and right palmprints

Information Discovery and Delivery ◽

10.1108/idd-01-2019-0011 ◽

2019 ◽

Vol 48 (1) ◽

pp. 2-13

Author(s):

Chérif Taouche ◽

Hacene Belhadef

Keyword(s):

Feature Vector ◽

Recognition Accuracy ◽

Search Algorithm ◽

Palmprint Recognition ◽

Multimodal Biometrics ◽

Chi Square ◽

Content Type ◽

Set Size ◽

Promising Area ◽

Left And Right

Purpose Palmprint recognition is a very interesting and promising area of research. Much work has already been done in this area, but much more needs to be done to make the systems more efficient. In this paper, a multimodal biometrics system based on fusion of left and right palmprints of a person is proposed to overcome limitations of unimodal systems. Design/methodology/approach Features are extracted using some proposed multi-block local descriptors in addition to MBLBP. Fusion of extracted features is done at feature level by a simple concatenation of feature vectors. Then, feature selection is performed on the resulting global feature vector using evolutionary algorithms such as genetic algorithms and backtracking search algorithm for a comparison purpose. The benefits of such step selecting the relevant features are known in the literature, such as increasing the recognition accuracy and reducing the feature set size, which results in runtime saving. In matching step, Chi-square similarity measure is used. Findings The resulting feature vector length representing a person is compact and the runtime is reduced. Originality/value Intensive experiments were done on the publicly available IITD database. Experimental results show a recognition accuracy of 99.17 which prove the effectiveness and robustness of the proposed multimodal biometrics system than other unimodal and multimodal biometrics systems.

Download Full-text

Structure from Stereo by Associative Learning of the Constraints

Perception ◽

10.1068/p180767 ◽

1989 ◽

Vol 18 (6) ◽

pp. 767-782 ◽

Cited By ~ 3

Author(s):

Alice J O'Toole

Keyword(s):

Visual Field ◽

Markov Process ◽

Computational Model ◽

Associative Learning ◽

Input Data ◽

Luminance Change ◽

Depth Data ◽

Graded Response ◽

Left And Right ◽

Spatial Locations

A computational model of structure from stereo that develops smoothness constraints naturally by associative learning of a large number of example mappings from disparity data to surface depth data is proposed. Banks of disparity-selective graded response units at all spatial locations in the visual field were the input data. These cells responded to matches of luminance change at convergent, divergent, or zero offsets in the left and right ‘retina’ samples. Surfaces were created by means of a pseudo-Markov process. From these surfaces, shaded marked and ummarked surfaces were created, along with random-dot versions of the same surfaces. Learning of these example shaded and shaded marked surfaces allowed the system to solve stereo mappings both for the surfaces it had learned and for surfaces it had not learned but which had been created by the same pseudo-Markov process. Further, the model was able to solve some random-dot versions of the surfaces when the surfaces had been learned as shaded marked surfaces.

Download Full-text

Evaluation of the Use of Artificial Neural Networks in Solar Energy

Solar Concentrating Modules With Louvered Heliostats - Advances in Environmental Engineering and Green Technologies ◽

10.4018/978-1-7998-4276-7.ch007 ◽

2021 ◽

pp. 182-210

Keyword(s):

Neural Network ◽

Artificial Neural Network ◽

Set Theory ◽

Optimization Problems ◽

Search Algorithm ◽

Pv System ◽

Solar Insolation ◽

Pv Panel ◽

Artificial Neural ◽

Artificial Neural Network Ann

Artificial neural network (ANN) is initially used to forecast the solar insolation level and followed by the particle swarm optimisation (PSO) to optimise the power generation of the PV system based on the solar insolation level, cell temperature, efficiency of PV panel, and output voltage requirements. Genetic algorithm is a general-purpose optimization algorithm that is distinguished from conventional optimization techniques by the use of concepts of population genetics to guide the optimization search. Tabu search algorithm is a conceptually simple and an elegant iterative technique for finding good solutions to optimization problems. Simulated annealing algorithms appeared as a promising heuristic algorithm for handling the combinatorial optimization problems. Fuzzy logic algorithms set theory can be considered as a generation of the classical set theory. The artificial neural network (ANN)-based solar insolation forecast has shown satisfactory results with minimal error, and the generated PV power can be optimised significantly with the aids of the PSO algorithm.

Download Full-text

Soft covering based rough graphs and corresponding decision making

Open Mathematics ◽

10.1515/math-2019-0033 ◽

2019 ◽

Vol 17 (1) ◽

pp. 423-438

Author(s):

Choonkil Park ◽

Nasir Shah ◽

Noor Rehman ◽

Abbas Ali ◽

Muhammad Irfan Ali ◽

...

Keyword(s):

Decision Making ◽

Graph Theory ◽

Set Theory ◽

Rough Set ◽

Rough Set Theory ◽

Soft Set ◽

Basic Properties

Abstract Soft set theory and rough set theory are two new tools to discuss uncertainty. Graph theory is a nice way to depict certain information. Particularly soft graphs serve the purpose beautifully. In order to discuss uncertainty in soft graphs, some new types of graphs called soft covering based rough graphs are introduced. Several basic properties of these newly defined graphs are explored. Applications of soft covering based rough graphs in decision making can be very fruitful. In this regard an algorithm has been proposed.

Download Full-text

THEOREMS OF POINTS AND PLANES IN THREE-DIMENSIONAL PROJECTIVE SPACE

Journal of the Australian Mathematical Society ◽

10.1017/s1446788708080981 ◽

2010 ◽

Vol 88 (1) ◽

pp. 75-92 ◽

Cited By ~ 4

Author(s):

DAVID G. GLYNN

Keyword(s):

Graph Theory ◽

Projective Space ◽

Search Algorithm ◽

Three Dimensional ◽

Point Configuration ◽

Graph Theoretic ◽

Dimensional Projective Space ◽

Forbidden Minors

AbstractWe discuss n4 configurations of n points and n planes in three-dimensional projective space. These have four points on each plane, and four planes through each point. When the last of the 4n incidences between points and planes happens as a consequence of the preceding 4n−1 the configuration is called a ‘theorem’. Using a graph-theoretic search algorithm we find that there are two 84 and one 94 ‘theorems’. One of these 84 ‘theorems’ was already found by Möbius in 1828, while the 94 ‘theorem’ is related to Desargues’ ten-point configuration. We prove these ‘theorems’ by various methods, and connect them with other questions, such as forbidden minors in graph theory, and sets of electrons that are energy minimal.

Download Full-text

Disjoint Genus-0 Surfaces in Extremal Graph Theory and Set Theory Lead To a Novel Topological Theorem

10.20944/preprints202109.0082.v1 ◽

2021 ◽

Author(s):

Arturo Tozzi

Keyword(s):

Graph Theory ◽

Set Theory ◽

Extremal Graph Theory ◽

Topological Manifold ◽

Tree Graph ◽

Extremal Set Theory ◽

Extremal Set ◽

Cycle Graph ◽

Topological Theorem ◽

Theory Lead

When an edge is removed, a cycle graph Cn becomes a n-1 tree graph. This observation from extremal set theory leads us to the realm of set theory, in which a topological manifold of genus-1 turns out to be of genus-0. Starting from these premises, we prove a theorem suggesting that a manifold with disjoint points must be of genus-0, while a manifold of genus-1 cannot encompass disjoint points.

Download Full-text

Comparison of Two Network-Theory-Based Methods for detecting Functional Regions

Business Systems Research Journal ◽

10.2478/bsrj-2020-0013 ◽

2020 ◽

Vol 11 (2) ◽

pp. 21-35

Author(s):

Samo Drobne ◽

Alberto Garre ◽

Eloy Hontoria ◽

Miha Konjar

Keyword(s):

Graph Theory ◽

Set Theory ◽

Fuzzy Set Theory ◽

Network Theory ◽

Urban Region ◽

Functional Regions ◽

Important Basis ◽

Home Region

AbstractBackground: Functional regions are abstract, uniformly defined territorial units that form an important basis for many development strategies of a country or a region.Objectives: This study analyses the application of network theory to the detection of such regions.Methods/Approach: Functional regions are analysed using two methods based on the graph theory: the Walktrap algorithm and the chain approach. The quality of the two regionalization methods is analysed using the fuzzy set theory with the revised method. Slovenia was used as a case study.Results: The Walktrap algorithm generated eight functional regions; seven of them corresponded to those identified in previous studies. The only difference occurred in the northwestern mountainous part of Slovenia. The chain approach led to similar results, although it resulted in a huge functional urban region of the capital Ljubljana.Conclusions: The results show that the Walktrap algorithm calculates regions that are more closed, where more workers find work in the home region, than the chain approach.

Download Full-text

Matroid And Its Outlines

10.20944/preprints202106.0146.v1 ◽

2021 ◽

Author(s):

Henry Garrett

Keyword(s):

Graph Theory ◽

Set Theory ◽

Independent Set ◽

Minimal Set ◽

Fundamental Parameters ◽

As If

In this article, there's an effort to make sense about the new versions of matroid. I believe that there's new idea on the background of. matroid. Two styles of matroid is defined in the background of fixed graphs and after that the attributes of these new notion on the graph and its parameters have been studied. The focus of this article is on the version of matroid which has the basis on the cycles as if there's gentle discussion on the results which are based on the set of independent vertices as matroid-x. The relation amid fundamental parameters and specific set like independent set and minimal set in the terminology of graph theory have been considered. Matroid is the word to use in the study on the parameters of graph theory as if set theory and its terminology are also recorded. The terms of word in various terminology have been relatively used. There are open ways to use hypergraphs or some serious relations amid these two types.

Download Full-text

A Formal Framework for Cognitive Models of Multitasking

10.31234/osf.io/7yzdn ◽

2020 ◽

Author(s):

Michael Lesnick ◽

Sebastian Musslick ◽

Biswadip Dey ◽

Jonathan D. Cohen

Keyword(s):

Graph Theory ◽

Success Rate ◽

Set Theory ◽

Stroop Task ◽

Recent Literature ◽

Cognitive Models ◽

Formal Framework ◽

Formal Definitions ◽

Mathematical Foundations

This note introduces mathematical foundations for modeling of human multitask performance. Using basic definitions from set theory and graph theory, we introduce formal definitions of the environment in which multitasks are performed, of an agent which attempts to perform a multitask, and of the success rate of the agent on a multitask. Drawing on the recent literature on modeling of multitasking, we give two simple examples of multitasking agents, and illustrate the performance of these agents on two multitasking problems: the well-known Stroop task, and a more complex variant.

Download Full-text