检索结果-内蒙古大学图书馆

24th ACM Conference on Economics and Computation, EC 2023

作者： Feige, Uriel Huang, Xin Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot Israel Computer Science Technion - Israel Institute of Technology Haifa Israel

ISBN: (纸本)9798400701047

We consider the problem of allocating m indivisible chores to n agents with additive disvaluation (cost) functions. It is easy to show that there are picking sequences that give every agent (that uses the greedy picking strategy) a bundle of chores of disvalue at most twice her share value (maximin share, MMS, for agents of equal entitlement, and anyprice share, APS, for agents of arbitrary entitlement). Aziz, Li and Wu (2022) designed picking sequences that improve this ratio to 5/3 for the case of equal entitlement. We design picking sequences that improve the ratio to 1.733 for the case of arbitrary entitlement, and to 8/5 for the case of equal entitlement. (In fact, computer assisted analysis suggests that the ratio is smaller than 1.543 in the equal entitlement case.) We also prove a lower bound of 3/2 on the obtainable ratio when n is sufficiently *** results trivially imply that (for additive valuation over chores) in the arbitrary entitlement case, there always is an allocation that gives every agent at most 1.733APS, and in the equal entitlement case, there always is a distribution over allocations that gives every agent at most 1.6MMS ex-post, and at most the proportional share ex-ante. Neither of these implications were previously known to *** contributions of our work include improved guarantees in the equal entitlement case when n is small;introduction of the chore share as a convenient proxy to other share notions for chores;introduction of ex-ante notions of envy for risk averse agents, and enhancements to our picking sequences that eliminate such envy. © 2023 Owner/Author(s).

关键词： Additives

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Analysis of Two-Phase Queueing System with Service Rate Degradation and Heterogeneous Customers 5

Asymptotic Analysis of Two-Phase Queueing System with Servic...

引用

5th International Conference on Problems of Cybernetics and Informatics, PCI 2023

作者： Fedorova, Ekaterina Lapatin, Ivan Lizyura, Olga Moiseev, Alexander Nazarov, Anatoly Paul, Svetlana Tomsk State University Institute of Applied Mathematics and Computer Science Tomsk Russia

ISBN: (纸本)9798350319064

In the paper, we propose a mathematical model of virtual machines lifecycle in a cloud node as a queueing system with two types of customers and two phases of service with a service rate degradation. The number of servers in each phase is unlimited. We derive the approximation for the stationary probability distribution of the number of customers in the phases using asymptotic analysis method under the limit condition of growing service time. We also demonstrate the results of numerical experiments. © 2023 IEEE.

关键词： Queueing theory

来源：评论

学校读者我要写书评

暂无评论

Blockchain-based secure and transparent election and vote counting mechanism using secret sharing scheme

引用

Journal of Ambient Intelligence and Humanized Computing 2023年第10期14卷 14009-14027页

作者： Chouhan, Vikas Arora, Anshul Department of Computer Science and Engineering Indian Institute of Technology Roorkee Roorkee India Department of Applied Mathematics Delhi Technological University Delhi India

Privacy and transparency in vote counting are the most prevalent concerns these days due to the involvement of untrusted authorities in the counting process. As a result, the counting process faces significant privacy, trust, and transparency hurdles. Hence, there is a need for an efficient and trusted mechanism to resolve such problems. Blockchain technology has the potential to bring transparency and trust in several applications. Therefore, in this work, we explore blockchain technology in conjunction with a secure partitioning scheme to promote transparency, trust, and privacy between users and participating authorities in a decentralized platform. This paper presents a chaincode-based implementation of our proposed secure and verifiable vote counting mechanism that enables trust and fairness over a decentralized platform. Multiple authorities participate in the vote counting process in a trusted manner to cooperate and coordinate in a decision process over a decentralized platform. Our research exhibits that blockchain technology can eliminate the trust gaps and increase transparency and fairness in the election and vote counting procedure. We register user votes in the blockchain platform based on the secret sharing mechanism to enable fairness and openness between counting authorities. Each vote is recorded into the distributed ledger to support openness and verifiability in our mechanism. The ledger is accessible to every registered user as per the permissioned blockchain policy. We created many authorities in the blockchain network and deployed multiple smart contracts on the Hyperledger platform to analyze the feasibility of our strategy. The performance results are obtained and reported using the Hyperledger Caliper benchmark tool. The results demonstrate that the proposed chaincode-based solution achieves the highest throughput at 200–400 tps for fetching and removing contracts. We achieve the optimal latency of 18.09 s for the vote distribution contract

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of ViT Features as Local Semantic Descriptors 17th

On the Effectiveness of ViT Features as Local Semantic De...

引用

17th European Conference on computer Vision, ECCV 2022

作者： Amir, Shir Gandelsman, Yossi Bagon, Shai Dekel, Tali Department of Computer Science and Applied Mathematics The Weizmann Institute of Science Rehovot Israel Berkeley United States

