File Requests Research Articles

Optimizing Distributed Tiered Data Storage Systems with DITIS

Modern data storage systems are characterized by a distributed architecture as well as the presence of multiple storage tiers and caches. Both system developers and operators are challenged with the complexity of such systems as it is hard to evaluate how a configuration change will impact the workload or system performance and identify the best configuration to satisfy some performance objective. DITIS is a new simulator that models the end-to-end execution of file requests on distributed tiered storage systems that addresses the aforementioned challenges efficiently without any costly system redeployments. The demonstration will showcase the key functionalities and benefits offered by DITIS, including (i) analyzing workload traces to understand their characteristics and the behavior of the underlying storage system; (ii) running simulations with different configurations to evaluate their impact on performance; and (iii) running optimizations over custom search spaces to find the best configuration that satisfies a given objective.

ПРОТИВОДЕЙСТВИЕ ДОПИНГУ В СПОРТЕ В ПРАКТИКЕ ВРАЧА: НАПРАВЛЕНИЯ, ПРОБЛЕМЫ, РЕШЕНИЯ

Purpos of the study: to improve educational and information work on anti-doping issues. Materials and methods: a survey of 103 sports doctors of the Federal State Budgetary Institution Federal State Budgetary Institution Federal Scientific and Clinical Center for Sports Medicine and Rehabilitation of the Federal Medical and Biological Agency was conducted in 2022. Results: the research conducted indicates a number of positive trends in the processes being studied, but at the same time confirms the need to continue continuous work to improve the level of knowledge of doctors in matters of anti-doping in sports. The priority areas of this work include educational activities to develop the knowledge, skills and abilities necessary to file requests for TUEs, counseling and outreach on the use and possible risks of using nutritional supplements in athletes.

Cache Update and Delivery of Dynamic Contents: A Stochastic Game Approach

In this paper, we propose a cache update policy for wireless networks considering dynamic popularity for file requests. Our network scenario is a wireless network comprised of some cache-equipped access points (APs) which are deployed densely in an area and have connections with core network servers. We model the dynamics of file requests as Markov-modulated Poisson processes. Considering the congestion-dependent delay of APs' services and their overlapping coverage areas, we model the cache service for the cache-missed requests, as a stochastic game in which a Vickrey–Clarke–Groves (VCG) mechanism is exploited at each stage of the game as our proposed file routing policy, and the APs decide independently how to update their caches regarding the routed files. To this end, the APs' utilities are defined based on long-term average file delivery delay including the queueing delay in APs. By finding the Nash equilibrium of the game, we propose policies for both delivery and cache update of dynamic contents. Finally, by comparing numerical results of our proposed scheme with some conventional caching schemes, we show significant improvements in network performance in terms of file delivery delay in different conditions.

Optimistic online caching for batched requests

In this paper, we investigate ‘optimistic’ online caching policies, distinguished by their use of future request predictions derived, for example, from machine learning models. Traditional online optimistic policies, grounded in the Follow-The-Regularized-Leader (FTRL) algorithm, incur a higher computational cost compared to classic policies like Least Frequently Used (LFU) and Least Recently Used (LRU). This is due to each cache state update necessitating the resolution of a constrained optimization problem. To address this problem, we introduce and analyze the ‘batched’ version of two distinct FTRL-based optimistic policies. In this approach, the cache updates occur less frequently, thereby amortizing the update cost over time or over multiple requests. Rather than updating the cache with each new request, the system accumulates a batch of requests before modifying the cache content. First, we present a batched version of the Optimistic Bipartite Caching (OBC) algorithm, that works for single requests, then we introduce a new optimistic batched caching policy, the Per-Coordinate Optimistic Caching (PCOC) algorithm, derived from the per-coordinate-based FTRL. We demonstrate that these online algorithms maintain ‘vanishing regret’ in the batched case, meaning their average performance approaches over time that of an optimal static file allocation, regardless of the sequence of file requests. We then compare the performance of these two strategies with each other and against optimistic versions of LFU and LRU. Our experimental results indicate that this batched optimistic approach outperforms traditional caching policies on both stationary and real-world file request traces.

