On the detection of custom memory allocators in C binaries

Many reverse engineering techniques for data structures rely on the knowledge of memory allocation routines. Typically, they interpose on the system’s malloc and free functions, and track each chunk of memory thus allocated as a data structure. However, many performance-critical applications implement their own custom memory allocators. Examples include webservers, database management systems, and compilers like gcc and clang. As a result, current binary analysis techniques for tracking data structures fail on such binaries. We present MemBrush, a new tool to detect memory allocation and deallocation functions in stripped binaries with high accuracy. We evaluated the technique on a large number of real world applications that use custom memory allocators. We demonstrate that MemBrush can detect allocators/deallocators with a high accuracy which is 52 out of 59 for allocators, and 29 out of 31 for deallocators in SPECINT 2006. As we show, we can furnish existing reverse engineering tools with detailed information about the memory management API, and as a result perform an analysis of the actual application specific data structures designed by the programmer. Our system uses dynamic analysis and detects memory allocation and deallocation routines by searching for functions that comply with a set of generic characteristics of allocators and deallocators.     

Computational Semantics in Discourse: Underspecification, Resolution, and Inference

In this paper I introduce a formalism for natural language understandingbased on a computational implementation of Discourse RepresentationTheory. The formalism covers a wide variety of semantic phenomena(including scope and lexical ambiguities, anaphora and presupposition),is computationally attractive, and has a genuine inference component. Itcombines a well-established linguistic formalism (DRT) with advancedtechniques to deal with ambiguity (underspecification), and isinnovative in the use of first-order theorem proving techniques.The architecture of the formalism for natural language understandingthat I advocate consists of three levels of processing:underspecification, resolution, andinference. Each of these levels has a distinct function andtherefore employs a different kind of semantic representation. Themappings between these different representations define the interfacesbetween the levels.I show how underspecified semantic representations can be built in acompositional way (for a fragment of English Grammar) using standardtechniques borrowed from the -calculus, how inferences can becarried out on discourse representations using a translation tofirst-order logic, and how existing research prototypes (discourseprocessing and spoken-dialogue systems) implement the formalism.     

Estimation of Fourier coefficients

It is shown that the maximum-likelihood estimation or robust estimation of the Fourier coefficients may be preferable to Fourier transformation if the noise contains outliers or is otherwise not normally distributed. The reason is that, in that case, these estimators produce Fourier coefficient estimates and, therefore, system parameter estimates having a smaller variance     

Low-Latency Elliptic Curve Scalar Multiplication

This paper presents a low-latency algorithm designed for parallel computer architectures to compute the scalar multiplication of elliptic curve points based on approaches from cryptographic side-channel analysis. A graphics processing unit implementation using a standardized elliptic curve over a 224-bit prime field, complying with the new 112-bit security level, computes the scalar multiplication in 1.9?ms on the NVIDIA GTX 500 architecture family. The presented methods and implementation considerations can be applied to any parallel 32-bit architecture.     

An annotated corpus for the analysis of VP ellipsis

Verb Phrase Ellipsis (VPE) has been studied in great depth in theoretical linguistics, but empirical studies of VPE are rare. We extend the few previous corpus studies with an annotated corpus of VPE in all 25 sections of the Wall Street Journal corpus (WSJ) distributed with the Penn Treebank. We annotated the raw files using a stand-off annotation scheme that codes the auxiliary verb triggering the elided verb phrase, the start and end of the antecedent, the syntactic type of antecedent (VP, TV, NP, PP or AP), and the type of syntactic pattern between the source and target clauses of the VPE and its antecedent. We found 487 instances of VPE (including predicative ellipsis, antecedent-contained deletion, comparative constructions, and pseudo-gapping) plus 67 cases of related phenomena such as do so anaphora. Inter-annotator agreement was high, with a 0.97 average F-score for three annotators for one section of the WSJ. Our annotation is theory neutral, and has better coverage than earlier efforts that relied on automatic methods, e.g. simply searching the parsed version of the Penn Treebank for empty VP’s achieves a high precision (0.95) but low recall (0.58) when compared with our manual annotation. The distribution of VPE source–target patterns deviates highly from the standard examples found in the theoretical linguistics literature on VPE, once more underlining the value of corpus studies. The resulting corpus will be useful for studying VPE phenomena as well as for evaluating natural language processing systems equipped with ellipsis resolution algorithms, and we propose evaluation measures for VPE detection and VPE antecedent selection. The stand-off annotation is freely available for research purposes.     

Energy optimization for CAN bus and media controls in electric vehicles using deep learning algorithms

The Journal of Supercomputing - This study offers a neural network-based deep learning method for energy optimization modeling in electric vehicles (EV). The pre-processed driving cycle is...     

Bistable C1 ferroelectric liquid crystal device for e-paper application

Recent progress in both low pretilt and high pretilt defect-free C1 surface stabilized ferroelectric liquid crystal (SSFLC) devices for e-paper application is reviewed. First, by using numerical calculation to investigate the balance between surface azimuthal anchoring energy and bulk elastic energy within the confined chevron layer geometry of C1 and C2, we found it is possible to achieve a zigzag-free C1 state by low azimuthal anchoring alignment with a low pretilt angle. The critical azimuthal anchoring coefficient for defect-free C1 state is calculated. Its relationship with elastic constants, chevron angle, and surface topography effect are also discussed. Second, by using 5° oblique SiO deposition alignment, a defect-free, large memory angle, high contrast ratio, and bistable C1 SSFLC display, which has potential for electronic paper applications has also been developed. The electro-optical properties and bistability of this device have been investigated. Various aspects of defect control are also discussed.     

Improving basin water use in linked agricultural, ecological and urban systems: seeking new flow paths and avoiding dead ends.

In many river basins, patterns of water withdrawals, deliveries, depletion, return flows, and reuse are prevalent. These cascading systems, often misunderstood, provide opportunities, but also threats to livelihoods and environment. Different ways of thinking about these cascading systems are required.     

Procol

PROCOL is an object-oriented language with distributed delegation. It strongly supports concurrency: many objects may be active simultaneously, they execute in parallel unless engaged in communication. An object has exported operations, called Actions. Only one Action can be active at a time, however special interrupt Actions may interrupt regular Actions. Communication is performed via remote procedure call, or via a one-way synchronous message with short-time binding. In communications both client and server can be specified, either by object instance identifiers, or by type. Therefore client-server mappings may be 1-1,n-1, or 1-n, though only 1 message is transferred. PROCOL controls object access by an explicit per-object protocol. This protocol is a specification of the legality and serialization of the interaction between the object and its clients. It also provides for client type checking. The use of protocols in object communication fosters structured, safer and potentially verifiable information exchange between objects. The protocol also plays an important role as a partial interface specification. In addition it acts as a composition rule over client objects, representing relations with the client objects. PROCOL's communication binding is dynamic (run-time); it functions therefore naturally in a distributed, incremental and dynamic object environment. PROCOL also supports constraints, without compromising information hiding. An implementation is available in the form of aC extension.This author is supported by the Dutch Science Organization NWO