4,011 research outputs found
Effect of tempering temperature on microstructure and properties of 65Mn steel for metallurgical saw blade
The continuous tempering treatment of 65 Mn steel for metallurgical saw blade was carried out in the temperature range of 200-620 °C by means of metallographic observation and mechanical property test. The results show that with the increase of tempering temperature, the strength and hardness of the pattern decrease continuously, and the impact value, section shrinkage and elongation change significantly. The experimental results provide a technical reference for preventing the failure of the saw blade during operation
Precise static happens-before analysis for detecting UAF order violations in android
© 2019 IEEE. Unlike Java, Android provides a rich set of APIs to support a hybrid concurrency system, which consists of both Java threads and an event queue mechanism for dispatching asynchronous events. In this model, concurrency errors often manifest themselves in the form of order violations. An order violation occurs when two events access the same shared object in an incorrect order, causing unexpected program behaviors (e.g., null pointer dereferences). This paper presents SARD, a static analysis tool for detecting both intra-and inter-thread use-after-free (UAF) order violations, when a pointer is dereferenced (used) after it no longer points to any valid object, through systematic modeling of Android's concurrency mechanism. We propose a new flow-and context-sensitive static happens-before (HB) analysis to reason about the interleavings between two events to effectively identify precise HB relations and eliminate spurious event interleavings. We have evaluated SARD by comparing with NADROID, a state-of-the-art static order violation detection tool for Android. SARD outperforms NADROID in terms of both precision (by reporting three times fewer false alarms than NADROID given the same set of apps used by NADROID) and efficiency (by running two orders of magnitude faster than NADROID)
Familial Clustering For Weakly-labeled Android Malware Using Hybrid Representation Learning
IEEE Labeling malware or malware clustering is important for identifying new security threats, triaging and building reference datasets. The state-of-the-art Android malware clustering approaches rely heavily on the raw labels from commercial AntiVirus (AV) vendors, which causes misclustering for a substantial number of weakly-labeled malware due to the inconsistent, incomplete and overly generic labels reported by these closed-source AV engines, whose capabilities vary greatly and whose internal mechanisms are opaque (i.e., intermediate detection results are unavailable for clustering). The raw labels are thus often used as the only important source of information for clustering. To address the limitations of the existing approaches, this paper presents ANDRE, a new ANDroid Hybrid REpresentation Learning approach to clustering weakly-labeled Android malware by preserving heterogeneous information from multiple sources (including the results of static code analysis, the metainformation of an app, and the raw-labels of the AV vendors) to jointly learn a hybrid representation for accurate clustering. The learned representation is then fed into our outlieraware clustering to partition the weakly-labeled malware into known and unknown families. The malware whose malicious behaviours are close to those of the existing families on the network, are further classified using a three-layer Deep Neural Network (DNN). The unknown malware are clustered using a standard density-based clustering algorithm. We have evaluated our approach using 5,416 ground-truth malware from Drebin and 9,000 malware from VIRUSSHARE (uploaded between Mar. 2017 and Feb. 2018), consisting of 3324 weakly-labeled malware. The evaluation shows that ANDRE effectively clusters weaklylabeled malware which cannot be clustered by the state-of-theart approaches, while achieving comparable accuracy with those approaches for clustering ground-truth samples
Object Versioning for Flow-Sensitive Pointer Analysis
Flow-sensitive points-to analysis provides better precision than its flow-insensitive counterpart. Traditionally performed on the control-flow graph, it incurs heavy analysis overhead. For performance, staged flow-sensitive analysis (SFS) is conducted on a pre-computed def-use (value-flow) graph where points-to sets of variables are propagated across def-use chains sparsely rather than across control-flow in the control-flow graph. SFS makes the propagation of different objects' points-to sets sparse (multiple-object sparsity), however, it suffers from redundant propagation between instructions of the same object's points-to sets (single-object sparsity). The points-to set of an object is often duplicated, resulting in redundant propagation and storage, especially in real-world heap-intensive programs. We notice that a simple graph prelabelling extension can identify much of this redundancy in a pre-analysis. With this pre-analysis, multiple nodes (instructions) in the value-flow graph can share an individual memory object's points-to set rather than each node maintaining its own points-to set for that single object. We present object versioning for flow-sensitive points-to analysis, a finer single-object sparsity technique which maintains the same precision while allowing us to avoid much of the redundancy present in propagating and storing points-to sets. Our experiments conducted on 15 open-source programs, when compared with SFS, show that our approach runs up to 26.22Ă— faster (5.31Ă— on average), and reduces memory usage by up to 5.46Ă— (2.11 Ă— on average)
Flow-sensitive type-based heap cloning
By respecting program control-flow, flow-sensitive pointer analysis promises more precise results than its flow-insensitive counterpart. However, existing heap abstractions for C and C++ flow-sensitive pointer analyses model the heap by creating a single abstract heap object for each memory allocation. Two runtime heap objects which originate from the same allocation site are imprecisely modelled using one abstract object, which makes them share the same imprecise points-to sets and thus reduces the benefit of analysing heap objects flow-sensitively. On the other hand, equipping flow-sensitive analysis with context-sensitivity, whereby an abstract heap object would be created (cloned) per calling context, can yield a more precise heap model, but at the cost of uncontrollable analysis overhead when analysing larger programs. This paper presents TypeClone, a new type-based heap model for flow-sensitive analysis. Our key insight is to differentiate concrete heap objects lazily using type information at use sites within the program control-flow (e.g., when accessed via pointer dereferencing) for programs which conform to the strict aliasing rules set out by the C and C++ standards. The novelty of TypeClone lies in its lazy heap cloning: an untyped abstract heap object created at an allocation site is killed and replaced with a new object (i.e. a clone), uniquely identified by the type information at its use site, for flow-sensitive points-to propagation. Thus, heap cloning can be performed within a flow-sensitive analysis without the need for context-sensitivity. Moreover, TypeClone supports new kinds of strong updates for flow-sensitive analysis where heap objects are filtered out from imprecise points-to relations at object use sites according to the strict aliasing rules. Our method is neither strictly superior nor inferior to context-sensitive heap cloning, but rather, represents a new dimension that achieves a sweet spot between precision and efficiency. We evaluate our analysis by comparing TypeClone with state-of-the-art sparse flow-sensitive points-to analysis using the 12 largest programs in GNU Coreutils. Our experimental results also confirm that TypeClone is more precise than flow-sensitive pointer analysis and is able to, on average, answer over 15% more alias queries with a no-alias result
Illustrating a new global-scale approach to estimating potential reduction in fish species richness due to flow alteration
Changes in river discharge due to human activities and climate change would
affect the sustainability of freshwater ecosystems. To globally assess how
changes in river discharge will affect the future status of freshwater
ecosystems, global-scale hydrological simulations need to be connected with
a model to estimate the durability of freshwater ecosystems. However, the
development of this specific modelling combination for the global scale is
still in its infancy. In this study, two statistical methods are introduced
to link flow regimes to fish species richness (FSR): one is based on a
linear relationship between FSR and mean river discharge (hereafter, FSR-MAD
method), and the other is based on a multi-linear relationship between FSR
and ecologically relevant flow indices involving several other flow
characteristics and mean river discharge (FSR-FLVAR method). The FSR-MAD
method has been used previously in global simulation studies. The FSR-FLVAR
method is newly introduced here. These statistical methods for estimating
FSR were combined with a set of global river discharge simulations to
evaluate the potential impact of climate-change-induced flow alterations on
FSR changes. Generally, future reductions in FSR with the FSR-FLVAR method
are greater and much more scattered than with the FSR-MAD method. In arid
regions, both methods indicate reductions in FSR because mean discharge is
projected to decrease from past to future, although the magnitude of
reductions in FSR is different between the two methods. In contrast, in
heavy-snow regions a large reduction in FSR is shown by the FSR-FLVAR method
due to increases in the frequency of low and high flows. Although further
research is clearly needed to conclude which method is more appropriate,
this study demonstrates that the FSR-FLVAR method could produce considerably
different results when assessing the global role of flow alterations in
changing freshwater ecosystems
Light-Front Quantization and AdS/QCD: An Overview
We give an overview of the light-front holographic approach to strongly
coupled QCD, whereby a confining gauge theory, quantized on the light front, is
mapped to a higher-dimensional anti de Sitter (AdS) space. The framework is
guided by the AdS/CFT correspondence incorporating a gravitational background
asymptotic to AdS space which encodes the salient properties of QCD, such as
the ultraviolet conformal limit at the AdS boundary at , as well as
modifications of the geometry in the large infrared region to describe
confinement and linear Regge behavior. There are two equivalent procedures for
deriving the AdS/QCD equations of motion: one can start from the Hamiltonian
equation of motion in physical space time by studying the off-shell dynamics of
the bound state wavefunctions as a function of the invariant mass of the
constituents. To a first semiclassical approximation, where quantum loops and
quark masses are not included, this leads to a light-front Hamiltonian equation
which describes the bound state dynamics of light hadrons in terms of an
invariant impact variable which measures the separation of the partons
within the hadron at equal light-front time. Alternatively, one can start from
the gravity side by studying the propagation of hadronic modes in a fixed
effective gravitational background. Both approaches are equivalent in the
semiclassical approximation. This allows us to identify the holographic
variable in AdS space with the impact variable . Light-front
holography thus allows a precise mapping of transition amplitudes from AdS to
physical space-time. The internal structure of hadrons is explicitly introduced
and the angular momentum of the constituents plays a key role.Comment: Invited talk presented by GdT at the XIV School of Particles and
Fields, Morelia, Mexico, November 8-12, 201
- …