نتایج جستجو برای: shadow graph

تعداد نتایج: 211073  

Shadow Banking system, as an investment method, while being an integral part of the supervised banking system, is a rival for banks and governance institutions in financing and oversight. As a result, its development has created a situation for regulated institutions, which leads to concerns about the legal and regulatory responsibilities of the banking and financial system for investment not g...

Journal: :iranian economic review 0
seyyedeh sara mirhosseini department of industrial engineering, university of science and arts, yazd, iran ([email protected]). naman mahmoudi department of industrial engineering, university of sistan and baluchestan, zahedan, iran (corresponding author: [email protected]). seyyedeh negar pourali valokolaie department of industrial engineering, university of science and arts, yazd, iran ([email protected]).

i n the past decades, the effect of different tax amendments on various economic issues has been studied. the majority of these studies have avoided considering shadow economy as part of the calculation and analysis, and an issue, which has received little attention, is the relationship between green tax reforms and shadow economy, as for informal labor, which is well-connected to unemployment ...

2012
Michael Schwärzler Oliver Mattausch Daniel Scherzer Michael Wimmer

Physically accurate soft shadows in 3D applications can be simulated by taking multiple samples from all over the area light source and accumulating them. Due to the unpredictability of the size of the penumbra regions, the required sampling density has to be high in order to guarantee smooth shadow transitions in all cases. Hence, several hundreds of shadow maps have to be evaluated in any sce...

2011
James C. Wyant

Bubbles, seeds, stones, and striae can be detected by illuminating the sample with a bright light and observing the scattered light. The use of a shadow graph or Foucault knife-edge (Schlieren) is very useful in detecting internal defects. In the Schlieren test, shown in Fig. 2-1, the irregularities become visible since they deviate light past the stop. If the surfaces are not polished, they ma...

Journal: :Combinatorics, Probability & Computing 2011
András Gyárfás Gábor N. Sárközy

The asymptotics of 2-colour Ramsey numbers of loose and tight cycles in 3-uniform hypergraphs were recently determined [16, 17]. We address the same problem for Berge cycles and for 3 colours. Our main result is that the 3-colour Ramsey number of a 3-uniform Berge cycle of length n is asymptotic to 5n 4 . The result is proved with the Regularity Lemma via the existence of a monochromatic connec...

ژورنال: مطالعات عرفانی 2014

As sight of Carl Gustav Jung, humans thereto having individual unconsciousness, have other common site which is called meta-individual or communal unconscious. Consist of this mentality is archetype of shadow one of the closest face to individual unconscious and awareness too. Archetype of shadow is negative, non-human, instinctive and human being’s, which mankind attempt to conceal is. This e...

2011
Ehab Essa Xianghua Xie Igor Sazonov Perumal Nithiarasu Dave Smith

We present a fully automatic segmentation method to extract media-adventitia border in IVUS images with shape prior information. Segmentation of IVUS has shown to be an intricate process due to relatively low contrast and various forms of interferences and artefacts caused by, for instance, calcification and acoustic shadow. We incorporate shape prior with an automatic graph cut technique to pr...

Journal: :IEEE Transactions on Computational Social Systems 2023

Graph neural network (GNN) has achieved great success on graph representation learning. Challenged by large-scale private data collected from user side, GNN may not be able to reflect the excellent performance, without rich features and complete adjacent relationships. Addressing problem, vertical federated learning (VFL) is proposed implement local protection through training a global model co...

2009
FRANCESCO COSTANTINO

We show that Kauffman brackets of colored framed graphs (also known as quantum spin networks) can be renormalized to a Laurent polynomial with integer coefficients by multiplying it by a coefficient which is a product of quantum factorials depending only on the abstract combinatorial structure of the graph. Then we compare the shadow-state sums and the state-sums based on R-matrices and Clebsch...

2007
András Gyárfás Gábor N. Sárközy

The asymptotics of 2-color Ramsey numbers of loose and tight cycles in 3-uniform hypergraphs have been recently determined ([16], [17]). We address here the same problem for Berge-cycles and for 3 colors. Our main result is that the 3-color Ramsey number of a 3-uniform Berge cycle of length n is asymptotic to 5n 4 . The result is proved with the Regularity Lemma via the existence of a monochrom...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید