Search

Your search keyword '"Insight Centre for Data Analytics [Dublin]"' showing total 14 results
Start Over Author "Insight Centre for Data Analytics [Dublin]" Database OpenAIRE
14 results on '"Insight Centre for Data Analytics [Dublin]"'

1. Developing on-site trace Level speciation of lead, cadmium and zinc by stripping chronopotentiometry (SCP): Fast screening and Quantification of total metal concentrations

Author

Aoife Morrin, Elise Rotureau, José Paulo Pinheiro, Laetitia Hackel, Laboratoire Interdisciplinaire des Environnements Continentaux (LIEC), Institut Ecologie et Environnement (INEE), Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Observatoire Terre et Environnement de Lorraine (OTELo), Institut national des sciences de l'Univers (INSU - CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS)-Institut national des sciences de l'Univers (INSU - CNRS)-Université de Lorraine (UL)-Centre National de la Recherche Scientifique (CNRS), Insight Centre for Data Analytics [Dublin], and Dublin City University [Dublin] (DCU)

Subjects
Stripping (chemistry), cadmium, Analytical chemistry, Pharmaceutical Science, chemistry.chemical_element, Zinc, 010402 general chemistry, Electrochemistry, 01 natural sciences, Article, Analytical Chemistry, QD241-441, stripping chronopotentiometry (SCP), [CHIM.ANAL]Chemical Sciences/Analytical chemistry, Drug Discovery, thin mercury film electrodes (TMFE), Physical and Theoretical Chemistry, [SDU.ENVI]Sciences of the Universe [physics]/Continental interfaces, environment, Inductively coupled plasma mass spectrometry, standard addition method, screen printed electrodes, Detection limit, Cadmium, lead, 010401 analytical chemistry, Organic Chemistry, zinc, 0104 chemical sciences, Mercury (element), chemistry, Chemistry (miscellaneous), Standard addition, Molecular Medicine
Abstract

International audience; Electrochemical stripping techniques are interesting candidates for carrying out onsite speciation of environmentally relevant trace metals due to the existing low-cost portable instrumentation available and the low detection limits that can be achieved. In this work, we describe the initial analytical technique method development by quantifying the total metal concentrations using Stripping Chronopotentiometry (SCP). Carbon paste screen-printed electrodes were modified with thin films of mercury and used to quantify sub-nanomolar concentrations of lead and cadmium and sub-micromolar concentrations of zinc in river water. Low detection limits of 0.06 nM for Pb(II) and 0.04 nM for Cd(II) were obtained by the standard addition method using a SCP deposition time of 180 s. The SCP results obtained for Pb(II) and Cd(II) agreed with those of inductively coupled plasma mass spectrometry (ICP-MS). The coupling of SCP with screen-printed electrodes opens up excellent potential for the development of onsite speciation of trace metals. Due to the low analysis throughput obtained for the standard addition method, we also propose a new, more rapid screening Cd(II) internal standard methodology to significantly increase the number of samples that can be analyzed per day.

Published
2021

2. TRECVID 2018: Benchmarking video activity detection, video captioning and matching, video storytelling linking and video search

Author

Awad, G., Butt, A. A., Keith Curtis, Lee, Y., Fiscus, J., Godil, A., Joy, D., Delgado, A., Smeaton, A. F., Graham, Y., Kraaij, W., Quénot, G., Magalhaes, J., Semedo, D., Blasi, S., National Institute of Standards and Technology [Gaithersburg] (NIST), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), TNO [Delf], Radboud university [Nijmegen], Modélisation et Recherche d’Information Multimédia [Grenoble] (MRIM ), Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), NOVA Laboratory for Computer Science and Informatics (NOVA-LINCS), Departamento de Informática (DI), Faculdade de Ciências e Tecnologia = School of Science & Technology (FCT NOVA), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA)-Universidade Nova de Lisboa = NOVA University Lisbon (NOVA)-Faculdade de Ciências e Tecnologia = School of Science & Technology (FCT NOVA), Universidade Nova de Lisboa = NOVA University Lisbon (NOVA)-Universidade Nova de Lisboa = NOVA University Lisbon (NOVA), BBC Research & Development, and BBC

