首页 > 最新文献

2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing最新文献

英文 中文
A mosaic algorithm for high-resolution s-μCT image of porous media based on SIFT & SGWs 基于SIFT和SGWs的多孔介质高分辨率s-μCT图像拼接算法
Xue Wang, Jing Liu
Aiming at image mosaic for high-resolution and high-amplification image of porous media, it proposed a compound method process based on Scale Invariance Feature Transform (SIFT) and Second Generation Wavelets (SGWs). The process is divided into two steps, one is quick match with SIFT, the other is precise image fused by SGWs. It takes full advantage of image's texture to make image matching fast, and then the image fused strategy and method based on SGWs are developed. A series of experiments show that according to high-resolution and high-amplification image, such algorithm could achieve well mosaic result, moreover, obviously it could be applied other likely case.
针对多孔介质高分辨率、高放大图像的拼接问题,提出了一种基于尺度不变性特征变换(SIFT)和第二代小波(SGWs)的复合拼接方法。该过程分为两个步骤,一是用SIFT进行快速匹配,二是用SGWs进行精确图像融合。在此基础上,提出了基于SGWs的图像融合策略和方法。一系列实验表明,对于高分辨率、高放大的图像,该算法可以获得很好的拼接效果,而且显然可以应用于其他可能的情况。
{"title":"A mosaic algorithm for high-resolution s-μCT image of porous media based on SIFT & SGWs","authors":"Xue Wang, Jing Liu","doi":"10.1109/ICCI-CC.2013.6622286","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622286","url":null,"abstract":"Aiming at image mosaic for high-resolution and high-amplification image of porous media, it proposed a compound method process based on Scale Invariance Feature Transform (SIFT) and Second Generation Wavelets (SGWs). The process is divided into two steps, one is quick match with SIFT, the other is precise image fused by SGWs. It takes full advantage of image's texture to make image matching fast, and then the image fused strategy and method based on SGWs are developed. A series of experiments show that according to high-resolution and high-amplification image, such algorithm could achieve well mosaic result, moreover, obviously it could be applied other likely case.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121962157","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}
引用次数: 0
Granularity-based mining for construction of nursing care plan 基于粒度挖掘的护理计划构建
S. Tsumoto, S. Hirano, H. Iwata
Schedule management of hospitalization is important to maintain or improve the quality of medical care and application of a clinical pathway is one of the important solutions for the management. This research proposed an data-oriented maintenance of existing clinical pathways by using data on histories of nursing orders. If there is no clinical pathway for a given disease, the method will induce a new clinical care plan from the data. The method was evaluated on 10 diseases. The results show that the reuse of stored data will give a powerful tool for management of nursing schedule and lead to improvement of hospital services.
住院计划管理是维持或提高医疗服务质量的重要手段,应用临床路径管理是重要的解决方案之一。本研究利用护理医嘱的历史数据,提出了一种以数据为导向的现有临床路径维护方法。如果某一疾病没有临床路径,该方法将从数据中诱导出新的临床护理计划。对10种疾病进行了评价。结果表明,存储数据的重用将为护理计划管理提供有力的工具,从而提高医院的服务水平。
{"title":"Granularity-based mining for construction of nursing care plan","authors":"S. Tsumoto, S. Hirano, H. Iwata","doi":"10.1109/ICCI-CC.2013.6622256","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622256","url":null,"abstract":"Schedule management of hospitalization is important to maintain or improve the quality of medical care and application of a clinical pathway is one of the important solutions for the management. This research proposed an data-oriented maintenance of existing clinical pathways by using data on histories of nursing orders. If there is no clinical pathway for a given disease, the method will induce a new clinical care plan from the data. The method was evaluated on 10 diseases. The results show that the reuse of stored data will give a powerful tool for management of nursing schedule and lead to improvement of hospital services.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127514067","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}
引用次数: 0
Understanding human learning using a multi-agent simulation of the unified learning model 用多智能体模拟的统一学习模型理解人类学习
Vlad Chiriacescu, Leen-Kiat Soh, D. Shell
Within cognitive science, computational modeling based on cognitive architectures has been an important approach to addressing questions of human cognition and learning. This paper reports on a multi-agent computational model based on the principles of the Unified Learning Model (ULM). Derived from a synthesis of neuroscience, cognitive science, psychology, and education, the ULM merges a statistical learning mechanism with a general learning architecture. Description of the single agent model and the multi-agent environment which translate the principles of the ULM into an integrated computational model is provided. Validation results from simulations with respect to human learning are presented. Simulation suitability for cognitive learning investigations is discussed. Multi-agent system performance results are presented. Findings support the ULM theory by documenting a viable computational simulation of the core ULM components of long-term memory, motivation, and working memory and the processes taking place among them. Implications for research into human learning and intelligent agents are presented.
在认知科学中,基于认知架构的计算建模已经成为解决人类认知和学习问题的重要方法。提出了一种基于统一学习模型(ULM)原理的多智能体计算模型。ULM是神经科学、认知科学、心理学和教育学的综合产物,它将统计学习机制与通用学习架构相结合。给出了单智能体模型和多智能体环境的描述,将ULM的原理转化为一个集成的计算模型。给出了关于人类学习的仿真验证结果。讨论了模拟在认知学习调查中的适用性。给出了多智能体系统的性能结果。研究结果通过对长期记忆、动机和工作记忆的核心ULM组成部分以及它们之间发生的过程进行可行的计算模拟,支持了ULM理论。提出了对人类学习和智能代理研究的启示。
{"title":"Understanding human learning using a multi-agent simulation of the unified learning model","authors":"Vlad Chiriacescu, Leen-Kiat Soh, D. Shell","doi":"10.4018/ijcini.2013100101","DOIUrl":"https://doi.org/10.4018/ijcini.2013100101","url":null,"abstract":"Within cognitive science, computational modeling based on cognitive architectures has been an important approach to addressing questions of human cognition and learning. This paper reports on a multi-agent computational model based on the principles of the Unified Learning Model (ULM). Derived from a synthesis of neuroscience, cognitive science, psychology, and education, the ULM merges a statistical learning mechanism with a general learning architecture. Description of the single agent model and the multi-agent environment which translate the principles of the ULM into an integrated computational model is provided. Validation results from simulations with respect to human learning are presented. Simulation suitability for cognitive learning investigations is discussed. Multi-agent system performance results are presented. Findings support the ULM theory by documenting a viable computational simulation of the core ULM components of long-term memory, motivation, and working memory and the processes taking place among them. Implications for research into human learning and intelligent agents are presented.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130420578","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}
引用次数: 13
Feature fusion for mobile usage prediction using rank-score characteristics 基于rank-score特征的移动使用预测特征融合
Chen Sun, Yang Wang, Jun Zheng, D. Hsu
The aim of this paper is to investigate feature fusion problem for mobile usage prediction using combinatorial fusion analysis (CFA). CFA uses the rank-score characteristics (RSC) function to guide the process of selecting score-based fusion (SF) or rank-based fusion (RF). We study the feature fusion of two mobile adaptive user interface applications: dynamic shortcuts for application launching and dynamic contact list, which improve the usability of mobile devices through usage predication. Our results confirm that for mobile usage prediction RSC function is useful for feature fusion decision. It also proves that RF outperforms SF when the features have unique scoring behavior and relatively high performance.
本文的目的是研究基于组合融合分析(CFA)的移动用户预测特征融合问题。CFA使用秩-分数特征(RSC)函数来指导选择基于分数的融合(SF)或基于秩的融合(RF)的过程。研究了两种移动自适应用户界面应用的特征融合:应用启动的动态快捷方式和动态联系人列表,通过使用预测提高移动设备的可用性。我们的研究结果证实了RSC函数对移动使用预测的特征融合决策是有用的。当特征具有独特的评分行为和相对较高的性能时,RF优于SF。
{"title":"Feature fusion for mobile usage prediction using rank-score characteristics","authors":"Chen Sun, Yang Wang, Jun Zheng, D. Hsu","doi":"10.1109/ICCI-CC.2013.6622246","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622246","url":null,"abstract":"The aim of this paper is to investigate feature fusion problem for mobile usage prediction using combinatorial fusion analysis (CFA). CFA uses the rank-score characteristics (RSC) function to guide the process of selecting score-based fusion (SF) or rank-based fusion (RF). We study the feature fusion of two mobile adaptive user interface applications: dynamic shortcuts for application launching and dynamic contact list, which improve the usability of mobile devices through usage predication. Our results confirm that for mobile usage prediction RSC function is useful for feature fusion decision. It also proves that RF outperforms SF when the features have unique scoring behavior and relatively high performance.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134237956","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}
引用次数: 5
Flexible route planning for amusement parks navigation 游乐园导航的灵活路线规划
H. Ohwada, Masato Okada, K. Kanamori
This paper describes flexible route planning for amusement parks (e.g. Disneyland) navigation. Unlike conventional shortest path finding, we provide several types of algorithms that consider waiting time estimation in real time, exploit the reservation facility of an attraction such as Fast Pass in Disneyland, and balance a series of enjoyment types such as excitement or relaxation. These features extend Dikstra's shortest path algorithm to be more flexible and dynamical. We have developed a navigation tool as a Web application in which users select their interesting attractions and then the application suggests reasonable and enjoyable routes. The experiment was conducted to show the performance of this application focusing on well-known attractions in Tokyo Disneyland.
本文描述了游乐园(如迪斯尼乐园)导航的柔性路线规划。与传统的最短路径查找不同,我们提供了几种类型的算法,这些算法考虑了实时的等待时间估计,利用了景点的预订设施,如迪士尼乐园的快速通道,并平衡了一系列享受类型,如兴奋或放松。这些特性扩展了Dikstra的最短路径算法,使其更加灵活和动态。我们开发了一个导航工具,作为一个Web应用程序,用户可以在其中选择他们感兴趣的景点,然后应用程序建议合理和令人愉快的路线。本实验以东京迪士尼乐园的知名景点为重点,展示了该应用程序的性能。
{"title":"Flexible route planning for amusement parks navigation","authors":"H. Ohwada, Masato Okada, K. Kanamori","doi":"10.1109/ICCI-CC.2013.6622277","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622277","url":null,"abstract":"This paper describes flexible route planning for amusement parks (e.g. Disneyland) navigation. Unlike conventional shortest path finding, we provide several types of algorithms that consider waiting time estimation in real time, exploit the reservation facility of an attraction such as Fast Pass in Disneyland, and balance a series of enjoyment types such as excitement or relaxation. These features extend Dikstra's shortest path algorithm to be more flexible and dynamical. We have developed a navigation tool as a Web application in which users select their interesting attractions and then the application suggests reasonable and enjoyable routes. The experiment was conducted to show the performance of this application focusing on well-known attractions in Tokyo Disneyland.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127073777","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}
引用次数: 7
Investigating intuitive granularities of overlap relations 研究重叠关系的直观粒度
J. O. Wallgrün, Jinlong Yang, A. Klippel
We present four human behavioral experiments to address the question of intuitive granularities in fundamental spatial relations as they can be found in formal spatial calculi that focus on invariant characteristics under certain (especially topological) transformations. Of particular interest to this article is the concept of two spatially extended entities overlapping each other. The overlap concept has been extensively treated in Galton's mode of overlap calculus [1]. In the first two experiments, we used a category construction task to calibrate this calculus against behavioral data and found that participants adopted a very coarse view on the concept of overlap, only distinguishing between three general relations: proper part, overlap, and non-overlap. In the following two experiments, we changed the instructions to explicitly address the possibility that humans could be swayed to adopt a more detailed level of granularity, that is, we encouraged them to create as many meaningful groups as possible. The results show that the three relations identified earlier (overlap, non-overlap, and proper part) are very robust and a natural level of granularity across all four experiments but that contextual factors gain more influence at finer levels of granularity.
我们提出了四个人类行为实验来解决基本空间关系中的直观粒度问题,因为它们可以在形式空间演算中找到,这些演算专注于某些(特别是拓扑)变换下的不变特征。本文特别感兴趣的是两个空间扩展实体相互重叠的概念。重叠概念在重叠演算的Galton模式中得到了广泛的处理[1]。在前两个实验中,我们使用了一个类别构建任务来根据行为数据校准这种演算,发现参与者对重叠的概念采用了非常粗糙的观点,只区分了三种一般关系:适当部分、重叠和非重叠。在接下来的两个实验中,我们改变了指令,明确地解决了人类可能会受到影响而采用更详细粒度级别的可能性,也就是说,我们鼓励他们创建尽可能多的有意义的群体。结果表明,前面确定的三个关系(重叠、非重叠和适当部分)在所有四个实验中都非常稳健,并且具有自然的粒度水平,但是上下文因素在更细的粒度水平上获得更大的影响。
{"title":"Investigating intuitive granularities of overlap relations","authors":"J. O. Wallgrün, Jinlong Yang, A. Klippel","doi":"10.1109/ICCI-CC.2013.6622258","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622258","url":null,"abstract":"We present four human behavioral experiments to address the question of intuitive granularities in fundamental spatial relations as they can be found in formal spatial calculi that focus on invariant characteristics under certain (especially topological) transformations. Of particular interest to this article is the concept of two spatially extended entities overlapping each other. The overlap concept has been extensively treated in Galton's mode of overlap calculus [1]. In the first two experiments, we used a category construction task to calibrate this calculus against behavioral data and found that participants adopted a very coarse view on the concept of overlap, only distinguishing between three general relations: proper part, overlap, and non-overlap. In the following two experiments, we changed the instructions to explicitly address the possibility that humans could be swayed to adopt a more detailed level of granularity, that is, we encouraged them to create as many meaningful groups as possible. The results show that the three relations identified earlier (overlap, non-overlap, and proper part) are very robust and a natural level of granularity across all four experiments but that contextual factors gain more influence at finer levels of granularity.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124122320","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}
引用次数: 2
Comparison of missing data filling methods in bridge health monitoring system 桥梁健康监测系统中缺失数据填充方法的比较
Youqing Ding, Yumei Fu, Fang Zhu, Xinwu Zan
In terms of the data characteristics of small sample, nonlinearity and seasonal regression in bridge health monitoring system, this paper analyses the applied results with different data filling methods such as linear regression, seasonal autoregressive integrated moving average (SARIMA), neural network BP approach and support vector machine (SVM). The comparison results show that support vector machines (SVM) and BP neural network have higher precision in the case of the same sample. The filling results show that support vector machines (SVM) has a higher accuracy than neural network BP with the small samples.
针对桥梁健康监测系统数据小样本、非线性和季节性回归的特点,分析了线性回归、季节自回归积分移动平均(SARIMA)、神经网络BP法和支持向量机(SVM)等不同数据填充方法的应用效果。对比结果表明,在相同的样本情况下,支持向量机(SVM)和BP神经网络具有更高的精度。结果表明,在小样本情况下,支持向量机比神经网络BP具有更高的填充精度。
{"title":"Comparison of missing data filling methods in bridge health monitoring system","authors":"Youqing Ding, Yumei Fu, Fang Zhu, Xinwu Zan","doi":"10.1109/ICCI-CC.2013.6622280","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622280","url":null,"abstract":"In terms of the data characteristics of small sample, nonlinearity and seasonal regression in bridge health monitoring system, this paper analyses the applied results with different data filling methods such as linear regression, seasonal autoregressive integrated moving average (SARIMA), neural network BP approach and support vector machine (SVM). The comparison results show that support vector machines (SVM) and BP neural network have higher precision in the case of the same sample. The filling results show that support vector machines (SVM) has a higher accuracy than neural network BP with the small samples.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122652072","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}
引用次数: 3
An Improved AdaBoost face detection algorithm based on the weighting parameters of weak classifier 基于弱分类器加权参数的改进AdaBoost人脸检测算法
Yi Xiang, Ying Wu, Jun Peng
Weighting parameters are introduced to ensure the weak classifier that comes with the False Rejection Rate (FRR) to significantly reduce the False Acceptance Rate (FAR). Knowing that the Haar-Like features redundancy, the most effective combination of features is chosen from all the features upon the completion of the classifier training, aiming to improve the speed and rate of face recognition. The results show that the improved AdaBoost algorithm saw an improved recognition rate of 15% compared to the traditional algorithm, where the video image sequence presented an average face recognition rate of 21.5ms/frame, being able to meet the requirements of real-time face detection.
引入加权参数,确保带有错误拒斥率(FRR)的弱分类器显著降低错误接受率(FAR)。在了解Haar-Like特征冗余的情况下,在分类器训练完成后,从所有特征中选择最有效的特征组合,以提高人脸识别的速度和速率。结果表明,改进后的AdaBoost算法比传统算法的识别率提高了15%,其中视频图像序列的平均人脸识别率为21.5ms/帧,能够满足实时人脸检测的要求。
{"title":"An Improved AdaBoost face detection algorithm based on the weighting parameters of weak classifier","authors":"Yi Xiang, Ying Wu, Jun Peng","doi":"10.1109/ICCI-CC.2013.6622265","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622265","url":null,"abstract":"Weighting parameters are introduced to ensure the weak classifier that comes with the False Rejection Rate (FRR) to significantly reduce the False Acceptance Rate (FAR). Knowing that the Haar-Like features redundancy, the most effective combination of features is chosen from all the features upon the completion of the classifier training, aiming to improve the speed and rate of face recognition. The results show that the improved AdaBoost algorithm saw an improved recognition rate of 15% compared to the traditional algorithm, where the video image sequence presented an average face recognition rate of 21.5ms/frame, being able to meet the requirements of real-time face detection.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122038389","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}
引用次数: 7
Attributes affecting the application of energy saving measures — A Chongqing study 影响节能措施应用的属性——重庆市研究
Zhihao Huang, Dan-lu Jiang, Yin Huang
The effectiveness of applying saving energy saving measures has been affected by various attributes. As choosing different energy saving measures will result in different energy saving performance, it is important to understand what and how these attributes affect the choice of specific energy saving method. There are many types of attributes affecting the way of choosing energy saving methods. This paper presents these majors attributes that determine the way how to choose energy saving methods. The data used for analysis are collected from a questionnaire survey to Chongqing practice in China. The results provide valuable references to decision-making on adopting adequate methods for improving energy saving in urban residential buildings.
节能措施的应用效果受到各种属性的影响。由于选择不同的节能措施会导致不同的节能性能,因此了解这些属性是什么以及如何影响具体节能方法的选择非常重要。有许多类型的属性影响选择节能方法的方式。本文介绍了这些专业属性决定了如何选择节能方法。用于分析的数据是通过对中国重庆实践的问卷调查收集的。研究结果为采取适当的措施提高城市居住建筑的节能水平提供了有价值的决策参考。
{"title":"Attributes affecting the application of energy saving measures — A Chongqing study","authors":"Zhihao Huang, Dan-lu Jiang, Yin Huang","doi":"10.1109/ICCI-CC.2013.6622281","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622281","url":null,"abstract":"The effectiveness of applying saving energy saving measures has been affected by various attributes. As choosing different energy saving measures will result in different energy saving performance, it is important to understand what and how these attributes affect the choice of specific energy saving method. There are many types of attributes affecting the way of choosing energy saving methods. This paper presents these majors attributes that determine the way how to choose energy saving methods. The data used for analysis are collected from a questionnaire survey to Chongqing practice in China. The results provide valuable references to decision-making on adopting adequate methods for improving energy saving in urban residential buildings.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130480529","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}
引用次数: 4
An emotional regulation model with memories for virtual agents 基于记忆的虚拟代理情绪调节模型
Jonathan-Hernando Rosales, Karina Jaime, Félix F. Ramos, M. Ramos
Emotional regulation is a mechanism to adjust our behavior to the current environment. We use this mechanism to achieve goals and objectives. This paper proposes a model for emotional regulation in virtual agents based on biological evidence of human brain function. The evidence shows different brain activation during emotional regulation. The model defines the techniques that are implemented, the data flow, and the data processing in each brain area during the emotional regulation. In the case study, a virtual agent shows behavior changes when it takes into account the emotional regulation mechanism and when it does not. The agent has emotional memories; they are from previous experiences and help to provide the desired behavior.
情绪调节是一种使我们的行为适应当前环境的机制。我们利用这一机制来实现目标。本文提出了一种基于人脑功能生物学证据的虚拟代理情绪调节模型。有证据表明,在情绪调节过程中,大脑的活动是不同的。该模型定义了情绪调节过程中每个脑区所实施的技术、数据流和数据处理。在案例研究中,虚拟代理在考虑情绪调节机制和不考虑情绪调节机制时表现出行为变化。代理人有情感记忆;它们来自以前的经验,并有助于提供所需的行为。
{"title":"An emotional regulation model with memories for virtual agents","authors":"Jonathan-Hernando Rosales, Karina Jaime, Félix F. Ramos, M. Ramos","doi":"10.1109/ICCI-CC.2013.6622253","DOIUrl":"https://doi.org/10.1109/ICCI-CC.2013.6622253","url":null,"abstract":"Emotional regulation is a mechanism to adjust our behavior to the current environment. We use this mechanism to achieve goals and objectives. This paper proposes a model for emotional regulation in virtual agents based on biological evidence of human brain function. The evidence shows different brain activation during emotional regulation. The model defines the techniques that are implemented, the data flow, and the data processing in each brain area during the emotional regulation. In the case study, a virtual agent shows behavior changes when it takes into account the emotional regulation mechanism and when it does not. The agent has emotional memories; they are from previous experiences and help to provide the desired behavior.","PeriodicalId":130244,"journal":{"name":"2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114999423","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}
引用次数: 5
期刊
2013 IEEE 12th International Conference on Cognitive Informatics and Cognitive Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1