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

Facial Action Unit Recognition Enhanced by Text Descriptions of FACS

IEEE Transactions on Affective computing 2024年

作者： Chang, Yanan Zhang, Caichao Wu, Yi Wang, Shangfei University of Science and Technology of China Key Lab of Computing and Communication Software of Anhui Province Anhui Hefei230027 China

Although the descriptions of facial action units (AUs) provide crucial semantic knowledge for representation learning from facial images, they have not been fully explored for facial action unit recognition. In this paper, we propose a method that effectively explores the knowledge existing in AU descriptions to enhance AU recognition. Specifically, the proposed method consists of three components, i.e. AU recognition network, global representation alignment, and AU representation alignment. The AU recognition network extracts global features and AU-specific features for AU prediction from images. To leverage AU textual descriptions fully, we design two-level representation alignment for AU recognition. The global representation alignment component closes the distance between the global facial features and its corresponding positive global embedding extracted from textual descriptions. Then, the AU-specific features are aligned with the positive AU textual embedding by the AU representation alignment component. Negative textual embedding generation strategies are also designed to further boost the two-level representation alignment. Through the two-level alignment, AU textual descriptions guide image representation learning of the AU recognition network. Experiments on two benchmark datasets and one in-the-wild dataset demonstrate the efficacy of the description-enhanced AU recognition method, compared with the state-of-the-art works. © 2010-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

AutoGR: Automated geo-replication with fast system performance and preserved application semantics 47th

AutoGR: Automated geo-replication with fast system performan...

引用

47th International Conference on Very Large Data Bases, VLDB 2021

作者： Wang, Jiawei Li, Cheng Ma, Kai Huo, Jingze Yan, Feng Feng, Xinyu Xu, Yinlong University of Science and Technology of China China University of Nevada Reno United States State Key Laboratory for Novel Software Technology Nanjing University China Anhui Province Key Laboratory of High Performance Computing China

Geo-replication is essential for providing low latency response and quality Internet services. However, designing fast and correct geo-replicated services is challenging due to the complex trade-off between performance and consistency semantics in optimizing the expensive cross-site coordination. State-of-the-art solutions rely on programmers to derive sufficient application-specific invariants and code specifications, which is both time-consuming and errorprone. In this paper, we propose an end-to-end geo-replication deployment framework AutoGR (AUTOmated Geo-Replication) to free programmers from such label-intensive tasks. AutoGR enables the geo-replication features for non-replicated, serializable applications in an automated way with optimized performance and correct application semantics. Driven by a novel static analyzer Rigi, AutoGR can extract application invariants by verifying whether their geo-replicated versions obey the serializable semantics of the non-replicated application. Rigi takes application codes as inputs and infers a set of side effects and path conditions possibly leading to consistency violations. Rigi employs the Z3 theorem prover to identify pairs of conflicting side effects and feed them to a georeplication framework for automated across-site deployment. We evaluate AutoGR by transforming four serializable and originally non-replicated DB-compliant applications to geo-replicated ones across 3 sites. Compared with state-of-the-art human-interventionfree automated approaches (e.g., strong consistency), AutoGR reduces up to 61.8% latency and achieves up to 2.12× higher peak throughput. Compared with state-of-the-art approaches relying on a manual analysis (e.g., PoR), AutoGR can quickly enable the georeplication feature with zero human intervention while offering similarly low latency and high throughput. © by the owner/author(s).

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A preliminary study on why using the nonself detector set for anomaly detection in artificial immune Systems

A preliminary study on why using the nonself detector set fo...

引用

2009 International Conference on Computational Intelligence and Security, CIS 2009

作者： Xu, Baoliang Luo, Wenjian Wang, Xufa Nature Inspired Computation and Applications Laboratory School of Computer Science and Technology University of Science and Technology of China Hefei 230027 Anhui China Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei 230027 Anhui China

ISBN: (纸本)9780769539317

