La théorie des réseaux de Petri est née de la thèse de Carl Adam Petri [PE 62]. Mais, bien d’autres chercheurs ont contribué à ce qui est devenu “les réseaux de Petri”. Certains sont explicitement partis des travaux de Carl Adam Petri, les ont légèrement modifiés et ont développé les notions que ce dernier avait introduites. D’autres ont menés indépendamment des travaux sur la représentation et...

Résumé : Dans une ontologie de domaine, une association sémantique entre deux entités (concepts, attributs d’un concept) est une représentation d’un chemin ou d’un lien sémantique (LS) indirect entre elles. Un défi prometteur pour le Web sémantique est de développer des méthodes pour découvrir des données fortement liées dans un nombre important d’associations sémantiques rassemblées à partir d...

Transportation cost metrics, also known as the Wasserstein distances Wp, are a natural choice for defining distances between two pointsets, or distributions, and have been applied in numerous fields. From the computational perspective, there has been an intensive research effort for understanding the Wp metrics over R, with work on the W1 metric (a.k.a earth mover distance) being most successfu...

Photoionization of the Ce Ce process has been studied using the random phase approximation with exchange method in the energy region 100-150 eV. Comparison of our results with the recent measurement [Müller et al, Phys. Rev. Lett. 101, 133001 (2008)] confirms the suppression effect of the carbon cage in the endohedral fullerene Ce@C+82 photoionization. The reasons for the cause of the confineme...

Delsarte showed that for any projective linear code over a finite field GF (p) with two nonzero Hamming weights w1 < w2 there exist positive integers u and s such that w1 = p u and w2 = p (u + 1). Moreover, he showed that the additive group of such a code has a strongly regular Cayley graph. Here we show that for any proper, regular, projective linear code C over a finite Frobenius ring with tw...

Résumé— Une phase primordiale lors de la modélisation d’un système à l’aide d’un perceptron multicouches reste la détermination de la structure du réseau. Dans ce cadre, nous proposons un algorithme d’élagage du réseau basé sur l’utilisation de l’analyse de la variance de la sensibilité de tous les paramètres du réseau. Cet algorithme sera testé sur deux exemples de simulation et ses performanc...

A computational model of the construction of word meaning through exposure to texts is built in order to simulate the effects of co-occurrence values on word semantic similarities, paragraph by paragraph. Semantic similarity is here viewed as association. It turns out that the similarity between two words W1 and W2 strongly increases with a co-occurrence, decreases with the occurrence of W1 wit...

Example. Every non-zero element of ⋀ V is trivially totally decomposable. Example. If dimV = 3, then every non-zero element of ⋀ V is totally decomposable. Proof. Given a sum v1 ∧v2 +v3 ∧v4 of two non-zero elements of ⋀ V , the two-dimensional subspaces Span(v1, v2) and Span(v3, v4) must intersect. If w1 is in the intersection, then we can rewrite v1∧v2 = w1 ∧w2 for some w1 ∈ Span(v1, v2). Simi...

A computational model of the construction of word meaning through exposure to texts is built in order to simulate the effects of co-occurrence values on word semantic similarities, paragraph by paragraph. Semantic similarity is here viewed as association. It turns out that the similarity between two words W1 and W2 strongly increases with a co-occurrence, decreases with the occurrence of W1 wit...

Two words w1 and w2 are said to be k-binomial equivalent if every non-empty word x of length at most k over the alphabet of w1 and w2 appears as a scattered factor of w1 exactly as many times as it appears as a scattered factor of w2. We give two different polynomial-time algorithms testing the k-binomial equivalence of two words. The first one is deterministic (but the degree of the correspond...