Catalog footprint

What is connected

27works
25topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

27 published item(s)

preprint2026arXiv

METASYMBO: Multi-Agent Language-Guided Metamaterial Discovery via Symbolic Latent Evolution

Metamaterial discovery seeks microstructured materials whose geometry induces targeted mechanical behavior. Existing inverse-design methods can efficiently generate candidates, but they typically require explicit numerical property targets and are less suitable for early-stage exploration, where researchers often begin with incomplete constraints and qualitative intents expressed in natural language. Large language models can interpret such intents, but they lack geometric awareness and physical property validity. To address this gap, we propose MetaSymbO, a multi-agent framework for language-guided Metamaterial discovery via Symbolic-driven latent evOlution. Specifically, MetaSymbO contains three agents: a Designer that interprets free-form design intents and retrieves a semantically consistent scaffold, a Generator that synthesizes candidate microstructures in a disentangled latent space, and a Supervisor that provides fast property-aware feedback for iterative refinement. To move beyond the limitations of reproducing known samples from literature and training data, we further introduce symbolic-driven latent evolution, which applies programmable operators over disentangled latent factors to compose, modify, and refine structures at inference time. Extensive experiments demonstrate that (i) MetaSymbO improves structural validity by up to 34% in symmetry and nearly 98% in periodicity compared to state-of-the-art baselines; (ii) MetaSymbO achieves about 6-7% higher language-guidance scores while maintaining superior structure novelty compared to advanced reasoning LLMs; (iii) qualitative analyses confirm the effectiveness of symbolic logic operators in enabling programmable semantic alignment; and (iv) realworld case studies on auxetic, high-stiffness metamaterial design further validate its practical capability.

preprint2023arXiv

Towards High Performance One-Stage Human Pose Estimation

Making top-down human pose estimation method present both good performance and high efficiency is appealing. Mask RCNN can largely improve the efficiency by conducting person detection and pose estimation in a single framework, as the features provided by the backbone are able to be shared by the two tasks. However, the performance is not as good as traditional two-stage methods. In this paper, we aim to largely advance the human pose estimation results of Mask-RCNN and still keep the efficiency. Specifically, we make improvements on the whole process of pose estimation, which contains feature extraction and keypoint detection. The part of feature extraction is ensured to get enough and valuable information of pose. Then, we introduce a Global Context Module into the keypoints detection branch to enlarge the receptive field, as it is crucial to successful human pose estimation. On the COCO val2017 set, our model using the ResNet-50 backbone achieves an AP of 68.1, which is 2.6 higher than Mask RCNN (AP of 65.5). Compared to the classic two-stage top-down method SimpleBaseline, our model largely narrows the performance gap (68.1 AP vs. 68.9 AP) with a much faster inference speed (77 ms vs. 168 ms), demonstrating the effectiveness of the proposed method. Code is available at: https://github.com/lingl_space/maskrcnn_keypoint_refined.

preprint2022arXiv

Automatic Facial Skin Feature Detection for Everyone

Automatic assessment and understanding of facial skin condition have several applications, including the early detection of underlying health problems, lifestyle and dietary treatment, skin-care product recommendation, etc. Selfies in the wild serve as an excellent data resource to democratize skin quality assessment, but suffer from several data collection challenges.The key to guaranteeing an accurate assessment is accurate detection of different skin features. We present an automatic facial skin feature detection method that works across a variety of skin tones and age groups for selfies in the wild. To be specific, we annotate the locations of acne, pigmentation, and wrinkle for selfie images with different skin tone colors, severity levels, and lighting conditions. The annotation is conducted in a two-phase scheme with the help of a dermatologist to train volunteers for annotation. We employ Unet++ as the network architecture for feature detection. This work shows that the two-phase annotation scheme can robustly detect the accurate locations of acne, pigmentation, and wrinkle for selfie images with different ethnicities, skin tone colors, severity levels, age groups, and lighting conditions.

preprint2022arXiv

Cost-sensitive Boosting Pruning Trees for depression detection on Twitter

