SearcharxivSearch

arXiv subjects

Ali Jafari

Publications and source records attributed to Ali Jafari.

6 recordsLinked to original sources

Passive acoustic logic via topology-optimized waveguides

Growing energy demands of modern digital devices necessitate alternative, low-power computing mechanisms. When incident loads take the form of acoustic or vibrational waves, the ability to mechanically process information eliminates the need for transduction, paving the way for passive computing. Recent studies have proposed systems that learn and execute mechanical logic through buckling, bistability, and origami-inspired lattices. However, owing to the large timescales of shape morphing, such concepts suffer from slow operation or require active stimulation of adaptive materials. To address these limitations, we present a novel approach to mechanical logic, leveraging the rich dynamics of wave propagation in elastic structures. In lieu of traditional forward-design tools, such as band diagrams and transmission spectra, we employ a multi-faceted topology optimization approach, enabling us to identify candidate waveguide configurations within an extremely large design space. By incorporating voids within an otherwise uniform substrate, the optimized waveguides are able to precisely manipulate wave propagation paths, triggering desirable interferences of the scattered wavefield that culminate in energy localization at readouts corresponding to a given logic function. An experimental setup is used to demonstrate the efficacy of such logic gates and their resilience to non-uniform loading. By implementing these building blocks into a mechanical adder, we demonstrate the scalable deployment of more sophisticated mechanical computing circuits, opening up new avenues in mechanical signal processing and physical computing.

physics.app-ph

Metamaterial-Inspired Bi-resonators Vibration Absorbers for Railway Tracks: Experimental Study of Flexural Wave Control

Subway rail vibrations are a major source of structural deterioration, environmental noise, and passenger discomfort in urban railway systems. Here, we present a broadband design methodology for railway tuned mass dampers (TMDs) based on the concept of joining multiple locally resonant bandgaps. The proposed framework begins with an experimental modal analysis of a UIC60/60E1 rail to identify its dominant vibration modes and develop an equivalent dynamic model. Guided by the proposed bandgap-joining strategy, single- and multi-resonator TMDs are subsequently designed, fabricated, and experimentally validated before being implemented on the railway track. The experimental investigation demonstrates that the tuned single-resonator configuration reduces the vibration amplitudes at the dominant resonances by up to 74\%, while incorporating a second resonator further broadens the effective attenuation bandwidth, confirming the advantages of the proposed multi-resonator concept. Finally, a random vibration analysis is performed to evaluate the effectiveness of the designed TMDs under stochastic excitations representative of practical railway operating conditions, predicting an average reduction of approximately 12\% in the RMS vibration response. The proposed methodology provides a practical framework for translating locally resonant metamaterial concepts into compact, manufacturable, and non-invasive railway vibration absorbers with enhanced broadband vibration mitigation capabilities.

physics.app-ph

Social Recommendation through Heterogeneous Graph Modeling of the Long-term and Short-term Preference Defined by Dynamic Time Spans

Social recommendations have been widely adopted in substantial domains. Recently, graph neural networks (GNN) have been employed in recommender systems due to their success in graph representation learning. However, dealing with the dynamic property of social network data is a challenge. This research presents a novel method that provides social recommendations by incorporating the dynamic property of social network data in a heterogeneous graph. The model aims to capture user preference over time without going through the complexities of a dynamic graph by adding period nodes to define users' long-term and short-term preferences and aggregating assigned edge weights. The model is applied to real-world data to argue its superior performance. Promising results demonstrate the effectiveness of this model.

cs.SI

On groups with the same character degrees as almost simple groups with socle sporadic simple groups

Let G be a finite group and cd(G) denote the set of complex irreducible character degrees of G. In this paper, we prove that if G is a finite group and H is an almost simple group whose socle is a sporadic simple group H0 such that cd(G) = cd(H), then G' = H0 and there exists an abelian subgroup A of G such that G/A is isomorphic to H. In view of Huppert's conjecture (2000), we also provide some examples to show that G is not necessarily a direct product of A and H, and hence we cannot extend this conjecture to almost simple groups.

math.GR

On groups with the same character degrees as almost simple groups with socle the Mathieu groups

Let $G$ be a finite group and $cd(G)$ denote the set of complex irreducible character degrees of $G$. In this paper, we prove that if $G$ is a finite group and $H$ is an almost simple group whose socle is Mathieu group such that $cd(G) =cd(H)$, then there exists an Abelian subgroup $A$ of $G$ such that $G/A$ is isomorphic to $H$. This study is heading towards the study of an extension of Huppert's conjecture (2000) for almost simple groups.

math.GR

ABS-NET: Fully Decentralized Runtime Adaptation for Distributed Objects

We present a formalized, fully decentralized runtime semantics for a core subset of ABS, a language and framework for modelling distributed object-oriented systems. The semantics incorporates an abstract graph representation of a network infrastructure, with network endpoints represented as graph nodes, and links as arcs with buffers, corresponding to OSI layer 2 interconnects. The key problem we wish to address is how to allocate computational tasks to nodes so that certain performance objectives are met. To this end, we use the semantics as a foundation for performing network-adaptive task execution via object migration between nodes. Adaptability is analyzed in terms of three Quality of Service objectives: node load, arc load and message latency. We have implemented the key parts of our semantics in a simulator and evaluated how well objectives are achieved for some application-relevant choices of network topology, migration procedure and ABS program. The evaluation suggests that it is feasible in a decentralized setting to continually meet both the objective of a node-balanced task allocation and make headway towards minimizing communication, and thus arc load and message latency.

cs.DC