检索结果-南通市图书馆

A PROBABILISTIC CHARACTERIZATION OF A FAULT-TOLERANT GOSSIPING ALGORITHM

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Journal of Systems science & Complexity 2009年第1期22卷 88-108页

作者： Paul PARKER department of computer science University of Texas at San Antonio One UTSA Circle

Gossiping is a popular technique for probabilistic reliable multicast （or broadcast）. However, it is often difficult to understand the behavior of gossiping algorithms in an analytic fashion. Indeed, existing analyses of gossip algorithms are either based on simulation or based on ideas borrowed from epidemic models while inheriting some features that do not seem to be appropriate for the setting of gossiping. On one hand, in epidemic spreading, an infected node typically intends to spread the infection an unbounded number of times （or rounds）; whereas in gossiping, an infected node （i.e., a node having received the message in question） may prefer to gossip the message a bounded number of times. On the other hand, the often assumed homogeneity in epidemic spreading models （especially that every node has equal contact to everyone else in the population） has been silently inherited in the gossiping literature, meaning that an expensive mcnlbership protocol is often needed for maintaining nodes＇ views. Motivated by these observations, the authors present a characterization of a popular class of fault-tolerant gossip schemes （known as ＂push-based gossiping＂） based on a novel probabilistic model, while taking the afore-mentioned factors into consideration.

关键词： Fault-tolerance gossip probabilistic broadcast reliable multicast.

CONVERGENCE RATES OF MARKOV CHAIN APPROXIMATION METHODS FOR CONTROLLED DIFFUSIONS WITH STOPPING

在线全文

学校读者我要写书评

暂无评论

Journal of Systems science & Complexity 2010年第3期23卷 600-621页

作者： Qingshuo SONG Gang George YIN department of Mathematics City University of Hong Kong 83 Tat Chee Avenue Kowloon Tong Hong Kong China department of Mathematics Wayne State University Detroit Michigan 48202 USA

This work is concerned with rates of convergence of numerical methods using Markov chainapproximation for controlled diffusions with stopping (the first exit time from a bounded region).In lieuof considering the associated finite difference schemes for Hamilton-Jacobi-Bellman (HJB) equations,a purely probabilistic approach is *** is an added difficulty due to the boundary condition,which requires the continuity of the first exit time with respect to the discrete *** prove theconvergence of the algorithm by Markov chain approximation method,a tangency problem might arise.A common approach uses certain conditions to avoid the tangency ***,by modifying thevalue function,it is demonstrated that the tangency problem will not arise in the sense of convergencein probability and in L^*** addition,controlled diffusions with a discount factor is also treated.

关键词： Controlled diffusion dynamic programming equation Markov chain approximation rate of convergence.

A Recovery Algorithm for Self-Stabilizing Communication Protocols

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Engineering and Electronics 2000年第1期11卷 38-46页

作者： Li Layuan & Li Chunlin (department of computer science & Technology, Wuhan nansportation university, 430063, P. R. China) department of computer science & Technology Wuhan Transportation University 430063 P. R. China

This paper presents a recovery algorithm for self-stabilizing communication protocols. It first describes some concepts and a formal description method for the algorithm. Then it proposes the algorithm procedures, proves its correctness and analyses its complexity. Finally, it also verifies the availability and efficiency of the algorithm by illustrating an example protocol with multi-processes.

关键词： computer networks Communication protocols Recovery algorithm Self-stabilization Multimedia communication networks.

Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments

在线全文

学校读者我要写书评

暂无评论

science in China(Series F) 2008年第7期51卷 896-909页

作者： LI XiaoPing1,2 & WU Cheng3 1 School of computer science & Engineering, Southeast university, Nanjing 210096, China 2 Key Laboratory of computer Network and Information Integration (Southeast university), Ministry of Education, Nanjing 210096, China 3 department of Automation, Tsinghua university, Beijing 100084, China School of computer science & Engineering Southeast University Nanjing China Key Laboratory of computer Network and Information Integration (Southeast university) Ministry of Education Nanjing China department of Automation Tsinghua University Beijing China

No-wait flow shops with makespan minimization are classified as NP-hard. In this paper, the optimization objective is equivalently transformed to total idle-time minimization. The independence relationship between tasks is analyzed, and objective increment properties are established for the fundamental operators of the heuristics. The quality of the new schedules generated during a heuristic is judged only by objective increments and not by the traditional method, which computes and compares the objective of a whole schedule. Based on objective increments, the time complexity of the heuristic can be decreased by one order. A seed phase is presented to generate an initial solution according to the transformed objective. Construction and improvement phases are introduced by experimental analysis. The FCH （fast composite heuristic） is proposed and compared with the most effective algorithms currently available for the considered problem. Experimental results show that the effectiveness of the FCH is similar to that of the best methods but requires far less computation time. The FCH can also be efficient in real time scheduling and rescheduling for no-wait flow shops.

关键词： no-wait flow shops heuristic makespan Tabu search

NONHOMOGENEOUS BOUNDARY VALUE PROBLEMS FOR THE KORTEWEG-DE VRIES EQUATION ON A BOUNDED DOMAIN

在线全文

学校读者我要写书评

暂无评论

Journal of Systems science & Complexity 2010年第3期23卷 499-526页

