This paper examines the salient features of sequence analysis in demographic research. The new approach allows a holistic perspective on life course analysis, and is based on a representation of lives as sequences of states. Some of the methods for analysing such data are sketched, from complex description to optimal matching to monothetic divisive algorithms. After a short illustration of a de...

Introduction Researchers who work with large sequential datasets are often limited in the kinds of analytic strategies they can use because of the sheer size of the data. Automated techniques for analyzing sequences were developed in the 1960s by scientists studying DNA, RNA, and proteins. In a classic volume on sequence analysis, Sankoff and Kruskal (1983) demonstrated its potential applicatio...

IASSIST Quarterly Introduction Researchers who work with large sequential datasets are often limited in the kinds of analytic strategies they can use because of the sheer size of the data. Automated techniques for analyzing sequences were developed in the 1960s by scientists studying DNA, RNA, and proteins. In a classic volume on sequence analysis, Sankoff and Kruskal (1983) demonstrated its po...

a neural network is developed for the determination of leaky confined aquifer parameters. leakage into the aquifer takes place from the storage in the confining aquitard. the network is trained for the well function of leaky confined aquifers by the back propagation technique and adopting the levenberg–marquardt optimization algorithm. by applying the principal component analysis (pca) on the a...

In this paper we study two-sided, one-to-one matching problems and consider the most wellknown solution concept: the men-optimal solution. The men-optimal solution fails to satisfy consistency as well as converse consistency. Thanks to Sasaki and Toda (1992), we know that the minimal consistent extension of the men-optimal solution equals the core (Thomson, 1994a). In this paper, we compute the...

Given a set A ={a1, . . . ,an} of n image points and a set B ={b1, . . . ,bn} of n model points,the problem is to find a transformation matching (a one-to-one mapping) each point a ∈ A tosome point b ∈ B such that the length of the longest edge in the matching is minimized (so-calledbottleneck distance). The geometric transformations we allow are translation, rot...

This paper analyzes the use of a version of lexical maximim strategies, called protective behavior, in two-sided matching models. It restricts attention to mechanisms which produce stable matchings, that is, matchings which are individually rational and pairwise optimal. The main results of the paper show that truth-telling is the unique form of protective behavior in two such mechanisms. The f...

Although minimum quotas are important in many real-world markets, existing strategyproof mechanisms require an unrealistic assumption that all students consider all schools acceptable (and vice-versa). We develop a strategyproof matching mechanism called Priority-List based Deferred Acceptance mechanism with Minimum Quotas (PLDA-MQ), which works under more realistic assumptions: (i) a student c...

Given two sets A and B of n points each in R, we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. We can compute an optimal matching in O(n2+δ) time, for any δ > 0, and an ε-approximation in time O((n/ε)3/2 log n). If the set B is allowed to move rigidly to minimize the rms distance, we can compute a rigid motion of B...

Often, stereo matching is treated as two quite independent subprocesses: segmentation, followed by matching. In this paper, we treat these processes as naturally related, with partial matching results feeding back into the segmentation and both proceeding simultaneously in a cooperative fashion. We consider regions as the primitives to be matched, and our implementation is based upon maintainin...