This paper proposes an approach to generate test data specifically for dynamic pointer structures. A pointer is considered and handled as a location in a memory which is modeled as a linear array. Test data can be directly generated from this array. The method handles a variety of dynamic structures and the shape generation can be achieved in linear time in terms of the number of statements rel...

We review recent asymptotic results on some robust methods for multiple regression. The regressors include stationary and non-stationary time series as well as polynomial terms. The methods include the Huber-skip M-estimator, 1-step Huber-skip M-estimators, in particular the Impulse Indicator Saturation, iterated 1-step Huber-skip M-estimators and the Forward Search. These methods classify obse...

Java programs often use pointer structures for normal computations. A verification system for Java should have good proof support for reasoning about those structures. However, the literature for pointer verification almost always uses specifications and definitions that are tailored to the problem under consideration. We propose a generic specification for Java pointer structures that allows t...

BACKGROUND Nodal skip metastasis is a prognostic factor in some sites of malignancies, but its role in esophageal cancer is still unclear. The present study aimed to investigate occurrence and effect of nodal skip metastases in thoracic esophageal squamous cell carcinoma. METHODS All 578 patients undergoing esophagectomy for thoracic esophageal squamous cell carcinoma at the Center for Esopha...

A summary of the results of a series of studies of nonresponse and measurement error in the National Household Survey on Drug Abuse (NHSDA) is given in this chapter. Two studies not previously reported, the Skip Pattern Experiment and the Census Match Study, are the primary focus of the chapter. The Skip Pattern Experiment involved a test of a modified NHSDA questionnaire that made extensive us...

Pointer information is a prerequisite for most program analyses, and inclusion-based, i.e. Andersen-style, pointer analysis is widely used to compute such information. However, current inclusion-based analyses can have prohibitive costs in time and space, especially for programs with millions of lines of code. We present a suite of offline optimizations that exploit pointer and location equival...

Data sparsity is a large problem in natural language processing that refers to the fact that language is a system of rare events, so varied and complex, that even using an extremely large corpus, we can never accurately model all possible strings of words. This paper examines the use of skip-grams (a technique where by n-grams are still stored to model language, but they allow for tokens to be ...

The recently proposed Skip-gram model is a powerful method for learning high-dimensional word representations that capture rich semantic relationships between words. However, Skipgram as well as most prior work on learning word representations does not take into account word ambiguity and maintain only a single representation per word. Although a number of Skip-gram modifications were proposed ...