Subjects
[INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV], ComputingMilieux_MISCELLANEOUS
Abstract

[No abstract available]

Published
2020

3. Extracting usage patterns of home IoT devices

Author

Ioannis Pefkianakis, G. Poghosyan, Pascal Le Guyadec, Vassilis Christophides, Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), Hewlett Packard Labs [Palo Alto], Hewlett Packard Enterprise (Hewlett Packard) (HPE), Technicolor [Cesson Sévigné], Technicolor, Middleware on the Move (MIMOVE), Inria de Paris, and Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)

Subjects
IoT, Intranet, Service (systems architecture), Computer science, business.industry, 020206 networking & telecommunications, 02 engineering and technology, Troubleshooting, home networks, association rules, World Wide Web, [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], Network management, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Home automation, Analytics, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Internet of Things, business, Efficient energy use
Abstract

International audience; Ubiquitous connectivity and smart technologies gradually transform homes into Intranet of Things, where a multitude of connected, intelligent devices allow for novel home automation services. Providing new services for home users (e.g., energy saving automations) and Internet Service Providers (e.g., network management and troubleshooting) requires an in-depth analysis of various kinds of data (connectivity, performance, usage) collected from home networks. In this paper, we explore new Machine-to-Machine data analysis techniques that go beyond binary association rule mining for traditional market basket analysis considered by previous studies, to analyze individual device logs of home gateways. We introduce a multidimensional patterns mining framework, to extract complex device co-usage patterns of 201 residential broadband users of an ISP, subscribed to a triple-play service. Our results show that our analytics engine provides valuable insights for emerging use cases such as monitoring for energy efficiency, and “things” recommendation.

Published
2017

4. TRECVid Semantic Indexing of Video: A 6-Year Retrospective

Author

Awad, George, Snoek, Cees, Smeaton, Alan, Quénot, Georges, Dakota Consulting Inc. [Silver Spring], Informatics Institute [Amsterdam], University of Amsterdam [Amsterdam] (UvA), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), and AII / OSEO Quaero

Subjects
benchmark, semantic indexing, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM], concept detection, [INFO]Computer Science [cs], TRECVid, video
Abstract

Invited Paper; International audience; Semantic indexing, or assigning semantic tags to video samples, is a key component for content-based access to video documents and collections. The Semantic Indexing task has been run at TRECVid from 2010 to 2015 with the support of NIST and the Quaero project. As with the previous High-Level Feature detection task which ran from 2002 to 2009, the semantic indexing task aims at evaluating methods and systems for detecting visual, auditory or multi-modal concepts in video shots. In addition to the main semantic indexing task, four secondary tasks were proposed namely the " localization " task, the " concept pair " task, the " no annotation " task, and the " progress " task. It attracted over 40 research teams during its running period. The task was conducted using a total of 1 400 hours of video data drawn from Internet Archive videos with Creative Commons licenses gathered by NIST. 200 hours of new test data was made available each year plus 200 more as development data in 2010. The number of target concepts to be detected started from 130 in 2010 and was extended to 346 in 2011. Both the increase in the volume of video data and in the number of target concepts favored the development of generic and scalable methods. Over 8 million shots×concepts direct annotations plus over 20 million indirect ones were produced by the participants and the Quaero project on a total of 800 hours of development data. Significant progress was accomplished during the period as this was accurately measured in the context of the progress task but also from some of the participants' contrast experiments. This paper describes the data, protocol and metrics used for the main and the secondary tasks, the results obtained and the main approaches used by participants.

Published
2016

5. Mining usage patterns in residential intranet of things

Author

Ioannis Pefkianakis, G. Poghosyan, Vassilis Christophides, Pascal Le Guyadec, Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), Hewlett Packard Labs [Palo Alto], Hewlett Packard Enterprise (Hewlett Packard) (HPE), Technicolor [Cesson Sévigné], Technicolor, Laboratory of Information, Network and Communication Sciences (LINCS), Université Pierre et Marie Curie - Paris 6 (UPMC)-Institut National de Recherche en Informatique et en Automatique (Inria)-Institut Mines-Télécom [Paris] (IMT), Measuring networks for enhancing USer Experience (MUSE), Inria de Paris, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), European Project: 611001,EC:FP7:ICT,FP7-ICT-2013-10,UCN(2013), and Institut Mines-Télécom [Paris] (IMT)-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Pierre et Marie Curie - Paris 6 (UPMC)