In artificial immune systems, the detectors in the nonself space are often adopted to detect anomaly changes, such as the negative selection algorithm and its improvements. Since the detectors in the self space can also be used to detect anomaly changes, a frequently asked question is which kind of detector sets is more efficient for a specific problem. In this paper, firstly, the advantages and disadvantages of the self detector set and the nonself detector set are briefly reviewed. Secondly, when the complete matching rule is adopted, the average time costs of employing the nonself detector set and the self detector set for anomaly detection are compared theoretically. Thirdly, simulated experiments are done, and experimental results demonstrate that the theoretical conclusion is essentially correct. © 2009 IEEE.

关键词： Immune system

来源：评论

学校读者我要写书评

暂无评论

A fine-grained algorithm for generating hard-toreverse negative databases

A fine-grained algorithm for generating hard-toreverse negat...

引用

International Workshop on Artificial Immune Systems, AIS 2015

作者： Zhao, Dongdong Luo, Wenjian Liu, Ran Yue, Lihua School of Computer Science and Technology University of Science and Technology of China Hefei Anhui230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui230027 China School of Computer Science China University of Geosciences Wuhan430074 China

ISBN: (纸本)9781509002986

The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden information, NDBs should be hard-to-reverse. In this paper, we propose the Khidden algorithm for generating hard-to-reverse NDBs (called Khidden-NDBs). The K-hidden algorithm could be controlled in a more fine-grained manner than existing NDB generation algorithms. Moreover, in terms of the SAT solvers based on the local search strategy, we formally prove that the K-hidden-NDBs could be more hard-to-reverse than the NDBs generated by the typical p-hidden algorithm. Furthermore, we show that the Khidden-NDB could be more hard-to-reverse (against the local search strategy) than the q-hidden-NDB (NDBs generated by the q-hidden algorithm) when the sizes of NDBs are the same. Finally, as for the Unit Clause heuristic solvers, we prove that the K-hidden-NDB could be the same hard-to-reverse as the qhidden-NDB. © 2015 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

Constructing the Voronoi diagram of planar point set in parallel

Constructing the Voronoi diagram of planar point set in para...

引用

2009 International Conference on Computational Intelligence and software Engineering, CiSE 2009

作者： Dong, Lanfang Wu, Yuan Zhou, Shanhai Anhui Province Key Lab. of Software in Computing and Communication College of Computer Science and Technology USTC Hefei China College of Computer Science and Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9781424445073

By researching Voronoi diagram, parallel algorithm, and divide-and-conquer method, we present a special data structure(change doubly-connected list little) for Voronoi diagram generation in parallel. In this paper we also present two proposal, they are one processor gradually to merge and 22-merger on the parallel machine, the experiment results show that the present algorithm runs faster than the serial program. By analyzing the various results, we should choose the most suitable number of processors according to the point set scale. At last, we can conclude that gradually merger with one processor is better proposal for Voronoi diagram parallel generation. ©2009 IEEE.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

A Global-Energy-Balancing Real-Time Routing in Wireless Sensor Networks

A Global-Energy-Balancing Real-Time Routing in Wireless Sens...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Peilong Li Yu Gu Baohua Zhao Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China

Many applications in wireless sensor networks like video surveillance have the requirement of timely data delivery. Real-time routing is needed in these applications. Because of the limitation of node energy, energy efficiency is also an important concern in routing protocol design in order to increase the network lifetime. In this paper, we propose a global-energy-balancing routing scheme (GEBR) for real-time traffic based on directed diffusion (DD), which balances node energy utilization to increase the network lifetime. GEBR can find an optimal path in sensor networks for data transfer considering global energy balance and limited delivery delay. Simulation results show that GEBR significantly outperforms DD in uniform energy utilization. GEBR achieves better global energy balance and longer network lifetime. The time for real-time service of the sensor networks using GEBR is prolonged by about 4.37% and the network lifetime is prolonged by 44.6%.

