Performance Evaluation最新文献

筛选
英文 中文
Optimal strategy against straightforward bidding in clock auctions 时钟拍卖中直接竞价的最优策略
IF 0.8 4区 计算机科学
Performance Evaluation Pub Date : 2025-07-23 DOI: 10.1016/j.peva.2025.102502
Jad Zeroual , Marianne Akian , Aurélien Bechler , Matthieu Chardy , Stéphane Gaubert
{"title":"Optimal strategy against straightforward bidding in clock auctions","authors":"Jad Zeroual ,&nbsp;Marianne Akian ,&nbsp;Aurélien Bechler ,&nbsp;Matthieu Chardy ,&nbsp;Stéphane Gaubert","doi":"10.1016/j.peva.2025.102502","DOIUrl":"10.1016/j.peva.2025.102502","url":null,"abstract":"<div><div>We study a model of auction representative of the 5G auction in France. We determine the optimal strategy of a bidder, assuming that the valuations of competitors are unknown to this bidder and that competitors adopt the straightforward bidding strategy. Our model is based on a Partially Observable Markov Decision Process (POMDP). This POMDP admits a concise statistics, avoiding the solution of a dynamic programming equation in the space of beliefs. In addition, under this optimal strategy, the expected gain of the bidder does not decrease if competitors deviate from straightforward bidding. We illustrate our results by numerical experiments, comparing the value of the bidder with the value of a perfectly informed one.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"169 ","pages":"Article 102502"},"PeriodicalIF":0.8,"publicationDate":"2025-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144724472","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reliability evaluation of tape library systems 磁带库系统可靠性评估
IF 1 4区 计算机科学
Performance Evaluation Pub Date : 2025-06-20 DOI: 10.1016/j.peva.2025.102501
Ilias Iliadis, Mark Lantz
{"title":"Reliability evaluation of tape library systems","authors":"Ilias Iliadis,&nbsp;Mark Lantz","doi":"10.1016/j.peva.2025.102501","DOIUrl":"10.1016/j.peva.2025.102501","url":null,"abstract":"<div><div>Magnetic tape is a digital data storage technology that has evolved continuously over the last seven decades. It provides a cost-effective way to retain the rapidly increasing volumes of data being created in recent years. The low cost per terabyte combined with tape’s low energy consumption make it an appealing option for storing infrequently accessed data and has resulted in a resurgence in use of the technology. Power and operational failures may damage tapes and lead to data loss. To protect stored data against loss and achieve high data reliability, an erasure coding scheme is employed. A theoretical model capturing the effect of tape failures and latent errors on system reliability is developed. Closed-form expressions are derived for the Mean Time to Data Loss (<span><math><mtext>MTTDL</mtext></math></span>) and the Expected Annual Fraction of Effective Data Loss (<span><math><mtext>EAFEDL</mtext></math></span>) reliability metric, which assesses losses at the file, object, or block, level. The results obtained demonstrate that, for realistic values of bit error rates, reliability is affected by the presence of latent errors. The effect of system parameters on reliability is assessed by conducting a sensitivity evaluation. The reliability improvement achieved by employing erasure coding schemes with increased capability is demonstrated. The theoretical results derived can be used to dimension and provision tape libraries to provide desired levels of data durability.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"169 ","pages":"Article 102501"},"PeriodicalIF":1.0,"publicationDate":"2025-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144338331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Virtual caching with apportioned objects for mobile virtual reality 为移动虚拟现实分配对象的虚拟缓存
IF 1 4区 计算机科学
Performance Evaluation Pub Date : 2025-06-14 DOI: 10.1016/j.peva.2025.102500
Nader Alfares, George Kesidis
{"title":"Virtual caching with apportioned objects for mobile virtual reality","authors":"Nader Alfares,&nbsp;George Kesidis","doi":"10.1016/j.peva.2025.102500","DOIUrl":"10.1016/j.peva.2025.102500","url":null,"abstract":"<div><div>We consider a content-caching system for Virtual or Augmented Reality (VR/AR) that is shared by a number of user groups. The cache could be located in an edge–cloud datacenter and the users could be mobile. Each user group operates its own LRU-list of a certain capacity in the shared cache. The length of objects simultaneously appearing in plural LRU-lists is equally divided (apportioned) among them, i.e., object sharing among the LRUs. We provide a working-set approximation for this system to quickly estimate the cache-hit probabilities for objects apportioned across user groups. We also prove that a solution to the working-set approximation exists. A way to reduce ripple evictions is discussed and some numerical performance results are provided based on Zipf-distributed object popularities. To evaluate our apportioned object sharing system in a VR context, we introduce a benchmark specifically designed for VR streaming, addressing the latency and Quality of Experience (QoE) challenges that arise due to VR’s dynamic fields of view (FoVs) and user synchronization requirements. Using the VR benchmark, we present additional numerical results for cache-hit rates and users’ QoE to illustrate the system’s effectiveness under VR streaming conditions.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"169 ","pages":"Article 102500"},"PeriodicalIF":1.0,"publicationDate":"2025-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144314617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Inference for dynamic Erdős–Rényi random graphs under regime switching 状态切换下动态Erdős-Rényi随机图的推理
IF 1 4区 计算机科学
Performance Evaluation Pub Date : 2025-06-12 DOI: 10.1016/j.peva.2025.102499
Michel Mandjes , Jiesen Wang
{"title":"Inference for dynamic Erdős–Rényi random graphs under regime switching","authors":"Michel Mandjes ,&nbsp;Jiesen Wang","doi":"10.1016/j.peva.2025.102499","DOIUrl":"10.1016/j.peva.2025.102499","url":null,"abstract":"<div><div>This paper examines a model involving two dynamic Erdős–Rényi random graphs that evolve in parallel, with edges in each graph alternating between being present and absent according to specified on- and off-time distributions. A key feature of our setup is regime switching: the graph that is observed at any given moment depends on the state of an underlying background process, which is modeled as an alternating renewal process. This modeling framework captures a common situation in various real-world applications, where the observed network is influenced by a (typically unobservable) background process. Such scenarios arise, for example, in economics, communication networks, and biological systems.</div><div>In our setup we only have access to aggregate quantities such as the number of active edges or the counts of specific subgraphs (such as stars or complete graphs) in the observed graph; importantly, we do not observe the mode. The objective is to estimate the on- and off-time distributions of the edges in each of the two dynamic Erdős–Rényi random graphs, as well as the distribution of time spent in each of the two modes. By employing parametric models for the on- and off-times and the background process, we develop a method of moments approach to estimate the relevant parameters. Experimental evaluations are conducted to demonstrate the effectiveness of the proposed method in recovering these parameters.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"169 ","pages":"Article 102499"},"PeriodicalIF":1.0,"publicationDate":"2025-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144314616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Can attacks reduce Age of Information? 攻击能减少信息时代吗?
IF 1 4区 计算机科学
Performance Evaluation Pub Date : 2025-06-02 DOI: 10.1016/j.peva.2025.102498
Josu Doncel , Mohamad Assaad
{"title":"Can attacks reduce Age of Information?","authors":"Josu Doncel ,&nbsp;Mohamad Assaad","doi":"10.1016/j.peva.2025.102498","DOIUrl":"10.1016/j.peva.2025.102498","url":null,"abstract":"<div><div>We study a monitoring system in which a single source sends status updates to a monitor through a communication channel. The communication channel is modeled as a queueing system, and we assume that attacks occur following a random process. When an attack occurs, all packets in the queueing system are discarded. While one might expect attacks to always negatively impact system performance, we demonstrate in this paper that, from the perspective of Age of Information (AoI), attacks can in some cases reduce the AoI. Our objective is to identify the conditions under which AoI is reduced and to determine the attack rate that minimizes or reduces AoI. First, we analyze single and tandem M/M/1/1 queues with preemption and show that attacks cannot reduce AoI in these cases. Next, we examine a single M/M/1/1 queue without preemption and establish necessary and sufficient conditions for the existence of an attack rate that minimizes AoI. For this scenario, we also derive an upper bound for the optimal attack rate and prove that it becomes tight when the arrival rate of updates is very high. Through numerical experiments, we observe that attacks can reduce AoI in tandem M/M/1/1 queues without preemption, as well as in preemptive M/M/1/2 and M/M/1/3 queues. Furthermore, we show that the benefit of attacks on AoI increases with the buffer size.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"169 ","pages":"Article 102498"},"PeriodicalIF":1.0,"publicationDate":"2025-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144196352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Discrete Bayesian Optimization via Machine Learning 基于机器学习的离散贝叶斯优化
IF 1 4区 计算机科学
Performance Evaluation Pub Date : 2025-05-21 DOI: 10.1016/j.peva.2025.102487
Roberto Sala, Bruno Guindani, Danilo Ardagna, Alessandra Guglielmi
{"title":"Discrete Bayesian Optimization via Machine Learning","authors":"Roberto Sala,&nbsp;Bruno Guindani,&nbsp;Danilo Ardagna,&nbsp;Alessandra Guglielmi","doi":"10.1016/j.peva.2025.102487","DOIUrl":"10.1016/j.peva.2025.102487","url":null,"abstract":"<div><div>Bayesian Optimization (BO) is a family of powerful algorithms designed to solve complex optimization problems involving expensive black-box functions. These sequential algorithms iteratively update a surrogate model of the objective function (OF), effectively balancing exploration and exploitation to identify near-optimal solutions within a limited number of iterations. Originally designed for continuous, unconstrained domains, its efficiency has inspired adaptations for discrete, constrained optimization problems. On the other hand, Machine Learning (ML) models allow accurate predictions for black-box functions, although they typically require large amounts of data for training. Leveraging the strengths of BO and ML, research tackles the challenge of identifying optimal configurations in the context of cloud computing. This paradigm has become pervasive due to its ability to provide flexible and scalable resources. Identifying the optimal hardware-software configuration is essential for minimizing costs while meeting Quality of Service constraints. This task involves solving complex optimization problems over multidimensional discrete domains and black-box objective functions and constraints, within a limited number of iterations. To address this challenge, this work introduces <em>d-MALIBOO</em>, a BO-based algorithm that integrates ML techniques to enhance the efficiency of finding near-optimal solutions in discrete and bounded domains. While BO builds the surrogate model of the OF, ML models determine the feasible region of the black-box constraints and guide the BO algorithm toward promising regions of the discrete domain. Furthermore, we introduce an <span><math><mi>ɛ</mi></math></span>-greedy approach to favor exploration in domains with multiple local optima. Experimental results show that our algorithm outperforms OpenTuner, a popular framework for constrained optimization, by reducing the average regret by 29%, and SVM-CBO, a BO-based algorithm that integrates SVM models to determine the feasible region, by 82%.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"169 ","pages":"Article 102487"},"PeriodicalIF":1.0,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144134308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimizing latency for caching with delayed hits in non-stationary environment 优化非固定环境中带有延迟命中的缓存的延迟
IF 1 4区 计算机科学
Performance Evaluation Pub Date : 2025-05-20 DOI: 10.1016/j.peva.2025.102488
Bowen Jiang, Yubo Yang, Bo Jiang
{"title":"Optimizing latency for caching with delayed hits in non-stationary environment","authors":"Bowen Jiang,&nbsp;Yubo Yang,&nbsp;Bo Jiang","doi":"10.1016/j.peva.2025.102488","DOIUrl":"10.1016/j.peva.2025.102488","url":null,"abstract":"<div><div>Caching plays a crucial role in many latency-sensitive systems, including content delivery networks, edge computing, and microprocessors. As the ratio between system throughput and transmission latency increases, delayed hits in cache problems become more prominent. In real-world scenarios, object access patterns often exhibit a non-stationary nature. In this paper, we investigate the latency optimization problem for caching with delayed hits in a non-stationary environment, where object sizes and fetching latencies are both non-uniform. We first find that given known future arrivals, evicting the object with the larger size, a higher aggregate delay due to miss and arriving the farthest in the future brings more gains in reducing latency. Following our findings, we design an online learning framework to make cache decisions more effectively. The first component of this framework utilizes historical data within the training window to estimate the object’s non-stationary arrival process, modeled as a mixture of log-gaussian distributions. Subsequently, we predict future arrivals based on this estimated distribution. According to these predicted future arrivals, we can determine the priority of eviction candidates using our defined rank function. Experimental results on four real-world traces show that our algorithm consistently reduces latency by <span><math><mrow><mn>2</mn><mtext>%</mtext><mo>−</mo><mn>10</mn><mtext>%</mtext></mrow></math></span> on average compared to state-of-the-art algorithms.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"169 ","pages":"Article 102488"},"PeriodicalIF":1.0,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144124925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Multiserver Job Queuing Model with two job classes and Cox-2 service times 具有两个作业类和Cox-2服务时间的多服务器作业队列模型
IF 1 4区 计算机科学
Performance Evaluation Pub Date : 2025-05-19 DOI: 10.1016/j.peva.2025.102486
Adityo Anggraito , Diletta Olliaro , Andrea Marin , Marco Ajmone Marsan
{"title":"The Multiserver Job Queuing Model with two job classes and Cox-2 service times","authors":"Adityo Anggraito ,&nbsp;Diletta Olliaro ,&nbsp;Andrea Marin ,&nbsp;Marco Ajmone Marsan","doi":"10.1016/j.peva.2025.102486","DOIUrl":"10.1016/j.peva.2025.102486","url":null,"abstract":"<div><div>Datacenters comprise a variety of resources (processors, memory, input/output modules, etc.) that are shared among requests for the execution of computing jobs submitted by datacenter users. Jobs differ in their frequency of arrivals, demand for resources, and execution times. Resource sharing generates contention, especially in heavily loaded systems, that must therefore implement effective scheduling policies for incoming jobs. The First-In First-Out (FIFO) policy is often used for batch jobs, but may produce under-utilization of resources, in terms of wasted servers. This is due to the fact that a job that requires many resources can block jobs arriving later that could be served because they require fewer resources. The mathematical construct often used to study this problem is the Multiserver Job Queuing Model (MJQM), where servers represent resources which are requested and used by jobs in different quantities. Unfortunately, very few explicit results are known for the MJQM, especially at realistic system loads (i.e., before saturation), and hardly any considers the case of non-exponential service time distributions. In this paper, we propose the first exact analytical model of the non-saturated MJQM in case of two classes of customers with service times having 2-phase Coxian distribution. Our analysis is based on the matrix geometric method. Our results provide insight into datacenter dynamics, thus supporting the design of more complex schedulers, capable of improving performance and energy consumption within large datacenters.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"169 ","pages":"Article 102486"},"PeriodicalIF":1.0,"publicationDate":"2025-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144131426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Controller synthesis in timed Büchi automata: Robustness and punctual guards 定时<s:1> chi自动机的控制器综合:鲁棒性和准时保护
IF 1 4区 计算机科学
Performance Evaluation Pub Date : 2025-04-05 DOI: 10.1016/j.peva.2025.102483
Benoît Barbot , Damien Busatto-Gaston , Catalin Dima , Youssouf Oualhadj
{"title":"Controller synthesis in timed Büchi automata: Robustness and punctual guards","authors":"Benoît Barbot ,&nbsp;Damien Busatto-Gaston ,&nbsp;Catalin Dima ,&nbsp;Youssouf Oualhadj","doi":"10.1016/j.peva.2025.102483","DOIUrl":"10.1016/j.peva.2025.102483","url":null,"abstract":"<div><div>We consider the synthesis problem on timed automata with Büchi objectives, where delay choices made by a controller are subjected to small perturbations. Usually, the controller needs to avoid punctual guards, such as testing the equality of a clock to a constant. In this work, we generalize to a robustness setting that allows for punctual transitions in the automaton to be taken by controller with no perturbation. In order to characterize cycles that resist perturbations in our setting, we introduce a new structural requirement on the reachability relation along an accepting cycle of the automaton. This property is formulated on the region abstraction, and generalizes the existing characterization of winning cycles in the absence of punctual guards. We show that the problem remains within <span><math><mi>PSPACE</mi></math></span> despite the presence of punctual guards.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"168 ","pages":"Article 102483"},"PeriodicalIF":1.0,"publicationDate":"2025-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143816244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A generalized result for the discrete-time two-queue randomly alternating service system 离散时间双队列随机交变服务系统的一个推广结果
IF 1 4区 计算机科学
Performance Evaluation Pub Date : 2025-04-03 DOI: 10.1016/j.peva.2025.102484
Herwig Bruneel, Arnaud Devos, Joris Walraevens
{"title":"A generalized result for the discrete-time two-queue randomly alternating service system","authors":"Herwig Bruneel,&nbsp;Arnaud Devos,&nbsp;Joris Walraevens","doi":"10.1016/j.peva.2025.102484","DOIUrl":"10.1016/j.peva.2025.102484","url":null,"abstract":"<div><div>In this paper, we revisit the discrete-time two-queue <em>randomly alternating service</em> system, where one common server is shared by two queues by allocating the server, independently from slot to slot, with fixed probabilities to either queue. Arrivals of new customers into the two-queue system occur independently from slot to slot, but may be mutually dependent within a slot. They are characterized by the joint probability generating function (<em>pgf</em>) <span><math><mrow><mi>A</mi><mrow><mo>(</mo><msub><mrow><mi>z</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>z</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></mrow></mrow></math></span> of the numbers of arrivals in both queues during one time slot. The service times of all customers are equal to exactly one time slot.</div><div>We extend various existing results with respect to the queueing behavior of this system. Specifically, we show that the <em>exact</em> solutions that were previously found for the steady-state joint pgf <span><math><mrow><mi>U</mi><mrow><mo>(</mo><msub><mrow><mi>z</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>z</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></mrow></mrow></math></span> of the system contents in both queues for the scenarios of <em>independent Bernoulli</em> arrivals, <em>identical Bernoulli</em> arrivals, <em>global geometric</em> arrivals, <em>global geometric group</em> arrivals, and the superposition of <em>identical Bernoulli</em> arrivals and <em>global geometric (group)</em> arrivals, are all special cases of a more general result, which is valid for a whole class of arrival pgfs <span><math><mrow><mi>A</mi><mrow><mo>(</mo><msub><mrow><mi>z</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msub><mrow><mi>z</mi></mrow><mrow><mn>2</mn></mrow></msub><mo>)</mo></mrow></mrow></math></span> that (among others) encompasses the aforementioned specific arrival scenarios. However, the defined class is much broader than this, and our new result allows the solution for entirely new arrival pgfs as well. We illustrate this abundantly with a large number of detailed examples. The proof of the general result is a mainly <em>algebraic</em> one and, unlike earlier studies, does not require intricate techniques from complex-function analysis.</div></div>","PeriodicalId":19964,"journal":{"name":"Performance Evaluation","volume":"168 ","pages":"Article 102484"},"PeriodicalIF":1.0,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143785629","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信