Subjects
Intranet, Service (systems architecture), multi-dimensional association rules, business.industry, Computer science, 020206 networking & telecommunications, intranet of things, 02 engineering and technology, Service provider, World Wide Web, [INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing, [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], Home automation, home device analytics, 0202 electrical engineering, electronic engineering, information engineering, General Earth and Planetary Sciences, 020201 artificial intelligence & image processing, The Internet, Quality of experience, business, General Environmental Science
Abstract

International audience; Ubiquitous smart technologies gradually transform modern homes into Intranet of Things, where a multitude of connected devices allow for novel home automation services (e.g., energy or bandwidth savings, comfort enhancement, etc.). Optimizing and enriching the Quality of Experience (QoE) of residential users emerges as a critical differentiator for Internet and Communication Service providers (ISPs and CSPs, respectively) and heavily relies on the analysis of various kinds of data (connectivity, performance , usage) gathered from home networks. In this paper, we are interested in new Machine-to-Machine data analysis techniques that go beyond binary association rule mining for traditional market basket analysis considered by previous works, to analyze individual device logs of home gateways. Based on multidimensional patterns mining framework, we extract complex device co-usage patterns of 201 residential broadband users of an ISP, subscribed to a triple-play service. Such fine-grained device usage patterns provide valuable insights for emerging use cases such as an adaptive usage of home devices, and also " things " recommendation.

Published
2016

6. Bounds and approximation results for scheduling coupled-tasks with compatibility constraints

Author

Giroudeau, Rodolphe, K��nig, Jean-Claude, Darties, Benoit, Simonin, Gilles, Méthodes Algorithmes pour l'Ordonnancement et les Réseaux ( MAORE ), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier ( LIRMM ), Université de Montpellier ( UM ) -Centre National de la Recherche Scientifique ( CNRS ) -Université de Montpellier ( UM ) -Centre National de la Recherche Scientifique ( CNRS ), Laboratoire Electronique, Informatique et Image ( Le2i ), Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique ( CNRS ), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] ( DCU ), Méthodes Algorithmes pour l'Ordonnancement et les Réseaux (MAORE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Laboratoire Electronique, Informatique et Image [UMR6306] (Le2i), Université de Bourgogne (UB)-École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique (CNRS), Dublin City University [Dublin] (DCU), Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Arts et Métiers (ENSAM), and HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement

Subjects
FOS: Computer and information sciences, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Computational Complexity (cs.CC), complexity, approximation, coupled-task, compatibility graph, [ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
Abstract

International audience; This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$, $\mathcal{ETH}$). Moreover, we develop an efficient polynomial-time approximation algorithm for the specific case for which the topology describing the compatibility constraints is a quasi split-graph.

Published
2016

7. TRECVID 2016: Evaluating Video Search, Video Event Detection, Localization, and Hyperlinking

Author

Awad, G., Fiscus, J., Joy, D., Michel, M., Smeaton, A. F., Kraaij, W., Quénot, G., Eskevich, M., Aly, R., Ordelman, R., Ritter, M., Gareth Jones, Huet, B., Larson, M., Dakota Consulting Inc. [Silver Spring], National Institute of Standards and Technology [Gaithersburg] (NIST), Information Access Division [Gaithersburg], Information Technology Laboratory [Gaithersburg], National Institute of Standards and Technology [Gaithersburg] (NIST)-National Institute of Standards and Technology [Gaithersburg] (NIST), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), TNO [Delf], Radboud university [Nijmegen], University of Twente [Netherlands], Chemnitz University of Technology / Technische Universität Chemnitz, Modélisation et Recherche d’Information Multimédia [Grenoble] (MRIM ), Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Eurecom [Sophia Antipolis], Delft Multimedia Information Retrieval Lab (DMIR), and Delft University of Technology (TU Delft)

Subjects
[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], Data Science, Digital Security, GeneralLiterature_REFERENCE(e.g.,dictionaries,encyclopedias,glossaries), ComputingMilieux_MISCELLANEOUS, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

Contains fulltext : 163213.pdf (Publisher’s version ) (Open Access) TRECVID 2016

Published
2016

8. Data Mining and Constraint Programming: Foundations of a Cross-Disciplinary Approach

Author

Bessière, Christian, De Raedt, Luc, Kotthoff, Lars, Nijssen, Siegfried, O'Sullivan, Barry, Pedreschi, Dino, Agents, Apprentissage, Contraintes (COCONUT), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Department of Computer Science [Leuven] (CS), Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven), University of British Columbia (UBC), Declarative Languages and Artificial Intelligence (DTAI), Université Catholique de Louvain = Catholic University of Louvain (UCL), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), Istituto di Biofisica [Pisa] (IBF), Consiglio Nazionale delle Ricerche [Roma] (CNR), Christian Bessiere, Luc De Raedt, Lars Kotthoff, Siegfried Nijssen, Barry O'Sullivan, and Dino Pedreschi

Subjects
Constraint optimization, Combinatorial optimization, Machine learning, State-of-the-art solvers, Constraint solving, Data mining, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

OUV; International audience

Published
2016

9. The inductive constraint programming loop

Author

Barry O'Sullivan, Helmut Simonis, Mirco Nanni, Siegfried Nijssen, Lars Kotthoff, Anastasia Paparrizou, Luc De Raedt, Tias Guns, Dino Pedreschi, Christian Bessiere, Business technology and Operations, Electromobility research centre, Agents, Apprentissage, Contraintes (COCONUT), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Catholic University of Leuven - Katholieke Universiteit Leuven (KU Leuven), University of Wyoming (UW), Istituto di Scienza e Tecnologie dell'Informazione 'A. Faedo' (ISTI), Consiglio Nazionale delle Ricerche [Roma] (CNR), Declarative Languages and Artificial Intelligence (DTAI), Université Catholique de Louvain = Catholic University of Louvain (UCL), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), Istituto di Biofisica [Pisa] (IBF), Cork Constraint Computation Centre (4C UCC), University College Cork (UCC), Bessiere, Christian, De Raedt, Luc, Kotthoff, Lars, Nijssen, Siegfried, O'Sullivan, Barry, Pedreschi, Dino, Department of Computer Science [Leuven] (CS), University of British Columbia (UBC), Christian Bessiere, Luc De Raedt, Lars Kotthoff, Siegfried Nijssen, Barry O'Sullivan, Dino Pedreschi, European Project: 284715,EC:FP7:ICT,FP7-ICT-2011-C,ICON(2012), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), CNR Istituto di Scienza e Tecnologie dell’Informazione 'A. Faedo' [Pisa] (CNR | ISTI), and National Research Council of Italy | Consiglio Nazionale delle Ricerche (CNR)

