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

International Test Conference in Asia (ITC-Asia)

作者： Aibin Yan Jing Xiang Zhengfeng Huang Tianming Ni Jie Cui Patrick Girard Xiaoqing Wen School of Computer Science and Technology Anhui University Hefei China School of Microelectronics Hefei University of Technology Hefei China School of Integrated Circuits Anhui Polytechnic University Wuhu China Laboratory of Informatics Robotics and Microelectronics of Montpellier University of Montpellier / CNRS Montpellier France Graduate School of Computer Science and Systems Engineering Kyushu Institute of Technology Fukuoka Japan

For high-speed operations, low power consumption and small silicon area, transistors are being scaled aggressively. Meanwhile, circuit reliability is facing greater challenges in advanced technologies. In this paper, a highly reliable and low-power SRAM with double-node-upset (DNU) recovery, namely HRLP16T, is proposed for safety-critical fields. HRLP16T can recover from single-node-upset (SNU) at all the sensitive nodes, and it has eight node pairs recoverable from DNUs. Simulation results demonstrate its advantages in terms of delay and power consumption over typical existing SRAM cell designs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CFVNet: An End-to-End Cancelable Finger Vein Network for Recognition

arXiv

引用

arXiv 2024年

作者： Wang, Yifan Gui, Jie Tang, Yuan Yan Kwok, James Tin-Yau School of Cyber Science and Engineering Southeast University Nanjing210000 China Engineering Research Center of Blockchain Application Supervision and Management Southeast University Ministry of Education Purple Mountain Laboratories Nanjing210000 China The Department of Computer and Information Science University of Macao Macao999078 China The Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong999077 Hong Kong

Finger vein recognition technology has become one of the primary solutions for high-security identification systems. However, it still has information leakage problems, which seriously jeopardizes user’s privacy and anonymity and cause great security risks. In addition, there is no work to consider a fully integrated secure finger vein recognition system. So, different from the previous systems, we integrate preprocessing and template protection into an integrated deep learning model. We propose an end-to-end cancelable finger vein network (CFVNet), which can be used to design an secure finger vein recognition system. It includes a plug-and-play BWR-ROIAlign unit, which consists of three sub-modules: Localization, Compression and Transformation. The localization module achieves automated localization of stable and unique finger vein ROI. The compression module losslessly removes spatial and channel redundancies. The transformation module uses the proposed BWR method to introduce unlinkability, irreversibility and revocability to the system. BWR-ROIAlign can directly plug into the model to introduce the above features for DCNN-based finger vein recognition systems. We perform extensive experiments on four public datasets to study the performance and cancelable biometric attributes of the CFVNet-based recognition system. The average accuracy, EERs and D↔sys on the four datasets are 99.82%, 0.01% and 0.025, respectively, and achieves competitive performance compared with the state-of-the-arts. © 2024, CC BY-NC-SA.

关键词： Boiling water reactors

来源：评论

学校读者我要写书评

暂无评论

FogROS2-FT: Fault Tolerant Cloud robotics

FogROS2-FT: Fault Tolerant Cloud Robotics

引用

IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

作者： Kaiyuan Chen Kush Hari Trinity Chung Michael Wang Nan Tian Christian Juette Jeffrey Ichnowski Liu Ren John Kubiatowicz Ion Stoica Ken Goldberg Department of Electrical Engineering and Computer Science University of California Berkeley CA USA Robert Bosch Research and Technology Center North America Sunnyvale CA USA Robotics Institute Carnegie Mellon University Department of Industrial Engineering and Operations Research University of California Berkeley CA USA

ISBN: (数字)9798350377705

ISBN: (纸本)9798350377712

Cloud robotics enables robots to offload complex computational tasks to cloud servers for performance and ease of management. However, cloud compute can be costly, cloud services can suffer occasional downtime, and connectivity between the robot and cloud can be prone to variations in network Quality-of-Service (QoS). We present FogROS2-FT (Fault Tolerant) to mitigate these issues by introducing a multi-cloud extension that automatically replicates independent stateless robotic services, routes requests to these replicas, and directs the first response back. With replication, robots can still benefit from cloud computations even when a cloud service provider is down or there is low QoS. Additionally, many cloud computing providers offer low-cost "spot" computing instances that may shutdown unpredictably. Normally, these low-cost instances would be inappropriate for cloud robotics, but the fault tolerance nature of FogROS2-FT allows them to be used reliably. We demonstrate FogROS2-FT fault tolerance capabilities in 3 cloud-robotics scenarios in simulation (visual object detection, semantic segmentation, motion planning) and 1 physical robot experiment (scan-pick-and-place). Running on the same hardware specification, FogROS2-FT achieves motion planning with up to 2.2x cost reduction and up to a 5.53x reduction on 99 Percentile (P99) long-tail latency. FogROS2-FT reduces the P99 long-tail latency of object detection and semantic segmentation by 2.0x and 2.1x, respectively, under network slowdown and resource contention. Videos and code are available at https://***/view/fogros2-ft.

