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

International Workshop on Quality of Service

作者： Huiyou Zhan Haisheng Tan Huang Xu Chi Zhang Hongqiu Ni Pengfei Zhang Weihua Shan Xiang-Yang Li CAS Key Lab of Wireless-Optical Communications University of Science and Technology of China China USTC-Deqing Alpha Innovation Research Institute Zhejiang China Algorithm Innovation Lab Huawei Cloud Computing Technologies Co. Ltd. Xi'an China

The traffic bandwidth costs comprise a significant amount of operating expenditure in CDNs, induced by the traffic from the end-users to edge servers (edge cost) and from the edge to the center servers (midgress cost). Traffic allocation is the main approach to minimizing the total bandwidth cost. The joint optimization of the total costs is challenging, specifically when the percentile charging mechanism as well as some other practical issues are considered, such as the dynamicity of midgress traffic and the granularity of traffic allocation. In this work, based on our novel miss ratio prediction mechanism, we propose the first online framework, named Iris, jointly optimizing the edge and midgress costs under the 95th percentile charging in commercial CDNs. Iris can theoretically achieve a competitive ratio of $1+\frac{p_{e}}{\beta\cdot p_{c}}$ , when the miss ratio of all domains is set as $\beta$ . Here $p_{e}$ and $p_{c}$ are the unit bandwidth price of the edge and midgress cost, respectively. Iris is tolerant to prediction errors which can be deployed in practical CDN systems. Extensive experiments based on real data indicate that Iris can dramatically reduce bandwidth costs by about 8.149% compared with the SOTA schemes, potentially saving millions of dollars per month for our large-scale commercial CDN collab.rator.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MACRO: Incentivizing Multi-Leader Game-Based Pareto-Efficient Crowdsourcing for Video Analytics 40

MACRO: Incentivizing Multi-Leader Game-Based Pareto-Efficien...

引用

40th IEEE International Conference on Data Engineering, ICDE 2024

作者： Chen, Yu Zhang, Sheng Zhou, Ziying Wang, Xiaokun Liang, Yu Chen, Ning Yan, Yuting Xiao, Mingjun Wu, Jie Qian, Zhuzhong Xu, Harry Nanjing University State Key Lab. for Novel Software Technology China School of Systems Science Beijing Normal University China School of Computer and Electronic Information School of Artificial Intelligence Nanjing Normal University China School of Computer Science and Technology University of Science and Technology of China China Temple University Center for Networked Computing United States Samueli School of Engineering University of California Computer Science Department Los Angeles United States

ISBN: (纸本)9798350317152

In recent years, many crowdsourcing platforms have emerged, using the resources of recruited workers to perform diverse outsourcing tasks, where the video analytics attracts much attention due to its practical implications. For maximum profits, platforms carefully choose the workers and determine the video analytics configurations to ensure accuracy;meanwhile, workers possess the flexibility to tailor the configurations for their indivi-dual gains, which makes it hard for platforms to optimize their profits considering the platform-worker conflicts. In this paper, we design an incentive mechanism for Multi-leader game-based video Analytics upon CROwdsourcing, named MACRO, to over-come the above situation. Under that mechanism, we first formu-late the utility optimization problems for platforms and workers, respectively. We then propose a dual ascent-based method to op-timally determine the video analytics configurations for a multi-platform game, ensuring Pareto efficiency. Moreover, in the context of a multi-leader game involving platform-worker conflicts, we design an incentive function with its incentive factor update strategy and propose an ADMM-based approach for maximizing incentives that motivate workers to contribute to the platforms' profits. Rigorous proofs demonstrate the linear convergence of the MACRO to the multi-leader Stackelberg equilibrium. Trace-driven experiments show that MACRO improves the Pareto efficiency by 26.3%, outperforming other approaches. © 2024 IEEE.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

Intersecting-boundary-sensitive fingerprinting for tampering detection of DNN models 24

Intersecting-boundary-sensitive fingerprinting for tampering...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Xiaofan Bai Chaoxiang He Xiaojing Ma Bin Benjamin Zhu Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security Microsoft School of Computer Science and Technology Huazhong University of Science and Technology and National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Cluster and Grid Computing Lab.

cloud-based AI services offer numerous benefits but also introduce vulnerabilities, allowing for tampering with deployed DNN models, ranging from injecting malicious behaviors to reducing computing resources. Fingerprint samples are generated to query models to detect such tampering. In this paper, we present Intersecting-Boundary-Sensitive Fingerprinting (IBSF), a novel method for black-box integrity verification of DNN models using only top-1 lab.ls. Recognizing that tampering with a model alters its decision boundary, IBSF crafts fingerprint samples from normal samples by maximizing the partial Shannon entropy of a selected subset of categories to position the fingerprint samples near decision boundaries where the categories in the subset intersect. These fingerprint samples are almost indistinguishable from their source samples. We theoretically establish and confirm experimentally that these fingerprint samples' expected sensitivity to tampering increases with the cardinality of the subset. Extensive evaluation demonstrates that IBSF surpasses existing state-of-the-art fingerprinting methods, particularly with larger subset cardinality, establishing its state-of-the-art performance in black-box tampering detection using only top-1 lab.ls. The IBSF code is availab.e at: https://***/CGCL-codes/IBSF.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improved Reordering Rules for Hierarchical Phrase-Based Translation

