Relevant bibliographies by topics / Time window

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Time window'

Author: Grafiati
Published: 4 June 2021
Last updated: 3 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Time window.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Time window"

1

Heintzel, Alexander. "Time Window." MTZ worldwide 76, no. 12 (November 2015): 3. http://dx.doi.org/10.1007/s38313-015-0075-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Heintzel, Alexander. "Time Window." ATZ worldwide 117, no. 12 (November 28, 2015): 3. http://dx.doi.org/10.1007/s38311-015-0080-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Szyper, M. "Time domain window." Electronics Letters 31, no. 9 (1995): 707. http://dx.doi.org/10.1049/el:19950494.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hoogeboom, Maaike, Yossiri Adulyasak, Wout Dullaert, and Patrick Jaillet. "The Robust Vehicle Routing Problem with Time Window Assignments." Transportation Science 55, no. 2 (March 2021): 395–413. http://dx.doi.org/10.1287/trsc.2020.1013.

Full text
Abstract:
In practice, there are several applications in which logistics service providers determine the service time windows at the customers, for example, in parcel delivery, retail, and repair services. These companies face uncertain travel times and service times that have to be taken into account when determining the time windows and routes prior to departure. The objective of the proposed robust vehicle routing problem with time window assignments (RVRP-TWA) is to simultaneously determine routes and time window assignments such that the expected travel time and the risk of violating the time windows are minimized. We assume that the travel time probability distributions are not completely known but that some statistics, such as the mean, minimum, and maximum, can be estimated. We extend the robust framework based on the requirements’ violation index, which was originally developed for the case where the specific requirements (time windows) are given as inputs, to the case where they are also part of the decisions. The subproblem of finding the optimal time window assignment for the customers in a given route is shown to be convex, and the subgradients can be derived. The RVRP-TWA is solved by iteratively generating subgradient cuts from the subproblem that are added in a branch-and-cut fashion. Experiments address the performance of the proposed solution approach and examine the trade-off between expected travel time and risk of violating the time windows.
APA, Harvard, Vancouver, ISO, and other styles
5

Fu, Fengjie, Dongfang Ma, Dianhai Wang, and Wei Qian. "An Optimization Method of Time Window Based on Travel Time and Reliability." Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/921480.

Full text
Abstract:
The dynamic change of urban road travel time was analyzed using video image detector data, and it showed cyclic variation, so the signal cycle length at the upstream intersection was conducted as the basic unit of time window; there was some evidence of bimodality in the actual travel time distributions; therefore, the fitting parameters of the travel time bimodal distribution were estimated using the EM algorithm. Then the weighted average value of the two means was indicated as the travel time estimation value, and the Modified Buffer Time Index (MBIT) was expressed as travel time variability; based on the characteristics of travel time change and MBIT along with different time windows, the time window was optimized dynamically for minimum MBIT, requiring that the travel time change be lower than the threshold value and traffic incidents can be detected real time; finally, travel times on Shandong Road in Qingdao were estimated every 10 s, 120 s, optimal time windows, and 480 s and the comparisons demonstrated that travel time estimation in optimal time windows can exactly and steadily reflect the real-time traffic. It verifies the effectiveness of the optimization method.
APA, Harvard, Vancouver, ISO, and other styles
6

van Leyen, Klaus, Xiaoying Wang, Magdy Selim, and Eng H. Lo. "Opening the time window." Journal of Cerebral Blood Flow & Metabolism 39, no. 12 (October 14, 2019): 2539–40. http://dx.doi.org/10.1177/0271678x19882782.

Full text
Abstract:
The recently completed EXTEND trial tested the idea that tissue plasminogen activator thrombolysis can be safely extended up to 9 h after stroke onset if automated perfusion imaging indicates the presence of a salvageable penumbra. This important trial contributes to an ongoing paradigm shift for stroke therapy. Combined with the introduction of endovascular therapy, image-guided patient selection is expanding the toolbox of the stroke practitioner. At the same time, pushing the limits of reperfusion has raised important questions about mechanisms to pursue for combination therapy as well as potential approaches to mitigate side effects and optimize treatments for patients with various co-morbidities.
APA, Harvard, Vancouver, ISO, and other styles
7

