Search

Your search keyword '"School of of Electrical and Computer Engineering [Athens] (School of E.C.E)"' showing total 19 results
Start Over Author "School of of Electrical and Computer Engineering [Athens] (School of E.C.E)" Language english
19 results on '"School of of Electrical and Computer Engineering [Athens] (School of E.C.E)"'

1. Microgrids Control Issues

Author

Dimeas, Aris L., Tsikalakis, Antonis G., Georges Kariniotakis, George Korres, School of of Electrical and Computer Engineering [Athens] ( School of E.C.E ), National Technical University of Athens, Centre Procédés, Énergies Renouvelables, Systèmes Énergétiques ( PERSEE ), MINES ParisTech - École nationale supérieure des mines de Paris-PSL Research University ( PSL ), Hellenic Centre for Marine Research ( HCMR ), Nikos Hatziargyriou, School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Centre Procédés, Énergies Renouvelables, Systèmes Énergétiques (PERSEE), MINES ParisTech - École nationale supérieure des mines de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), and Hellenic Centre for Marine Research (HCMR)

Subjects
microgrid, [ SPI.ENERG ] Engineering Sciences [physics]/domain_spi.energ, [SPI.ENERG]Engineering Sciences [physics]/domain_spi.energ
Abstract

International audience; Chapter 2 = Introduction - Control Functions - The Role of Information and Communication Technology - Microgrid Control Architecture - Centralized and Decentralized Control - Forecasting - Centralized Control - Decentralized Control - State Estimation - Conclusions. Book description : Microgrids are the most innovative area in the electric power industry today. Future microgrids could exist as energy-balanced cells within existing power distribution grids or stand-alone power networks within small communities. A definitive presentation on all aspects of microgrids, this text examines the operation of microgrids - their control concepts and advanced architectures including multi-microgrids. It takes a logical approach to overview the purpose and the technical aspects of microgrids, discussing the social, economic and environmental benefits to power system operation. The book also presents microgrid design and control issues, including protection and explaining how to implement centralized and decentralized control strategies.

Published
2014

2. Modelling of micro-sources for security studies

Author

Hatziargyriou, Nikos D., Kanellos, F., Georges Kariniotakis, Xavier Le Pivert, Jenkins, N., Jayawarna, N., Pecas Lopes, Joao A., Gil, J., Moreira, C., José Oyarzabal, Larrabe, Z., National Technical University of Athens [Athens] ( NTUA ), CEP/Sophia, Centre Énergétique et Procédés ( CEP ), MINES ParisTech - École nationale supérieure des mines de Paris-PSL Research University ( PSL ) -MINES ParisTech - École nationale supérieure des mines de Paris-PSL Research University ( PSL ), University Of Manchester Institute ( UMIST/Department of Process Integration ), University of Manchester [Manchester], University of Manchester Institute ( UMIStT/Department of Process Integration ), School of of Electrical and Computer Engineering [Athens] ( School of E.C.E ), National Technical University of Athens, Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento em Lisboa ( INESC-ID ), Instituto Superior Técnico, Universidade Técnica de Lisboa ( IST ) -Instituto de Engenharia de Sistemas e Computadores ( INESC ), LABEIN, Conseil International des Grands Réseaux Electriques, National Technical University of Athens [Athens] (NTUA), Centre Énergétique et Procédés (CEP), MINES ParisTech - École nationale supérieure des mines de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-MINES ParisTech - École nationale supérieure des mines de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), University Of Manchester Institute (UMIST/Department of Process Integration), University of Manchester Institute (UMIStT/Department of Process Integration), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento em Lisboa (INESC-ID), and Instituto Superior Técnico, Universidade Técnica de Lisboa (IST)-Instituto de Engenharia de Sistemas e Computadores (INESC)

Subjects
Wind Turbines, [ SPI.NRJ ] Engineering Sciences [physics]/Electric power, Photovoltaic Systems, [SPI.NRJ]Engineering Sciences [physics]/Electric power, Fuel Cells, Micro-turbines, Control Systems, Microgrids
Abstract

International audience; The interconnection of small, modular generation and storage technologies at the MV and LV distribution level have the potential to significantly impact power system performance. In this paper models of the main micro-generation sources are described. In particular, the models of Microturbines, Fuel Cells, Photovoltaic Systems and Wind Turbines, are described. In addition basic models of their power electronic interfaces are given. The integration of the above models in a steady state and dynamic simulation tool, which is developed in the framework of the EU funded MICROGRIDS project, will provide a simulation test platform, which will be necessary to define and evaluate the developed operational and control strategies.

Published
2004

3. Preliminary results from the More Advanced Control Advice Project for secure operation of isolated power systems with increased renewable energy penetration and storage

Author

