Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 19 )

2018 ( 262 )

2017 ( 270 )

2016 ( 255 )

Custom range...

Search Results: 1 - 10 of 18889 matches for " Jinsong Han "
All listed articles are free for downloading (OA Articles)
Page 1 /18889
Display every page Item
Robust Face Recognition using Local Illumination Normalization and Discriminant Feature Point Selection
Song Han,Jinsong Kim,Cholhun Kim,Jongchol Jo,Sunam Han
Computer Science , 2012,
Abstract: Face recognition systems must be robust to the variation of various factors such as facial expression, illumination, head pose and aging. Especially, the robustness against illumination variation is one of the most important problems to be solved for the practical use of face recognition systems. Gabor wavelet is widely used in face detection and recognition because it gives the possibility to simulate the function of human visual system. In this paper, we propose a method for extracting Gabor wavelet features which is stable under the variation of local illumination and show experiment results demonstrating its effectiveness.
Modelling and Analysis on Noisy Financial Time Series  [PDF]
Jinsong Leng
Journal of Computer and Communications (JCC) , 2014, DOI: 10.4236/jcc.2014.22012

Building the prediction model(s) from the historical time series has attracted many researchers in last few decades. For example, the traders of hedge funds and experts in agriculture are demanding the precise models to make the prediction of the possible trends and cycles. Even though many statistical or machine learning (ML) models have been proposed, however, there are no universal solutions available to resolve such particular problem. In this paper, the powerful forward-backward non-linear filter and wavelet-based denoising method are introduced to remove the high level of noise embedded in financial time series. With the filtered time series, the statistical model known as autoregression is utilized to model the historical times aeries and make the prediction. The proposed models and approaches have been evaluated using the sample time series, and the experimental results have proved that the proposed approaches are able to make the precise prediction very efficiently and effectively.