Vasile, Cristian-Ioan, Derya Aksaray, and Calin Belta. "Time window temporal logic." Theoretical Computer Science 691 (August 2017): 27–54. http://dx.doi.org/10.1016/j.tcs.2017.07.012.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Morowitz, Harold J. "A Window in Time." Hospital Practice 24, no. 6 (June 15, 1989): 279–80. http://dx.doi.org/10.1080/21548331.1989.11703738.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ďurica, Pavol, Mária Ďuriníková, Ján Rybárik, and Daniela Štaffenová. "Long Time Testing of Temperature Parameters in Selected Windows." Advanced Materials Research 855 (December 2013): 81–84. http://dx.doi.org/10.4028/www.scientific.net/amr.855.81.

Full text
Abstract:
The article presents the partial knowledge of the area of building physics. The goal is to evaluate the measured data of the temperatures of three window constructions from different material and glass systems. The measurements are made at different places of window friezes and glazing and they run continuously throughout the year. These windows are suitable for low-energy buildings.
APA, Harvard, Vancouver, ISO, and other styles
10

Gürsakal, Necmi, Fırat Melih Yilmaz, and Erginbay Uğurlu:. "Finding opportunity windows in time series data using the sliding window technique: The case of stock exchanges." Econometrics 24, no. 3 (2020): 1–19. http://dx.doi.org/10.15611/eada.2020.3.01.

Full text
Abstract:
Data have shapes, and human intelligence and perception have to classify the forms of data to understand and interpret them. This article uses a sliding window technique and the main aim is to answer two questions. Is there an opportunity window in time series of stock exchange index? The second question is how to find a way to use the opportunity window if there is one. The authors defined the term opportunity window as a window that is generated in the sliding window technique and can be used for forecasting. In analysis, the study determined the different frequencies and explained how to evaluate opportunity windows embedded using time series data for the S&P 500, the DJIA, and the Russell 2000 indices. As a result, for the S&P 500 the last days of the patterns 0111, 1100, 0011; for the DJIA the last days of the patterns 0101, 1001, 0011; and finally for the Russell 2000, the last days of the patterns 0100, 1001, 1100 are opportunity windows for prediction
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Time window"

1

FIALLOS, HUETE ANTONIO JOSE. "Adative correlation time window." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-121290.

Full text
Abstract:
Event correlation plays a key role in network management. It is the ability in networkmanagement systems to co-relate events by reading into event attributes and extractingmeaningful information that has value to network operators. It is a conceptual interpretation ofmultiple events such that a new meaning is assigned to these events. This interpretation is usedto pinpoint the events that are behind a root cause incident. The root cause could be a faultynode or an underperforming link. Understanding correlation patterns can potentially helpidentify and localize the root cause of a problem in a network so that network operators takenecessary actions to issue restoration operations. An important technique used by event correlators is temporal correlation of events,whereby events closely related in time with each other are correlated. This technique uses acorrelation time window as an interval in time to capture and correlate events. Traditionally,event correlators have used a fixed-sized correlation time window to perform event correlationin which the size of the correlation time window is fixed. However, this does not scale properlyin modern networks where dynamic relationships are commonplace. To address this issue, thisthesis presents and discusses the idea of an adaptive correlation time window, whereby thewindow size is dynamically calculated based on observable network conditions and processingtimes. The aim of the investigation is to explore the performance of an adaptive window inseveral network scenarios and, more importantly, to compare both types of windows in termsof their performance. To do this, several experiments were designed and performed on avirtualized network test bed. The results of such experiments demonstrate that the adaptivecorrelation time window adequately adapts to varying network conditions. The investigationalso shows the conditions that need to be fulfilled in order to observe a better performance ofeither type of window.
APA, Harvard, Vancouver, ISO, and other styles
2

Chang, Chia-We. "Continuous Shortest Path Problems with Time Window Constraints." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/mq24104.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Haddara, A. A. "MUITS : a multi-window for Time-sharing Systems." Thesis, University of Nottingham, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.305351.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aleu, Bonaut Aitziber. "Stentriever thrombectomy for stroke within and beyond the time window." Doctoral thesis, Universitat Autònoma de Barcelona, 2016. http://hdl.handle.net/10803/393973.