P.S. Dokopoulos, Manuel A. Matos, Georges Contaxis, D. McCoy, Georges Kariniotakis, M. H. Vasconcelos, N.D. Hatziargyriou, J. Halliday, J.M.S. Cotrim, Anastasios G. Bakirtzis, J. Stefanakis, Antiopi Gigantidou, Didier Mayer, Geoff Dutton, P. O'Donnell, J. A. Pecas Lopes, M.J. Fernandes, A.P. Figueira, National Technical University of Athens [Athens] (NTUA), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento em Lisboa (INESC-ID), Instituto Superior Técnico, Universidade Técnica de Lisboa (IST)-Instituto de Engenharia de Sistemas e Computadores (INESC), Centre Énergétique et Procédés (CEP), MINES ParisTech - École nationale supérieure des mines de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), Department of Electrical & Computer Engineering [Thessaloniki], Aristotle University of Thessaloniki, Public Power Corporation - Grèce (PPC), PPC, ESB National Grid - Power System Operations, ESB National Grid - Power System Operation, Empresa de Electricidade da Madeira (EEM), EEM, National Technical University of Athens [Athens] ( NTUA ), School of of Electrical and Computer Engineering [Athens] ( School of E.C.E ), National Technical University of Athens, Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento em Lisboa ( INESC-ID ), Instituto Superior Técnico, Universidade Técnica de Lisboa ( IST ) -Instituto de Engenharia de Sistemas e Computadores ( INESC ), Centre Énergétique et Procédés ( CEP ), MINES ParisTech - École nationale supérieure des mines de Paris-PSL Research University ( PSL ), Public Power Corporation - Grèce ( PPC ), Empresa de Electricidade da Madeira ( EEM ), and Faculdade de Engenharia

Subjects
Engineering, Economic forecasting, 020209 energy, Engenharia electrotécnica, electrónica e informática [Ciências da engenharia e tecnologias], Wind power forecasting, 02 engineering and technology, Engenharia electrotécnica, Engenharia electrotécnica, electrónica e informática, 7. Clean energy, Power system security, Electric power system, Power system simulation, [SPI.ENERG]Engineering Sciences [physics]/domain_spi.energ, Interconnected systems, 0202 electrical engineering, electronic engineering, information engineering, Software system, Software systems, Wind energy, Wind forecasting, [ SPI.ENERG ] Engineering Sciences [physics]/domain_spi.energ, Control systems, Wind power, Load forecasting, Power generation economics, business.industry, Economic dispatch, Electrical engineering, Electrical engineering, Electronic engineering, Information engineering [Engineering and technology], Renewable energy, Power system economics, Systems engineering, 020201 artificial intelligence & image processing, Electrical engineering, Electrical engineering, Electronic engineering, Information engineering, business
Abstract

International audience; In this paper, preliminary results from MORE CARE, a European R&D project financed within the Energy Program are described. This project has, as its main objective, the development of an advanced control software system, aiming to optimize the overall performance of isolated and weakly interconnected systems in liberalized market environments by increasing the share of wind energy and other renewable forms, including advanced online security functions. The main features of the control system comprise advanced software modules for load and wind power forecasting, unit commitment and economic dispatch of the conventional and renewable units and online security assessment capabilities integrated in a friendly man-machine environment. Pilot installations of advanced control functions are foreseen on the islands of Crete, Ireland and Madeira

Published
2001
Full Text
View/download PDF

4. Control of isolated power systems with increased PV and wind power integration

Author

Hatziargyriou, Nikos D., Papadopoulos, N., Papadias, P., Georges Contaxis, Eric Nogaret, Georges Kariniotakis, Didier Mayer, Matos, M., Pecas Lopes, Joao A., Halliday, J. A., Dutton, G., Aris Androutsos, John Stefanakis, Antiopi Gigantidou, National Technical University of Athens [Athens] (NTUA), Centre Énergétique et Procédés (CEP), MINES ParisTech - École nationale supérieure des mines de Paris, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento em Lisboa (INESC-ID), Instituto Superior Técnico, Universidade Técnica de Lisboa (IST)-Instituto de Engenharia de Sistemas e Computadores (INESC), Public Power Corporation - Grèce (PPC), PPC, National Technical University of Athens [Athens] ( NTUA ), Centre Énergétique et Procédés ( CEP ), MINES ParisTech - École nationale supérieure des mines de Paris-PSL Research University ( PSL ), School of of Electrical and Computer Engineering [Athens] ( School of E.C.E ), National Technical University of Athens, Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento em Lisboa ( INESC-ID ), Instituto Superior Técnico, Universidade Técnica de Lisboa ( IST ) -Instituto de Engenharia de Sistemas e Computadores ( INESC ), and Public Power Corporation - Grèce ( PPC )

Subjects
[ SPI.ENERG ] Engineering Sciences [physics]/domain_spi.energ, power system, [SPI.ENERG]Engineering Sciences [physics]/domain_spi.energ, wind power, ComputingMilieux_MISCELLANEOUS
Abstract

International audience

Published
1998

5. Task Driven Skill Learning in a Soft-Robotic Arm*

Author

Paris Oikonomou, Athanasios Dometios, Mehdi Khamassi, Costas S. Tzafestas, Institut des Systèmes Intelligents et de Robotique (ISIR), Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Khamassi, Mehdi, SoftGrip: Functionalised Soft robotic gripper for delicate produce harvesting powered by imitation learning-based control - H2020-ICT-2018-20 SOFTGRIP - 101017054 - INCOMING, Architectures et modèles d'Adptation et de la cognition (AMAC), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), This research has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement no. 101017054 (project: SoftGrip). This research was also partially supported by the French Centre National de la Recherche Scientifique (CNRS) PICS international scheme no. 279521., IEEE, and European Project: 101017054,H2020-ICT-2018-20 SOFTGRIP