关键词： Fault tolerance Heavily-tailed distribution Semantic segmentation Fault tolerant systems Quality of service Object detection Planning Servers Robots Cloud robotics

来源：评论

学校读者我要写书评

暂无评论

Learning Optimal "Pigovian Tax" in Sequential Social Dilemmas

arXiv

引用

arXiv 2023年

作者： Hua, Yun Gao, Shang Li, Wenhao Jin, Bo Wang, Xiangfeng Zha, Hongyuan School of Computer Science and Technology East China Normal University Shanghai200092 China School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Shenzhen China School of Software Engineering Tongji University Shanghai201804 China School of Computer Science and Technology East China Normal University Shanghai200062 China

In multi-agent reinforcement learning, each agent acts to maximize its individual accumulated rewards. Nevertheless, individual accumulated rewards could not fully reflect how others perceive them, resulting in selfish behaviors that undermine global performance. The externality theory, defined as "the activities of one economic actor affect the activities of another in ways that are not reflected in market transactions," is applicable to analyze the social dilemmas in MARL. One of its most profound non-market solutions, "Pigovian Tax", which internalizes externalities by taxing those who create negative externalities and subsidizing those who create positive externalities, could aid in developing a mechanism to resolve MARL's social dilemmas. The purpose of this paper is to apply externality theory to analyze social dilemmas in MARL. To internalize the externalities in MARL, the Learning Optimal Pigovian Tax method (LOPT), is proposed, where an additional agent is introduced to learn the tax/allowance allocation policy so as to approximate the optimal "Pigovian Tax" which accurately reflects the externalities for all agents. Furthermore, a reward shaping mechanism based on the approximated optimal "Pigovian Tax" is applied to reduce the social cost of each agent and tries to alleviate the social dilemmas. Compared with existing state-of-the-art methods, the proposed LOPT leads to higher collective social welfare in both the Escape Room and the Cleanup environments, which shows the superiority of our method in solving social dilemmas. Copyright © 2023, The Authors. All rights reserved.

关键词： Taxation

来源：评论

学校读者我要写书评

暂无评论

TPE-H2MWD:an exact thumbnail preserving encryption scheme with hidden Markov model and weighted diffusion

引用

Frontiers of Information Technology & Electronic engineering 2023年第8期24卷 1169-1180页

作者： Xiuli CHAI Xiuhui CHEN Yakun MA Fang ZUO Zhihua GAN Yushu ZHANG School of Artificial Intelligence Henan Engineering Research Center for Industrial Internet of ThingsHenan UniversityZhengzhou450046China Henan Key Laboratory of Cyberspace Situation Awareness Zhengzhou450001China School of Software Intelligent Data Processing Engineering Research Center of Henan ProvinceInstitute of Intelligent Network SystemHenan UniversityKaifeng475004China College of Computer Science and Technology Nanjing University of Aeronautics and AstronauticsNanjing211106China

With the substantial increase in image transmission,the demand for image security is ***-like images can be obtained by conventional encryption schemes,and although the security of the images can be guaranteed,the noise-like images cannot be directly previewed and *** on the rank-then-encipher method,some researchers have designed a three-pixel exact thumbnail preserving encryption(TPE2)scheme,which can be applied to balance the security and availability of images,but this scheme has low encryption *** this paper,we introduce an efficient exact thumbnail preserving encryption ***,blocking and bit-plane decomposition operations are performed on the plaintext *** zigzag scrambling model is used to change the bit positions in the lower four bit ***,an operation is devised to permute the higher four bit planes,which is an extended application of the hidden Markov ***,according to the difference in bit weights in each bit plane,a bit-level weighted diffusion rule is established to generate an encrypted image and still maintain the same sum of pixels within the *** results show that the proposed scheme improves the encryption efficiency and can guarantee the availability of images while protecting their privacy.

关键词： Hidden Markov model Weighted diffusion Balance between usability and privacy Image encryption

来源：评论

学校读者我要写书评

暂无评论

Dynamic and Distributed Optimization for the Allocation of Aerial Swarm Vehicles

arXiv

引用

arXiv 2022年

作者： Hughes, Jason Larkin, Dominic O’Donnell, Charles Korpela, Christopher The Robotics Research Center Department of Electrical Engineering and Computer Science United States Military Academy West PointNY10996 United States