Improved Reordering Rules for Hierarchical Phrase-Based Tran...

引用

International Conference on Asian Language Processing (IALP)

作者： Shu Cai Yajuan Lû Qun Liu Chinese Academy of Sciences Institute of Computing Technology Beijing China Key Lab. of Intell. Inf. Process. Chinese Acad. of Sci. Beijing China

Hierarchical phrase-based translation model has been proven to be a simple and powerful machine translation model. However, due to the computational complexity constraints, the extraction and use of hierarchical rules are usually restricted under certain limits, and these limits could have a negative impact on the performance of the translation model, especially for reordering. This paper presents a solution to improve the reordering of hierarchical phrase-based translation model. We propose a two-step method to extract improved reordering rules with less limits. These reordering rules help both local and non-local reordering, and could be incorporated to a hierarchical phrase-based translation system easily. Experiments show that our approach achieves statistically significant improvements over the baseline system in Chinese-English translation.

关键词： Computational complexity Power system modeling

来源：评论

学校读者我要写书评

暂无评论

Grid information integration scheme based on virtual client access mode

引用

Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and technology (Natural Science Edition) 2007年第SUPPL. 2期35卷 8-11页

作者： Sun, Aobing Jin, Hai Zheng, Ran Zhang, Qin Services Computing Technology and System Key Lab. College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Cluster and Grid Computing Key Lab. College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China

VCA (virtual client access) based grid information integration strategy is proposed in this paper that brings forward one efficient application framework with loosely coupled architecture. It encapsulates the virtual clients that are realized based on the API of the information systems as grid services to enable the grid can access the information systems as real client. VCA mode can be combined with local access control and task management seamlessly, and solve the resource conflicts between grid and local users so as to support the information sharing and cooperation widely and efficiently. The experiment shows that VCA modes can support the information sharing and cooperation widely and efficiently.

关键词： Information management

来源：评论

学校读者我要写书评

暂无评论

General Self-repairing Codes for Distributed Storage Systems

General Self-repairing Codes for Distributed Storage Systems

引用

IEEE International Conference on Communications

作者： Hanxu Hou Hui Li Kenneth W. Shum Shenzhen Eng. Lab of Converged Networks Technology Shenzhen Key Lab of Cloud Computing Tech. and App. Shenzhen Graduate School Peking University Shenzhen China Institute of Network Coding The Chinese University of Hong Kong Shatin Hong Kong

In distributed storage systems, a data file is encoded and distributed to storage nodes, such that the data file can be recovered from some subsets of the nodes. Upon the failure of a storage node, we want to repair it efficiently by contacting and downloading some encoded bits from a small number of surviving nodes. Using projective-geometric self-repairing codes (PSRC), proposed by Oggier and Datta, one can repair a failed node by contacting only two nodes. However, in their construction, the number of storage nodes in the storage system is a large number, and thus the storage efficiency is low. In this paper, we investigate how to be more flexible in the number of storage nodes. The proposed code in this paper is called general projective geometric self-repairing codes (GPSRC). GPSRC reduces high redundancy of PSRC, while retains the basic property of PSRC. We present some methods for repairing a failed node, in which the number of contacted surviving nodes is flexible. These repairing methods provide tradeoff between repair-degree and repair-bandwidth.

关键词： Maintenance engineering Vectors Encoding Finite element analysis Bandwidth Galois fields Educational institutions

来源：评论

学校读者我要写书评

暂无评论

Apply the feature of entropy convergence of ACO to short the runtime of gene order

Apply the feature of entropy convergence of ACO to short the...

引用

International Conference on Genetic and Evolutionary computing

作者： Hu, Ben-Qiong Wang, Shi-Peng Jiang, Gang Pang, Chao-Yang Group of Gene Computation Key Lab. of Visual Computing and Virtual Reality of Sichuan Province Chengdu 610068 China College of Information Management Chengdu University of Technology Chengdu 610059 China Group of Gene Computation College of Mathematics and Software Science Sichuan Normal University Chengdu 610068 China College of Mathematics and Software Science Sichuan Normal University Chengdu 610068 China

ISBN: (纸本)9780769542812

