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

The Lighthouse Alarm and Locator trial - A pilot study

Technology and Health Care 2007年第3期15卷 203-212页

作者： Melander-Wikman, A. Jansson, M. Hallberg, J. Mörtberg, C. Gard, G. Department of Health Sciences Luleå University of Technology Luleå Sweden Department of Business Administration and Social Sciences Luleå University of Technology Luleå Sweden Department of Computer Science and Electrical Engineering Luleå University of Technology Luleå Sweden Department of Informatics University of Oslo Oslo Norway University of Umeå Sweden Department of Human Work Sciences Luleå University of Technology Luleå Sweden Luleå University of Technology Department of Health Science SE 971 87 Luleå Sweden

An important factor for health is the possibility to be active and mobile. To make this possible various kinds of support are needed. Integrating geographical information systems technology and user experiences is important in the development of more user-friendly positioning devices. The Lighthouse Alarm and Locator trial aimed to test a new mobile alarm system with additional functionality such as positioning and monitoring of vital signs which can be used regardless of location (in hospital, at home). The system was tested by elderly persons from a pensioner organisation and home care personnel answered up on the alarms. After the tests qualitative interviews were performed with the two groups. The results showed that their experiences of the new mobile alarm system could be described in three main categories: to be supervised, to feel safe and to be mobile. These categories formed a theme: Positioning - an ethical dilemma. The clients' mobility was perceived to increase. The personnel did not think that positioning was ethical but the clients (elderly) did. © 2007 - IOS Press and the authors. All rights reserved.

关键词： Home care Mobility Positioning Safety alarm

来源：评论

学校读者我要写书评

暂无评论

ROBUST OUTPUT FEEDBACK CONTROL FOR DISCRETE TIME-DELAY UNCERTAIN SYSTEMS

引用

CONTROL AND INTELLIGENT SYSTEMS 2006年第1期34卷 57-63页

作者： Shi, P. Lin, Z. Shi, Y. School of Technology University of Glamorgan Pontypridd CF37 1DL United Kingdom Department of Electrical and Computer Engineering University of Toronto Toronto Ont. M5S 3G4 Canada School of Information Science Kyushu Tokai University Kumamoto 862-8652 9-1-1 Toroku Japan School of Technology University of Glamorgan United Kingdom IMA United Kingdom IEEE United Kingdom University of Toronto Canada School of Information Science Kyushu Tokai University Japan World Scientific and Engineering Academy and Society (WSEAS) Japan Japan Society for Fuzzy Theory and Intelligent Informatics (SOFT) Japan Information Processing Society Japan Biomedical Fuzzy Systems Association (BMFSA) Japan

This paper studies the problem of robust output feedback control of discrete time-delay systems with parameter uncertainties. The parameter uncertainties under consideration are time varying and norm bounded. A sufficient condition for the existence of a dynamic output-feedback controller is presented in terms of linear matrix inequalities (LMIs). It is also shown that the set of dynamic output-feedback controller can be implicitly parameterized by the solutions (X, Y, R, S) to the LMIs. An example is given to demonstrate the potential of the proposed techniques.

关键词： LMI parameter uncertainty time-delay system robust control

来源：评论

学校读者我要写书评

暂无评论

Multi-objective optimization for characterization of optical flow methods

Multi-objective optimization for characterization of optical...

引用

International Conference on computer Vision Theory and Applications (VISAPP)

作者： José Delpiano Luis Pizarro Rodrigo Verschae Javier Ruiz-del-Solar School of Engineering and Applied Sciences Universidad de los Andes Santiago Chile Department of Computer Science University College London London U.K. Graduate School of Informatics Kyoto University Kyoto Japan Department of Electrical Engineering Universidad de Chile Santiago Chile

ISBN: (纸本)9781479976867

Optical flow methods are among the most accurate techniques for estimating displacement and velocity fields in a number of applications that range from neuroscience to robotics. The performance of any optical flow method will naturally depend on the configuration of its parameters. Beyond the standard practice of manual (ad-hoc) selection of parameters for a specific application, in this article we propose a framework for automatic parameter setting that allows searching for an approximated Pareto-optimal set of configurations in the whole parameter space. This final Pareto front characterizes each specific method, enabling proper method comparison. We define two performance criteria, namely the accuracy and speed of the optical flow methods.

关键词： Optical imaging Optimization Adaptive optics Sociology Statistics computer vision Biomedical optical imaging

来源：评论

学校读者我要写书评

暂无评论

SOMA T3A for Solving the 100-Digit Challenge 1

引用

7th International Conference on Swarm, Evolutionary, and Memetic Computing, SEMCCO 2019, and 5th International Conference on Fuzzy and Neural Computing, FANCCO 2019

