检索结果-南通市图书馆

维普期刊数据库

Blockchain-based immunization against kleptographic attacks

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2024年第7期67卷 172-183页

作者： Changsong JIANG Chunxiang XU Jie CHEN Kefei CHEN School of Computer Science and Engineering University of Electronic Science and Technology of China Yangtze Delta Region Institute (Huzhou) University of Electronic Science and Technology of China Department of Mathematics Hangzhou Normal University

Adversarial implementations of cryptographic primitives called kleptographic attacks cause the leakage of secret information. Subliminal channel attacks are one of the kleptographic attacks. In such attacks, backdoors are embedded in implementations of randomized algorithms to elaborately control randomness generation, such that the secrets will be leaked from biased outputs. To thwart subliminal channel attacks, double-splitting is a feasible solution, which splits the randomness generator of a randomized algorithm into two independent generators. In this paper, we instantiate double-splitting to propose a secure randomness generation algorithm dubbed SRG using two physically independent generators: ordinary and public randomness generators. Based on public blockchains, we construct the public randomness generator,which can be verified publicly. Hashes of a sufficient number of consecutive blocks that are newly confirmed on a blockchain are used to produce public randomness. In SRG, outputs from the two generators are taken as inputs of an immunization function. SRG accomplishes immunization against subliminal channel ***, we discuss the application strategies of SRG for symmetric and public-key encryption.

关键词： kleptographic attacks subliminal channel blockchain immunization randomized algorithm

An Effective randomized QoS Routing algorithm on Networks with Inaccurate Parameters

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2002年第1期17卷 38-46页

作者：王建新陈建二陈松乔 Department of Computer Science Central South University Changsha 410083 P.R. China

This paper develops an effective randomized on-demand QoS routing algorithm on networks with inaccurate link-state information. Several new techniques are proposed in the algorithm. First, the maximum safety rate and the minimum delay for each node in the network are pre-computed, which simplify the network complexity and provide the routing process with useful information. The routing process is dynamically directed by the safety rate and delay of the partial routing path developed so far and by the maximum safety rate and the minimum delay of the next node. Randomness is used at the link level and depends dynamically on the routing configuration. This provides great flexibility for the routing process, prevents the routing process from overusing certain fixed routing paths, and adequately balances the safety rate and delay of the routing path. A network testing environment has been established and five parameters are introduced to measure the performance of QoS routing *** results demonstrate that in terms of the proposed parameters, the algorithm outperforms existing QoS algorithms appearing in the literature.

关键词： QoS network routing randomized algorithm link-state information performance measure

An Improved randomized Circle Detection algorithm Using in Printed Circuit Board Locating Mark

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Applied Mathematics 2019年第10期10卷 848-861页

作者： Jingkun Liu Qi Fan Chengyi University College Jimei UniversityXiamenChina Xiamen Sinic-Tek Intelligent Technology Co. Ltd.XiamenChina

This paper presents an improved randomized Circle Detection (RCD) algorithm with the characteristic of circularity to detect randomized circle in images with complex background, which is not based on the Hough Transform. The experimental results denote that this algorithm can locate the circular mark of Printed Circuit Board (PCB).

关键词： Circle Detection randomized algorithm Characteristic of Circularity Printed Circuit Board

randomized Primal–Dual Proximal Block Coordinate Updates

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2019年第2期7卷 205-250页

作者： Xiang Gao Yang-Yang Xu Shu-Zhong Zhang Department of Industrial and Systems Engineering University of MinnesotaMinneapolisUSA Department of Mathematical Sciences Rensselaer Polytechnic InstituteTroyUSA

In this paper,we propose a randomized primal–dual proximal block coordinate updating framework for a general multi-block convex optimization model with coupled objective function and linear *** mere convexity,we establish its O(1/t)convergence rate in terms of the objective value and feasibility *** framework includes several existing algorithms as special cases such as a primal–dual method for bilinear saddle-point problems(PD-S),the proximal Jacobian alternating direction method of multipliers(Prox-JADMM)and a randomized variant of the ADMM for multi-block convex *** analysis recovers and/or strengthens the convergence properties of several existing *** example,for PD-S our result leads to the same order of convergence rate without the previously assumed boundedness condition on the constraint sets,and for Prox-JADMM the new result provides convergence rate in terms of the objective value and the feasibility *** is well known that the original ADMM may fail to converge when the number of blocks exceeds *** result shows that if an appropriate randomization procedure is invoked to select the updating blocks,then a sublinear rate of convergence in expectation can be guaranteed for multi-block ADMM,without assuming any strong *** new approach is also extended to solve problems where only a stochastic approximation of the subgradient of the objective is available,and we establish an O(1/√t)convergence rate of the extended approach for solving stochastic programming.

关键词： Primal-dual method Alternating direction method of multipliers(ADMM) randomized algorithm Iteration complexity·First-order stochastic approximation

randomized Generalized Singular Value Decomposition

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Communications on Applied Mathematics and Computation 2021年第1期3卷 137-156页

作者： Wei Wei Hui Zhang Xi Yang Xiaoping Chen College of Science Nanjing University of Aeronautics and AstronauticsNanjing 210016China College of Jincheng Nanjing University of Aeronautics and AstronauticsNanjing 211156China Department of Mathematics Taizhou UniversityTaizhou 225300Zhejiang ProvinceChina