Pelaksanaan Pengarsipan Berkas Dalam Divisi Finance PT Dimensi Citra Semesta

This research aims to analyze the implementation of file archiving in the finance division of PT Dimensi Citra Semesta. The research utilizes a qualitative descriptive research method with data collection techniques including case studies, observation, interviews, and documentation. The results of this research indicate that the implementation of file archiving in the finance division of PT Dimensi Citra Semesta involves six steps: receipt, verification, numbering, grouping, storage, and file disposal. The file archiving process aligns with the ISO 15489-1:2016 standard on records management. The file archiving tools in the finance division of PT Dimensi Citra Semesta consist of both physical and electronic tools. Archiving challenges in the finance division of PT Dimensi Citra Semesta are divided into two categories: internal challenges and external challenges. Internal challenges originate from within the finance division itself, such as space limitations, file damage, input errors, file loss, and others. External challenges come from outside the finance division, such as inappropriate file requests, delayed file deliveries, file format mismatches, and others.

Lightweight Integration of a Data Cache for Opportunistic Usage of HPC Resources in HEP Workflows

A data caching setup has been implemented for the High Energy Physics (HEP) computing infrastructure in Freiburg, Germany, as a possible alternative to local long-term storage. Files are automatically cached on disk upon first request by a client, can be accessed from cache for subsequent requests, and are deleted after predefined conditions are met. The required components are provided to a dedicated HEP cluster, and, via virtual research environments, to the opportunistically used High-Performance Computing (HPC) Cluster NEMO (Neuroscience, Elementary Particle Physics, Microsystems Engineering and Materials Science). A typical HEP workflow has been implemented as benchmark test to identify any overhead introduced by the caching setup with respect to direct, non-cached data access, and to compare the performance of cached and non-cached access to several external files sources. The results indicate no significant overhead in the workflow and faster file access with the caching setup, especially for geographically distant file sources. Additionally, the hardware requirements for various numbers of parallel file requests were measured for estimating future requirements.

Memory-Rate Tradeoff for Caching With Uncoded Placement Under Nonuniform Random Demands

For a caching system with multiple users, we aim to characterize the memory-rate tradeoff for caching with uncoded cache placement, under nonuniform file popularity. Focusing on the modified coded caching scheme (MCCS) recently proposed by Yu, etal., we formulate the cache placement optimization problem for the MCCS to minimize the average delivery rate under nonuniform file popularity, restricting to a class of popularity-first placements. We then present two information-theoretic lower bounds on the average rate for caching with uncoded placement, one for general cache placements and the other restricted to the popularity-first placements. By comparing the average rate of the optimized MCCS with the lower bounds, we prove that the optimized MCCS attains the general lower bound for the two-user case, providing the exact memory-rate tradeoff. Furthermore, it attains the popularity-first-based lower bound for the case of general K users with distinct file requests. In these two cases, our results also reveal that the popularity-first placement is optimal for the MCCS, and zero-padding used in coded delivery incurs no loss of optimality. For the case of K users with redundant file requests, our analysis shows that there may exist a gap between the optimized MCCS and the lower bounds due to zero-padding. We next fully characterize the optimal popularity-first cache placement for the MCCS, which is shown to possess a simple file-grouping structure and can be computed via an efficient algorithm using closed-form expressions. Finally, we extend our study to accommodate both nonuniform file popularity and sizes, where we show that the optimized MCCS attains the lower bound for the two-user case, providing the exact memory-rate tradeoff. Numerical results show that, for general settings, the gap between the optimized MCCS and the lower bound only exists in limited cases and is very small.

Optimistic No-regret Algorithms for Discrete Caching

We take a systematic look at the problem of storing whole files in a cache with limited capacity in the context of optimistic learning, where the caching policy has access to a prediction oracle (provided by, e.g., a Neural Network). The successive file requests are assumed to be generated by an adversary, and no assumption is made on the accuracy of the oracle. In this setting, we provide a universal lower bound for prediction-assisted online caching and proceed to design a suite of policies with a range of performance-complexity trade-offs. All proposed policies offer sublinear regret bounds commensurate with the accuracy of the oracle. Our results substantially improve upon all recently-proposed online caching policies, which, being unable to exploit the oracle predictions, offer only O(√T) regret. In this pursuit, we design, to the best of our knowledge, the first comprehensive optimistic Follow-the-Perturbed leader policy, which generalizes beyond the caching problem. We also study the problem of caching files with different sizes and the bipartite network caching problem. Finally, we evaluate the efficacy of the proposed policies through extensive numerical experiments using real-world traces.

