.png?v=trim20261018)
1CONN Creative Reklam Ajansı
Sektörünüzle ilgili genel ve yerel bilgileri büyük bir titizlikle araştırıyor, sizin için gerçekleştireceğimiz çalışmalarımıza bu bilgiler ışığında yön veriyoruz. İlk düşündüğümüz; “Biz, bu markaya ne katabiliriz?”
Catégories de foncteurs en grassmanniennes et filtration de Krull
Soit F la catégories des foncteurs entre espaces vectoriels sur le corps à deux éléments. À l'aide des catégories de foncteurs en grassmanniennes, nous avons émis dans [Dja06a] une conjecture décrivant la filtration de Krull de la catégorie F. Nous démontrons une forme affaiblie de cette conjecture, avec comme application la détermination de la structure du produit tensoriel entre le foncteur projectif standard associé à un espace vectoriel de dimension 2 et un foncteur fini de F, dont on établit le caractère noethérien de type 2. Nous étudions également le morphisme induit par le foncteur d'intégrale en grassmanniennes entre anneaux de Grothendieck.
GKZ Hypergeometric Structures
This text is based on lectures by the author in the Summer School `Algebraic Geometry and Hypergeometric Functions' in Istanbul in June 2005. It gives a review of some of the basic aspects of the theory of hypergeometric structures of Gelfand, Kapranov and Zelevinsky, including Differential Equations, Integrals and Series, with emphasis on the latter. The Secondary Fan is constructed and subsequently used to describe the `geography' of the domains of convergence of the Γ-series. A solution to certain Resonance Problems is presented and applied in the context of Mirror Symmetry. Many examples and some exercises are given throughout the paper.
Utilisation de la notion de copule en tomographie
Un problème important en statistique est la détermination d'une loi de probabilité jointe à partir de ses lois marginales. Dans le cas bidimensionnel, les lois de probabilité marginales f1 (x) et f2(y) sont reliées à la loi jointe f(x,y) par les intégrales suivant les lignes horizontale et verticale (les deux axes x et y). Ainsi, le problème de la détermination de f(x,y) connaissant f1 (x) et f2(y) est un problème inverse mal posé. En statistique la notion de copule est introduite pour obtenir une solution à ce problème. Un problème similaire en tomographie à rayon X est la reconstruction d'une image f(x,y) représentant la répartition de la densité d'une quantité à l'intérieur de l'objet à partir de ses deux projections horizontale et verticale, f1 (x) et f2(y). Il existe aussi un grand nombre de méthodes pour de tels problèmes fondées sur la transformée de Radon. Dans cet article, nous montrons les liens entre la notion de copule et celle de la tomographie à rayon X et voyons si on peut utiliser les méthodes d'un domaine à l'autre.
Look ATME: The Discriminator Mean Entropy Needs Attention
Generative adversarial networks (GANs) are successfully used for image synthesis but are known to face instability during training. In contrast, probabilistic diffusion models (DMs) are stable and generate high-quality images, at the cost of an expensive sampling procedure. In this paper, we introduce a simple method to allow GANs to stably converge to their theoretical optimum, while bringing in the denoising machinery from DMs. These models are combined into a simpler model (ATME) that only requires a forward pass during inference, making predictions cheaper and more accurate than DMs and popular GANs. ATME breaks an information asymmetry existing in most GAN models in which the discriminator has spatial knowledge of where the generator is failing. To restore the information symmetry, the generator is endowed with knowledge of the entropic state of the discriminator, which is leveraged to allow the adversarial game to converge towards equilibrium. We demonstrate the power of our method in several image-to-image translation tasks, showing superior performance than state-of-the-art methods at a lesser cost. Code is available at https://github.com/DLR-MI/atme
Agujeros de Gusano en Gravedad (2+1)
Traversable wormholes are objects that present a lot of interest in the last years because of their geometric features and their relation with exotic matter. In this paper we presnt a review of the principal characteristics of traversable Morris-Thorne wormholes, their construction proccess and some aspects about the exotic matter that is needed in order to mantain them. Then, we use a junction proccess to obatin two specific wormhole solutions in the (2+1) gravity formalism with negative cosmological constant. The obtained solutions represent wormholes with an external spacetime correspondient to the BTZ black hole solution. We also show that exotic matter is needed to mantain these wormholes. ----- Los agujeros de gusano atravesables son objetos que presentan un gran interes en la actualidad debido a sus caracteristicas geometricas y a su relacion con la materia exotica. En el presente trabajo se muestra una revision de las caracteristicas de los agujeros de gusano atravesables al estilo de Morris y Thorne, al igual que el proceso de construccion y aspectos de la materia exotica necesaria para mantenerlos. Luego, se utiliza un proceso de juntura para construir dos soluciones …
Data-centric AI approach to improve optic nerve head segmentation and localization in OCT en face images
The automatic detection and localization of anatomical features in retinal imaging data are relevant for many aspects. In this work, we follow a data-centric approach to optimize classifier training for optic nerve head detection and localization in optical coherence tomography en face images of the retina. We examine the effect of domain knowledge driven spatial complexity reduction on the resulting optic nerve head segmentation and localization performance. We present a machine learning approach for segmenting optic nerve head in 2D en face projections of 3D widefield swept source optical coherence tomography scans that enables the automated assessment of large amounts of data. Evaluation on manually annotated 2D en face images of the retina demonstrates that training of a standard U-Net can yield improved optic nerve head segmentation and localization performance when the underlying pixel-level binary classification task is spatially relaxed through domain knowledge.
The OSU Scheme for Congestion Avoidance in ATM networks Using Explicit Rate Indication
An explicit rate indication scheme for congestion avoidance in computer and telecommunication networks is proposed. The sources monitor their load and provide the information periodically to the switches. The switches, in turn, compute the load level and ask the sources to adjust their rates up or down. The scheme achieves high link utilization, fair allocation of rates among contending sources and provides quick convergence. A backward congestion notification option is also provided. The conditions under which this option is useful are indicated.
Techniques d'anonymisation tabulaire : concepts et mise en oeuvre
In this document, we present a state of the art of anonymization techniques for classical tabular datasets. This article is geared towards a general public having some knowledge of mathematics and computer science, but with no need for specific knowledge in anonymization. The objective of this document it to explain anonymization concepts in order to be able to sanitize a dataset and compute reindentification risk. The document contains a large number of examples to help understand the calculations. ----- Dans ce document, nous présentons l'état de l'art des techniques d'anonymisation pour des bases de données classiques (i.e. des tables), à destination d'un public technique ayant une formation universitaire de base en mathématiques et informatique, mais non spécialiste. L'objectif de ce document est d'expliquer les concepts permettant de réaliser une anonymisation de données tabulaires, et de calculer les risques de réidentification. Le document est largement composé d'exemples permettant au lecteur de comprendre comment mettre en oeuvre les calculs.
Computational Model for Photoionization in Pure SF6 Streamer at 1-15 atm
Photoionization plays a crucial role in achieving accurate quantitative predictions in SF6 streamer simulations, but accurate models for SF6 photoionization remains limited, motivating this paper. First, we develop a computational model for SF6 photoionization and provide the detailed theoretical modeling process, as well as comparison between experiment and simulation. A concise summary of model parameters within the comprehensive pressure range of 1 - 15 atm is provided for direct reference. Then, we perform comparative studies against simplified approaches. The results demonstrate that the proposed model effectively captures the non-local effects of SF6 photoionization, enhancing both the spatial numerical convergence and the accuracy of the streamer structure. Finally, we perform comparative studies by artificially increasing the photoionization intensity through multiplying the photoionization source term Sph by a factor of 50 (50*Sph) relative to the baseline intensity. Regarding breakdown voltage prediction, 50*Sph leads to a significant underestimation of the breakdown voltage for positive streamers, introducing errors greater than 0.5 kV, while exerting a small impact on …
Isomorphismes de graphes en temps quasi-polynomial (d'après Babai et Luks, Weisfeiler-Leman...)
Soient donnés deux graphes $Γ_1$, $Γ_2$ à $n$ sommets. Sont-ils isomorphes? S'ils le sont, l'ensemble des isomorphismes de $Γ_1$ à $Γ_2$ peut être identifié avec une classe $H π$ du groupe symétrique sur $n$ éléments. Comment trouver $π$ et des générateurs de $H$? Le défi de donner un algorithme toujours efficace en réponse à ces questions est resté longtemps ouvert. Babai a récemment montré comment résoudre ces questions -- et d'autres qui y sont liées -- en temps quasi-polynomial, c'est-à-dire en temps $\exp(O(\log n)^{O(1)})$. Sa stratégie est basée en partie sur l'algorithme de Luks (1980/82), qui a résolu le cas de graphes de degré borné. English translation: Graph isomorphisms in quasipolynomial time [after Babai and Luks, Weisfeiler--Leman,...]. Let $Γ_1$, $Γ_2$ be two graphs with $n$ vertices. Are they isomorphic? If any isomorphisms from $Γ_1$ to $Γ_2$ exist, they form a coset $H π$ in the symmetric group on $n$ elements. How can we find a representative $π$ and a set of generators for $H$? Finding an algorithm that answers such questions efficiently (in all cases) is a challenge that has long remained open. Babai has recently shown how to solve these problems and related …
1Klinik CMS Web Yönetim Sistemi
Yeni Nesil Klinik Deneyimi. Bilim, teknoloji ve estetiği modern hasta deneyimiyle bir araya getiriyoruz. Dijital planlama, kişiye özel tedavi yaklaşımı ve güçlü hasta iletişimi.
Dentastik Klinik Yönetimi
Kliniğinizin tüm dünyası Tek bir akış. İlk temastan son kontrole. Satıştan tedaviye. Birbirine bağlı her an, tek ekosistemde.
