A tale of three functions: The self-reported uses of autobiographical memory

Theories hold that autobiographical memory serves several broad functions (directive, self, and social). In the current study, items were derived from the theoretical literature to create the Thinking About Life Experiences (TALE) questionnaire to empirically assess these three functions. Participants (N = 167) completed the TALE. To examine convergent validity, they also rated their overall tendency to think about and to talk about the past and completed the Reminiscence Functions Scale (Webster, 1997). The results lend support to the existence of these theoretical functions, but also offer room for refinements in future thinking about both the breadth and specificity of the functions that autobiographical memory serves.

PenPC: A two-step approach to estimate the skeletons of high-dimensional directed acyclic graphs.

Estimation of the skeleton of a directed acyclic graph (DAG) is of great importance for understanding the underlying DAG and causal effects can be assessed from the skeleton when the DAG is not identifiable. We propose a novel method named PenPC to estimate the skeleton of a high-dimensional DAG by a two-step approach. We first estimate the nonzero entries of a concentration matrix using penalized regression, and then fix the difference between the concentration matrix and the skeleton by evaluating a set of conditional independence hypotheses. For high-dimensional problems where the number of vertices p is in polynomial or exponential scale of sample size n, we study the asymptotic property of PenPC on two types of graphs: traditional random graphs where all the vertices have the same expected number of neighbors, and scale-free graphs where a few vertices may have a large number of neighbors. As illustrated by extensive simulations and applications on gene expression data of cancer patients, PenPC has higher sensitivity and specificity than the state-of-the-art method, the PC-stable algorithm.

Mix it and fix it: functions of composite olfactory signals in ring-tailed lemurs.

Animals communicating via scent often deposit composite signals that incorporate odorants from multiple sources; however, the function of mixing chemical signals remains understudied. We tested both a 'multiple-messages' and a 'fixative' hypothesis of composite olfactory signalling, which, respectively, posit that mixing scents functions to increase information content or prolong signal longevity. Our subjects-adult, male ring-tailed lemurs (Lemur catta)-have a complex scent-marking repertoire, involving volatile antebrachial (A) secretions, deposited pure or after being mixed with a squalene-rich paste exuded from brachial (B) glands. Using behavioural bioassays, we examined recipient responses to odorants collected from conspecific strangers. We concurrently presented pure A, pure B and mixed A + B secretions, in fresh or decayed conditions. Lemurs preferentially responded to mixed over pure secretions, their interest increasing and shifting over time, from sniffing and countermarking fresh mixtures, to licking and countermarking decayed mixtures. Substituting synthetic squalene (S)-a well-known fixative-for B secretions did not replicate prior results: B secretions, which contain additional chemicals that probably encode salient information, were preferred over pure S. Whereas support for the 'multiple-messages' hypothesis underscores the unique contribution from each of an animal's various secretions, support for the 'fixative' hypothesis highlights the synergistic benefits of composite signals.

Effector functions of heparin-binding hemagglutinin-specific CD8+ T lymphocytes in latent human tuberculosis.

BACKGROUND: Most individuals infected with Mycobacterium tuberculosis do not develop tuberculosis (TB) and can be regarded as being protected by an appropriate immune response to the infection. The characterization of the immune responses of individuals with latent TB may thus be helpful in the definition of correlates of protection and the development of new vaccine strategies. The highly protective antigen heparin-binding hemagglutinin (HBHA) induces strong interferon (IFN)- gamma responses during latent, but not active, TB. Because of the recently recognized importance of CD8(+) T lymphocytes in anti-TB immunity, we characterized the CD8(+) T lymphocyte responses to HBHA in subjects with latent TB. RESULTS: HBHA-specific CD8(+) T lymphocytes expressed memory cell markers and synthesized HBHA-specific IFN- gamma .They also restricted mycobacterial growth and expressed cytotoxicity by a granule-dependent mechanism. This activity was associated with the intracellular expression of HBHA-induced perforin. Surprisingly, the perforin-producing CD8(+) T lymphocytes were distinct from the IFN- gamma -producing CD8(+) T lymphocytes. CONCLUSION: During latent TB, the HBHA-specific CD8(+) T lymphocyte population expresses all 3 effector functions associated with CD8(+) T lymphocyte-mediated protective immune mechanisms, which supports the notion that HBHA may be protective in humans and suggests that markers of HBHA-specific CD8(+) T lymphocyte responses may be useful in the monitoring of protection.

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment

The paper considers the single machine due date assignment and scheduling problems with n jobs in which the due dates are to be obtained from the processing times by adding a positive slack q. A schedule is feasible if there are no tardy jobs and the job sequence respects given precedence constraints. The value of q is chosen so as to minimize a function ϕ(F,q) which is non-decreasing in each of its arguments, where F is a certain non-decreasing earliness penalty function. Once q is chosen or fixed, the corresponding scheduling problem is to find a feasible schedule with the minimum value of function F. In the case of arbitrary precedence constraints the problems under consideration are shown to be NP-hard in the strong sense even for F being total earliness. If the precedence constraints are defined by a series-parallel graph, both scheduling and due date assignment problems are proved solvable in time, provided that F is either the sum of linear functions or the sum of exponential functions. The running time of the algorithms can be reduced to if the jobs are independent. Scope and purpose We consider the single machine due date assignment and scheduling problems and design fast algorithms for their solution under a wide range of assumptions. The problems under consideration arise in production planning when the management is faced with a problem of setting the realistic due dates for a number of orders. The due dates of the orders are determined by increasing the time needed for their fulfillment by a common positive slack. If the slack is set to be large enough, the due dates can be easily maintained, thereby producing a good image of the firm. This, however, may result in the substantial holding cost of the finished products before they are brought to the customer. The objective is to explore the trade-off between the size of the slack and the arising holding costs for the early orders.