Subjects
0209 industrial biotechnology, [SPI] Engineering Sciences [physics], [INFO.INFO-RB] Computer Science [cs]/Robotics [cs.RO], Robot Learning, 02 engineering and technology, [INFO.INFO-LG] Computer Science [cs]/Machine Learning [cs.LG], Soft Robotics, [INFO] Computer Science [cs], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [SPI]Engineering Sciences [physics], 020901 industrial engineering & automation, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Reinforcement learning, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], [INFO]Computer Science [cs], Probabilistic Movement Primitives
Abstract

International audience; In this paper we introduce a novel technique that aims to dynamically control a two-module bio-inspired softrobotic arm in order to qualitatively reproduce a path defined by sparse way-points. The main idea behind this work is based on the assumption that a complex trajectory may be derived as a combination of a discrete set of parameterizable simple movements, as suggested by Movement Primitive (MP) theory. Capitalising on recent advanced in this field, the proposed controller uses a Probabilistic MP (ProMP) model which initially creates an abstract mapping in the primitive-level between the task and the actuation space, and subsequently guides the movement's composition by exploiting its unique properties-conditioning and blending. At the same time, a learning-based adaptive controller updates the composition parameters by estimating the inverse kinematics of the robot, while an auxiliary process through replanning ensures that the trajectory complies with the new estimation. The learning architecture is evaluated on both a simulation model, and a real soft-robotic arm. The research findings show that the proposed methodology constitutes a novel approach that successfully manages to simplify the trajectory control task for robots of complex dynamics when high-precision is not required.

Published
2021

6. MRI Vocal Tract Sagittal Slices Estimation during Speech Production of CV

Author

Chrysanthi Dourou, Jacques Felblinger, Ajinkya Kulkarni, Pierre-André Vuissoz, Yu Xie, Yves Laprie, Karyna Isaieva, Ioannis Douros, Laprie, Yves, Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Department of Neurology, Wuhan University [China], School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Centre d'investigation clinique [Nancy] (CIC), Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Imagerie Adaptative Diagnostique et Interventionnelle (IADI), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), and Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)

Subjects
Speech production, Signal processing, speech resources enrichment, Computer science, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, Speech recognition, 020206 networking & telecommunications, 02 engineering and technology, Sagittal plane, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Set (abstract data type), RtMRI data, medicine.anatomical_structure, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], vocal tract, 0202 electrical engineering, electronic engineering, information engineering, medicine, Frame (artificial intelligence), 020201 artificial intelligence & image processing, Image transformation, Vocal tract
Abstract

International audience; In this paper we propose an algorithm for estimating vocal tract para sagittal slices in order to have a better overview of the behaviour of the articulators during speech production. The first step is to align the consonant-vowel (CV) data of the sagittal plains between them for the train speaker. Sets of transformations that connect the midsagittal frames with the neighbouring ones is acquired for the train speaker. Another set of transformations is calculated which transforms the midsagittal frames of the train speaker to the corresponding midsagittal frames of the test speaker and is used to adapt to the test speaker domain the previously computed sets of transformations. The newly adapted transformations are applied to the midsagittal frames of the test speaker in order to estimate the neighbouring sagittal frames. Several mono speaker models are combined to produce the final frame estimation. To evaluate the results, image cross-correlation between the original and the estimated frames was used. Results show good agreement between the original and the estimated frames.

Published
2021
Full Text
View/download PDF

7. Synthesize MRI vocal tract data during CV production

Author

Ioannis Douros, Chrysanthi Dourou, Yu Xie, jacques Felblinger, Karyna Isaieva, Pierre-André Vuissoz, Yves Laprie, Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Imagerie Adaptative Diagnostique et Interventionnelle (IADI), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Department of Neurology, Wuhan University [China], Centre d'investigation clinique [Nancy] (CIC), Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL), Université de Lorraine (UL)-Institut National de la Santé et de la Recherche Médicale (INSERM), and Laprie, Yves

Subjects
[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience; A set of rtMR image transformations across time is computed during the production of CV that is afterwards applied to a new speaker in order to synthesize his/her CV pseudo rtMRI data. Synthesized images are compared with the original ones using image cross-correlation. 2 Purpose To be able to enlarge MRI speech corpus by synthesizing data.

Published
2020

8. Vocal tract sagittal slices estimation from MRI midsagittal slices during speech production of CV

Author

Ioannis Douros, Yu Xie, Chrysanthi Dourou, jacques Felblinger, Karyna Isaieva, Pierre-André Vuissoz, Yves Laprie, Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Imagerie Adaptative Diagnostique et Interventionnelle (IADI), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Department of Neurology, Wuhan University [China], School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Centre d'investigation clinique [Nancy] (CIC), Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Laprie, Yves, Université de Lorraine (UL)-Institut National de la Santé et de la Recherche Médicale (INSERM), and Université de Lorraine (UL)-Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy)-Institut National de la Santé et de la Recherche Médicale (INSERM)

Subjects
[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, ComputingMilieux_MISCELLANEOUS, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]
Abstract

International audience

Published
2020

9. Adaptive reinforcement learning with active state-specific exploration for engagement maximization during simulated child-robot interaction

Author

Theodore Tsitsimis, George Velentzas, Iñaki Rañó, Costas S. Tzafestas, Mehdi Khamassi, School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Faculty of Computing and Engineering [University of Ulster], University of Ulster, Institut des Systèmes Intelligents et de Robotique (ISIR), and Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)