ISBN: (纸本)9783031250682

We study the use of deep features extracted from a pre-trained Vision Transformer (ViT) as dense visual descriptors. We observe and empirically demonstrate that such features, when extracted from a self-supervised ViT model (DINO-ViT), exhibit several striking properties, including: (i) the features encode powerful, well-localized semantic information, at high spatial granularity, such as object parts;(ii) the encoded semantic information is shared across related, yet different object categories, and (iii) positional bias changes gradually throughout the layers. These properties allow us to design simple methods for a variety of applications, including co-segmentation, part co-segmentation and semantic correspondences. To distill the power of ViT features from convoluted design choices, we restrict ourselves to lightweight zero-shot methodologies (e.g., binning and clustering) applied directly to the features. Since our methods require no additional training nor data, they are readily applicable across a variety of domains. We show by extensive qualitative and quantitative evaluation that our simple methodologies achieve competitive results with recent state-of-the-art supervised methods, and outperform previous unsupervised methods by a large margin. Code is available in https://***/. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Degree-Based Entropy Descriptors of Graphenylene Using Topological Indices

引用

computer Modeling in Engineering & sciences 2023年第10期137卷 939-964页

作者： M.C.Shanmukha Sokjoon Lee A.Usha K.C.Shilpa Muhammad Azeem Department of Mathematics Bapuji Institute of Engineering&TechnologyDavanagere577004India Department of Computer Engineering(Smart Security) Gachon UniversitySeongnam13120South Korea Department of Mathematics Alliance School of Applied MathematicsAlliance UniversityBangalore562106India Department of Computer Science and Engineering Bapuji Institute of Engineering&TechnologyDavanagere577004India Department of Mathematics Riphah Institute of Computing and Applied SciencesRiphah International UniversityLahore54660Pakistan

Graph theory plays a significant role in the applications of chemistry,pharmacy,communication,maps,and aeronautical *** molecules of chemical compounds are modelled as a graph to study the properties of the *** geometric structure of the compound relates to a few physical properties such as boiling point,enthalpy,π-electron energy,andmolecular *** article aims to determine the practical application of graph theory by solving one of the interdisciplinary problems describing the structures of benzenoid hydrocarbons and *** topological index is an invariant of a molecular graph associated with the chemical structure,which shows the correlation of chemical structures using many physical,chemical properties and biological *** study aims to introduce some novel degree-based entropy descriptors such as ENTSO,ENTGH,ENTHG,ENTSS,ENTNSO,ENTNReZ1,ENTNReZ2 and ENTNSS using the respective topological ***,the above-mentioned entropy measures and physico-chemical properties of benzenoid hydrocarbons are fitted using linear regression models and calculated for graphenylene structure.

关键词： Topological descriptors weighted entropy graphenylene

来源：评论

学校读者我要写书评

暂无评论

Fully-Scalable MPC Algorithms for Clustering in High Dimension 51

Fully-Scalable MPC Algorithms for Clustering in High Dimensi...

引用

51st International Colloquium on Automata, Languages, and Programming, ICALP 2024

作者： Czumaj, Artur Gao, Guichen Jiang, Shaofeng H.-C. Krauthgamer, Robert Veselý, Pavel Department of Computer Science University of Warwick Coventry United Kingdom School of Computer Science Peking University Beijing China Department of Computer Science and Applied Mathematics Weizmann Institute of Science Rehovot Israel Computer Science Institute of Charles University Prague Czech Republic

ISBN: (纸本)9783959773225

We design new parallel algorithms for clustering in high-dimensional Euclidean spaces. These algorithms run in the Massively Parallel Computation (MPC) model, and are fully scalable, meaning that the local memory in each machine may be nσ for arbitrarily small fixed σ > 0. Importantly, the local memory may be substantially smaller than the number of clusters k, yet all our algorithms are fast, i.e., run in O(1) rounds. We first devise a fast MPC algorithm for O(1)-approximation of uniform Facility Location. This is the first fully-scalable MPC algorithm that achieves O(1)-approximation for any clustering problem in general geometric setting;previous algorithms only provide poly(log n)-approximation or apply to restricted inputs, like low dimension or small number of clusters k;e.g. [Bhaskara and Wijewardena, ICML’18;Cohen-Addad et al., NeurIPS’21;Cohen-Addad et al., ICML’22]. We then build on this Facility Location result and devise a fast MPC algorithm that achieves O(1)-bicriteria approximation for k-Median and for k-Means, namely, it computes (1 + Ε)k clusters of cost within O(1/Ε2)-factor of the optimum for k clusters. A primary technical tool that we introduce, and may be of independent interest, is a new MPC primitive for geometric aggregation, namely, computing for every data point a statistic of its approximate neighborhood, for statistics like range counting and nearest-neighbor search. Our implementation of this primitive works in high dimension, and is based on consistent hashing (aka sparse partition), a technique that was recently used for streaming algorithms [Czumaj et al., FOCS’22]. © Artur Czumaj, Guichen Gao, Shaofeng H.-C. Jiang, Robert Krauthgamer, and Pavel Veselý.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

