Libraries and archives in the digital age

Age of Incorrect Information (AoII) is a newly introduced performance metric that considers communication goals. Therefore, comparing with traditional performance metrics and the recently introduced metric - Age of Information (AoI), AoII achieves better performance in many real-life applications. However, the fundamental nature of AoII has been elusive so far. In this paper, we consider the AoII in a system where a transmitter sends updates about a multi-state Markovian source to a remote receiver through an unreliable channel. The communication goal is to minimize AoII subject to a power constraint. We cast the problem into a Constrained Markov Decision Process (CMDP) and prove that the optimal policy is a mixture of two deterministic threshold policies. Afterward, by leveraging the notion of Relative Value Iteration (RVI) and the structural properties of threshold policy, we propose an efficient algorithm to find the threshold policies as well as the mixing coefficient. Lastly, numerical results are laid out to highlight the performance of AoII-optimal policy.

This letter studies information freshness in information update systems operated with TDMA and FDMA. Information freshness is characterized by a recently introduced metric, age of information (AoI), defined as the time elapsed since the generation of the last successfully received update. In an update system with multiple users sharing the same wireless channel to send updates to a common receiver, how to divide the channel among users affects information freshness. We investigate the AoI performances of two basic multiple access schemes, TDMA and FDMA. We first derive the time-averaged AoI by estimating the packet error rate of short update packets based on Gallager’s random coding bound. For time-critical systems, we further define a new AoI metric, termed bounded AoI, which corresponds to an AoI threshold for the instantaneous AoI. Specifically, the instantaneous AoI is below the bounded AoI a large percentage of the time. We give a theoretical upper bound for bounded AoI. Our simulation results are consistent with our theoretical analysis. Although TDMA outperforms FDMA in terms of average AoI, FDMA is more robust against varying channel conditions since it gives a more stable bounded AoI across different received powers. Overall, our findings give insight to the design of practical multiple access systems with AoI requirements.

Connected vehicles transmit and receive basic safety messages that enable the use of safety applications intended to avoid crashes. The information age (IA) is the latency between the basic safety message being generated by the transmitting vehicle and received by another vehicle. The receiving vehicle’s processing time is included in the IA but, at several milliseconds, can be ignored. The IA of vehicle-to-vehicle communications needs to be kept beneath a certain threshold so as not to compromise the effectiveness of safety applications. Forward collision warning (FCW) requires a critical IA in scenarios in which a lead vehicle brakes hard and abruptly. An analytical model of FCW, with the lead vehicle coming to a complete stop, is proposed. For the host vehicle behind the lead vehicle to stop safely, an appropriate IA, perception–reaction time, and deceleration rate are required. Sensitivity analysis of the IA is performed to provide the probabilities of a safe stop for various combinations of speed and deceleration rate. Monte Carlo simulations are implemented to generate the probabilities, and perception–reaction times, speeds, and deceleration rates are formulated as probability density functions. The results show that the IA is a sensitive factor in the safe operation of an FCW application. The IA for a low-speed host vehicle is more sensitive than the IA for a high-speed host, when the host and lead vehicles are both traveling at similar speeds with a normal clearance gap. The IA is more sensitive when the host vehicle speed is low (≤40 mph) or when the lead vehicle’s deceleration rate is high (≥0.5 g).

We consider a multi-source status update system, where each source generates status update packets according to a Poisson process which are then served according to a generally distributed service time. For this multi-source M/G/1/1 queueing model, we consider a self-preemptive packet management policy and derive the moment generating functions (MGFs) of the age of information (AoI) and peak AoI of each source. According to the policy, an arriving fresh packet preempts the possible packet of the same source in the system. Furthermore, we derive the MGFs of the AoI and peak AoI for the globally preemptive and non-preemptive policies, for which only the average AoI and peak AoI have been derived earlier. Finally, we use the MGFs to derive the average AoI and peak AoI in a two-source M/G/1/1 queueing model under each policy. Numerical results show the effect of the service time distribution parameters on the average AoI. The results also highlight the importance of higher moments of the AoI.

