Bibliografie tematiche / Online smoothing

Letteratura scientifica selezionata sul tema "Online smoothing"

Autore: Grafiati
Pubblicato: 1 giugno 2024

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Online smoothing".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Indice

  1. Articoli di riviste
  2. Tesi
  3. Libri
  4. Capitoli di libri
  5. Atti di convegni

Articoli di riviste sul tema "Online smoothing":

1

Chen, Sixia, e Alexander Russell. "Online Metric Tracking and Smoothing". Algorithmica 68, n. 1 (28 giugno 2012): 133–51. http://dx.doi.org/10.1007/s00453-012-9669-8.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Mann, B. L. "Smoothing Some Wrinkles in Online Dispute Resolution". International Journal of Law and Information Technology 17, n. 1 (21 novembre 2008): 83–112. http://dx.doi.org/10.1093/ijlit/ean017.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Cao, Guohong, Wu-chi Feng e Mukesh Singhal. "Online variable-bit-rate video traffic smoothing". Computer Communications 26, n. 7 (maggio 2003): 639–51. http://dx.doi.org/10.1016/s0140-3664(02)00197-4.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Jiang, Wei, e Yongzhong Zhu. "Online process mean estimation usingL1norm exponential smoothing". Naval Research Logistics 56, n. 5 (agosto 2009): 439–49. http://dx.doi.org/10.1002/nav.20351.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Cai, Qingzhong, Gongliu Yang, Ningfang Song, Jianye Pan e Yiliang Liu. "An Online Smoothing Method Based on Reverse Navigation for ZUPT-Aided INSs". Journal of Navigation 70, n. 2 (21 ottobre 2016): 342–58. http://dx.doi.org/10.1017/s0373463316000667.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
Zero velocity update (ZUPT) is widely discussed for error restriction in land vehicle Inertial Navigation Systems (INSs) and wearable pedestrian INSs to overcome the problems of Global Positioning System (GPS) unavailability in urban canyons or indoor scenarios. In this paper, an online smoothing method for ZUPT-aided INSs is presented. By introducing the Rauch–Tung–Striebel (RTS) smoothing method into the ZUPT-aided INS, position errors can be effectively restrained not only at stop points but during the whole trajectory. By integrating reverse navigation with a ZUPT smoother, the method realises forward and real-time processing. Compared with existing approaches, it can improve the position accuracy in real time without any other sensors, which is well suited for applications on high-accuracy navigation in GPS-challenging environments. Accuracy test results with different Inertial Measurement Units (IMUs) show that the developed method can significantly decrease position errors from hundreds or thousands of metres to below ten metres. During the whole trajectory, the online smoothing method ensures the maximum position errors at non-stop points can reach the same level of accuracy at stop points. A delay test result proves that the delay of the reverse online smoothing method proposed in this paper is much shorter than existing online smoothing methods.
6

Duffield, Samuel, e Sumeetpal Singh. "Online Particle Smoothing With Application to Map-Matching". IEEE Transactions on Signal Processing 70 (2022): 497–508. http://dx.doi.org/10.1109/tsp.2022.3141259.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Sen, S., J. L. Rexford, J. K. Dey, J. F. Kurose e D. F. Towsley. "Online smoothing of variable-bit-rate streaming video". IEEE Transactions on Multimedia 2, n. 1 (marzo 2000): 37–48. http://dx.doi.org/10.1109/6046.825793.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Einbeck, Jochen, e Göran Kauermann. "Online monitoring with local smoothing methods and adaptive ridging". Journal of Statistical Computation and Simulation 73, n. 12 (dicembre 2003): 913–29. http://dx.doi.org/10.1080/0094965031000104332.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Ekadjaja, Agustin, Andre Chuandra e Margarita Ekadjaja. "THE IMPACT OF BOARD INDEPENDENCE, PROFITABILITY, LEVERAGE, AND FIRM SIZE ON INCOME SMOOTHING IN CONTROL OF AGENCY CONFLICT". Jurnal Ekonomi Manajemen Sistem Informasi 1, n. 3 (27 febbraio 2020): 238–47. http://dx.doi.org/10.31933/jemsi.v1i3.104.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
This research is aimed to earn empirical results about the effect of board independence, profitability, leverage and firm size on income smoothing. The study used purposive sampling as its sampling method on manufacture companies that’s listed on BEI for years 2015-2017. Information for this research was acquired from multiple online sources that store financial reports of companies. This research used Eckel Index to determine if a corporation did an income smoothing on its financial report or not. The results were significant relationships between board independence and income smoothing and between profitability and income smoothing while insignificant relationships were found in between leverage and income smoothing and between firm size and income smoothing. To improve this study there are mulitple ways that has been written in conclusion part.
10

