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

Corrigendum: “Provably-secure electronic cash based on certicateless partially-blind signatures”

Electronic Commerce Research and Applications 2013年第1期12卷 60-60页

作者： Lei Zhang Futai Zhang Bo Qin Shubo Liu East China Normal University Software Engineering Institute Shanghai Key Laboratory of Trustworthy Computing Shanghai China Universitat Rovira i Virgili Department of Computer Engineering and Mathematics UNESCO Chair in Data Privacy Tarragona Catalonia Spain Nanjing Normal University School of Computer Science and Technology China Xi’an University of Technology School of Science Department of Maths China Wuhan University School of Computer Science Wuhan China

来源：评论

学校读者我要写书评

暂无评论

Break index labeling of mandarin text via syntactic-to-prosodic tree mapping

Break index labeling of mandarin text via syntactic-to-proso...

引用

International Symposium on Chinese Spoken Language Processing

作者： Xiaotian Zhang Yao Qian Hai Zhao Frank K. Soong Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiaotong University Shanghai China Microsoft Research Asia Beijing China

In this study, we investigate the break index labeling problem with a syntactic-to-prosodic structure conversion. The statistical relationship between the mapped syntactic tree structure and prosodic tree structure of sentences in the training set is used to generate a Synchronous Tree Substitution Grammar (STSG) which can describe the probabilistic mapping (substitution) rules between them. For a given test sentence and the corresponding parsed syntactic tree structure, thus generated STSG can convert the syntactic tree to a prosodic tree statistically. We compare the labeling results with other approaches and show the probabilistic mapping can indeed benefit break index labeling performance.

关键词： IP networks Biological system modeling Pragmatics Abstracts Syntactics

来源：评论

学校读者我要写书评

暂无评论

SelectCast: scalable Data Aggregation Scheme in Wireless Sensor Networks

引用

IEEE Transactions on Parallel and Distributed systems 2012年第10期23卷 1958-1969页

作者： Cheng Wang Changjun Jiang Shaojie Tang Xiang-Yang Li Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Illinois Institute of Technology Chicago IL USA Department of Computer Science and Engineering Tsinghua National Laboratory for Information Science and Technology (TNLIST) University of Tongji China

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density \lambda \in [1,n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SHL) scheme and multiple-hop-length (MHL) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MHL scheme, for a practically important set of symmetric functions called divisible perfectly compressible (DPC) functions, including the mean, max, and various kinds of indicator functions, etc., the data from \Theta (n) sensors can be aggregated to the sink at the throughput of a constant order \Theta (1), implying that, our MHL scheme is indeed scalable.

关键词： Throughput Wireless sensor networks Temperature measurement Protocols Lattices Temperature sensors

来源：评论

学校读者我要写书评

暂无评论

Multicast Capacity Scaling Laws for Multihop Cognitive Networks

引用

IEEE Transactions on Mobile computing 2012年第11期11卷 1627-1639页

作者： Cheng Wang Shaojie Tang Xiang-Yang Li Changjun Jiang Key Laboratory of Embedded System and Service Computing Building of Electronics and Information Engineering Ministry of Education Shanghai China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Illinois Institute of Technology Chicago IL USA Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China Department of Computer Science and Engineering University of Tongji Shanghai China

In this paper, we study multicast capacity for cognitive networks. We consider the cognitive network model consisting of two overlapping ad hoc networks, called the primary ad hoc network (PaN) and secondary ad hoc network (SaN), respectively. PaN and SaN operate on the same space and spectrum. For PaN (or SaN, respectively), we assume that primary (or secondary, respectively) nodes are placed according to a Poisson point process of intensity n (or m, respectively) over a unit square region. We randomly choose n s (or m s , respectively) nodes as the sources of multicast sessions in PaN (or SaN, respectively), and for each primary source vp (or secondary source v s , respectively), we pick uniformly at random nd primary nodes (or md secondary nodes, respectively) as the destinations of v p (or v s , respectively). Above all, we assume that PaN can adopt the optimal protocol in terms of the throughput. Our main work is to design the multicast strategy for SaN by which the optimal throughput can be achieved, without any negative impact on the throughput for PaN in order sense. Depending on nd and n, we choose the optimal one for PaN from two strategies called percolation strategy and connectivity strategy, respectively. Subsequently, we design the corresponding throughput-optimal strategy for SaN. We derive the regimes in terms of n, n d , m, and m d in which the upper bounds on multicast capacities for PaN and SaN can be achieved simultaneously. Unicast and broadcast capacities for the cognitive network can be derived by our results as the special cases by letting n d = 1 (or m d = 1) and n d = n - 1 (or m d = m - 1), respectively, which enhances the generality of this work.