Frame slotted Aloha (FSA) is the de facto MAC layer standard protocol in many ultra-low-power IoT applications, such as Radio Frequency Identification (RFID) and Machine to Machine (M2M) communications. As the age of information (AoI) is an emerging and critical metric for quantifying the freshness of the status update information collected in time-sensitive IoT applications, systematic analysis of AoI for FSA is called for. However, very limited work has been done on this topic despite its both theoretical and practical implications for the operation and optimization of FSA. To fill this void, this paper delivers a comprehensive analysis of AoI for four versions of FSA, namely synchronous and asynchronous FSA with and without retransmission. The core technique of our analysis is to model the AoI for FSA as Markov chains to derive statistics on the delay and inter-delivery time. Our central results consist of the lower bounds of AoI, the exact AoI expressions in the four FSA protocols and the optimum frame length for the AoI of FSA. Our analysis reveals the impact of the arrival rate and the protocol parameters on AoI, and also shows that the retransmission would improve AoI when the arrival rate is small.

The freshness of system information has attracted extensive attention and has become one of the most critical Quality of Service (QoS) indicators in industrial wireless sensor networks (IWSNs). For practical IWSNs composed of numerous components, the system freshness for a specific task is usually related to multiple and multitype sensing data. For example, in a chemical plant fire alarm system, the system controller (SC) cannot determine the fire notification until analyzing multiple types of ambient information, such as temperature, flame, carbon dioxide, and smoke. However, most existing research on freshness metrics, such as Age of Information (AoI) or Age of Processing (AoP), only considers a single-package setting with a single type of data. Therefore, to measure the system freshness accurately in IWSNs, we propose the Age of Task-oriented Information (AoTI) for industrial tasks. It measures the time elapsed of the latest analyzed results before arriving at the receiver since the generation of any type of sampling data belonging to an industrial task. Considering the time-varying and wireless environments, we aim to minimize the long-term AoTI for IWSNs applications by jointly optimizing access selections and sampling frequencies for all sensors. We first formulate this problem as a Mixed Integer Nonlinear Programming (MINLP) problem and then transform it into a Constrained Markov Decision Process (CMDP), which is further relaxed as an MDP using the Lagrangian method. Finally, we develop a Learning-based Access selection and Sampling frequency Control (LASC) algorithm and verify its superiority through extensive simulations.

Age of Information with network coding

Satellite-based Internet of Things (S-IoT) faces a fundamental trilemma: propagation delay, dynamic fading, and bandwidth scarcity. While Layer-coded Hybrid ARQ (L-HARQ) enhances reliability, its backtracking decoding introduces age ambiguity, undermining the standard Age of Information (AoI) metric and obscuring the critical trade-off between data freshness and transmission efficiency. To bridge this gap, we propose a novel cross-layer optimization framework centered on a new metric, the Cross-layer Age of Error Information (C-AoEI). We derive a closed-form expression for C-AoEI, explicitly linking freshness to system parameters, establishing an explicit analytical connection between freshness degradation and channel dynamics. Building on this, we develop a packet-level encoded L-HARQ scheme for multi-GBS scenarios and an adaptive algorithm that jointly optimizes coding and decision thresholds. Extensive simulations demonstrate the effectiveness of our proposed framework: it achieves 31.8% higher transmission efficiency and 17.2% lower C-AoEI than conventional schemes. The framework also proves robust against inter-cell interference and varying channel conditions, providing a foundation for designing efficient, latency-aware next-generation S-IoT protocols.

Age of Information (AoI) is a performance metric that captures the freshness of the information from the perspective of the destination. The AoI measures the time that elapsed since the generation of the packet that was most recently delivered to the destination. In this paper, we consider a single-hop wireless network with a number of nodes transmitting time-sensitive information to a base station and address the problem of minimizing the expected weighted sum AoI of the network while simultaneously satisfying timely-throughput constraints from the nodes. We develop four low-complexity transmission scheduling policies that attempt to minimize AoI subject to minimum throughput requirements and evaluate their performance against the optimal policy. In particular, we develop a randomized policy, a Max-Weight policy, a Drift-Plus-Penalty policy, and a Whittle’s Index policy, and show that they are guaranteed to be within a factor of two, four, two, and eight, respectively, away from the minimum AoI possible. The simulation results show that Max-Weight and Drift-Plus-Penalty outperform the other policies, both in terms of AoI and throughput, in every network configuration simulated, and achieve near-optimal performance.