Subjects
reinforcement learning, Technology, Meta learning (computer science), Computer science, Cognitive Neuroscience, joint action, 02 engineering and technology, Robot learning, Human–robot interaction, Task (project management), 03 medical and health sciences, Behavioral Neuroscience, human-robot interaction, 0302 clinical medicine, meta-learning, Developmental Neuroscience, Artificial Intelligence, Human–computer interaction, 0202 electrical engineering, electronic engineering, information engineering, Reinforcement learning, State space, 030206 dentistry, Maximization, Human-Computer Interaction, Robot, autonomous robotics, [SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC], 020201 artificial intelligence & image processing, active exploration, engagement
Abstract

Using assistive robots for educational applications requires robots to be able to adapt their behavior specifically for each child with whom they interact.Among relevant signals, non-verbal cues such as the child’s gaze can provide the robot with important information about the child’s current engagement in the task, and whether the robot should continue its current behavior or not. Here we propose a reinforcement learning algorithm extended with active state-specific exploration and show its applicability to child engagement maximization as well as more classical tasks such as maze navigation. We first demonstrate its adaptive nature on a continuous maze problem as an enhancement of the classic grid world. There, parameterized actions enable the agent to learn single moves until the end of a corridor, similarly to “options” but without explicit hierarchical representations.We then apply the algorithm to a series of simulated scenarios, such as an extended Tower of Hanoi where the robot should find the appropriate speed of movement for the interacting child, and to a pointing task where the robot should find the child-specific appropriate level of expressivity of action. We show that the algorithm enables to cope with both global and local non-stationarities in the state space while preserving a stable behavior in other stationary portions of the state space. Altogether, these results suggest a promising way to enable robot learning based on non-verbal cues and the high degree of non-stationarities that can occur during interaction with children.

Published
2018
Full Text
View/download PDF

10. Using Silence MR Image to Synthesise Dynamic MRI Vocal Tract Data of CV

Author

Chrysanthi Dourou, Pierre-André Vuissoz, Karyna Isaieva, Yu Xie, Jacques Felblinger, Ioannis Douros, Ajinkya Kulkarni, Yves Laprie, Laprie, Yves, Speech Modeling for Facilitating Oral-Based Communication (MULTISPEECH), Inria Nancy - Grand Est, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Department of Natural Language Processing & Knowledge Discovery (LORIA - NLPKD), Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Imagerie Adaptative Diagnostique et Interventionnelle (IADI), Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Department of Neurology, Wuhan University [China], Centre d'investigation clinique [Nancy] (CIC), Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy)-Institut National de la Santé et de la Recherche Médicale (INSERM)-Université de Lorraine (UL), Université de Lorraine (UL)-Institut National de la Santé et de la Recherche Médicale (INSERM), and Université de Lorraine (UL)-Centre Hospitalier Régional Universitaire de Nancy (CHRU Nancy)-Institut National de la Santé et de la Recherche Médicale (INSERM)

Subjects
Computer science, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, Speech recognition, Frame (networking), 020206 networking & telecommunications, 02 engineering and technology, [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL], Image (mathematics), Set (abstract data type), Silence, 030507 speech-language pathology & audiology, 03 medical and health sciences, image transformation, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-CL] Computer Science [cs]/Computation and Language [cs.CL], vocal tract, Dynamic contrast-enhanced MRI, 0202 electrical engineering, electronic engineering, information engineering, Mr images, 0305 other medical science, Speech resources enrichment, Vocal tract, rtMRI data, pseudo rtMRI synthesis
Abstract

International audience; In this work we present an algorithm for synthesising pseudo rtMRI data of the vocal tract. rtMRI data on the midsagittal plane were used to synthesise target consonant-vowel (CV) using only a silence frame of the target speaker. For this purpose, several single speaker models were created. The input of the algorithm is a silence frame of both train and target speaker and the rtMRI data of the target CV. An image transformation is computed from each CV frame to the next one, creating a set of transformations that describe the dynamics of the CV production. Another image transformation is computed from the silence frame of train speaker to the silence frame of the target speaker and is used to adapt the set of transformations computed previously to the target speaker. The adapted set of transformations is applied to the silence of the target speaker tosynthesise his/her CV pseudo rtMRI data. Synthesised images from multiple single speaker models are frame aligned and then averaged to create the final version of synthesised images. Synthesised images are compared with the original ones using image cross-correlation. Results show good agreement between the synthesised and the original images.

Published
2020

11. A Novel Reinforcement-Based Paradigm for Children to Teach the Humanoid Kaspar Robot

Author

Luke Jai Wood, Costas S. Tzafestas, Farshid Amirabdollahian, Ben Robins, Kerstin Dautenhahn, Mehdi Khamassi, Gabriella Lakatos, Abolfazl Zaraki, University of Hertfordshire [Hatfield] (UH), Institut cellule souche et cerveau / Stem Cell and Brain Research Institute (U1208 Inserm - UCBL1 / SBRI - USC 1361 INRAE), Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de la Santé et de la Recherche Médicale (INSERM)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), University of Waterloo [Waterloo], Institut des Systèmes Intelligents et de Robotique (ISIR), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), Centre National de la Recherche Scientifique (MITI ROBAUTISTE and PICS 279521), European Project: 687831,H2020,H2020-ICT-2015,BabyRobot(2016), Gestionnaire, HAL Sorbonne Université 5, and Child-Robot Communication and Collaboration: Edutainment, Behavioural Modelling and Cognitive Development in Typically Developing and Autistic Spectrum Children - BabyRobot - - H20202016-01-01 - 2018-12-31 - 687831 - VALID

