To see the other types of publications on this topic, follow the link: Weakly proper spanning tree.

Journal articles on the topic 'Weakly proper spanning tree'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Weakly proper spanning tree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

ALZOUBI, KHALED M., PENG-JUN WAN, and OPHIR FRIEDER. "MAXIMAL INDEPENDENT SET, WEAKLY-CONNECTED DOMINATING SET, AND INDUCED SPANNERS IN WIRELESS AD HOC NETWORKS." International Journal of Foundations of Computer Science 14, no. 02 (2003): 287–303. http://dx.doi.org/10.1142/s012905410300173x.

Full text
Abstract:
A maximal independent set (MIS) S for a graph G is an independent set and no proper superset of S is also independent. A set S is dominating if each node in the graph is either in S or adjacent to one of the nodes in S. The subgraph weakly induced by S is the graph G′ such that each edge in G′ has at least one end point in S. A set S is a weakly-connected dominating set (WCDS) of G if S is dominating and G′ is connected. G′ is a sparse spanner if it has linear edges. The nodes of WCDS have been proposed in the literature as clusterheads for clustered wireless ad hoc networks. In this paper, we
APA, Harvard, Vancouver, ISO, and other styles
2

Bhatt, Abhay G., and Rahul Roy. "On a random directed spanning tree." Advances in Applied Probability 36, no. 1 (2004): 19–42. http://dx.doi.org/10.1239/aap/1077134462.

Full text
Abstract:
We study the asymptotic properties of a minimal spanning tree formed by n points uniformly distributed in the unit square, where the minimality is amongst all rooted spanning trees with a direction of growth. We show that the number of branches from the root of this tree, the total length of these branches, and the length of the longest branch each converges weakly. This model is related to the study of record values in the theory of extreme-value statistics and this relation is used to obtain our results. The results also hold when the tree is formed from a Poisson point process of intensity
APA, Harvard, Vancouver, ISO, and other styles
3

Bhatt, Abhay G., and Rahul Roy. "On a random directed spanning tree." Advances in Applied Probability 36, no. 01 (2004): 19–42. http://dx.doi.org/10.1017/s0001867800012854.

Full text
Abstract:
We study the asymptotic properties of a minimal spanning tree formed by n points uniformly distributed in the unit square, where the minimality is amongst all rooted spanning trees with a direction of growth. We show that the number of branches from the root of this tree, the total length of these branches, and the length of the longest branch each converges weakly. This model is related to the study of record values in the theory of extreme-value statistics and this relation is used to obtain our results. The results also hold when the tree is formed from a Poisson point process of intensity
APA, Harvard, Vancouver, ISO, and other styles
4

Mayliana, Mayliana. "Optimasi Jaringan dengan Spanning Tree untuk Congestion Management." ComTech: Computer, Mathematics and Engineering Applications 5, no. 1 (2014): 53. http://dx.doi.org/10.21512/comtech.v5i1.2582.

Full text
Abstract:
A proper network optimization is needed to deal with problems on the network and to minimize latency in the data flow in a dense network. The data stream is directed into the right channels so that the optimal network speed and latency can be minimized. Spanning tree is one of the algorithms that can be used. The purpose of the Spanning tree is to prevent and reduce the loops in the network by negotiating free path and as well as to increase network uptime through redundancy (back-up). To comprehend spanning tree, the first important thing to know is how bridges and switches perform their func
APA, Harvard, Vancouver, ISO, and other styles
5

Penrose, Mathew D. "Extremes for the minimal spanning tree on normally distributed points." Advances in Applied Probability 30, no. 3 (1998): 628–39. http://dx.doi.org/10.1239/aap/1035228120.

Full text
Abstract:
Let n points be placed independently in ν-dimensional space according to the standard ν-dimensional normal distribution. Let Mn be the longest edge-length of the minimal spanning tree on these points; equivalently let Mn be the infimum of those r such that the union of balls of radius r/2 centred at the points is connected. We show that the distribution of (2 log n)1/2Mn - bn converges weakly to the Gumbel (double exponential) distribution, where bn are explicit constants with bn ~ (ν - 1)log log n. We also show the same result holds if Mn is the longest edge-length for the nearest neighbour g
APA, Harvard, Vancouver, ISO, and other styles
6

Penrose, Mathew D. "Extremes for the minimal spanning tree on normally distributed points." Advances in Applied Probability 30, no. 03 (1998): 628–39. http://dx.doi.org/10.1017/s000186780000851x.

Full text
Abstract:
Let n points be placed independently in ν-dimensional space according to the standard ν-dimensional normal distribution. Let M n be the longest edge-length of the minimal spanning tree on these points; equivalently let M n be the infimum of those r such that the union of balls of radius r/2 centred at the points is connected. We show that the distribution of (2 log n)1/2 M n - b n converges weakly to the Gumbel (double exponential) distribution, where b n are explicit constants with b n ~ (ν - 1)log log n. We also show the same result holds if M n is the longest edge-length for the nearest nei
APA, Harvard, Vancouver, ISO, and other styles
7