Depression is one of the most common mental health disorders, and a large number of depressed people commit suicide each year. Potential depression sufferers usually do not consult psychological doctors because they feel ashamed or are unaware of any depression, which may result in severe delay of diagnosis and treatment. In the meantime, evidence shows that social media data provides valuable clues about physical and mental health conditions. In this paper, we argue that it is feasible to identify depression at an early stage by mining online social behaviours. Our approach, which is innovative to the practice of depression detection, does not rely on the extraction of numerous or complicated features to achieve accurate depression detection. Instead, we propose a novel classifier, namely, Cost-sensitive Boosting Pruning Trees (CBPT), which demonstrates a strong classification ability on two publicly accessible Twitter depression detection datasets. To comprehensively evaluate the classification capability of the CBPT, we use additional three datasets from the UCI machine learning repository and the CBPT obtains appealing classification results against several state of the arts boosting algorithms. Finally, we comprehensively explore the influence factors of model prediction, and the results manifest that our proposed framework is promising for identifying Twitter users with depression.

preprint2022arXiv

MaiT: Leverage Attention Masks for More Efficient Image Transformers

Though image transformers have shown competitive results with convolutional neural networks in computer vision tasks, lacking inductive biases such as locality still poses problems in terms of model efficiency especially for embedded applications. In this work, we address this issue by introducing attention masks to incorporate spatial locality into self-attention heads. Local dependencies are captured efficiently with masked attention heads along with global dependencies captured by unmasked attention heads. With Masked attention image Transformer - MaiT, top-1 accuracy increases by up to 1.7% compared to CaiT with fewer parameters and FLOPs, and the throughput improves by up to 1.5X compared to Swin. Encoding locality with attention masks is model agnostic, and thus it applies to monolithic, hierarchical, or other novel transformer architectures.

preprint2021arXiv

A General Framework for Revealing Human Mind with auto-encoding GANs

Addressing the question of visualising human mind could help us to find regions that are associated with observed cognition and responsible for expressing the elusive mental image, leading to a better understanding of cognitive function. The traditional approach treats brain decoding as a classification problem, reading the mind through statistical analysis of brain activity. However, human thought is rich and varied, that it is often influenced by more of a combination of object features than a specific type of category. For this reason, we propose an end-to-end brain decoding framework which translates brain activity into an image by latent space alignment. To find the correspondence from brain signal features to image features, we embedded them into two latent spaces with modality-specific encoders and then aligned the two spaces by minimising the distance between paired latent representations. The proposed framework was trained by simultaneous electroencephalogram and functional MRI data, which were recorded when the subjects were viewing or imagining a set of image stimuli. In this paper, we focused on implementing the fMRI experiment. Our experimental results demonstrated the feasibility of translating brain activity to an image. The reconstructed image matches image stimuli approximate in both shape and colour. Our framework provides a promising direction for building a direct visualisation to reveal human mind.

preprint2021arXiv

Causal Factors, Benefits and Challenges of Test-Driven Development: Practitioner Perceptions

This report describes the experiences of one organization's adoption of Test Driven Development (TDD) practices as part of a medium-term software project employing Extreme Programming as a methodology. Three years into this project the team's TDD experiences are compared with their non-TDD experiences on other ongoing projects. The perceptions of the benefits and challenges of using TDD in this context are gathered through five semi-structured interviews with key team members. Their experiences indicate that use of TDD has generally been positive and the reasons for this are explored to deepen the understanding of TDD practice and its effects on code quality, application quality and development productivity. Lessons learned are identified to aid others with the adoption and implementation of TDD practices, and some potential further research areas are suggested.

preprint2021arXiv

Finite-Size Analysis of the Collapse of Dry Granular Columns

In this letter, we focus on the size effect of granular column collapses, which are potentially connected to the dynamics of complex geophysical flows, even if the link between microscopic structures of granular assemblies and their macroscopic behaviors is still not well understood. Using the sphero-polyhedral discrete element method (DEM), we show that the column radius/grain size ratio has a strong influence on the collapse behavior. A finite-size analysis, which is inspired by a phase transition around an inflection point, is performed to obtain a general scaling equation with critical exponents for run-out distances. We further link the size effect with the strong force network and formalize a correlation length scale that exponentially scales with the effective aspect ratio. Such a scaling solution shows similarities with the percolation problem of two-dimensional random networks and can be extended to other similar natural and engineering systems.

preprint2021arXiv

Using the Split Bregman Algorithm to Solve the Self-repelling Snake Model