On 1 December 2022, an international conference titled “The right to privacy in the digital age – in specific terms” was held at the Hungarian Academy of Sciences. The conference marked the completion of a year-long collaboration between several researchers from seven Central European countries (namely: Croatia, the Czech Republic, Hungary, Poland, Serbia, Slovakia, and Slovenia), who had been working under the guidance of Marcin Wielec to conduct research on the subject of the right to privacy in the digital age with an emphasis on specific terms. The book titled “The Right to Privacy in the Digital Age. Perspective of Analysis on Certain Central European Countries” is one of the above-mentioned research’s most important results. Other results of the research group’s significant work include an international conference, and various scholarly publications, as well as dissemination events. The research group on the right to privacy is one of the five research teams presently operating under the guidance of the Central European Professors’ Network. This contribution summarizes the conference presentations and the work of the research group.

Defining Academic Integrity - International Perspectives -- Academic Integrity in North America -- Asian Perspectives of Academic Integrity : China -- Asian Perspectives of Academic Integrity : India -- Asian Perspectives of Academic Integrity : Indonesia -- Asian Perspectives of Academic Integrity : Japan -- Asian Perspectives of Academic Integrity : Malaysia -- Educational Integrity in Australia -- European Perspectives of Academic Integrity -- Middle Eastern Perspectives of Academic Integrity : A Perspective from Egypt -- Middle Eastern Perspectives of Academic Integrity : A view from the Gulf Region -- Perspectives of Academic Integrity from Colombia -- Perspectives of Academic Integrity from Nigeria -- UK Perspectives of Academic Integrity -- Breaches of Academic Integrity -- Breaches of Academic Integrity using Collusion -- Breaches of Academic Integrity using Exam Cheating -- Breaches of Academic Integrity Using Plagiarism -- Custom Essay Writers, Freelancers and Other Paid Third Parties -- Falsification of Academic Documents -- Falsification of Data -- File Sharing and Academic Integrity -- Getting Paid Help to get the Doctorate Done -- Contextual Factors Which Impact Academic Integrity -- Academic Standards in Higher Education: Trends, Context and Prognosis -- Commercialisation and Marketisation of Higher Education -- Internationalisation of Higher Education -- Promoting Academic Integrity through Authentic Assessment Strategies -- What it Means to be a Student Today -- Who is to Blame? Motivators of Student Academic Dishonesty in Higher Education -- Academic Integrity Policy and Practice -- Adopting a Teaching and Learning Approach -- Developing a Sustainable Holistic Institutional Approach: Dealing with Realities ‘on the ground’ When Implementing an Academic Integrity Policy -- Educational Responses -- Exemplary Academic Integrity Policy -- Holistic Approach -- Start them Early and Right: Creating a Culture of Academic Integrity in Elementary Schools -- Su pporting Secondary School Students -- Plagiarism in Higher Education: An Academic Literacies Issue?- Creating Faculty Development Programming to Prevent Plagiarism: Strategies and Understandings -- International EAL Students -- Mentoring and Monitoring First-year College Writers -- Plagiarism or Patch-writing?- Scholarly Work and Meaning: Making the Conventions of Academic Integrity Signify -- Seven Metaphors Towards Originality: The Role of Bridging and Foundation Courses in Unpacking Academic Integrity for Undergraduate and Graduate Students -- Student Perspectives on Plagiarism -- Academic Integrity in the Digital Age -- Authorship, Identity and Plagiarism in the Digital Age -- Contract Cheating -- Plagiarism and the Internet -- Quantitative and Qualitative Methods to Manage Plagiarism -- Recycling Our Own Work in the Digital Age -- The Internet as a double-edged sword: temptation or vehicle for plagiarism and cheating?- Disciplinary Approaches to Academic Integrity -- Academic Integrity in Non-Text Based Disciplines -- Health and Social Care -- Humanities -- Law -- Science, Technology, Engineering and Mathematics (STEM) -- Social Sciences -- Integrity in Research and Research Training -- Research Integrity: China and U.S -- Research Integrity: International Perspectives -- Research Integrity: Introduction -- Research Integrity: Perspectives from Argentina, Brazil and U.S -- Research Integrity: Perspectives from Australia and Netherlands -- Research Integrity: Perspectives from Austria and Canada -- Research Integrity: Perspectives from Canada -- Research Integrity: Perspectives from Korea and U.S -- Integrity Versus Fraud and Corruption -- Corrupted Credentials: Plagiarised Theses, Fake Degrees, Falsified cvs, Identity -- Plagiarism in the Wider World: Celebrities, Politicians, Businesses, Journalists, Judges -- Science and Vested Interests: Sponsored Research, Secrecy, Conflicts of Interest, Ghostwriting, Hazards to Public -- Scientific Fraud: Fabrication, Data Manipulation, Shonky Statistics, etc -- Suppression of Dissent: Attacking Dissidents, Blocking Innovation, Marginalising Research Fields; The Chilling Effect -- Whistleblowing and Activism: Exposing and Opposing Abuses -- Systems Approach to Going Forward -- Creating Cultures of Integrity -- Engaging Students and Faculty -- Getting Political: What Institutions & Governments Need to Do -- Infusing Ethical Decision-Making & Acting into the Curriculum -- Leveraging Failures for the Betterment of Education -- Teaching and Learning Approach – Duplicate.

