.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?”
Evolution of Supermassive Black Hole Pairs on Inclined Orbits in Post-Merger Galaxies
Theoretical models of the evolution of supermassive black hole (SMBH) pairs in post-merger remnant galaxies are necessary to motivate observational searches for dual active galactic nuclei (AGN) and gravitational wave sources. Studies have explored the dynamical evolution of SMBH pairs under the influence of dynamical friction to calculate pairing times and predict the expected population of dual-AGNs at various redshifts. We formulate a three-dimensional dynamical model of SMBH pairs in the innermost kiloparsec of a post-merger galaxy to investigate the impact of orbital inclination with respect to the galactic disk on pairing times. The SMBH pairs are evolved in 81 different galaxy configurations initialized using a Gauss-Seidel Poisson solver. The dynamics are calculated for 12 distinct initial inclinations ranging from 0 to 75 degrees in each of the galaxies to gauge the impact of inclination on pairing time. Orbits characterized by initial inclinations greater than 20 degrees frequently require longer pairing times when compared to uninclined orbits. Pairing times for orbits with inclinations $\gtrsim 45$ degrees often exceed 14 Gyr. Galaxies with higher mass SMBH pairs and …
Monte Carlo Study of the Phase Transition of the $XY$ Model on a Diamond Lattice
We study the phase transition of the classical $XY$ model on a diamond lattice by Monte Carlo simulations using the Wolff cluster algorithm. Finite-size scaling (FSS) analysis of the Binder cumulant and the second-moment correlation length ratio $ξ_{2\rm nd}/L$ yields $T_c = 1.30036(1)$ and $ν= 0.671(6)$. Data collapse of both quantities confirms the three-dimensional $XY$ universality class.
Polyhedral-based Methods for Mixed-Integer SOCP in Tree Breeding
Optimal contribution selection (OCS) is a mathematical optimization problem that aims to maximize the total benefit from selecting a group of individuals under a constraint on genetic diversity. We are specifically focused on OCS as applied to forest tree breeding, when selected individuals will contribute equally to the gene pool. Since the diversity constraint in OCS can be described with a second-order cone, equal deployment in OCS can be mathematically modeled as mixed-integer second-order cone programming (MI-SOCP). If we apply a general solver for MI-SOCP, non-linearity embedded in OCS requires a heavy computation cost. To address this problem, we propose an implementation of lifted polyhedral programming (LPP) relaxation and a cone-decomposition method (CDM) to generate effective linear approximations for OCS. In particular, CDM successively solves OCS problems much faster than generic approaches for MI-SOCP. The approach of CDM is not limited to OCS, so that we can also apply the approach to other MI-SOCP problems.
A Taxonomy of Performance Prediction Systems in the Parallel and Distributed Computing Grids
As Grids are loosely-coupled congregations of geographically distributed heterogeneous resources, the efficient utilization of the resources requires the support of a sound Performance Prediction System (PPS). The performance prediction of grid resources is helpful for both Resource Management Systems and grid users to make optimized resource usage decisions. There have been many PPS projects that span over several grid resources in several dimensions. In this paper the taxonomy for describing the PPS architecture is discussed. The taxonomy is used to categorize and identify approaches which are followed in the implementation of the existing PPSs for Grids. The taxonomy and the survey results are used to identify approaches and issues that have not been fully explored in research.
Long Term Motion Prediction Using Keyposes
Long term human motion prediction is essential in safety-critical applications such as human-robot interaction and autonomous driving. In this paper we show that to achieve long term forecasting, predicting human pose at every time instant is unnecessary. Instead, it is more effective to predict a few keyposes and approximate intermediate ones by interpolating the keyposes. We demonstrate that our approach enables us to predict realistic motions for up to 5 seconds in the future, which is far longer than the typical 1 second encountered in the literature. Furthermore, because we model future keyposes probabilistically, we can generate multiple plausible future motions by sampling at inference time. Over this extended time period, our predictions are more realistic, more diverse and better preserve the motion dynamics than those state-of-the-art methods yield.
ProDiGy: Proximity- and Dissimilarity-Based Byzantine-Robust Federated Learning
Federated Learning (FL) emerged as a widely studied paradigm for distributed learning. Despite its many advantages, FL remains vulnerable to adversarial attacks, especially under data heterogeneity. We propose a new Byzantine-robust FL algorithm called ProDiGy. The key novelty lies in evaluating the client gradients using a joint dual scoring system based on the gradients' proximity and dissimilarity. We demonstrate through extensive numerical experiments that ProDiGy outperforms existing defenses in various scenarios. In particular, when the clients' data do not follow an IID distribution, while other defense mechanisms fail, ProDiGy maintains strong defense capabilities and model accuracy. These findings highlight the effectiveness of a dual perspective approach that promotes natural similarity among honest clients while detecting suspicious uniformity as a potential indicator of an attack.
Continuous crossover between high-pressure ice phases VII and X driven by monopole screening: a model study
The proton-disordered molecular phase of water ice (ice-VII) and its ultrahigh-pressure non-molecular phase (ice-X) share identical macroscopic crystal symmetry (space group $Pn\bar{3}m$). This raises a fundamental thermodynamic question: are they distinct phases separated by a singularity, or are they adiabatically connected via a continuous crossover? To resolve this paradox, we investigate the finite-temperature phase diagram of high-pressure ices VII and X, as well as VIII, the proton-ordered phase that emerges at lower temperatures, using an effective classical spin-$1$ Blume-Capel model on the pyrochlore lattice. Through Monte Carlo simulations, we demonstrate that within this model, the transformation between the states corresponding to ice-VII and ice-X lacks a thermodynamic singularity, as characterized by non-divergent and non-coinciding peaks in the specific heat and susceptibility associated with the $S^z=0$ occupation. We attribute this continuous crossover behavior to the topological fragility of the hydrogen-bond network: the thermal proliferation of point-like monopole excitations (violations of the ice rules) induces Debye-Hückel screening of the emergent gauge …
SCN as a Local Probe of Protein Structural Dynamics
The dynamics of lysozyme is probed by attaching -SCN to all alanine-residues. The 1-dimensional infrared spectra exhibit frequency shifts in the position of the maximum absorption by 4 cm$^{-1}$ which is consistent with experiments in different solvents and indicates moderately strong interactions of the vibrational probe with its environment. Isotopic substitution $^{12}$C $\rightarrow ^{13}$C leads to a red-shift by $-47$ cm$^{-1}$ which is consistent with experiments with results on CN-substituted copper complexes in solution. The low-frequency, far-infrared part of the protein spectra contain label-specific information in the difference spectra when compared with the wild type protein. Depending on the positioning of the labels, local structural changes are observed. For example, introducing the -SCN label at Ala129 leads to breaking of the $α-$helical structure with concomitant change in the far-infrared spectrum. Finally, changes in the local hydration of SCN-labelled Alanine residues as a function of time can be related to angular reorientation of the label. It is concluded that -SCN is potentially useful for probing protein dynamics, both in the high-frequency (CN-stretch) …
From Accuracy to Visual Dependence: Auditing and Filtering Modality Collapse in Traffic VideoQA
High benchmark accuracy does not guarantee genuine use of visual evidence. We study this problem in traffic accident Video Question Answering (VideoQA), where correct answers should depend on scene-specific visual evidence but may instead be inferred from textual shortcuts. Through an audit of four public benchmarks, we find that several recent open-weight Vision-Language Models (VLMs) perform competitively, and sometimes better, without video input. On the MM-AU benchmark, removing video consistently improves accuracy, and adding more frames further degrades performance. To quantify visual dependence, we introduce two dataset-level diagnostics: Blind Gap, measuring above-chance text-only performance, and Visual Gain, measuring the marginal benefit of adding video. We further propose an instance-level Shortcut Score that combines text-only confidence with visual necessity signals, enabling continuous, training-free filtering of shortcut-prone questions. The resulting subsets reduce shortcut bias and improve visual grounding. Our findings reveal large differences in grounding quality across benchmarks and show that visually grounded evaluation, not just high accuracy, is essential …
Conic relaxation approaches for equal deployment problems
An important problem in the breeding of livestock, crops, and forest trees is the optimum of selection of genotypes that maximizes genetic gain. The key constraint in the optimal selection is a convex quadratic constraint that ensures genetic diversity, therefore, the optimal selection can be cast as a second-order cone programming (SOCP) problem. Yamashita et al. (2015) exploits the structural sparsity of the quadratic constraints and reduces the computation time drastically while attaining the same optimal solution. This paper is concerned with the special case of equal deployment (ED), in which we solve the optimal selection problem with the constraint that contribution of genotypes must either be a fixed size or zero. This involves a nature of combinatorial optimization, and the ED problem can be described as a mixed-integer SOCP problem. In this paper, we discuss conic relaxation approaches for the ED problem based on LP (linear programming), SOCP, and SDP (semidefinite programming). We analyze theoretical bounds derivedfrom the SDP relaxation approaches using the work of Tseng (2003) and show that the theoretical bounds are not quite sharp for tree breeding problems. We …
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.
