Dynamic Traveling Repair Problem with an Arbitrary Time Window

An Efficient Format for Nearly Constant-Time Access to Arbitrary Time Intervals in Large Trace Files

Scientific Programming ◽

10.1155/2008/749874 ◽

2008 ◽

Vol 16 (2-3) ◽

pp. 155-165 ◽

Cited By ~ 26

Author(s):

Anthony Chan ◽

William Gropp ◽

Ewing Lusk

Keyword(s):

Time Window ◽

Parallel Applications ◽

File Format ◽

Time Intervals ◽

Total Size ◽

Trace File ◽

Arbitrary Time ◽

Other Information ◽

Separate File ◽

The Cost

A powerful method to aid in understanding the performance of parallel applications uses log or trace files containing time-stamped events and states (pairs of events). These trace files can be very large, often hundreds or even thousands of megabytes. Because of the cost of accessing and displaying such files, other methods are often used that reduce the size of the tracefiles at the cost of sacrificing detail or other information. This paper describes a hierarchical trace file format that provides for display of an arbitrary time window in a time independent of the total size of the file and roughly proportional to the number of events within the time window. This format eliminates the need to sacrifice data to achieve a smaller trace file size (since storage is inexpensive, it is necessary only to make efficient use of bandwidth to that storage). The format can be used to organize a trace file or to create a separate file ofannotationsthat may be used with conventional trace files. We present an analysis of the time to access all of the events relevant to an interval of time and we describe experiments demonstrating the performance of this file format.

Download Full-text

Feel Thine Own Self – Mood Congruency Evaluation of Emotional State Adjectives

Journal of Psychophysiology ◽

10.1027/0269-8803/a000272 ◽

2020 ◽

pp. 1-17

Author(s):

Szczepan J. Grzybowski ◽

Miroslaw Wyczesany ◽

Jan Kaiser

Keyword(s):

Mood Induction ◽

Semantic Analysis ◽

Emotional State ◽

Time Window ◽

Event Related Potential ◽

Negativity Bias ◽

Positive Potential ◽

Semantic Access ◽

Current Mood ◽

Component Time

Abstract. The goal of the study was to explore event-related potential (ERP) differences during the processing of emotional adjectives that were evaluated as congruent or incongruent with the current mood. We hypothesized that the first effects of congruence evaluation would be evidenced during the earliest stages of semantic analysis. Sixty mood adjectives were presented separately for 1,000 ms each during two sessions of mood induction. After each presentation, participants evaluated to what extent the word described their mood. The results pointed to incongruence marking of adjective’s meaning with current mood during early attention orientation and semantic access stages (the P150 component time window). This was followed by enhanced processing of congruent words at later stages. As a secondary goal the study also explored word valence effects and their relation to congruence evaluation. In this regard, no significant effects were observed on the ERPs; however, a negativity bias (enhanced responses to negative adjectives) was noted on the behavioral data (RTs), which could correspond to the small differences traced on the late positive potential.

Download Full-text

Time Window from Visual Images to Visual Short-Term Memory: Consolidation or Integration?

Experimental Psychology (formerly Zeitschrift für Experimentelle Psychologie) ◽

10.1027/1618-3169.51.1.45 ◽

2004 ◽

Vol 51 (1) ◽

pp. 45-51 ◽

Cited By ~ 21

Author(s):

Yuhong Jiang

Keyword(s):

Short Term Memory ◽

Time Window ◽

Short Interval ◽

Visual Images ◽

Short Term ◽

Temporal Window ◽

Term Memory ◽

Visual Short Term Memory ◽

Probe Task ◽

Long Time

Abstract. When two dot arrays are briefly presented, separated by a short interval of time, visual short-term memory of the first array is disrupted if the interval between arrays is shorter than 1300-1500 ms ( Brockmole, Wang, & Irwin, 2002 ). Here we investigated whether such a time window was triggered by the necessity to integrate arrays. Using a probe task we removed the need for integration but retained the requirement to represent the images. We found that a long time window was needed for performance to reach asymptote even when integration across images was not required. Furthermore, such window was lengthened if subjects had to remember the locations of the second array, but not if they only conducted a visual search among it. We suggest that a temporal window is required for consolidation of the first array, which is vulnerable to disruption by subsequent images that also need to be memorized.

Download Full-text