Efficient algorithms for segmentation of item-set time series

We propose a special type of time series, which we call an item-set time series, to facilitate the temporal analysis of software version histories, email logs, stock market data, etc. In an item-set time series, each observed data value is a set of discrete items. We formalize the concept of an item-set time series and present efficient algorithms for segmenting a given item-set time series. Segmentation of a time series partitions the time series into a sequence of segments where each segment is constructed by combining consecutive time points of the time series. Each segment is associated with an item set that is computed from the item sets of the time points in that segment, using a function which we call a measure function. We then define a concept called the segment difference, which measures the difference between the item set of a segment and the item sets of the time points in that segment. The segment difference values are required to construct an optimal segmentation of the time series. We describe novel and efficient algorithms to compute segment difference values for each of the measure functions described in the paper. We outline a dynamic programming based scheme to construct an optimal segmentation of the given item-set time series. We use the item-set time series segmentation techniques to analyze the temporal content of three different data sets–Enron email, stock market data, and a synthetic data set. The experimental results show that an optimal segmentation of item-set time series data captures much more temporal content than a segmentation constructed based on the number of time points in each segment, without examining the item set data at the time points, and can be used to analyze different types of temporal data.     

Information Preserving Time Decompositions of Time Stamped Documents*

Extraction of sequences of events from news and other documents based on the publication times of these documents has been shown to be extremely effective in tracking past events. This paper addresses the issue of constructing an optimal information preserving decomposition of the time period associated with a given document set, i.e., a decomposition with the smallest number of subintervals, subject to no loss of information. We introduce the notion of the compressed interval decomposition, where each subinterval consists of consecutive time points having identical information content. We define optimality, and show that any optimal information preserving decomposition of the time period is a refinement of the compressed interval decomposition. We define several special classes of measure functions (functions that measure the prevalence of keywords in the document set and assign them numeric values), based on their effect on the information computed as document sets are combined. We give algorithms, appropriate for different classes of measure functions, for computing an optimal information preserving decomposition of a given document set. We studied the effectiveness of these algorithms by computing several compressed interval and information preserving decompositions for a subset of the Reuters–21578 document set. The experiments support the obvious conclusion that the temporal information gleaned from a document set is strongly dependent on the measure function used and on other user-defined parameters.

Efficient Construction of Minimum Makespan Schedules for Tasks with a Fixed Number of Distinct Execution Times

This paper addresses scheduling problems for tasks with release and execution times. We present a number of efficient and easy to implement algorithms for constructing schedules of minimum makespan when the number of distinct task execution times is fixed. For a set of independent tasks, our algorithm in the single processor case runs in time linear in the number of tasks; with precedence constraints, our algorithm runs in time linear in the sum of the number of tasks and the size of the precedence constraints. In the multi-processor case, our algorithm constructs minimum makespan schedules for independent tasks with uniform execution times. The algorithm runs in O(n log m) time where n is the number of tasks and m is the number of processors. Received September 25, 1997; revised June 11, 1998.     

The Mother-Infant Relationship in Single, Cohabiting, and Married Families: A Case for Marriage?

Single-mother, cohabiting 2-parent, and married 2-parent families with infants were compared on maternal and infant behavior, Home Observation for Measurement of the Environment (HOME) scores, and infant's security of attachment. Married mothers and their infants demonstrated more positive behavior and received higher HOME scores when the infant was 6 and 15 months old than did their cohabiting and single counterparts. Married families were also better off than single and cohabiting families on several demographic, parent personality, financial, and social context measures. Single and cohabiting families were similar across most measures. Selection variables (maternal age, ethnic group, and education) explained much, but not all, of the family structure differences in the mother-infant relationship and the HOME. Maternal psychological adjustment, attitudes about child rearing, income, and social support explained little of the family structure variation, suggesting that characteristics that preceded marriage and conception were important determinants of family structure differences. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

National archives mass storage requirements--1975 to 1980

The Federal Government is the largest buyer of magnetic tape in the world. Current procurement is approximately one million reels annually. Of these tapes, slightly ever 1 percent are destined to contain data of permanent value. The problems the National Archives and Records Service (NARS) is encountering in preserving machine-readable records for long periods of time, particularly periods in excess of either the shelf life or technological life of the medium, are described. The economics of magnetic tape storage and NARS long-range storage requirements are discussed. Performance parameters for both a device and medium for the 1975-1980 time frame are given. These are basically 1) a medium lifetime of 50 years, equivalent to archival microfilm; 2) transfer rates equivalent to magnetic tape drives for the next 20 years; and 3) an annual capacity to transcribe 10¹²bit/year. Removable media are acceptable, as access time and bulk are not critical parameters.     

The complexity of monadic recursion schemes: exponential time bounds

We study the computational complexity of decision problems for the class $\text{M}$ of monadic recursion schemes. By the “executability problem” for a class 't of monadic recursion schemes, we mean the problem of determining whether a given defined function symbol of a given scheme in .'t can be called during at least one computation. The executability problem for a class $\text{I}$ of very simple monadic recursion schemes is shown to require deterministic exponential time. Using arguments about executability problems and about the class $\text{I}$, a number of decision problems for. $\text{M}$ and for several of. $\text{M}$'s subclasses are shown to require deterministic exponential time. Deterministic exponential time upper bounds are also presented for several of these decision problems.     

Cerebral blood flow and EEG changes in preterm infants with patent ductus arteriosus

It is unknown whether the decreased cerebral blood flow seen in infants with a large patent ductus arteriosus is associated with cerebral dysfunction. Decreased cerebral blood flow in adult human and animal models has been associated with altered electroencephalography (EEG), spectral-analyzed EEG, and EEG response to photic stimulation. Cerebral blood flow velocity, EEG, spectral analysis of EEG, and photic alteration of EEG spectra were evaluated in 8 infants before and after closure of a significant patent ductus arteriosus and in 10 control infants without a patent ductus arteriosus. All infants with patent ductus arteriosus had moderate or large shunts associated with a 25% mean reduction in cerebral blood flow velocity. There were no differences, however, in EEG, spectral analysis of EEG, or photic alteration of the spectral analysis for these infants before and after patent ductus arteriosus closure as compared to controls. It is concluded that the degree of decreased cerebral blood flow in infants with a significant patent ductus arteriosus is not sufficient to cause measurable alteration in electrocortical activity.