Gender Disparities in Patent Review Outcomes are More Pronounced for More Novel Patent Applications

We examine how the magnitude of disparities against female inventors in patenting outcomes varies based on novelty of the patent application. An analysis of approximately 2.8 million applications reveals that gender disparities in terms of the likelihood that an application is granted a patent, the intensity of examination it is subject to, and, conditional on it being granted, the reduction in its scope, are systematically larger for more novel applications. In line with the possibility that these disparities are driven by differential treatment of applications authored by female inventors, we find that (a) female inventors of more novel applications are more likely to file requests for continued examination following rejections, and (b) the magnitude of these disparities and their variation along the novelty continuum is larger for applications authored by inventor teams with common (vs. rare) names. These findings suggest that the social and private costs of differential recognition of the work of female and male inventors are higher than previously believed.

How accurate is eyeball measurement of curvature? A tool for hypospadias surgery

Correction of penile curvature or "chordee" is a major component in the management of hypospadias. Accurate assessment and management of penile curvature influence both short- and long-term outcomes of surgery. The objective of this study is to investigate the accuracy of eyeball measurement and how does it compare to objective measurement by standard goniometry (SG) and smartphone app goniometry (AG). A Dropbox file request link was shared with paediatric urologists on various social media platforms requesting participants to upload a picture of their index finger showing what they thought 30 degrees of curvature look like using their proximal inter phalangeal joint as the point of maximal curvature., The images were assessed using SG to measure the angle of curvature. The images were also assessed using AG by the principal investigator, a physician, a scrub nurse and a paediatric urology consultant., Statistical analysis was performed using SPSS statistics software version 26 (Armonk, NY: IBM Corp). A one sample t-test and a one-way chi squared test were used to evaluate significant frequency differences. Pearson correlation was used to compare AG measurements to test intra- and inter-observer reliability and to compare AG measurements vs SG measurements. Assuming 5-degree variability in goniometer measurements and 2-degree difference between the sample and population, the number of participants needed was calculated to be 49. Fifty-two responses were received.32.7% of respondents simulated 30° accurately (17/52). A significant proportion (23/52, 44.2%) overrepresented the degree of curvature and 23.1% (12/52) underrepresented it (p=0.01). Compared with objective measures, eyeball estimates differed by an average of 10°±1.5 SE. Measurements obtained by AG were comparable to measures obtained by SG and showed excellent intra-observer and inter-observer correlation (R=0.983, P<0.001). We demonstrated a significant discrepancy between eyeball assessment of curvature and objective measurements in a cohort of hypospadiologists. This can be very relevant to intraoperative decision making. The limitation of the study is the use of a simulated model rather than assessment of curvature in patients with hypospadias. Another limitation is the lack of standardization of the way the pictures were taken. We demonstrated a tendency among hypospadiologists to overestimate or underestimate curvature by an average of 10° on eyeball assessment. The use of App Goniometry shows excellent interobserver reliability and is comparable to standard goniometry in curvature assessment.

A Privacy Attack on Coded Caching by Colluding Users

Coded caching is beneficial due to its ability to leverage the multicast property of a wireless channel. Under specific network settings, the coded caching scheme has been shown to reveal the user file requests. In prior work, a privacy attack by a single attacker on coded caching was presented. In this letter, we focus on a relatively secure setting whereby only the intended users access the files. Nevertheless, we show that, even in this setting, privacy is compromised if the users are colluding. The time complexity of the attack on a network with $N$ files, $K$ users, and $l \leq K$ colluding users is shown to be in the order of $\sqrt {\ln (N(K-l))}N^{(K-l)/2}$ steps.

Asymptotically Optimal Online Caching on Multiple Caches With Relaying and Bypassing