Dereniowski, Dariusz. "Minimum vertex ranking spanning tree problem for chordal and proper interval graphs." Discussiones Mathematicae Graph Theory 29, no. 2 (2009): 253. http://dx.doi.org/10.7151/dmgt.1445.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bereta, Michał. "Evolutionary Approach to the Euclidean Steiner Tree Problem in n-Space." Applied Sciences 15, no. 3 (2025): 1413. https://doi.org/10.3390/app15031413.

Full text
Abstract:
This article presents the application of a genetic algorithm for solving the Euclidean Steiner problem in spaces of dimensionality greater than 2. The Euclidean Steiner problem involves finding the minimum spanning network that connects a given set of vertices, including the additional Steiner vertices, in a multi-dimensional space. The focus of this research is to compare several different settings of the method, including the crossover operators and sorting of the input data. The paper points out that significant improvement in results can be achieved through proper initialization of the ini
APA, Harvard, Vancouver, ISO, and other styles
9

Sisto, Alessandro. "Contracting elements and random walks." Journal für die reine und angewandte Mathematik (Crelles Journal) 2018, no. 742 (2018): 79–114. http://dx.doi.org/10.1515/crelle-2015-0093.

Full text
Abstract:
Abstract We define a new notion of contracting element of a group and we show that contracting elements coincide with hyperbolic elements in relatively hyperbolic groups, pseudo-Anosovs in mapping class groups, rank one isometries in groups acting properly on proper {\mathrm{CAT}(0)} spaces, elements acting hyperbolically on the Bass–Serre tree in graph manifold groups. We also define a related notion of weakly contracting element, and show that those coincide with hyperbolic elements in groups acting acylindrically on hyperbolic spaces and with iwips in {\mathrm{Out}(F_{n})} , {n\geq 3} . We
APA, Harvard, Vancouver, ISO, and other styles
10

FERRAGINA, PAOLO, and FABRIZIO LUCCIO. "THREE TECHNIQUES FOR PARALLEL MAINTENANCE OF A MINIMUM SPANNING TREE UNDER BATCH OF UPDATES." Parallel Processing Letters 06, no. 02 (1996): 213–22. http://dx.doi.org/10.1142/s0129626496000212.

Full text
Abstract:
In this paper we provide three simple techniques to maintain in parallel the minimum spanning tree of an undirected graph under single or batch of edge updates (i.e., insertions and deletions). Our results extend the use of the sparsification data structure to the EREW PRAM model. For proper values of the batch size, our algorithms require less time and work than the best known dynamic parallel algorithms.
APA, Harvard, Vancouver, ISO, and other styles
11

Honma, Hirotoshi, Yoko Nakajima, Shino Nagasaki, and Atsushi Sasaki. "An Optimal Parallel Algorithm for Constructing a Spanning Tree on Proper Circle Trapezoid Graphs." Journal of Applied Mathematics and Physics 06, no. 08 (2018): 1649–58. http://dx.doi.org/10.4236/jamp.2018.68141.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

Cai, Shuiming, Peipei Zhou, and Zengrong Liu. "Effects of Time-Varying Impulses on the Synchronization of Delayed Dynamical Networks." Abstract and Applied Analysis 2013 (2013): 1–10. http://dx.doi.org/10.1155/2013/212753.

Full text
Abstract:
The effects of time-varying impulses on the synchronization of a class of general complex delayed dynamical networks are investigated. Different from the existing works, the impulses discussed here are time-varying, and both synchronizing and desynchronizing impulses are considered in the network model simultaneously. Moreover, the network topology is assumed to be directed and weakly connected with a spanning tree. By using the comparison principle, some simple yet generic globally exponential synchronization criteria are derived. It is shown that besides impulse strengths and impulsive inter
APA, Harvard, Vancouver, ISO, and other styles
13

CLAUSI, MIRELLA, DIEGO LEONE, and SERGEI E. SPIRIDONOV. "HAPLOTYPE DIVERSITY OF STEINERNEMA FELTIAE (NEMATODA: STEINERNEMATIDAE) IN EURASIA." Redia 103 (December 1, 2020): 133–36. http://dx.doi.org/10.19263/redia-103.20.21.

Full text
Abstract:
Phylogenetic analysis of ITS rDNA sequences of the entomopathogenic nematode Steinernema feltiae Filipjev, 1934 (Wouts, Mráček, Gerdin and Bedding, 1982) was used to infer intraspecific genetic variability of this rhabditid nematode. Nucleotide intraspecific differences among S. feltiae isolates reached the level of 19 base pairs per ITS rDNA region, i.e. up to 2.9%. Several weakly or moderately supported intraspecific clades were detected. Sicilian and Swiss isolates of S. feltiae were found clustering together. Swiss strain ‘St. Bernard’ has been isolated on the St. Bernardino mountain pass
APA, Harvard, Vancouver, ISO, and other styles
14

Graumlich, Lisa J. "Response of tree growth to climatic variation in the mixed conifer and deciduous forests of the upper Great Lakes region." Canadian Journal of Forest Research 23, no. 2 (1993): 133–43. http://dx.doi.org/10.1139/x93-020.

