James Gettys · 2015
Today’s computing mantra is “One keyboard, one mouse, one display, one computer, one user, one role, one administration”; in short, one of everything. However, if several people try to use the same computer today, or cross adminstrative boundaries, or change roles from work to home life, chaos generally ensues. Several hardware technologies will soon push this limited model of computing beyond the breaking point. Projectors and physically large flat panel displays have become affordable and are about to take a leap in resolution[12]. Cell-phone-size devices can now store many giga-bytes of information, take high resolution pho-tographs, have significant computation capabil-ity, and are small enough to always be with you. Ask yourself “Why can’t we sit with friends, family, or coworkers in front of a large display with audio system, and all use it at once?” You should be able change roles or move lo-cations, and reassociate with the local comput-ing environment. The new mantra must become ‘many ’ and ‘mobile ’ everywhere ‘one ’ has suf-ficed in the past. Change will be required in many areas from base system, through the window system and toolkits, and in applications to fully capitalize on this vision. 1
Cited by 0
Qixiang Pang, Linrui Zhang, Belinda Copus et al. · 2025
Reducing cold-starts while improving resource utilization has been a persistent challenge in serverless computing services. This paper proposes a self-adaptive keep-alive window control mechanism that dynamically adjusts window sizes for different applications based on varying incoming request patterns. Simulation results using real Microsoft Azure Functions invocation trace demonstrate that, compared with the fixed-size window mechanism, the proposed approach significantly reduces cold-starts and decreases the request rejections. Furthermore, the new mechanism is straightforward to implement, lightweight, and robust to the initial window size configuration.
Cited by 0
Zeitschrift für Kristallographie - Crystalline Materials · 1995
Article Crystallographic Computing 6. A Window on Modern Crystallography. was published on December 1, 1995 in the journal Zeitschrift für Kristallographie - Crystalline Materials (volume 210, issue 12).
Cited by 14
James Gettys · 2008
Today’s computing mantra is “One keyboard, one mouse, one display, one computer, one user, one role, one administration”; in short, one of everything. However, if several people try to use the same computer today, or cross adminstrative boundaries, or change roles from work to home life, chaos generally ensues. Several hardware technologies will soon push this limited model of computing beyond the breaking point. Projectors and physically large flat panel displays have become affordable and are about to take a leap in resolution[12]. Cell phone size devices can now store many gigabytes of information, take high resolution photographs, have significant computation capability, and are small enough to always be with you. Ask yourself “Why can’t we sit with friends, family or coworkers in front of large display with audio system, and all use it at once?” You should be able change roles or move locations, and reassociate with the local computing environment. The new mantra must become ‘many ’ and ‘mobile ’ everywhere ‘one ’ has sufficed in the past. Change will be required in many areas from base system, through the window system and toolkits, and in applications to fully capitalize on this vision.
Cited by 0
Takuya Mieno, Yuta Fujishige, Yuto Nakashima et al. · Algorithmica · 2021
Abstract A substring u of a string T is called a minimal unique substring ( MUS ) of T if u occurs exactly once in T and any proper substring of u occurs at least twice in T . In this paper, we study the problem of computing MUSs for a sliding window over a given string T . We first show how the set of MUSs can change when the window slides over T . We then present an $$O(n\log \sigma ')$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:mi>O</mml:mi> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>log</mml:mo> <mml:msup> <mml:mi>σ</mml:mi> <mml:mo>′</mml:mo> </mml:msup> <mml:mo>)</mml:mo> </mml:mrow> </mml:math> -time and O ( d )-space algorithm to compute MUSs for a sliding window of size d over the input string T of length n , where $$\sigma '\le d$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:mrow> <mml:msup> <mml:mi>σ</mml:mi> <mml:mo>′</mml:mo> </mml:msup> <mml:mo>≤</mml:mo> <mml:mi>d</mml:mi> </mml:mrow> </mml:math> is the maximum number of distinct characters in every window.
Cited by 6Open access
Joan Feigenbaum, Sampath Kannan, Jian Zhang · Algorithmica · 2004
Cited by 60
Joan Feigenbaumy, Sampath Kannan Z, Jian Zhang X · 2002
We investigate the diameter problem in the streaming and sliding-window models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diameter requires (n) bits of space. We present a simple -approximation1algorithm for computing the diameter in the streaming model. Our main result is an -approximation algorithm that maintains the diameter in two dimensions in the sliding windows model using O ( 1 3=2 log3 n(log R + log log n + log 1
Cited by 0
R.A. Baldwin, M.J. Chung, Y. Chung · 2002
Techniques are proposed for computing a global virtual time (GVT), which is the minimum local virtual time of processes in Time Warp. The algorithm computes a conservative estimate of GVT using an approach which is considerably simpler than previous algorithms for computing GVT. This algorithm does not require a global synchronization of processors. An inherent problem is GVT computation relates to handling messages in transit. Several alternatives are proposed for solving the transient message problem. The algorithm is suitable for distributed shared memory machines such as the BBN Butterfly and message passing machines with a variety of interconnection networks.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cited by 10
Applications Designs And, Scott M. Stevens · 1993
Computer input and output has evolved from teletypewriters to text oriented CRTs to today&apos;s window oriented bit mapped displays. Beyond text and images, multimedia input and output must be concerned with constant rate continuous media such as digital video and audio.
Cited by 0
Su Myeong Lee, Hee Yong Youn · 2006
A number of different kinds of applications in large and complex ubiquitous computing systems need fault tolerance. Here failure detection is one of the key elements for efficient fault management. There exist various fault monitoring and detection algorithms employing a timeout-based mechanism. However, they are occasionally inaccurate in unstable or overloaded system. The goal of the proposed scheme is to enhance the accuracy of fault detection by properly handling the monitoring interval. This is achieved by dynamically adjusting the window of the past elapsed times included in the prediction of the monitoring interval. Computer simulation reveals that the proposed algorithm allows much more elastic and accurate prediction of monitoring interval than the existing algorithms regardless of load condition of the system.
Cited by 2
Trong Dao Le, Melvin Zhang, Wai Yie Leong · Lecture notes in computer science · 2011
Cited by 1
Shi-jun SHEN, Xin-ran LIU, Hong ZHANG et al. · SHILAP Revista de lepidopterología · 2014
A sliding window based resource reservation (SWRR) algorithm was proposed, in which a window is defined as the proportion of the reserved resources among all. The sliding of the window is twofold, adaptively window resizing, and dynamically window content refreshing. SWRR was applied to a large cloud computing platform. Experiments reveal that SWRR can provide high service availability for specific users while taking all users into account by proper resource reservation.
Cited by 0Open access
Joan Feigenbaum, Kannan, Sampath, Zhang, Jian · Defense Technical Information Center (DTIC) · 2002
We investigate the diameter problem in the streaming and sliding-window models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diameter requires Omega(n) bits of space. We present a simple epsilon-approximation algorithm for computing the diameter in the streaming model. Our main result is an epsilon-approximation algorithm that maintains the diameter in two dimensions in the sliding windows model using Omicron [(1/epsilon (exp 3/2) log3 n(log R + log log n + log 1/epsilon ))] bits of space, where R is the maximum, over all windows, of the ratio of the diameter to the minimum non-zero distance between any two points in the window.
Cited by 0
Phillip B. Gibbons, Srikanta Tirthapura · 2008
Abstract. Massive data sets often arise as physically distributed, parallel data streams, and it is important to estimate various aggregates and statistics on the union of these streams. This paper presents algorithms for estimating aggregate functions over a “sliding window ” of the N most recent data items in one or more streams. Our results include: 1. For a single stream, we present the first ε-approximation scheme for the number of 1’s in a sliding window that is optimal in both worst case time and space. We also present the first ε-approximation scheme for the sum of integers in [0..R] in a sliding window that is optimal in both worst case time and space (assuming R is at most polynomial in N). Both algorithms are deterministic and use only logarithmic memory words. 2. In contrast, we show that any deterministic algorithm that estimates, to within a small constant relative error, the number of 1’s (or the sum of integers) in a sliding window on the union of distributed streams requires �(N) space. 3. We present the first (randomized) (ε, δ)-approximation scheme for the number
Cited by 0
Yichen Wei, Litian Tao · 2010
Many computer vision problems rely on computing histogram-based objective functions with a sliding window. A main limiting factor is the high computational cost. Existing computational methods have a complexity linear in the histogram dimension. In this paper, we propose an efficient method that has a constant complexity in the histogram dimension and therefore scales well with high dimensional histograms. This is achieved by harnessing the spatial coherence of natural images and computing the objective function in an incremental manner. We demonstrate the significant performance enhancement by our method through important vision tasks including object detection, object tracking and image saliency analysis. Compared with state-of-the-art techniques, our method typically achieves from tens to hundreds of times speedup for those tasks.
Cited by 54
École Normale, Supérieure Lyon, Loris Marchal et al. · 2005
We consider the problem of bulk data transfers and bandwidth sharing in the context of grid infrastructures. Grid computing empowers high-performance computing in a large-scale distributed environment. Network bandwidth, which makes the expensive computational and storage resources work in concert, plays an active role on performance. Due to specific traffic patterns, network topology and application scenarios, bandwidth sharing encounters new challenges. From this perspective, this research report looks at bulk transfers among computing and storage elements. Referred to as short-lived, transfer requests with transmission window and volume are scheduled in the network. By manipulating the transmission window, the request accept rate and network resource utilization are to be optimized. The formulated optimization problem is proven NP-complete. Associated with proposed heuristics, simulations are carried out to study each bandwidth sharing strategy and its application scenarios. A tuning factor, that allows adaptation of performance objective, is introduced to adjust network infrastructure and workload.
Cited by 0
Kelley, D. M., Diether, P. A. · NASA STI Repository (National Aeronautics and Space Administration)
Computer program for predicting spacecraft window deformations and computing window induced angular deviations of light rays
Cited by 0Open access
Min Choi, Jong-Hyuk Park, Young‐Sik Jeong · Communications in computer and information science · 2011
Cited by 0
Schollum, C. A. · University of Auckland Data Repository
Cited by 0
Yeonjoo Oh, Ken Camarata, Michael Philetus Weller et al. · IGI Global eBooks · 2010
People can use computationally-enhanced furniture to interact with distant friends and places without cumbersome menus or widgets. We describe computing embedded in a pair of tables and a chair that enables people to experience remote events in two ways: The TeleTables are ambient tabletop displays that connect two places by projecting shadows cast on one surface to the other. The Window Seat rocking chair through its motion controls a remote camera tied to a live video feed. Both explore using the physical space of a room and its furniture to create “bilocative” interfaces.
Cited by 0