Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814705
K. Kishore, M. Mallesh, G. Jyostna, P. R. L. Eswari, S. S. Sarma
In the recent times, most of the systems connected to Internet are getting infected with the malware and some of these systems are becoming zombies for the attacker. When user knowingly or unknowingly visits a malware website, his system gets infected. Attackers do this by exploiting the vulnerabilities in the web browser and acquire control over the underlying operating system. Once attacker compromises the users web browser, he can instruct the browser to visit the attackers website by using number of redirections. During the process, users web browser downloads the malware without the intervention of the user. Once the malware is downloaded, it would be placed in the file system and responds as per the instructions of the attacker. These types of attacks are known as Drive by Download attacks. Now-a-days, Drive by Download is the major channel for delivering the Malware. In this paper, Browser JS Guard an extension to the browser is presented for detecting and defending against Drive by Download attacks via HTML tags and JavaScript.
{"title":"Browser JS Guard: Detects and defends against Malicious JavaScript injection based drive by download attacks","authors":"K. Kishore, M. Mallesh, G. Jyostna, P. R. L. Eswari, S. S. Sarma","doi":"10.1109/ICADIWT.2014.6814705","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814705","url":null,"abstract":"In the recent times, most of the systems connected to Internet are getting infected with the malware and some of these systems are becoming zombies for the attacker. When user knowingly or unknowingly visits a malware website, his system gets infected. Attackers do this by exploiting the vulnerabilities in the web browser and acquire control over the underlying operating system. Once attacker compromises the users web browser, he can instruct the browser to visit the attackers website by using number of redirections. During the process, users web browser downloads the malware without the intervention of the user. Once the malware is downloaded, it would be placed in the file system and responds as per the instructions of the attacker. These types of attacks are known as Drive by Download attacks. Now-a-days, Drive by Download is the major channel for delivering the Malware. In this paper, Browser JS Guard an extension to the browser is presented for detecting and defending against Drive by Download attacks via HTML tags and JavaScript.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123694892","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}
Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814679
A. Aswini, P. Vinod
In this paper, we propose static analysis of android malware files by mining prominent permissions. The proposed technique is implemented by extracting permissions from 436 .apk files. Feature pruning is carried out to investigate the impact of feature length on accuracy. The prominent features that give way to lesser misclassification are determined using Bi-Normal Separation (BNS) and Mutual Information (MI) feature selection techniques. Results suggest that Droid permission miner can be used for preliminary classification of Android package files.
{"title":"Droid permission miner: Mining prominent permissions for Android malware analysis","authors":"A. Aswini, P. Vinod","doi":"10.1109/ICADIWT.2014.6814679","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814679","url":null,"abstract":"In this paper, we propose static analysis of android malware files by mining prominent permissions. The proposed technique is implemented by extracting permissions from 436 .apk files. Feature pruning is carried out to investigate the impact of feature length on accuracy. The prominent features that give way to lesser misclassification are determined using Bi-Normal Separation (BNS) and Mutual Information (MI) feature selection techniques. Results suggest that Droid permission miner can be used for preliminary classification of Android package files.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129145889","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}
Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814684
H. Ketmaneechairat, Phanuwat Yoksiri, Thitisak Jaisiri
Recently, the travel guides have become an important tool to support tourists around the world. The tourists will search the tourist attraction and travel information from the book, brochure or website. In this paper, the searching application for Southern Thailand Travel Guide on iPhone is proposed. The proposed application is developed to search for travel guide information on different provinces of the Southern Thailand. The searching application function is divided into two modes: online and offline mode. The language can be displayed in two languages: Thai and English language. This paper presents the design and implementation by using Apple's iOS Software Development Kit. The results show that the tourists can search tourist attraction including history, picture, address, phone number, website, map and travel detail. The maps can show the current location of the users. In addition, these maps can display in three modes: standard, satellite and hybrid. Overall information on tourist attraction can be shared on Facebook, Twitter and E-mail. The proposed application is better support for the foreign tourists and Thai tourists that they are used iPhone mobile.
{"title":"Searching application for Southern Thailand Travel Guide on iPhone","authors":"H. Ketmaneechairat, Phanuwat Yoksiri, Thitisak Jaisiri","doi":"10.1109/ICADIWT.2014.6814684","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814684","url":null,"abstract":"Recently, the travel guides have become an important tool to support tourists around the world. The tourists will search the tourist attraction and travel information from the book, brochure or website. In this paper, the searching application for Southern Thailand Travel Guide on iPhone is proposed. The proposed application is developed to search for travel guide information on different provinces of the Southern Thailand. The searching application function is divided into two modes: online and offline mode. The language can be displayed in two languages: Thai and English language. This paper presents the design and implementation by using Apple's iOS Software Development Kit. The results show that the tourists can search tourist attraction including history, picture, address, phone number, website, map and travel detail. The maps can show the current location of the users. In addition, these maps can display in three modes: standard, satellite and hybrid. Overall information on tourist attraction can be shared on Facebook, Twitter and E-mail. The proposed application is better support for the foreign tourists and Thai tourists that they are used iPhone mobile.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"140 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123632328","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}
Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814670
S. Kuzhalvaimozhi, G. R. Rao
Cloud computing is one of the emerging computing technology where costs are directly proportional to usage and demand. The advantages of this technology are the reasons of security and privacy problems. The data belongs to the users are stored in some cloud servers which is not under their own control. So the cloud services are required to authenticate the user. In general, most of the cloud authentication algorithms do not provide anonymity of the users. The cloud provider can track the users easily. The privacy and authenticity are two critical issues of cloud security. In this paper, we propose a secure anonymous authentication method for cloud services using identity based group signature which allows the cloud users to prove that they have privilege to access the data without revealing their identities.
{"title":"Privacy protection in cloud using identity based group signature","authors":"S. Kuzhalvaimozhi, G. R. Rao","doi":"10.1109/ICADIWT.2014.6814670","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814670","url":null,"abstract":"Cloud computing is one of the emerging computing technology where costs are directly proportional to usage and demand. The advantages of this technology are the reasons of security and privacy problems. The data belongs to the users are stored in some cloud servers which is not under their own control. So the cloud services are required to authenticate the user. In general, most of the cloud authentication algorithms do not provide anonymity of the users. The cloud provider can track the users easily. The privacy and authenticity are two critical issues of cloud security. In this paper, we propose a secure anonymous authentication method for cloud services using identity based group signature which allows the cloud users to prove that they have privilege to access the data without revealing their identities.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123174830","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}
Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814697
Z. Adhoni, H. Hamad, Zaheer Ahmed Adhoni
In this paper, we describe the Research and development of a portal using Drupal technology on cloud. The main focus is on designing a portal for Quran Application using Drupal which can be a center of learning resource for various users and can be hosted on cloud. It includes different features which are useful as a knowledge center. Its features can also be used by any internet enable device which can be a deemed as modern application. The quality and assurance of Quran Text is also taken into consideration. It also promotes for research and development of new tools and applications with the provision of API. This paper provides an account of Search API and API.
{"title":"An API for Quran portal using Drupal technology","authors":"Z. Adhoni, H. Hamad, Zaheer Ahmed Adhoni","doi":"10.1109/ICADIWT.2014.6814697","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814697","url":null,"abstract":"In this paper, we describe the Research and development of a portal using Drupal technology on cloud. The main focus is on designing a portal for Quran Application using Drupal which can be a center of learning resource for various users and can be hosted on cloud. It includes different features which are useful as a knowledge center. Its features can also be used by any internet enable device which can be a deemed as modern application. The quality and assurance of Quran Text is also taken into consideration. It also promotes for research and development of new tools and applications with the provision of API. This paper provides an account of Search API and API.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127540678","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}
When a user accesses a resource, the accounting process at the server side does the job of keeping track of the resource usage so as to charge the user. In cloud computing, a user may use more than one service provider and need two independent service providers to work together. In this user-centric context, the user is the owner of the information and has the right to authorize to a third party application to access the protected resource on the user's behalf. Therefore, the user also needs to monitor the authorized resource usage he granted to third party applications. However, the existing accounting protocols were proposed to monitor the resource usage in terms of how the user uses the resource from the service provider. This paper proposed the user-centric accounting model called AccAuth which designs an accounting layer to an OAuth protocol. Then the prototype was implemented, and the proposed model was evaluated against the standard requirements. The result showed that AccAuth passed all the requirements.
{"title":"AccAuth: Accounting system for OAuth protocol","authors":"Utharn Buranasaksee, Kriengkrai Porkaew, Umaporn Supasitthimethee","doi":"10.1109/ICADIWT.2014.6814698","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814698","url":null,"abstract":"When a user accesses a resource, the accounting process at the server side does the job of keeping track of the resource usage so as to charge the user. In cloud computing, a user may use more than one service provider and need two independent service providers to work together. In this user-centric context, the user is the owner of the information and has the right to authorize to a third party application to access the protected resource on the user's behalf. Therefore, the user also needs to monitor the authorized resource usage he granted to third party applications. However, the existing accounting protocols were proposed to monitor the resource usage in terms of how the user uses the resource from the service provider. This paper proposed the user-centric accounting model called AccAuth which designs an accounting layer to an OAuth protocol. Then the prototype was implemented, and the proposed model was evaluated against the standard requirements. The result showed that AccAuth passed all the requirements.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121569346","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}
Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814664
R. Nair
Shape modeling is an active area of research in Computer Graphics and Computer Vision. Shape models aid in the representation and recognition of arbitrarily complex shapes. This paper proposes a fast and computationally efficient narrow band level set algorithm for recovering arbitrary shapes of objects from various types of image data. The overall computational cost is reduced by using a five grid point wide narrow band applied on a variational level set formulation that can be easily implemented by simple finite difference scheme. The proposed method is more efficient and has many advantages when compared to traditional level set formulations. The periodical reinitialization of the level set function to a signed distance function is completely avoided. Implementation by simple finite difference scheme reduces computational complexity and ensures faster curve evolution. The level set function is initialized to an arbitrary region in the image domain. The region based initialization is computationally more efficient and flexible. This formulation can form the basis of a shape modeling scheme for implementing solid modeling techniques on free form shapes set in a level set framework. The proposed method has been applied to extract shapes from both synthetic and real images including some low contrast medical images, with promising results.
{"title":"A fast narrow band level set formulation for shape extraction","authors":"R. Nair","doi":"10.1109/ICADIWT.2014.6814664","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814664","url":null,"abstract":"Shape modeling is an active area of research in Computer Graphics and Computer Vision. Shape models aid in the representation and recognition of arbitrarily complex shapes. This paper proposes a fast and computationally efficient narrow band level set algorithm for recovering arbitrary shapes of objects from various types of image data. The overall computational cost is reduced by using a five grid point wide narrow band applied on a variational level set formulation that can be easily implemented by simple finite difference scheme. The proposed method is more efficient and has many advantages when compared to traditional level set formulations. The periodical reinitialization of the level set function to a signed distance function is completely avoided. Implementation by simple finite difference scheme reduces computational complexity and ensures faster curve evolution. The level set function is initialized to an arbitrary region in the image domain. The region based initialization is computationally more efficient and flexible. This formulation can form the basis of a shape modeling scheme for implementing solid modeling techniques on free form shapes set in a level set framework. The proposed method has been applied to extract shapes from both synthetic and real images including some low contrast medical images, with promising results.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122878159","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}
Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814693
G. Violettas, Kyriakos Papadopoulos
This paper describes the password habits of web users, particularly in Greece. A study was conducted online to ask users questions about the length of the password they use today, in how many web sites they use the same password, whether they use personal data while constructing their passwords and if they ever used as a password some of trivial words. They were also asked whether they reveal their password(s) to friends and/or family and if they ever realized that their password was exposed or revealed to an attacker and the measures they took after that. Additionally, an extended literature review about password habits and effectiveness regarding length and complexity is included. At the end of the paper, for first time in Greece, there is a list of the 100 passwords that Greek users should absolutely avoid using due to the ease of guessing or weak complexity, short length or simply because they exist in every dictionary used for password attacks in the wild.
{"title":"Passwords to absolutely avoid","authors":"G. Violettas, Kyriakos Papadopoulos","doi":"10.1109/ICADIWT.2014.6814693","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814693","url":null,"abstract":"This paper describes the password habits of web users, particularly in Greece. A study was conducted online to ask users questions about the length of the password they use today, in how many web sites they use the same password, whether they use personal data while constructing their passwords and if they ever used as a password some of trivial words. They were also asked whether they reveal their password(s) to friends and/or family and if they ever realized that their password was exposed or revealed to an attacker and the measures they took after that. Additionally, an extended literature review about password habits and effectiveness regarding length and complexity is included. At the end of the paper, for first time in Greece, there is a list of the 100 passwords that Greek users should absolutely avoid using due to the ease of guessing or weak complexity, short length or simply because they exist in every dictionary used for password attacks in the wild.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131107140","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}
Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814692
L. Tian, Jianbo Wang
In this paper, we propose a novel carrier frequency offset estimation algorithm in Binary Phase Shift Keying (BPSK) burst transmission based on pilot symbols and modulated data symbols. Its estimation range is large, about ±0.5 of the symbol rate. The simulation results show that this algorithm has low SNR threshold, and its estimation mean square error (MSE) is close to Cramer-Rao Lower Bound (CRLB). The algorithm's computational complexity is low and it is very suitable for practical application.
{"title":"An algorithm for carrier frequency offset estimation in BPSK burst transmission","authors":"L. Tian, Jianbo Wang","doi":"10.1109/ICADIWT.2014.6814692","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814692","url":null,"abstract":"In this paper, we propose a novel carrier frequency offset estimation algorithm in Binary Phase Shift Keying (BPSK) burst transmission based on pilot symbols and modulated data symbols. Its estimation range is large, about ±0.5 of the symbol rate. The simulation results show that this algorithm has low SNR threshold, and its estimation mean square error (MSE) is close to Cramer-Rao Lower Bound (CRLB). The algorithm's computational complexity is low and it is very suitable for practical application.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133070705","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}
Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814665
S. Chaudhari, R. Biradar
Ever increasing demand for streaming applications transfer data in real-time over Mobile Ad hoc NETworks (MANETs). These transmission estimates Available Bandwidth (ABW) at each node before transmission in MANETs as channel is shared. The ABW mainly depends on the channel utilization which can be improved by minimizing packet losses. Researchers proposed many techniques to minimize the packet losses by developing models for synchronized idle period at sender-receiver pair before data transfer, collision probability and random waiting. In this paper, we propose a scheme of estimating ABW in MANETs using similar but modified models. The idle period synchronization model of previous work uses parameters of various node state for actual workload, channel utilization at optimal workload and collision rate at optimal workload instead of actual. We use the actual channel utilization and collision rate. The collision probability model of previous work uses same Lagrange Interpolation polynomial irrespective of node behavior. We compute separate Lagrange Interpolation polynomial at each node according to node behavior dynamically. The random waiting time calculated in previous work does not consider all waiting time statistics which is added in our model of random waiting time calculation. The ABW estimated by our scheme is approximately 19.99% more accurate compare to the recent work done by other researchers. As we are computing Lagrange Interpolation polynomial at each node dynamically, evidently it adds computation overhead which is ignored as our goal is towards accuracy of ABW but optimized for speed in future.
{"title":"Collision probability based Available Bandwidth estimation in Mobile Ad Hoc Networks","authors":"S. Chaudhari, R. Biradar","doi":"10.1109/ICADIWT.2014.6814665","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814665","url":null,"abstract":"Ever increasing demand for streaming applications transfer data in real-time over Mobile Ad hoc NETworks (MANETs). These transmission estimates Available Bandwidth (ABW) at each node before transmission in MANETs as channel is shared. The ABW mainly depends on the channel utilization which can be improved by minimizing packet losses. Researchers proposed many techniques to minimize the packet losses by developing models for synchronized idle period at sender-receiver pair before data transfer, collision probability and random waiting. In this paper, we propose a scheme of estimating ABW in MANETs using similar but modified models. The idle period synchronization model of previous work uses parameters of various node state for actual workload, channel utilization at optimal workload and collision rate at optimal workload instead of actual. We use the actual channel utilization and collision rate. The collision probability model of previous work uses same Lagrange Interpolation polynomial irrespective of node behavior. We compute separate Lagrange Interpolation polynomial at each node according to node behavior dynamically. The random waiting time calculated in previous work does not consider all waiting time statistics which is added in our model of random waiting time calculation. The ABW estimated by our scheme is approximately 19.99% more accurate compare to the recent work done by other researchers. As we are computing Lagrange Interpolation polynomial at each node dynamically, evidently it adds computation overhead which is ignored as our goal is towards accuracy of ABW but optimized for speed in future.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"2005 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123907054","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：