Full text
Abstract:
Recientemente se ha aprobado el tratamiento endovascular(TEV) para el ictus por oclusión de gran vaso, lo cual ha cambiado radicalmente el pronóstico infausto de estos pacientes. Una de las contraindicaciones para el TEV es que el paciente llegue más alá de la ventana terapéutica (VT), que tradicionalmente era de 8 horas y actualmente es de 6 horas. La VT se define como el tiempo transcurrido desde el inicio de los síntomas hasta la punción femoral. En pacientes en quienes el inicio del ictus es desconocido, bien porque ocurrió durante el sueño o bien porque el paciente no puede decirlo y no había testigos, la hora de inicio se considera la última vez que el paciente fue visto bien. Estos pacientes caen fuera de VT porque llegan demasiado tarde para ser tratados. Otros pacientes que quedan fuera de VT, son aquellos que tienen una hora de inicio conocida pero que llegan tarde al hospital. Sin embargo, existen evidencias crecientes que la velocidad a la que progresa la isquemia tras una oclusión arterial, varia notablemente entre individuos. Así, mientras que en unos pacientes el territorio arterial está infartado en 6 horas, en otro puede que el infarto no esté establecido hasta las 10 horas. Este concepto choca con el enfoque actual de tratamiento basado en el tiempo, que establece que un paciente se trate en función del tiempo desde el inicio siempre que no haya un gran área infartada. En enfoque basado en la viabilidad del tejido ignora la hora de inicio del ictus. Así para tratar o no a un paciente, se realiza una neuroimagen para confirmar que hay tejido viable, si es así, se realiza el TEV independientemente del tiempo transcurrido. Hay estudios randomizados en marcha para demostrar esta hipótesis, y se han publicado estudios concluyendo que la seguridad y el buen pronostico es similar en pacientes fuera y dentro de ventana. Sin embargo, la mayoría de dichos estudios fueron realizados con dispositivos de primera generación, y algunos reportan pacientes de circulación anterior y posterior. Los stentrievers(ST), dispositivos de nueva generación han demostrado mayores tasas de recanalización y buen pronostico, de hecho las guías actuales recomiendan el TEV con ST. El objetivo primario de esta tesis fue comparar la seguridad y pronóstico de pacientes con ictus de circulación anterior fuera de ventana, tratados mediante TEV con ST, con los pacientes dentro de ventana(WTW). De un total de 468 pacientes 292(63.4%) estaban fuera de ventana(OTW) y 176(37.6%) dentro de ventana. El grupo fuera de ventana, se dividió en dos subgrupos de acuerdo a la hora de inicio: desconocida (UKO) in 113 (24.1%)pacientes y conocida con presentación tardía (KO-LP) en 63(13.5%) pacientes. Estos subgrupos no se pudieron agrupar en el grupo OTW porque un análisis estadístico previo mostró que no eran comparables. Por tanto, los resultados de estos pacientes se presentan de modo separado y comparados con pacientes dentro de ventana. No se encontraron diferencias significativas en buen pronóstico a 3 meses, con 49% en WTW, 42.2%% en UKO y 37.3% en KO-LP. Respecto a la seguridad, tampoco se encontraron diferencias en hemorragia intracraneal sintomática (6.2%WTW, 2.7%UKO y 9.5%KO-LP). Estos hallazgos apoyan el enfoque de viabilidad tisular en vez del basado en tiempo, en pacientes con ictus de circulación anterior tratados con EVT y ST, y seleccionados por neuroimagen, hasta que estén disponibles los resultados de los estudios randomizados. De ser positivos, uno de cada 3 pacientes que normalmente no se tratan por estar fuera de la VT podría ser tratado según nuestro estudio.
Endovascular therapy (EVT) for stroke due to large vessel occlusion has been recently approved, changing dramatically the outcome of these patients, who otherwise would have a dismal outcome. However, there are patients automatically excluded from EVT because they arrive beyond the therapeutic time window. Traditionally, the time window (TW) for EVT has been 8 hours but the recent guidelines shortened the window to 6 hours. The TW is defined as the time from symptom onset to the time of groin puncture. In patients in whom the stroke onset is unclear either because the stroke occurred while sleeping or because the patient is unable to tell the onset because is aphasic on unconscious, and no witness is available, the onset is considered the last time the patient was seen normal. These patients often fall outside the window (OTW), because are too late to be treated. Other patients that are too late to be treated are those who, despite having a clear time of onset, arrive OTW. However, there is growing evidence showing that the speed at which the ischemia evolves after an arterial occlusion, varies significantly among individuals. Thus, while in some patients the arterial territory is infarcted in 6 hours, in other, the infarct might not be established after 10 hours. This concept radically challenges the current time-based approach, which establishes whether a patient should be treated or not based on the time from onset provided there is not a large area of infarcted tissue. Interestingly, the tissue-based approach disregards the time from onset. Consequently, the criteria to decide whether to treat a patient or not, would be to image the brain to find out if there is viable tissue, if so, treatment should be carried forward irrespective of the time since stroke onset. There are ongoing trials to prove this hypothesis, and non-controlled studies have been published showing that patients treated OTW have comparable safety and favorable outcomes than those treated within the window. However, those studies were performed with first generation devices and some refer to anterior and posterior circulation strokes. Regarding new generation strategies, stentrievers (ST) have demonstrated higher rates of recanalization and better outcomes. Current guidelines recommend the use of ST. The primary aim of this work was to compare the outcomes and safety of patients OTW with stroke due to anterior circulation (AC) occlusion treated with EVT with ST and selected by neuroimaging with the safety and outcomes of patients WTW. From a total of 468 patients, 292(63.4%) were patients WTW and 176 (37.6%)OTW. The group OTW was divided in two subgroups according to onset: unknown time of onset (UKO) in 113 (24.1%) patients and known onset but late presenters (KO-LP) in 63 (13.5%) patients. These subgroups could not be merged because p statistical analysis showed that they were not comparable, thus, the results had to be presented separately and compared with the WTW group. Regarding outcome, there were no significant differences good outcome at 3 months, with rates of 49% in WTW, 42.2%% in UKO and 37.3% in KO-LP. Regarding safety, there were no significant differences in symptomatic intracranial hemorrhage across groups (6.2%WTW, 2.7%UKO y 9.5%KO-LP). These findings support the tissue- based approach in patients with stroke due to AC occlusion treated with EVT using ST, and selected by neuroimaging, until the results of the randomized trials arrive. According to our study, a positive result would have a great impact on at least, one out of three patients that arrive OTW and are currently left untreated.
APA, Harvard, Vancouver, ISO, and other styles
5