作者： Eugene F. KRAMER Bingyu ZHANG department of Mathematics Physics and Computer Science University of Cincinnati Raymond Walters College Cincinnati Ohio 45236 USA department of Mathematical sciences University of Cincinnati Cincinnati Ohio 45221 USA

This paper studies an initial-boundary-value problem (IBVP) of the Korteweg-de Vriesequation posed on a finite interval with general nonhomogeneous boundary *** thestrong Kato smoothing property of the associated linear problem,the IBVP is shown to be locallywell-posed in the space H^s(0,1) for any s≥0 via the contraction mapping principle.

关键词： KdV equation Korteweg-de Vries equation well-posed.

A Secure-Efficient Data Collection Algorithm Based on Self-Adaptive Sensing Model in Mobile Internet of Vehicles

在线全文

学校读者我要写书评

暂无评论

China Communications 2016年第2期13卷 121-129页

作者： LIANG Wei RUAN Zhiqiang TANG Mingdong LI Peng department of Software Engineering Xiamen University of TechnologyXiamenFujian361024China department of computer science Minjiang UniversityFuzhouFujian 350108China School of computer science and Engineering Hunan University of Science and TechnologyXiangtan 411201China

Existing research on data collection using wireless mobile vehicle network emphasizes the reliable delivery of ***,other performance requirements such as life cycle of nodes,stability and security are not set as primary design *** makes data collection ability of vehicular nodes in real application environment *** considering the features of nodes in wireless IoV,such as large scales of deployment,volatility and low time delay,an efficient data collection algorithm is proposed for mobile vehicle network *** adaptive sensing model is designed to establish vehicular data collection *** protocol adopts group management in model *** vehicular sensing node in group can adjust network sensing chain according to sensing distance threshold with surrounding *** will dynamically choose a combination of network sensing chains on basis of remaining energy and location characteristics of surrounding *** addition,secure data collection between sensing nodes is undertaken as *** simulation and experiments show that the vehicular node can realize secure and real-time data ***,the proposed algorithm is superior in vehicular network life cycle,power consumption and reliability of data collection by comparing to other algorithms.

关键词： wireless vehicle network datacollection protocol network sensing chain self'-adaptive sensing sensing distance threshold.

Polylogarithms and multiple zeta values from free Rota-Baxter algebras

在线全文

学校读者我要写书评

暂无评论

science China Mathematics 2010年第9期53卷 2239-2258页

作者： GUO Li1,2 & ZHANG Bin3,1Center of Mathematical sciences,Zhejiang university,Hangzhou 310027,China 2department of Mathematics and computer science,Rutgers university,Newark,NJ 07102,usa 3Yangtze Center of Mathematics,Sichuan university,Chengdu 610064,China Center of Mathematical sciences Zhejiang University Hangzhou China department of Mathematics and computer science Rutgers University Newark USA Yangtze Center of Mathematics Sichuan University Chengdu China

We show that the shuffle algebras for polylogarithms and regularized MZVs in the sense of Ihara,Kaneko and Zagier are both free commutative nonunitary Rota-Baxter algebras with one *** apply these results to show that the full sets of shuffle relations of polylogarithms and regularized MZVs are derived by a single *** also take this approach to study the extended double shuffle relations of MZVs by comparing these shuffle relations with the quasi-shuffle relations of the regularized MZVs in our previous approach of MZVs by renormalization.

关键词： multiple zeta values polylogarithms Rota-Baxter algebras

Tree wavelet approximations with applications

在线全文

学校读者我要写书评

暂无评论

science China Mathematics 2005年第5期48卷 680-702页

作者： XU Yuesheng & ZOU Qingsong department of Mathematics, Syracuse university, Syracuse, NY 13244, usa Institute of Mathematics, Academy of Mathematics and System sciences, Chinese Academy of sciences, Beijing 100080, China department of Scientific Computing and computer science, Zhongshan university, Guangzhou 510275, China department of Mathematics Syracuse University Syracuse USA Institute of Mathematics Academy of Mathematics and System Sciences Chinese Academy of Sciences Beijing China department of Scientific Computing and computer science Zhongshan University Guangzhou China

We construct a tree wavelet approximation by using a constructive greedy scheme (CGS). We define a function class which contains the functions whose piecewise polynomial approximations generated by the CGS have a prescribed global convergence rate and establish embedding properties of this class. We provide sufficient conditions on a tree index set and on bi-orthogonal wavelet bases which ensure optimal order of convergence for the wavelet approximations encoded on the tree index set using the bi-orthogonal wavelet bases. We then show that if we use the tree index set associated with the partition generated by the CGS to encode a wavelet approximation, it gives optimal order of convergence.

关键词： greedy algorithms tree wavelet approximations Besov spaces.

Irregular wavelet frames on L^2 (R^n)

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science China Mathematics 2005年第2期48卷 277-287页

作者： YANG Deyun & ZHOU Xingwei department of Information & Technology, Nankai university, Tianjin 300071, China department of Mathematics, Nankai university, Tianjin 300071, China department of computer science, Taishan College, Taian 271000, China department of Information & Technology Nankai University Tianjin China department of Mathematics Nankai University Tianjin China department of computer science Taishan College Taian China

In this paper, we present the conditions on dilation parameter {sj}j that ensure a discrete irregular wavelet system to be a frame on L2(Rn), and for the wavelet frame we consider the perturbations of translation para... 详细信息

关键词： wavelet transform, frame, wavelet frame, irregular dilation.