Subjects
General Computer Science, Social Psychology, Process (engineering), media_common.quotation_subject, Autism, Control (management), 050105 experimental psychology, Human–robot interaction, 03 medical and health sciences, 0302 clinical medicine, Reinforcement learning, medicine, Autonomous robotics, [INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO], 0501 psychology and cognitive sciences, Electrical and Electronic Engineering, Reinforcement learning algorithm, Reinforcement, media_common, Enthusiasm, business.industry, Teaching, [INFO.INFO-RB] Computer Science [cs]/Robotics [cs.RO], 05 social sciences, Robotics, medicine.disease, Human-Computer Interaction, Philosophy, Control and Systems Engineering, Robot, Children social skills, Artificial intelligence, business, Psychology, 030217 neurology & neurosurgery, Cognitive psychology
Abstract

This paper presents a contribution aiming at testing novel child–robot teaching schemes that could be used in future studies to support the development of social and collaborative skills of children with autism spectrum disorders (ASD). We present a novel experiment where the classical roles are reversed: in this scenario the children are the teachers providing positive or negative reinforcement to the Kaspar robot in order for it to learn arbitrary associations between different toy names and the locations where they are positioned. The objective is to stimulate interaction and collaboration between children while teaching the robot, and also provide them tangible examples to understand that sometimes learning requires several repetitions. To facilitate this game, we developed a reinforcement learning algorithm enabling Kaspar to verbally convey its level of uncertainty during the learning process, so as to better inform the children about the reasons behind its successes and failures. Overall, 30 typically developing (TD) children aged between 7 and 8 (19 girls, 11 boys) and 9 children with ASD performed 25 sessions (16 for TD; 9 for ASD) of the experiment in groups, and managed to teach Kaspar all associations in 2 to 7 trials. During the course of study Kaspar only made rare unexpected associations (2 perseverative errors and 2 win-shifts, within a total of 314 trials), primarily due to exploratory choices, and eventually reached minimal uncertainty. Thus, the robot’s behaviour was clear and consistent for the children, who all expressed enthusiasm in the experiment.

Published
2019
Full Text
View/download PDF

12. Linear Search by a Pair of Distinct-Speed Robots

Author

Tomasz Kociumaka, Jurek Czyzowicz, David Ilcinkas, Leszek Gąsieniec, Ralf Klasing, Dominik Pająk, Evangelos Bampas, School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Département d'Informatique et d'Ingénierie (DII), Université du Québec en Outaouais (UQO), Department of Computer Science [Liverpool], University of Liverpool, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), University of Warsaw (UW), Institute of informatics [Wrocław], See paper for details., ANR-11-BS02-0014,DISPLEXITY,Calculabilité et complexité en distribué(2011), ANR-13-JS02-0002,MACARON,Bouger et Calculer: Agents, Robots et Réseaux(2013), ANR-16-CE40-0023,DESCARTES,Abstraction modulaire pour le calcul distribué(2016), ANR-10-IDEX-0003,IDEX BORDEAUX,Initiative d'excellence de l'Université de Bordeaux(2010), Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory, Pajak, Dominik S, Laboratoire d'informatique Fondamentale de Marseille (LIF), Aix Marseille Université (AMU)-École Centrale de Marseille (ECM)-Centre National de la Recherche Scientifique (CNRS), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Institute of Informatics [Warsaw], Faculty of Mathematics, Informatics, and Mechanics [Warsaw] (MIMUW), University of Warsaw (UW)-University of Warsaw (UW), and Centre National de la Recherche Scientifique (CNRS)-École Centrale de Marseille (ECM)-Aix Marseille Université (AMU)

Subjects
Engineering, General Computer Science, Computer science, different speeds, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Bang-bang robot, linear search, 01 natural sciences, Article, Computer Science::Robotics, Position (vector), mobile robots, 0202 electrical engineering, electronic engineering, information engineering, Cartesian coordinate robot, Point (geometry), Computer vision, [INFO]Computer Science [cs], Online algorithm, Simulation, Linear search, 021103 operations research, business.industry, Applied Mathematics, Mobile robot, Computer Science Applications, 010201 computation theory & mathematics, group search, Moment (physics), Line (geometry), Robot, 020201 artificial intelligence & image processing, Artificial intelligence, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], business
Abstract

Two mobile robots are initially placed at the same point on an infinite line. Each robot may move on the line in either direction not exceeding its maximal speed. The robots need to find a stationary target placed at an unknown location on the line. The search is completed when both robots arrive at the target point. The target is discovered at the moment when either robot arrives at its position. The robot knowing the placement of the target may communicate it to the other robot. We look for the algorithm with the shortest possible search time (i.e. the worst-case time at which both robots meet at the target) measured as a function of the target distance from the origin (i.e. the time required to travel directly from the starting point to the target at unit velocity). We consider two standard models of communication between the robots, namely wireless communication and communication by meeting. In the case of communication by meeting, a robot learns about the target while sharing the same location with a robot possessing this knowledge. We propose here an optimal search strategy for two robots including the respective lower bound argument, for the full spectrum of their maximal speeds. This extends the main result of Chrobak et al. (in: Italiano, Margaria-Steffen, Pokorný, Quisquater, Wattenhofer (eds) Current trends in theory and practice of computer science, SOFSEM, 2015) referring to the exact complexity of the problem for the case when the speed of the slower robot is at least one third of the faster one. In the wireless communication model, a message sent by one robot is instantly received by the other robot, regardless of their current positions on the line. For this model, we design a strategy which is optimal whenever the faster robot is at most \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sqrt{17}+4\approx 8.123$$\end{document}17+4≈8.123 times faster than the slower one. We also prove that otherwise the wireless communication offers no advantage over communication by meeting.