Full text
Abstract:
Tree-ring data were used to define regional tree-growth anomalies (i.e., recurring spatial patterns of growth that differ from long-term averages) for 11 species growing in a network of sites spanning the deciduous and mixed hardwood–conifer forest boundary in the upper Great Lakes region. Tree-ring samples were collected at 11 sites that are classified as mesic to dry–mesic based on species composition. At each stand at least 20 trees were sampled of each species dominant in the canopy, resulting in one to five species collections per stand and 31 chronologies in total. Principal component an
APA, Harvard, Vancouver, ISO, and other styles
15

Zhu, Weiping, Hongliang Lu, Xiaohui Cui, and Jiannong Cao. "A Distributed Relation Detection Approach in the Internet of Things." Mobile Information Systems 2017 (2017): 1–14. http://dx.doi.org/10.1155/2017/4789814.

Full text
Abstract:
In the Internet of Things, it is important to detect the various relations among objects for mining useful knowledge. Existing works on relation detection are based on centralized processing, which is not suitable for the Internet of Things owing to the unavailability of a server, one-point failure, computation bottleneck, and moving of objects. In this paper, we propose a distributed approach to detect relations among objects. We first build a system model for this problem that supports generic forms of relations and both physical time and logical time. Based on this, we design the Distribute
APA, Harvard, Vancouver, ISO, and other styles
16

Liu, Wei, Shaolei Zhou, Qingpo Wu, and Gaoyang Yin. "H∞ consensus of multi-agent systems in directed networks with Lipschitz non-linear dynamics." Transactions of the Institute of Measurement and Control 39, no. 12 (2016): 1877–84. http://dx.doi.org/10.1177/0142331216655395.

Full text
Abstract:
This paper studies the H∞ consensus problem of multi-agent systems with Lipschitz non-linearities and external disturbances in a general network. The topology is just required to contain a directed spanning tree. Distributed consensus controllers are constructed based on relative states information of neighbour agents. A novel matrix decomposition based approach is introduced to analyse the H∞ consensus problem, in which the H∞ consensus problem is converted into a H∞ control problem of lower dimension system by performing a proper linear variable transformation. Finally, the effectiveness of
APA, Harvard, Vancouver, ISO, and other styles
17

ENAYAT, ALI, and JOEL DAVID HAMKINS. "ZFC PROVES THAT THE CLASS OF ORDINALS IS NOT WEAKLY COMPACT FOR DEFINABLE CLASSES." Journal of Symbolic Logic 83, no. 1 (2018): 146–64. http://dx.doi.org/10.1017/jsl.2017.75.

Full text
Abstract:
AbstractIn ZFC, the class Ord of ordinals is easily seen to satisfy the definable version of strong inaccessibility. Here we explore deeper ZFC-verifiable combinatorial properties of Ord, as indicated in Theorems A & B below. Note that Theorem A shows the unexpected result that Ord is never definably weakly compact in any model of ZFC.Theorem A. Let${\cal M}$be any model of ZFC.(1)The definable tree property fails in${\cal M}$: There is an${\cal M}$-definable Ord-tree with no${\cal M}$-definable cofinal branch.(2)The definable partition property fails in${\cal M}$: There is an${\cal M}$-de
APA, Harvard, Vancouver, ISO, and other styles
18

Liu, Wei, Shaolei Zhou, Shi Yan, and Gaoyang Yin. "Robust Leaderless Consensus of Uncertain Multiagent Systems with Fast Switching Topologies." Mathematical Problems in Engineering 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/810950.

Full text
Abstract:
This paper investigates the robust leaderless consensus problem of uncertain multiagent systems with directed fast switching topologies. The topologies are assumed to jointly contain a directed spanning tree. Based on a special property of the graph Laplacian matrix, the consensus problem is converted into a stabilization problem by performing a proper variable transformation. Averaging method is employed for analysis. It is proved that if the topologies switch sufficiently fast and the controllers are properly designed, the robust leaderless consensus can still be achieved even when all the p
APA, Harvard, Vancouver, ISO, and other styles
19

Pu, Xingcheng, and Xia Sun. "The Couple-Group Consensus of Heterogeneous Multiagent Systems with Asynchronous Switching in Cooperative-Competitive Networks." Mathematical Problems in Engineering 2023 (January 17, 2023): 1–17. http://dx.doi.org/10.1155/2023/8105727.

Full text
Abstract:
This paper investigates the problem of leader-following or leaderless couple-group consensus of heterogeneous multiagent systems (HMASs) with cooperative-competitive interaction, asynchronous switching, and controller faults. Some novel protocols have been proposed to solve the couple-group consensus of the two kinds of HMASs. Compared with the existing results, asynchronous control, controller faults, leaders, and the competitive-cooperative interaction are all considered in these novel protocols. By using linear matrix inequality, graph theory, Lyapunov functional theory, and model-dependent
APA, Harvard, Vancouver, ISO, and other styles
20

Mayborodin, Sergey Vyacheslavovich. "SELECTION OF OPTIMAL VARIETIES OF APPLE TREE OF DIFFERENT MATURATION DATES IN THE CONDITIONS OF THE AZOV ZONE OF THE ROSTOV REGION." Fruit growing and viticulture of South Russia 6, no. 84 (2023): 1–14. http://dx.doi.org/10.30679/2219-5335-2023-6-84-1-14.

