{"title":"NAND FLASH based three-tier fault-tolerant storage strategy","authors":"Jian Song, Bing He","doi":"10.1109/ANTHOLOGY.2013.6784969","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784969","url":null,"abstract":"This paper proposes a NAND FLASH based three-tier fault-tolerant storage strategy. Based on the hardware properties of NAND FLASH, the strategy is to add corresponding strategies according to different levels, to improve the fault tolerance capacity of NAND FLASH effectively, and to provide higher security for the stored data. Designed with experimental analysis under the condition of high demand for data security in this paper, it can be seen that the strategy can provide higher fault tolerance capacity.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115284332","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}
Toshiaki Shimada, R. Nisimura, Masayasu Tanaka, Hideki Kawahara, T. Irino
{"title":"Developing a method to build Japanese speech recognition system based on 3-gram language model expansion with Google database","authors":"Toshiaki Shimada, R. Nisimura, Masayasu Tanaka, Hideki Kawahara, T. Irino","doi":"10.1109/ANTHOLOGY.2013.6784781","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784781","url":null,"abstract":"We have developed a method to build a Japanese automatic speech recognition (ASR) system based on 3-gram language model expansion with the Google database. Our aim is to enhance the recognition accuracy of ASR systems based on the 3-gram language model, even in cases where the language model is trained using short text segments. We investigate a practical approach to expanding language models by using 3-gram information from external web documents. In addition, we filter 3-gram entries on the basis of term frequency-inverse document frequency (TF-IDF) scores and the output of the Yahoo! web API to prevent the unnecessary addition of redundant or irrelevant 3-gram entries. In the experiments, we achieved an improvement of 0.71% in the word error rate and proved that the recognition accuracy can be improved by combining the proposed method and the traditional back-off smoothing technique without any costs being incurred in collecting additional text for training the model.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116199160","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":"Based on multi-outputs support vector regression emergency casualties prediction","authors":"Zhao Yibing, Gao Hongni, Feng Shao-bo","doi":"10.1109/ANTHOLOGY.2013.6785024","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6785024","url":null,"abstract":"The frequent emergencies have inflicted the huge casualties and property losses. In the recent years, the casualty prediction models which some domestic scholars have established are mostly consist of a single factor or a small number of factors. In this paper, multi-output support vector regression is applied to respectively predict personnel mortality and injury rates on the former and the basis of considering a variety of factors. The meaning is to provide the scientific basis of rescue operations.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116200501","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":"The reliability algorithm based on binary neural networks","authors":"Juan Yang, Yang Lu, Qiang Wang, Lei Yu","doi":"10.1109/ANTHOLOGY.2013.6784859","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784859","url":null,"abstract":"According to the limitation in the research of reliability, this paper, starting from the generality of complex systems, firstly converts the system components into the linear combination by training the binary neural network, secondly we solve the distribution function of the linear combination. With this method, this paper finally gets a general method to analyse the reliability of arbitrary systems. Finally, this paper gives its theoretical guarantee and this method is also validated through examples.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115216759","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":"Algorithm of group members' consensus orienting to discussion dynamic process","authors":"Zhang Zhen, Chen Chao, Chen Jun-liang","doi":"10.1109/ANTHOLOGY.2013.6784904","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784904","url":null,"abstract":"In the course of group discussion, the consensus value is important for analysis of consensus state of group discussion. This paper discusses an algorithm for calculating consensus value based on cluster analysis and the value of modality. Finally, a numerical example shows that the method is feasible and effective.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115313748","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":"New relaxation algorithm for three-dimensional assignment problem","authors":"Qian Gao, Hailin Zou, Xinming Zhang, Li Zhou","doi":"10.1109/ANTHOLOGY.2013.6784972","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784972","url":null,"abstract":"The valid solution algorithm for multi-dimensional assignment problem is a difficult point in optimization field. This paper proposes a new relaxation algorithm to solve three-dimensional assignment problem by fusing a certain number of good solutions of 2-dimensional (2-D) assignment problems which are relaxed from 3-D assignment problem. The new algorithm constructs the optimal solution by assigning the solution components with high frequency appearing in the good solutions of 2-D assignment problems according to an order from high to low under feasible constraints. So the calculation complexity is decreased, and the data association accuracy of targets is improved to some extent. Simulation results show that the new algorithm is feasible and effective.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115763938","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":"Research on a new clustering algorithm in data mining","authors":"Tan Zhongbing","doi":"10.1109/ANTHOLOGY.2013.6784990","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784990","url":null,"abstract":"Data mining is one of the leading fields in the combination area of database and decision supporting, and clustering is a significant task for data mining, in which clustering algorithm is the core technology. The new clustering method based on genetic algorithm and gradient descent method (G-G clustering algorithm) is proposed in this paper. Genetic algorithm has the advantages of global searching and strong robustness, and will not getting stuck at local optimal values. Unfortunately, it can only reach the near-optimal value after many generations of selection, crossover and mutation. Therefore, gradient descent method is utilized at the end of genetic algorithm based clustering method to get global optimal values. Clustering results of two groups of experimental data show that the new clustering method is one with global optimal, and the results is evidently better than k-means clustering method.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123482286","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 of TVP5150 controller based on FPGA","authors":"Juan Li, Yan-ying Liu","doi":"10.1109/ANTHOLOGY.2013.6784942","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784942","url":null,"abstract":"In this paper, a design of TVP5150 controller based on FPGA (Field Programmable Gate Array) is proposed. This design uses the series of VIRTEX-4 XC4VSX25 chip to control the video decoder TVP5150. FPGA initialized video decoder TVP5150 via IIC bus standard. In order to decode the video data, the input channel, working state and the output data format of TVP5150 should be configured. In this paper, it describes the method of initializing TVP5150 through FPGA based on IIC bus. And then, introduce the format of ITU-R BT.656 of the output video data and the way of extracting the available data from ITU-R BT.656.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121158369","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 and analysis of an EPC discovery service based randomized architecture","authors":"Zhou Hongtao, Wang Dong","doi":"10.1109/ANTHOLOGY.2013.6784774","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6784774","url":null,"abstract":"Concept of Internet of Things has been proposed by professor Ashton from MIT Auto-ID for the first time, EAN and UCC established a none-profit organization EPCglobal, a lot of standards established to make the relative application canonical, aims to raise visibility in supply chains by enabling interested parties to query item-level data. EPCglobal defines EPC-IS, EPC-ONS, DTD, DTS etc. in its architecture but the standard of EPC-DS hasn't been proposed. EPC-IS stores the data of commodities which are delivered in supply chain, different companies own their own specific EPC-IS server and diverse data formats. The trend of Application scale is massive, data magnanimity and distributed, a lot of upper system services depend on historical data, so a reliable, high performance and efficiency data discovery mechanism is very important. Centralized discovery model is not suit for handling large number of requests, so it's a bottle-neck of application possibly; Chain discovery model exists risks of chain-breaking problems and single node failure, these problems could influence the stabilization of system; Net discovery model maintains the stabilization of system by increasing the auxiliary paths, but the complexity of space is too large, so it possibly doesn't suit for massive application; Distributed discovery model can not only maintains stabilization of system but also has a high performance and efficiency, Chord is a distributed mechanism which offers less complexity of space then Net model and gains a very considerable efficiency in average nodes searching. This paper propose a distributed discovery mechanism base on randomized architecture which offers performance of complexity of space as same as Chord and less cost of average nodes searching than Chord, and this mechanism can handles the chain-breaking problems and single node failure to offer a stable, robust discovery service.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121479845","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}
Qingyuan Sun, Tao Mei, Lingcheng Kong, Zhihua Zhang
{"title":"ZigBee temperature monitoring system based on Wireless Sensor Network","authors":"Qingyuan Sun, Tao Mei, Lingcheng Kong, Zhihua Zhang","doi":"10.1109/ANTHOLOGY.2013.6785014","DOIUrl":"https://doi.org/10.1109/ANTHOLOGY.2013.6785014","url":null,"abstract":"In the paper, a simple Wireless Sensor Network Monitoring System was built based on the Chip CC2530 of TI and ZigBee protocol stack. The paper is mainly targeted at the construction of the ZigBee network and the configuration of the logical type of nodes in the program; it also introduced the composition of ZigBee network node, as well as the function of the Wireless Sensor Network Monitoring System.","PeriodicalId":203169,"journal":{"name":"IEEE Conference Anthology","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124557516","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}