作者： Diep, Quoc Bao Zelinka, Ivan Das, Swagatam Senkerik, Roman Faculty of Electrical Engineering and Computer Science VSB - Technical University of Ostrava 17. listopadu 2172/15 Ostrava-Poruba708 00 Czech Republic Electronics and Communication Sciences Unit Indian Statistical Institute 203 Barrackpore Trunk Road Kolkata India Faculty of Applied Informatics Tomas Bata University in Zlin T. G. Masaryka 5555 Zlin760 01 Czech Republic

ISBN: (数字)9783030378387

ISBN: (纸本)9783030378370

In this paper, we address 10 basic test functions of the 100-Digit Challenge of the SEMCCO 2019 & FANCCO 2019 Competition by using team-to-team adaptive seft-organizing migrating algorithm - SOMA T3A with many improvements in the Organization, Migration, and Update process, as well as the linear adaptive PRT and the cosine-based adaptive Step. The results obtained from the algorithm on the 100-Digit Challenge are very promising with 93 points in total. © Springer Nature Switzerland AG 2020.

关键词： Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

Learning process termination criteria

引用

Informatica (Netherlands) 2012年第4期23卷 521-536页

作者： Brumen, Boštjan Hölbl, Marko Harej Pulko, Katja Welzer, Tatjana Heričko, Marjan Jurič, Matjaž B. Jaakkola, Hannu University of Maribor Faculty of Electrical Engineering Computer Science and Informatics Smetanova 17 SI-2000 Maribor Slovenia University of Ljubljana Faculty of Computer and Information Science Tržaška cesta 25 SI-1000 Ljubljana Slovenia Tampere University of Technology Pori Pohjoisranta 11 Pori FIN-28101 Finland

In a supervised learning, the relationship between the available data and the performance (what is learnt) is not well understood. How much data to use, or when to stop the learning process, are the key questions. In the paper, we present an approach for an early assessment of the extracted knowledge (classification models) in the terms of performance (accuracy). The key questions are answered by detecting the point of convergence, i.e., where the classification model's performance does not improve any more even when adding more data items to the learning set. For the learning process termination criteria we developed a set of equations for detection of the convergence that follow the basic principles of the learning curve. The developed solution was evaluated on real datasets. The results of the experiment prove that the solution is well-designed: the learning process stopping criteria are not subjected to local variance and the convergence is detected where it actually has occurred. © 2012 Vilnius Universit.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Wide-range Angle-sensitive Plasmonic Color Printing with a Lossy Resonator

Wide-range Angle-sensitive Plasmonic Color Printing with a L...

引用

CLEO: Applications and Technology, CLEO:A and T 2023 - Part of Conference on Lasers and Electro-Optics 2023

作者： Chowdhury, Sarah N. Simon, Jeffrey Nowak, Michal P. Prokopeva, Ludmila J. Pagadala, Karthik Fruhling, Colton Nyga, Piotr Bravo, Esteban Garcia Kildishev, Alexander V. Shalaev, Vladimir M. Boltasseva, Alexandra School of Electrical and Computer Engineering Birck Nanotechnology Center Purdue University 1205 W State St West LafayetteIN47906 United States Institute of Optoelectronics Military University of Technology 2 Kaliskiego St Warsaw00-908 Poland Institute of Physics Faculty of Physics Astronomy and Informatics Nicolaus Copernicus University Toruń87-100 Poland Department of Computer Graphics Technology Purdue University 401 N. Grant St Knoy Hall West LafayetteIN47907 United States

ISBN: (纸本)9781957171258

We demonstrate a wide gamut of color generation by large-scale, lithography-free, and environment-friendly plasmonic structures with a resolution of 100 µm for macroscopic color printing by utilizing femtosecond laser photomodification of multi-functional optical elements. CLEO 2023 © Optica Publishing Group 2023, © 2023 The Author(s)

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detection of Violence in Cartoon Videos Using Visual Features

引用

Procedia computer Science 2021年 192卷 4962-4971页

作者： Tahira Khalil Javed Iqbal Bangash Abdul Waheed Khan Saima Anwar Lashari Abdullah Khan Dzati Athiar Ramli Department of Computing Abasyn University Peshawar Pakistan nstitute of Computer Science and IT (ICS/IT) The Agriculture University Peshawar Pakistan Department of IT and Computer Science Pak-Austria Fachhochschule-Institute of Applied Sciences and Technology Haripur Pakistan College of Computing and Informatics Saudi Electronic University Riyadh KSA Intelligent Biometrics Group (IBG) School of Electrical and Electronic Engineering USM Engineering Campus University Sains Malaysia 14300 Nibong Tebal Pulau Pinang

