نتایج جستجو برای: von mise graphs

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

2008
Thomas Würthinger Christian Wimmer Hanspeter Mössenböck

The Java HotSpotTM server compiler of Sun Microsystems uses intermediate graph data structures when compiling Java bytecodes to machine code. The graphs are program dependence graphs, which model both data and control dependencies. For debugging, there are built-in tracing mechanisms that output a textual representation of the graphs to the command line. This thesis presents a tool which displa...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده ادبیات و زبانهای خارجی 1394

diese wissenschaftliche arbeit, die als magisterarbeit für das studienfach „didaktik der deutschen sprache“ geschrieben wurde, befasst sich mit der novelle „der tod in venedig“ von dem berühmten deutschen schriftsteller „thomas mann“. nach kurzer vorstellung der biografie von thomas mann und der zusammenfassung und der interpretation der novelle wurde zun?chst kurze die ubersetzungstheorie und...

Journal: :Journal of Algebraic Combinatorics 2022

A graph is called odd if there an orientation of its edges and automorphism that reverses the sense number edges, even otherwise. Pontus von Br\"omssen (n\'e Andersson) showed existence such independent orientation, considered question counting pairwise non-isomorphic graphs. Based on computational evidence, he made rather surprising conjecture graphs $n$ vertices equal to tournaments vertices....

Journal: :iranian journal of mathematical chemistry 2012
h. r. mostafaei a. zaeembashi m. ostad rahimi

a graph that contains a hamiltonian cycle is called a hamiltonian graph. in this paper wecompute the first and the second geometric – arithmetic indices of hamiltonian graphs. thenwe apply our results to obtain some bounds for fullerene.

Journal: :iranian journal of mathematical chemistry 0
b basavanagoud karnatak university dharwad s. patil karnatak university v r desai karnatak university m tavakoli ferdowsi university of mashhad a r ashrafi university of kashan

a connected graph g is said to be neighbourly irregular graph if no two adjacent vertices of g have same degree. in this paper we obtain neighbourly irregular derived graphs such as semitotal-point graph, k^{tℎ} semitotal-point graph, semitotal-line graph, paraline graph, quasi-total graph and quasivertex-total graph and also neighbourly irregular of some graph products.

Journal: :SIAM Journal on Discrete Mathematics 2020

2007
Ali Saif M. Hassan Pramod Joag

In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of pure and mixed states, Von-Neumann entropy, separability of multipartite quantum states and quantum operations in terms of the graphs associated with quantum s...

2013
Christophe Chesneau

We investigate the estimation of a multiplicative separable regression function from a bi-dimensional nonparametric regression model with random design. We present a general estimator for this problem and study its mean integrated squared error (MISE) properties. A wavelet version of this estimator is developed. In some situations, we prove that it attains the standard unidimensional rate of co...

2017
José Joaquín Mira Irene Carrillo Mercedes Guilabert Susana Lorenzo Pastora Pérez-Pérez Carmen Silvestre Lena Ferrús

BACKGROUND Adverse events (incidents that harm a patient) can also produce emotional hardship for the professionals involved (second victims). Although a few international pioneering programs exist that aim to facilitate the recovery of the second victim, there are no known initiatives that aim to raise awareness in the professional community about this issue and prevent the situation from wors...

2000
Frédéric Andrès Nicolas Dessaigne José M. Martínez Noureddine Mouaddib Kinji Ono Douglas C. Schmidt Panrit Tosukhowong

Multimedia searching over Internet has gained substantial popularity in the past two years. Java's networking features, along with the growing number of Web browsers that can execute Java applets, facilitate distributed processing. Networking and computational performances are key concerns when considering the use of Java to develop performance-sensitive distributed multimedia search engines. T...

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

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