Subjects
FOS: Computer and information sciences, Concurrent constraint logic programming, Mathematical optimization, constraint programming, Optimization problem, Theoretical computer science, Exploit, Computer science, Computer Science - Artificial Intelligence, Computer Networks and Communications, 0211 other engineering and technologies, Scheduling (production processes), 02 engineering and technology, Theoretical Computer Science, Computer Science (all), artificial intelligence, data mining, intelligent systems, machine learning, Artificial Intelligence, Machine Learning (cs.LG), [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], Software, 020204 information systems, 0202 electrical engineering, electronic engineering, information engineering, Constraint programming, Reactive programming, 021103 operations research, LOOP (programming language), business.industry, Constraint satisfaction, Inductive programming, Variety (cybernetics), Computer Science - Learning, Artificial Intelligence (cs.AI), Procedural programming, Programming paradigm, Resource allocation, 020201 artificial intelligence & image processing, business, Functional reactive programming
Abstract

Constraint programming is used for a variety of real-world optimisation problems, such as planning, scheduling and resource allocation problems. At the same time, one continuously gathers vast amounts of data about these problems. Current constraint programming software does not exploit such data to update schedules, resources and plans. We propose a new framework, that we call the Inductive Constraint Programming loop. In this approach data is gathered and analyzed systematically, in order to dynamically revise and adapt constraints and optimization criteria. Inductive Constraint Programming aims at bridging the gap between the areas of data mining and machine learning on the one hand, and constraint programming on the other hand., 17 pages, 9 figures