Published
2019
Full Text
View/download PDF

13. Robot Fast Adaptation to Changes in Human Engagement During Simulated Dynamic Social Interaction With Active Exploration in Parameterized Reinforcement Learning

Author

Khamassi, Mehdi, Velentzas, George, Tsitsimis, Theodore, Tzafestas, Costas, Institut des Systèmes Intelligents et de Robotique (ISIR), Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), and National Technical University of Athens [Athens] (NTUA)

Subjects
[SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]
Abstract

International audience; Dynamic uncontrolled human-robot interactions (HRIs) require robots to be able to adapt to changes in the human's behavior and intentions. Among relevant signals, non-verbal cues such as the human's gaze can provide the robot with important information about the human's current engagement in the task, and whether the robot should continue its current behavior or not. However, robot reinforcement learning (RL) abilities to adapt to these nonverbal cues are still underdeveloped. Here, we propose an active exploration algorithm for RL during HRI where the reward function is the weighted sum of the human's current engagement and variations of this engagement. We use a parameterized action space where a meta-learning algorithm is applied to simultaneously tune the exploration in discrete action space (e.g., moving an object) and in the space of continuous characteristics of movement (e.g., velocity, direction, strength, and expressivity). We first show that this algorithm reaches state-of-the-art performance in the nonstationary multiarmed bandit paradigm. We then apply it to a simulated HRI task, and show that it outper-forms continuous parameterized RL with either passive or active exploration based on different existing methods. We finally test the performance in a more realistic test of the same HRI task, where a practical approach is followed to estimate human engagement through visual cues of the head pose. The algorithm can detect and adapt to perturbations in human engagement with different durations. Altogether, these results suggest a novel efficient and robust framework for robot learning during dynamic HRI scenarios.

Published
2018
Full Text
View/download PDF

14. Benchmarking asymmetric 3D-2D face recognition systems

Author

Georgios Evangelopoulos, Di Huang, Yunhong Wang, Xi Zhao, Wuming Zhang, Liming Chen, Shishir K. Shah, Ioannis A. Kakadiaris, Institut Camille Jordan [Villeurbanne] (ICJ), École Centrale de Lyon (ECL), Université de Lyon-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université Jean Monnet [Saint-Étienne] (UJM)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Extraction de Caractéristiques et Identification (imagine), Laboratoire d'InfoRmatique en Image et Systèmes d'information (LIRIS), Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Institut National des Sciences Appliquées (INSA)-Université de Lyon-Institut National des Sciences Appliquées (INSA)-Centre National de la Recherche Scientifique (CNRS)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École Centrale de Lyon (ECL), Université de Lyon-Université Lumière - Lyon 2 (UL2)-Institut National des Sciences Appliquées de Lyon (INSA Lyon), Université de Lyon-Université Lumière - Lyon 2 (UL2), and IEEE

Subjects
business.industry, Computer science, Pattern recognition, 02 engineering and technology, Solid modeling, Benchmarking, Facial recognition system, Random forest, Image texture, 020204 information systems, Face (geometry), 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Computer vision, [INFO]Computer Science [cs], Artificial intelligence, business, Protocol (object-oriented programming), Pose
Abstract

International audience; — Asymmetric 3D-2D face recognition (FR) aims torecognize individuals from 2D face images using textured 3Dface models in the gallery (or vice versa). This new FR scenariohas the potential to be readily deployable in field applicationswhile still keeping the advantages of 3D FR solutions of beingmore robust to pose and lighting variations. In this paper, wepropose a new experimental protocol based on the UHDB11dataset for benchmarking 3D-2D FR algorithms. This newexperimental protocol allows for the study of the performanceof a 3D-2D FR solution under pose and/or lighting variations.Furthermore, we also benchmarked two state of the art 3D-2D FR algorithms. One is based on the Annotated DeformableModel (using manually labeled landmarks in this paper) usingmanually labeled landmarks whereas the other makes useof Oriented Gradient Maps along with an automatic poseestimation through random forest.

Published
2013
Full Text
View/download PDF

15. Robustness of the rotor-router mechanism

Author

Evangelos Bampas, Adrian Kosowski, Leszek Gąsieniec, Tomasz Radzik, Ralf Klasing, School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Algorithmics for computationally intensive applications over wide scale distributed platforms (CEPAGE), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), Department of Computer Science [Liverpool], University of Liverpool, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Department of Algorithms and Systems Modelling [ETI GUT] (Gdansk University of Technology), Faculty of Electronics, Telecommunications and Informatics [GUT Gdańsk] (ETI), Gdańsk University of Technology (GUT)-Gdańsk University of Technology (GUT), Department of Computer Science (DCS), King‘s College London, ANR-07-BLAN-0322,ALADDIN,Algorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks(2007), Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest, and Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS)