A polynomial algorithm for the three-machine open shop with a bottleneck machine

The paper considers the three‐machine open shop scheduling problem to minimize themakespan. It is assumed that each job consists of at most two operations, one of which is tobe processed on the bottleneck machine, the same for all jobs. A new lower bound on theoptimal makespan is derived, and a linear‐time algorithm for finding an optimalnon‐preemptive schedule is presented.

Stochastic comparability and dual q-functions

In this paper we discuss the relationship and characterization of stochastic comparability, duality, and Feller–Reuter–Riley transition functions which are closely linked with each other for continuous time Markov chains. A necessary and sufficient condition for two Feller minimal transition functions to be stochastically comparable is given in terms of their density q-matrices only. Moreover, a necessary and sufficient condition under which a transition function is a dual for some stochastically monotone q-function is given in terms of, again, its density q-matrix. Finally, for a class of q-matrices, the necessary and sufficient condition for a transition function to be a Feller–Reuter–Riley transition function is also given.

Applications of Feller-Reuter-Riley transition functions

A Feller–Reuter–Riley function is a Markov transition function whose corresponding semigroup maps the set of the real-valued continuous functions vanishing at infinity into itself. The aim of this paper is to investigate applications of such functions in the dual problem, Markov branching processes, and the Williams-matrix. The remarkable property of a Feller–Reuter–Riley function is that it is a Feller minimal transition function with a stable q-matrix. By using this property we are able to prove that, in the theory of branching processes, the branching property is equivalent to the requirement that the corresponding transition function satisfies the Kolmogorov forward equations associated with a stable q-matrix. It follows that the probabilistic definition and the analytic definition for Markov branching processes are actually equivalent. Also, by using this property, together with the Resolvent Decomposition Theorem, a simple analytical proof of the Williams' existence theorem with respect to the Williams-matrix is obtained. The close link between the dual problem and the Feller–Reuter–Riley transition functions is revealed. It enables us to prove that a dual transition function must satisfy the Kolmogorov forward equations. A necessary and sufficient condition for a dual transition function satisfying the Kolmogorov backward equations is also provided.

Strong ergodicity of monotone transition functions

By revealing close links among strong ergodicity, monotone, and the Feller–Reuter–Riley (FRR) transition functions, we prove that a monotone ergodic transition function is strongly ergodic if and only if it is not FRR. An easy to check criterion for a Feller minimal monotone chain to be strongly ergodic is then obtained. We further prove that a non-minimal ergodic monotone chain is always strongly ergodic. The applications of our results are illustrated using birth-and-death processes and branching processes.

Feller transition functions, Resolvent Decomposition Theorems, and their application in unstable denumerable Markov processes

This paper surveys the recent progresses made in the field of unstable denumerable Markov processes. Emphases are laid upon methodology and applications. The important tools of Feller transition functions and Resolvent Decomposition Theorems are highlighted. Their applications particularly in unstable denumerable Markov processes with a single instantaneous state and Markov branching processes are illustrated.

A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date

We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal. The FPTAS is obtained by converting an especially designed pseudopolynomial dynamic programming algorithm.

Schedules with due-date assignment and position-dependent processing times

Single machine scheduling problems are considered, in which the processing of jobs depend on positions of the jobs in a schedule and the due-dates are assigned either according to the CON rule (a due-date common to all jobs is chosen) or according to the SLK rule (the due-dates are computed by increasing the actual processing times of each job by a slack, common to all jobs). Polynomial-time dynamic programming algorithms are proposed for the problems with the objective functions that include the cost of assigning the due-dates, the total cost of disgarded jobs (which are not scheduled) and, possibly, the total earliness of the scheduled jobs.

Single machine scheduling and due date assignment with positionally dependent processing times

We consider single machine scheduling and due date assignment problems in which the processing time of a job depends on its position in a processing sequence. The objective functions include the cost of changing the due dates, the total cost of discarded jobs that cannot be completed by their due dates and, possibly, the total earliness of the scheduled jobs. We present polynomial-time dynamic programming algorithms in the case of two popular due date assignment methods: CON and SLK. The considered problems are related to mathematical models of cooperation between the manufacturer and the customer in supply chain scheduling.

Hemolymph Functions In Mytilus-Californianus - Cytochemistry Of Hemocytes And Their Responses To Foreign Implants And Hemolymph Factors In Phagocytosis

The hemocytes of Mytilus californianus are of three types: small and large basophils and large granular acidophils. The basophils contain lysosomal enzymes and phagocytose colloidal carbon. Agglutinins for yeast and human A Rh+ve erythrocytes are present in plasma, but are not needed for effective phagocytosis; in vitro both acidophilic and basophilic hemocytes rapidly phagocytose these particles. Plasma proteins, analyzed electrophoretically, are under strong homeostatic control. When Mya arenaria mantle is placed orthotopically on M. californianus mantle, the implant is invaded by host hemocytes in a manner consistent with that described in other published reports on molluscan graft rejection. Steady state is achieved by 26 days postimplant. Second- and third-set implants are rejected more rapidly than are first-set implants, but this is not a specific response. Third-set implants elicit a host cellular response that is more localized than the response to first-set implants. These data do not permit conclusions with respect to memory in these molluscan immune responses, but do imply a qualitative “improvement” in this quasi-immune response of M. californianus.