Ekadjaja, Agustin, Andre Chuandra e Margarita Ekadjaja. "THE IMPACT OF BOARD INDEPENDENCE, PROFITABILITY, LEVERAGE, AND FIRM SIZE ON INCOME SMOOTHING IN CONTROL OF AGENCY CONFLICT". Dinasti International Journal of Education Management And Social Science 1, n. 3 (19 febbraio 2020): 388–99. http://dx.doi.org/10.31933/dijemss.v1i3.169.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
This research is aimed to earn empirical results about the effect of board independence, profitability, leverage and firm size on income smoothing. The study used purposive sampling as its sampling method on manufacture companies that’s listed on BEI for years 2015-2017. Information for this research was acquired from multiple online sources that store financial reports of companies. This research used Eckel Index to determine if a corporation did an income smoothing on its financial report or not. The results were significant relationships between board independence and income smoothing and between profitability and income smoothing while insignificant relationships were found in between leverage and income smoothing and between firm size and income smoothing. To improve this study there are mulitple ways that has been written in conclusion part.
Più fonti
Ti possono interessare anche gli elenchi estesi di opere sul tema "Online smoothing":
Articoli di riviste

Tesi sul tema "Online smoothing":

1

Cunningham, Alexander G. "Scalable online decentralized smoothing and mapping". Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/51848.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
Many applications for field robots can benefit from large numbers of robots, especially applications where the objective is for the robots to cover or explore a region. A key enabling technology for robust autonomy in these teams of small and cheap robots is the development of collaborative perception to account for the shortcomings of the small and cheap sensors on the robots. In this dissertation, I present DDF-SAM to address the decentralized data fusion (DDF) inference problem with a smoothing and mapping (SAM) approach to single-robot mapping that is online, scalable and consistent while supporting a variety of sensing modalities. The DDF-SAM approach performs fully decentralized simultaneous localization and mapping in which robots choose a relevant subset of variables from their local map to share with neighbors. Each robot summarizes their local map to yield a density on exactly this chosen set of variables, and then distributes this summarized map to neighboring robots, allowing map information to propagate throughout the network. Each robot fuses summarized maps it receives to yield a map solution with an extended sensor horizon. I introduce two primary variations on DDF-SAM, one that uses a batch nonlinear constrained optimization procedure to combine maps, DDF-SAM 1.0, and one that uses an incremental solving approach for substantially faster performance, DDF-SAM 2.0. I validate these systems using a combination of real-world and simulated experiments. In addition, I evaluate design trade-offs for operations within DDF-SAM, with a focus on efficient approximate map summarization to minimize communication costs.
2

