{"title":"Applicable Prospects of Eye Tracking Technology in the Research of Landscape Visual Perception","authors":"Xiaoyu Chen, Lifang Qiao","doi":"10.14257/IJMUE.2015.10.10.12","DOIUrl":"https://doi.org/10.14257/IJMUE.2015.10.10.12","url":null,"abstract":"This paper mainly adopts the literature research method, which analyzes the application progress and development overview of the eye tracking technology, as well as the technical features of the eye tracking devices. Combined with the research needs in landscape visual perception, eye tracking technology have application values in the following aspects: landscape attractiveness analysis, safety design of landscape environment, usability design of landscape facilities, landscape perception in motion, quality improvement of landscape information interface, cognitive analysis of physiological vulnerable groups and quality improvement of landscape education. Eyetracking technology should be used reasonably in the study so as to exploit its advantages to the full and correct its deficiencies. The development of hardware technology and software technology of eye-tracking offers a new perspective and study platform for the study on landscape visual perception, which contributes to improving the scientificity of the study on landscape visual perception.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"13 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131754625","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 Review of Virtual Anchor Node Technology: Construction and Application","authors":"Zhang Hong-lie, Li Cheng, Zhao Xin, Liu Yan-Ju","doi":"10.14257/IJMUE.2015.10.4.13","DOIUrl":"https://doi.org/10.14257/IJMUE.2015.10.4.13","url":null,"abstract":"The localization accuracy of the wireless sensor network node is improved by introducing the virtual anchor node, so the virtual anchor node is constructed and applied by many researchers to optimize the localization algorithm further. This paper presents the broad definition of the virtual anchor node and indicates its significance in the wireless sensor network node localization; the wireless sensor network node localization algorithm based on the virtual anchor node is introduced mainly in two aspects of constructing the virtual anchor node and its application in localization. The scheme for constructing the virtual anchor node includes the random construction method, the geometric constraint method, the node upgrade method, the network training method, etc. And the scheme for its application in localization includes the model reconstruction method, the rank sequence method, etc. By making a concrete analysis of the localization scheme based on the virtual anchor node, its future research prospect and its application development trend are put forward.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133689204","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 SVM based Uyghur Text Classification and its Performance Analysis","authors":"Palidan Tuerxun, Dingyi Fang, Hamdulla Askar","doi":"10.14257/IJMUE.2015.10.4.27","DOIUrl":"https://doi.org/10.14257/IJMUE.2015.10.4.27","url":null,"abstract":"This paper mainly explores the use of Support Vector Machines (SVMs) for Uyghur text classification, presents the process of text categorization: Text preprocessing, feature dimensionality reduction, representation method and classification of text features etc., discusses the SVMs classification algorithm in the application of Uyghur text classification. Focus on the construction of text categorization model and its procedures. Experiment results show that training by using the selected training data with the guarantee of the performance of the classifier, has higher efficiency than other nearest neighbor classifier (KNN), Naive Bayes (NB) classifier with increased accuracy.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132344095","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":"Hyperspectral Image Compression and Reconstruction Based on Compressed Sensing","authors":"Xu Cheng, Daqing Huang, Han Wei","doi":"10.14257/IJMUE.2015.10.2.32","DOIUrl":"https://doi.org/10.14257/IJMUE.2015.10.2.32","url":null,"abstract":"According to the characteristics of hyperspectral images, a novel compression and reconstruction algorithm for hyperspectal images based on compressed sensing is proposed. The random measurements of each image and the linear prediction coefficients are made at the encoder, and then transmitted sequentially to the decoder. At the decoder, in terms of apparent correlations between the adjacent spectral bands, a de-correlation algorithm based on block linear prediction model is used in reconstruction process. The inter-band redundancies are removed from the measurements of current image, thus the de-correlation image data is sparser, which can be reconstructed easily. Experimental results show that the proposed algorithm achieves improved reconstruction performance and efficiently reduces the cost of computation at the encoder, which is more suitable for hardware implementation.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133147803","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 Study of Efficient Connection using Mobility Property in Mobile Ad-hoc Network","authors":"Young-jun Oh, Kang-whan Lee","doi":"10.14257/IJMUE.2014.9.12.02","DOIUrl":"https://doi.org/10.14257/IJMUE.2014.9.12.02","url":null,"abstract":"In this paper, we proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Networks. Existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. This proposed algorithm forms cluster formation using a range of direction and threshold of velocity by base-station, and we calculate exchange cluster head node probability using direction and velocity for maintaining cluster formation. DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes. In response to maintain cluster formation, we prove a continuous connection between nodes.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134635245","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 Fast Multi-level Layout for Social Network Visualization","authors":"Xiaolin Du, Yunming Ye, Yueping Li, Ge Song","doi":"10.14257/IJMUE.2014.9.12.16","DOIUrl":"https://doi.org/10.14257/IJMUE.2014.9.12.16","url":null,"abstract":"We describe a fast multi-level layout for visualizing social networks, which can visualize social networks high quality and rapidly. There are two innovations in our fast multi-level layout. Firstly, we proposed a new graph multi-layered compression method based on random walk. The multi-layered compression process groups vertices to form “planet” systems and then abstract these “planet” systems as new vertices to define a new graph and is repeated until the graph size falls below some threshold. And we also proposed a new single level force-directed layout based on sampling. The multi-level layout process can be accelerated based on these two innovations. Finally, we have evaluated our layout on several well-known data sets. The experimental results show that our layout outperforms the state-ofthe-art method.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132886703","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":"Continues Blood Pressure Measurement and Data Logging Device with SMS Alert","authors":"M. Chaithanya, K. Kishore, Avireni Srinivasulu","doi":"10.14257/IJMUE.2014.9.8.03","DOIUrl":"https://doi.org/10.14257/IJMUE.2014.9.8.03","url":null,"abstract":"This paper presents a new blood pressure (BPs) measurement and data logging device which can be extensively used for ICU patients who are intended for a period of observation. The main purpose of this paper is to know about the changes in BP with respect to time and changes in the food taken by patient who are under observation. If any abnormal changes occur in the BP then the system alerts using a buzzer and it also sends a message to a predefined number (i.e., a physician number) using GSM. If not for each and every second it saves the data into SDcard in a file format, therefore appropriate steps can be taken in accordance with the changes in BP. The paper also took care of layman towards BP inorder to understand everyone even without the help of physician. This paper follows a Non-invasive type of BP measuring technique i.e., volume oscillometric method. Through the developed algorithm the BP measured is more accurate which is compared to the readings measured by sphygmomanometer. This system could be made with the features like cost effective, less complex, more reliable and easy to access.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133026338","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":"Power Efficient Dynamic Source Routing Protocol","authors":"S. Mishra, B. K. Pattanayak","doi":"10.14257/IJMUE.2014.9.7.16","DOIUrl":"https://doi.org/10.14257/IJMUE.2014.9.7.16","url":null,"abstract":"Power consumption in wireless ad hoc networks is an important design concern in the modern network research scenario. It is a concern because wireless nodes run with the help of battery and it has a limited life time period If the power failure of mobile node occurs it affects not only its ability to forward packets to destination but also its ability to forward packets on behalf of others and hence overall network lifetime. Moreover, it is very difficult to replace or recharge a mobile node powered by batteries so in order to maximize the life time of nodes routing of traffic should be in such a way that power consumption is minimized. Hence, every effort is to be channeled towards reducing power. More precisely, network lifetime is a key design metric in MANETs. Our main contribution in this thesis is Power Efficient Dynamic Source Routing (PEDSR) protocol, satisfying less power consumption from the viewpoints of nodes and network. To achieve our goal, first, we studied DSR protocol using performance and power aware metrics. Modifications are done on the Dynamic Source Routing (DSR) protocol by taking into consideration the outcomes of the pre-simulation, the existing feature of DSR for implementation of the design, and the previous research works done on DSR routing protocol by many researchers. Subsequently, we studied the performance evaluation of our proposition. The simulation results show that the power aware routing protocol, PEDSR outperforms the original DSR protocol in majority of the scenarios and evaluation metrics.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134584831","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":"Virtual Sender-based Message Logging for Large-scale Ubiquitous Sensor Network Systems","authors":"Jinho Ahn","doi":"10.14257/IJMUE.2014.9.5.04","DOIUrl":"https://doi.org/10.14257/IJMUE.2014.9.5.04","url":null,"abstract":"Sender-based message logging can considerably lower high failure-free overhead of receiver-based message logging resulting from synchronously logging each message into stable storage by using volatile memory of its sender as storage for logging. This beneficial feature can be obtained at the expense of extra communication costs required for allowing message senders to get receive sequence numbers of the messages from their receivers and confirm them with the receivers and slowness and complexity of recovery of each failed process coming from its obtaining message log from the corresponding senders. However, attempting to apply sender-based message logging into large-scale ubiquitous sensor networks requires reducing the number of messages passing on core networks during its message logging and recovery procedures. This paper presents a scalable virtual senderbased message logging algorithm to solve this problem by enabling the broker elected in a group of nodes as virtual sender to localize both of the logging and recovery procedures to a maximum. We show how this algorithm can guarantee the system consistency in case of sequential failures and perform better than the conventional one in terms of message overhead.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132859132","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":"DIVE-C: Distributed-parallel Virtual Environment on Cloud Computing Platform","authors":"In-Yong Jung, Byong-John Han, Hanku Lee, C. Jeong","doi":"10.14257/IJMUE.2013.8.5.03","DOIUrl":"https://doi.org/10.14257/IJMUE.2013.8.5.03","url":null,"abstract":"In social media services and social network services, it is necessary to collect, analyze and process their big data with low maintenance cost. Therefore, distributed-parallel data processing on cloud platform is getting spotlight as useful solution for them. In this paper, we present a new architecture of DIVE-C: DIstributed-parallel Virtual Environment on Cloud computing platform for distributed parallel data processing applications which offers a transparent virtual computing environment in order to provide a way easy to launch user’s distributed parallel applications. It hides the complexity of the cloud, and helps users to focus on their new applications and core services. DIVE-C uses agent-based resource management scheme to configure VM resources and application deployment for offering various distributed-parallel application models. VM resources are automatically provided by unified cloud management layer. Furthermore, an easy-to-use web interface of DIVE-C offers convenience to users. We implemented a prototype of DIVE-C, and its experiment results show the competitive performance of DIVE-C for dynamic resource and virtual computing environment provisioning for various data processing models.","PeriodicalId":162936,"journal":{"name":"International Conference on Multimedia and Ubiquitous Engineering","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132425368","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}