Kodukula, Surya Ravikiran. "An Adaptive Time Window Algorithm for Large Scale Network Emulation." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/31160.

Full text
Abstract:
With the continuing growth of the Internet and network protocols, there is a need for Protocol Development Environments. Simulation environments like ns and OPNET require protocol code to be rewritten in a discrete event model. Direct Code Execution Environments (DCEE) solve the Verification and Validation problems by supporting the execution of unmodified protocol code in a controlled environment. Open Network Emulator (ONE) is a system supporting Direct Code Execution in a parallel environment - allowing unmodified protocol code to run on top of a parallel simulation layer, capable of simulating complex network topologies. Traditional approaches to the problem of Parallel Discrete Event Simulation (PDES) broadly fall into two categories. Conservative approaches allow processing of events only after it has been asserted that the event handling would not result in a causality error. Optimistic approaches allow for causality errors and support means of restoring state â i.e., rollback. All standard approaches to the problem of PDES are either flawed by their assumption of existing event patterns in the system or cannot be applied to ONE due to their restricted analysis on simplified models like queues and Petri-nets. The Adaptive Time Window algorithm is a bounded optimistic parallel simulation algorithm with the capability to change the degree of optimism with changes in the degree of causality in the network. The optimism at any instant is bounded by the amount of virtual time called the time window. The algorithm assumes efficient rollback capabilities supported by the â Weavesâ framework. The algorithm is reactive and responds to changes in the degree of causality in the system by adjusting the length of its time window. With sufficient history gathered the algorithm adjusts to the increasing causality in the system with a small time window (conservative approach) and increases to a higher value (optimistic approach) during idle periods. The problem of splitting the entire simulation run into time windows of arbitrary length, whereby the total number of rollbacks in the system is minimal, is NP-complete. The Adaptive Time Window algorithm is compared against offline greedy approaches to the NP-complete problem called Oracle Computations. The total number of rollbacks in the system and the total execution time for the Adaptive Time Window algorithm were comparable to the ones for Oracle Computations.
Master of Science
APA, Harvard, Vancouver, ISO, and other styles
6

Chee, Chong Hin. "Totally-self-checking balance checkers and window comparators." Thesis, University of Hull, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.389293.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Li, Chuhe. "A sliding window BIRCH algorithm with performance evaluations." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-32397.