Westerborn, Johan. "On particle-based online smoothing and parameter inference in general state-space models". Doctoral thesis, KTH, Matematisk statistik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-215292.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
This thesis consists of 4 papers, presented in Paper A-D, on particle- based online smoothing and parameter inference in general state-space hidden Markov models. In Paper A a novel algorithm, the particle-based, rapid incremental smoother (PaRIS), aimed at efficiently performing online approxima- tion of smoothed expectations of additive state functionals in general hidden Markov models, is presented. The algorithm has, under weak assumptions, linear computational complexity and very limited mem- ory requirements. The algorithm is also furnished with a number of convergence results, including a central limit theorem. In Paper B the problem of marginal smoothing in general hidden Markov models is tackled. A novel, PaRIS-based algorithm is presented where the marginal smoothing distributions are approximated using a lagged estimator where the lag is set adaptively. In Paper C an estimator of the tangent filter is constructed, yield- ing in turn an estimator of the score function. The resulting algorithm is furnished with theoretical results, including a central limit theorem with a uniformly bounded variance. The resulting estimator is applied to online parameter estimation via recursive maximum liklihood. Paper D focuses on the problem of online estimation of parameters in general hidden Markov models. The algorithm is based on a for- ward implementation of the classical expectation-maximization algo- rithm. The algorithm uses the PaRIS algorithm to achieve an efficient algorithm.
Denna avhandling består av fyra artiklar, presenterade i Paper A-D, som behandlar partikelbaserad online-glättning och parameter- skattning i generella dolda Markovkedjor. I papper A presenteras en ny algoritm, PaRIS, med målet att effek- tivt beräkna partikelbaserade online-skattningar av glättade väntevär- den av additiva tillståndsfunktionaler. Algoritmen har, under svaga villkor, en beräkningskomplexitet som växer endast linjärt med antalet partiklar samt högst begränsade minneskrav. Dessutom härleds ett an- tal konvergensresultat för denna algoritm, såsom en central gränsvärdes- sats. Algoritmen testas i en simuleringsstudie. I papper B studeras problemet att skatta marginalglättningsfördel- ningen i dolda Markovkedjor. Detta åstadkoms genom att exekvera PaRIS-algoritmen i marginalläge. Genom ett argument om mixning i Markovkedjor motiveras att avbryta uppdateringen efter en av ett stoppkriterium bestämd fördröjning vilket ger en adaptiv fördröjnings- glättare. I papper C studeras problemet att beräkna derivator av filterfördel- ningen. Dessa används för att beräkna gradienten av log-likelihood funktionen. Algoritmen, som innehåller en uppdateringsmekanism lik- nande den i PaRIS, förses med ett antal konvergensresultat, såsom en central gränsvärdessats med en varians som är likformigt begränsad. Den resulterande algoritmen används för att konstruera en rekursiv parameterskattningsalgoritm. Papper D fokuserar på online-estimering av modellparametrar i generella dolda Markovkedjor. Den presenterade algoritmen kan ses som en kombination av PaRIS algoritmen och en nyligen föreslagen online-implementation av den klassiska EM-algoritmen.

QC 20171009

3

Westerborn, Johan. "On particle-based online smoothing and parameter inference in general hidden Markov models". Licentiate thesis, KTH, Matematik (Inst.), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166629.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
This thesis consists of two papers studying online inference in general hidden Markov models using sequential Monte Carlo methods. The first paper present an novel algorithm, the particle-based, rapid incremental smoother (PaRIS), aimed at efficiently perform online approximation of smoothed expectations of additive state functionals in general hidden Markov models. The algorithm has, under weak assumptions, linear computational complexity and very limited memory requirements. The algorithm is also furnished with a number of convergence results, including a central limit theorem. The second paper focuses on the problem of online estimation of parameters in a general hidden Markov model. The algorithm is based on a forward implementation of the classical expectation-maximization algorithm. The algorithm uses the PaRIS algorithm to achieve an efficient algorithm.
Denna avhandling består av två artiklar som behandlar inferens i dolda Markovkedjor med generellt tillståndsrum via sekventiella Monte Carlo-metoder. Den första artikeln presenterar en ny algoritm, PaRIS, med målet att effektivt beräkna partikelbaserade online-skattningar av utjämnade väntevärden av additiva tillståndsfunktionaler. Algoritmen har, under svaga villkor, en beräkningkomplexitet som växer endast linjärt med antalet partiklar samt h\ögst begränsade minneskrav. Dessutom härleds ett antal konvergensresultat för denna algoritm, såsom en central gränsvärdessats. Den andra artikeln fokuserar på online-estimering av modellparametrar i en generella dolda Markovkedjor. Den presenterade algoritmen kan ses som en kombination av PaRIS och en nyligen föreslagen online-implementation av den klassiska EM-algoritmen.

QC 20150521

4

WANG, Yanan. "Exploring online brand choice at the SKU level : the effects of internet-specific attributes". Digital Commons @ Lingnan University, 2004. https://commons.ln.edu.hk/mkt_etd/13.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
E-Commerce research shows that existing studies on online consumer choice behavior has focused on comparative studies of channel or store choice (online or offline), or online store choice (different e-tailers). Relatively less effort has been devoted to consumers’ online brand choice behavior within a single e-tailer. The goal of this research is to model online brand choice, including generating loyalty variables, setting up base model, and exploring the effects of Internet-specific attributes, i.e., order delivery, webpage display and order confirmation, on online brand choice at the SKU level. Specifically, this research adopts the Multinomial Logit Model (MNL) as the estimation methods. To minimize the model bias, the refined smoothing constants for loyalty variables (brand loyalty, size loyalty, and SKU loyalty) are generated using the Nonlinear Estimation Algorithm (NEA). The findings suggest that SKU loyalty is a better predictor of online brand choice than brand loyalty and size loyalty. While webpage display has little effect on the brand choice, order delivery has positive effect on the choice. Online order confirmation turns out to be helpful in choice estimation. Moreover, online consumers are not sensitive to net price of the alternatives, but quite sensitive to price promotion. These results have meaningful implications for marketing promotions in the online environment and suggestions for future research.
5

Martin, Alice. "Deep learning models and algorithms for sequential data problems : applications to language modelling and uncertainty quantification". Electronic Thesis or Diss., Institut polytechnique de Paris, 2022. http://www.theses.fr/2022IPPAS007.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
Dans ce manuscrit de thèse, nous développons de nouveaux algorithmes et modèles pour résoudre les problèmes d'apprentissage profond sur de la donnée séquentielle, en partant des problématiques posées par l'apprentissage des modèles de langage basés sur des réseaux de neurones. Un premier axe de recherche développe de nouveaux modèles génératifs profonds basés sur des méthodes de Monte Carlo Séquentielles (SMC), qui permettent de mieux modéliser la diversité du langage, ou de mieux quantifier l'incertitude pour des problèmes de régression séquentiels. Un deuxième axe de recherche vise à faciliter l'utilisation de techniques de SMC dans le cadre de l'apprentissage profond, en développant un nouvel algorithme de lissage à coût computationnel largement réduit, et qui s'applique à un scope plus large de modèles à espace d'états, notamment aux modèles génératifs profonds. Finalement, un troisième axe de recherche propose le premier algorithme d'apprentissage par renforcement permettant d'apprendre des modèles de langage conditionnels "ex-nihilo" (i.e sans jeu de données supervisé), basé sur un mécanisme de troncation de l'espace d'actions par un modèle de langage pré-entrainé
In this thesis, we develop new models and algorithms to solve deep learning tasks on sequential data problems, with the perspective of tackling the pitfalls of current approaches for learning language models based on neural networks. A first research work develops a new deep generative model for sequential data based on Sequential Monte Carlo Methods, that enables to better model diversity in language modelling tasks, and better quantify uncertainty in sequential regression problems. A second research work aims to facilitate the use of SMC techniques within deep learning architectures, by developing a new online smoothing algorithm with reduced computational cost, and applicable on a wider scope of state-space models, including deep generative models. Finally, a third research work proposes the first reinforcement learning that enables to learn conditional language models from scratch (i.e without supervised datasets), based on a truncation mechanism of the natural language action space with a pretrained language model
6

Vestin, Albin, e Gustav Strandberg. "Evaluation of Target Tracking Using Multiple Sensors and Non-Causal Algorithms". Thesis, Linköpings universitet, Reglerteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-160020.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
Today, the main research field for the automotive industry is to find solutions for active safety. In order to perceive the surrounding environment, tracking nearby traffic objects plays an important role. Validation of the tracking performance is often done in staged traffic scenarios, where additional sensors, mounted on the vehicles, are used to obtain their true positions and velocities. The difficulty of evaluating the tracking performance complicates its development. An alternative approach studied in this thesis, is to record sequences and use non-causal algorithms, such as smoothing, instead of filtering to estimate the true target states. With this method, validation data for online, causal, target tracking algorithms can be obtained for all traffic scenarios without the need of extra sensors. We investigate how non-causal algorithms affects the target tracking performance using multiple sensors and dynamic models of different complexity. This is done to evaluate real-time methods against estimates obtained from non-causal filtering. Two different measurement units, a monocular camera and a LIDAR sensor, and two dynamic models are evaluated and compared using both causal and non-causal methods. The system is tested in two single object scenarios where ground truth is available and in three multi object scenarios without ground truth. Results from the two single object scenarios shows that tracking using only a monocular camera performs poorly since it is unable to measure the distance to objects. Here, a complementary LIDAR sensor improves the tracking performance significantly. The dynamic models are shown to have a small impact on the tracking performance, while the non-causal application gives a distinct improvement when tracking objects at large distances. Since the sequence can be reversed, the non-causal estimates are propagated from more certain states when the target is closer to the ego vehicle. For multiple object tracking, we find that correct associations between measurements and tracks are crucial for improving the tracking performance with non-causal algorithms.
7

