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

Regenerating Arbitrary Video Sequences with Distillation Path-Finding

IEEE Transactions on Visualization and computer Graphics 2024年第7期30卷 3622-3635页

作者： Le, Thi-Ngoc-Hanh Yao, Sheng-Yi Wu, Chun-Te Lee, Tong-Yee National Cheng-Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

If the video has long been mentioned as a widespread visualization form, the animation sequence in the video is mentioned as storytelling for people. Producing an animation requires intensive human labor from skilled professional artists to obtain plausible animation in both content and motion direction, incredibly for animations with complex content, multiple moving objects, and dense movement. This article presents an interactive framework to generate new sequences according to the users' preference on the starting frame. The critical contrast of our approach versus prior work and existing commercial applications is that novel sequences with arbitrary starting frame are produced by our system with a consistent degree in both content and motion direction. To achieve this effectively, we first learn the feature correlation on the frameset of the given video through a proposed network called RSFNet. Then, we develop a novel path-finding algorithm, SDPF, which formulates the knowledge of motion directions of the source video to estimate the smooth and plausible sequences. The extensive experiments show that our framework can produce new animations on the cartoon and natural scenes and advance prior works and commercial applications to enable users to obtain more predictable results. © 1995-2012 IEEE.

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

Improving coronary heart disease prediction with real-life dataset: a stacked generalization framework with maximum clinical attributes and SMOTE balancing for imbalanced data

引用

Multimedia Tools and Applications 2024年第37期83卷 85139-85168页

作者： Dubey, Madhuri Tembhurne, Jitendra Makhijani, Richa Department of Computer Science and Engineering Indian Institute of Information Technology Maharashtra Nagpur441108 India

Heart disease increases the strain on the heart by reducing its ability to pump blood throughout the body, which can lead to heart attacks and strokes. Heart disease is becoming a global threat to the world due to people’s unhealthy lifestyles, prevalent stroke history, physical inactivity, and current medical background. In predictive analytics, many studies were proposed to get alerts about forthcoming heart disease based on various attributes. However, the performance metrics were good, but the model was trained with few features. This study aims to train the model with all the essential attributes for heart disease prediction on Framingham Heart Study (FHS) dataset. The dataset is pre-processed with IQR (Inter Quartile Range) outlier detection followed by data oversampling using Synthetic Minority Oversampling Technique (SMOTE). We proposed a stack generalization approach, wherein various machine learning classifiers, namely logistic regression, random forest, K-nearest neighbour, Naïve Bayes, support vector machine, XGBoost, and decision tree with optimized hyperparameter trained the model to offer the best learner for the prediction of Coronary Heart disease with improved performance. The proposed model is tested on the original imbalanced and SMOTE-balanced FHS dataset. It is observed that logistic regression on the original (imbalanced) FHS dataset provides 86.51% accuracy, while the support vector machine on the SMOTE (balanced) FHS dataset outperformed the other models with an accuracy of 93.07%. Also, the proposed approach of stacked generalization with cross-validation provided 97.2% accuracy on SMOTE (balanced) dataset, which is remarkable. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Efficient Approximation Algorithms for Scheduling Coflows with Total Weighted Completion Time in Identical Parallel Networks

引用

IEEE Transactions on Cloud Computing 2024年第1期12卷 116-129页

作者： Chen, Chi-Yeh National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

This article addresses the scheduling problem of coflows in identical parallel networks, a well-known NPNP-hard problem. We consider both flow-level scheduling and coflow-level scheduling problems. In the flow-level scheduling problem, flows within a coflow can be transmitted through different network cores, while in the coflow-level scheduling problem, flows within a coflow must be transmitted through the same network core. The key difference between these two problems lies in their scheduling granularity. Previous approaches relied on linear programming to solve the scheduling order. In this article, we enhance the efficiency of solving by utilizing the primal-dual method. For the flow-level scheduling problem, we propose an approximation algorithm that achieves approximation ratios of 6-2m and m5-2m for arbitrary and zero release times, respectively, where m represents the number of network cores. Additionally, for the coflow-level scheduling problem, we introduce an approximation algorithm that achieves approximation ratios of4m+1 and 4m for arbitrary and zero release times, respectively. The algorithm presented in this article has practical applications in data centers, such as those operated by Google or Facebook. The simulated results demonstrate the superior performance of our algorithms compared to previous approach, emphasizing their practical utility. © 2013 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