Full text
Abstract:
An increasing number of applications covered various fields generate transactional data or other time-stamped data which all belongs to time series data. Time series data mining is a popular topic in the data mining field, it introduces some challenges to improve accuracy and efficiency of algorithms for time series data. Time series data are dynamical, large-scale and high complexity, which makes it difficult to discover patterns among time series data with common methods suitable for static data. One of hierarchical-based clustering methods called BIRCH was proposed and employed for addressing the problems of large datasets. It minimizes the costs of I/O and time. A CF tree is generated during its working process and clusters are generated after four phases of the whole BIRCH procedure. A drawback of BIRCH is that it is not very scalable. This thesis is devoted to improve accuracy and efficiency of BIRCH algorithm. A sliding window BIRCH algorithm is implemented on the basis of BIRCH algorithm. At the end of thesis, the accuracy and efficiency of sliding window BIRCH are evaluated. A performance comparison among SW BIRCH, BIRCH and K-means are also presented with Silhouette Coefficient index and Calinski-Harabaz Index. The preliminary results indicate that the SW BIRCH may achieve a better performance than BIRCH in some cases.
APA, Harvard, Vancouver, ISO, and other styles
8

Ali, Abukar. "Time window of TNF-a in innate immunity against staphylococcal infection." Thesis, Högskolan i Skövde, Institutionen för vård och natur, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-4897.

Full text
Abstract:
Staphylococcus aureus (S. aureus) is responsible for many human diseases including septic arthritis and sepsis shock. Tumor necrosis factor alpha (TNF-α) is a pro-inflammatory cytokine involved in inflammation and produced mainly by macrophages and monocytes. It is believed to be involved in pathogenesis of septic arthritis. Time window of TNF-a in innate immunity against staphylococcal infection was studied in this project. Two experiments were carried out: In the first experiment mice were infected with a low dose (8x106cfu/mouse) of S. aureus to induce septic arthritis whereas in the second experiment the mice were infected with a higher dose (8x107cfu/mouse) of S. aureus to induce sepsis shock. All mice were divided into three groups. The first group was treated with anti-TNF-α 20 minutes after infection. The second group was treated with the anti-TNF-α three days after infection. The third group served as control and was injected with PBS instead of anti-TNF-α. The mice were regularly weighed and signs of arthritis and mortality were recorded. Two weeks after inoculation bacteria viable counts in different organs was done, as well as histopathological assessment of joints and measurement of cytokines in blood. We have observed that mice treated with anti-TNF-α had less severe arthritis and also less mortality. However, they had more bacteria accumulated in the kidneys and lost more weight compared to the control group. The results were mostly seen in the group early treated with TNF-α, compared to the late treated group. We conclude that anti-TNF-α might be potentially used as a therapy against septic arthritis and sepsis shock. This should be combined with antibiotics to eliminate the bacteria while the anti-TNF-α reduces the severity of the inflammation and thus reduce the risk of permanent joint destruction and mortality. We can conclude that blocking TNF-α early on is essential in order to get the best results.
APA, Harvard, Vancouver, ISO, and other styles
9

Shipp, Abbie J. Edwards Jeffrey R. "The moving window of fit extending person-environment fit research with time /." Chapel Hill, N.C. : University of North Carolina at Chapel Hill, 2006. http://dc.lib.unc.edu/u?/etd,370.

Full text
Abstract:
Thesis (Ph. D.)--University of North Carolina at Chapel Hill, 2006.
Title from electronic title page (viewed Oct. 10, 2007). "... in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Kenan- Flagler Business School (Organizational Behavior and Strategy)." Discipline: Business Administration; Department/School: Business School, Kenan-Flagler.
APA, Harvard, Vancouver, ISO, and other styles
10

El-Nashar, Ahmed. "Multi-Vehicle Dispatching and Routing with Time Window Constraints and Limited Dock Capacity." Doctoral diss., University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/5197.

