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

Face recognition using SIFT features under 3D meshes

Journal of Central South University 2015年第5期22卷 1817-1825页

作者：张诚谷宇章胡珂立王营冠 Key Laboratory of Wireless Sensor Network & Communication Shanghai Institute of Microsystem and Information TechnologyChinese Academy of Sciences Department of Computer Science and Engineering Shaoxing University

Expression, occlusion, and pose variations are three main challenges for 3D face recognition. A novel method is presented to address 3D face recognition using scale-invariant feature transform(SIFT) features on 3D meshes. After preprocessing, shape index extrema on the 3D facial surface are selected as keypoints in the difference scale space and the unstable keypoints are removed after two screening steps. Then, a local coordinate system for each keypoint is established by principal component analysis(PCA).Next, two local geometric features are extracted around each keypoint through the local coordinate system. Additionally, the features are augmented by the symmetrization according to the approximate left-right symmetry in human face. The proposed method is evaluated on the Bosphorus, BU-3DFE, and Gavab databases, respectively. Good results are achieved on these three datasets. As a result, the proposed method proves robust to facial expression variations, partial external occlusions and large pose changes.

关键词： 3D face recognition seale-invariant feature transform （SIFT） expression occlusion large pose changes 3D meshes

来源：评论

学校读者我要写书评

暂无评论

A robust and secure overlay storage scheme based on erasure coding

A robust and secure overlay storage scheme based on erasure ...

引用

5th International Conference on Pervasive Computing and Applications, ICPCA10

作者： Li, Chuanyou Wang, Yun School of Computer Science and Engineering Southeast University Key Lab of Computer Network and Information Integration Nanjing 210096 China

ISBN: (纸本)9781424491421

Recently, in classical P2P overlay networks, with applying replication technique, a single peer is replaced by a cluster of peers in order to tolerant Byzantine failures. In this paper, a novel robust and secure scheme for storage overlay networks is proposed by applying erasure coding technique to reduce redundancy and enhance privacy protection. For achieving a lightweight data privacy protection, encoded strips are stored and dual distinct hash functions are deployed to construct hash chains to protect location information for encoded strips. Simulation results show that with different percentage of malicious peers, by adjusting encoding parameters, the scheme is available to provide durable data storage service. ©2010 IEEE.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization of UAV Deployment and Task Computation Offloading Decision in UAV-assisted Edge Computing network 25

Joint Optimization of UAV Deployment and Task Computation Of...

引用

25th IEEE International Conferences on High Performance Computing and Communications, 9th International Conference on Data Science and Systems, 21st IEEE International Conference on Smart City and 9th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC/DSS/SmartCity/DependSys 2023

作者： Liu, Yichuan Tu, Jinbin Wang, Yun School of Computer Science and Engineering Southeast University Key Lab of Computer Network and Information Integration Moe Nanjing China

ISBN: (纸本)9798350330014

The UAVs' deployment decision and task computation offloading decision in the UAV-assisted edge computing network significantly impact the operating efficiency of edge network. On the basis of this, the Optimization Model for UAV Cluster Deployment and Computation Offloading Decision (OMUCDCOD) is established. The model jointly optimizes the number, location of UAV s, and task computation offloading decision. Different from previous studies, this model regards the terminal devices in the edge network as virtual MEC servers, and introduces the collaborative computing mode. The task computation offloading decision made can effectively utilize the computing capabilities offered by the edge network. Considering that the two problems of UAV deployment decision and task computation offloading decision are intricately interconnected, we propose a two-layer optimization algorithm combining K-Means and ant colony algorithm (ToKmAc) to solve OMUCDCOD. ToKmAc is divided into upper and lower layers to solve this optimization problem. The upper layer uses K-Means to solve the UAV deployment decision, that is, the number and location of UAVS;the lower layer employs ant colony algorithm to solve computation offloading decision. Finally, extensive experiments verify the effectiveness of OMUCDCOD and ToKmAc. © 2023 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

