张昭
博士 教授 博士生导师
浙江师范大学
理论计算机科学；运筹学
个性化签名
 姓名：张昭
 目前身份：在职研究人员
 担任导师情况：博士生导师
 学位：博士

学术头衔：
博士生导师
 职称：高级教授

学科领域：
计算机科学技术基础学科
 研究兴趣：理论计算机科学；运筹学
张昭，2003年6月获新疆大学理学博士学位。现为浙江师范大学特聘教授、博士生导师、浙江省“钱江学者”特聘教授、浙江省“151人才”第一层次人选。
2012年获国家自然科学优秀青年基金、2008年入选教育部新世纪优秀人才支持计划、2008年获霍英东高等院校青年教师奖、2011年获新疆科技进步一等奖、2013年获新疆青年科技奖。主持完成3项国家自然科学基金项目和4项教育部科研项目；现主持1项国家自然科学基金面上项目，参与1项国家自然科学基金重点项目和1项国家自然科学基金应急管理项目。发表学术论文140余篇，被SCI索引90余篇。已培养博士3名、硕士27名；现指导2名博士生、6名硕士。研究生招生学科方向运筹学、理论计算机科学。
研究方向：理论计算机科学；运筹学。
社会兼职：中国计算机学会理论计算机专委会委员；中国组合数学与图论学会理事；中国运筹学会数学规划分会理事；中国运筹学会图论组合分会常务理事；中国运筹学会理事。

主页访问
47

关注数
0

成果阅读
175

成果数
19
计算机研究与发展，2016，53（1）：1525
2016年01月01日
在无线传感器网络中应用虚拟骨干，可以有效地节约能量、减少干扰、延长网络寿命，在几何路由算法和网络拓扑控制等方面具有广泛的应用.虚拟骨干可以模型化为图中的连通控制集.主要从近似算法角度介绍连通控制集及其各种变形在国内外的研究现状及最新进展，侧重于研究方法和理论结果，为相关研究人员提供参考.
无线传感器网络,， 虚拟骨干,， 连通控制集,， 近似算法,， 近似比
0

15浏览

0点赞

0收藏

0分享

0下载

0评论

引用
IEEE Transactions on Dependable and Secure Computing，2015，13（6）：672  683
2015年05月14日
In a network system, a propagated failure (PF) is a failure originating from a network component that can cause extensive damages to other network components or even the failure of the entire system. Existing works on PFs have mostly assumed the deterministic effect from a component PF, i.e., a fixed subset of system components is affected whenever the PF occurs. However, in many realworld systems, the components may have different levels of protection, and the effect of damage from a component PF can be dependent upon the status of other components within the same system or the occurrence order of component failures. This paper proposes a new analytical method based on multivalued decision diagrams (MDDs) for the reliability analysis of network systems with dependent propagation effects. Particularly, new MDD modeling procedures are proposed for considering different types of dependent PF effects introduced by different protection levels. After the system MDD is generated using a new MDD combination algorithm to efficiently handle the dependent PF effects, methods for computing the network reliability and component importance measures are presented. The detailed analysis of an example network system subjected to dependent PFs is presented to illustrate the basics and application of the proposed method. It is shown that the proposed MDDbased method generates smaller model size and thus presents lower computational complexity in the model generation and evaluation than the existing Markov method and separable method.
无
0

7浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】Performability Analysis of LargeScale MultiState Computing Systems
IEEE Transactions on Computers，2017，67（1）：59  72
2017年07月14日
Modern computing systems typically use a large number of independent, nonidentical computing nodes to perform a set of coordinated computations in parallel. The computing system and its constituent computing nodes often exhibit more than two performance levels or states corresponding to different computing powers. This paper models and evaluates performability of largescale multistate computing systems, which is the probability that a computing system performs at a particular performance level. The heterogeneity in the constituent components of different nodes (due to factors such as different model generations, model suppliers, and operating environments) makes performability analysis difficult and challenging. In this paper a specification method for system performance level (SPL) is first introduced. A multivalued decision diagram (MDD) based approach is then proposed for performability analysis of multistate computing systems consisting of nodes with different state occupation probabilities, which encompasses novel and efficient MDD model generation procedures. Example and benchmark studies are performed to show that the proposed approach can offer efficient performability analysis of largescale computing systems.
无
0

15浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】Approximation Algorithm for Minimum Weight FaultTolerant Virtual Backbone in Unit Disk Graphs
IEEE/ACM Transactions on Networking，2016，25（2）：925  933
2016年09月28日
In a wireless sensor network, the virtual backbone plays an important role. Due to accidental damage or energy depletion, it is desirable that the virtual backbone is faulttolerant. A faulttolerant virtual backbone can be modeled as a kconnected mfold dominating set ((k, m)CDS for short). In this paper, we present a constant approximation algorithm for the minimum weight (k, m)CDS problem in unit disk graphs under the assumption that k and m are two fixed constants with m ≥ k. Prior to this paper, constant approximation algorithms are known for k = 1 with weight and 2 ≤ k ≤ 3 without weight. Our result is the first constant approximation algorithm for the (k, m)CDS problem with general k, m and with weight. The performance ratio is (α+5ρ) fork ≥ 3 and (α+2.5ρ) for k = 2, where α is the performance ratio for the minimum weight mfold dominating set problem and ρ is the performance ratio for the subset kconnected subgraph problem (both problems are known to have constant performance ratios).
无
0

4浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】FaultTolerant Virtual Backbone in Heterogeneous Wireless Sensor Network
IEEE/ACM Transactions on Networking，2017，25（6）：3487  349
2017年08月23日
To save energy and alleviate interference, connected dominating set (CDS) was proposed to serve as a virtual backbone of wireless sensor networks (WSNs). Because sensor nodes may fail due to accidental damages or energy depletion, it is desirable to construct a fault tolerant virtual backbone with high redundancy in both coverage and connectivity. This can be modeled as a kconnected mfold dominating set (abbreviated as (k, m)CDS) problem. A node set C ⊆ V (G) is a (k, m)CDS of graph G if every node in V(G)\C is adjacent with at least m nodes in C and the subgraph of G induced by C is kconnected. Constant approximation algorithm is known for (3, m)CDS in unit disk graph, which models homogeneous WSNs. In this paper, we present the first performance guaranteed approximation algorithm for (3, m)CDS in a heterogeneous WSN. In fact, our performance ratio is valid for any topology. The performance ratio is at most γ, where γ = α + 8 + 2 ln(2α  6) for α ≥ 4 and γ = 3α +2 ln 2 for α <; 4, and α is the performance ratio for the minimum (2, m)CDS problem. Using currently best known value of α, the performance ratio is ln δ +o(ln δ), where δ is the maximum degree of the graph, which is asymptotically best possible in view of the nonapproximability of the problem. Applying our algorithm on a unit disk graph, the performance ratio is less than 27, improving previous ratio 62.3 by a large amount for the (3, m)CDS problem on a unit disk graph.
无
0

5浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】Supporting user authorization queries in RBAC systems by role–permission reassignment
Future Generation Computer Systems，2018，88（）：707717
2018年11月01日
The User Authorization Query (UAQ) Problem is a key issue related to efficient handling of users’ access requests in Role Based Access Control (RBAC) systems. However, there may not exist any solution to a given UAQ problem due to the limitation caused by the current system state, because missing any requested permission may thwart a task, while an extra permission may bring an intolerable risk to the system. Hence, update of the role–permission assignment is needed to support the feasibility of an UAQ problem. In this paper, we study fundamental problems related to role–permission reassignment, including the RVP problem the goal of which is to determine whether a given role–permission assignment satisfies all reassignment objectives and does not violate any prerequisite constraint or permissioncapacity constraint, the RFP problem which verifies whether there exists a valid role–permission assignment, and the RGP problem which studies how to generate a valid role–permission assignment. We present the computational complexity analysis of RVP, RFP and RGP, showing that RVP is solvable in linear time, while both RFP and RGP are NPhard. We also propose an approach for RGP, which incorporates a preprocessing to decrease the size of the problem, and reduce it to an SAT problem. Finally, experimental results show the validity and effectiveness of our proposed approach.
User authorization query， Role based access control， Role–permission reassignment， Computational complexity， SAT problem
0