Preserving contour topology during image segmentation is useful in many practical scenarios. By keeping the contours isomorphic, it is possible to prevent over-segmentation and under-segmentation, as well as to adhere to given topologies. The Self-repelling Snake model (SR) is a variational model that preserves contour topology by combining a non-local repulsion term with the geodesic active contour model (GAC). The SR is traditionally solved using the additive operator splitting (AOS) scheme. In our paper, we propose an alternative solution to the SR using the Split Bregman method. Our algorithm breaks the problem down into simpler sub-problems to use lower-order evolution equations and a simple projection scheme rather than re-initialization. The sub-problems can be solved via fast Fourier transform (FFT) or an approximate soft thresholding formula which maintains stability, shortening the convergence time, and reduces the memory requirement. The Split Bregman and AOS algorithms are compared theoretically and experimentally.

preprint2020arXiv

A Bayesian Updating Scheme for Pandemics: Estimating the Infection Dynamics of COVID-19

Epidemic models play a key role in understanding and responding to the emerging COVID-19 pandemic. Widely used compartmental models are static and are of limited use to evaluate intervention strategies with the emerging pandemic. Applying the technology of data assimilation, we propose a Bayesian updating approach for estimating epidemiological parameters using observable information for the purpose of assessing the impacts of different intervention strategies. We adopt a concise renewal model and propose new parameters by disentangling the reduction of instantaneous reproduction number Rt into mitigation and suppression factors for quantifying intervention impacts at a finer granularity. Then we developed a data assimilation framework for estimating these parameters including constructing an observation function and developing a Bayesian updating scheme. A statistical analysis framework is then built to quantify the impact of intervention strategies by monitoring the evolution of these estimated parameters. By Investigating the impacts of intervention measures of European countries, the United States and Wuhan with the framework, we reveal the effects of interventions in these countries and the resurgence risk in the USA.

preprint2020arXiv

Mesoscale investigations of fluid-solid interaction: Liquid slip flow in a parallel-plate microchannel

Liquid slip flow with a Knudsen number Kn = 0.001-0.1 plays a dominant role in confined flow channels. Its physical origin can be attributed to the intermolecular fluid-solid (F-S) interaction force. To this end, we propose herein continuous force functions (decaying either exponentially or by a power law) between fluid particles and two confined flat walls in the framework of the mesoscopic lattice Boltzmann model (LBM). The analytical solutions for density profile, velocity profile, slip length, and permeability ratio are derived and related to the mesoscale F-S interaction parameters and the size of the gap of the flow channel. Through nondimensionalization of the analytical solutions, we obtain the dimensionless numbers that indicate the key feature of slip-flow systems for each of the proposed force functions. The analytical solutions are strictly consistent with the LBM solutions. We suggest reasonable ranges for the F-S interaction parameters based on the observed range of density ratio (film fluid to bulk fluid) and the increasing permeability ratios with narrowing gap size. Within the given range of interaction parameters, simple relationships between permeability ratios and dimensionless numbers are provided by fitting. The curves for continuous F-S interaction force with two free parameters are calibrated for a hydrophobic surface by using LBM simulations, which were validated a priori by comparison with the slip velocity profile measured in a benchmark flow experiment. The mesoscopic LBM model based on the proposed F-S interaction force functions provides a robust framework to elucidate the physical process of liquid slip flow.

preprint2020arXiv

Regularizing Semi-supervised Graph Convolutional Networks with a Manifold Smoothness Loss

Existing graph convolutional networks focus on the neighborhood aggregation scheme. When applied to semi-supervised learning, they often suffer from the overfitting problem as the networks are trained with the cross-entropy loss on a small potion of labeled data. In this paper, we propose an unsupervised manifold smoothness loss defined with respect to the graph structure, which can be added to the loss function as a regularization. We draw connections between the proposed loss with an iterative diffusion process, and show that minimizing the loss is equivalent to aggregate neighbor predictions with infinite layers. We conduct experiments on multi-layer perceptron and existing graph networks, and demonstrate that adding the proposed loss can improve the performance consistently.

preprint2016arXiv

Sparse Subspace Clustering via Diffusion Process