关键词： Throughput Ad hoc networks Road transportation Slabs Routing Lattices Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Practical privacy for value-added applications in vehicular ad hoc networks 5th

引用

5th International Conference on Internet and Distributed computing systems, IDCS 2012

作者： Zhang, Lei Wu, Qianhong Qin, Bo Domingo-Ferrer, Josep Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China UNESCO Chair in Data Privacy Dept. of Comp. Eng. and Maths Universitat Rovira i Virgili TarragonaCatalonia Spain Key Lab. of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan University School of Computer China Department of Maths School of Science Xi’an University of Technology China

ISBN: (纸本)9783642348822

Advances in mobile networking and information processing technologies have triggered vehicular ad hoc networks (VANETs) for traffic safety and value-added applications. Most efforts have been made to address the security concerns while little work has been done to investigate security and privacy for value-added applications in VANETs. To fill this gap, we propose a value-added application, specifically, a security and privacy preserving location-based service (LBS) scheme for VANETs. For each LBS transaction, the scheme provides authentication, integrity and non-repudiation for both the service provider and the user. A user can obtain the service in an anonymous way and hence user privacy is well protected. However, a tracing procedure can be invoked to find malicious users, thereby efficiently preventing users from abusing the anonymity provided by the system. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

AgileRegulator: A hybrid voltage regulator scheme redeeming dark silicon for power efficiency in a multicore architecture

AgileRegulator: A hybrid voltage regulator scheme redeeming ...

引用

IEEE Symposium on High-Performance computer Architecture

作者： Guihai Yan Yingmin Li Yinhe Han Xiaowei Li Minyi Guo Xiaoyao Liang State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences China Department of Computer Science and Engineering Shanghai Jiaotong University China

The widening gap between the fast-increasing transistor budget but slow-growing power delivery and system cooling capability calls for novel architectural solutions to boost energy efficiency. Leveraging the fact of surging “dark silicon” area, we propose a hybrid scheme to use both on-chip and off-chip voltage regulators, called “AgileRegulator”, for a multicore system to explore both coarse-grain and fine-grain power phases. We present two complementary algorithms: Sensitivity-Aware Application Scheduling (SAAS) and Responsiveness-Aware Application Scheduling (RAAS) to maximally achieve the energy saving potential of the hybrid regulator scheme. Experimental results show that the hybrid scheme achieves performance-energy efficiency close to per-core DVFS, without imposing much design cost. Meanwhile, the silicon overhead of this scheme is well contained into the “dark silicon”. Unlike other application specific schemes based on accelerators, the proposed scheme itself is a simple and universal solution for chip area and energy trade-offs.

关键词： System-on-a-chip Regulators Silicon Bandwidth Memory management Tuning Multicore processing

来源：评论

学校读者我要写书评

暂无评论

Asymptotic throughput for large-scale wireless networks with general node density

引用

Wireless Networks 2012年第5期19卷 559-575页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Yunhao Liu Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China The Tsinghua National Laboratory for Information Science and Technology (TNLIST) Department of Computer Science and Engineering Tongji University Shanghai China The Department of Computer Science Illinois Institute of Technology Chicago USA The TNLIST and School of Software Tsinghua University Beijing China CSE The Hong Kong University of Science and Technology Kowloon Hong Kong

