2010 13th IEEE International Conference on Computational Science and Engineering最新文献

筛选
英文 中文
An Effective Method to Improve the Resistance to Frangibility in Scale-Free Networks 一种提高无标度网络抗脆性的有效方法
Kaihua Xu, Yongwei Meng, Yuhua Liu, N. Xiong, L. Yang, Meirong Zheng
{"title":"An Effective Method to Improve the Resistance to Frangibility in Scale-Free Networks","authors":"Kaihua Xu, Yongwei Meng, Yuhua Liu, N. Xiong, L. Yang, Meirong Zheng","doi":"10.1109/CSE.2010.36","DOIUrl":"https://doi.org/10.1109/CSE.2010.36","url":null,"abstract":"The scale-free networks reveals the essential characteristics of networks, which can be used to describe many realistic networks, which has a common features: The minority vertices have massive connections, the number of which may reach as high as several million, but the majority vertices only have few connections, which is one of characteristics of scale-free networks. So the scale-free networks were robust when nodes were moved randomly but frangible when nodes were attacked spitefully. If the networks ' degree distribution is uniform, which may enhance the vulnerability capacity of the scale-free networks. Therefore this paper embarks from hubs and the minimum degree the two aspects to improve scale-free networks¡¯ anti-frangibility ability. To improve the resistance to frangibility in scale free networks, a model based on endurable probability and entropy of degree distribution was proposed in this paper. In order to control the hubs, a method was put forward to measure off rank. We focused on the key nodes, which a certain nodes should be protected and a certain connections should be partitioned and reconstructed. Compare with the original structure, the optimized structure was smarter, more tolerant of wrong and resistant of frangibility. The simulation showed that the minimum degree of scale free networks was set and coordinated properly, which could mend the resistance to frangibility. And the topology of scale-free networks was optimized and the work efficiency and resist of frangibility were also improved.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124797858","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
Modeling and Prolonging Techniques on Operational Lifetime of Wireless Sensor Networks 无线传感器网络工作寿命建模与延长技术
Fuu-Cheng Jiang, Chao-Tung Yang, Shih-Meng Teng, Hsiang-Wei Wu, Yi-Ju Chiang
{"title":"Modeling and Prolonging Techniques on Operational Lifetime of Wireless Sensor Networks","authors":"Fuu-Cheng Jiang, Chao-Tung Yang, Shih-Meng Teng, Hsiang-Wei Wu, Yi-Ju Chiang","doi":"10.1109/CSE.2010.11","DOIUrl":"https://doi.org/10.1109/CSE.2010.11","url":null,"abstract":"Power consumption is an essentially important issue and an interesting challenge to prolong the lifetime of wireless sensor network (WSN). Sensors closer to a sink node have a larger forwarding traffic burden and consume more energy than nodes further away from the sink. The whole operational lifetime of WSN is deteriorated because of such an uneven node power consumption patterns, leading to what is known as an energy hole problem (EHP) around the sink node. In this article, we propose a novel power-saving scheme to alleviate the EHP based on the Min(N, T) policy M/G/1 queuing model. With little management cost, the proposed queue-based power-saving technique can be applied to prolong the lifetime of sensor network economically and effectively. For the proposed queue-based model, mathematical framework on performance measures have been formulated. And also we analyze the average traffic load per node for concentric sensor network. Focusing on the nodes located in the innermost shell of WSN, numerical and NS2 network simulation results validate that the proposed approach indeed provides a feasibly cost-effective approach for lifetime elongation of sensor networks.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125351512","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}
引用次数: 1
Intelligent Mode Decision Procedure for MVC Inter-view Frame MVC间视图框架的智能模式决策过程
Xingang Liu, K. Sohn, L. Yang, Wei Zhu
{"title":"Intelligent Mode Decision Procedure for MVC Inter-view Frame","authors":"Xingang Liu, K. Sohn, L. Yang, Wei Zhu","doi":"10.1109/CSE.2010.31","DOIUrl":"https://doi.org/10.1109/CSE.2010.31","url":null,"abstract":"In this paper, an intelligent low-cost mode decision (MD) procedure is proposed for the inter-view frame of the multi-view video coding (MVC). Multiple parameters, such as macro block (MB) energy, view/temporal domain mode similarities and so on, are utilized to reduce the number of the mode candidates so that the corresponding Rate-to-Distortion Cost (RDCost) computing can be eliminated. The simulation results show that the proposed algorithm can reduce more than 90% processing time for the inter-view frame compared with the original JMVM codec with only a slight quality loss which can be ignored. It can be widely employed by the multi-view signal communications especially under the mobile and embedded environments.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125569072","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}
引用次数: 1
Gateway to Quality Living for the Elderly: Charting an Innovative Approach to Evidence-Based E-Health Technologies for Serving the Chronically Ill 老年人优质生活之门:为慢性病患者提供循证电子健康技术的创新方法
Joseph K. Tan, P. Hung, Michael Dohan, Thomas Trojer, Matthias Farwick, J. Tashiro
{"title":"Gateway to Quality Living for the Elderly: Charting an Innovative Approach to Evidence-Based E-Health Technologies for Serving the Chronically Ill","authors":"Joseph K. Tan, P. Hung, Michael Dohan, Thomas Trojer, Matthias Farwick, J. Tashiro","doi":"10.1109/CSE.2010.27","DOIUrl":"https://doi.org/10.1109/CSE.2010.27","url":null,"abstract":"In this paper, we explore four critical barriers to e-Health effectiveness and discuss why and how to build and evaluate e-Health technologies for the chronically ill, including: (1) gaps in knowledge about learning and health behaviors, (2) metrics for technology adoption and beneficial use, (3) sampling and decision support, and (4) adherence and adaptive care customization. Accordingly, the metaphor of a “gateway” is used to imply that healthcare providers and the individuals they serve must engage in a sensible two-way interactions, on the one hand, it should open the door for providers to offer personalized and cost-effective care, on the other hand, it should also open the door to a welcoming environment that provides easy access and motivation for sustained use by the chronically-ill individuals.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126969300","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}
引用次数: 10
Emotion Sensing for Internet Chatting: A Web Mining Approach for Affective Categorization of Events 网络聊天的情感感知:一种事件情感分类的Web挖掘方法
Cheng-Yu Lu, William W. Y. Hsu, Hsin-Tsung Peng, Jen-Ming Chung, Jan-Ming Ho
{"title":"Emotion Sensing for Internet Chatting: A Web Mining Approach for Affective Categorization of Events","authors":"Cheng-Yu Lu, William W. Y. Hsu, Hsin-Tsung Peng, Jen-Ming Chung, Jan-Ming Ho","doi":"10.1109/CSE.2010.44","DOIUrl":"https://doi.org/10.1109/CSE.2010.44","url":null,"abstract":"This study proposes an emotion detection engine for real time Internet chatting applications. We adopt a Web scale text mining approach that automates the categorization of affection state of daily events. We first accumulated a huge collection of real-life entities from Web that would participate in events with a user in the chatting room. Based on the common actions between each entity and the type of the user in a chatting room session, such as boy, girl, old man and so on, each collected entity was automatically classified into different affective categories such as pleasant, provoking, grievous, and scary. During a chatting session, each sentence is first parsed using semantic roles labeling techniques to retrieve the verb and object of the event embedded in the sentence. Based on a set of manually authored emotion generation rule, the system then assigns the emotion based on the verb and the affective categories of the object. Primitive evaluations show that the precision rate of the emotion detection engine is rather satisfactory for applications that distinguish emotions of Happiness, Sadness, Anger, and Fear.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128376253","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
Parametric Control in a Region-Based Coupled MRF Model with Phase Dynamics for Coarse Image Region Segmentation 基于相位动力学的区域耦合MRF模型参数控制粗图像区域分割
Haichao Liang, K. Nakada, K. Matsuzaka, T. Morie, M. Okada
{"title":"Parametric Control in a Region-Based Coupled MRF Model with Phase Dynamics for Coarse Image Region Segmentation","authors":"Haichao Liang, K. Nakada, K. Matsuzaka, T. Morie, M. Okada","doi":"10.1109/CSE.2010.32","DOIUrl":"https://doi.org/10.1109/CSE.2010.32","url":null,"abstract":"Towards hardware implementation of real-time visual image processing, we propose a piecewise linear (PWL) approximation of a coupled region-based Markov Random Field (MRF) model with hidden phase variables for coarse image region segmentation. We introduce PWL functions into update equations of the region-based model, in order to make it easy to control parameters that determine the balance between image segmentation and smoothing, as well as to make it efficient for hardware implementation. We can tune filtering properties of our model by controlling the parameters of the PWL functions in applications to a task of coarse image region segmentation. Finally, we demonstrate that closed regions in input images can be represented by phase variables in multi-scale.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128437873","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
Time-Series Classification Based on Individualised Error Prediction 基于个性化误差预测的时间序列分类
Krisztián Búza, A. Nanopoulos, L. Schmidt-Thieme
{"title":"Time-Series Classification Based on Individualised Error Prediction","authors":"Krisztián Búza, A. Nanopoulos, L. Schmidt-Thieme","doi":"10.1109/CSE.2010.16","DOIUrl":"https://doi.org/10.1109/CSE.2010.16","url":null,"abstract":"Time-series classification is an active research topic in machine learning, as it finds applications in numerous domains. The k-NN classifier, based on the discrete time warping (DTW) distance, had been shown to be competitive to many state-of-the art time-series classification methods. Nevertheless, due to the complexity of time-series data sets, our investigation demonstrates that a single, global choice for k (>= 1) can become sub optimal, because each individual region of a data set may require a different k value. In this paper, we proposed a novel individualized error prediction (IEP) mechanism that considers a range of k-NN classifiers (for different k values) and uses secondary regression models that predict the error of each such classifier. This permits to perform k-NN time-series classification in a more fine grained fashion that adapts to the varying characteristics among different regions by avoiding the restriction of a single value of k. Our experimental evaluation, using a large collection of real time-series data, indicates that the proposed method is more robust and compares favorably against two examined baselines by resulting in significant reduction in the classification error.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125914946","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}
引用次数: 23
DCMTs: Supporting Dynamically Created Migratory Threads dcmt:支持动态创建迁移线程
Y. Zhu, Wu Zhang, Hai Jiang, Yu Lei, Jun-jie Peng
{"title":"DCMTs: Supporting Dynamically Created Migratory Threads","authors":"Y. Zhu, Wu Zhang, Hai Jiang, Yu Lei, Jun-jie Peng","doi":"10.1109/CSE.2010.63","DOIUrl":"https://doi.org/10.1109/CSE.2010.63","url":null,"abstract":"Thread migration is an effective technique for fault resilience and load balancing in high performance computing. However, flexible thread migration is not easy to achieve. In this paper, we present an approach to creating migratory threads dynamically at application level. The targets must be executable source files. Compared to the static ones, the number of threads created during migration with the new scheme is independent from the context. Various thread cases are considered for migration. Thread state is handled at application level. Variables are saved in structures in C language for speedy state construction. In order to solve the inability of traditional methods in tracking the created threads, a tree of active function calls is used to record the callback. The preprocessor of the proposed one is written in YACC for accuracy and programmability. The migration enabling process is transparent to programmers with the help of the preprocess. The experimental results have demonstrated the effectiveness of this approach.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"326-328 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130906648","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
A Novel Martingale Approach to QoS-Aware Wireless Sensor Networks 基于鞅的qos感知无线传感器网络
D. Duran, Shichuan Ma, Yaoqing Yang, Y. Qian
{"title":"A Novel Martingale Approach to QoS-Aware Wireless Sensor Networks","authors":"D. Duran, Shichuan Ma, Yaoqing Yang, Y. Qian","doi":"10.1109/CSE.2010.15","DOIUrl":"https://doi.org/10.1109/CSE.2010.15","url":null,"abstract":"With the consideration of network scalability, complexity, and resource limitations, cooperative nodal decision-making in wireless sensor networks (WSN) becomes increasingly important. In this paper, a novel Martingale approach to dynamically monitoring overall network health, based upon the exploitation of a Quality of Service (QoS) requirement, is proposed. Incorporating a Martingale framework for nodal response as an integral calculation of current network statistics allows local nodal decisions to become progressively more accurate as the network life increases and the rigid constraints to power become inescapable. Hence, nodes become increasingly aware of the network conditions, based upon the current environment as well as a priori statistics, and have the ability to react with more foresight. Simulations and analysis show that this framework for sensor nodal decisions has several advantages compared with an existing learning automation approach in different fading channel environments.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131626243","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}
引用次数: 1
Partitioning Granularity, Communication Overhead, and Adaptation in OS Services for Distributed Reconfigurable Systems on Chip 分布式可重构芯片系统操作系统服务的分区粒度、通信开销和适应性
Sufyan Samara
{"title":"Partitioning Granularity, Communication Overhead, and Adaptation in OS Services for Distributed Reconfigurable Systems on Chip","authors":"Sufyan Samara","doi":"10.1109/CSE.2010.23","DOIUrl":"https://doi.org/10.1109/CSE.2010.23","url":null,"abstract":"Distributed embedded systems are exposed to variable applications and requirements. This results in a dynamic and unpredictable changes in the availability of resources. Existing operating system implementations for embedded devices are struggling to address the challenges of efficiently utilizing modern target platforms with heterogeneous computational elements and variable resources. To cope with these challenges, operating system services can be partitioned into small blocks that can run on any computational element and use different resource combinations in the target platform. Although this partitioning allows flexibility and adaptation, it also introduces undesired inter-partition communication overhead. In this paper we discuss a lower bound for the partitioning granularity in order to provide a trade off between communication overhead and adaptation. In addition, we argue the usage of pipelining as an approach to reducing the communication overhead. As a proof of concept a case study is presented.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134539145","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信