Subspace clustering refers to the problem of clustering high-dimensional data that lie in a union of low-dimensional subspaces. State-of-the-art subspace clustering methods are based on the idea of expressing each data point as a linear combination of other data points while regularizing the matrix of coefficients with L1, L2 or nuclear norms for a sparse solution. L1 regularization is guaranteed to give a subspace-preserving affinity (i.e., there are no connections between points from different subspaces) under broad theoretical conditions, but the clusters may not be fully connected. L2 and nuclear norm regularization often improve connectivity, but give a subspace-preserving affinity only for independent subspaces. Mixed L1, L2 and nuclear norm regularization could offer a balance between the subspace-preserving and connectedness properties, but this comes at the cost of increased computational complexity. This paper focuses on using L1 norm and alleviating the corresponding connectivity problem by a simple yet efficient diffusion process on subspace affinity graphs. Without adding any tuning parameter , our method can achieve state-of-the-art clustering performance on Hopkins 155 and Extended Yale B data sets.

preprint2015arXiv

Quantum Hall Effects in a Non-Abelian Honeycomb Lattice

We study the tunable quantum Hall effects in a non-Abelian honeycomb optical lattice which is a many-Dirac-points system. We find that the quantum Hall effects present different features as change as relative strengths of several perturbations. Namely, a gauge-field-dressed next-nearest-neighbor hopping can induce the quantum spin Hall effect and a Zeeman field can induce a so-called quantum anomalous valley Hall effect which includes two copies of quantum Hall states with opposite Chern numbers and counter-propagating edge states. Our study extends the borders of the field of quantum Hall effects in honeycomb optical lattice when the internal valley degrees of freedom enlarge.

preprint2015arXiv

Structural and magnetic phase transitions in EuTi1-xNbxO3

We investigate the structural and magnetic phase transitions in EuTi1-xNbxO3 with synchrotron powder X-ray diffraction (XRD), resonant ultrasound spectroscopy (RUS), and magnetization measurements. Upon Nb-doping, the Pm-3m to I4/mcm structural transition shifts to higher temperatures and the room temperature lattice parameter increases while the magnitude of the octahedral tilting decreases. In addition, Nb substitution for Ti destabilizes the antiferromagnetic ground state of the parent compound and long range ferromagnetic order is observed in the samples containing more than 10% Nb. The structural transition in pure and doped compounds is marked by a step-like softening of the elastic moduli in a narrow temperature interval near TS, which resembles that of SrTiO3 and can be adequately modeled using the Landau free energy model employing the same coupling between strain and octahedral tilting order parameter as previously used to model SrTiO3.

preprint2013arXiv

Charge carrier relaxation model in hopping system

The relaxation phenomena of charge carriers in hopping system have been demonstrated and investigated theoretically. An analytical model describing the charge carrier relaxation is proposed based on the hopping transport theory. The relation between the material disorder, electric field and temperature and the relaxation phenomena has been discussed in detail, respectively. The calculated results reveal that the increase of electric field and temperature can promote the relaxation effect in disordered systems, while the increase of material disorder will weaken the relaxation. The proposed model can explain well the stretched-exponential law by adopting the appropriate parameters. The calculation shows a good agreement with the experimental data for organic semiconductors.

preprint2013arXiv

Comment on "Validity of Einstein Relation in Disordered Organic Semiconductors"

Wetzelaer, Koster, and Blom [PRL 107, 066605] recently observed that the classic Einstein relation $\frac{D}μ=\frac{kT}{q}$ is still valid in disordered semiconductors in thermal(quasi)equilibrium by studying the diffusion-driven currents of single-carrier diodes. This is in contrast to the previous theoretical prediction [2] and experiment observation from Leo et.al. [3] where the Einstein relation increases with 1/T. We will discuss the reason for this discrepancy here and suggest that one-carrier diodes experiment might nor be suitable for verifying Einstein relation in organic semiconductors.

preprint2013arXiv

Physical Origin of Nonlinear transport in organic semiconductor at high carrier densities

The charge transport in some organic semiconductors demonstrates nonlinear properties and further universal power-law scaling with both bias and temperature. The physical origin of this behavior is investigated here using variable range hopping theory. The results shows, this universal power-law scaling can be well explained by variable range hopping theory . Relation to the recent experimental data is also discussed.

preprint2012arXiv

Bayesian Subset Simulation: a kriging-based subset simulation algorithm for the estimation of small probabilities of failure