Motivated by practical scenarios in areas such as Mobile Edge Computing (MEC) and Content Delivery Networks (CDNs), we study online file caching on multiple caches, where a file request might be relayed to other caches or bypassed directly to the memory when a cache miss happens. We can also choose to fetch files from the memory to caches and conduct file replacement if necessary. We take the relaying, bypassing and fetching costs altogether into consideration. We first show the inherent difficulty of the problem even when the online requests are of uniform costs. We propose an O(logK)-competitive randomized online multiple caching algorithm (named Camul) and an O(K)-competitive deterministic algorithm (named Camul-Det), where K is the total number of slots in all caches. Both of them achieve asymptotically optimal competitive ratios. Moreover, our algorithms can be implemented efficiently such that each request is processed in amortized constant time. We conduct extensive simulations on production data traces from Google and a benchmark workload from Yahoo. It shows that our algorithms dramatically outperform state-of-the-art schemes, i.e., reducing the total cost by 85% and 43% respectively compared with important baselines and their strengthened versions with request relaying. More importantly, Camul achieves such a good total cost without sacrificing other performance measures, e.g., the hit ratio, and performs consistently well on various settings of experiment parameters.

������� ����������� �����ֲ��ί ������ֲ � �����������² ������

The article analyses legal regulation of trade secret phenomenon in Ukrainian legislation as well as initiates ways of above-mentioned legislation improvement. Due to the process of information society formation in Ukraine, the issues of security and protection of rights for information resources of different access level enter into in the foreground of scientific discussions. Thus, there is intensive growth practical interest to trade secrets and other related concepts. One type of confidential information is the so-called �trade secret�. The issue of protection of trade secrets is not in fact a matter of protection of information security, because one of the main characteristics that determines the mode of access to trade secrets is the ownership of this information. The article describes the development of legislation devoted to trade secret at the contemporary stage as well as emergence of essential economic and legal conditions in Ukraine for practical implementation of legal mechanisms of commercially valuable information security and protection. The above-mentioned factors determine urgency of the issue. So called �trade secret� is a king of classified information. The issue of trade secret protection at is core is not in the framework of information security; by virtue of the fact that the key characteristic that influences the access mode to trade secret is the right of ownership of this information. The definition of trade secrets given in the Civil Code of Ukraine is formulated taking into account modern international legal approaches to the understanding of trade secrets (TRIPS and NAFTA) and at the appropriate legal and technical level, although not without certain shortcomings. This definition has a cross-sectoral significance in the system of legislation of Ukraine and is applied when clarifying the content and qualifications of not only civil but also labor, administrative, criminal, procedural and other legal relations. The aim of the article is to analyze domestic legislation in order to expose the essence of trade secret and related concepts. The author determines that the establishing of information constituting a commercial secret list, which cannot be restricted to business entities access, is not sufficient. There is the need at the level of legislation to establish a special mechanism and general criteria for determining information as s trade secret. It would help citizens to exercise their right to file requests to private business corporation. During the writing of the article the following conclusions were reached. In the case of crimes against trade secrets, in fact, the criminality of the act is determined not by law, but by order of the owner of the information or the head of the enterprise, which is not a legal act. In our opinion, this situation is absurd, especially given the imperfection of the legislation governing the ownership of information. Therefore, two ways to solve the problem can be proposed, either by legislatively establishing an exhaustive list of information that can be declared a trade secret, or by abolishing criminal liability

Optimal Throughput-Outage Analysis of Cache-Aided Wireless Multi-Hop D2D Networks

Cache-aided wireless device-to-device (D2D) networks have demonstrated more promising performance improvement for video distribution than conventional distribution methods; thus, understanding the fundamental scaling behavior of such networks is highly important. However, the existing scaling laws for multi-hop networks are not optimal even in the case of Zipf popularity distributions (gaps between upper and lower bounds are not constants); furthermore, there are no scaling law results for such networks for the more practical case of a Mandelbrot-Zipf (MZipf) popularity distribution. We thus in this work investigate the throughput-outage performance for cache-aided wireless D2D networks adopting multi-hop communications, with the MZipf popularity distribution for file requests and users distributed according to Poisson point process. We propose an achievable content caching and delivery scheme, and then analyze its performance. We obtain the optimal scaling law by showing that the achievable performance is tight to the proposed outer bound. Since the Zipf distribution is a special case of the MZipf distribution, the optimal scaling law for the networks considering the Zipf popularity distribution is also obtained, which closes the gap in literature.

