{"title":"An Investigation of Bluetooth Security Threats","authors":"M. Tan, Kathrine Aguilar Masagca","doi":"10.1109/ICISA.2011.5772388","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772388","url":null,"abstract":"Bluetooth, which offers users the mobility to convenient, low-cost, short-ranged connections with up to seven other Bluetooth-enabled devices, has been widely adopted especially by young adults. However, Bluetooth-enabled networks have similar security weaknesses as any other digital networks. Instilling security awareness and implementing preventive measures, responsibilities of both the device manufacturers and the users, are essential to prevent harmful security breaches that may affect data and financial loss as a consequence of identity theft. This paper investigates students' awareness and perception of Bluetooth security threats, and whether they are able to take preventive measures to protect security threats.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"13 1 Suppl 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123730701","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":"Fire Detection in Video Using Genetic-Based Neural Networks","authors":"T. X. Truong, Yongmin Kim, Jong-Myon Kim","doi":"10.1109/ICISA.2011.5772382","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772382","url":null,"abstract":"In this paper, we propose an effective four-stage approach that detects fire automatically. The proposed algorithm is composed of four stages. In the first stage, an approximate median method is used to detect moving regions. In the second stage, a fuzzy c-means (FCM) algorithm based on the color of fire is used to select candidate fire regions from these moving regions. In the third stage, a discrete wavelet transform (DWT) is used to derive the approximated and detailed wavelet coefficients of sub-image. In the final stage, a generic-based back-propagation neural network (BPNN) is utilized to distinguish between fire and non-fire. Experimental results indicate that the proposed method outperforms other fire detection algorithms, providing high reliability and low false alarm rate.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124964266","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":"Statistical Pattern Based Real-Time Smoke Detection Using DWT Energy","authors":"Chansu Kim, Young-Hwan Han, Yougduck Seo, H. Kang","doi":"10.1109/ICISA.2011.5772361","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772361","url":null,"abstract":"This paper proposes a novel method to detect smoke using statistical patterns which are DWT energy. In general, shape of smoke is not clear and color and diffusion direction of smoke depends on the environment. Therefore, if small pieces of smoke's information are used, false detection rate is increased. In this paper, the foreground is detected by robust method to environment changes. After its detection, DWT energy, shape, and color information of objects in the foreground are used to determine the smoke. The proposed method is suitable for the early detection. The proposed method takes the average processing time of 30 fps and approximately 7 seconds at the detection smoke from the moment the initial fire. False detection rate for the proposed method is lower than that for the previous method.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128661296","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 Excursions for Tiny Fingers: A Shared Experience","authors":"Aznoora Osman, N. A. Wahab","doi":"10.1109/ICISA.2011.5772369","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772369","url":null,"abstract":"Currently, kindergartens in Malaysia use books, photographs and model of real objects to teach children in the classroom. The use of computer software to assist in the teaching and learning process is very rare. Thus, this research was carried out to introduce an educational multimedia application to kindergarten children. The contents focused on objects in the public spaces, and created in the form of a virtual tour. Images of common public spaces were taken using average digital camera and stitched together to create a wide-angle panorama. The interactive virtual tour provided four different panoramas which were the lake, the beach, the zoo and the playground. In each scene, the objects (hotspots) were labelled and they could be clicked to reveal the description. As such, children learn about objects in its authentic environment. Preliminary experiments were conducted at two kindergartens to examine young children's capability in using the mouse to navigate and to obtain their response towards the virtual tour application. The findings from these experiments indicated that it is viable to use virtual tour to teach young children because of its simple navigation and the representation of objects using actual images. It was observed that the children enjoyed using the application and they could use it intuitively.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126166761","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":"Human Desire for Privacy: A Reason for Computer Supported Virtual Life","authors":"Hee-Cheol Kim","doi":"10.1109/ICISA.2011.5772359","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772359","url":null,"abstract":"The present achievement of systems for fashioning virtuality, including avatars, multiplayer on-line games, virtual communities, and virtual reality is very remarkable. This paper presents a theoretical investigation to take account of human desire for privacy as a major momentum for computer supported virtual life. During the analysis process, I newly adopt the notion of the two games called the Virtuality/Reality game and the Privacy/Publicity game that humans play. By doing so, I reveal that humans are the beings who aspire for a virtual life, and privacy is an indispensible premise for virtual life. In particular, presenting Tuareg males' practice of face-veiling that explains social function of privacy, the paper helps to capture an understanding of the Privacy/Publicity game in more depth. Hopefully the analytic result of the paper provides researchers and system designers with the design rationale to build systems where privacy is concerned in the context of computer supported virtual life.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125438865","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}
Jae-Il Cho, Kiheon Park, Jeom-goo Kim, Hyuncheol Kim
{"title":"A Fault Tolerant Channel Allocation Scheme for Mobile Hosts in GMPLS-Based Wavelength-Switched Optical Networks","authors":"Jae-Il Cho, Kiheon Park, Jeom-goo Kim, Hyuncheol Kim","doi":"10.1109/ICISA.2011.5772409","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772409","url":null,"abstract":"The mobile networks must have an ability to maintain an acceptable level of service during network failures to provide high resilience against service failures. This paper presents an eccentric fault tolerant path grouping scheme that can achieve mobility independent Quality of Service (QoS) guaranteed services in Generalized Multiprotocol Label Switching (GMPLS) based wavelength-switched optical networks. To make this possible, we propose a path allocation and restoration strategy called \"Reverse Shared Risk Link Group(RSRLG)\" and demonstrates how this concept can be applied to minimize recovery contention in mobile networks and to assess the network convergence associated with failurs. To reflect little more actual situations, we assume that the bandwidth of mobile connection requests can be some fraction of the lightpath capacity. Simulation results show that the proposed recovery scheme outperforms other schemes with fewer signaling traffics and contention probability. Very fast restorability can be accomplished for multiple failures. We also has developed an analytical model and performed analysis for the proposed scheme in terms of two performance factors: mean system time and reservation blocking probability.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125901137","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}
Jae-Deok Lim, Byeongcheol Choi, S. Han, ChoelHoon Lee, Byungho Chung
{"title":"Classification and Detection of Objectionable Sounds Using Repeated Curve-Like Spectrum Feature","authors":"Jae-Deok Lim, Byeongcheol Choi, S. Han, ChoelHoon Lee, Byungho Chung","doi":"10.1109/ICISA.2011.5772400","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772400","url":null,"abstract":"This paper proposes the repeated curve-like spectrum feature in order to classify and detect objectionable sounds. Objectionable sounds in this paper refer to the audio signals generated from sexual moans and screams in various sexual scenes. For reasonable results, we define the audio-based objectionable conceptual model with six categories from which dataset of objectionable classes are constructed. The support vector machine classifier is used for training and classifying dataset. The proposed feature set has accurate rate, precision, and recall at about 96%, 96%, and 90% respectively. With these measured performance, this paper shows that the repeated curve-like spectrum feature proposed in this paper can be a proper feature to detect and classify objectionable multimedia contents.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128003369","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 and Effective Domain-Specific Design Method with a Top-Down Scheme","authors":"Ming Yan, Ziyu Yang, Sikun Li, Liu Yang","doi":"10.1109/ICISA.2011.5772316","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772316","url":null,"abstract":"Domain specific design of reconfigurable architecture is a hard and time-consuming job. In this paper, a fast and effective domain-specific design method is proposed which mainly concludes a top-down subgraph enumeration algorithm and a heuristic identification process based on topological searching. A clustering and splitting algorithm is used to enumerate all the maximal valid subgraphs (MVSs) of the topological ordered source dataflow graph. These MVSs are then searched topologically to identify all the convex subgraphs for candidate functions. During the identification, heuristic rules are used for search space pruning. Candidate convex subgraphs are finally grouped into function sets for function unit design. Experiment results show that the subgraph enumeration speed is improved in most cases. With the combination of fast MVS enumeration and topological searching, a small number of candidate functions are identified, which shows that the proposed design method is practical and effective.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126661670","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":"Micro Payment System Using OTP for Customer's Anonymous","authors":"Dong-Gyu Shin, Moon-seog Jun","doi":"10.1109/ICISA.2011.5772318","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772318","url":null,"abstract":"Because of the rapid growth in e-commerce, we can buy things walking around. Its not the expensive items, but the small and cheap items such as text files, music files, movies that we buy while walking around. As this kind of e-commerce grows, micro-payment system develop these days. Since its so convenient, and simple, more and more people use it. Despite its merit, it has some problems to be solved. Customers information which is conveyed through unsafe system is possible to be reused or picked up by attackers. These days the crimes that uses the customers information illegally are increasing. In this thesis, I suggest a new protocol of OTP type that is used in micro-payment system concerning customers anonymous. Customers do not have to fill out the personal information with this system because only confirmed customer and mobile company can use the customers personal information before make a contract.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133901895","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":"Dynamic Energy-Aware Network Maintenance for Bluetooth","authors":"S. T. Bakhsh, H. Hasbullah, S. Tahir, F. Subhan","doi":"10.1109/ICISA.2011.5772384","DOIUrl":"https://doi.org/10.1109/ICISA.2011.5772384","url":null,"abstract":"Bluetooth is one of mobile ad hoc network technologies, which allows communication through piconet. A piconet consists of at most eight active devices at the same time. A multiple piconets network is called a scatternet, which is connected through a common node known as a relay. The limited energy available in a Bluetooth-enabled device is a critical issue for the mobile devices to participate effectively in the scatternet. Therefore, to improve the network performance, energy capability of a Bluetooth device should be analyzed periodically, and subsequently to determine its role in the network based on this energy analysis. It is expected that the more energy capable device shall perform more demanding role, i.e. the role of a high performance device shall be selected based on its energy level. In this paper, we discussed the design issues of an efficient Dynamic Energy-Aware Network Maintenance (DENM) technique. The proposed technique dynamically adapts changes in the network and maintains a constructed scatternet, as well as it ensures network stability and reduces overhead. The simulation results showed that the proposed technique outperformed the existing protocols in term of message overhead, transmission delay, and reconstruction time.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127550582","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}