The estimation of small probabilities of failure from computer simulations is a classical problem in engineering, and the Subset Simulation algorithm proposed by Au & Beck (Prob. Eng. Mech., 2001) has become one of the most popular method to solve it. Subset simulation has been shown to provide significant savings in the number of simulations to achieve a given accuracy of estimation, with respect to many other Monte Carlo approaches. The number of simulations remains still quite high however, and this method can be impractical for applications where an expensive-to-evaluate computer model is involved. We propose a new algorithm, called Bayesian Subset Simulation, that takes the best from the Subset Simulation algorithm and from sequential Bayesian methods based on kriging (also known as Gaussian process modeling). The performance of this new algorithm is illustrated using a test case from the literature. We are able to report promising results. In addition, we provide a numerical study of the statistical properties of the estimator.

preprint2012arXiv

Comments on "Unusual Thermoelectric Behavior Indicating a Hopping to Bandlike Transport Transition in Pentacene"

W. Chr. Germs, K. Guo, R. A. J. Janssen, and M. Kemerink [1] recently measured the temperature and concentration dependent seebeck coefficient in organic thin film transistor and found the seebeck coefficient increases with carrier concentration (corresponding to the gate voltage) in the low temperature regime. They further concluded that this unusual behavior is due to a transition from hopping transport in static localized states to bandlike transport, occurring at low temperatures. This is obviously in contrast to the previous theoretical prediction because it is widely accepted that hopping transport is more pronounced at low temperature. We will discuss the reason for this unusual behavior here and suggest that the density of states function plays an important role in concentration dependent seebeck coefficient.

preprint2012arXiv

DLS: Directoryless Shared Last-level Cache

Directory-based protocols have been the de facto solution for maintaining cache coherence in shared-memory parallel systems comprising multi/many cores, where each store instruction is eagerly made globally visible by invalidating the private cache (PC) backups of other cores. Consequently, the directory not only consumes large chip area, but also incurs considerable energy consumption and performance degradation, due to the large number of Invalidation/Ack messages transferred in the interconnection network and resulting network congestion. In this paper, we reveal the interesting fact that the directory is actually an unnecessary luxury for practical parallel systems. Because of widely deployed software/hardware techniques involving instruction reordering, most (if not all) parallel systems work under the weak consistency model, where a remote store instruction is allowed to be invisible to a core before the next synchronization of the core, instead of being made visible eagerly by invalidating PC backups of other cores. Based on this key observation, we propose a lightweight novel scheme called {\em DLS (DirectoryLess Shared last-level cache)}, which completely removes the directory and Invalidation/Ack messages, and efficiently maintains cache coherence using a novel {\em self-suspicion + speculative execution} mechanism. Experimental results over SPLASH-2 benchmarks show that on a 16-core processor, DLS not only completely removes the chip area cost of the directory, but also improves processor performance by 11.08%, reduces overall network traffic by 28.83%, and reduces energy consumption of the network by 15.65% on average (compared with traditional MESI protocol with full directory). Moreover, DLS does not involve any modification to programming languages and compilers, and hence is seamlessly compatible with legacy codes.

preprint2012arXiv

Global Adaptive Routing Algorithm Without Additional Congestion Propagation Network

Adaptive routing algorithm has been employed in multichip interconnection networks in order to improve network performance. Does a algorithm use local or global network state? This is the key question in adaptive routing. In many traffic patterns, the ignorance of global network state, leading to routing selection based only on local congestion information, tends to violate global load balance. To attack the load balance issue in adapting routing, some global adaptive routing algorithms introduce a congestion propagation network to obtain global network status information, such as Regional Congestion Awareness (RCA) and Destination Based Adaptive Routing (DBAR). However, the congestion propagation network leads to additional power and area consumption which cannot be ignored. From another view, if we just increase the bandwidth between neighbor nodes with the wires used to build the congestion propagation network, the network performance could be improved as well. In this paper, we propose a global adaptive routing algorithm without employing the additional congestion propagation network. Our algorithm obtains the global network state in a novel way, and can offer significant improvement than the base-line local adaptive routing algorithm (xy-adaptive algorithm which selects routing based on local congestion information in each hop) for both medium and high injection rates. In wormhole flow control, all the routing information (flit id, source node id, destination node id, vc id and address) is contained in head flit, and data is carried in body flits. As a result, there are always many free bits in the head flit, especially when the bandwidth is 128-bits which is normal in interconnection network design. Then, we can use these free bits in the head flit to propagate global congestion information but not increase the number of flits.

preprint2012arXiv