5浏览

0点赞

0收藏

0分享

0下载

0评论

引用
arXiv，2018，（）：
2018年03月03日
Despite the increasing popularity and successful examples of crowdsourcing, its openness overshadows important episodes when elaborate sabotage derailed or severely hindered collective efforts. A service exchange dilemma arises when noncooperation among selfinterested users, and zero social welfare is obtained at myopic equilibrium. Traditional rating protocols are not effective to overcome the inefficiency of the socially undesirable equilibrium due to specific features of crowdsourcing: a large number of anonymous users having asymmetric service requirements, different service capabilities, and dynamically joining/leaving a crowdsourcing platform with imperfect monitoring. In this paper, we develop the first gametheoretic design of the twosided rating protocol to stimulate cooperation among selfinterested users, which consists of a recommended strategy and a rating update rule. The recommended strategy recommends a desirable behavior from three predefined plans according to intrinsic parameters, while the rating update rule involves the update of ratings of both users, and uses differential punishments that punish users with different ratings differently. By quantifying necessary and sufficient conditions for a sustainable social norm, we formulate the problem of designing an optimal twosided rating protocol that maximizes the social welfare among all sustainable protocols, provide design guidelines for optimal twosided rating protocols and a lowcomplexity algorithm to select optimal design parameters in an alternate manner. Finally, illustrative results show the validity and effectiveness of our proposed protocol designed for service exchange dilemma in crowdsourcing.
无
0

4浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】PTAS for minimum kpath vertex cover in ball graph
Information Processing Letters，2017，119（）：913
2017年03月01日
A vertex set F is a kpath vertex cover () of graph G if every path of G on k vertices contains at least one vertex from F. A graph G is a ddimensional ball graph if each vertex of G corresponds to a ball in , two vertices are adjacent in G if and only if their corresponding balls have nonempty intersection. The heterogeneity of a ball graph is defined to be , where and are the largest radius and the smallest radius of those balls, respectively. In this paper, we present a PTAS for the minimum problem in a ball graph whose heterogeneity is bounded by a constant.
Approximation algorithms， kpath vertex cover， Ball graph， PTAS
0

17浏览

0点赞

0收藏

0分享

0下载

0评论

引用
【期刊论文】A simpler PTAS for connected kpath vertex cover in homogeneous wireless sensor network
Journal of Combinatorial Optimization ，2018，36（）：35–43
2018年03月28日
Because of its application in the field of security in wireless sensor networks, kpath vertex cover (VCPk) has received a lot of attention in recent years. Given a graph G=(V,E), a vertex set C⊆V is a kpath vertex cover (VCPk) of G if every path on k vertices has at least one vertex in C, and C is a connected kpath vertex cover of G (CVCPk) if furthermore the subgraph of G induced by C is connected. A homogeneous wireless sensor network can be modeled as a unit disk graph. This paper presents a new PTAS for MinCVCPk on unit disk graphs. Compared with previous PTAS given by Liu et al., our method not only simplifies the algorithm and reduces the timecomplexity, but also simplifies the analysis by a large amount.
Connected kpath vertex cover， Unit disk graph， PTAS， Approximation algorithm
0

14浏览

0点赞

0收藏

0分享

0下载

0评论

引用
Discrete Mathematics，2007，307（2）：293298
2007年01月28日
For a connected graph , an edge set is a krestrictededgecut, if is disconnected and every component of has at least k vertices. The krestrictededgeconnectivity of G, denoted by , is defined as the cardinality of a minimum krestrictededgecut. The kisoperimetricedgeconnectivity is defined as , where is the set of edges with one end in U and the other end in ⧹. In this note, we give some degree conditions for a graph to have optimal and/or .
Restrictededgeconnectivity， Isoperimetricedgeconnectivity
0

16浏览

0点赞

0收藏

0分享

0下载

0评论

引用