Analisis Lama Waktu Penyediaan Berkas Rekam Medis Rawat Jalan untuk Pasien Lama Poli Bedah Onkologi di RSAL dr. Ramelan Surabaya Tahun 2020

Polyclinic at RSAL dr. Ramelan Surabaya which has the most number of patient visits every day is poly surgical oncology than other poly surgery which is ± 55 - 60 patients, here researchers see that with the many requests for medical record files, the supply of medical record files must be as fast as possible and must still meet existing standards. But in reality the supply of medical record files still exceeds the standard. The results of the observations I made to search for 1 file took 5 minutes until the file was recorded in the register of each poly, aiming that the file with no. The RM has been sent and then barcoded or sent via SIMRS, it should be marked that the medical record file must already be in the clinic but here the file is still placed on the table very long which is about 15 minutes and can also be more than it should be sent to the polyclinic. That way the file does not get to the clinic according to the Hospital Minimum Service Standards (SPM). The aim is to find out how long it takes to provide medical records in outpatients for poly surgical oncology patients at RUMKITAL Dr. Ramelan Surabaya. This type of research is qualitative. Data collection techniques in the form of interviews and observations. The population in this study were all outpatient medical record files for oncology surgery patients in March 2020. The results obtained from the study were the length of time the provision of outpatient medical record files for old poly surgical oncology patients exceeded the established standard that required an average time 11 minutes for each file arrived at the polyclinic.

Enhancement the Efficiency of Work with P2P System

The P2P system should be used Proximity information to minimize the load of file request and improve the efficiency of the work .Clustering peers for their physical proximity can also rise the performance of the request file. However, very few currently work in a peer group based on demands as peers on physical proximity. Although structured P2P provides more efficient files requests than unstructured P2P, it is difficult to apply because of their strictly defined topology. In this work, we intending to introduce a system for exchange a P2P file for proximity and level of interest based on structured P2P nodes that form physically block in the cluster and other groups physically close and nodes of public interest in sub-cluster based on the hierarchical topology. Querying an effective file is important for the overall P2P file exchange performance. Clustering peers from their common interests can significantly enhance the efficiency of the request file PAIS use an intelligent file replication algorithm to further rise the efficiency of the request file .Create a copy file that is often requested by a group of physically close nodes in their position. In addition, PAIS improves the search for files within the intra-system sub-cluster through various approaches. First, it further classifies interest in the sub-cluster to a number of subsections of interests and groups with common interest-free sub nodes in the group for file sharing. Secondly PAIS creates an over for each group that connects nodes of less node capacity to a higher throughput for the distributed node overload prevention request file. Third, in order to reduce the search for late files, PAIS uses a set of proactive information so that applicant can file knowledge if its requested file is in the neighboring nodes. Fourth, reduce the overhead of collecting information about files using the PAIS, collection of file information based on the Bloom Filter and the corresponding search for files distributed. Fifth, in order to improve the efficiency of file sharing, PAIS ranks the results with a blob of filters in order. Sixth, while the newly visited file is usually re-visited approach, based on the Bloom filter is improved only through the management of new information flowering filter is added to reduce the delay of file search. The experimental result of the Real-world Planet Lab Experiment shows that PAIS significantly reduces overhead and improves the efficiency of scrolling and without sharing files. In addition, the experimental results show high efficiency within the sub-research cluster of file approaches to improve file search efficiency.

Optimal Selection of Heterogeneous Network Interfaces for High-Speed Rail Communications