Full text
Abstract:
Currently, financial success in the market can be provided by varieties of fruit crops that have a complex of economically valuable and adaptively significant characteristics, at the same time, characterized by high yield capacity, proper presentation, transportability and the ability to long-term storage. The key to the cost-effective maintenance of an apple orchard is determined by rational technology, proper care of trees, and the correct selection of varieties. It is worth noting that the average yield capacity of apple fruits on the Don in the years before the reforms did not exceed 40-50
APA, Harvard, Vancouver, ISO, and other styles
21

Karmakar, Dhiman, Madhura Datta, and C. A. Murthy. "Intra-Class Threshold Generation in Multimodal Biometric Systems by Set Estimation Technique." International Journal of Software Science and Computational Intelligence 5, no. 3 (2013): 22–32. http://dx.doi.org/10.4018/ijssci.2013070102.

Full text
Abstract:
Biometric recognition techniques attracted the researchers for the last two decades due to their many applications in the field of security. In recent times multimodal biometrics have been found to perform better, in several aspects, over unimodal biometrics. The classical approach for recognition is based on dissimilarity measure and for the sake of proper classification one needs to put a threshold on the dissimilarity value. In this paper an intra-class threshold for multimodal biometric recognition procedure has been developed. The authors' selection method of threshold is based on statist
APA, Harvard, Vancouver, ISO, and other styles
22

Barman, Debaditya, and Nirmalya Chowdhury. "A Novel Approach for the Customer Segmentation Using Clustering Through Self-Organizing Map." International Journal of Business Analytics 6, no. 2 (2019): 23–45. http://dx.doi.org/10.4018/ijban.2019040102.

Full text
Abstract:
Customer segmentation is the process of forming smaller groups of customers according to their characteristics. Now companies can develop proper marketing strategies for each group to get the desired results. This type of direct marketing is practiced by most organizations from the size of smallest start-up to the Fortune 500 leaders. Clustering is the ideal data mining technique for customer segmentation. In this article, the authors have proposed a clustering algorithm based on the self-organizing map and minimum spanning tree for customer segmentation. The authors have used several syntheti
APA, Harvard, Vancouver, ISO, and other styles
23

Srisarkun, V., and C. Jittawiriyanukoon. "An approximation of balanced score in neutrosophic graphs with weak edge weights." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 6 (2021): 5286. http://dx.doi.org/10.11591/ijece.v11i6.pp5286-5291.

Full text
Abstract:
Neutrosophic concept is known undirected graph theory to involve with complex logistic networks, not clearly given and unpredictable real life situations, where fuzzy logic malfunctions to model. The transportation objective is to ship all logistic nodes in the network. The logistic network mostly experiences in stable condition, but for some edges found to be volatile. The weight of these erratic edges may vary at random (bridge-lifting/bascule, ad hoc accident on road, traffic condition) In this article, we propose an approximation algorithm for solving minimum spanning tree (MST) of an undi
APA, Harvard, Vancouver, ISO, and other styles
24

V., Srisarkun, and Jittawiriyanukoon C. "An approximation of balanced score in neutrosophic graphswith weak edge weights." International Journal of Electrical and Computer Engineering (IJECE) 11, no. 6 (2021): 5286–91. https://doi.org/10.11591/ijece.v11i6.pp5286-5291.

Full text
Abstract:
Neutrosophic concept is known undirected graph theory to involve with complex logistic networks, not clearly given and unpredictable real life situations, where fuzzy logic malfunctions to model. The transportation objective is to ship all logistic nodes in the network. The logistic network mostly experiences in stable condition, but for some edges found to be volatile. The weight of these erratic edges may vary at random (bridgelifting/bascule, ad hoc accident on road, traffic condition) In this article, we propose an approximation algorithm for solving minimum spanning tree (MST) of an undir
APA, Harvard, Vancouver, ISO, and other styles
25

Bratkovskaya, Elena, Susanne Glässel, Viktar Kireyeu, et al. "Midrapidity cluster formation in heavy-ion collisions." EPJ Web of Conferences 276 (2023): 03005. http://dx.doi.org/10.1051/epjconf/202327603005.

Full text
Abstract:
We study the production of clusters and hypernuclei at midrapidity employing the Parton-Hadron- Quantum-Molecular-Dynamics (PHQMD) approach, a microscopic n-body transport model based on the QMD propagation of the baryonic degrees of freedom with density dependent 2-body potential interactions. In PHQMD the cluster formation occurs dynamically, caused by the interactions. The clusters are recognized by the Minimum Spanning Tree (MST) algorithm. We present the PHQMD results for cluster and hypernuclei formation in comparison with the available experimental data at relativistic energies. PHQMD a
APA, Harvard, Vancouver, ISO, and other styles
26

Turan, Erhan, and Umut Orhan. "Confidence Indexing of Automated Detected Synsets: A Case Study on Contemporary Turkish Dictionary." ACM Transactions on Asian and Low-Resource Language Information Processing 21, no. 1 (2022): 1–19. http://dx.doi.org/10.1145/3469724.

Full text
Abstract:
In this study, a novel confidence indexing algorithm is proposed to minimize human labor in controlling the reliability of automatically extracted synsets from a non-machine-readable monolingual dictionary. Contemporary Turkish Dictionary of Turkish Language Association is used as the monolingual dictionary data. First, the synonym relations are extracted by traditional text processing methods from dictionary definitions and a graph is prepared in Lemma-Sense network architecture. After each synonym relation is labeled by a proper confidence index, synonym pairs with desired confidence indexes
APA, Harvard, Vancouver, ISO, and other styles
27

