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

Detection of Human Falls via Computer Vision for Elderly Care – An I3D/RNN Approach 1

20th International Symposium on distributed computing and Artificial Intelligence, DCAI 2023

作者： Leal, João Moayyed, Hamed Vale, Zita Porto Portugal GECAD - Research Group on Intelligent Engineering and Computing for Advanced Innovation and Development LASI - Intelligent Systems Associate Laboratory Polytechnic of Porto Porto Portugal

ISBN: (数字)9783031383335

ISBN: (纸本)9783031383328

As the population continues to age, the number of elderly individuals is increasing at an unprecedented rate as the active age group in developed countries continues to shrink. This demographic shift has resulted in a shortage of resources and limitations in the provision of adequate elderly care. Among the many health risks faced by the elderly, falls are a common and serious problem, which can lead to injuries, hospitalizations, and even death. Despite the prevalence of falls, traditional manual detection methods are often unreliable and inadequate. In response to this, this paper proposes an automatic fall detection system based on video cameras that uses a unique combination of an inflated 3D convolutional neural network (I3D) and a recurrent neural network (RNN). This model was evaluated using multiple fall detection datasets, including a newly developed dataset of simulated falls. The results of this study demonstrate that this hybrid model is highly effective at detecting falls and is on par with other state-of-the-art systems, boasting 94% F1 score and 96% recall values. This technology has the potential to significantly improve the quality of life and safety of the elderly population by providing timely and accurate detection of falls. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

TASK DECOMPOSITION AND COMPETING EXPERT-SYSTEM - ARTIFICIAL NEURAL-NET OBJECTS FOR RELIABLE AND REAL-TIME INFERENCE

TASK DECOMPOSITION AND COMPETING EXPERT-SYSTEM - ARTIFICIAL ...

引用

1993 IEEE INTERNATIONAL CONF ON NEURAL NETWORKS / 2ND INTERNATIONAL CONF ON FUZZY systems

作者： KHOSLA, R DILLON, T Expert and Intelligent Systems Laboratory Applied Computing Research Institute Department of Computer Science and Computer Engineering La Trobe University Bundoora 3083 VIC Australia

ISBN: (纸本)0780309995

The properties of Artificial Neural Networks(ANNs) like massive parallelism, generalization make them amenable for application in various diagnostic/time-critical problem domains including alarm processing in power systems. However, enormous size of power systems haB inhibited real time use of ANNs. In this paper, we apply an integrated model for real time alarm processing in a real world terminal power station. The integrated model is a combination of a generic neuro-expert system model, object model, and unix operating system process(UOSP) model. We show how the massive parallelism and fast execution features of ANNs help us to cope with real-time system constraints like data variability and fast response time. For further enhancing reliability we propose a practical use of competing ES-ANN objects. © 1993 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Probabilistic bootstrap-based evolutionary algorithm for three-objective wind farm turbine position optimization

引用

Swarm and Evolutionary Computation 2025年 96卷

作者： Chen Zhang Haotian Li Xiuxian Li Jiujun Cheng Zhenyu Lei Shangce Gao Faculty of Engineering University of Toyama Toyama-shi 930-8555 Japan College of Electronics and Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Amid the worsening energy crisis, wind farm layout optimization (WFLO) to increase power generation, reduce costs, and mitigate potential environmental impacts is of great significance. This paper formulates three-objective wind farm layout optimization (TWFLO) which is rarely considered, aiming to effectively utilize existing information to optimize power output, land usage, and costs. We propose a new algorithm (MOEA/D-P) based on probability distributions to guide turbine placement and improve the performance of a Multiobjective Evolutionary Algorithm Based on Decomposition (MOEA/D). This algorithm addresses the issue of neglecting valuable information during layout optimization. Additionally, we make improvements to the traditional land-use function to avoid situations where non-convex layouts result in an area calculation of zero. The MOEA/D-P is tested on six different initial layouts and compared with five algorithms under two wind conditions. Results are evaluated using inverted generational distance, hypervolume, and scatter plot distributions. The impact of initial probability distribution on algorithm performance is discussed under four simple wind conditions. The results show that MOEA/D-P outperforms the other five algorithms in terms of performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Efficient and deadlock-free reconfiguration for source routed networks

Efficient and deadlock-free reconfiguration for source route...

引用

