scholarly journals Cohesive Subgraph Identification in Weighted Bipartite Graphs

2021 ◽  
Vol 11 (19) ◽  
pp. 9051
Author(s):  
Xijuan Liu ◽  
Xiaoyang Wang
Keyword(s):  
Bipartite Graph ◽  
Fundamental Problem ◽  
Bipartite Graphs ◽  
Optimization Techniques ◽  
Graph Analysis ◽  
Index Construction ◽  
Massive Graphs ◽  
The Right

Cohesive subgraph identification is a fundamental problem in bipartite graph analysis. In real applications, to better represent the co-relationship between entities, edges are usually associated with weights or frequencies, which are neglected by most existing research. To fill the gap, we propose a new cohesive subgraph model, (k,ω)-core, by considering both subgraph cohesiveness and frequency for weighted bipartite graphs. Specifically, (k,ω)-core requires each node on the left layer to have at least k neighbors (cohesiveness) and each node on the right layer to have a weight of at least ω (frequency). In real scenarios, different users may have different parameter requirements. To handle massive graphs and queries, index-based strategies are developed. In addition, effective optimization techniques are proposed to improve the index construction phase. Compared with the baseline, extensive experiments on six datasets validate the superiority of our proposed methods.

scholarly journals Functional network topology of the right insula affects emotion dysregulation in hyperactive-impulsive attention-deficit/hyperactivity disorder

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Tammo Viering ◽  
Pieter J. Hoekstra ◽  
Alexandra Philipsen ◽  
Jilly Naaijen ◽  
Andrea Dietrich ◽  
...  
Keyword(s):  
Attention Deficit Hyperactivity Disorder ◽  
Network Topology ◽  
Resting State ◽  
Latent Variable ◽  
Emotion Dysregulation ◽  
Adult Adhd ◽  
Brain Regions ◽  
Graph Analysis ◽  
Hyperactivity Disorder ◽  
The Right

AbstractEmotion dysregulation is common in attention-deficit/hyperactivity disorder (ADHD). It is highly prevalent in young adult ADHD and related to reduced well-being and social impairments. Neuroimaging studies reported neural activity changes in ADHD in brain regions associated with emotion processing and regulation. It is however unknown whether deficits in emotion regulation relate to changes in functional brain network topology in these regions. We used a combination of graph analysis and structural equation modelling (SEM) to analyze resting-state functional connectivity in 147 well-characterized young adults with ADHD and age-matched healthy controls from the NeuroIMAGE database. Emotion dysregulation was gauged with four scales obtained from questionnaires and operationalized through a latent variable derived from SEM. Graph analysis was applied to resting-state data and network topology measures were entered into SEM models to identify brain regions whose local network integration and connectedness differed between subjects and was associated with emotion dysregulation. The latent variable of emotion dysregulation was characterized by scales gauging emotional distress, emotional symptoms, conduct symptoms, and emotional lability. In individuals with ADHD characterized by prominent hyperactivity-impulsivity, the latent emotion dysregulation variable was related to an increased clustering and local efficiency of the right insula. Thus, in the presence of hyperactivity-impulsivity, clustered network formation of the right insula may underpin emotion dysregulation in young adult ADHD.

scholarly journals Scene Complexity: A New Perspective on Understanding the Scene Semantics of Remote Sensing and Designing Image-Adaptive Convolutional Neural Networks

2021 ◽  
Vol 13 (4) ◽  
pp. 742
Author(s):  
Jian Peng ◽  
Xiaoming Mei ◽  
Wenbo Li ◽  
Liang Hong ◽  
Bingyu Sun ◽  
...  
Keyword(s):  
Remote Sensing ◽  
Neural Networks ◽  
Fundamental Problem ◽  
Semantic Representation ◽  
Feature Learning ◽  
Essential Elements ◽  
Complex Scene ◽  
Feature Representations ◽  
The Right ◽  
The Relationship