Su, Aron Wei-Hsiang. "ECG Noise Filtering Using Online Model-Based Bayesian Filtering Techniques". Thesis, 2013. http://hdl.handle.net/10012/7917.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
The electrocardiogram (ECG) is a time-varying electrical signal that interprets the electrical activity of the heart. It is obtained by a non-invasive technique known as surface electromyography (EMG), used widely in hospitals. There are many clinical contexts in which ECGs are used, such as medical diagnosis, physiological therapy and arrhythmia monitoring. In medical diagnosis, medical conditions are interpreted by examining information and features in ECGs. Physiological therapy involves the control of some aspect of the physiological effort of a patient, such as the use of a pacemaker to regulate the beating of the heart. Moreover, arrhythmia monitoring involves observing and detecting life-threatening conditions, such as myocardial infarction or heart attacks, in a patient. ECG signals are usually corrupted with various types of unwanted interference such as muscle artifacts, electrode artifacts, power line noise and respiration interference, and are distorted in such a way that it can be difficult to perform medical diagnosis, physiological therapy or arrhythmia monitoring. Consequently signal processing on ECGs is required to remove noise and interference signals for successful clinical applications. Existing signal processing techniques can remove some of the noise in an ECG signal, but are typically inadequate for extraction of the weak ECG components contaminated with background noise and for retention of various subtle features in the ECG. For example, the noise from the EMG usually overlaps the fundamental ECG cardiac components in the frequency domain, in the range of 0.01 Hz to 100 Hz. Simple filters are inadequate to remove noise which overlaps with ECG cardiac components. Sameni et al. have proposed a Bayesian filtering framework to resolve these problems, and this gives results which are clearly superior to the results obtained from application of conventional signal processing methods to ECG. However, a drawback of this Bayesian filtering framework is that it must run offline, and this of course is not desirable for clinical applications such as arrhythmia monitoring and physiological therapy, both of which re- quire online operation in near real-time. To resolve this problem, in this thesis we propose a dynamical model which permits the Bayesian filtering framework to function online. The framework with the proposed dynamical model has less than 4% loss in performance compared to the previous (offline) version of the framework. The proposed dynamical model is based on theory from fixed-lag smoothing.

Libri sul tema "Online smoothing":

1

Weiß, Lea. Superfood Smoothies Zum Abnehmen: Das Große Superfood Smoothie Buch Mit Bunten Smoothie Rezepten Sowie Allem Wissenswerten Zu Superfoods and Smoothies. Inkl. 30 Tage Diätplan + Gratis Online Beratung. Independently Published, 2020.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

QuickBooks® Pro Support+1(866∎751∎2963)Phone Number. mrinalt, 2022.

Cerca il testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Capitoli di libri sul tema "Online smoothing":

1

Gray, Chris, Maarten Löffler e Rodrigo I. Silveira. "Smoothing Imprecise 1.5D Terrains". In Approximation and Online Algorithms, 214–26. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-93980-1_17.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Lin, Jeng-Wei, Ray-I. Chang, Jan-Ming Ho e Feipei Lai. "Aggressive Traffic Smoothing for Delivery of Online Multimedia". In Advances in Multimedia Information Processing - PCM 2004, 114–21. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30541-5_15.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Zhao, Yue, e Philipp Krähenbühl. "Real-Time Online Video Detection with Temporal Smoothing Transformers". In Lecture Notes in Computer Science, 485–502. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-19830-4_28.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Quicke, Donald L. J., Buntika A. Butcher e Rachel A. Kruft Welton. "Dates and Julian dates." In Practical R for biologists: an introduction, 227–39. Wallingford: CABI, 2021. http://dx.doi.org/10.1079/9781789245349.0020.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
Abstract This chapter deals with dates and Julian dates. To illustrate some date handling, the chapter will look at nest building and laying dates for breeding pairs of the blue tit (Cyanistes caeruleus) in Europe, on the mainland and on the island of Corsica. The problem with two-digit dates and POSIX (using data available online for burials at the Hope Cemetery, Derbyshire, UK); phenology and the density function (using data on European corn borer collected in 2003 at a light trap); extraction of day and month from Julian days; and the seasonal patterns and other smoothing curves (presenting data on the abundance (shell influx) of the foraminiferan Turborotalita quinqueloba amassed over a nearly 3-year sampling period at a given site) are described.
5