Subjects
De Bruijn sequence, Spanning tree, Computer science, 010102 general mathematics, Eulerian path, Cyclic order, 0102 computer and information sciences, 01 natural sciences, Combinatorics, symbols.namesake, Route inspection problem, 010201 computation theory & mathematics, Robustness (computer science), Pointer (computer programming), symbols, Cycle basis, 0101 mathematics, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC], Algorithm, ComputingMilieux_MISCELLANEOUS
Abstract

We consider the model of exploration of an undirected graph G by a single agent which is called the rotor-router mechanism or the Propp machine (among other names). Let *** v indicate the edge adjacent to a node v which the agent took on its last exit from v . The next time when the agent enters node v , first a "rotor" at node v advances pointer *** v to the edge ${\it next}(\pi_v)$ which is next after the edge *** v in a fixed cyclic order of the edges adjacent to v . Then the agent is directed onto edge *** v to move to the next node. It was shown before that after initial O (mD ) steps, the agent periodically follows one established Eulerian cycle, that is, in each period of 2m consecutive steps the agent traverses each edge exactly twice, once in each direction. The parameters m and D are the number of edges in G and the diameter of G . We investigate robustness of such exploration in presence of faults in the pointers *** v or dynamic changes in the graph. We show that after the exploration establishes an Eulerian cycle, if at some step the values of k pointers *** v are arbitrarily changed, then a new Eulerian cycle is established within O (km ) steps; if at some step k edges are added to the graph, then a new Eulerian cycle is established within O (km ) steps; if at some step an edge is deleted from the graph, then a new Eulerian cycle is established within O (***m ) steps, where *** is the smallest number of edges in a cycle in graph G containing the deleted edge. Our proofs are based on the relation between Eulerian cycles and spanning trees known as the "BEST" Theorem (after de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte).

Published
2009

16. Interoperability Approaches for Enterprises and Administrations Worldwide

Author

Charalabidis, Yannis, Panetto, Hervé, Loukis, Euriopidis, Mertins, Kai, School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Centre de Recherche en Automatique de Nancy (CRAN), Université Henri Poincaré - Nancy 1 (UHP)-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), University of the Aegean, Fraunhofer Institute for Production Systems and Design Technology (Fraunhofer IPK), Fraunhofer (Fraunhofer-Gesellschaft), and Panetto, Hervé

Subjects
eGovernment, Architectures, [INFO.INFO-IA]Computer Science [cs]/Computer Aided Engineering, Interoperability, [INFO.INFO-IA] Computer Science [cs]/Computer Aided Engineering, Enterprise Systems, eBusiness
Abstract

ISSN: 1055-8896; International audience; During the last few years, research and practice worldwide have shown that enhancing interoperability among organizations, systems or software applications is a multi-disciplinary issue of critical importance, touching upon processes, data and technical standardization. Fortunately, researchers and practitioners have started to realize the impact of interoperability in achieving true one-stop service provision for citizens and businesses, in fostering collaboration between enterprises or in minimizing the needed investment for maintaining complex systems. Current research results show that there exist common practices to be shared among public sector organisations and private sector enterprises, in attempts related with aligning organisation and processes, tackling semantic and technical shortcomings, building relevant architectures and finally achieving the legal interconnection and co-operation of systems. The identification of such common areas between eBusiness and eGovernment can then lead to a joint exploration, enhance reuse of the real paradigms and real exploitation of results by enterprises and administrations. Also future interoperability research directions, as emerging from relevant strategies and research roadmaps of important stakeholders, and also from relevant research workshops, are outlined. Furthermore, it is argued that interoperability research should be extended towards "knowledge interoperability" as well, and deal with the development of methods and architectures enabling the exchange of knowledge among co-operating organizations.

Published
2008

17. Memoryless search algorithms in a network with faulty advice

Author

Danny Krizanc, Dimitris J. Kavvadias, Nicolas Hanusse, Evangelos Kranakis, Laboratoire Bordelais de Recherche en Informatique (LaBRI), Université de Bordeaux (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), Algorithmics for computationally intensive applications over wide scale distributed platforms (CEPAGE), Université Sciences et Technologies - Bordeaux 1-Inria Bordeaux - Sud-Ouest, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Department of Mathematics and Computer Science, Wesleyan University, ANR-05-MMSA-0006,ALPAGE,ALgorithmique des Plates-formes A Grande Echelle(2005), Université de Bordeaux (UB)-École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB)-Centre National de la Recherche Scientifique (CNRS), and Université Sciences et Technologies - Bordeaux 1 (UB)-Inria Bordeaux - Sud-Ouest

Subjects
General Computer Science, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Theoretical Computer Science, Combinatorics, Search algorithm, 0202 electrical engineering, electronic engineering, information engineering, Mobile agent computing, Faulty networks, ComputingMilieux_MISCELLANEOUS, Mathematics, Graph searching, Random graph, Node (networking), Randomized algorithms, Complete graph, Distributed computing, Randomized algorithm, 010201 computation theory & mathematics, Bounded function, Shortest path problem, 020201 artificial intelligence & image processing, Random walks, Advice (complexity), Computer Science(all)
Abstract