Scene understanding of remote sensing images is of great significance in various applications. Its fundamental problem is how to construct representative features. Various convolutional neural network architectures have been proposed for automatically learning features from images. However, is the current way of configuring the same architecture to learn all the data while ignoring the differences between images the right one? It seems to be contrary to our intuition: it is clear that some images are easier to recognize, and some are harder to recognize. This problem is the gap between the characteristics of the images and the learning features corresponding to specific network structures. Unfortunately, the literature so far lacks an analysis of the two. In this paper, we explore this problem from three aspects: we first build a visual-based evaluation pipeline of scene complexity to characterize the intrinsic differences between images; then, we analyze the relationship between semantic concepts and feature representations, i.e., the scalability and hierarchy of features which the essential elements in CNNs of different architectures, for remote sensing scenes of different complexity; thirdly, we introduce CAM, a visualization method that explains feature learning within neural networks, to analyze the relationship between scenes with different complexity and semantic feature representations. The experimental results show that a complex scene would need deeper and multi-scale features, whereas a simpler scene would need lower and single-scale features. Besides, the complex scene concept is more dependent on the joint semantic representation of multiple objects. Furthermore, we propose the framework of scene complexity prediction for an image and utilize it to design a depth and scale-adaptive model. It achieves higher performance but with fewer parameters than the original model, demonstrating the potential significance of scene complexity.

The Conundrum of Charitability: Reassessing Tax Exemption For Hospitals

1990 ◽  
Vol 16 (3) ◽  
pp. 327-380
Author(s):  
David A. Hyman
Keyword(s):  
Health Care ◽  
Fundamental Problem ◽  
Health Care Environment ◽  
Care Environment ◽  
Sharp Focus ◽  
The Right ◽  
Do The Right Thing

Tax exemption is an ancient, honorable and expensive tradition. Tax exemption for hospitals is all of these three, but it also places in sharp focus a fundamental problem with tax exemption in general. Organizations can retain their tax exemption while changing circumstances or expectations undermine the rationale that led to the exemption in the first place. Hospitals are perhaps the best example of this problem. The dramatic changes in the health care environment have eliminated most of the characteristics of a hospital that originally persuaded the citizenry to grant it an exemption. Hospitals have entered into competition with tax-paying businesses, and have increasingly behaved like competitive actors. Such conduct may well be beneficial, but it does not follow that tax exemption is appropriate. Rather than an undifferentiated subsidy, a shift to focused goals will provide charitable hospitals with the opportunity and incentive to “do the right thing.”

scholarly journals On the induced matching problem in hamiltonian bipartite graphs

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Yinglei Song
Keyword(s):  
Bipartite Graph ◽  
Parameterized Complexity ◽  
Bipartite Graphs ◽  
Matching Problem ◽  
Induced Matching ◽  
Subexponential Time ◽  
Maximum Induced Matching

Abstract In this paper, we study the parameterized complexity of the induced matching problem in hamiltonian bipartite graphs and the inapproximability of the maximum induced matching problem in hamiltonian bipartite graphs. We show that, given a hamiltonian bipartite graph, the induced matching problem is W[1]-hard and cannot be solved in time n o ⁢ ( k ) {n^{o(\sqrt{k})}} , where n is the number of vertices in the graph, unless the 3SAT problem can be solved in subexponential time. In addition, we show that unless NP = P {\operatorname{NP}=\operatorname{P}} , a maximum induced matching in a hamiltonian bipartite graph cannot be approximated within a ratio of n 1 / 4 - ϵ {n^{1/4-\epsilon}} , where n is the number of vertices in the graph.

scholarly journals PARMENIDAS: TEISINGUMAS KAIP RAKTAS Į BŪTIES PRIGIMTĮ

Problemos ◽  
2008 ◽  
Vol 73 ◽  
pp. 131-154
Author(s):  
Skirmantas Jankauskas
Keyword(s):  
Fundamental Problem ◽  
Justice Theory ◽  
Western Tradition ◽  
Good Society ◽  
Logical Foundation ◽  
Ethical Content ◽  
The Republic ◽  
Night And Day ◽  
The Right ◽  
First Time

