scholarly journals Assessment of the Level of Integration and State of the Organization’s IT Infrastructure

2022 ◽  
Vol 8 (1) ◽  
pp. 173-177
Author(s):  
A. Voronin
Keyword(s):  
Graph Theory ◽  
The State ◽  
It Infrastructure

The paper considers a method for assessing the state of an organization’s IT infrastructure using graph theory. The description of the main parameters which can be used to describe the state and assessment of infrastructure is given, the ways of their application are determined.

A Constraint Solving System and Approach Based on Graph Theory and Floating DOF

2013 ◽  
Vol 444-445 ◽  
pp. 894-900
Author(s):  
Li Jiang ◽  
Bu Ying Xie ◽  
Kai Hu
Keyword(s):  
Graph Theory ◽  
Parametric Design ◽  
The State ◽  
Plane Geometry ◽  
Constraint Solving ◽  
System Changes ◽  
Flow Effects ◽  
Rules Changes ◽  
Parameter Values

Parametric design is a kind of concept to build and analyze models by using parameters or variables rather than digits. Models with different specifications can be achieved by changing the parameter values which are associated with the establishment by labeling the size and adding a variety of constraints. To represent the solving system of plane geometry constraints, the concept of floating DOF is applied based on graph theory to represent the state of the constraints system. And through the establishment of the variable passing rules, changes of the parameters can be shown as rational flow effects in graphs so that the system can give a clearly expression and achieve the fast driven effect of the graphics system changes.

scholarly journals MODELING OF MOBILE TMR MIXER OPERATION

2020 ◽  
Vol 61 (2) ◽  
pp. 193-198
Author(s):  
A.I. Kupreenko ◽  
Kh.М. Isaev ◽  
Yu.A. Kuznetsov ◽  
S.М. Mikhailichenko ◽  
I.N. Kravchenko ◽  
...  
Keyword(s):  
Graph Theory ◽  
Time Lapse ◽  
The State ◽  
State Graph ◽  
Feed Mixture ◽  
Number Of Components ◽  
Final Formula ◽  
Generalized State ◽  
Cattle Farms ◽  
Production Conditions

A method for determining the duration of the process of preparation and distribution of feed mixtures by a mobile mixer on cattle farms, based on graph theory, is proposed. A generalized state graph of the mobile mixer is presented and its description is given. The final formula for calculating the probability of the mobile mixer being in the state of distribution of a feed mixture consisting of a different number of components is given. To check the method adequacy, time-lapse measurements were performed in production conditions. The projected durability of the mobile mixer was 92.3% (0.36 h) of the actual recorded time of 0.39 h.

Three Remarkable Graphs

1973 ◽  
Vol 25 (2) ◽  
pp. 397-411 ◽  
Author(s):  
Norman Biggs
Keyword(s):  
Graph Theory ◽  
Mathematical Theory ◽  
The State ◽  
The Subject ◽  
Theoretical Results ◽  
Made In

In the development of any mathematical theory it is often advisable to test the known theoretical results in particular cases, for in this way we are able to judge the state of the subject, its strengths and its weaknesses. It is the purpose of this paper to put forward three remarkable graphs which can be used to indicate the progress being made in research in graph theory. We shall undertake three tasks - the construction of the graphs themselves, the investigation of their properties (insofar as the theory allows), and the indication of possible lines for further enquiry.

scholarly journals Graph Theory of Tower Tasks

2012 ◽  
Vol 25 (1) ◽  
pp. 13-22 ◽  
Author(s):  
Andreas M. Hinz
Keyword(s):  
Mathematical Model ◽  
Graph Theory ◽  
The State ◽  
State Graph ◽  
Problem Space ◽  
Test Tool ◽  
The Mathematical Model ◽  
Analysis Of Performance ◽  
Selection Of

The appropriate mathematical model for the problem space of tower transformation tasks is the state graph representing positions of discs or balls and their moves. Graph theoretical quantities like distance, eccentricities or degrees of vertices and symmetries of graphs support the choice of problems, the selection of tasks and the analysis of performance of subjects whose solution paths can be projected onto the graph. The mathematical model is also at the base of a computerized test tool to administer various types of tower tasks.

scholarly journals An experimental analysis of a GP hyperheuristic approach for evolving low-cost heuristics for profile reductions

2020 ◽  
Author(s):  
Libério Silva ◽  
Sanderson Gonzaga De Oliveira
Keyword(s):  
Graph Theory ◽  
Genetic Programming ◽  
Experimental Analysis ◽  
Sparse Matrix ◽  
Low Cost ◽  
The State ◽  
High Quality ◽  
Profile Reduction

Researchers used graph-theory approaches to design the state-of-theart low-cost heuristics for profile reduction. This paper evolves and selects four low-cost heuristics for profile reduction using a genetic programming hyperheuristic approach. This paper evaluates the resulting heuristics for profile reduction from the genetic programming hyperheuristic approach in two application areas against the low-cost heuristics for solving the problem. The results obtained on a set of standard benchmark matrices taken from the SuiteSparse sparse matrix collection indicate that the resulting heuristics from the genetic programming hyperheuristic approach does not compare favorably with a high-quality heuristics for profile reduction.

Vertex Selection Heuristics in Branch-and-Bound Algorithms for the Maximum k-Plex Problem

2019 ◽  
Vol 28 (05) ◽  
pp. 1950015
Author(s):  
Kuixian Wu ◽  
Jian Gao ◽  
Rong Chen ◽  
Xianji Cui
Keyword(s):  
Social Networks ◽  
Graph Theory ◽  
Branch And Bound ◽  
State Of The Art ◽  
The State ◽  
Branch And Bound Algorithm ◽  
Sparse Graphs ◽  
Historical Information ◽  
Branch And Bound Algorithms ◽  
Heuristic Strategies

As a relaxation of clique in graph theory, k-plex is a powerful tool for analyzing social networks and identifying cohesive structures in graphs. Recently, more and more researchers have concentrated on the algorithms for the maximum k-plex problem. Among those algorithms, a branch-and-bound algorithm proposed very recently shows a good performance on solving large sparse graphs, but does not work well on social networks. In this paper, we propose two novel vertex selection heuristic strategies for branching. The first one employs historical information of vertex reduction, and the second one is a combination of the first heuristic and the degree-based approach. Intensive experiments on Facebook benchmark show that the algorithm combining our heuristics outperforms the state-of-the-art algorithms.

Practical Picture Processing

1974 ◽  
Vol 32 ◽  
pp. 338-339
Author(s):  
T. A. Welton
Keyword(s):  
Radiation Damage ◽  
Coherence Length ◽  
Spatial Information ◽  
State Of The Art ◽  
Coherent Radiation ◽  
The State ◽  
Energy Spread ◽  
Electron Micrograph ◽  
Picture Processing ◽  
Molecular Skeleton

Various authors have emphasized the spatial information resident in an electron micrograph taken with adequately coherent radiation. In view of the completion of at least one such instrument, this opportunity is taken to summarize the state of the art of processing such micrographs. We use the usual symbols for the aberration coefficients, and supplement these with £ and 6 for the transverse coherence length and the fractional energy spread respectively. He also assume a weak, biologically interesting sample, with principal interest lying in the molecular skeleton remaining after obvious hydrogen loss and other radiation damage has occurred.

Sign in / Sign up

Export Citation Format

Share Document