Browsing by Subject "Improve performance"
Now showing 1 - 4 of 4
- Results Per Page
- Sort Options
Item Open Access A catalog of stream processing optimizations(Association for Computing Machinery, 2014) Hirzel M.; Soulé R.; Schneider S.; Gedik, B.; Grimm, R.Various research communities have independently arrived at stream processing as a programming model for efficient and parallel computing. These communities include digital signal processing, databases, operating systems, and complex event processing. Since each community faces applications with challenging performance requirements, each of them has developed some of the same optimizations, but often with conflicting terminology and unstated assumptions. This article presents a survey of optimizations for stream processing. It is aimed both at users who need to understand and guide the system's optimizer and at implementers who need to make engineering tradeoffs. To consolidate terminology, this article is organized as a catalog, in a style similar to catalogs of design patterns or refactorings. To make assumptions explicit and help understand tradeoffs, each optimization is presented with its safety constraints (when does it preserve correctness?) and a profitability experiment (when does it improve performance?). We hope that this survey will help future streaming system builders to stand on the shoulders of giants from not just their own community. © 2014 ACM.Item Open Access A delayed consensus algorithm in networks of anticipatory agents(IEEE, 2016) Atay, Fatihcan M.; Irofti, D.We introduce and analyze a delayed consensus algorithm as a model for interacting agents using anticipation of their neighbors' states to improve convergence to consensus. We derive a necessary and sufficient condition for the system to reach consensus. Furthermore, we explicitly calculate the dominant characteristic root of the consensus problem as a measure of the speed of convergence. The results show that the anticipatory algorithm can improve the speed of consensus, especially in networks with poor connectivity. Hence, anticipation can improve performance in networks if the delay parameter is chosen judiciously, otherwise the system might diverge as agents try to anticipate too aggressively into the future.Item Open Access Effects of linear filter on stability and performance of human-in-the-loop model reference adaptive control architectures(ASME, 2017) Yousefi, Ehsan; Demir, Didem Fatma; Sipahi, R.; Yücelen, T.; Yıldız, YıldırayModel reference adaptive control (MRAC) can effectively handle various challenges of the real world control problems including exogenous disturbances, system uncertainties, and degraded modes of operations. In human-in-the-loop settings, MRAC may cause unstable system trajectories. Basing on our recent work on the stability of MRAC-human dynamics, here we follow an optimization based computations to design a linear filter and study whether or not this filter inserted between the human model and MRAC could help remove such instabilities, and potentially improve performance. To this end, we present a mathematical approach to study how the error dynamics of MRAC could favorably or detrimentally influence human operator's error dynamics in performing a certain task. An illustrative numerical example concludes the study.Item Open Access Integrating social features into mobile local search(Elsevier Inc., 2016) Kahveci, B.; Altıngövde, İ. S.; Ulusoy, ÖzgürAs availability of Internet access on mobile devices develops year after year, users have been able to make use of search services while on the go. Location information on these devices has enabled mobile users to use local search services to access various types of location-related information easily. Mobile local search is inherently different from general web search. Namely, it focuses on local businesses and points of interest instead of general web pages, and finds relevant search results by evaluating different ranking features. It also strongly depends on several contextual factors, such as time, weather, location etc. In previous studies, rankings and mobile user context have been investigated with a small set of features. We developed a mobile local search application, Gezinio, and collected a data set of local search queries with novice social features. We also built ranking models to re-rank search results. We reveal that social features can improve performance of the machine-learned ranking models with respect to a baseline that solely ranks the results based on their distance to user. Furthermore, we find out that a feature that is important for ranking results of a certain query category may not be so useful for other categories.