3D shape knowledge graph for cross-domain 3D shape retrieval

引用

CAAI Transactions on Intelligence Technology 2024年第5期9卷 1199-1216页

作者： Rihao Chang Yongtao Ma Tong Hao Weijie Wang Weizhi Nie School of Microelectronics Tianjin UniversityTianjinChina School of Life Sciences Tianjin Normal UniversityTianjinChina Department of Information Engineering and Computer Science University of TrentoTrentoItaly School of Electrical and Information Engineering Tianjin UniversityTianjinChina

The surge in 3D modelling has led to a pronounced research emphasis on the field of 3D shape *** contemporary approaches have been put forth to tackle this intricate ***,effectively addressing the intricacies of cross-modal 3D shape retrieval remains a formidable undertaking,owing to inherent modality-based *** authors present an innovative notion—termed“geometric words”—which functions as elemental constituents for representing entities through *** establish the knowledge graph,the authors employ geometric words as nodes,connecting them via shape categories and geometry ***,a unique graph embedding method for knowledge acquisition is ***,an effective similarity measure is introduced for retrieval ***,each 3D or 2D entity can anchor its geometric terms within the knowledge graph,thereby serving as a link between cross-domain *** a result,the authors’approach facilitates multiple cross-domain 3D shape retrieval *** authors evaluate the proposed method's performance on the ModelNet40 and ShapeNetCore55 datasets,encompassing scenarios related to 3D shape retrieval and cross-domain ***,the authors employ the established cross-modal dataset(MI3DOR)to assess cross-modal 3D shape *** resulting experimental outcomes,in conjunction with comparisons against state-of-the-art techniques,clearly highlight the superiority of our approach.

关键词： 3‐D multimedia

来源：评论

学校读者我要写书评

暂无评论

A Simulation Framework for Prototyping Intelligent Vehicle-to-Infrastructure Applications: A Case Study on RSU-Based Intersection Movement Assist for Connected Autonomous Vehicles

引用

IEEE Access 2024年 12卷 82584-82598页

作者： Wu, Chun-Ting Wang, Shao-Hua Tu, Chia-Heng National Cheng Kung University Department of Computer Science and Information Engineering Tainan70101 Taiwan

A cooperative intelligent transport system (C-ITS) enables information sharing among ITS subsystems, such as vehicle and roadside infrastructure, with vehicle-to-everything (V2X) communications. Novel C-ITS applications aim to reduce traffic congestion and improve road safety. For example, a roadside unit (RSU) can sense the traffic status of an intersection and share the information to nearby vehicles to prevent potential collision, i.e., the intersection movement assist (IMA) scenario. Typically, C-ITS applications are developed in a simulated world to mitigate the high costs and safety hazards associated with the real-world counterpart. Unfortunately, existing simulation tools focus primarily on modeling vehicle-to-vehicle (V2V) communications, rather than the vehicle-to-infrastructure (V2I) communications involved in the above example. This poses a great challenge for developing V2I-based applications, especially for the application-level performance assessment on such systems. This work proposes a software framework that enables the simulation of full software stacks for the ITS subsystems, i.e., vehicle and RSU. This full-stack simulation capability enables hardware-in-the-loop simulations, evaluating the application-level performance and relative cost in the early stage of system development. This can shorten the time to market for C-ITS applications. We believe that this framework paves the way toward the development of novel V2I applications. © 2013 IEEE.

关键词： Intelligent systems

来源：评论

学校读者我要写书评