23rd IEEE International Parallel and distributed Processing Symposium, IPDPS 2009

作者： Solheim, Åshild Grønstad Lysne, Olav Bermúdez, Aurelio Casado, Rafael Sødring, Thomas Skeie, Tor Robles-Gómez, Antonio Networks and Distributed Systems Group Simula Research Laboratory Lysaker Norway Department of Informatics University of Oslo Oslo Norway Computing Systems Department University of Castilla-La Mancha Albacete Spain

ISBN: (纸本)9781424437504

Overlapping Reconfiguration is currently the most effi-cient method to reconfigure an interconnection network, but is only valid for systems that apply distributed routing. This paper proposes a solution which enables utilization of Overlapping Reconfiguration in a source routed environ-ment. We demonstrate how a synchronized injection of tokens has a significant impact on the performance of the method. Furthermore, we propose and evaluate an optimization of the original algorithm that reduces (and in some cases even eliminates) performance issues caused by the token forwarding regime, such as increased latency and decreased throughput. © 2009 IEEE.

关键词： Interconnection networks (circuit switching)

来源：评论

学校读者我要写书评

暂无评论

Protein structure superposition by curve moment invariants and iterative closest point

Protein structure superposition by curve moment invariants a...

引用

2007 1st International Conference on Bioinformatics and Biomedical Engineering, ICBBE

作者： Xu, Dong Li, Hua Gu, Tongjun Key Laboratory of Intelligent Information Processing Key Laboratory of Computer System and Architecture National Research Center for Intelligent Computing Systems Institute of Computing Technology Chinese Academy of Sciences Center for Systems Biology Institute of Biophysics Chinese Academy of Sciences Graduate University Chinese Academy of Sciences

ISBN: (纸本)1424411203

Superimpose one protein tertiary structure to another can help to find similarity between them and further identify functional and evolutionary relationships. We first extract invariant features under rigid body transformation for each protein backbone which is represented by alpha-carbons of all the residues. Then, the invariant features are embedded with Iterative Closest Point algorithm for superposition. With several initialized orientations, pairwise alignment can be achieved accurately only by few iterations. Experiments indicate that our proposed algorithm is competitive with several well-known algorithms and with smallest root mean squared distance. © 2007 IEEE.

关键词： Proteins

来源：评论

学校读者我要写书评

暂无评论

A Kind of Lean Approach for Removing Wastes From Non-Manufacturing Process With Various Facilities

引用

IEEE/CAA Journal of Automatica Sinica 2019年第1期6卷 307-315页

作者： Guangyu Xiong Xiuqin Shang Gang Xiong Timo R.Nyberg IEEE the Silk Road Business School Sanya University the Department of Industrial Engineering and Management School of ScienceAalto University the State Key Laboratory for Management and Controlof Complex Systems Institute of AutomationChinese Academy of Sciences(CAS) Qingdao Academy of Intelligent Industries the Cloud Computing Center CAS the Beijing Engineering Research Center of Intelligent Systems and Technology Institute of AutomationCAS the School of Science at Aalto University

It is important to identify and remove the wastes not only from manufacturing process, but also from nonmanufacturing process. In the last several decades, significant research achievements and practice benefits have been achieved about removing wastes from manufacturing process. Since the1990 s, some researchers and lean practitioners have paid more attention to removing waste from non-manufacturing *** on the authors' research work and industrial practice, the paper introduces a kind of lean approach for removing waste from non-manufacturing process. In its case study, the order handling process in a value chain is described with respect to a factory and its downstream distribution centers(DCs). The paper proposes a lean approach solution for creating the improved order handling process, and analyze how great improvements in performance can be achieved. As a result, the significant achievement has created a win-win scenario for both the nonmanufacturing process in a factory and non-manufacturing facilities(like DCs) across the value chain. It demonstrates that improvements have been made by removing waste from the non-manufacturing process that takes place within a factory as well as with external participants through the whole value chain. Likewise, the proposed lean approach has helped the case companies to achieve greater levels of efficiency and more benefits. Finally, some conclusions are drawn.

关键词： Lean approach non-manufacturing process optimized order handling process removing wastes value chain win-win scenario

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Algorithm for the Fabric Spreading and Cutting Problem in Apparel Factories

引用

IEEE/CAA Journal of Automatica Sinica 2019年第4期6卷 961-968页

