209 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Universidade Federal de PernambucoBR21 papers
- Universidade Federal de Santa MariaBR16 papers
- University of Maryland, College ParkUS9 papers
- University of CalgaryCA8 papers
- University of California San DiegoUS7 papers
- Brookhaven National LaboratoryUS6 papers
- Kent State UniversityUS6 papers
- Laboratoire d'Informatique en Images et Systèmes d'InformationFR6 papers
- University of MinnesotaUS6 papers
- Institut National des Sciences Appliquées de LyonFR5 papers
- Pennsylvania State UniversityUS5 papers
- Russian Academy of SciencesRU5 papers
15 papers · 1 filter
The largest character degrees of the symmetric and alternating groups
Zoltán Halasi, Carolin Hannusch, Hung Ngoc Nguyen
We show that the largest character degree of an alternating group with can be bounded in terms of smaller degrees in the sense that \[ b(A_n)^2<\sum_{ψ\in\textrm{Ir…
Numerical analysis of the vertex models for simulating grain boundary networks
Claudio Torres, Maria Emelianenko, Dmitry Golovaty +2
Polycrystalline materials undergoing coarsening can be represented as evolving networks of grain boundaries, whose statistical characteristics determine macroscopic materials prope…
Transparent boundary conditions in a Discontinuous Galerkin Trefftz method
Herbert Egger, Fritz Kretzschmar, Sascha M. Schnepp +2
The modeling and simulation of electromagnetic wave propagation is often accompanied by a restriction to bounded domains which requires the introduction of artificial boundaries. T…
The fate of quasiparticles in the superconducting state
S. V. Dordevic, D. van der Marel, C. C. Homes
Quasiparticle properties in the superconducting state are masked by the superfluid and are not directly accessible to infrared spectroscopy. We show how one can use a Kramers--Kron…
Spatial Sensing and Cognitive Radio Communication in the Presence of A -User Interference Primary Network
Ardalan Alizadeh, Hamid Reza Bahrami, Mehdi Maleki +1
We study the feasibility of cognitive radio (CR) communication in the presence of a -user multi-input multi-output (MIMO) interference channel as the primary network. Assuming t…
Transitions of tethered chain molecules under tension
Jutta Luettmer-Strathmann, Kurt Binder
An applied tension force changes the equilibrium conformations of a polymer chain tethered to a planar substrate and thus affects the adsorption transition as well as the coil-glob…
Existence and stability of superconducting solutions for the Ginzburg-Landau equations in the presence of weak electric currents
Yaniv Almog, Leonid Berlyand, Dmitry Golovaty +1
For a reduced Ginzburg-Landau model in which the magnetic field is neglected, we prove, for weak electric currents, the existence of a steady-state solution in a vicinity of the pu…
Efficient Generation of Model Bulk Heterojunction Morphologies for Organic Photovoltaic Device Modeling
Michael C. Heiber, Ali Dhinojwala
Kinetic Monte Carlo (KMC) simulations have been previously used to model and understand a wide range of behaviors in bulk heterojunction (BHJ) organic photovoltaic devices, from fu…
A "Trefftz Machine" for Absorbing Boundary Conditions
Igor Tsukerman
The paper presents an automatic generator of approximate nonreflecting boundary conditions, analytical and numerical, for scalar wave equations. This generator has two main ingredi…
Multiplierless Approximate 4-point DCT VLSI Architectures for Transform Block Coding
F. M. Bayer, R. J. Cintra, A. Madanayake +1
Two multiplierless algorithms are proposed for 4x4 approximate-DCT for transform coding in digital video. Computational architectures for 1-D/2-D realisations are implemented using…
tinyNBI: Distilling an API from essential OpenFlow abstractions
C. Jasson Casey, Andrew Sutton, Alex Sprintson
If simplicity is a key strategy for success as a network protocol OpenFlow is not winning. At its core OpenFlow presents a simple idea, which is a network switch data plane abstrac…
A DCT Approximation for Image Compression
R. J. Cintra, F. M. Bayer
An orthogonal approximation for the 8-point discrete cosine transform (DCT) is introduced. The proposed transformation matrix contains only zeros and ones; multiplications and bit-…
A Multiplierless Pruned DCT-like Transformation for Image and Video Compression that Requires 10 Additions Only
V. A. Coutinho, R. J. Cintra, F. M. Bayer +2
A multiplierless pruned approximate 8-point discrete cosine transform (DCT) requiring only 10 additions is introduced. The proposed algorithm was assessed in image and video compre…
On a conjecture of Gluck
James P. Cossey, Zoltán Halasi, Attila Maróti +1
Let and respectively denote the Fitting subgroup and the largest degree of an irreducible complex character of a finite group . A well-known conjecture of D. Gluck…
Discovering Compressing Serial Episodes from Event Sequences
A. Ibrahim, Shivakumar Sastry, P. S. Sastry
Most pattern mining methods output a very large number of frequent patterns and isolating a small but relevant subset is a challenging problem of current interest in frequent patte…