Straipsnyje aptariama filosofijai pamatinė būties problema. Tyrimo atspirties tašku pasirinkta Parmenido poema, kurioje bene pirmą kartą vakarietiškoje filosofavimo tradicijoje būtis ne tik paminima, bet ir pagrindžiama. Parodoma, kad logiškai patrauklūs poemos antrosios dalies svarstymai ne tik nepagrindžia būties aptikimo būdo, bet ir neteikia nuorodų jos turiniui apibrėžti. Papildomų užuominų aptiktoms problemoms spręsti ieškoma platoniškai interpretuojant paprastai ignoruojamą Parmenido poemos mįslingąją pradžią. Interpretuojant tą pradžią kaip būties atradimo kontekstą, joje minimas žirgų traukiamas vežimaitis susiejamas su Faidro dvikinke, o kelionė link Nakties ir Dienos vartų – su Puotos „teisinguoju keliu“. Tačiau pagrindinis dėmesys telkiamas mėginant paaiškinti parmenidiškąją nuorodą, kad vartus, atveriančius tiesioginę būties pažinimo prieigą, saugo Teisingumas. Daroma prielaida, kad Platonas pasinaudoja šia nuoroda konstruodamas teisingumo požiūriu tobulą polinę sąrangą. Faidre nenusisekus teoriškai temizuoti dorybę, Platonas pasmerkia teoriją įkūnijantį raštą dėl jo ribotumo asimiliuojant filosofui rūpimus etinius turinius, tačiau savo užmačios neatsisako. Tariama, kad Politejoje Platonas mėgina temizuoti dorybę susiedamas ją su teorijai tiesiogiai prieinamu teisingumu. Siekdamas persmelkti teisingumą dorybe, Platonas net priverstas doriškai tobulą filosofą padaryti valdovu. Ir nors Politejoje teoriškai temizuoti dorybės nepavyksta, tačiau tobulo teisingumo konstravimo veiksmas apnuogina būties prigimtį, t. y. jos sąlygotumą gėrio vertybe. Pagrindiniai žodžiai: būtis, dorybė, teisingumas, teorija, tiesa, grožis, gėris, sociumas.Parmenides: Justice as a Clue to the Nature of BeingSkirmantas Jankauskas SummaryThe paper deals with the fundamental problem of philosophy – the problem of being. The research begins with the analysis of the famous poem of Parmenides where, for the first time in the Western tradition of philosophy, the being, apart from being just mentioned, is also provided with a logical foundation. It is demonstrated here that the logically attractive considerations of the second part of the poem both fail to substantiate the discovery of the being and give no hints about its content. The way to deal with the above mentioned problems is found in the typically ignored beginning of the poem. Clues for the explication of the mysterious proem are sought in some Plato’s dialogues. The chariot drawn by steeds in Parmenides’ poem is associated with the representation of the soul as a charioteer driving two steeds in Plato’s Phaedrus, and the ride towards the gates of Night and Day is associated with the concept of the “right way” in Plato’s Symposium respectively. However, attention is focused on Parmenides’ reference that the gate dividing Night and Day is guarded by Justice. An assumption is made that Plato exploits this reference while constructing his ideally just state. Failing to theoretically thematize virtue in Phaedrus, Plato blames writing which incorporates theory for its inability to assimilate the ethical content, but refuses to abandon this undertaking. It is supposed that in The Republic Plato continues his effort of theoretical thematization of virtue by trying to relate the latter to justice which is directly accessible by theory. In striving to enable justice to embrace the content of virtue, Plato is even compelled to make a virtueincorporating philosopher preside over his ideal state. Nonetheless, Plato fails to reach his direct objective in The Republic. However, the action of constructing ideal justice quite unexpectedly reveals the origin of being, i.e. its subordination to the Good.Keywords: being, virtue, justice, theory, truth, the beautiful, the good, society.

scholarly journals Peningkatan Bodily Kinesthetic dan Intra Personal Skill melalui Pendekatan Saintifik pada Pembelajaran IPA

2018 ◽  
Vol 3 (1) ◽  
Author(s):  
Ngurah Ayu Nyoman Murniati ◽  
Arri Handayani ◽  
Mahmudah Mahmudah
Keyword(s):  
Formal Education ◽  
Fundamental Problem ◽  
Sampling Technique ◽  
Simple Random Sampling ◽  
Interpersonal Skill ◽  
Self Recognition ◽  
Significant Difference ◽  
Scientific Approach ◽  
Quasi Experimental ◽  
The Right

Understanding the potential of self is very necessary to be given in an effort to prepare a tough generation of 21 century who have adequate skills. The fundamental problem is the low ability of self-recognition of kinesthetic response and communication between person and person in his group. Marginal children as well as groups of children The changes and demands of school curricula are directed to the development of the 21st-century generation. The study of kinesthetic and interpersonal skill indicators as part of the development of basic skills is developed in both formal and non-formal education. This study aims to analyze the increase of bodily-kinesthetic and interpersonal skill in science learning in MTs through the application of the scientific approach. The design of this research is quasi-experiment (Quasi-Experimental Design) which form Posttest-Only Control Design. The population in this research is all students of class VIII MTs Negeri Mranggen. The sample consists of two classes taken with simple random sampling technique. There is a significant difference between bodily-kinesthetic and interpersonal skills that use learners' worksheets with the teaching materials used in the school. The difference is indicated by the average bodily-kinesthetic and interpersonal skill values between experiment classes that have a higher value than the control class. Data were analyzed by using the right side t-test. Based on the results of data analysis can be concluded that the application of the scientific approach has an effect on the increase of bodily-kinesthetic and interpersonal skill of MTs students.

Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting

2013 ◽  
Vol 22 (5) ◽  
pp. 783-799 ◽  
Author(s):  
GUILLEM PERARNAU ◽  
ORIOL SERRA
Keyword(s):  
Bipartite Graph ◽  
High Probability ◽  
Perfect Matching ◽  
Complete Bipartite Graph ◽  
Bipartite Graphs ◽  
Perfect Matchings ◽  
Asymptotic Enumeration ◽  
Complete Bipartite Graphs ◽  
Edge Colourings ◽  
Square Matrix

A perfect matchingMin an edge-coloured complete bipartite graphKn,nis rainbow if no pair of edges inMhave the same colour. We obtain asymptotic enumeration results for the number of rainbow perfect matchings in terms of the maximum number of occurrences of each colour. We also consider two natural models of random edge-colourings ofKn,nand show that if the number of colours is at leastn, then there is with high probability a rainbow perfect matching. This in particular shows that almost every square matrix of ordernin which every entry appearsntimes has a Latin transversal.

Finite locally-primitive complete bipartite graphs

2014 ◽  
Vol 17 (1) ◽  
Author(s):  
Wenwen Fan ◽  
Cai Heng Li ◽  
Jiangmin Pan
Keyword(s):  
Bipartite Graph ◽  
Complete Bipartite Graph ◽  
Bipartite Graphs ◽  
Complete Bipartite Graphs

Abstract.We characterize groups which act locally-primitively on a complete bipartite graph. The result particularly determines certain interesting factorizations of groups.

scholarly journals Longest cycles in certain bipartite graphs

1998 ◽  
Vol 21 (1) ◽  
pp. 103-106
Author(s):  
Pak-Ken Wong
Keyword(s):  
Bipartite Graph ◽  
Bipartite Graphs ◽  
Longest Cycles

LetGbe a connected bipartite graph with bipartition(X,Y)such that|X|≥|Y|(≥2),n=|X|andm=|Y|. Suppose, for all verticesx∈Xandy∈Y,dist(x,y)=3impliesd(x)+d(y)≥n+1. ThenGcontains a cycle of length2m. In particular, ifm=n, thenGis hamiltomian.

scholarly journals A Characterization for Sparse $\varepsilon$-Regular Pairs

10.37236/923 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
Stefanie Gerke ◽  
Angelika Steger
Keyword(s):  
Bipartite Graph ◽  
Regular Graph ◽  
Bipartite Graphs ◽  
Regularity Lemma ◽  
Sparse Graphs

We are interested in $(\varepsilon)$-regular bipartite graphs which are the central objects in the regularity lemma of Szemerédi for sparse graphs. A bipartite graph $G=(A\uplus B,E)$ with density $p={|E|}/({|A||B|})$ is $(\varepsilon)$-regular if for all sets $A'\subseteq A$ and $B'\subseteq B$ of size $|A'|\geq \varepsilon|A|$ and $|B'|\geq \varepsilon |B|$, it holds that $\left| {e_G(A',B')}/{(|A'||B'|)}- p\right| \leq \varepsilon p$. In this paper we prove a characterization for $(\varepsilon)$-regularity. That is, we give a set of properties that hold for each $(\varepsilon)$-regular graph, and conversely if the properties of this set hold for a bipartite graph, then the graph is $f(\varepsilon)$-regular for some appropriate function $f$ with $f(\varepsilon)\rightarrow 0$ as $\varepsilon\rightarrow 0$. The properties of this set concern degrees of vertices and common degrees of vertices with sets of size $\Theta(1/p)$ where $p$ is the density of the graph in question.

Sign in / Sign up

Export Citation Format

Share Document