SEAVER: Attention Reallocation for Mitigating Distractions in Language Models for Conditional Semantic Textual Similarity Measurement

SEAVER: Attention Reallocation for Mitigating Distractions i...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Li, Baixuan Fan, Yunlong Gao, Zhiqiang School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

ISBN: (纸本)9798891761681

Conditional Semantic Textual Similarity (C-STS) introduces specific limiting conditions to the traditional Semantic Textual Similarity (STS) task, posing challenges for STS models. Language models employing cross-encoding demonstrate satisfactory performance in STS, yet their effectiveness significantly diminishes in C-STS. In this work, we argue that the failure is due to the fact that the redundant information in the text distracts language models from the required condition-relevant information. To alleviate this, we propose SElf-Augmentation Via SElf-Reweighting (SEAVER), which, based solely on models' internal attention and without the need for external auxiliary information, adaptively reallocates the model's attention weights by emphasizing the importance of condition-relevant tokens. On the C-STS-2023 test set, SEAVER consistently improves performance of all million-scale fine-tuning baseline models (up to around 3 points), and even surpasses performance of billion-scale few-shot prompted large language models (such as GPT-4). Our code is available at https://***/BaixuanLi/SEAVER. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Modeling and Defending Passive Worms over Unstructured Peer-to-Peer networks

引用

Transactions of Tianjin University 2008年第1期14卷 66-72页

作者：王方伟张运凯马建峰 Key Laboratory of Computer Networks and Information Security of Ministry of Education Xidian University Network Center Hebei Normal University

Passive worms can passively propagate through embedding themselves into some sharing files, which can result in significant damage to unstructured P2P networks. To study the passive worm behaviors, this paper firstly analyzes and obtains the average delay for all peers in the whole transmitting process due to the limitation of network throughput, and then proposes a mathematical model for the propagation of passive worms over the unstructured P2P networks. The model mainly takes the effect of the network throughput into account, and applies a new healthy files dissemination-based defense strategy according to the file popularity which follows the Zipf distribution. The simulation results show that the propagation of passive worms is mainly governed by the number of hops, initially infected files and uninfected files. The larger the number of hops, the more rapidly the passive worms propagate. If the number of the initially infected files is increased by the attackers, the propagation speed of passive worms increases obviously. A larger size of the uninfected file results in a better attack performance. However, the number of files generated by passive worms is not an important factor governing the propagation of passive worms. The effectiveness of healthy files dissemination strategy is verified. This model can provide a guideline in the control of unstructured P2P networks as well as passive worm defense.

关键词： network security unstructured peer-to-peer networks passive worms propagationmodel patch dissemination strategy

来源：评论

学校读者我要写书评

暂无评论

Forgeability of Wang-Zhu-Feng-Yau’s Attribute-Based Signature with Policy-and-Endorsement Mechanism

引用

Journal of computer Science & Technology 2013年第4期28卷 743-748页

作者：葛爱军黄欣沂陈成马传贵张锐 State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Fujian Provincial Key Laboratory of Network Security and Cryptology School of Mathematics and Computer ScienceFujian Normal University Institute of Software Chinese Academy of Sciences

Recently, Wang et al. presented a new construction of attribute-based signature with policy-and-endorsement mechanism. The existential unforgeability of their scheme was claimed to be based on the strong Diffie-Hellman assumption in the random oracle model. Unfortunately, by carefully revisiting the design and security proof of Wang et alfs scheme, we show that their scheme cannot provide unforgeability, namely, a forger, whose attributes do not satisfy a given signing predicate, can also generate valid signatures. We also point out the flaws in Wang et al.＇s proof.

关键词： attribute-based signature existential unforgeability policy-and-endorsement

来源：评论

学校读者我要写书评

暂无评论

An evolutionary algorithm for no-wait flowshop problems with flowtime minimization

An evolutionary algorithm for no-wait flowshop problems with...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Zhu, Xia Li, Xiaoping Wang, Qian School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9781457703874

