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

筛选
英文 中文
Antenna Selection Scheme for Application in MIMO Systems with Non-constant Envelope Mapping 非恒定包络映射MIMO系统中的天线选择方案
Shuyun Jia, Jian Wang, Jintao Wang, B. Ai
{"title":"Antenna Selection Scheme for Application in MIMO Systems with Non-constant Envelope Mapping","authors":"Shuyun Jia, Jian Wang, Jintao Wang, B. Ai","doi":"10.1109/CSE.2010.41","DOIUrl":"https://doi.org/10.1109/CSE.2010.41","url":null,"abstract":"To reduce the cost and complexity of receiver without losing much diversity gain, we propose an antenna selection scheme for MIMO systems employing non-constant envelope mapping. By detection of the received signal and a simplified process without any knowledge of channel statement information, this scheme can approach the ideal selection strategy. Single carrier system and STC-OFDM (space-time-code orthogonal frequency division multiplexing) system with Alamouti STBC (space time block code) are both considered. Theoretical analysis and simulation results indicate that the proposed scheme provides significant diversity gain with fairly low complexity.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"12 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":"128010348","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
Availability-Aware Cache Management with Improved RAID Reconstruction Performance 提高RAID重构性能的可用性感知缓存管理
Suzhen Wu, Bo Mao, D. Feng, Jianxi Chen
{"title":"Availability-Aware Cache Management with Improved RAID Reconstruction Performance","authors":"Suzhen Wu, Bo Mao, D. Feng, Jianxi Chen","doi":"10.1109/CSE.2010.38","DOIUrl":"https://doi.org/10.1109/CSE.2010.38","url":null,"abstract":"The RAID reconstruction performance has a significant impact on the availability of RAID-structured storage systems due to the high disk failure rate. Most existing cache managements for RAID-structured storage systems focus on improving the performance or the energy efficiency, while they do not intent to improve the RAID availability by boosting the RAID reconstruction process. In this paper, we propose a novel and practical Availability-aware Cache Management to make the reconstruction process more sequential in the physical disks and reduce the extra reconstruction I/O requests. We implement a prototype of Availability-aware Cache Management, called Shaper, to verify its effectiveness on the RAID reconstruction. Shaper does not affect the I/O performance in the normal mode, but has potential to significantly reduce the RAID reconstruction time and the average user response time during reconstruction simultaneously.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"13 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":"115285227","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
A Knowledge-Based Artificial Fish-Swarm Algorithm 基于知识的人工鱼群算法
X. Gao, Ying Wu, K. Zenger, Xianlin Huang
{"title":"A Knowledge-Based Artificial Fish-Swarm Algorithm","authors":"X. Gao, Ying Wu, K. Zenger, Xianlin Huang","doi":"10.1109/CSE.2010.49","DOIUrl":"https://doi.org/10.1109/CSE.2010.49","url":null,"abstract":"The Artificial Fish-swarm Algorithm (AFA) is an intelligent population-based optimization algorithm inspired by the behaviors of fish swarm. Unfortunately, it sometimes fails to maintain an appropriate balance between exploration and exploitation, and has a drawback of blind search. In this paper, a novel cultured AFA with the crossover operator, namely CAFAC, is proposed to enhance its optimization performance. The crossover operator utilized is to promote the diversification of the artificial fish and make them inherit their parents’ characteristics. The Culture Algorithms (CA) is also combined with the AFA so that the blind search can be combated with. A total of 10 high-dimension and multi-peak functions are employed to investigate the optimization property of our CAFAC. Numerical simulation results demonstrate that the proposed CAFAC can indeed outperform the original AFA.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"09 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":"127197742","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
Input-Driven Reconfiguration for Area and Performance Adaption of Reconfigurable Accelerators 基于输入驱动的可重构加速器区域重构与性能适配
Like Yan, Y. Wen, Tianzhou Chen
{"title":"Input-Driven Reconfiguration for Area and Performance Adaption of Reconfigurable Accelerators","authors":"Like Yan, Y. Wen, Tianzhou Chen","doi":"10.1109/CSE.2010.64","DOIUrl":"https://doi.org/10.1109/CSE.2010.64","url":null,"abstract":"Attaching a reconfigurable loop accelerator to a processor for improving the performance and the efficiency of the system, which can be further enhanced by unrolling the loop to change its parallelism in a better way, is a promising development. The more a loop is unrolled, the wider the reconfigurable area that is exposed. However, the utilization of a loop accelerator is highly linked with the input. Also, in some situations, one will be wasting area to overunroll the loop. With a focus on the area and the performance balance, this paper proposes a dynamically adaptive reconfigurable accelerator framework for the processor/RL architecture. In the framework, reconfiguration of the accelerator is driven by the input. An accelerator selection model is presented for selecting an accelerator at run time among the predefined input patterns. Also, with the help of a detailed illustration of a bzip2 case study, experimental results were provided for the feasibility of the approach, which showed that up to 69.21% reconfigurable area is saved at a cost of 2.63% performance slowdown in the best case.","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":"127499642","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}
引用次数: 11
Fractional Exponent Coupling of RIO RIO的分数指数耦合
Wen-Ping Lai, Zhen Liu
{"title":"Fractional Exponent Coupling of RIO","authors":"Wen-Ping Lai, Zhen Liu","doi":"10.1109/CSE.2010.35","DOIUrl":"https://doi.org/10.1109/CSE.2010.35","url":null,"abstract":"The IETF Differentiated Service (DiffServ) architecture can allow for establishing a modern large scale network which guarantees the quality of service. In order to realize the multiple levels of packet drop precedence required for the Assured Forwarding (AF) framework of DiffServ, a multi-level RED algorithm is needed. RIO (RED with In/Out) is suitable for the AF scheme, and two major RIO variants such as RIO-D and RIO-C have been proposed and widely used. Both use the average lengths of virtual queues to determine the multiple levels of drop precedence and have different coupling strengths between virtual queues. The key difference between RIO-C and RIO-D lies with the fact that RIO-C takes full coupling and RIO-D has zero coupling. In this paper, a novel algorithm called RIO-FEC (RIO based on Fractional Exponent Coupling for determining the coupling strength) is proposed, and can achieve partial coupling with a controllable coupling power for calculating each average virtual queue length. The effects of the fractional exponent based coupling on the drop rates and throughputs of color-labeled virtual queues are analyzed, and a fractional power 1/3 is found to be optimal. The queue weight factor for calculating the EWMAs (Exponential Weighted Moving Averages) of virtual queue lengths, thus affecting the drop probability, is also presented. The results show that the proposed algorithm can achieve a total drop rate and a total throughput as good as RIO-D. Furthermore, RIO-FEC outperforms RIO-C and RIO-D in terms of preventing the lowest-priority virtual queue from bandwidth starvation, and can effectively adjudge the coupling strengths to gain the desired control on the allocation of priority and fairness.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"2018 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":"114699286","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
Process Semantic-Enabled Customisation for Active Service Provisioning 主动服务发放的流程语义启用自定义
Bin Wen, K. He, Peng Liang, Lai Xu
{"title":"Process Semantic-Enabled Customisation for Active Service Provisioning","authors":"Bin Wen, K. He, Peng Liang, Lai Xu","doi":"10.1109/CSE.2010.56","DOIUrl":"https://doi.org/10.1109/CSE.2010.56","url":null,"abstract":"Service oriented architecture (SOA) promotes highly standardized, loosely coupled and Web-enabled services to foster rapid, low-cost and easy composition of distribute applications. Critical to SOA software development is to acquire users¡¯ requirements and to provide service analysis and design techniques for identifying, conceptualizing, profiling, and rationalising service-enable applications. Semantic-enabled requirements engineering (SRE) for developing service-oriented applications helps to transform disordered users¡¯ needs into ordered requirement specifications. It facilitates requirements acquisition with multiple stakeholders¡¯ participation. It further enhances semantic-conducted services aggregation and eventually provides customized service productions according to process semantics of requirements. This paper concentrates on user-centric service customization with a paradigm shift from classical provider-centric service provision to user-centric active service production. Subscription and pushing technology of ATOM/RSS is adopted to actively push users¡¯ needs to service providers. Semantic description of service requirements is proposed, and characterizes in identifying process (workflow) and service. A customized service production platform is designed to demonstrate its practicability and effectiveness.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"13 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":"116839300","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
Hardware Implementation of k-Winner-Take-All Neural Network with On-chip Learning 基于片上学习的k-赢者通吃神经网络硬件实现
Hui-Ya Li, C. Ou, Yi-Tsan Hung, Wen-Jyi Hwang, Chia-Lung Hung
{"title":"Hardware Implementation of k-Winner-Take-All Neural Network with On-chip Learning","authors":"Hui-Ya Li, C. Ou, Yi-Tsan Hung, Wen-Jyi Hwang, Chia-Lung Hung","doi":"10.1109/CSE.2010.51","DOIUrl":"https://doi.org/10.1109/CSE.2010.51","url":null,"abstract":"This paper presents a novel pipelined architecture of the competitive learning (CL) algorithm with k-winners-take-all activation. The architecture employs a codeword swapping scheme so that neurons failing the competition for a training vector are immediately available for the competitions for the subsequent training vectors. An efficient pipeline architecture is then designed based on the codeword swapping scheme for enhancing the throughput. The CPU time of the NIOS processor executing the CL training with the proposed architecture as an accelerator is measured. Experiment results show that the CPU time is lower than that of other hardware or software implementations running the CL training program with or without the support of custom hardware.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"115 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":"117264485","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
Minimizing Thermal Disparities during Placement in 3D ICs 最小化3D集成电路安装过程中的热差异
P. Ghosal, H. Rahaman, P. Dasgupta
{"title":"Minimizing Thermal Disparities during Placement in 3D ICs","authors":"P. Ghosal, H. Rahaman, P. Dasgupta","doi":"10.1109/CSE.2010.28","DOIUrl":"https://doi.org/10.1109/CSE.2010.28","url":null,"abstract":"During the Computer Aided Physical Design Cycle and specifically for high-performance VLSI circuits, on-chip power density plays a major role. The catalyst factors are increased scaling of technology, increasing number of components, higher frequency and bandwidth. The consumed power is usually converted into dissipated heat, affecting the performance and reliability of a chip. Moreover, recent trends in VLSI design entails the stacking of multiple active layers into a monolithic chip. These 3D chips have significantly larger power densities than their 2D counterparts. In this paper, we consider the placement of standard cells and gate arrays (modules) under thermal considerations. Our contribution includes a novel algorithm for placement of the gates or cells in the different active layers of a 3D IC such that: (i) the temperatures of the modules in each of the active layers is uniformly distributed, (ii) the maximum temperatures of each of the active layers is not too high, (iii) the maximum temperatures of the layers vary in a non-increasing manner from bottom layer to top layer to ensure an efficient heat dissipation of the whole chip. Experimental results on randomly generated and standard MCNC and ISPD benchmark instances are quite encouraging.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"307 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":"122697563","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
A Dynamic Self-Adaptive Trust Model for P2P E-Commerce System P2P电子商务系统的动态自适应信任模型
Jie Wang, Miaomiao Li, Yang Yu, Zhenguang Huang
{"title":"A Dynamic Self-Adaptive Trust Model for P2P E-Commerce System","authors":"Jie Wang, Miaomiao Li, Yang Yu, Zhenguang Huang","doi":"10.1109/CSE.2010.73","DOIUrl":"https://doi.org/10.1109/CSE.2010.73","url":null,"abstract":"P2P e-commerce systems are commonly perceived as an environment offering both opportunities and threats. The existence of malicious peers could damage the correctness and availability of them. One way to minimize such threats is to use trust model to evaluate the trustworthiness of peers. This paper presents a dynamic self-adaptive trust model for p2p e-commerce system—AdaptTrust model, which involves in two kinds of trust, namely direct trust and global reputation. The direct trust from a peer to another peer is calculated based on transaction feedbacks between them. The global reputation of a peer is calculated based on trustworthiness ratings from rating peers to the reference peer. Finally, a series of experiments have been done to verify the effectiveness and resistibility of the proposed trust model.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"58 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":"134011110","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
Discrete Particle Swarm Optimization for Materials Budget Allocation in Academic Libraries 高校图书馆物资预算分配的离散粒子群优化
Tsu-Feng Ho, S. Shyu, Yi-Ling Wu, B. Lin
{"title":"Discrete Particle Swarm Optimization for Materials Budget Allocation in Academic Libraries","authors":"Tsu-Feng Ho, S. Shyu, Yi-Ling Wu, B. Lin","doi":"10.1109/CSE.2010.33","DOIUrl":"https://doi.org/10.1109/CSE.2010.33","url":null,"abstract":"We formulate the problem of materials budget allocation for academic libraries by way of the mathematical programming model and design an effective algorithm using discrete particle swarm optimization to resolve the problem. The objective function is to maximize the average preferences of materials selection subjected to the constraints of material costs and required amounts in specified categories. For the comparison purpose, CPLEX, a linear programming software package, and a greedy algorithm are applied to obtain optimal or approximate solutions. The computation results demonstrate the effectiveness and robustness of the proposed DPSO algorithm in dealing with the materials budget allocation problem.","PeriodicalId":342688,"journal":{"name":"2010 13th IEEE International Conference on Computational Science and Engineering","volume":"49 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":"127614419","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
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学术官方微信