Alzheimer's disease (AD) is the most common form of dementia. To find a way of cure it, gene study is necessary. And gene order is a new conception of gene study currently, where gene order refers to a permutation of genes in which similar genes are ordered together one by one, and optimal gene order can be abstracted as shortest TSP route. Currently only two types of tools are reported to calculate gene order, which are Genetic Algorithm (GA) and Ant Colony Optimization (ACO). In these two types, one bottleneck of computation is that their runtime is too long while gene data is too large. To weaken the bottleneck, in this paper, the feature of entropy convergence of ACO is used as the termination criterion of ACO to speed up the computation of AD gene order. Experiment shows that the method proposed in this paper has obvious advantage on runtime and solution quality. © 2010 IEEE.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

A light rule-based approach to english subject-verb agreement errors on the third person singular forms 29

A light rule-based approach to english subject-verb agreemen...

引用

29th Pacific Asia Conference on Language, Information and Computation, PACLIC 2015

作者： Wang, Yuzhu Zhao, Hai Shi, Dan Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai200240 China Key Lab. of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai Jiao Tong University Shanghai200240 China LangYing NLP Research Institute Shanghai Lang Ying Education Technology Co. Ltd China

Verb errors are one of the most common grammar errors made by non-native writers of English. This work especially focus on an important type of verb usage errors, subject-verb agreement for the third person singular forms, which has a high proportion in errors made by non-native English learners. Existing work has not given a satisfied solution for this task, in which those using supervised learning method usually fail to output good enough performance, and rule-based methods depend on advanced linguistic resources such as syntactic parsers. In this paper, we propose a rule-based method to detect and correct the concerned errors. The proposed method relies on a series of rules to automatically locate subject and predicate in four types of sentences. The evaluation shows that the proposed method gives state-of-The-Art performance with quite limited linguistic resources.

关键词： Errors

来源：评论

学校读者我要写书评

暂无评论

Automatic sports genre categorization and view-type classification over large-scale dataset 09

Automatic sports genre categorization and view-type classifi...

引用

17th ACM International Conference on Multimedia, MM'09, with Co-located Workshops and Symposiums

作者： Li, Lingfang Zhang, Ning Duan, Ling-Yu Huang, Qingming Du, Jun Guan, Ling Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Ryerson Multimedia Research Laboratory Ryerson University Toronto ON Canada Institute of Digital Media Peking University Beijing 100871 China Graduate University of Chinese Academy of Sciences Beijing 100190 China NEC Research Labs. China Beijing 100084 China

ISBN: (纸本)9781605586083

This paper presents a framework with two automatic tasks targeting large-scale and low quality sports video archives collected from online video streams. The framework is based on the bag of visual-words model using speeded-up robust features (SURF). The first task is sports genre categorization based on hierarchical structure. Following on the second task which is based on automatically obtained genre, views are classified using support vector machines (SVMs). As a consequence, the views classification result can be used in video parsing and highlight extraction. As compared with state-of-the-art methods, our approach is fully automatic as well as domain knowledge free and thus provides a better extensibility. Furthermore, our dataset consists of 14 sport genres with 6850 minutes in total. Both sport genre categorization and view type classification have more than 80% accuracy rates, which validate this framework's robustness and potential in web-based applications. Copyright 2009 ACM.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

HERO: Heterogeneity-aware erasure coded redundancy optimal allocation for reliable storage in distributed networks

HERO: Heterogeneity-aware erasure coded redundancy optimal a...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Guangping Xu Sheng Lin Gang Wang Xiaoguang Liu Kai Shi Hua Zhang Tianjin Key Lab. of Intelligence Computing and New Software Technology Tianjin China College of Information Tech. and Science Nankai University Tianjin China School of Computer and Communication Tianjin University of Technology Tianjin China

Heterogeneity is the natural feature in distributed networks. Different from the traditional disk array, the amount of data allocated on heterogenous peers may be not the same. To maximize the reliability of stored data objects in heterogeneous networks, the optimal allocation of erasure-coded fragments is a challenging problem constrained with heterogeneous peer availab.lities and redundancy overhead. This paper examines this optimal problem considered MDS erasure codes applied into distributed storage networks. First, we model the reliability of an allocation with the weighted-k-out-of-s model and extend its properties to efficiently calculate the reliability of an allocation; then we reduce the reliability computation of a given allocation to linear computation cost based on the weighted k-out-of-s model. Then, we deduce the problem to integer partition problem and propose two order-based search algorithms. Our experiments show that our proposed algorithms can be applied to find the optimal allocations efficiently in various practical coding cases. Furthermore, we evaluate the performance of our proposed search algorithms with some practical storage settings, and then present experimental results including the reliability, redundancy overheads and allocation pattern for the optimal allocation driven by practical network traces.

关键词： Resource management Reliability theory Availab.lity Computational modeling Redundancy Computer network reliability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：