Optimal transport (OT) is a framework that can guide the design of efficient resource allocation strategies in a network of multiple sources and targets. This paper applies discrete OT to a swarm of UAVs in a novel way to achieve appropriate task allocation and execution. Drone swarm deployments already operate in multiple domains where sensors are used to gain knowledge of an environment [1]. Use cases such as, chemical and radiation detection, and thermal and RGB imaging create a specific need for an algorithm that considers parameters on both the UAV and waypoint side and allows for updating the matching scheme as the swarm gains information from the environment. Additionally, the need for a centralized planner can be removed by using a distributed algorithm that can dynamically update based on changes in the swarm network or parameters. To this end, we develop a dynamic and distributed OT algorithm that matches a UAV to the optimal waypoint based on one parameter at the UAV and another parameter at the waypoint. We show the convergence and allocation of the algorithm through a case study and test the algorithm’s effectiveness against a greedy assignment algorithm in simulation. © 2022, CC BY.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

QoS-aware Dynamic Service Caching and Updating in Cost-efficient Multi-Access Edge Computing

QoS-aware Dynamic Service Caching and Updating in Cost-effic...

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Shuaibing Lu Xin Jin Jie Wu Shuyang Zhou Shen Wu Jackson Yang Ran Yan College of Computer Science Beijing University of Technology Beijing China Center for Networked Computing Temple University USA School of Software Engineering Beijing Jiaotong University Beijing China

ISBN: (数字)9798331509712

ISBN: (纸本)9798331509729

In the context of mobile edge computing, achieving dynamic service caching and updating to guarantee the QoS of users and reduce system costs is a challenging problem. However, existing research still has certain deficiencies in considering the dynamic behavior of users and the limited storage resources of edge servers. To address this problem, this paper proposes three novel strategies for the different stages of service caching and updating to jointly optimize the delay and cost. At the initial service caching stage, we propose a caching strategy based on dynamic programming, taking into account the constraint of limited memory resources. Given the dynamic behavior of users, we formulate the joint optimization problem as a Markov Decision Process (MDP) and design a service extension strategy based on Q-learning at the service updating decision-making stage and a replacement strategy taking both the distribution of service replications and service access frequency into account at the service updating replacement stage to guarantee the QoS of users. We effectively tackle the challenges arising from the dynamic behavior of users and limited storage resources. Through extensive comparative experiments, our approach outperforms traditional strategies by significantly reducing user latency and system cost.

关键词： Costs Multi-access edge computing Q-learning Heuristic algorithms Memory management Quality of service Dynamic scheduling Dynamic programming Servers Optimization

来源：评论

学校读者我要写书评

暂无评论

Eye Drop Instillation Success and Hand Function in Adults with Glaucoma: A Pilot Study

引用

Ophthalmology Glaucoma 2025年第3期8卷 275-284页

作者： Weber, Madeline K. Kabil, Gül G. Niziol, Leslie M. Urrego, Daniel Duque Haire, Cameron Cain, Stephen M. Sample, Alanson P. Burke, David T. Brown, Susan H. Newman-Casey, Paula Anne University of Michigan Medical School Ann Arbor MI United States University of Michigan School of Kinesiology Ann Arbor MI United States Department of Ophthalmology and Visual Sciences University of Michigan W.K. Kellogg Eye Center Ann Arbor MI United States Department of Chemical and Biomedical Engineering West Virginia University Morgantown WV United States Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI United States Department of Human Genetics University of Michigan Ann Arbor MI United States