We study the asymptotic throughput for a large-scale wireless ad hoc network consisting of n nodes under the generalized physical model. We directly compute the throughput of multicast sessions to unify the unicast and broadcast throughputs. We design two multicast schemes based on the so-called ordinary arterial road system and parallel arterial road system, respectively. Correspondingly, we derive the achievable multicast throughput by taking account of all possible cases of n s = ω(1) and 1 ≤ n d ≤ n − 1, rather than only the cases of $$n_s=\Uptheta(n)$$ as in most related works, where n s and n d denote the number of sessions and the number of destinations of each session, respectively. Furthermore, we consider the network with a general node density $$\lambda \in [1,n]$$ , while the models in most related works are either random dense network (RDN) or random extended network (REN) where the density is λ = n and λ = 1, respectively, which further enhances the generality of this work. Particularly, for the special case of our results by letting λ = 1 and $$n_s=\Uptheta(n)$$ , we show that for some regimes of n d , the multicast throughputs achieved by our schemes are better than those derived by the well-known percolation-based schemes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A PSO-inspired multi-robot search algorithm independent of global information

A PSO-inspired multi-robot search algorithm independent of g...

引用

IEEE Symposium on Swarm Intelligence

作者： Zhu, Qian Liang, Alei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Department of Computer Science Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9781612840529

This paper presents an algorithm that coordinates mobile robots to find the desired targets without depending on precise global information. We compare the abstract solution space in PSO and physical environment that robots will explore. According to similarities and differences between them, we introduce a PSO-inspired search algorithm to guide robots to complete the search mission. Moreover, a novel method based on Cartesian geometry for unifying relative coordinate systems will be adopted to improve system's robustness and efficiency. © 2011 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Identity-Based key-Insulated Proxy Signature Without Random Oracles

引用

Journal of shanghai Jiaotong university(science) 2011年第5期16卷 557-566页

作者：陈剑洪龙宇陈克非王永涛 Department of Computer Science and Engineering Shanghai Jiaotong University School of Computer Engineering Huaiyin Institute of Technology Shanghai Key Laboratory of Scalable Computing and System Shanghai Jiaotong University

In an identity based proxy signature (IBPS) scheme, a designated proxy signer can generate the signature on behalf of an original signer. Traditional IBPS schemes normally rely on the assumption that private keys are kept perfectly secure. However, due to viruses, worms or other break-ins allowed by operating-system holes, key exposure seems inevitable. To minimize the damage caused by key exposure in IBPS, we propose an identity-based key-insulated proxy signature (IBKIPS) scheme in the standard model, i.e. without random oracles.

关键词： key-insulated proxy signature identity-based standard model

来源：评论

学校读者我要写书评

暂无评论

An improved content-based data dissemination in human contact-based network

An improved content-based data dissemination in human contac...

引用

2011 7th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2011

作者： Jiang, Chao Peng, Tao Liang, Alei Guan, Haibing School of Software Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China Department of Computer Science Shanghai Key Laboratory of Scalable Computing and Systems Shanghai Jiao Tong University Shanghai China

ISBN: (纸本)9780769546100

Limited wireless communication devices carried by individuals make up human contact-based network. Such network often suffers from intermittent connectivity. This fact decreases successful ratio of information spreading and prolongs data delivery process. To get good performance on delivery ratio and transmission delay, providing effective data dissemination algorithm among large-scale human contact-based network is very important. In this paper, we develop an Improved Content-based Data Dissemination algorithm, which efficiently resolves data dissemination as data sources and interested receivers are agnostic of each other. In our algorithm, nodes exchange information according to respective interests with each other, simultaneously, exploit gathered history neighbor interests to dynamically adjust the probability of requesting messages not of interest to themselves and make distributed decisions on whether storing messages or not to benefit other nodes. Compared with the Epidemic algorithm and Opportunistic Content-Based Dissemination algorithm, simulation results have confirmed that our algorithm obtains the highest delivery ratio and almost the lowest transmission delay, as the buffer size and bandwidth are restricted. © 2011 IEEE.

关键词： content-based data dissemination distributed end-to-end path

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：