作者： Xiuqin Shang Dayong Shen Fei-Yue Wang Timo R. Nyberg the State Key Laboratory for Management and Control of Complex Systems Institute of AutomationChinese Academy of Sciences (CAS)Beijing 100190China the Qingdao Academy of Intelligent Industries Qingdao 266109China IEEE the Beijing Enineering Research Center of Intelligent Systems and Technology Institute of AutomationCASBeijing 100190China the Cloud Computing Center CASDongguan 523808China the School of Science at Aalto University AaltoFinland

We study the fabric spreading and cutting problem in apparel *** the sake of saving the material costs,the cutting requirement should be met exactly without producing additional garment *** reducing the production costs,the number of lays that corresponds to the frequency of using the cutting beds should be *** propose an iterated greedy algorithm for solving the fabric spreading and cutting *** algorithm contains a constructive procedure and an improving *** the constructive procedure creates a set of lays in sequence,and then the improving loop tries to pick each lay from the lay set and rearrange the remaining lays into a smaller lay *** improving loop will run until it cannot obtain any smaller lay set or the time limit is *** experiment results on 500 cases show that the proposed algorithm is effective and efficient.

关键词： Construction and improvement cutting and packing fabric spreading and cutting heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

Computational Complexity Analysis of Ant Colony Clustering Algorithms: Application to Student's Grouping Problem

Computational Complexity Analysis of Ant Colony Clustering A...

引用

2022 IEEE International Conference on systems, Man, and Cybernetics, SMC 2022

作者： Chniter, Malak Abid, Abir Kallel, Ilhem Kanoun, Slim Mir@cl Lab: Multimedia InfoRmation Systems and Advanced Computing Laboratory University of Sfax ReGIM-Lab: Research Groups in Intelligent Machines Tunisia

ISBN: (数字)9781665452588

ISBN: (纸本)9781665452588

The task of assessing, grouping and arranging data into meaningful groups or clusters based on their similarities/dissimilarities measures known as cluster analysis. Thereby, there are numerous clustering algorithms: hierarchical and partitional. In the last decade, clustering using bio-inspired algorithms received more attention, specifically the ant clustering algorithms. Regardless, they have required a lot of processing power due to the massive amount of data that has been generated during the last years. As a consequence, determining the computational cost of these algorithms is one of the most interesting tasks in the quest for optimal clustering solutions in a real-time system. This study presents a research guide for the researchers working in the same field. A series of experiments are elaborated to investigate the computational complexity of the most promising algorithms applied to students grouping problem. The results indicate two challenges that arise when using ant clustering algorithms: the difficulty in adjusting parameters and extended computation time. © 2022 IEEE.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A distributed heuristic for decentralized workflow scheduling in global grids

A distributed heuristic for decentralized workflow schedulin...

引用

2009 10th IEEE/ACM International Conference on Grid computing, Grid 2009

作者： Rahman, Mustafizur Ranjan, Rajiv Buyya, Rajkumar Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia Service Oriented Computing Research Group School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9781424451494

Efficient scheduling is a key concern for the effectual execution of performance driven Grid applications, such as workflows. Many list heuristics have been developed for scheduling workflows in centralized Grid environment. However, in this paper, we present a distributed list heuristic for decentralized scheduling of workflow applications in global Grids. The simulation results show that the proposed scheduling approach is scalable with respect to increased workload on the system. © 2009 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Dependable workflow scheduling in global grids

Dependable workflow scheduling in global grids

引用

2009 10th IEEE/ACM International Conference on Grid computing, Grid 2009

ISBN: (纸本)9781424451494

In this paper, a reputation-based Grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized Grid overlays. The proposed approach builds upon structured peer-to-peer indexing and overlay networking techniques to create a scalable wide-area networking of Grid sites for supporting dependable scheduling of applications. The scheduling algorithm considers reliability of a Grid resource as a statistical property, which is globally computed in the decentralized Grid overlay based on dynamic feedbacks or reputation scores assigned by individual service consumers (Grid Resource Brokers). The proposed algorithm can dynamically adapt to changing resource conditions and offer significant performance gains as compared to traditional approaches in the event of unsuccessful job execution or resource failure. We evaluate and demonstrate the feasibility of our approach through an extensive trace driven simulation. The results show that our scheduling technique can reduce the makespan up to 50% and successfully isolate the failure-prone resources from the system. © 2009 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：