Quicke, Donald L. J., Buntika A. Butcher e Rachel A. Kruft Welton. "Dates and Julian dates." In Practical R for biologists: an introduction, 227–39. Wallingford: CABI, 2021. http://dx.doi.org/10.1079/9781789245349.0227.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
Abstract This chapter deals with dates and Julian dates. To illustrate some date handling, the chapter will look at nest building and laying dates for breeding pairs of the blue tit (Cyanistes caeruleus) in Europe, on the mainland and on the island of Corsica. The problem with two-digit dates and POSIX (using data available online for burials at the Hope Cemetery, Derbyshire, UK); phenology and the density function (using data on European corn borer collected in 2003 at a light trap); extraction of day and month from Julian days; and the seasonal patterns and other smoothing curves (presenting data on the abundance (shell influx) of the foraminiferan Turborotalita quinqueloba amassed over a nearly 3-year sampling period at a given site) are described.
6

Zhang, Xinxin, Dike Li, Zeyuan Cheng, Jianqin Zhu, Zhi Tao e Lu Qiu. "Rapid Online Estimation of Time-Varying Thermal Boundary Conditions in Convective Heat Transfer Problem by ANN-Based Extended Kalman Smoothing Algorithm". In Computational and Experimental Simulations in Engineering, 203–18. Cham: Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-44947-5_17.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Dařena, František, Jonáš Petrovský, Jan Přichystal e Jan Žižka. "Using Online Data in Predicting Stock Price Movements". In Research Anthology on Strategies for Using Social Media as a Service and Tool in Business, 1056–83. IGI Global, 2021. http://dx.doi.org/10.4018/978-1-7998-9020-1.ch053.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
A lot of research has been focusing on incorporating online data into models of various phenomena. The chapter focuses on one specific problem coming from the domain of capital markets where the information contained in online environments is quite topical. The presented experiments were designed to reveal the association between online texts (from Yahoo! Finance, Facebook, and Twitter) and changes in stock prices of the corresponding companies. As the method for quantifying the association, machine learning-based classification was chosen. The experiments showed that the data preparation procedure had a substantial impact on the results. Thus, different stock price smoothing, the lags between the release of documents and related stock price changes, levels of a minimal stock price change, different weighting schemes for structured document representation, and classifiers were studied. The chapter also shows how to use currently available open source technologies to implement a system for accomplishing the task.
8

Dařena, František, Jonáš Petrovský, Jan Přichystal e Jan Žižka. "Using Online Data in Predicting Stock Price Movements". In Techno-Social Systems for Modern Economical and Governmental Infrastructures, 125–59. IGI Global, 2019. http://dx.doi.org/10.4018/978-1-5225-5586-5.ch006.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
A lot of research has been focusing on incorporating online data into models of various phenomena. The chapter focuses on one specific problem coming from the domain of capital markets where the information contained in online environments is quite topical. The presented experiments were designed to reveal the association between online texts (from Yahoo! Finance, Facebook, and Twitter) and changes in stock prices of the corresponding companies. As the method for quantifying the association, machine learning-based classification was chosen. The experiments showed that the data preparation procedure had a substantial impact on the results. Thus, different stock price smoothing, the lags between the release of documents and related stock price changes, levels of a minimal stock price change, different weighting schemes for structured document representation, and classifiers were studied. The chapter also shows how to use currently available open source technologies to implement a system for accomplishing the task.
9

Baibarac Duignan, Corelia, Julieta Matos Castaño, Anouk Geenen e Michiel de Lange. "Controversing Datafication through Media Architectures". In Situating Data. Nieuwe Prinsengracht 89 1018 VR Amsterdam Nederland: Amsterdam University Press, 2023. http://dx.doi.org/10.5117/9789463722971_ch03.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
In this chapter, we discuss a speculative and participatory “media architecture” installation that engages people with the potential impacts of data through speculative future images of the datafied city. The installation was originally conceived as a physical combination of digital media technologies and architectural form—a “media architecture”—that was to be situated in a particular urban setting. Due to the COVID-19 pandemic, however, it was produced and tested for an online workshop. It is centered on “design frictions” (Forlano and Mathew, 2014) and processes of controversing (Baibarac-Duignan and de Lange, 2021). Instead of smoothing out tensions through “neutral” data visualizations, controversing centers on opening avenues for meaningful participation around frictions and controversies that arise from the datafication of urban life. The installation represents an instance of how processes of controversing may unfold through digital interfaces. Here, we explore its performative potential to “interface” abstract dimensions of datafication, “translate” them into collective issues of concern, and spark imagination around (un)desirable datafied urban futures.
10

Wang, Xuerui, Wei Li, Ying Cui, Ruofei Zhang e Jianchang Mao. "Click-Through Rate Estimation for Rare Events in Online Advertising". In Advances in Multimedia and Interactive Technologies, 1–12. IGI Global, 2011. http://dx.doi.org/10.4018/978-1-60960-189-8.ch001.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
Abstract (sommario):
In online advertising campaigns, to measure purchase propensity, click-through rate (CTR), defined as a ratio of number of clicks to number of impressions, is one of the most informative metrics used in business activities such as performance evaluation and budget planning. No matter what channel an ad goes through (display ads, sponsored search or contextual advertising), CTR estimation for rare events is essential but challenging, often incurring with huge variance, due to the sparsity in data. In this chapter, to alleviate this sparsity, we develop models and methods to smoothen CTR estimation by taking advantage of the natural data hierarchy or by clustering and data continuity in time to leverage information from data close to the events of interest. In a contextual advertising system running at Yahoo!, we demonstrate that our methods lead to significantly more accurate estimation of CTRs.

Atti di convegni sul tema "Online smoothing":

1

Abuolaim, Abdullah, e Michael S. Brown. "Online Lens Motion Smoothing for Video Autofocus". In 2020 IEEE Winter Conference on Applications of Computer Vision (WACV). IEEE, 2020. http://dx.doi.org/10.1109/wacv45572.2020.9093558.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
2

Gao, Kui, Wen Gao, Simin He e Yuan Zhang. "Online smoothing for scalable media stream delivery". In Electronic Imaging 2004, a cura di Sethuraman Panchanathan e Bhaskaran Vasudev. SPIE, 2004. http://dx.doi.org/10.1117/12.526367.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
3

Lin, Jimmy, Rion Snow e William Morgan. "Smoothing techniques for adaptive online language models". In the 17th ACM SIGKDD international conference. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/2020408.2020476.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
4

Zhang, Jin, Kai Liu, Fei Cheng e YunSong Li. "Online visual tracking based on updating with smoothing". In SPIE Sensing Technology + Applications, a cura di Bormin Huang, Chein-I. Chang e José Fco López. SPIE, 2014. http://dx.doi.org/10.1117/12.2053153.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
5

Kanagal, Bhargav, e Amol Deshpande. "Online Filtering, Smoothing and Probabilistic Modeling of Streaming data". In 2008 IEEE 24th International Conference on Data Engineering (ICDE 2008). IEEE, 2008. http://dx.doi.org/10.1109/icde.2008.4497525.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
6

Dang, Kang, Jiong Yang e Junsong Yuan. "Adaptive Exponential Smoothing for Online Filtering of Pixel Prediction Maps". In 2015 IEEE International Conference on Computer Vision (ICCV). IEEE, 2015. http://dx.doi.org/10.1109/iccv.2015.367.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
7

Westerborn, Johan, e Jimmy Olsson. "Efficient particle-based online smoothing in general hidden Markov models". In ICASSP 2014 - 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2014. http://dx.doi.org/10.1109/icassp.2014.6855159.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
8

Abdelli, Ahmed. "Recursive motion smoothing for online video stabilization in wide-area surveillance". In 2016 International Conference on Big Data and Smart Computing (BigComp). IEEE, 2016. http://dx.doi.org/10.1109/bigcomp.2016.7425799.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
9

Park, Yun S., Leigh R. Hochberg, Emad N. Eskandar, Sydney S. Cash e Wilson Truccolo. "Adaptive parametric spectral estimation with Kalman smoothing for online early seizure detection". In 2013 6th International IEEE/EMBS Conference on Neural Engineering (NER). IEEE, 2013. http://dx.doi.org/10.1109/ner.2013.6696207.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri
10

Yildirim, Sinan, e A. Taylan Cemgil. "Forward smoothing and online expectation-maximisation in Gaussian linear state-space models". In 2011 IEEE 19th Signal Processing and Communications Applications Conference (SIU). IEEE, 2011. http://dx.doi.org/10.1109/siu.2011.5929704.

Testo completo
Gli stili APA, Harvard, Vancouver, ISO e altri

Vai alla bibliografia