In this paper, no-wait flow shop scheduling problem with flowtime minimization is considered. Objective increment properties are analyzed and proved for fundamental operations of heuristics. With these properties, whether a new generated schedule is better or worse than the original one is only evaluated by objective increments, instead of completely calculating objective values as the traditional algorithms do, so that the computational time can be considerably reduced. An evolutionary algorithm (EA) is proposed for the considered problem. The initial population with two members is generated by different heuristics. After crossover, the disturb cycles which consist of a mutation operator and strengthen approaches are conducted to the offspring. EA is compared with the best-so-far algorithms SRTS, PH1p and DPSOvnd on 110 benchmark instances. Experimental results show that EA outperforms the others on effectiveness but is a little worse than DPSOvnd on efficiency. © 2011 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved Schnorr-based multi-signature scheme with application to blockchain 3

An improved Schnorr-based multi-signature scheme with applic...

引用

3rd IEEE International Conference on Civil Aviation Safety and information Technology, ICCASIT 2021

作者： Li, Chunlan Wu, Yulong Yu, Feng Computer Science and Engineering School of Software Guangxi Normal University Guilin China Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China

ISBN: (纸本)9781665425186

A multi-signature scheme allows a group of signers to jointly generate a signature on a common message, which can be verified by anyone, making the signature more compact. Multi-signature has the advantage of fast verification, and it helps reduce bandwidth and the cost of validation and storage. Recently, the multi-signature has drawn much attention because its advantages are desirable for blockchain and cryptocurrency. However, the traditional Schnorr-based multisignature scheme suffers from an excessive number of communications. This paper proposes an improved Schnorr-based multi-signature scheme ASMS, which reduces one round of communication in a traditional scheme, supporting public key aggregation. Thus, it is suitable for e-business and e-government affairs scenarios. As an application, we implemented our solution in Fabric, an enterprise blockchain platform, using chaincode technology. © 2021 IEEE

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

SOA-based method for cooperative tasks distribution in large-scale optimization environments

SOA-based method for cooperative tasks distribution in large...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Cui, Qiuxiang Zhu, Xia Zhang, Yi Li, Xiaoping School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9781424467631

In this paper, operators are encapsulated by services in algorithms for large-scale optimization problems and the services are deployed in distributed systems. Response time is an important factor for the performance of cooperative services. The message parse time is analyzed. Initial service accessing time is the main overhead for service calling. To decrease both the initial time and the response time, SBP (Service Buffering Pool based Scheduling Algorithm) is proposed by integrating a resource pool with a cache. Appropriate number of computing resources can be determined for large-scale optimization problems after analyzing the influence of the number of computing resources on algorithms. The proposed algorithm is compared with a centralized algorithm and a distributed algorithm without cache. Experimental results show that the proposed algorithm has a lower overhead than the other two algorithms. © 2010 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Efficient iterated greedy algorithm to minimize makespan for the no-wait flowshop with sequence dependent setup times

Efficient iterated greedy algorithm to minimize makespan for...

引用

2012 IEEE 16th International Conference on computer Supported Cooperative Work in Design, CSCWD 2012

作者： Xu, Tao Zhu, Xia Li, Xiaoping School of Computer Science and Engineering Southeast University 211189 Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

ISBN: (纸本)9781467312127

In this paper, an efficient iterated greedy algorithm is proposed for the SDST (Sequence Dependent Setup Time) no-wait flowshop with makespan minimization, which is known to be NP-hard. By introducing effective operators, the Iterated Greedy algorithm is adapted to the considered problem. To improve the quality of solutions, Local Search is incorporated into the modified Iterated Greedy algorithm. The proposed algorithm is compared with BIH, GAPH1∼GAPH4, and IG-Ruiz on Taillard's instances of ssd10, ssd50, ssd100, and ssdl25. Experimental results demonstrate that the proposal outperforms BIH and GAPH1∼GAPH4. As well, the proposal is more effective than IG-Ruiz under the same computation-time criterion. © 2012 IEEE.

关键词： Local search (optimization)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：