S. Chen

ORCID: 0009-0004-1976-5748
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Ultrasonics and Acoustic Wave Propagation
  • Structural Health Monitoring Techniques
  • Infrastructure Maintenance and Monitoring
  • Cryptographic Implementations and Security
  • Algorithms and Data Compression
  • Advanced Malware Detection Techniques
  • Metallurgy and Material Forming
  • Solidification and crystal growth phenomena
  • Aluminum Alloy Microstructure Properties
  • Software System Performance and Reliability
  • Chaos-based Image/Signal Encryption
  • Natural Language Processing Techniques
  • High-Energy Particle Collisions Research
  • Distributed systems and fault tolerance
  • Advanced Software Engineering Methodologies
  • Advanced Data Storage Technologies
  • Particle physics theoretical and experimental studies
  • Speech Recognition and Synthesis
  • Caching and Content Delivery
  • Topic Modeling
  • Wind and Air Flow Studies
  • Quantum Chromodynamics and Particle Interactions

Nanyang Technological University
2024

Carnegie Mellon University
1997-2014

Florida State University
2006

Sakarya University
2006

University of Bonn
2006

We report results for the virtual photon asymmetry $A_1$ on nucleon from new Jefferson Lab measurements. The experiment, which used CEBAF Large Acceptance Spectrometer and longitudinally polarized proton ($^{15}$NH$_3$) deuteron ($^{15}$ND$_3$) targets, collected data with a electron beam at energies between 1.6 GeV 5.7 GeV. In present paper, we concentrate our $A_1(x,Q^2)$ related ratio $g_1/F_1(x,Q^2)$ in resonance deep inelastic regions lowest highest energies, covering range momentum...

10.1016/j.physletb.2006.08.011 article EN cc-by Physics Letters B 2006-08-21

Hash join algorithms suffer from extensive CPU cache stalls. We show that the standard hash algorithm/or disk-oriented databases (i.e. GRACE) spends over 73% of its user time stalled on misses, and explores use prefetching to improve performance. Applying joins is complicated by data dependencies, multiple code paths, inherent randomness hashing. present two techniques, group software-pipelined prefetching, overcome these complications. These schemes achieve 2.0-2.9X speedups for phase...

10.1109/icde.2004.1319989 article EN 2004-09-28

Phoenix/App supports software components whose states are made persistent across a system crash via redo recovery, replaying logged interactions. Our initial prototype force all request/reply events resulting from intercomponent method calls and returns. We describe an enhanced that implements: (i) log optimizations to improve normal execution performance; (ii) checkpointing recovery performance. Logging is reduced in two ways: (1) we only information required remove nondeterminism, the when...

10.1109/icde.2004.1320021 article EN 2004-09-28

Multiple language models are combined for many tasks in modeling, such as domain and topic adaptation. In this work, we compare on-line algorithms from machine learning to existing combining models. On-line developed problem have parameters that updated dynamically adapt a data set during evaluation. analysis provides guarantees these will perform nearly well the best model chosen hindsight large class of models, e.g., all static mixtures. We describe several present results comparing...

10.1109/icassp.1999.759774 article EN 1999-01-01

This paper presents a novel method for interpreting data to improve the indirect structural health monitoring (SHM) of bridges. The research presented in study is part an ongoing aimed at developing SHM paradigm assessment In this paradigm, we envision use instrumented vehicle that assesses bridge's dynamic characteristics while traveling across bridge. These are then correlated structure by means advanced signal processing and pattern recognition approaches. paper, present compare two...

10.1061/9780784412848.039 article EN Structures Congress 2019 2013-04-30

Chosen-prefix collision (CPC) attack was first presented by Stevens, Lenstra and de Weger on MD5 at Eurocrypt 2007. A CPC finds a for any two chosen prefixes, which is stronger variant of attack. CPCs are naturally harder to construct but have larger practical impact than (identical-prefix) collisions, as seen from the series previous works Stevens et al. SHA-1 Leurent Peyrin. Despite its significance, resistance attacks has not been studied AES-like hashing.In this work, we explore hashing...

10.46586/tosc.v2024.i4.64-96 article EN cc-by IACR Transactions on Symmetric Cryptology 2024-12-18
Coming Soon ...