Full text
Abstract:
The Vehicle Routing Problem with Time Windows (VRPTW) is an important and computationally hard optimization problem frequently encountered in Scheduling and logistics. The Vehicle Routing Problem (VRP) can be described as the problem of designing the most efficient and economical routes from one depot to a set of customers using a limited number of vehicles. This research addresses the VRPTW under the following additional complicating features that are often encountered in practical problems: 1. Customers have strict time windows for receiving a vehicle, i.e., vehicles are not allowed to arrive at the customer's location earlier than the lower limit of the specified time window, which is relaxed in previous research work. 2. There is a limited number of loading/unloading docks for dispatching/receiving the vehicles at the depot The main goal of this research is to propose a framework for solving the VRPTW with the constraints stated above by generating near-optimal routes for the vehicles so as to minimize the total traveling distance. First, the proposed framework clusters customers into groups based on their proximity to each other. Second, a Probabilistic Route Generation (PRG) algorithm is applied to each cluster to find the best route for visiting customers by each vehicle; multiple routes per vehicle are generated and each route is associated with a set of feasible dispatching times from the depot. Third, an assignment problem formulation determines the best dispatching time and route for each vehicle that minimizes the total traveling distance. iii The proposed algorithm is tested on a set of benchmark problems that were originally developed by Marius M. Solomon and the results indicate that the algorithm works well with about 1.14% average deviation from the best-known solutions. The benchmark problems are then modified by adjusting some of the customer time window limits, and adding the staggered vehicle dispatching constraint. For demonstration purposes, the proposed clustering and PRG algorithms are then applied to the modified benchmark problems.
Ph.D.
Doctorate
Industrial Engineering and Management Systems
Engineering and Computer Science
Industrial Engineering
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Time window"

1

Gove, Reginald M. Through the window of time. London: Minerva Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weinberg, Karen. Window of time: A story. Shippensburg, Pa: White Mane Pub. Co., 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Elizabeth, Goudge. The middle window. White Plains [N.Y.]: Aeon Pub. Co., 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Footprints at the window. New York: Aladdin Paperbacks, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Carr, Meghan. Back through a window of time. [Fairhaven, Mass.]: Vining Press, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

McAllister, Margaret. Hold My Hand and Run. New York: Dutton Children's Books, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

McAllister, Margaret. Hold My Hand and Run. New York: Dutton Children's Books, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

McAllister, Margaret. Ghost at the window. Oxford: Oxford University Press, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Window of time: A novel of suspense. Bloomington, In: iUniverse Inc, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tim, McNulty, and Grand Canyon Natural History Association., eds. Grand Canyon National Park: Window on the river of time. San Rafael, Calif: Woodlands Press in conjunction with Grand Canyon Natural History Association, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Time window"

1

Kido, Ken’iti. "Time Window." In Undergraduate Lecture Notes in Physics, 153–81. New York, NY: Springer New York, 2014. http://dx.doi.org/10.1007/978-1-4614-9260-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Weik, Martin H. "time window." In Computer Science and Communications Dictionary, 1792. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_19685.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Weik, Martin H. "response-time window." In Computer Science and Communications Dictionary, 1483. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_16257.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Florence, Namulundah. "A Window of Time." In Immigrant Teachers, American Students, 149–66. New York: Palgrave Macmillan US, 2011. http://dx.doi.org/10.1057/9780230116306_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chang, Chein-I. "Multiple Window Anomaly Detection." In Real-Time Progressive Hyperspectral Image Processing, 547–76. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4419-6187-7_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Chen, Liming, and Chris D. Nugent. "Time-Window Based Data Segmentation." In Human Activity Recognition and Behaviour Analysis, 103–26. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-19408-6_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gröchenig, Karlheinz. "Window Design and Wiener’s Lemma." In Foundations of Time-Frequency Analysis, 277–99. Boston, MA: Birkhäuser Boston, 2001. http://dx.doi.org/10.1007/978-1-4612-0003-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kim, Hyeon Gyu. "Idle-Time Processing in Time-Slide Window Join." In Lecture Notes in Electrical Engineering, 397–403. Berlin, Heidelberg: Springer Berlin Heidelberg, 2015. http://dx.doi.org/10.1007/978-3-662-47895-0_48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Simchi-Levi, David, Xin Chen, and Julien Bramel. "The VRP with Time-Window Constraints." In The Logic of Logistics, 341–57. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-9149-1_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bramel, Julien, and David Simchi-Levi. "The VRP with Time Window Constraints." In The Logic of Logistics, 107–23. New York, NY: Springer New York, 1997. http://dx.doi.org/10.1007/978-1-4684-9309-2_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Time window"

1