Purpose: To investigate hand function and eye drop instillation success in adults with and without glaucoma. Design: Cross-sectional pilot study. Subjects: Adults aged ≥ 65 years with glaucoma who use eye drops daily and adults aged 65+ without glaucoma who do not regularly use eye drops. Methods: Hand function was evaluated using the Saehan Hydraulic Pinch Gauge, Jamar Hand Dynamometer, Grooved Pegboard Test (GPT), Arthritis Hand Function Tests (AHFT), Semmes-Weinstein Monofilament Test, and a tactile pattern recognition device. Eye drop instillation success was analyzed through videography. Main Outcome Measures: Proportion of successful eye drop instillation trials assessed by (1) overall success in getting at least one drop in the eye;(2) average number of drops dispensed;and (3) bottle tip contact with the eye, eyelashes, or skin. Hand function measures: mean pinch and grip strength, GPT and AHFT completion times, smallest detected monofilament, tactile pattern identification time, and accuracy. Results: A total of 25 participants with glaucoma and 79 participants without glaucoma were included. There was no difference in the proportion of trials where at least one drop was successfully instilled, disregarding bottle tip contact (glaucoma: 0.95, nonglaucoma: 0.91;P = 0.88). Participants with glaucoma were more likely to make contact between the bottle tip and the eye, eyelashes, or skin compared with those without (glaucoma: 0.49, nonglaucoma: 0.28;P = 0.01). Participants with glaucoma dispensed a similar number of drops as those without (glaucoma: 1.37, nonglaucoma: 1.46;P = 0.47). Participants with glaucoma had significantly reduced pinch strength (glaucoma: 4.8 kg, nonglaucoma 6.1 kg, P = 0.01), grip strength (glaucoma: 23.4 kg, nonglaucoma: 27.7 kg, P = 0.02), longer completion times for the GPT (glaucoma: 113.5 seconds, nonglaucoma: 85.5 seconds, P = 0.02), and specific AHFT tasks of fastening/unfastening buttons (glaucoma: 36.6 seconds, nonglaucoma: 27.7

关键词： Eye drop instillation success Glaucoma Hand function Sensorimotor deficits

来源：评论

学校读者我要写书评

暂无评论

Cnt: Compression Network with Transformer for Approximate Nearest Neighbor Search

SSRN

引用

SSRN 2024年

作者： Zhang, Haokui Xiao, Rong Zhou, Meili Bai, Zongwen Zhang, Shengbing Zhang, Yanning Northwestern Polytechnical University Xi’an China Department of AI Technology Center Shenzhen Intellifusion Ltd. China Yan’an University Yan’an China School of Computer Science and Engineering

We present a generic method for compressing features in Approximate Nearest Neighbor Search (ANNS) problems, which can significantly speed up existing ANNS methods in a plug-and-play manner. Our approach, called CNT, is based on transformer architecture and compresses high-dimensional features into a lower-dimensional space while preserving the neighbourhood relationships of the original high-dimensional space to maintain high search accuracy. To achieve this, we design an inhomogeneous neighbourhood relationship preserving (INRP) loss to guide the training process. We use multiple compression projections to map the features into several low-dimensional spaces and optimize them globally using the transformer architecture. The INRP loss assigns high weights to point pairs that are close in the original feature space and keeps their distances in the projected space while down-weighting others to create room for feature compression. We evaluate the proposed method through two sets of experiments. Firstly, we apply it to public datasets and use the compressed features in graph-based, product quantization, and scalar quantization-based ANNS solutions. Results show that our compression method can significantly improve the efficiency of these methods while preserving or even improving search accuracy, suggesting its broad potential impact on real-world applications. Secondly, we apply it to a real-world application scenario, where we identify a person captured by a mobicamera. Results show that our proposed CNT can speed up both indexing and searching processes, reducing hardware requirements for face recognition system deployment, while having no negative impact on recognition accuracy. © 2024, The Authors. All rights reserved.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

A 3D semantic segmentation network for accurate neuronal soma segmentation

引用

Journal of Innovative Optical Health sciences 2025年第1期18卷 67-83页

作者： Li Ma Qi Zhong Yezi Wang Xiaoquan Yang Qian Du School of Mechanical Engineering and Electronic Information China University of Geosciences Wuhan 430074P.R.China Britton Chance Center for Biomedical Photonics Wuhan National Laboratory for Optoelectronics MoE Key Laboratory for Biomedical Photonics Huazhong University of Science and Technology Wuhan 430074 P.R.China Department of Electrical and Computer Engineering Mississippi State University Mississippi StateMS 39762USA

Neuronal soma segmentation plays a crucial role in neuroscience ***,the fine structure,such as boundaries,small-volume neuronal somata and fibers,are commonly present in cell images,which pose a challenge for accurate *** this paper,we propose a 3D semantic segmentation network for neuronal soma segmentation to address this *** an encoding-decoding structure,we introduce a Multi-Scale feature extraction and Adaptive Weighting fusion module(MSAW)after each encoding *** MSAW module can not only emphasize the fine structures via an upsampling strategy,but also provide pixel-wise weights to measure the importance of the multi-scale ***,a dynamic convolution instead of normal convolution is employed to better adapt the network to input data with different *** proposed MSAW-based semantic segmentation network(MSAW-Net)was evaluated on three neuronal soma images from mouse brain and one neuronal soma image from macaque brain,demonstrating the efficiency of the proposed *** achieved an F1 score of 91.8%on Fezf2-2A-CreER dataset,97.1%on LSL-H2B-GFP dataset,82.8%on Thy1-EGFP-Mline dataset,and 86.9%on macaque dataset,achieving improvements over the 3D U-Net model by 3.1%,3.3%,3.9%,and 2.3%,respectively.

关键词： Neuronal soma segmentation semantic segmentation network multi-scale feature extraction adaptive weighting fusion

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：