Author information for Knowledge Organization in the digital age

‘The age of information — getting smaller’ examines the technology behind the information revolution. Information can be expressed digitally as patterns of high and low voltage, or ‘bits#x2019;. Transistors can modulate this voltage, and groups of transistors linked together allow this information to be manipulated. Modern information technology is only possible thanks to the miniaturisation of electronics and the use of semiconductors. Modern techniques allow millions of transistors to be linked together on a single silicon chip. This process of miniaturisation will continue through research on quantum computing, which uses sub-atomic particles as bits, and nanotechnology, which could create machines the size of a biological cell.

Effective resource scheduling methods in certain scenarios of Industrial Internet of Things are pivotal. In time-sensitive scenarios, Age of Information is a critical indicator for measuring the freshness of data. This paper considers a densely deployed time-sensitive Industrial Internet of Things scenario. The industrial wireless device transmits data packets to the base station with limited channel resources under the constraints of Age of Information. It is assumed that each device has the capacity to store the packets it generates. The device will discard the data to alleviate the data queue backlog when the Age of Information of the data packet exceeds the threshold. We developed a new system utility equation to represent the scheduling problem and the problem is expressed as a trade-off between minimizing the average Age of Information and maximizing network throughput. Inspired by the success of reinforcement learning in decision-processing problems, we attempt to obtain an optimal scheduling strategy via deep reinforcement learning. In addition, a reward function is constructed to enable the agent to achieve improved convergence results. Compared with the baseline, our proposed algorithm can achieve better system utility and lower Age of Information violation rate.

The age of information (AoI) is a new metric to measure the timeliness of various status update systems, and hybrid automatic repeat request (HARQ) transmission scheme is usually applied to ensure higher timeliness. However, little research considers encoding delay, propagation delay, decoding delay and feedback delay in the HARQ-based coded status update system. To the best of our knowledge, in this paper, the HARQ-based Spinal coded timely status update system with all the practical delay elements is considered for the first time. We derive the average AoI expression of the system and analyze the monotony of the AoI expression to give an average AoI upper bound. Then we optimize the HARQ transmission scheme to minimize the AoI. To decrease the complexity of the optimization algorithm, we separate it into two steps. First, we optimize the puncturing pattern of Spinal codes and propose a transmission scheme under incremental tail transmission puncturing (ITTP) pattern. Second, we optimize the number of symbols in each round under the ITTP transmission scheme, and propose the optimal transmission scheme under the coarse-grained ITTP pattern. Simulation results show that the proposed transmission scheme can significantly decrease the AoI compared to the baseline transmission schemes.