Integrating millimeter Wave (mmWave) and long-term evolution (LTE) sub-6 GHz bands to provide wireless services for high-speed rails (HSRs) is a promising solution to balance the ever-rising service demand and operational cost. In this paper, we optimize the network interface selection of the mmWave and LTE interfaces for HSR communications, to minimize the operational cost while satisfying the service requests of passengers. The network interface selection problem is formulated as a finite-horizon discrete-time Markov decision process (MDP) problem. Based on the file requests and associated deadlines of a passenger and the train schedule, we solve the MDP problem ahead-of-time by using dynamic programming (DP) and achieve optimal interface selection for each waypoint along the railways. Further, by exploiting the subadditivity and superadditivity of the considered problem, we reveal that an optimal switch of interfaces is only triggered at the moment when the remaining undelivered data or the elapsed time reaches their specific thresholds. Based on the thresholds, the optimal interface selection can be directly achieved for every waypoint, hence eliminating the need for DP and substantially reducing the computational complexity. The proposed algorithms are evaluated with practical train schedules. Simulation results show that the proposed algorithms can substantially reduce the operational cost by 35% in our considered simulation setting, as compared to existing alternatives.

Analisis Perhitungan Kebutuhan Tenaga Kerja Petugas Riset Rekam Medis Pusat Berdasarkan Teori WISN di RSUPN Dr. Cipto Mangunkusumo

National Center General Hospital Dr. Cipto Mangunkusumo functions as an educational hospital, so the medical record file is often used for research materials. It can be seen from the hospital data in 2019 that there were 53,963 requests for medical record files, but only 42,138 medical record files could be fulfilled by research officers, meaning that 22% of files could not be provided by research officers. If this is done continuously, it will cause a decrease in the quality of the research officer. Based on observations that have been made on 2 people from the Medical Records Research Center Dr. Cipto Mangunkusumo is known that the officer concurrently had several jobs. This causes the workload that is not in accordance with the number of officers. The purpose of this study was to analyze the workforce needs of the Central Medical Records research staff based on WISN theory at Dr. RSUPN. Cipto Mangunkusumo. This type of research uses qualitative research with 2 informants. Data collection methods are observation, interviews, and documentation. Based on the workload calculation using the WISN method, it is known that the number of workers needed in the research unit is 8 people. It is expected that with the results of the calculation of labor needs based on WISN theory can be used as an effort to plan the addition of officers to improve the quality of hospital services and in accordance with the existing workload.

Asynchronous Coded Caching With Uncoded Prefetching

Coded caching is a technique that promises huge reductions in network traffic in content-delivery networks. However, the original formulation and several subsequent contributions in the area, assume that the file requests from the users are synchronized, i.e., they arrive at the server at the same time. In this work, we formulate and study the coded caching problem when the file requests from the users arrive at different times. We assume that each user also has a prescribed deadline by which they want their request to be completed. In the offline case, we assume that the server knows the arrival times before starting transmission and in the online case, the user requests are revealed to the server over time. We present a linear programming formulation for the offline case that minimizes the overall transmission rate from the server subject to the constraint that each user meets his/her deadline. While the online case is much harder, we introduce a novel heuristic for it and show that under certain conditions, with high probability the request of each user can be satisfied with her/his deadline. Our simulation results indicate that in the presence of mild asynchronism, much of the benefit of coded caching can still be leveraged.

Online Convex Optimization for Caching Networks

We study the problem of wireless edge caching when file popularity is unknown and possibly non-stationary. A bank of $J$ caches receives file requests and a utility is accrued for each request depending on the serving cache. The network decides dynamically which files to store at each cache and how to route them, in order to maximize total utility. The request sequence is assumed to be drawn from an arbitrary distribution, capturing time-variance, temporal and spatial locality of requests. For this challenging setting, we propose the Bipartite Supergradient Caching Algorithm (BSCA) which provably exhibits no regret ( $R_{T}/T \to 0$ ). That is, as the time horizon $T$ increases, BSCA achieves (at least) the same utility with the cache configuration that we would have chosen knowing all future requests. The learning rate of the algorithm is characterized by its regret expression $R_{T}\!=\!O(\sqrt {JT})$ , which is independent of the file library size. For the single-cache case, we prove that this is the lowest attainable bound. BSCA requires at each step $J$ projections on intersections of boxes and simplices, for which we propose a tailored algorithm. Our model is the first that draws a connection between the network caching problem and Online Convex Optimization , and we demonstrate its generality by discussing various practical extensions and presenting a trace-driven comparison with state-of-the-art competitors.