Technology play an important role in today era. Tremendous growth has been observed in the field of communication and technology. Same is noteworthy in case of video and multimedia. An enormous amount of visual clips containing all types of scenes can easily be accessed both online and offline. In the use of internet has increase the trend of watching cartoons as a source of entertainment among children. There is a tendency that cartoon video has scenes that make some people uncomfortable because of the contents of the video that may be against their feelings and acceptability levels. There could be a number of objectionable elements in cartoon videos. This work presents a framework based on knowledgebase, with visual features which is divided into two categories i.e. character and object database. That deal with the detection of violent contents in cartoon videos which can have negative impact on child personality. A prototype of this system is developed and implemented in Mat lab. The experimental results show that the proposed system successfully detects the violent scenes in cartoon videos.

关键词： Low-Level Features Object Extraction Violence Detection Cartoon Videos

来源：评论

学校读者我要写书评

暂无评论

Some new algorithms for knowledge discovery in local hypertext corpora

引用

WSEAS Transactions on Circuits and Systems 2005年第11期4卷 1493-1500页

作者： Vassiliadis, B. Stefani, A. Drossos, L. Ioannou, K. Computer Science Hellenic Open University 13-15 Tsamadou st. GR-26222 Patras Greece Department of Applied Informatics in Management and Economy Technical Education Institute of Messologi Messologi Greece Wireless Telecommunication Laboratory Department of Electrical and Computer Engineering University of Patras Rion 26500 Patras Greece

The wealth of information available in the internet or local corpora has increased while our ability to search and retrieve relevant information is being reduced. Hypermedia, being complex information objects, are difficult to manage. In this paper we propose some new algorithms for searching and retrieving hypermedia documents from a local server by taking advantage content and context information. Besides presenting new solutions for hypertext, we review the state of the art in multimedia data mining and present future trends in this research area.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Breaking the 2n-barrier for Irredundance: Two lines of attack

Breaking the 2n-barrier for Irredundance: Two lines of attac...

引用

作者： Binkele-Raible, Daniel Brankovic, Ljiljana Cygan, Marek Fernau, Henning Kneis, Joachim Kratsch, Dieter Langer, Alexander Liedloff, Mathieu Pilipczuk, Marcin Rossmanith, Peter Wojtaszczyk, Jakub Onufry FB 4 - Abteilung Informatik Universität Trier Germany School of Electrical Engineering and Computer Science University of Newcastle Australia Faculty of Mathematics Informatics and Mechanics University of Warsaw Poland Dept. of Computer Science RWTH Aachen University Germany Laboratoire D Informatique Théorique et Appliquée Université Paul Verlaine Metz France Laboratoire D Informatique Fondamentale D Orléans Université D Orléans France Institute of Mathematics Polish Academy of Sciences Poland

The lower and the upper irredundance numbers of a graph G, denoted ir(G) and IR(G), respectively, are conceptually linked to the domination and independence numbers and have numerous relations to other graph parameters. It has been an open question whether determining these numbers for a graph G on n vertices admits exact algorithms running in time faster than the trivial Θ(2n. poly(n)) enumeration, also called the 2 n-barrier. The main contributions of this article are exact exponential-time algorithms breaking the 2n-barrier for irredundance. We establish algorithms with running times of *(1.99914 n) for computing ir(G) and *(1.9369n) for computing IR(G). Both algorithms use polynomial space. The first algorithm uses a parameterized approach to obtain (faster) exact algorithms. The second one is based, in addition, on a reduction to the Maximum Induced Matching problem providing a branch-and-reduce algorithm to solve it. © 2011 Elsevier B.V. © 2011 Elsevier B.V. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Spatial sparse subspace clustering for compressive spectral imaging

arXiv

引用

arXiv 2019年

作者： Zhu, Jianchen Zhang, Tong Zhao, Shengjie Hinojosa, Carlos Liu, Zengli Arce, Gonzalo R. Key Laboratory of Embedded System and Service Computing Ministry of Education School of Software Engineering Tongji University Shanghai201804 China School of Electronic and Information Engineering Tongji University Shanghai201804 China Department of System Engineering and Informatics Universidad Industrial de Santander Bucaramanga680002 Colombia Institute of information engineering and automation Computer Center Kunming University of Science and Technology Kunming650500 China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

This paper aims at developing a clustering approach with spectral images directly from CASSI compressive measurements. The proposed clustering method first assumes that compressed measurements lie in the union of multiple low-dimensional subspaces. Therefore, sparse subspace clustering (SSC) is an unsupervised method that assigns compressed measurements to their respective subspaces. In addition, a 3D spatial regularizer is added into the SSC problem, thus taking full advantages of the spatial information contained in spectral images. The performance of the proposed spectral image clustering approach is improved by taking optimal CASSI measurements obtained when optimal coded apertures are used in CASSI system. Simulation with one real dataset illustrates the accuracy of the proposed spectral image clustering approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Spectroscopy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：