暂无评论

A conceptually simple and generic construction of plaintext checkable encryption in the standard model

引用

Designs, Codes, and Cryptography 2024年第6期92卷 1729-1746页

作者： Chen, Yu-Chi Department of Computer Science and Information Engineering National Taipei University of Technology Taipei10608 Taiwan

Plaintext-checkable encryption (PCE) can support searches over ciphertext by directly using plaintext. The functionality of a search is modeled by a specific check algorithm that takes a pair of target plaintext and ciphertext as input and returns 1 if the correct decryption result of the ciphertext is identical to the target plaintext. A trivial solution is to use an existing scheme (e.g., deterministic RSA) to achieve this, but there is no security guarantee with this method. Previous rigorous works have either relied on some mathematical structures to build PCE that can proven in the standard model or can be generic, as in the random oracle model. Hence, in this work, we aim to construct PCE that can be proven in the standard model by using standard primitives in a modular way in two steps. The first step is to present a warm-up construction of PCE from hash garbling and hash functions whose security is only proven in the random oracle model. The second step is to provide a full-fledged construction based on the warm-up, with slight modifications for achieving security in the standard model. Finally, we show the feasibility of the proposed construction through experiments. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

An individual-level probabilistic model and solution for control of infectious diseases

引用

Mathematical Biosciences and engineering 2024年第10期21卷 7253-7277页

作者： Xia, Ye Computer and Information Science and Engineering Department University of Florida GainesvilleFL32611 United States

We present an individual-level probabilistic model to evaluate the effectiveness of two traditional control measures for infectious diseases: the isolation of symptomatic individuals and contact tracing (plus subsequent quarantine). The model allows us to calculate the reproduction number and the generation-time distribution under the two control measures. The model is related to the work of Fraser et al. on the same topic [1], which provides a population-level model using a combination of differential equations and probabilistic arguments. We show that our individual-level model has certain advantages. In particular, we are able to provide more precise results for a disease that has two classes of infected individuals - the individuals who will remain asymptomatic throughout and the individuals who will eventually become symptomatic. Using the properties of integral operators with positive kernels, we also resolve the important theoretical issue as to why the density function of the steady-state generation time is the eigenfunction associated with the largest eigenvalue of the underlying integral operator. Moreover, the same theoretical result shows why the simple algorithm of repeated integration can find numerical solutions for virtually all initial conditions. We discuss the model's implications, especially how it enhances our understanding about the impact of asymptomatic individuals. For instance, in the special case where the infectiousness of the two classes is proportional to each other, the effects of the asymptomatic individuals can be understood by supposing that all individuals will be symptomatic but with modified infectiousness and modified efficacy of the isolation measure. The numerical results show that, out of the two measures, isolation is the more decisive one, at least for the COVID-19 parameters used in the numerical experiments. © 2024 the Author(s).

关键词： Choquet integral

来源：评论

学校读者我要写书评

暂无评论

Detecting Low-Yield Machines in Batch Production Systems Based on Observed Defective Pieces

引用

IEEE Transactions on Systems, Man, and Cybernetics: Systems 2024年第7期54卷 3972-3983页

作者： Adipraja, Philip F. E. Chang, Chin-Chun Yang, Hua-Sheng Wang, Wei-Jen Liang, Deron National Central University Department of Computer Science and Information Engineering Taoyuan City32001 Taiwan National Taiwan Ocean University Department of Computer Science and Engineering Keelung City20224 Taiwan

In batch production systems, detecting low-yield machines is essential for minimizing the production of defective pieces, which is a complex problem that currently requires multiple experts, considerable capital, or a combination of both to overcome. To solve this problem, we proposed a cost-efficient and straightforward method that involves using maximum likelihood estimation and bootstrap confidence intervals to estimate per-machine yield;this method enables identification of low-yield machines and generation of a list of these machines. Manufacturing engineers can use the list to perform necessary verification and maintenance processes. Before implementing this method, a manufacturer with 50-500 machines should build a dataset containing approximately 6-20 times as many batches as there are production machines. When this condition is met, the proposed method can be used effectively to detect up to five low-yield machines. © 2013 IEEE.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