Sequential design of computer experiments for the estimation of a probability of failure

This paper deals with the problem of estimating the volume of the excursion set of a function $f:\mathbb{R}^d \to \mathbb{R}$ above a given threshold, under a probability measure on $\mathbb{R}^d$ that is assumed to be known. In the industrial world, this corresponds to the problem of estimating a probability of failure of a system. When only an expensive-to-simulate model of the system is available, the budget for simulations is usually severely limited and therefore classical Monte Carlo methods ought to be avoided. One of the main contributions of this article is to derive SUR (stepwise uncertainty reduction) strategies from a Bayesian-theoretic formulation of the problem of estimating a probability of failure. These sequential strategies use a Gaussian process model of $f$ and aim at performing evaluations of $f$ as efficiently as possible to infer the value of the probability of failure. We compare these strategies to other strategies also based on a Gaussian process model for estimating a probability of failure.

preprint2012arXiv

Validity of Transport Energy in Disordered Organic Semiconductors

A systematic study of the transport energy in disordered organic semiconductors based on variable range hopping theory has been presented here. The temperature, electric field, material disorder and carrier concentration dependent transport energy is extensively discussed. We demonstrate here, transport energy is not a general concept and invalid even in low electric field and concentration regime.

preprint2011arXiv

Efficient Deterministic Replay Using Complete Race Detection

Data races can significantly affect the executions of multi-threaded programs. Hence, one has to recur the results of data races to deterministically replay a multi-threaded program. However, data races are concealed in enormous number of memory operations in a program. Due to the difficulty of accurately identifying data races, previous multi-threaded deterministic record/replay schemes for commodity multi-processor system give up to record data races directly. Consequently, they either record all shared memory operations, which brings remarkable slowdown to the production run, or record the synchronization only, which introduces significant efforts to replay. Inspired by the advances in data race detection, we propose an efficient software-only deterministic replay scheme for commodity multi-processor systems, which is named RacX. The key insight of RacX is as follows: although it is NP-hard to accurately identify the existence of data races between a pair of memory operations, we can find out all potential data races in a multi-threaded program, in which the false positives can be reduced to a small amount with our automatic false positive reduction techniques. As a result, RacX can efficiently monitor all potential data races to deterministically replay a multi-threaded program. To evaluate RacX, we have carried out experiments over a number of well-known multi-threaded programs from SPLASH-2 benchmark suite and large-scale commercial programs. RacX can precisely recur production runs of these programs with value determinism. Averagely, RacX causes only about 1.21%, 1.89%, 2.20%, and 8.41% slowdown to the original run during recording (for 2-, 4-, 8- and 16-thread programs, respectively). The soundness, efficiency, scalability, and portability of RacX well demonstrate its superiority.

preprint2010arXiv

Interaction of Atomic and Molecular Hydrogen with Tholin Surfaces at Low Temperatures

We study the interaction of atomic and molecular hydrogen with a surface of tholin, a man-made polymer considered to be an analogue of aerosol particles present in Titan's atmosphere, using thermal programmed desorption at low temperatures below 30 K. The results are fitted and analyzed using a fine-grained rate equation model that describes the diffusion, reaction and desorption processes. We obtain the energy barriers for diffusion and desorption of atomic and molecular hydrogen. These barriers are found to be in the range of 30 to 60 meV, indicating that atom/molecule-surface interactions in this temperature range are dominated by weak adsorption forces. The implications of these results for the understanding of the atmospheric chemistry of Titan are discussed.

preprint2007arXiv

Molecular Hydrogen Formation on Amorphous Silicates Under Interstellar Conditions

Experimental results on the formation of molecular hydrogen on amorphous silicate surfaces are presented for the first time and analyzed using a rate equation model. The energy barriers for the relevant diffusion and desorption processes are obtained. They turn out to be significantly higher than those obtained earlier for polycrystalline silicates, demonstrating the importance of grain morphology. Using these barriers we evaluate the efficiency of molecular hydrogen formation on amorphous silicate grains under interstellar conditions. It is found that unlike polycrystalline silicates, amorphous silicate grains are efficient catalysts of H$_{2}$ formation within a temperature range which is relevant to diffuse interstellar clouds. The results also indicate that the hydrogen molecules are thermalized with the surface and desorb with low kinetic energy. Thus, they are unlikely to occupy highly excited states.