Manger, Paul R., and Oxana Eschenko. "The Mammalian Locus Coeruleus Complex—Consistencies and Variances in Nuclear Organization." Brain Sciences 11, no. 11 (2021): 1486. http://dx.doi.org/10.3390/brainsci11111486.

Full text
Abstract:
Descriptions of the nuclear parcellation of the locus coeruleus complex have been provided in approximately 80 mammal species spanning the phylogenetic breadth of this class. Within the mammalian rostral hindbrain, noradrenergic neurons (revealed with tyrosine hydroxylase and dopamine-ß-hydroxylase immunohistochemistry) have been observed within the periventricular grey matter (A4 and A6 nuclei) and parvicellular reticular nucleus (A5 and A7 nuclei), with the one exception to date being the tree pangolin, where no A4/A6 neurons are observed. The alphanumeric nomenclature system, developed in l
APA, Harvard, Vancouver, ISO, and other styles
28

Veličković, Boban. "Jensen's ⃞ principles and the Novák number of partially ordered sets." Journal of Symbolic Logic 51, no. 1 (1986): 47–58. http://dx.doi.org/10.2307/2273941.

Full text
Abstract:
In this paper we consider various properties of Jensen's □ principles and use them to construct several examples concerning the so-called Novák number of partially ordered sets.In §1 we give the relevant definitions and review some facts about □ principles. Apart from some simple observations most of the results in this section are known.In §2 we consider the Novák number of partially ordered sets and, using □ principles, give counterexamples to the productivity of this cardinal function. We also formulate a principle, show by forcing that it is consistent and use it to construct an ℵ2-Suslin
APA, Harvard, Vancouver, ISO, and other styles
29

Lopez, A. M., R. G. Clowes, and G. M. Williger. "A Big Ring on the sky." Journal of Cosmology and Astroparticle Physics 2024, no. 07 (2024): 055. http://dx.doi.org/10.1088/1475-7516/2024/07/055.