RSSI-Based 3D Wireless Sensor Node Localization Using Hybrid T Cell Immune and Lotus Optimization

引用

computers, Materials & Continua 2024年第12期81卷 4833-4851页

作者： Weiwei Hu Kiran Sree Pokkuluri Rajesh Arunachalam Bander A.Jabr Yasser A.Ali Preethi Palanisamy School of Information Engineering Technology&MediaUniversity of HenanKaifeng475004China Department of Computer Science and Engineering Shri Vishnu Engineering College forWomenBhimavaram534202Andhra PradheshIndia Department of Electronics and Communication Engineering Saveetha School of EngineeringSaveetha Institute of Medical and Technical SciencesThandalam602105ChennaiIndia Department of Computer Engineering College of Computer and Information SciencesKing Saud UniversityRiyadh11543Saudi Arabia Department of Computer Science and Engineering Saveetha School of EngineeringSaveetha Institute of Medical and Technical SciencesThandalam602105ChennaiIndia

Wireless Sensor Network(WSNs)consists of a group of nodes that analyze the information from surrounding *** sensor nodes are responsible for accumulating and exchanging ***,node local-ization is the process of identifying the target node’s *** this research work,a Received Signal Strength Indicator(RSSI)-based optimal node localization approach is proposed to solve the complexities in the conventional node localization ***,the RSSI value is identified using the Deep Neural Network(DNN).The RSSI is conceded as the range-based method and it does not require special hardware for the node localization process,also it consumes a very minimal amount of cost for localizing the nodes in 3D *** position of the anchor nodes is fixed for detecting the location of the ***,the optimal position of the target node is identified using Hybrid T cell Immune with Lotus Effect Optimization algorithm(HTCI-LEO).During the node localization process,the average localization error is minimized,which is the objective of the optimal node *** the regular and irregular surfaces,this hybrid algorithm effectively performs the localization *** suggested hybrid algorithm converges very fast in the three-dimensional(3D)*** accuracy of the proposed node localization process is 94.25%.

关键词： Sensor node localization received signal strength indicator 3D wireless sensor network deep neural network average localization error and hybrid T cell immune with lotus effect optimization algorithm

来源：评论

学校读者我要写书评

暂无评论

Joint Frame Drop and Object Detection Task Offloading for Mobile Devices via RL With Lyapunov Optimization

引用

IEEE Transactions on Mobile Computing 2025年第7期24卷 6168-6182页

作者： Sohn, Vaughn Kim, Suhwan Lee, Hyang-Won Korea Advanced Institute of Science and Technology Department of Electrical Engineering Daejeon34141 Korea Republic of Konkuk University Department of Computer Science and Engineering Seoul05029 Korea Republic of

Object detection has become an increasingly important application for mobile devices. However, state-of-the-art object detection relies heavily on deep neural network, which is often burdensome to compute on mobile devices. To this end, we develop a layering framework for joint video frame drop and object detection task offloading. In the lower layer, by invoking Lyapunov optimization, we devise an algorithm for partitioning and offloading the computation tasks of deep neural networks. This algorithm also specifies the flow control for admitting the application traffic into the network. In the upper layer, we use the flow control as a form of guidance in the action space in order to develop a reinforcement learning (RL) algorithm that selectively drops video frames with object detection performance in consideration. By the nature of design, this Lyapunov-guided RL guarantees the network stability. We show through simulations that our Lyapunov-guided RL drops video frames with reasonable object detection performance and reduced latency while keeping the network stable. We also implemented our algorithm on the remote-controlled (RC) car equipped with microprocessor and GPU, and demonstrate the applicability of our algorithm to real-time object detection tasks from the video stream generated as the RC car moves. © 2002-2012 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：