Dynamic Key-Updating: Privacy-Preserving Authentication for RFID Systems
Li Lu,Jinsong Han,Lei Hu,Lionel M. Ni
International Journal of Distributed Sensor Networks , 2012, DOI: 10.1155/2012/153912
Abstract: The objective of private authentication for Radio Frequency Identification (RFID) systems is to allow valid readers to explicitly authenticate their dominated tags without leaking the private information of tags. In previous designs, the RFID tags issue encrypted authentication messages to the RFID reader, and the reader searches the key space to identify the tags. Without key updating, those schemes are vulnerable to many active attacks, especially the compromising attack. We propose a strong and lightweight RFID private authentication protocol, SPA. By designing a novel key updating method, we achieve the forward secrecy in SPA with an efficient key search algorithm. We also show that, compared with existing designs, (SPA) is able to effectively defend against both passive and active attacks, including compromising attacks. Through prototype implementation, we demonstrate that SPA is practical and scalable for current RFID infrastructures.
Excitation of localized modes and mechanism of random lasing forming in random media
Hong Wang,Jinsong Liu,Kejia Wang,Yanling Han
Chinese Science Bulletin , 2006, DOI: 10.1007/s11434-006-2102-4
Abstract: Laser phenomena in random media have been studied based on the localized theory for lightwave in random media. The relationship between random lasing modes and localized modes has been investigated by directly solving Maxwell equations numerically via the finite difference time domain method. The spatial distribution and the spectra of localized modes are obtained for both passive and active random media. The results show that random lasing modes directly originate from the localized modes inside the random medium. In the presence of gain, any one of the localized modes can be amplified and can serve as random lasing mode.
Survey of Anonymity and Authentication in P2P Networks
Xiaoliang Wang,Lincong Yang,Xingming Sun,Jinsong Han
Information Technology Journal , 2010,
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 authentication so that misbehaving entities in the network remain traceable. This study analyzes this problem and reviews related researches. Besides, we also advise some possible methods for this problem.
Task Assignment on Multi-Skill Oriented Spatial Crowdsourcing
Peng Cheng,Xiang Lian,Lei Chen,Jinsong Han,Jizhong Zhao
Computer Science , 2015,
Abstract: With the rapid development of mobile devices and crowdsourcing platforms, the spatial crowdsourcing has attracted much attention from the database community. Specifically, the spatial crowdsourcing refers to sending location-based requests to workers, based on their current positions. In this paper, we consider a spatial crowdsourcing scenario, in which each worker has a set of qualified skills, whereas each spatial task (e.g., repairing a house, decorating a room, and performing entertainment shows for a ceremony) is time-constrained, under the budget constraint, and required a set of skills. Under this scenario, we will study an important problem, namely multi-skill spatial crowdsourcing (MS-SC), which finds an optimal worker-and-task assignment strategy, such that skills between workers and tasks match with each other, and workers' benefits are maximized under the budget constraint. We prove that the MS-SC problem is NP-hard and intractable. Therefore, we propose three effective heuristic approaches, including greedy, g-divide-and-conquer and cost-model-based adaptive algorithms to get worker-and-task assignments. Through extensive experiments, we demonstrate the efficiency and effectiveness of our MS-SC processing approaches on both real and synthetic data sets.
Dimensional Measurement of Complete-connective Network under the Condition of Particle’s Fission and Growth at a Constant Rate  [PDF]
JinSong Wang, BeiBei Hu
Journal of Software Engineering and Applications (JSEA) , 2012, DOI: 10.4236/jsea.2012.512B009
Abstract: We construct a complete-connective regular network based on Self-replication Space and the structural principles of cantor set and Koch curve. A new definition of dimension is proposed in the paper, and we also investigate a simplified method to calculate the dimension of two regular networks. By the study results, we can get a extension: the formation of Euclidean space may be built by the process of the Big Bang's continuously growing at a constant rate of three times.
Improving Accuracy for 3D RFID Localization
Jinsong Han,Yiyang Zhao,Yan Shun Cheng,Tse Lung Wong,Chun Hung Wong
International Journal of Distributed Sensor Networks , 2012, DOI: 10.1155/2012/865184
Abstract: Radio Frequency Identification (RFID) becomes a prevalent labeling and localizing technique in the recent years. Deploying indoor RFID localization systems facilitates many applications. Previous approaches, however, are most based on 2D design and cannot provide 3D location information. The lack of one-dimensional information may lead 2D-based systems to inaccurate localization. In this paper, we develop an indoor 3D RFID localization system based on active tag array. In particular, we employ the geometric mean to filter the explicit 3D location information with high accuracy. The experimental results show that our system is efficient in tracking objects and improving the localization accuracy.
Rejecting the Attack: Source Authentication for Wi-Fi Management Frames using CSI Information
Zhiping Jiang,Jizhong Zhao,Xiang-Yang Li,JinSong Han,Wei Xi
Computer Science , 2012,
Abstract: Comparing to well protected data frames, Wi-Fi management frames (MFs) are extremely vulnerable to various attacks. Since MFs are transmitted without encryption, attackers can forge them easily. Such attacks can be detected in cooperative environment such as Wireless Intrusion Detection System (WIDS). However, in non-cooperative environment it is difficult for a single station to identify these spoofing attacks using Received Signal Strength (RSS)-based detection, due to the strong correlation of RSS to both the transmission power (Txpower) and the location of the sender. By exploiting some unique characteristics (i.e., rapid spatial decorrelation, independence of Txpower, and much richer dimensions) of the Channel State Information (CSI), a standard feature in 802.11n Specification, we design a prototype, called CSITE, to authenticate the Wi-Fi management frames by a single station without external support. Our design CSITE, built upon off-the-shelf hardware, achieves precise spoofing detection without collaboration and in-advance finger-print. Several novel techniques are designed to address the challenges caused by user mobility and channel dynamics. To verify the performances of our solution, we implement a prototype of our design and conduct extensive evaluations in various scenarios. Our test results show that our design significantly outperforms the RSS-based method in terms of accuracy, robustness, and efficiency: we observe about 8 times improvement by CSITE over RSS-based method on the falsely accepted attacking frames.
Efficient and Secure Key Extraction using CSI without Chasing down Errors
Jizhong Zhao,Wei Xi,Jinsong Han,Shaojie Tang,Xiangyang Li,Yunhao Liu,Yihong Gong,Zehua Zhou
Computer Science , 2012,
Abstract: Generating keys and keeping them secret is critical in secure communications. Due to the "open-air" nature, key distribution is more susceptible to attacks in wireless communications. An ingenious solution is to generate common secret keys by two communicating parties separately without the need of key exchange or distribution, and regenerate them on needs. Recently, it is promising to extract keys by measuring the random variation in wireless channels, e.g., RSS. In this paper, we propose an efficient Secret Key Extraction protocol without Chasing down Errors, SKECE. It establishes common cryptographic keys for two communicating parties in wireless networks via the realtime measurement of Channel State Information (CSI). It outperforms RSS-based approaches for key generation in terms of multiple subcarriers measurement, perfect symmetry in channel, rapid decorrelation with distance, and high sensitivity towards environments. In the SKECE design, we also propose effective mechanisms such as the adaptive key stream generation, leakage resilient consistence validation, and weighted key recombination, to fully exploit the excellent properties of CSI. We implement SKECE on off-the-shelf 802.11n devices and evaluate its performance via extensive experiments. The results demonstrate that SKECE achieves a more than 3x throughput gain in the key generation from one subcarrier in static scenarios, and due to its high efficiency, a 50% reduction on the communication overhead compared to the state-of-the-art RSS based approaches.
Page 1 /18889
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.