关键词： Wireless sensor networks Routing protocols Delay Computer networks Energy efficiency Computer science Laboratories Wireless application protocol Global Positioning System Video surveillance

来源：评论

学校读者我要写书评

暂无评论

A Secure Routing Protocol with Malicious Nodes Detecting and Diagnosing Mechanism for Wireless Sensor Networks

A Secure Routing Protocol with Malicious Nodes Detecting and...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Yuan-xi Jiang Bao-hua Zhao Department of Computer Science Anhui Province Key Laboratory of software in Computing and Communication University of Science and Technology Hefei Anhui China

Routing protocol security is the key element in the research of secure wireless sensor networks. Due to its special characteristic, designing security routing protocol is a challenge in these networks. A secure routing protocol with malicious nodes detecting and diagnosing mechanism is used to reduce the malicious nodes' threat to the WSNs.

关键词： Routing protocols Wireless sensor networks Data security Monitoring communication system security Computer networks Sensor phenomena and characterization Cryptography Relays Resumes

来源：评论

学校读者我要写书评

暂无评论

Secure Location Verification Using Hop-Distance Relationship in Wireless Sensor Networks

Secure Location Verification Using Hop-Distance Relationship...

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Yongsheng Liu Hao Zhou Baohua Zhao Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China

With the growing prevalence of wireless sensor networks comes a new need for location-based access control mechanisms. Thus we need a method to perform location verification to enforce location-based access to information resources. In this work, a statistic location verification algorithm in randomly deployed sensor networks is proposed. The nodes in the networks are classified to three roles. The claimer broadcasts the position message. The witnesses rebroadcast it and report the distance and lowest hop information to the verifier. The verifier makes use of hypothesis tests to make a decision. At last the simulation results confirm the validation of the algorithm.

关键词： Wireless sensor networks Computer networks Access control Information resources Statistics Broadcasting Computer science Laboratories Testing Computer worms

来源：评论

学校读者我要写书评

暂无评论

Zone routing protocol based on energy consumption

引用

Jisuanji Gongcheng/Computer Engineering 2006年第12期32卷 117-118+135页

作者： Zhai, Weifeng Gu, Naijie Zhang, Jianming Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China

A zone routing protocol based on the energy consumption speed of nodes in mobile Adhoc networks is presented. A route select parameter computed by residual lifetime of nodes and hop count of route is used to be selected the best route, the nodes that have more energy have more probability of chosen. The mechanism can balance the energy consumption of node and prolong network's life. Simulation result comparing with zone routing protocol in NS-2 shows EZRP has less number of death nodes, lower routing overhead, and longer lifetime of network.

关键词： Energy consumption EZRP Hybrid routing protocol MANET

来源：评论

学校读者我要写书评

暂无评论

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array for 5G Application 5

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array f...

引用

5th IEEE International Conference on Electronic Information and communication Technology, ICEICT 2022

作者： Zhou, Wei Qi, Junwei Li, Yingsong Huang, Zhixiang Yang, Lixia College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn230088 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

In this work, a Gong-Si-shaped circularly polarized (CP) array with power driver for 5G is proposed. The radiator of the constructed CP array consists of two Chinese-like characters ' and '' with the similar size and pronunciation of 'gong' and 'si', Two L-shaped feeding probes of the same size are connected to the designed power driver printed on the bottom layer of ground plate, and the array can radiate circular polarization electromagnetic waves by changing the positions of the L-shaped probes and the angle of the horizontal parts of the L-shaped probes. From the simulating and optimizing, it is finally obtained that the -15 dB bandwidth of modeled Gong-Si-like CP antenna lies in 2.49 - 2.81 GHz and the presented Gong-Si-like CP antenna has a axial bandwidth covering 2.36 - 2.82 GHz, which meets the n41 5G band implementing at 2.515 - 2.675 GHz. © 2022 IEEE.

关键词： Circular polarization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：