Vojtech, Josef, Vladimir Smotlacha, Sarbojeet Bhowmick, Ondrej Havlis, Martin Slapak, Rudolf Vohnout, Petr Munster, et al. "Alternative Spectral Window for Precise Time Fibre Based Transport." In 51st Annual Precise Time and Time Interval Systems and Applications Meeting. Institute of Navigation, 2020. http://dx.doi.org/10.33012/2020.17313.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Williams, William J., and Selin Aviyente. "Minimal-window time-frequency distributions." In SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, edited by Franklin T. Luk. SPIE, 1999. http://dx.doi.org/10.1117/12.367661.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bausk, E., and R. Taziev. "Scanning window method for SPUDT optimization." In 18th European Frequency and Time Forum (EFTF 2004). IEE, 2004. http://dx.doi.org/10.1049/cp:20040857.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bayram, Metin, and Richard G. Baraniuk. "Multiple window time-frequency and time-scale analysis." In SPIE's 1996 International Symposium on Optical Science, Engineering, and Instrumentation, edited by Franklin T. Luk. SPIE, 1996. http://dx.doi.org/10.1117/12.255431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ma, Hui-Fang. "Hot topic extraction using time window." In 2011 International Conference on Machine Learning and Cybernetics (ICMLC). IEEE, 2011. http://dx.doi.org/10.1109/icmlc.2011.6016664.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

TU, Gang, Jun-lin LI, Fu-min YANG, and Wei LUO. "Relationships between Window-based Real-time Constraints." In 2007 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications. IEEE, 2007. http://dx.doi.org/10.1109/rtcsa.2007.62.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Manica, Nicola, Luca Abeni, and Luigi Palopoli. "QoS Support in the X11 Window System." In 2008 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, 2008. http://dx.doi.org/10.1109/rtas.2008.20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hargrave, Chad, I. Vaughan, L. Clarkson, and Hoi-Shun Lui. "Late-time resonance window estimation in radar." In 2013 7th International Conference on Signal Processing and Communication Systems (ICSPCS). IEEE, 2013. http://dx.doi.org/10.1109/icspcs.2013.6723933.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Li, Lei, Farzad Noorian, Duncan J. M. Moss, and Philip H. W. Leong. "Rolling window time series prediction using MapReduce." In 2014 IEEE International Conference on Information Reuse and Integration (IRI). IEEE, 2014. http://dx.doi.org/10.1109/iri.2014.7051965.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Cole, Richard, Dennis Shasha, and Xiaojian Zhao. "Fast window correlations over uncooperative time series." In Proceeding of the eleventh ACM SIGKDD international conference. New York, New York, USA: ACM Press, 2005. http://dx.doi.org/10.1145/1081870.1081966.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Time window"

1

Fang, W., N. Seddigh, and B. Nandy. A Time Sliding Window Three Colour Marker (TSWTCM). RFC Editor, June 2000. http://dx.doi.org/10.17487/rfc2859.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Han, Keesook, Tao Zhang, and Qi Liao. Data Stream Mining Based Dynamic Link Anomaly Analysis Using Paired Sliding Time Window Data. Fort Belvoir, VA: Defense Technical Information Center, November 2014. http://dx.doi.org/10.21236/ada613504.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

George, Jacob, and Ronald A. Wagstaff. The Effects of Variable Time Window Width and Signal Position Within FFT Bin on WISPR Performance. Fort Belvoir, VA: Defense Technical Information Center, February 1996. http://dx.doi.org/10.21236/ada304893.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Krennrich, Frank. A Fast Topological Trigger for Real Time Analysis of Nanosecond Phenomena; Opening the Gamma Ray Window to Our Universe. Office of Scientific and Technical Information (OSTI), September 2013. http://dx.doi.org/10.2172/1093851.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ayoul-Guilmard, Q., S. Ganesh, M. Nuñez, R. Tosi, F. Nobile, R. Rossi, and C. Soriano. D5.4 Report on MLMC for time dependent problems. Scipedia, 2021. http://dx.doi.org/10.23967/exaqute.2021.2.005.