The generalized singular value decomposition(GSVD)of two matrices with the same number of columns is a very useful tool in many practical ***,the GSVD may suffer from heavy computational time and memory requirement when the scale of the matrices is quite *** this paper,we use random projections to capture the most of the action of the matrices and propose randomized algorithms for computing a low-rank approximation of the *** error bounds of the approximation are also presented for the proposed randomized ***,some experimental results show that the proposed randomized algorithms can achieve a good accuracy with less computational cost and storage requirement.

关键词： Generalized singular value decomposition randomized algorithm Low-rank approximation Error analysis

randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Acta Mathematicae Applicatae Sinica 2005年第3期21卷 485-488页

作者： Dong-lei Du Faculty of Administration University of New Brunswick P.O. Box 4400 Fredericton NB E3B 5V4 Canada

In this paper we consider an on-line scheduling problem, where jobs with similar processing times within [1, r] arrive one by one to be scheduled in an on-line setting on two identical parallel processors without preemption. The objective is to nlinimize makespan. We devise a randomized on-line algorithm for this problem along with a lower bound.

关键词： On-line algorithm randomized algorithm scheduling preemption

Abrasive Waterjet Machining Simulation by Coupling Smoothed Particle Hydrodynamics /Finite Element Method

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Chinese Journal of Mechanical Engineering 2010年第5期23卷 568-573页

作者： WANG Jianming GAO Na GONG Wenjun School of Mechanical Engineering Shandong University Jinan 250061 China Key Laboratory of High Efficiency and Clean Mechanical Manufacture of Ministry of Education Shandong University Jinan 250061 China

In dealing with abrasive waterjet machining（AWJM） simulation,most literatures apply finite element method（FEM） to build pure waterjet models or single abrasive particle erosion *** overcome the mesh distortion caused by large deformation using FEM and to consider the effects of both water and abrasive,the smoothed particle hydrodynamics（SPH） coupled FEM modeling for AWJM simulation is presented,in which the abrasive waterjet is modeled by SPH particles and the target material is modeled by *** two parts interact through contact *** this model,abrasive waterjet with high velocity penetrating the target materials is simulated and the mechanism of erosion is *** relationships between the depth of penetration and jet parameters,including water pressure and traverse speed,etc,are analyzed based on the *** simulation results agree well with the existed experimental *** mixing multi-materials SPH particles,which contain abrasive and water,are adopted by means of the randomized algorithm and material model for the abrasive is *** study will not only provide a new powerful tool for the simulation of abrasive waterjet machining,but also be beneficial to understand its cutting mechanism and optimize the operating parameters.

关键词： abrasive waterjet machining randomized algorithm coupling SPH/FEM abrasive material models

维普期刊数据库

Anycast service model and its QoS routing algorithm

在线全文

学校读者我要写书评

暂无评论

Journal of Central South University 2001年第2期8卷 135-139页

作者： WANG Jian xin, CHEN Song qiao, CHEN Jian er (College of Information Science and Engineering, Central South University, Changsha 410083, China) College of Information Science and Engineering Central South University Changsha China

In the Internet, a group of replicated servers is commonly used in order to improve the scalability of network service. Anycast service is a new network service that can improve network load distribution and simplify certain applications. In this paper, the authors described a simple anycast service model in the Internet without significant affecting the routing and protocol processing infrastructure that was already in place, and proposed an anycast QoS routing algorithm for this model. The algorithm used randomized method to balance network load and improve its performance. Several new techniques are proposed in the algorithm, first, theminimum hops for each node are used in the algorithm, which are used as metric for computing the probability of possible out links. The metric is pre computed for each node in the network, which can simplify the network complexity and provide the routing process with useful information. Second, randomness is used at the link level and depends dynamically on the routing configuration. This provides great flexibility for the routing process, prevents the routing process from overusing certain fixed routing paths, and adequately balances the delay of the routing path. the authors assess the quality of QoS algorithm in terms of the acceptance ratio on anycast QoS requests, and the simulation results on a variety of network topologies and on various parameters show that the algorithm has good performances and can balance network load effectively.

关键词： QoS anycast service network routing randomized algorithm

An Accurate and Impartial Expert Assignment Method for Scientific Project Review

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Data and Information Science 2017年第4期2卷 65-80页

作者： Mingliang Yue Kailin Tian Tingcan Ma Wuhan Documentation and Information Center Chinese Academy of Sciences Library South West Forestry University

Purpose： This paper proposes an expert assignment method for scientific project review that considers both accuracy and impartiality. As impartial and accurate peer review is extremely important to ensure the quality and feasibility of scientific projects, enhanced methods for managing the process are needed. Design/methodology/approach： To ensure both accuracy and impartiality, we design four criteria, the reviewers＇fitness degree, research intensity, academic association, and potential conflict of interest, to express the characteristics of an appropriate peer review expert. We first formalize the expert assignment problem as an optimization problem based on the designed criteria, and then propose a randomized algorithm to solve the expert assignment problem of identifying reviewer adequacy. Findings： Simulation results show that the proposed method is quite accurate and impartial during expert assignment. Research limitations： Although the criteria used in this paper can properly show the characteristics of a good and appropriate peer review expert, more criteria/conditions can be included in the proposed scheme to further enhance accuracy and impartiality of the expert assignment. Practical implications： The proposed method can help project funding agencies （e.g. the National Natural Science Foundation of China） find better experts for project peer review. OriginaUty/value： To the authors＇ knowledge, this is the first publication that proposes an algorithm that applies an impartial approach to the project review expert assignment process. The simulation results show the effectiveness of the proposed method.

关键词： Expert assignment Accuracy Impartiality randomized algorithm

维普期刊数据库