Full text
Abstract:
Abstract We present the discovery of `A Big Ring on the Sky' (BR), the second ultra-large large-scale structure (uLSS) found in Mg II-absorber catalogues, following the previously reported Giant Arc (GA). In cosmological terms the BR is close to the GA — at the same redshift z ∼ 0.8 and with a separation on the sky of only ∼ 12°. Two extraordinary uLSSs in such close configuration raises the possibility that together they form an even more extraordinary cosmological system. The BR is a striking circular, annulus-like, structure of diameter ∼ 400 Mpc (proper size, present epoch). The method of
APA, Harvard, Vancouver, ISO, and other styles
30

Popovic, Tatjana, Aleksandra Jelusic, Petar Mitrovic, Renata Ilicic, and Sanja Markovic. "Allelic profile of Serbian Xanthomonas campestris pv. campestris isolates from cabbage." Pesticidi i fitomedicina 35, no. 1 (2020): 19–26. http://dx.doi.org/10.2298/pif2001019p.

Full text
Abstract:
Xanthomonas campestris pv. campestris (Xcc), the causal agent of black rot disease of cabbage (Brassica oleracea var. capitata L.), is one of the most important bacteria which affect proper cabbage growth, leading to head weight and quality losses and thereby drastically reducing its marketing value. The pathogen is genetically diverse, which is evident from the presence of eleven races worldwide and more than thirty combinations of allelic profiles. Therefore, this study aimed to determine the allelic profiles of Serbian cabbage Xcc strains obtained in 2014. The analysis was done on three sel
APA, Harvard, Vancouver, ISO, and other styles
31

Bhattacharya, Souradeep, Kaushar Vaidya, W. P. Chen, and Giacomo Beccari. "The blue straggler population of the old open cluster Berkeley 17." Astronomy & Astrophysics 624 (April 2019): A26. http://dx.doi.org/10.1051/0004-6361/201834449.

Full text
Abstract:
Context. Blue straggler stars (BSSs) are observed in Galactic globular clusters and old open clusters. The radial distribution of BSSs has been used to diagnose the dynamical evolution of globular clusters. For the first time, with a reliable sample of BSSs identified with Gaia DR2, we conduct such an analysis for an open cluster. Aims. We aim to identify members, including BSSs, of the oldest known Galactic open cluster Berkeley 17 with the Gaia DR2 proper motions and parallaxes. We study the radial distribution of the BSS population to understand the dynamical evolution of the cluster. Metho
APA, Harvard, Vancouver, ISO, and other styles
32

Rezvanian, Alireza, and Mohammad Reza Meybodi. "Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 23, no. 01 (2015): 1–31. http://dx.doi.org/10.1142/s0218488515500014.

Full text
Abstract:
Because of unpredictable, uncertain and time-varying nature of real networks it seems that stochastic graphs, in which weights associated to the edges are random variables, may be a better candidate as a graph model for real world networks. Once the graph model is chosen to be a stochastic graph, every feature of the graph such as path, clique, spanning tree and dominating set, to mention a few, should be treated as a stochastic feature. For example, choosing stochastic graph as the graph model of an online social network and defining community structure in terms of clique, and the association
APA, Harvard, Vancouver, ISO, and other styles
33

Gray, S., S. Jackson, K. Taylor, C. Palmer, and C. Fastie. "Tree-Ring Based Reconstructions of Paleo-Precipitation Regimes in the Eastern Yellowstone Region." UW National Parks Service Research Station Annual Reports 24 (January 1, 2000): 144–48. http://dx.doi.org/10.13001/uwnpsrc.2000.3431.

Full text
Abstract:
There are few other regions where the influence of climate on basic ecosystem attributes has been as well documented as the Greater Yellowstone Ecosystem (GYE). Research has shown that elk, bison, and grizzly bear populations in the GYE are tightly linked to annual climate variation (Meagher 1976, Picton 1978). Authors have shown that the distribution of vegetation types in Grand Teton and Yellowstone National Parks is influenced by the seasonality of precipitation (Despain 1987, 1990). Natural disturbances, especially fires and insect outbreaks, are also known to coincide with specific climat
APA, Harvard, Vancouver, ISO, and other styles
34

Davis, Kara L., Erin F. Simonds, Sean C. Bendall, Wendy J. Fantl, and Garry P. Nolan. "Mass Cytometry Organizes the Heterogeneity of Pediatric B Cell Acute Lymphoblastic Leukemia." Blood 118, no. 21 (2011): 753. http://dx.doi.org/10.1182/blood.v118.21.753.753.

Full text
Abstract:
Abstract Abstract 753 Pediatric B Cell Acute Lymphoblastic Leukemia: Common and Unique Differentiation States Defined by Signaling Response States Background: When mutations or regulatory dysfunction drive inappropriate cell division or survival this sets the stage for cancer initiation or progression. At what point do cells in an early cancer veer from their normal cellular routines to no longer participate in the development of a normal cellular tissue architecture & differentiation heirarchy? Do they still attempt to play out their programming to some degree, or are they “free actors”?
APA, Harvard, Vancouver, ISO, and other styles
35

Norwood, Zach. "The Combinatorics and Absoluteness of Definable Sets of Real Numbers." Bulletin of Symbolic Logic 28, no. 2 (2022): 263–64. http://dx.doi.org/10.1017/bsl.2021.55.

Full text
Abstract:
AbstractThis thesis divides naturally into two parts, each concerned with the extent to which the theory of $L(\mathbf {R})$ can be changed by forcing.The first part focuses primarily on applying generic-absoluteness principles to how that definable sets of reals enjoy regularity properties. The work in Part I is joint with Itay Neeman and is adapted from our paper Happy and mad families in $L(\mathbf {R})$ , JSL, 2018. The project was motivated by questions about mad families, maximal families of infinite subsets of $\omega $ of which any two have only finitely many members in common. We begi
APA, Harvard, Vancouver, ISO, and other styles
36

Kazllarof, Vangjel, Stamatis Karlos, and Sotiris Kotsiantis. "Investigation of Combining Logitboost(M5P) under Active Learning Classification Tasks." Informatics 7, no. 4 (2020): 50. http://dx.doi.org/10.3390/informatics7040050.

Full text
Abstract:
Active learning is the category of partially supervised algorithms that is differentiated by its strategy to combine both the predictive ability of a base learner and the human knowledge so as to exploit adequately the existence of unlabeled data. Its ambition is to compose powerful learning algorithms which otherwise would be based only on insufficient labelled samples. Since the latter kind of information could raise important monetization costs and time obstacles, the human contribution should be seriously restricted compared with the former. For this reason, we investigate the use of the L
APA, Harvard, Vancouver, ISO, and other styles
37

Roth, R., and F. Joos. "A reconstruction of radiocarbon production and total solar irradiance from the Holocene <sup>14</sup>C and CO<sub>2</sub> records: implications of data and model uncertainties." Climate of the Past Discussions 9, no. 2 (2013): 1165–235. http://dx.doi.org/10.5194/cpd-9-1165-2013.

Full text
Abstract:
Abstract. Past atmospheric CO2 concentrations reconstructed from polar ice cores combined with its Δ14C signature as conserved in tree-rings provide important information both on the cycling of carbon as well as the production of radiocarbon (Q) in the atmosphere. The latter is modulated by changes in the strength of the magnetic field enclosed in the solar wind and is a proxy for past changes in solar activity. We perform transient carbon-cycle simulations spanning the past 21 kyr using Bern3D-LPX, a fully featured Earth System Model of Intermediate Complexity (EMIC) with a 3-D ocean, sedimen
APA, Harvard, Vancouver, ISO, and other styles
38

Bakker, Freek T., Alexandre Antonelli, Julia A. Clarke, et al. "The Global Museum: natural history collections and the future of evolutionary science and public education." PeerJ 8 (January 28, 2020): e8225. http://dx.doi.org/10.7717/peerj.8225.

Full text
Abstract:
Natural history museums are unique spaces for interdisciplinary research and educational innovation. Through extensive exhibits and public programming and by hosting rich communities of amateurs, students, and researchers at all stages of their careers, they can provide a place-based window to focus on integration of science and discovery, as well as a locus for community engagement. At the same time, like a synthesis radio telescope, when joined together through emerging digital resources, the global community of museums (the ‘Global Museum’) is more than the sum of its parts, allowing insigh
APA, Harvard, Vancouver, ISO, and other styles
39

Mussinelli, Elena. "Project quality, regulation quality." TECHNE - Journal of Technology for Architecture and Environment, no. 27 (June 10, 2024): 10–14. http://dx.doi.org/10.36253/techne-16054.

Full text
Abstract:
In the Italian context, the first law directly affecting the urban planning and building sector dates back to approximately 160 years ago, precisely Law 2248/1865. It established the administrative unification of the Kingdom of Italy, empowering municipal councils to deliberate on ‘hygiene, building and local police regulations’, and was followed a few months later by Law 2359/1865 on expropriations for public purpose. By contrast, the first regulations for the protection of artistic, historical, archaeological and ethnographic heritage (1089/1938), and natural beauty (1497/1939), are just ove
APA, Harvard, Vancouver, ISO, and other styles
40

Yang, Xianyu, Amy L. Angert, Pieter A. Zuidema, et al. "Coexistence of Tropical Forest Tree Species Along the Demographic Buffering Spectrum." Global Change Biology 31, no. 6 (2025). https://doi.org/10.1111/gcb.70310.

Full text
Abstract:
ABSTRACTOrganisms have evolved diverse adaptive strategies to cope with environmental fluctuations. Slow‐growing long‐lived species tend to exhibit low temporal variability in population growth (strongly buffered demographically), whereas fast‐growing short‐lived species optimize growth in favorable years (weakly buffered). These patterns set up the expectation that differentiation in demographic buffering may reduce disparities in long‐term fitness among species, enhancing the potential for coexistence in variable environments. Yet, this expectation has never been empirically tested for trees
APA, Harvard, Vancouver, ISO, and other styles
41

Odyuo, Yanrenthung, Dipu Sarkar, and Lilika Sumi. "Optimal feeder reconfiguration in distributed generation environment under time-varying loading condition." SN Applied Sciences 3, no. 6 (2021). http://dx.doi.org/10.1007/s42452-021-04557-w.

Full text
Abstract:
Abstract The development and planning of optimal network reconfiguration strategies for electrical networks is greatly improved with proper application of graph theory techniques. This paper investigates the application of Kruskal's maximal spanning tree algorithm in finding the optimal radial networks for different loading scenarios from an interconnected meshed electrical network integrated with distributed generation (DG). The work is done with an objective to assess the prowess of Kruskal's algorithm to compute, obtain or derive an optimal radial network (optimal maximal spanning tree) tha
APA, Harvard, Vancouver, ISO, and other styles
42

Ruelle, Philippe. "Sandpile Models in the Large." Frontiers in Physics 9 (June 2, 2021). http://dx.doi.org/10.3389/fphy.2021.641966.

Full text
Abstract:
This contribution is a review of the deep and powerful connection between the large-scale properties of critical systems and their description in terms of a field theory. Although largely applicable to many other models, the details of this connection are illustrated in the class of two-dimensional Abelian sandpile models. Bulk and boundary height variables, spanning tree–related observables, boundary conditions, and dissipation are all discussed in this context and found to have a proper match in the field theoretic description.
APA, Harvard, Vancouver, ISO, and other styles
43

Huang, Guan, Zhuo Zhang, Weisheng Yan, and Xinxin Guo. "Differential graphical games of multiagent systems with nonzero leader's control input and external disturbances." International Journal of Robust and Nonlinear Control, April 18, 2024. http://dx.doi.org/10.1002/rnc.7378.

Full text
Abstract:
AbstractIn this article, we investigate the problem of differential graphical games for multiagent systems (MASs) with external disturbances. In particular, the system considered in this article allows the leader to have an unknown bounded control input, and the communication topology between agents is allowed to be a weakly restricted structure with only containing a directed spanning tree. We propose a novel dynamic sliding mode control strategy to dispose the presence of leader's nonzero control input and external disturbances. Furthermore, a nominal controller based on the worst‐case contr
APA, Harvard, Vancouver, ISO, and other styles
44

Aprile, Manuel, Samuel Fiorini, Tony Huynh, Gwenaël Joret, and David R. Wood. "Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond." Electronic Journal of Combinatorics 28, no. 4 (2021). http://dx.doi.org/10.37236/10522.

Full text
Abstract:
Let $G$ be a connected $n$-vertex graph in a proper minor-closed class $\mathcal G$. We prove that the extension complexity of the spanning tree polytope of $G$ is $O(n^{3/2})$. This improves on the $O(n^2)$ bounds following from the work of Wong (1980) and Martin (1991). It also extends a result of Fiorini, Huynh, Joret, and Pashkovich (2017), who obtained a $O(n^{3/2})$ bound for graphs embedded in a fixed surface. Our proof works more generally for all graph classes admitting strongly sublinear balanced separators: We prove that for every constant $\beta$ with $0&lt;\beta&lt;1$, if $\mathca
APA, Harvard, Vancouver, ISO, and other styles
45

Konghe, Xie. "Consensus of Multi-Agent Systems under the Special Consensus Protocols." February 2, 2017. https://doi.org/10.5281/zenodo.1129251.

Full text
Abstract:
Two consensus problems are considered in this paper. One is the consensus of linear multi-agent systems with weakly connected directed communication topology. The other is the consensus of nonlinear multi-agent systems with strongly connected directed communication topology. For the first problem, a simplified consensus protocol is designed: Each child agent can only communicate with one of its neighbors. That is, the real communication topology is a directed spanning tree of the original communication topology and without any cycles. Then, the necessary and sufficient condition is put forward
APA, Harvard, Vancouver, ISO, and other styles
46

Tian, Hongxiang, Enze Gong, Chongsi Xie, and Yi-Jian Du. "Evaluating EYM amplitudes in four dimensions by refined graphic expansion." Journal of High Energy Physics 2021, no. 4 (2021). http://dx.doi.org/10.1007/jhep04(2021)150.

Full text
Abstract:
Abstract The recursive expansion of tree level multitrace Einstein-Yang-Mills (EYM) amplitudes induces a refined graphic expansion, by which any tree-level EYM amplitude can be expressed as a summation over all possible refined graphs. Each graph contributes a unique coefficient as well as a proper combination of color-ordered Yang-Mills (YM) amplitudes. This expansion allows one to evaluate EYM amplitudes through YM amplitudes, the latter have much simpler structures in four dimensions than the former. In this paper, we classify the refined graphs for the expansion of EYM amplitudes into N k
APA, Harvard, Vancouver, ISO, and other styles
47

Zhang, Haixiang, Chong Chen, Jun Huang, and Yueyuan Zhang. "Consensus based on output for nonlinear multi-agent systems with switching topologies." Transactions of the Institute of Measurement and Control, May 12, 2022, 014233122210966. http://dx.doi.org/10.1177/01423312221096683.

Full text
Abstract:
This article addresses the consensus problem based on static output feedback for a kind of leader-following multi-agent systems. Traditional nonlinear constraints, such as Lipschitz and one-sided Lipschitz, cannot describe most nonlinear functions. The incremental quadratic constraints and switching topologies are considered to extend the application range and practical significance of the existing consensus control protocol. By investigating the topology having a directed spanning tree and constructing a proper Lyapunov function, this article gives sufficient conditions for the consensus prob
APA, Harvard, Vancouver, ISO, and other styles
48

Zhang, Yunlong, Guoguang Wen, Ahmed Rahmani, Zhaoxia Peng, and Wei Hu. "Cluster consensus of multi-agent systems with general linear and nonlinear dynamics via intermittent adaptive pinning control." Transactions of the Institute of Measurement and Control, December 14, 2020, 014233122097525. http://dx.doi.org/10.1177/0142331220975254.

Full text
Abstract:
This paper investigates the cluster consensus of multi-agent systems (MASs) with general linear and nonlinear dynamics via intermittent adaptive pinning control, where each cluster has a virtual leader whose state can be sensed by only a small part of followers on some disconnected time intervals because of communication constraints. The communication topology is considered to be weakly connected, that is, it is not necessary to be in-degree balanced, strongly connected or contain a directed spanning tree. To realise the cluster consensus, a class of intermittent adaptive pinning control proto
APA, Harvard, Vancouver, ISO, and other styles
49

Edge, David C., Alan D. Wanamaker, Lydia M. Staisch, David J. Reynolds, Karine L. Holmes, and Bryan A. Black. "A MODERN MULTICENTENNIAL RECORD OF RADIOCARBON VARIABILITY FROM AN EXACTLY DATED BIVALVE CHRONOLOGY AT THE TREE NOB SITE (ALASKA COASTAL CURRENT)." Radiocarbon, November 10, 2022, 1–16. http://dx.doi.org/10.1017/rdc.2022.83.

Full text
Abstract:
ABSTRACT Quantifying the marine radiocarbon reservoir effect, offsets (ΔR), and ΔR variability over time is critical to improving dating estimates of marine samples while also providing a proxy of water mass dynamics. In the northeastern Pacific, where no high-resolution time series of ΔR has yet been established, we sampled radiocarbon (14C) from exactly dated growth increments in a multicentennial chronology of the long-lived bivalve, Pacific geoduck (Paneopea generosa) at the Tree Nob site, coastal British Columbia, Canada. Samples were taken at approximately decadal time intervals from 172
APA, Harvard, Vancouver, ISO, and other styles
50

Chen, Jun, Haoxin Lv, Zhixia Zhang, et al. "Multilocus Sequence Typing of Leuconostoc mesenteroides Strains From the Qinghai-Tibet Plateau." Frontiers in Microbiology 12 (January 25, 2021). http://dx.doi.org/10.3389/fmicb.2021.614286.

Full text
Abstract:
Leuconostoc mesenteroides strains were a type of epiphytic bacterium widely used in fermented foods and products in the biochemical and pharmaceutical industries but data on its presence in foods from Qinghai-Tibet Plateau in China was scarce. In this study, molecular analysis based on multilocus sequence typing (MLST) with eight housekeeping genes (pyrG, groeL, rpoB, recA, uvrC, murC, carB, and pheS) was carried out on 45 L. mesenteroides strains isolated from different plants and dairy products from Qinghai-Tibet Plateau in China. The objective of this study was to perform genetic diversity
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!