Pub Date : 2015-07-22DOI: 10.1109/CogInfoCom.2013.6719292
Rimah Amami, D. B. Ayed, N. Ellouze
The use of digital technology is growing at a very fast pace which led to the emergence of systems based on the cognitive infocommunications. The expansion of this sector impose the use of combining methods in order to ensure the robustness in cognitive systems.
{"title":"The challenges of SVM optimization using Adaboost on a phoneme recognition problem","authors":"Rimah Amami, D. B. Ayed, N. Ellouze","doi":"10.1109/CogInfoCom.2013.6719292","DOIUrl":"https://doi.org/10.1109/CogInfoCom.2013.6719292","url":null,"abstract":"The use of digital technology is growing at a very fast pace which led to the emergence of systems based on the cognitive infocommunications. The expansion of this sector impose the use of combining methods in order to ensure the robustness in cognitive systems.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133882839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-12-02DOI: 10.1109/COGINFOCOM.2013.6719226
C. Pontonnier, Thierry Duval, G. Dumont
The current paper aims at presenting a collaborative virtual environment usable to conduct ergonomic design sessions, involving the worker, ergonomists and engineers. The paper focuses particularly on the representation of the ergonomic evaluation and the interaction between an ergonomist and the main user (worker). An ergonomic evaluation of the postures is presented. An interaction architecture between the main user and an ergonomist based on the combination of animation modes of two linked manikins is also proposed. Preliminary results and future developments of the CVE (e.g. additional ergonomic evaluation tools, graphical enhancement, interaction enhancement,...) are then presented.
{"title":"Sharing and bridging information in a collaborative virtual environment: Application to ergonomics","authors":"C. Pontonnier, Thierry Duval, G. Dumont","doi":"10.1109/COGINFOCOM.2013.6719226","DOIUrl":"https://doi.org/10.1109/COGINFOCOM.2013.6719226","url":null,"abstract":"The current paper aims at presenting a collaborative virtual environment usable to conduct ergonomic design sessions, involving the worker, ergonomists and engineers. The paper focuses particularly on the representation of the ergonomic evaluation and the interaction between an ergonomist and the main user (worker). An ergonomic evaluation of the postures is presented. An interaction architecture between the main user and an ergonomist based on the combination of animation modes of two linked manikins is also proposed. Preliminary results and future developments of the CVE (e.g. additional ergonomic evaluation tools, graphical enhancement, interaction enhancement,...) are then presented.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131048389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-12-01DOI: 10.1109/COGINFOCOM.2013.6719313
Franck Berthelon, Peter Sander
We present an emotion ontology for describing and reasoning on emotion context in order to improve emotion detection based on bodily expression. We incorporate context into the two-factor theory of emotion (bodily reaction plus cognitive input) and demonstrate the importance of context in the emotion experience. In attempting to determine emotion felt by another person, the bodily expresson of their emotion is the only evidence directly available, eg, “John looks angry”. Our motivation in this paper is to bring context into the emotion-modulating cognitive input, eg, we know that John is a generally calm person, so we can conclude from expression (anger) plus context (calm) that John is not only angry, but that “John must be furious”. We use a well known interoperable reasoning tool, an ontology, to bring context into the implementation of the emotion detection process. Our emotion ontology (EmOCA) allow us to describe and to reason about philia and phobia in order to modulate emotion determined from expression. We present an experiment suggesting that people use such a strategy to incorporate contextual information when determining what emotion another person may be feeling.
{"title":"Emotion ontology for context awareness","authors":"Franck Berthelon, Peter Sander","doi":"10.1109/COGINFOCOM.2013.6719313","DOIUrl":"https://doi.org/10.1109/COGINFOCOM.2013.6719313","url":null,"abstract":"We present an emotion ontology for describing and reasoning on emotion context in order to improve emotion detection based on bodily expression. We incorporate context into the two-factor theory of emotion (bodily reaction plus cognitive input) and demonstrate the importance of context in the emotion experience. In attempting to determine emotion felt by another person, the bodily expresson of their emotion is the only evidence directly available, eg, “John looks angry”. Our motivation in this paper is to bring context into the emotion-modulating cognitive input, eg, we know that John is a generally calm person, so we can conclude from expression (anger) plus context (calm) that John is not only angry, but that “John must be furious”. We use a well known interoperable reasoning tool, an ontology, to bring context into the implementation of the emotion detection process. Our emotion ontology (EmOCA) allow us to describe and to reason about philia and phobia in order to modulate emotion determined from expression. We present an experiment suggesting that people use such a strategy to incorporate contextual information when determining what emotion another person may be feeling.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121069301","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-12-01DOI: 10.1109/COGINFOCOM.2013.6719224
Nermin Makhlouf, L. Nagy, Pavel Vajsar
The main aim of the paper is a generic framework for prediction algorithm of the direction and speed of future movement of nodes based on the information of current net-work status. Since the nodes move continually with only a limited amount of energy, it is necessary to focus on the energy efficiency of the communication process during designing new methods and functions. Recently, the combination of the directional antennas within mobile devices has been studied in many areas. The main contribution of this paper is improvement the mobility prediction mobile nodes which is provided with directional antennas.
{"title":"Prediction of movement of wireless nodes in mobile ad-hoc networks","authors":"Nermin Makhlouf, L. Nagy, Pavel Vajsar","doi":"10.1109/COGINFOCOM.2013.6719224","DOIUrl":"https://doi.org/10.1109/COGINFOCOM.2013.6719224","url":null,"abstract":"The main aim of the paper is a generic framework for prediction algorithm of the direction and speed of future movement of nodes based on the information of current net-work status. Since the nodes move continually with only a limited amount of energy, it is necessary to focus on the energy efficiency of the communication process during designing new methods and functions. Recently, the combination of the directional antennas within mobile devices has been studied in many areas. The main contribution of this paper is improvement the mobility prediction mobile nodes which is provided with directional antennas.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121363180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-12-01DOI: 10.1109/COGINFOCOM.2013.6719293
Balázs Kósa, Balázs Pinczel, G. Rácz, A. Kiss
In the influence maximization problem one is to find a subset of vertexes with the highest influence among the node sets of the same cardinality, where a model representing the spread of influence is also given. In [6] two of the most commonly used model were introduced and it was shown that in both cases the problem becomes NP-hard. On the other hand, it was also proven that the greedy algorithm always guarantees a solution performing at most as bad as 1 - 1/e times the optimal solution. Focusing on the Independent Cascade Model we enhance the greedy algorithm to be able to remember not only the locally best solution but b other sets as well, whose influence was the second, third etc. best in the previous step. Surprisingly, contrast to the extended search space this method performs indistinguishably the same as the optimized greedy algorithm of [1] even for relatively large values of b. This shows that there are several different node sets, whose influence is indistinguishably the same as that of the node set returned by the greedy algorithm. Inspired by this result we characterize the most influential sets from two different perspective. Firstly, we try to determine the distribution of three different centrality measures on the members. It turns out that for the eigenvector centrality [12] this distribution can be closely approximated by the normal distribution. Secondly, we examine how the age of a node, i.e., the time passed after becoming a member of the network, correlates to its chance of being chosen by the greedy algorithm. Surprisingly, we found that for graphs with 100, 000 nodes generated by the forest fire model [8] [7], most of the times even the “youngest” node belongs to the first 50, 000 users who have joined the network. It may be even more striking that the fourth youngest elements are among the 10 percent of these nodes in average.
{"title":"Properties of the most influential social sensors","authors":"Balázs Kósa, Balázs Pinczel, G. Rácz, A. Kiss","doi":"10.1109/COGINFOCOM.2013.6719293","DOIUrl":"https://doi.org/10.1109/COGINFOCOM.2013.6719293","url":null,"abstract":"In the influence maximization problem one is to find a subset of vertexes with the highest influence among the node sets of the same cardinality, where a model representing the spread of influence is also given. In [6] two of the most commonly used model were introduced and it was shown that in both cases the problem becomes NP-hard. On the other hand, it was also proven that the greedy algorithm always guarantees a solution performing at most as bad as 1 - 1/e times the optimal solution. Focusing on the Independent Cascade Model we enhance the greedy algorithm to be able to remember not only the locally best solution but b other sets as well, whose influence was the second, third etc. best in the previous step. Surprisingly, contrast to the extended search space this method performs indistinguishably the same as the optimized greedy algorithm of [1] even for relatively large values of b. This shows that there are several different node sets, whose influence is indistinguishably the same as that of the node set returned by the greedy algorithm. Inspired by this result we characterize the most influential sets from two different perspective. Firstly, we try to determine the distribution of three different centrality measures on the members. It turns out that for the eigenvector centrality [12] this distribution can be closely approximated by the normal distribution. Secondly, we examine how the age of a node, i.e., the time passed after becoming a member of the network, correlates to its chance of being chosen by the greedy algorithm. Surprisingly, we found that for graphs with 100, 000 nodes generated by the forest fire model [8] [7], most of the times even the “youngest” node belongs to the first 50, 000 users who have joined the network. It may be even more striking that the fourth youngest elements are among the 10 percent of these nodes in average.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"14 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125043321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-12-01DOI: 10.1109/COGINFOCOM.2013.6719255
S. Benus
This paper reports on the form-function relationship of Slovak conversational fillers uh and mm in task-oriented dyadic spontaneous human-human conversations. The form is represented by two phonetic features: a discrete feature of nasality and a continuous feature of duration. The function is assessed on three dimensions critical for human-machine communicative systems: turn-taking management, (meta)cognitive state, and discourse and informational structure. We report that the two phonetic features facilitate partial disambiguation of communicative functions and discuss potential for applicability of our observations for human-machine interactive voice systems.
{"title":"Cognitive aspects of communicating information with conversational fillers in Slovak","authors":"S. Benus","doi":"10.1109/COGINFOCOM.2013.6719255","DOIUrl":"https://doi.org/10.1109/COGINFOCOM.2013.6719255","url":null,"abstract":"This paper reports on the form-function relationship of Slovak conversational fillers uh and mm in task-oriented dyadic spontaneous human-human conversations. The form is represented by two phonetic features: a discrete feature of nasality and a continuous feature of duration. The function is assessed on three dimensions critical for human-machine communicative systems: turn-taking management, (meta)cognitive state, and discourse and informational structure. We report that the two phonetic features facilitate partial disambiguation of communicative functions and discuss potential for applicability of our observations for human-machine interactive voice systems.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"65 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123247790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-12-01DOI: 10.1109/COGINFOCOM.2013.6719186
U. N. Mughal, Muhammad Babar Mughal, U. Mughal
It was aimed to design an effective and efficient space frame chassis that satisfies the constraints and regulations of Formula SAE. The chassis design must be capable of being constructed from materials and resources available, while also considering other component requirements such as engine, drive train and suspension. This paper is a cognitive overview of CAE tools to design and manufacture a racecar within prevailing constrains.
{"title":"Application of advance CAE tools to design & manufacture a racecar","authors":"U. N. Mughal, Muhammad Babar Mughal, U. Mughal","doi":"10.1109/COGINFOCOM.2013.6719186","DOIUrl":"https://doi.org/10.1109/COGINFOCOM.2013.6719186","url":null,"abstract":"It was aimed to design an effective and efficient space frame chassis that satisfies the constraints and regulations of Formula SAE. The chassis design must be capable of being constructed from materials and resources available, while also considering other component requirements such as engine, drive train and suspension. This paper is a cognitive overview of CAE tools to design and manufacture a racecar within prevailing constrains.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122641959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-12-01DOI: 10.1109/COGINFOCOM.2013.6719291
C. Ortolf, C. Schindelhauer
We consider the problem of distributing media files for streaming on a distributed storage network, where servers have heterogeneous capacities and bandwidths. Regarding networking the servers' bandwidths are the bottlenecks for streaming. We present an algorithm that computes an assignment of n files to m servers for distributing media files such that the streaming speed requirements and capacity constraints are kept. As an additional feature this assignment algorithm works online, i.e. it can assign each file without files to be stored later on. Our algorithm computes the data assignment in time O(nm+mlogm) outperforming linear program solvers.
{"title":"Optimal data distribution for heterogeneous parallel storage servers streaming media files","authors":"C. Ortolf, C. Schindelhauer","doi":"10.1109/COGINFOCOM.2013.6719291","DOIUrl":"https://doi.org/10.1109/COGINFOCOM.2013.6719291","url":null,"abstract":"We consider the problem of distributing media files for streaming on a distributed storage network, where servers have heterogeneous capacities and bandwidths. Regarding networking the servers' bandwidths are the bottlenecks for streaming. We present an algorithm that computes an assignment of n files to m servers for distributing media files such that the streaming speed requirements and capacity constraints are kept. As an additional feature this assignment algorithm works online, i.e. it can assign each file without files to be stored later on. Our algorithm computes the data assignment in time O(nm+mlogm) outperforming linear program solvers.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117007278","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-12-01DOI: 10.1109/COGINFOCOM.2013.6719197
S. Raptis
A large part of research on expressive speech focuses on a fixed palette of “fully-blown” emotions leaving a large set of interesting applications unaddressed. The work described here adopts a more generic approach to expressive speech analysis. By recognizing that affect is manifested in speech through a rich, diverse set of patterns involving various surface features, it seeks to reveal underlying structure and latent components in these patterns which could lead to a fuller understanding of the expressive techniques employed to convey emotion. This places emphasis not on the emotion itself but on expressive speaking style. To this end, it exploits the underlying structure in the expressive speech data to derive a set of latent emotional features. This not only helped in removing a large part of the redundancy in the measured acoustic features, but also revealed latent components in speech that could more efficiently describe affective content. This approach seems more appropriate for applications where expressivity and affect cannot be sufficiently described in terms of a (closed) set of primitive (and archetypical) emotions, as is the case of child-directed speech, narratives and storytelling applications.
{"title":"Exploring latent structure in expressive speech","authors":"S. Raptis","doi":"10.1109/COGINFOCOM.2013.6719197","DOIUrl":"https://doi.org/10.1109/COGINFOCOM.2013.6719197","url":null,"abstract":"A large part of research on expressive speech focuses on a fixed palette of “fully-blown” emotions leaving a large set of interesting applications unaddressed. The work described here adopts a more generic approach to expressive speech analysis. By recognizing that affect is manifested in speech through a rich, diverse set of patterns involving various surface features, it seeks to reveal underlying structure and latent components in these patterns which could lead to a fuller understanding of the expressive techniques employed to convey emotion. This places emphasis not on the emotion itself but on expressive speaking style. To this end, it exploits the underlying structure in the expressive speech data to derive a set of latent emotional features. This not only helped in removing a large part of the redundancy in the measured acoustic features, but also revealed latent components in speech that could more efficiently describe affective content. This approach seems more appropriate for applications where expressivity and affect cannot be sufficiently described in terms of a (closed) set of primitive (and archetypical) emotions, as is the case of child-directed speech, narratives and storytelling applications.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128391363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2013-12-01DOI: 10.1109/COGINFOCOM.2013.6719191
L. Blázovics, B. Forstner, H. Charaf, F. Fitzek
The distributed coordination of a group of mobile robots became a widely studied area in the last decades however the communication aided solutions became also popular research. In this paper we present the concept of cognitive swarm which enables to design faster and reliable cooperative groups by the use of cognitive infocommunication. We demonstrate the benefits of our new concept by a scenario in which a swarm of mobile robots had to guard a given area by intercepting eventual intruders. Therefore we introduce the area surveillance problem and we give both a baseline and a cognitive infocommuncation aided solution for that by the use of the basic behaviour set as fundamental. We show through simulation results that the proposed cognitive scheme can reduce the surrounding time by the factor of two leading to faster interception.
{"title":"On the benefits of cognitive infocommunication for mobile communication nodes using cooperative concepts","authors":"L. Blázovics, B. Forstner, H. Charaf, F. Fitzek","doi":"10.1109/COGINFOCOM.2013.6719191","DOIUrl":"https://doi.org/10.1109/COGINFOCOM.2013.6719191","url":null,"abstract":"The distributed coordination of a group of mobile robots became a widely studied area in the last decades however the communication aided solutions became also popular research. In this paper we present the concept of cognitive swarm which enables to design faster and reliable cooperative groups by the use of cognitive infocommunication. We demonstrate the benefits of our new concept by a scenario in which a swarm of mobile robots had to guard a given area by intercepting eventual intruders. Therefore we introduce the area surveillance problem and we give both a baseline and a cognitive infocommuncation aided solution for that by the use of the basic behaviour set as fundamental. We show through simulation results that the proposed cognitive scheme can reduce the surrounding time by the factor of two leading to faster interception.","PeriodicalId":186055,"journal":{"name":"2013 IEEE 4th International Conference on Cognitive Infocommunications (CogInfoCom)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128668736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：