Published
2016

10. Some complexity and approximation results for coupled-tasks scheduling problem according to topology

Author

Gilles Simonin, Rodolphe Giroudeau, Benoit Darties, Jean-Claude König, Laboratoire Electronique, Informatique et Image [UMR6306] (Le2i), Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement, Méthodes Algorithmes pour l'Ordonnancement et les Réseaux (MAORE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), Laboratoire Electronique, Informatique et Image ( Le2i ), Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique ( CNRS ), Méthodes Algorithmes pour l'Ordonnancement et les Réseaux ( MAORE ), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier ( LIRMM ), Université de Montpellier ( UM ) -Centre National de la Recherche Scientifique ( CNRS ) -Université de Montpellier ( UM ) -Centre National de la Recherche Scientifique ( CNRS ), and Dublin City University [Dublin] ( DCU )

Subjects
FOS: Computer and information sciences, Coupled-task scheduling model, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], Computer science, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Management Science and Operations Research, Computational Complexity (cs.CC), Topology, 01 natural sciences, Execution time, Theoretical Computer Science, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 021103 operations research, Job shop scheduling, Polynomial-time approximation algorithm, Approximation algorithm, Compatibility graph, Complexity, Idle time, Computer Science Applications, Computer Science - Computational Complexity, [ INFO.INFO-CC ] Computer Science [cs]/Computational Complexity [cs.CC], 010201 computation theory & mathematics, Compatibility (mechanics), Bipartite graph, Minification
Abstract

International audience; We consider the makespan minimization coupled-tasks problem in presence of compatibility constraints with a specified topology. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain,. . .). In such a context, we design some efficient polynomial-time approximation algorithms for an intractable scheduling problem according to some parameters.

Published
2016

11. TRECVID 2014 -- An Overview of the Goals, Tasks, Data, Evaluation Mechanisms and Metrics

Author

Over, Paul, Fiscus, Jon, Sanders, Greg, Joy, David, Michel, Martial, Awad, George, Smeaton, Alan, Kraaij, Wessel, Quénot, Georges, Information Access Division [Gaithersburg], Information Technology Laboratory [Gaithersburg], National Institute of Standards and Technology [Gaithersburg] (NIST)-National Institute of Standards and Technology [Gaithersburg] (NIST), Dakota Consulting Inc. [Silver Spring], Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), TNO [Delf], Radboud university [Nijmegen], Laboratoire d'Informatique de Grenoble (LIG), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF), Modélisation et Recherche d’Information Multimédia [Grenoble] (MRIM), and Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Pierre Mendès France - Grenoble 2 (UPMF)-Université Joseph Fourier - Grenoble 1 (UJF)

Subjects
InformationSystems_INFORMATIONSTORAGEANDRETRIEVAL, [INFO]Computer Science [cs]
Abstract

International audience; The TREC Video Retrieval Evaluation (TRECVID) 2014 was a TREC-style video analysis and retrieval evaluation, the goal of which remains to promote progress in content-based exploitation of digital video via open, metrics-based evaluation. Over the last dozen years this effort has yielded a better under- standing of how systems can effectively accomplish such processing and how one can reliably benchmark their performance. TRECVID is funded by the NIST with support from other US government agencies. Many organizations and individuals worldwide contribute significant time and effort.

Published
2014

12. Coupled-Tasks in Presence of Bipartite Compatibilities Graphs : Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers

Author