Full text
Abstract:
In this report, we study the use of Multi-Level Monte Carlo (MLMC) methods for time dependent problems. It was found that the usability of MLMC methods depends strongly on whether or not the underlying time dependent problem is chaotic in nature. Numerical experiments are conducted on both simple problems, as well as fluid flow problems of practical interest to the ExaQUte project, to demonstrate this. For the non-chaotic cases, the hypotheses that enable the use of MLMC methods were found to be satisfied. For the chaotic cases, especially the case of high Reynolds’ number fluid flow, the hypotheses were not satisfied. However, it was found that correlations between the different levels were high enough to merit the use of multi-fidelity or control-variate approaches. It was also noted that MLMC methods could work for chaotic problems if the time window of analysis were chosen to be small enough. Future studies are proposed to examine this possibility.
APA, Harvard, Vancouver, ISO, and other styles
6

Chetcuti, Pauline, Sarah Pelham, Mathew Truscott, and Fionna Smyth. Conflict in the Time of Coronavirus: Why a global ceasefire could offer a window of opportunity for inclusive, locally-led peace. Oxfam, May 2020. http://dx.doi.org/10.21201/2020.6058.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jones, Natalie, Miquel Muñoz Cabré, Georgia Piggot, and Michael Lazarus. Tapping the potential of NDCs and LT-LEDS to address fossil fuel production. Stockholm Environment Institute, June 2021. http://dx.doi.org/10.51414/sei2021.010.

Full text
Abstract:
The need for a managed transition away from fossil fuel production raises the question of whether and how countries are addressing this need in their national communications to the UN Framework Convention on Climate Change (UNFCCC). A previous 2019 analysis of the first round of nationally determined contributions (NDCs) and long-term, low-emissions development strategies (LT-LEDS) found that few countries discussed how they would address fossil fuel production as part of their climate mitigation activities. Here, we examine new and updated NDCs and LT-LEDS, finding a growing number of NDCs and LT-LEDS that address fossil fuel production as part of mitigation. For the first time, several countries incorporate policies and/ or pathways for a managed decline of fossil fuel production. In contrast, many others foresee continued or expanded fossil fuel production, with no mention of efforts to prepare for a transition. Opportunities remain for countries to make better use of NDCs and LT-LEDS to align fossil fuel production with the Paris Agreement, including by more comprehensively reflecting on the equity implications of their plans, as well as addressing how countries plan to diversify their economies, ensure a just transition for workers, and cooperate internationally on a managed wind-down of fossil fuel supply. As COP26 approaches, this window of opportunity is still open, but it is rapidly closing.
APA, Harvard, Vancouver, ISO, and other styles
8

Jenner, Kathy A. The U.S. Military's Role in Peace Operations: Time to Wash the Windows. Fort Belvoir, VA: Defense Technical Information Center, January 1998. http://dx.doi.org/10.21236/ada443577.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shang, C. C., M. Caplan, H. U. Nickel, and M. Thumm. Electrical analysis of wideband and distributed windows using time-dependent field codes. Office of Scientific and Technical Information (OSTI), September 1993. http://dx.doi.org/10.2172/10194778.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Downing, W. Logan, Howell Li, William T. Morgan, Cassandra McKee, and Darcy M. Bullock. Using Probe Data Analytics for Assessing Freeway Speed Reductions during Rain Events. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317350.

Full text
Abstract:
Rain impacts roadways such as wet pavement, standing water, decreased visibility, and wind gusts and can lead to hazardous driving conditions. This study investigates the use of high fidelity Doppler data at 1 km spatial and 2-minute temporal resolution in combination with commercial probe speed data on freeways. Segment-based space-mean speeds were used and drops in speeds during rainfall events of 5.5 mm/hour or greater over a one-month period on a section of four to six-lane interstate were assessed. Speed reductions were evaluated as a time series over a 1-hour window with the rain data. Three interpolation methods for estimating rainfall rates were tested and seven metrics were developed for the analysis. The study found sharp drops in speed of more than 40 mph occurred at estimated rainfall rates of 30 mm/hour or greater, but the drops did not become more severe beyond this threshold. The average time of first detected rainfall to impacting speeds was 17 minutes. The bilinear method detected the greatest number of events during the 1-month period, with the most conservative rate of predicted rainfall. The range of rainfall intensities were estimated between 7.5 to 106 mm/hour for the 39 events. This range was much greater than the heavy rainfall categorization at 16 mm/hour in previous studies reported in the literature. The bilinear interpolation method for Doppler data is recommended because it detected the greatest number of events and had the longest rain duration and lowest estimated maximum rainfall out of three methods tested, suggesting the method balanced awareness of the weather conditions around the roadway with isolated, localized rain intensities.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Time window' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography