Relevant bibliographies by topics / Information freshness

Academic literature on the topic 'Information freshness'

Author: Grafiati
Published: 10 December 2022
Last updated: 20 February 2023

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

Select a source type:

Contents

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

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 "Information freshness"

1

Sun, Yin, Igor Kadota, Rajat Talak, and Eytan Modiano. "Age of Information: A New Metric for Information Freshness." Synthesis Lectures on Communication Networks 12, no. 2 (December 11, 2019): 1–224. http://dx.doi.org/10.2200/s00954ed2v01y201909cnt023.

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

Xu, Jin, and Yu Chen. "Information Freshness in Sleep-Wake Server Systems." IEEE Communications Letters 25, no. 7 (July 2021): 2186–90. http://dx.doi.org/10.1109/lcomm.2021.3072071.

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

Bastopcu, Melih, Baturalp Buyukates, and Sennur Ulukus. "Selective Encoding Policies for Maximizing Information Freshness." IEEE Transactions on Communications 69, no. 9 (September 2021): 5714–26. http://dx.doi.org/10.1109/tcomm.2021.3059871.

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

Xu, Chao, Howard H. Yang, Xijun Wang, and Tony Q. S. Quek. "Optimizing Information Freshness in Computing-Enabled IoT Networks." IEEE Internet of Things Journal 7, no. 2 (February 2020): 971–85. http://dx.doi.org/10.1109/jiot.2019.2947419.

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

ArceLopera, C., K. Okajima, Y. Wada, and T. Masuda. "Luminance Information Suffices to Model Vegetable Freshness Perception." Journal of Vision 12, no. 9 (August 10, 2012): 865. http://dx.doi.org/10.1167/12.9.865.

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

Lee, Y. "Freshness ratio of information: a new metric for age of information." Electronics Letters 56, no. 3 (February 2020): 139–41. http://dx.doi.org/10.1049/el.2019.2020.

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

Cho, Junghoo, and Hector Garcia-Molina. "Synchronizing a database to improve freshness." ACM SIGMOD Record 29, no. 2 (June 2000): 117–28. http://dx.doi.org/10.1145/335191.335391.

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

Liu, Pan. "Investment Decisions of Blockchain-Based Anti-Counterfeiting Traceability Services in a High-Quality Fresh Supply Chain of China." Agriculture 12, no. 6 (June 9, 2022): 829. http://dx.doi.org/10.3390/agriculture12060829.

Full text
Abstract:
The application of a blockchain-based anti-counterfeiting traceability system (hereafter, blockchain-based ACTS) presents a positive effect on improving the unreliability of the freshness information. However, using a blockchain-based ACTS requires additional expenditures from chain members. Chain members want to know the investment conditions of a blockchain-based ACTS and how to coordinate their supply chain. To solve these problems, a supply chain with one fresh producer and one retailer was chosen as the study subject. Afterwards, considering the unreliability of the freshness information, the demand function was revised. Then, the profit functions before and after adopting a blockchain-based ACTS were constructed, and then a price discount and revenue-sharing contract was put forward to coordinate the supply chain. Findings: With the growth of the unreliability coefficient of the freshness information, benefits to chain members in the proposed three situations would be reduced. Thus, we can know that after using a blockchain-based ACTS, if chain members want to gain more benefits, they should try their best to excavate the value of the blockchain-based ACTS and reduce the unreliability coefficient of the freshness information.
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Zhengchuan, Mingjun Xu, Min Wang, and Yunjian Jia. "Joint Optimization of Data Freshness and Fidelity for Selection Combining-Based Transmissions." Entropy 24, no. 2 (January 28, 2022): 200. http://dx.doi.org/10.3390/e24020200.

Full text
Abstract:
Motivated by big data applications in the Internet of Things (IoT), abundant information arrives at the fusion center (FC) waiting to be processed. It is of great significance to ensure data freshness and fidelity simultaneously. We consider a wireless sensor network (WSN) where several sensor nodes observe one metric and then transmit the observations to the FC using a selection combining (SC) scheme. We adopt the age of information (AoI) and minimum mean square error (MMSE) metrics to measure the data freshness and fidelity, respectively. Explicit expressions of average AoI and MMSE are derived. After that, we jointly optimize the two metrics by adjusting the number of sensor nodes. A closed-form sub-optimal number of sensor nodes is proposed to achieve the best freshness and fidelity tradeoff with negligible errors. Numerical results show that using the proposed node number designs can effectively improve the freshness and fidelity of the transmitted data.
APA, Harvard, Vancouver, ISO, and other styles
10

Nguyen, Gam D., Sastry Kompella, Clement Kam, and Jeffrey E. Wieselthier. "Information freshness over a Markov channel: The effect of channel state information." Ad Hoc Networks 86 (April 2019): 63–71. http://dx.doi.org/10.1016/j.adhoc.2018.10.010.

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

Dissertations / Theses on the topic "Information freshness"

1

Bedewy, Ahmed M. "OPTIMIZING DATA FRESHNESS IN INFORMATION UPDATE SYSTEMS." The Ohio State University, 2021. http://rave.ohiolink.edu/etdc/view?acc_num=osu1618573325086709.

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

Wang, Qian. "Information freshness-oriented scheduling in modern wireless communication systems." Thesis, The University of Sydney, 2021. https://hdl.handle.net/2123/25537.

Full text
Abstract:
Recent years have witnessed extensive interest in the Internet of Things (IoT) from both academia and industry. Various advantages of wireless IoT networks, such as low cost, easy deployment and maintenance, and support of mobility, have paved the way for the rapid development of IoT applications that have gained ground among modern wireless communication systems. In many of these systems, information freshness is of great importance, where the sender is required to transmit its message to the receiver in a timely manner. The Age of Information (AoI) was born to quantify information freshness from the receiver's perspective. Researchers have shown enormous interest in this new metric, thanks to its capability to characterize the timeliness of data transmission in status update systems. This thesis exploits modern wireless technologies such as cognitive radio (CR) and nonorthogonal multiple access (NOMA) in status update systems, considering their ability to deal with spectrum scarcity and enhance spectrum utilization. The information freshness-oriented scheduling policies in these wireless communication systems are studied. In the first part of the thesis, we consider a CR-based IoT monitoring system consisting of an IoT device that aims to update its measurements to a destination using CR technique. Specifically, the IoT device as a secondary user (SIoT) seeks and exploits the spectrum opportunities of the licensed band vacated by its primary user (PU) to deliver status updates without causing visible effects to the licensed operation. In this context, the SIoT should carefully make use of the licensed band and schedule when transmitting to maintain the timeliness of the status update. We aim to minimize the long-term average AoI of the SIoT while satisfying the collision constraint imposed by the PU by formulating a constrained Markov decision process (CMDP) problem. We first prove the existence of an optimal stationary policy of the CMDP problem. The optimal stationary policy (termed age-optimal policy) is shown to be a randomized simple policy that randomizes between two deterministic policies with a fixed probability. We prove that the two deterministic policies have a threshold structure, and further derive the closed-form expression of the average AoI and collision probability for the deterministic threshold-structured policy by conducting a Markov Chain analysis. The analytical expression offers an efficient way to calculate the threshold and randomization probability to form the age-optimal policy. For comparison, we also consider a throughput maximization policy (termed throughput-optimal policy) and analyze its average AoI performance. Numerical simulations show the superiority of the derived age-optimal policy over the throughput-optimal policy. We also unveil the impacts of various system parameters on the corresponding optimal policy and the resultant average AoI. In the second part of the thesis, we consider a wireless network with a base station (BS) conducting timely status updates to multiple clients via NOMA/orthogonal multiple access (OMA). Specifically, the BS is able to adaptively switch between NOMA and OMA for the downlink transmission to optimize the information freshness of the network, characterized by the weighted sum of the average AoI of the network. For the simple two-client case, we formulate a Markov Decision Process (MDP) problem and develop the optimal policy for the BS to decide whether to use NOMA or OMA for each downlink transmission based on the instantaneous AoI of both clients. The optimal policy is shown to have a switching-type property with obvious decision switching boundaries. {A suboptimal policy with lower computation complexity is also devised, which is shown to achieve near-optimal performance via numerical simulations. For the more general multi-client scenario, the optimal solution is computationally intractable due to the large state and action spaces. We develop a feasible suboptimal policy with low computation complexity. Specifically, inspired by the proposed suboptimal policy of the two-client scenario, we formulate a nonlinear optimization problem to determine the optimal power allocated to each client by maximizing the expected AoI drop of the network in each time slot.} The problem is shown to be non-convex, and we manage to solve it by approximating it as a convex optimization problem. Simulation results validate the tightness of the adopted approximation. Specifically, the performance of the adaptive NOMA/OMA scheme by solving the convex optimization is shown to be close to that of the max-weight policy solved by exhaustive search. Besides, the adaptive NOMA/OMA scheme achieves significant performance improvement compared to the OMA scheme, especially when the number of clients in the network is large and the transmission SNR is high. In the third part of the thesis, wireless networks with adaptive NOMA/OMA are extended to the stochastic arrival model of status generation together with practical long-term and short-term power constraints. We aim to minimize the sum of the long-term average AoI of all clients subject to power constraints. To solve this problem, we convert the long-term optimization problem to slot-by-slot optimization problems by leveraging the Lyapunov optimization framework and prove that the optimal solution of the original problem can be asymptotically achieved by solving the slot-by-slot optimization problem. We also show that the transformed problem is non-convex and we propose a low-complexity dynamic scheduling and power allocation algorithm to solve it. Numerical results validate the asymptotic optimality of the proposed algorithm, and show the superior performance of the proposed dynamic scheduling and power allocation algorithm in terms of AoI performance of the network versus different system parameters compared with the benchmark policies adopting OMA scheme only.
APA, Harvard, Vancouver, ISO, and other styles
3

Maatouk, Ali. "Optimization of Wireless Networks : Freshness in Communications." Electronic Thesis or Diss., université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG038.

Full text
Abstract:
La prolifération des smartphones, avec la connectivité omniprésente et le bas coût des matériaux, a ouvert la voie à de nouvelles applications qui reposent sur la livraison en temps opportun des paquets d’un bout à l’autre du réseau. De la surveillance des appareils ménagers à la maison au réseaux de véhicules où les informations de vitesse et de position du véhicule sont diffusées, ces applications nécessitent de données frais pour avoir des performances optimales. Pour quantifier cette notion de fraîcheur de données, le concept de l’Âge de l’Information (AdI) est né, et la recherche s’est fortement concentrée sur son analyse et son optimisation dans divers contextes de réseau. Cette thèse explore l’AdI dans de nombreux environnements,met en lumière ses points faibles et leur apporte ainsi des solutions dans plusieurs applications de surveillance en temps réel.Dans la première partie de la thèse, nous nous concentrons sur l’optimisation des métriques basées sur l’âge dans les systèmes de communication fondamentaux.Plus précisément, dans le troisième chapitre, nous examinons les métriques basées sur l’âge dans les environnements multi-classes qui sont abondants dans les applications en temps réel. Un exemple simple est celui des réseaux de véhicules où les données relatives à la sécurité sont considérées comme plus sensibles. Par conséquent, elles ont une priorité plus élevée par rapport aux autres données du système. Nous dérivons une expression de l’âge moyen de chaque flux et nous fournissons des résultats à propos de l’interaction entre les multiples classes. Cela ouvre la voie à la deuxième partie du chapitre, où nous introduisons un nouveau cadre d’optimisation basé sur l’AdI dans les systèmes multi-classes. Nous y caractérisons les gains en termes de fraîcheur de l’information lorsque notre cadre est adopté par rapport à des approches de pointe. Le quatrième chapitre traite un environnement distribué, où les appareils accèdent au canal en utilisant la méthode d’accès multiple avec écoute de la porteuse (CSMA). CSMA est considéré comme l’un des méthodes d’accès canal distribués les plus connus et les plus répandus (par exemple, CSMA est le principal moyen d’accès en Wi-Fi). Dans ce cas, nous caractérisons, grâce à des analyses théoriques rigoureuses, le point de fonctionnement optimal qui minimise l’âge moyen du réseau.Dans la deuxième partie de la thèse, nous mettons en lumière les lacunes de l’âge de l’information et des métriques d’erreur standard dans de nombreuses applications en temps réel. Par conséquent,nous introduisons une nouvelle métrique de performance,que nous appelons l’Âge de l’Information Incorrecte (AdII). L’AdII traite ces lacunes en étendant la notion de données frais et en saisissant l’effet de détérioration que les informations incorrectes peuvent avoir avec le temps sur le système.Dans les scénarios à la fois sans et avec contraintes de ressources, nous dérivons des politiques d’échantillonnage optimales qui minimisent l’AdII.Nous soulignons également leurs avantages par rapport aux politiques optimales pour l’âge et pour les métriques d’erreur standard dans diverses applications.Nos résultats et analyses fournissent des informations clés sur la métrique d’âge et ouvrent la voie à de nouvelles orientations de recherche pour les applications de surveillance en temps réel
The proliferation of smartphones, along with the ubiquitous connectivity and cheap hardware cost, has paved the way for new applications that rely on the timely delivery of packets from one end of the network to another. From monitoring home appliances back at the house to vehicular networks where the vehicle’s velocity and position information are disseminated, these applications require fresh data to have optimal performance. To quantify this notion of freshness, the concept of the Age of Information (AoI) was born, and research attention has been put heavily on its analysis and optimization in various network settings. This thesis explores the AoI in numerous system environments,sheds light on its shortcomings, and accordingly provides solutions to them in several real-time monitoring applications.In the first part of the thesis, we focus on optimizing age-based metrics in fundamental communication systems. Specifically, in the third chapter,we examine age-based metrics in multi-class environments that are abundant in real-time applications.A simple example is vehicular networks where safety-related data are considered more sensitive.Consequently, they have a higher priority than the other data in the system. We derive a closed-form expression of each stream’s average age and provide substantial insights into the interaction between the multiple classes. This paves theway for the second part of the chapter, where we introduce a new AoI-based optimization framework in multi-class systems. Therein, we characterize the gains in terms of information freshness when our framework is adopted compared to state-of-the art approaches. The fourth chapter deals with a distributed scheduling environment, where devices contend for the channel using the well-known carrier sense multiple access scheme (CSMA). CSMAis considered one of the most renowned and widely spread distributed scheduling schemes (e.g., CSMAis the primary medium access in Wi-Fi). We characterize,through rigorous theoretical analyses, the operating point that minimizes the average AoI.In the second part of the thesis, we shed light on the shortcomings of the age of information and standard error metrics in many real-time applications.Toward that end, we introduce a new performance metric, which we refer to as the Age of Incorrect Information (AoII). AoII deals with these shortcomings as it extends the notion of fresh updates and captures the deteriorating effect wrong information can have with time on the system. In both unconstrained and resource-constraint scenarios, we derive optimal sampling policies that minimize the AoII. We also high light their advantages compared to both the age-optimal and error-optimal policies in a variety of real-life applications. Our results and analyses provide key insights into the age metric and lead the way to novel research directions for real-time monitoring applications
APA, Harvard, Vancouver, ISO, and other styles
4

Kacem, Sahraoui Ameni. "Personalized information retrieval based on time-sensitive user profile." Thesis, Toulouse 3, 2017. http://www.theses.fr/2017TOU30111/document.

Full text
Abstract:
Les moteurs de recherche, largement utilisés dans différents domaines, sont devenus la principale source d'information pour de nombreux utilisateurs. Cependant, les Systèmes de Recherche d'Information (SRI) font face à de nouveaux défis liés à la croissance et à la diversité des données disponibles. Un SRI analyse la requête soumise par l'utilisateur et explore des collections de données de nature non structurée ou semi-structurée (par exemple : texte, image, vidéo, page Web, etc.) afin de fournir des résultats qui correspondent le mieux à son intention et ses intérêts. Afin d'atteindre cet objectif, au lieu de prendre en considération l'appariement requête-document uniquement, les SRI s'intéressent aussi au contexte de l'utilisateur. En effet, le profil utilisateur a été considéré dans la littérature comme l'élément contextuel le plus important permettant d'améliorer la pertinence de la recherche. Il est intégré dans le processus de recherche d'information afin d'améliorer l'expérience utilisateur en recherchant des informations spécifiques. Comme le facteur temps a gagné beaucoup d'importance ces dernières années, la dynamique temporelle est introduite pour étudier l'évolution du profil utilisateur qui consiste principalement à saisir les changements du comportement, des intérêts et des préférences de l'utilisateur en fonction du temps et à actualiser le profil en conséquence. Les travaux antérieurs ont distingué deux types de profils utilisateurs : les profils à court-terme et ceux à long-terme. Le premier type de profil est limité aux intérêts liés aux activités actuelles de l'utilisateur tandis que le second représente les intérêts persistants de l'utilisateur extraits de ses activités antérieures tout en excluant les intérêts récents. Toutefois, pour les utilisateurs qui ne sont pas très actifs dont les activités sont peu nombreuses et séparées dans le temps, le profil à court-terme peut éliminer des résultats pertinents qui sont davantage liés à leurs intérêts personnels. Pour les utilisateurs qui sont très actifs, l'agrégation des activités récentes sans ignorer les intérêts anciens serait très intéressante parce que ce type de profil est généralement en évolution au fil du temps. Contrairement à ces approches, nous proposons, dans cette thèse, un profil utilisateur générique et sensible au temps qui est implicitement construit comme un vecteur de termes pondérés afin de trouver un compromis en unifiant les intérêts récents et anciens. Les informations du profil utilisateur peuvent être extraites à partir de sources multiples. Parmi les méthodes les plus prometteuses, nous proposons d'utiliser, d'une part, l'historique de recherche, et d'autre part les médias sociaux
Recently, search engines have become the main source of information for many users and have been widely used in different fields. However, Information Retrieval Systems (IRS) face new challenges due to the growth and diversity of available data. An IRS analyses the query submitted by the user and explores collections of data with unstructured or semi-structured nature (e.g. text, image, video, Web page etc.) in order to deliver items that best match his/her intent and interests. In order to achieve this goal, we have moved from considering the query-document matching to consider the user context. In fact, the user profile has been considered, in the literature, as the most important contextual element which can improve the accuracy of the search. It is integrated in the process of information retrieval in order to improve the user experience while searching for specific information. As time factor has gained increasing importance in recent years, the temporal dynamics are introduced to study the user profile evolution that consists mainly in capturing the changes of the user behavior, interests and preferences, and updating the profile accordingly. Prior work used to discern short-term and long-term profiles. The first profile type is limited to interests related to the user's current activities while the second one represents user's persisting interests extracted from his prior activities excluding the current ones. However, for users who are not very active, the short-term profile can eliminate relevant results which are more related to their personal interests. This is because their activities are few and separated over time. For users who are very active, the aggregation of recent activities without ignoring the old interests would be very interesting because this kind of profile is usually changing over time. Unlike those approaches, we propose, in this thesis, a generic time-sensitive user profile that is implicitly constructed as a vector of weighted terms in order to find a trade-off by unifying both current and recurrent interests. User profile information can be extracted from multiple sources. Among the most promising ones, we propose to use, on the one hand, searching history. Data from searching history can be extracted implicitly without any effort from the user and includes issued queries, their corresponding results, reformulated queries and click-through data that has relevance feedback potential. On the other hand, the popularity of Social Media makes it as an invaluable source of data used by users to express, share and mark as favorite the content that interests them
APA, Harvard, Vancouver, ISO, and other styles
5

Fujdiak, Radek. "Analýza a optimalizace datové komunikace pro telemetrické systémy v energetice." Doctoral thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2017. http://www.nusl.cz/ntk/nusl-358408.

Full text
Abstract:
Telemetry system, Optimisation, Sensoric networks, Smart Grid, Internet of Things, Sensors, Information security, Cryptography, Cryptography algorithms, Cryptosystem, Confidentiality, Integrity, Authentication, Data freshness, Non-Repudiation.
APA, Harvard, Vancouver, ISO, and other styles
6

Lewandowski, Dirk, Henry Wahlig, and Gunnar Meyer-Bautor. "The freshness of Web search engine databases." 2005. http://hdl.handle.net/10150/105302.

Full text
Abstract:
This is a preprint of an article published in the Journal of Information Science Vol. 32, No. 2, 131-148 (2006). This study measures the frequency in which search engines update their indices. Therefore, 38 websites that are updated on a daily basis were analysed within a time-span of six weeks. The analysed search engines were Google, Yahoo and MSN. We find that Google performs best overall with the most pages updated on a daily basis, but only MSN is able to update all pages within a time-span of less than 20 days. Both other engines have outliers that are quite older. In terms of indexing patterns, we find different approaches at the different engines: While MSN shows clear update patterns, Google shows some outliers and the update process of the Yahoo index seems to be quite chaotic. Implications are that the quality of different search engine indices varies and not only one engine should be used when searching for current content.
APA, Harvard, Vancouver, ISO, and other styles
7

Jayaram, Deepak. "Cooperative Caching in Vehicular Networks - Distributed Cache Invalidation Using Information Freshness." Master's thesis, 2018. http://tuprints.ulb.tu-darmstadt.de/7354/1/MasterThesis_Deepak-Jayaram_KOM-M-0622.pdf.

Full text
Abstract:
Recent advances in vehicular communications has led to significant opportunities to deploy variety of applications and services improving road safety and traffic efficiency to road users. In regard to traffic management services in distributed vehicular networks, this thesis work evaluates managing storage at vehicles efficiently as cache for moderate cellular transmission costs while still achieving correct routing decision. Road status information was disseminated to oncoming traffic in the form of cellular notifications using a reporting mechanism. High transmission costs due to redundant notifications published by all vehicles following a basic reporting mechanism: Default-approach was overcome by implementing caching at every vehicle. A cooperative based reporting mechanism utilizing cache: Cooperative-approach, was proposed to notify road status while avoiding redundant notifications. In order to account those significantly relevant vehicles for decision-making process which did not actually publish, correspondingly virtual cache entries were implemented. To incorporate the real-world scenario of varying vehicular rate observed on any road, virtual cache entries based on varying vehicular rate was modeled as Adaptive Cache Management mechanism. The combinations of proposed mechanisms were evaluated for cellular transmission costs and accuracy achieved for making correct routing decision. Simulation case studies comprising varying vehicular densities and different false detection rates were conducted to demonstrate the performance of these mechanisms. Additionally, the proposed mechanisms were evaluated in different decision-making algorithms for both information freshness in changing road conditions and for robustness despite false detections. The simulation results demonstrated that the combination of proposed mechanisms was capable of achieving realistic information accuracy enough to make correct routing decision despite false readings while keeping network costs significantly low. Furthermore, using QoI-based decision algorithm in high density vehicular networks, fast adaptability to frequently changing road conditions as well as quick recovery from false notifications by invalidating them with correct notifications were indicated.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Information freshness"

1

Modiano, Eytan, Yin Sun, Igor Kadota, and Rajat Talak. Age of Information: A New Metric for Information Freshness. Springer International Publishing AG, 2022.

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

Modiano, Eytan, Yin Sun, Igor Kadota, and Rajat Talak. Age of Information: A New Metric for Information Freshness. Springer International Publishing AG, 2019.

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

Sun, Yin, Igor Kadota, and Rajat Talak. Age of Information: A New Metric for Information Freshness. Morgan & Claypool Publishers, 2020.

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

Sun, Yin, Igor Kadota, and Rajat Talak. Age of Information: A New Metric for Information Freshness. Morgan & Claypool Publishers, 2020.

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

Modiano, Eytan, Yin Sun, R. Srikant, Igor Kadota, and Rajat Talak. Age of Information: A New Metric for Information Freshness. Morgan & Claypool Publishers, 2019.

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

Martin, Keith M. Entity Authentication. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780198788003.003.0008.

Full text
Abstract:
This chapter considers mechanisms for providing entity authentication. We begin with a discussion on randomness and why it is important in cryptography. We compare several different techniques for generating randomness. We then consider the related issue of freshness and why it is important for entity authentication. We compare several different techniques for providing freshness. We then identify various different categories of identification information which can be used in an entity authentication mechanism. We look at the role cryptography plays in supporting basic entity authentication mechanisms such as passwords. We close by examining how cryptography can be used to provide more sophisticated forms of entity authentication through the use of dynamic passwords.
APA, Harvard, Vancouver, ISO, and other styles
7

Horsfall, Mary. Fabulous Food from Every Small Garden. CSIRO Publishing, 2009. http://dx.doi.org/10.1071/9780643097957.

Full text
Abstract:
Fabulous Food from Every Small Garden shows how to grow food at home in even the smallest of spaces. It explores the reasons for growing your own food, including the many potential benefits such as improved taste, freshness and nutrition. Many types of food are covered, including vegetables, fruits, herbs, bush tucker plants and edible flowers. The book provides detailed instructions for successfully growing plants from seeds, and explains the use of organic pest and weed control and efficient watering methods. In addition, readers are shown how to improve soil fertility by making their own fertiliser. Written by the author of the best-selling Creating Your Eco-friendly Garden, this practical book also offers solutions on incorporating food plants with other plants to create beautiful gardens in spaces such as balconies and flowerbeds. This is complemented with information on innovative techniques such as aquaponics, hydroponics, wicking beds and grid gardening to achieve high productivity in small spaces. The final chapters concern growing, harvesting and storing produce, and contain some simple recipes.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Information freshness"

1

Bouneffouf, Djallel. "Freshness-Aware Thompson Sampling." In Neural Information Processing, 373–80. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-12643-2_46.

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

Garnaev, Andrey, Jing Zhong, Wuyang Zhang, Roy D. Yates, and Wade Trappe. "Proportional Fair Information Freshness Under Jamming." In Lecture Notes in Computer Science, 91–102. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-30523-9_8.

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

Liang, Zhiyao, and Rakesh M. Verma. "Complexity of Checking Freshness of Cryptographic Protocols." In Information Systems Security, 86–101. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-89862-7_6.

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

Kavitha, Veeraruna, and Eitan Altman. "Controlling Packet Drops to Improve Freshness of Information." In Network Games, Control and Optimization, 60–77. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87473-5_7.

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

Rajani, Meena, Uwe Röhm, and Akon Dey. "Consistent Freshness-Aware Caching for Multi-Object Requests." In Web Information Systems Engineering – WISE 2014, 262–77. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-11746-1_19.

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

Das, Sikha, Prabir Mondal, Md Iqbal Quraishi, Samarjit Kar, and Arif Ahmed Sekh. "Freshness Quality Detection of Tomatoes Using Computer Vision." In Communications in Computer and Information Science, 243–55. Cham: Springer Nature Switzerland, 2022. http://dx.doi.org/10.1007/978-3-031-22485-0_22.

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

Martins, Pedro, Maryam Abbasi, and Pedro Furtado. "AScale: Big/Small Data ETL and Real-Time Data Freshness." In Communications in Computer and Information Science, 315–27. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-34099-9_25.

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

Das, Sikha, Samarjit Kar, and Arif Ahmed Sekh. "FGrade: A Large Volume Dataset for Grading Tomato Freshness Quality." In Communications in Computer and Information Science, 455–66. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-1092-9_38.

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

Qi Chen, Da, Lin An, Aidin Niaparast, R. Ravi, and Oleksandr Rudenko. "Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models." In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2411–28. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2023. http://dx.doi.org/10.1137/1.9781611977554.ch93.

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

Papastavrou, Stavros, Panos K. Chrysanthis, and George Samaras. "Exploring Content Dependencies to Better Balance Performance and Freshness in Web Database Applications." In Web Information Systems Engineering - WISE 2012, 512–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-35063-4_37.

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

Conference papers on the topic "Information freshness"

1

Garnaev, Andrey, Wuyang Zhang, Jing Zhong, and Roy D. Yates. "Maintaining Information Freshness under Jamming." In IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS). IEEE, 2019. http://dx.doi.org/10.1109/infcomw.2019.8845146.

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

Bastopcu, Melih, and Sennur Ulukus. "Cache Freshness in Information Updating Systems." In 2021 55th Annual Conference on Information Sciences and Systems (CISS). IEEE, 2021. http://dx.doi.org/10.1109/ciss50987.2021.9400310.

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

Bastopcu, Melih, and Sennur Ulukus. "Partial Updates: Losing Information for Freshness." In 2020 IEEE International Symposium on Information Theory (ISIT). IEEE, 2020. http://dx.doi.org/10.1109/isit44484.2020.9174078.

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

Abu-Akleek, Fatima Khattab, and Abdallah Alma'aitah. "Information Freshness and System Performance Trading-off." In 2021 12th International Conference on Information and Communication Systems (ICICS). IEEE, 2021. http://dx.doi.org/10.1109/icics52457.2021.9464535.

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

Kam, Clement, Sastry Kompella, Gam D. Nguyen, Jeffrey E. Wieselthier, and Anthony Ephremides. "Information freshness and popularity in mobile caching." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006505.

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

Deng, Dapeng, Zhengchuan Chen, Howard H. Yang, Nikolaos Pappas, Limei Hu, Min Wang, Yunjian Jia, and Tony Q. S. Quek. "Information Freshness in A Dual Monitoring System." In GLOBECOM 2022 - 2022 IEEE Global Communications Conference. IEEE, 2022. http://dx.doi.org/10.1109/globecom48099.2022.10000990.

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

Vahdani, Elahe, Amotz Bar-Noy, Matthew P. Johnson, and Tarek Abdelzaher. "Gathering Information in Sensor Networks for Synchronized Freshness." In 2017 14th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON). IEEE, 2017. http://dx.doi.org/10.1109/sahcn.2017.7964937.

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

Han, Hao, Takashi Nakayama, Junxia Guo, and Keizo Oyama. "Towards Serving "Delicious" Information within Its Freshness Date." In WWW '15: 24th International World Wide Web Conference. New York, NY, USA: ACM, 2015. http://dx.doi.org/10.1145/2740908.2742747.

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

Feng, Songtao, and Jing Yang. "Information Freshness for Timely Detection of Status Changes." In 2020 54th Annual Conference on Information Sciences and Systems (CISS). IEEE, 2020. http://dx.doi.org/10.1109/ciss48834.2020.1570627788.

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

Li, Bohai, He Chen, Nikolaos Pappas, and Yonghui Li. "Optimizing Information Freshness in Two-Way Relay Networks." In 2020 IEEE/CIC International Conference on Communications in China (ICCC). IEEE, 2020. http://dx.doi.org/10.1109/iccc49849.2020.9238858.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Information freshness' for particular source types:
Journal articles
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