炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765536

Chih-Hsiao Tsai, Yu-Jie Lin, Han-Ming Chang, Ying-Hong Wang

引用次数: 0

Contribution of visual feedback to the hippocampal theta activity in mice 视觉反馈对小鼠海马活动的影响

炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765453

N. Katayama, Keita Hidaka, A. Karashima, M. Nakao

引用次数: 0

Design and implementation of server cluster dynamic load balancing based on OpenFlow 基于OpenFlow的服务器集群动态负载均衡的设计与实现

炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765526

Zhihao Shang, Wenbo Chen, Q. Ma, Bin Wu

{"title":"Design and implementation of server cluster dynamic load balancing based on OpenFlow","authors":"Zhihao Shang, Wenbo Chen, Q. Ma, Bin Wu","doi":"10.1109/ICAWST.2013.6765526","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765526","url":null,"abstract":"Nowadays, the Internet is flooded with huge traffic, many applications have millions users, a single server is difficult to bear a large number of clients' access, so many application providers will put several servers as a computing unit to provide support for a specific application, usually people will use distributed computing, load balancing technology to complete the work. A typical load balancing technique is to use a dedicated load balancer to forward the client requests to different servers, this technique requires dedicated hardware support, the hardware is expensive, lacks of flexibility and is easy to become a single point failure. There will be a new solution for load balancing with OpenFlow proposed., this paper mainly studies dynamic load balancing technology in the OpenFlow environment, the Controller collected the server running status through the SNMP protocol, and calculated the aggregated load of the severs according to dynamic load balancing scheduling algorithm, the OpenFlow switch will forward the client's request to the server whose aggregated load is smallest, thus minimize the response time of the web server. In the OpenFlow network environment, using this method can brings high flexibility without additional equipment.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"171 1","pages":"691-697"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85422193","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}

引用次数: 35

The Modified parallelized file transfer protocol for multi-users 改进的多用户并行文件传输协议

炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765531

Wei-Chen Lin, Jiun-Jian Liaw, Chiung-Ta Wu

{"title":"The Modified parallelized file transfer protocol for multi-users","authors":"Wei-Chen Lin, Jiun-Jian Liaw, Chiung-Ta Wu","doi":"10.1109/ICAWST.2013.6765531","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765531","url":null,"abstract":"File Transfer Protocol is the most popular file transfer standard. This FTP can let a computer system connect to the internet via a communication network, and it can also access the system resources from the internet. File server is being downloaded now by TCP/IP protocol, while before it was downloaded by signal server. Due to the limited flow control, the old method could not use download time efficiently. In order to solve the flow control problem, some researchers came up with a distributed file transfer method that can share the document with other users, thus allowing the shortest transfer time using neighboring servers. Although the distributed file transfer can reduce the file transfer time, it was not concerned with the quality of the transfer between two servers, and was inappropriate for file segmentation and transfer, so the file transfer could not attain the optimal transfer efficacy. Based on our research, we propose a new method called Distributed Parallelized File Transfer Protocol (DPFTP). This method is based on Parallelized File Transfer Protocol (P-FTP) and is beneficial to multi-users, as it utilizes server loading and reduces the download time.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"9 1","pages":"718-724"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78474942","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

Robust pedestrian detection and tracking with shadow removal in indoor environments 基于阴影去除的室内环境鲁棒行人检测与跟踪

炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765508

Yunbiao Chen, Hui Yang, Chenxiang Li, S. Pu, Jianyang Zhou, Lingxiang Zheng

引用次数: 2

Controlling spatial sound with table-top interface 控制空间声音与桌面界面

炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765530

Y. Sasamoto, Michael Cohen, J. Villegas

引用次数: 3

Information success model for learning system in cloud computing environment 云计算环境下学习系统的信息成功模型

炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765539

An-Na Kang, L. Barolli, Jae Dong Lee, J. Park, Hwa-Young Jeong

引用次数: 2

Computer aided silicon padding design for burn injury 计算机辅助烧伤硅衬垫设计

炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765448

M. N. Salleh, M. Acar, N. D. Burns

引用次数: 3

Web service filtering and visualization with context aware similarity to bootstrap clustering 具有上下文感知相似性的Web服务过滤和可视化

炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765437

B. Kumara, Incheon Paik, Hiroki Ohashi, Y. Yaguchi

{"title":"Web service filtering and visualization with context aware similarity to bootstrap clustering","authors":"B. Kumara, Incheon Paik, Hiroki Ohashi, Y. Yaguchi","doi":"10.1109/ICAWST.2013.6765437","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765437","url":null,"abstract":"Web service clustering is an efficient approach to address some challenges in service computing area such as discovering and recommending. To cluster the Web services, we need to filter the similar services. Key operation of filtering process is measuring the similarity of services. There are several methods used in current similarity calculation approaches such as keyword, information retrieval, ontology and hybrid methods. However, these approaches do not consider the context when measuring the similarity. So these approaches failed to capture the semantic of terms, which exist under a certain domain. In this paper, we propose context aware similarity method, which uses search results from search engines and support vector machine. Then, we apply Associated Keyword Space (ASKS) algorithm which is effective for noisy data and projected results from a three-dimensional (3D) sphere to a two dimensional (2D) spherical surface for 2D visualization to filter the services. Experimental results show our filtering approach is able to filter services based on domain and plot the result on sphere. Also our approach performs better than the existing approaches. Further, our approach aids to search Web services by visualization of the service data on a spherical surface.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"36 1","pages":"220-226"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88454044","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

A residue to binary converter for a balanced moduli set {22n+1 − 1, 22n, 22n − 1} 平衡模集{22n+1−1,22n, 22n−1}的二值变换器残数

炎黄地理 Pub Date : 2013-11-01 DOI: 10.1109/ICAWST.2013.6765435

E. K. Bankas, K. Gbolagade

{"title":"A residue to binary converter for a balanced moduli set {22n+1 − 1, 22n, 22n − 1}","authors":"E. K. Bankas, K. Gbolagade","doi":"10.1109/ICAWST.2013.6765435","DOIUrl":"https://doi.org/10.1109/ICAWST.2013.6765435","url":null,"abstract":"In this paper, we propose a new moduli set {22n+1 - 1, 22n;22n - l} with its associated reverse converter. The proposed reverse converter is based on Mixed Radix Conversion (MRC). In addition to parallelizing and optimizing the MRC algorithm, the resulting architecture is further simplified in order to obtain a reverse converter that utilizes only 2 levels of Carry Save Adders and three Carry Propagate Adders. The proposed converter is purely adder based and memoryless. Our proposal has a delay of (10n + 4)tfa + 2tmUx with an area cost of (12n + 2)FAs and (2n)H As, which when expressed in terms of HA is (22n + 4), where FA, HA, and tfa represent Full Adder, Half Adder, and delay of a Full Adder, respectively. The proposed scheme is compared with state of the art similar dynamic range converters. Theoretically speaking, our proposal achieves about 62.3% hardware reduction and about 2.13% speed improvement when compared with the reverse converter for {2n + 1,2n 1, 22n+1 - 3, 22n - 2}. Also, in comparison with the converter for {2n - 1, 2n - 1, 22n+1 - l}, the results indicate that, our proposal is about 17.05% faster, but requires about 7.83% more hardware resources. Further, the area time square (ΔT2) metric indicates that our proposed converter is 62.3% and 24.77% better than the state of the art reverse converters for {2n + 1,2n - 1, 22n+1 - 3, 22n - 2} and {2n - 1, 2n + 1, 22n, 22n+1 - l} respectively.","PeriodicalId":68697,"journal":{"name":"炎黄地理","volume":"26 1","pages":"211-216"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73395286","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

炎黄地理最新文献