In this paper, we present a randomized algorithm for a mobile agent to search for an item stored at a node t of a network, without prior knowledge of its exact location. Each node of the network has a database that will answer queries of the form “how do I find t?” by responding with the first edge on a shortest path to t. It may happen that some nodes, called liars, give bad advice. We investigate a simple memoryless algorithm which follows the advice with some fixed probability q>1/2 and otherwise chooses a random edge. If the degree of each node and number of liars k are bounded, we show that the expected number of edges traversed by the agent before finding t is bounded from above by O(d+rk), where d is the distance between the initial and target nodes and r=q1−q. We also show that this expected number of steps can be significantly improved for particular topologies such as the complete graph and the torus.

Published
2008

18. Computational analysis and learning for a biologically motivated model of boundary detection

Author

Olivier Faugeras, Rachid Deriche, Petros Maragos, Iasonas Kokkinos, Monteil, Alain, School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), Computer and biological vision (ODYSSEE), Département d'informatique - ENS Paris (DI-ENS), Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche en Informatique et en Automatique (Inria)-École normale supérieure - Paris (ENS Paris), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Inria Sophia Antipolis - Méditerranée (CRISAM), Institut National de Recherche en Informatique et en Automatique (Inria)-Inria Paris-Rocquencourt, Institut National de Recherche en Informatique et en Automatique (Inria)-École des Ponts ParisTech (ENPC), École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS-PSL), Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Inria Sophia Antipolis - Méditerranée (CRISAM), Département d'informatique de l'École normale supérieure (DI-ENS), École normale supérieure - Paris (ENS Paris), and Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Paris (ENS Paris)

Subjects
Computer science, Surround suppression, Anisotropic diffusion, Cognitive Neuroscience, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH], [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], 02 engineering and technology, Machine learning, computer.software_genre, 050105 experimental psychology, Edge detection, Artificial Intelligence, Simple (abstract algebra), 0202 electrical engineering, electronic engineering, information engineering, 0501 psychology and cognitive sciences, Interpretation (logic), Artificial neural network, business.industry, 05 social sciences, Computer Science Applications, Connection (mathematics), [INFO.INFO-OH] Computer Science [cs]/Other [cs.OH], Benchmark (computing), 020201 artificial intelligence & image processing, Artificial intelligence, business, computer
Abstract

International audience; In this work we address the problem of boundary detection by combining ideas and approaches from biological and computational vision. Initially, we propose a simple and efficient architecture that is inspired from models of biological vision. Subsequently, we interpret and learn the system using computer vision techniques: First, we present analogies between the system components and computer vision techniques and interpret the network as minimizing a cost functional, thereby establishing a link with variational techniques. Second, based on Mean Field Theory the equations describing the network behavior are interpreted statistically. Third, we build on this interpretation to develop an algorithm to learn the network weights from manually segmented natural images. Using a systematic evaluation on the Berkeley benchmark we show that when using the learned connection weights our network outperforms classical edge detection algorithms

Published
2008

19. Towards Speaker and Environmental Robustness in ASR: The HIWIRE Project

Author

Potamianos, Alexandros, Bouselmi, Ghazi, Dimitriadis, Dimitrios, Fohr, Dominique, Gemello, Roberto, Illina, Irina, Mana, Franco, Maragos, Petros, Matassoni, M., Pitsikalis, Vassilis, Ramirez, J., Sanchez-Soto, E., Segura, J., Svaizer, P., Department of Electronic and Computer Engineering [Crete] (E.C.E), Technical University of Crete [Chania], Analysis, perception and recognition of speech (PAROLE), INRIA Lorraine, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire Lorrain de Recherche en Informatique et ses Applications (LORIA), Institut National de Recherche en Informatique et en Automatique (Inria)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS)-Université Henri Poincaré - Nancy 1 (UHP)-Université Nancy 2-Institut National Polytechnique de Lorraine (INPL)-Centre National de la Recherche Scientifique (CNRS), School of of Electrical and Computer Engineering [Athens] (School of E.C.E), National Technical University of Athens [Athens] (NTUA), LOQUENDO (LOQUENDO), LOQUENDO, Istituto Trentino di Cultura (ITC), Istituto Trentino di Cultura, Universidad de Granada = University of Granada (UGR), HIWIRE, and University of Granada [Granada]

Subjects
noisy sppech, speech recognition, robustness, [INFO.INFO-HC]Computer Science [cs]/Human-Computer Interaction [cs.HC]
Abstract

In this paper, we present algorithms for dealing with variability and mismatch in speech recognition due to environmental conditions and non-native speaker populations. The proposed algorithms cover a broad spectrum of ideas including robust feature extraction, feature compensation and speech enhancement. Specifically the following algorithms are presented and evaluated: beamforming for multi-microphone speech recognition, robust modulation and fractal features, Teager energy cepstrum coefficients, parametric feature equalization, speech enhancement, and acoustic modeling for non-native speech recognition. Also the problem of feature fusion and voice activity detection are discussed. Evaluation results on the AURORA databases under the auspices of the HIWIRE project show that significant gains can be achieved under adverse or mismatched conditions using these algorithms. Relative error rate reduction of up to 50% was shown for multi-microphone speech recognition, robust feature combination and speech enhancement. 30-40% reduction was shown for parametric feature equalization and non-native acoustic models.

Published
2006

Catalog

Books, media, physical & digital resources
See catalog results