Gilles Simonin, Jean-Claude König, Rodolphe Giroudeau, Benoit Darties, Laboratoire Electronique, Informatique et Image [UMR6306] (Le2i), Université de Bourgogne (UB)-École Nationale Supérieure d'Arts et Métiers (ENSAM), Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-Arts et Métiers Sciences et Technologies, HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique (CNRS), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), Méthodes Algorithmes pour l'Ordonnancement et les Réseaux (MAORE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM), Laboratoire Electronique, Informatique et Image ( Le2i ), Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique ( CNRS ), Dublin City University [Dublin] ( DCU ), Méthodes Algorithmes pour l'Ordonnancement et les Réseaux ( MAORE ), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier ( LIRMM ), Université de Montpellier ( UM ) -Centre National de la Recherche Scientifique ( CNRS ) -Université de Montpellier ( UM ) -Centre National de la Recherche Scientifique ( CNRS ), Université de Bourgogne (UB)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Arts et Métiers (ENSAM), and HESAM Université (HESAM)-HESAM Université (HESAM)-AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement

Subjects
021103 operations research, Theoretical computer science, Job shop scheduling, 0211 other engineering and technologies, Approximation algorithm, Context (language use), 0102 computer and information sciences, 02 engineering and technology, [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO], Star (graph theory), 01 natural sciences, Combinatorics, 010201 computation theory & mathematics, Constraint graph, Knapsack problem, Bipartite graph, Minification, Mathematics, [ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
Abstract

International audience; We tackle the makespan minimization coupled-tasks prob- lem in presence of incompatibility constraints. In particular, we focus on stretched coupled-tasks, i.e.coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in the framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, ...). In such context, we design efficient polynomial-time approximation algorithms according to different parameters of the scheduling problem.

Published
2014

13. Coupled-Tasks in Presence of Bipartite Compatibilities Graphs

Author

Darties , Benoit, Simonin , Gilles, Giroudeau , Rodolphe, König , Jean-Claude, Laboratoire Electronique, Informatique et Image ( Le2i ), Université de Bourgogne ( UB ) -AgroSup Dijon - Institut National Supérieur des Sciences Agronomiques, de l'Alimentation et de l'Environnement-Centre National de la Recherche Scientifique ( CNRS ), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] ( DCU ), Méthodes Algorithmes pour l'Ordonnancement et les Réseaux ( MAORE ), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier ( LIRMM ), and Université de Montpellier ( UM ) -Centre National de la Recherche Scientifique ( CNRS ) -Université de Montpellier ( UM ) -Centre National de la Recherche Scientifique ( CNRS )

Subjects
[ INFO.INFO-RO ] Computer Science [cs]/Operations Research [cs.RO]
Abstract

International audience; We tackle the makespan minimization coupled-tasks prob- lem in presence of incompatibility constraints. In particular, we focus on stretched coupled-tasks, i.e.coupled-tasks having the same sub-tasks execution time and idle time duration. We study several problems in the framework of classic complexity and approximation for which the compatibility graph is bipartite (star, chain, ...). In such context, we design efficient polynomial-time approximation algorithms according to different parameters of the scheduling problem.

Published
2014

14. TRECVID 2017: Evaluating ad-hoc and instance video search, events detection, video captioning, and hyperlinking

Author

Awad, G., Butt, A. A., Fiscus, J., Joy, D., Delgado, A., Mcclinton, W., Michel, M., Smeaton, A. F., Graham, Y., Kraaij, W., Quénot, G., Eskevich, M., Ordelman, R., Gareth Jones, Huet, B., Dakota Consulting Inc. [Silver Spring], National Institute of Standards and Technology [Gaithersburg] (NIST), Insight Centre for Data Analytics [Dublin], Dublin City University [Dublin] (DCU), TNO [Delf], Radboud university [Nijmegen], Modélisation et Recherche d’Information Multimédia [Grenoble] (MRIM ), Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), University of Twente [Netherlands], Analyse et synthèse sonores [Paris], Sciences et Technologies de la Musique et du Son (STMS), Institut de Recherche et Coordination Acoustique/Musique (IRCAM)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS)-Institut de Recherche et Coordination Acoustique/Musique (IRCAM)-Université Pierre et Marie Curie - Paris 6 (UPMC)-Centre National de la Recherche Scientifique (CNRS), Eurecom [Sophia Antipolis], Radboud University [Nijmegen], and University of Twente

Subjects
[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], ComputingMilieux_MISCELLANEOUS, [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]
Abstract

International audience

Catalog

Books, media, physical & digital resources
See catalog results