One- and two-sided prediction intervals for future Pareto record values with applications

引用

Journal of Statistical Theory and Applications 2025年 1-26页

作者： Schmiedt, Anja B. Empacher, Christina Kamps, Udo Department of Computer Science and Mathematics Regensburg University of Applied Sciences Regensburg 93053 Germany Institute of Statistics RWTH Aachen University Aachen 52056 Germany

Based on upper record values in a series of observations over time from a Pareto distribution, an exact and several approximate one-sided and two-sided prediction intervals for the next record value (or for another future record value) to appear are studied and compared by means of an extensive simulation study. The performances of the prediction intervals are evaluated and recommendations are proposed for what method should be used in a given situation with respect to the form of the prediction interval on the one hand and to the tail behaviour on the other. The proposed methods are applied to insurance, environmental and sports data, where the respectively fitted Pareto distributions show a different tail behaviour. As a result, it is seen that although the number of observed record values in the presented real data applications is rather small, as it is usually the case, the selected prediction intervals are of practical use. © The Author(s) 2025.

关键词： Interval prediction Pareto distribution Real data analyses Record values Simulation study

来源：评论

学校读者我要写书评

暂无评论

A Review of Lightweight Security and Privacy for Resource-Constrained IoT Devices

引用

computers, Materials & Continua 2024年第1期78卷 31-63页

作者： Sunil Kumar Dilip Kumar Ramraj Dangi Gaurav Choudhary Nicola Dragoni Ilsun You Department of Computer Science and Engineering National Institute of Technology JamshedpurJamshedpurIndia School of Computing Science and Engineering VIT University BhopalBhopal466114India Center for Industrial Software The Maersk Mc-Kinney Moller InstituteUniversity of Southern DenmarkSonderborgOdenseDenmark Department of Applied Mathematics and Computer Science Technical University of DenmarkLyngby2800Denmark Department of Information Security Cryptologyand MathematicsKookmin UniversitySeoulSouth Korea

The widespread and growing interest in the Internet of Things(IoT)may be attributed to its usefulness in many different *** settings are probed for data,which is then transferred via linked *** are several hurdles to overcome when putting IoT into practice,from managing server infrastructure to coordinating the use of tiny *** it comes to deploying IoT,everyone agrees that security is the biggest *** is due to the fact that a large number of IoT devices exist in the physicalworld and thatmany of themhave constrained resources such as electricity,memory,processing power,and square *** research intends to analyse resource-constrained IoT devices,including RFID tags,sensors,and smart cards,and the issues involved with protecting them in such restricted *** lightweight cryptography,the information sent between these gadgets may be *** order to provide a holistic picture,this research evaluates and contrasts well-known algorithms based on their implementation cost,hardware/software efficiency,and attack resistance *** also emphasised how essential lightweight encryption is for striking a good cost-to-performance-to-security ratio.

关键词： IoT a sensor device lightweight cryptography block cipher smart card security and privacy

来源：评论

学校读者我要写书评

暂无评论

Periodic Solutions of a Second Order Nonlinear Differential Equations with Delay and Variable Coefficients in Extend b-metric Space 23

Periodic Solutions of a Second Order Nonlinear Differential ...

引用

23rd IEEE/ACIS International Conference on computer and Information science, ICIS 2023

作者： Yao, Lu Kang, Shugui Institute of Mathematics and Computer Science Shanxi Normal University Taiyuan China Institute of Applied Mathematics Shanxi Datong University Datong China

In this paper, we obtain some criteria for the existence of the periodic solution for the second order nonlinear functional differential equations with delay and variable coefficients {equation presented}, by means of... 详细信息

ISBN: (纸本)9798350345841

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Asymptotic Analysis of Retrial Queueing System MMPP/M/1 with Impatient Customers, Collisions and Unreliable Server 5

Asymptotic Analysis of Retrial Queueing System MMPP/M/1 with...

引用

5th International Conference on Problems of Cybernetics and Informatics, PCI 2023

作者： Danilyuk, Elena Kuznetsova, Daria Moiseeva, Svetlana National Research Tomsk State University Institute of Applied Mathematics and Computer Science Tomsk Russia

ISBN: (纸本)9798350319064

A queuing system with repeated calls with Markovian modulated arrival process is considered. The classical model of the RQ-system is complicated by the presence of conflicts of requests in the system, 'impatient' calls in orbit, as well as an 'unreliable' service device that breaks down and is repaired in a functioning queuing system. The process of the number of calls in the orbit is analyzed. We propose the method of asymptotic analysis under the condition of long delay and 'patience' of calls in orbit. © 2023 IEEE.

关键词： Asymptotic analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：