{"title":"Learning Microarray Cancer Datasets by Random Forests and Support Vector Machines","authors":"Myungsook Klassen","doi":"10.1109/FUTURETECH.2010.5482716","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482716","url":null,"abstract":"Analyzing gene expression data from microarray devices has many important applications in medicine and biology: the diagnosis of disease, accurate prognosis for particular patients, and understanding the response of a disease to drugs, to name a few. Two classifiers, random forests and support vector machines are studied in application to micro array cancer data sets. Performance of classifiers with different numbers of genes were evaluated in hope to find out if a smaller number of good genes gives a better classification rate.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116944528","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}
{"title":"Adaptive Fault-Tolerance by Exposing Service Request Process as First-Class Object in Pervasive Computing","authors":"Yongzhi Yang, Dian-xi Shi, Peng Zou, Xiang Rao","doi":"10.1109/FUTURETECH.2010.5482747","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482747","url":null,"abstract":"In the open and dynamic pervasive computing environment, it is challenging to detect and handle the frequently occurred failures of service request. The widely used transparent mechanisms Remote Procedure Call and Object Request Broker have a great impact on the adaptive fault-tolerance, because they make it difficult for service requester to sense, configure and control the service request process. In this paper, we explicitly encapsulate and expose the service request process as the first-class object. By the exposed service request object, both the pervasive computing platform and the user applications are able to acquire the adaptive and systematic fault-tolerance ability during the service request process.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117012273","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}
{"title":"Security Level Quantification and Benchmarking in Complex Networks","authors":"Vesselin Tzvetkov","doi":"10.1109/FUTURETECH.2010.5482774","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482774","url":null,"abstract":"Abstract- The security of complex networks with multiple elements is very difficult to evaluate and characterize by numbers. The interaction between the network elements, the different layer topologies and the numerous features makes the security quantification almost impossible. On the other side, the lack of security benchmarking is very problematic for the budget and invests allocation by companies. Numerical economical indexes for the costs and potential benefits are used to set the budgets. The security is not be quantified and it cannot be mapped to these economical indexes, thus the budget is not set objectively. This paper suggests a novel framework for quantification of network security, thus security benchmarking. The relative vector expresses the different layers, physical connections, operation risk, and human resources. The benchmark is relative and not absolute value, which is an indirect indication for the security. The relative security vector maps to economical values and helps the management to take the decisions. The suggested framework extends the common standards like ISO 27000, BSI, ITIL, which characterize single network elements or processes in corporations. This framework is the missing link between the security standards, subjective expert analysis and the monetary instruments. The benchmarking is not saying if a system is secured, then it gives a relative indirect comparison between systems.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126601971","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}
{"title":"VQ-Based Image Embedding Scheme Using Adaptive Codeword Grouping Strategy","authors":"Chin-Feng Lee, C. Weng, Kuan-Ting Li","doi":"10.1109/FUTURETECH.2010.5482766","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482766","url":null,"abstract":"NA","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126260914","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}
{"title":"Secret Embedding and Reconstruction for Authentications in Steganography upon Secret Sharing Systems","authors":"Yu-Ting Chen, Cheng-Hsing Yang, Shiuh-Jeng Wang","doi":"10.1109/FUTURETECH.2010.5482759","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482759","url":null,"abstract":"In this paper, we propose an enhanced authentication scheme that aims at the detection of stego-image preventing the fake share offers from the share-holder. Inspired by the past one study of Wang et al. scheme, the secret reconstruction is not complete in the course of shadow stego-images upon the secret sharing systems. Besides, the PSNR evaluations to the embedded images are furthermore superior to the past studies upon our revised algorithms. In other words, the secret embedding and reconstruction is definitely fulfilled upon the secret sharing systems. The qualities of the stego-images also do meet the requirement of steganography in better fidelity upon human vision systems.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126275947","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}
{"title":"A Novel Routing-Aware MAC Protocol for Mobile Ad Hoc Network","authors":"W. Nie, N. Xiong, J. Park, Jun Fan","doi":"10.1109/FUTURETECH.2010.5482764","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482764","url":null,"abstract":"Most of the MAC and routing protocols proposed for wireless ad hoc networks are based on omni-directional antenna. Omni-directional antenna distributes energy in all directions, not only causing unnecessary interference to other nodes, but also reducing the potential range of the transmission. In this paper, we propose a novel medium access control and routing protocols for wireless ad hoc networks that using directional antennas. Our design mainly focuses on fully employing the range enhancement of directional communication in the multi-hop environment. Beside that, our protocol can alleviate the hidden/exposed terminal problems and node deafness, which remain unsolved in many directional MAC protocols. We implement our protocol in the OPNET environment and study the parameters to optimize its performance. Our preliminary simulation results indicate that our protocol works well and achieves considerably high throughput and low delay in both sparse and dense ad hoc networks.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121105604","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}
{"title":"CST: P2P Anonymous Authentication System Based on Collaboration Signature","authors":"Xiaoliang Wang, Xingming Sun, Guang Sun, Dong Luo","doi":"10.1109/FUTURETECH.2010.5482740","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482740","url":null,"abstract":"Anonymity has received increasing attention in the literature due to the users' awareness of their privacy nowadays. While anonymity related issues have been extensively studied in peer-to-peer (P2P) systems, numerous concerns have been raised about the issue of providing authentic partners in P2P systems. In addition, the network authority requires controlled anonymity so that misbehaving entities in the network remain traceable. We are working on seeking novel and more effective methods to control anonymity, authentication and traceability. In this paper, we propose a security architecture to ensure anonymity and authentication for honest users and keep traceability for misbehaving users in P2P systems. We use Collaboration Signature Trust (CST) to resolve the conflicts among anonymity, authentication and traceability. Security analysis shows that the CST can perfectly solve tradeoff between anonymity, authentication and traceability.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133771051","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}
Rung-Shiang Cheng, Der-Jiunn Deng, H. Chao, Whai-En Chen
{"title":"An Adaptive Bandwidth Estimation Mechanism for SCTP over Wireless Networks","authors":"Rung-Shiang Cheng, Der-Jiunn Deng, H. Chao, Whai-En Chen","doi":"10.1109/FUTURETECH.2010.5482732","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482732","url":null,"abstract":"A wireless link is generally characterized by high transmission errors, random interference and a varying latency. The erratic packet losses usually lead to a curbing of flow segments on the SCTP association and thus limit SCTP's performance. To improve the performance of SCTP protocol under high-speed environments over wireless networks, a bandwidth estimation mechanism and a per-stream-based error recovery mechanism is applied to modified SCTP protocol. The simulation results confirmed that the proposed scheme can improve the performance of SCTP over wireless networks.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132293804","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}
{"title":"Design Framework to Optimize Power Consumption and Latency Delay for Sensor Nodes Using Min(N, T) Policy M/G/1 Queuing Models","authors":"Fuu-Cheng Jiang, Chao-Tung Yang, Kuo-Hsiung Wang, Der-Chen Huang","doi":"10.1109/FUTURETECH.2010.5482757","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482757","url":null,"abstract":"To prolong the lifetime of sensor nodes, most research works have focused on how to tune the duty cycling schemes among nodes to save the communication cost using multifarious wake-up strategies. To this aim, we propose a novel design strategy for mitigating average power consumption of sensor node using the Min(N, T) policy M/G/1 queuing theory. There is a heavy overhead for packet collisions and channel contention resulting from restarting the process of medium contention. The basic point of our approach is that Min(N, T) dyadic policy would mitigate the total average times of medium contention by having both a counter (N) and a timer (T) for the control of triggering on a radio server to transmit queued packets, and then power consumption of communication can be alleviated. We show how the improvement level on power consumption can be achieved through analytical and simulated results. To meet the mission requirements in sensor networks, the proposed add-on power saving technique can also provide a design framework for the sensor network manager to optimize relevant system parameters including power consumption and latency delay.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"19 41","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113962759","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}
{"title":"Assistance Instruments Detection Using Geometry Constrained Knowledge for Health Care Centers","authors":"Chin-Wen Wu, Chin-De Liu, P. Chung","doi":"10.1109/FUTURETECH.2010.5482662","DOIUrl":"https://doi.org/10.1109/FUTURETECH.2010.5482662","url":null,"abstract":"A walking frame and wheelchair detection system that uses geometry constrained knowledge is proposed for health care centers. The system can early detect an accident occur when the elderly get on bed. Based on the space relative constrained, accurate results are obtained for wheelchair position detection. A tracking algorithm is utilized to track and predict wheelchair motion with orientation. The developed approach has been applied for the early detection accidents in a health care center. Experiment results show that the algorithm obtains desirable performance and accuracy.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114651957","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}