Liang-Chun CHEN Chien-Lung HSU Nai-Wei LO Kuo-Hui YEH Ping-Hsien LIN
With the successful development and rapid advancement of social networking technology, people tend to exchange and share information via online social networks, such as Facebook and LINE.Massive amounts of information are aggregated promptly and circulated quickly among people. However, with the enormous volume of human-interactions, various types of swindles via online social networks have been launched in recent years. Effectively detecting fraudulent activities on social networks has taken on increased importance, and is a topic of ongoing interest. In this paper, we develop a fraud analysis and detection system based on real-time messaging communications, which constitute one of the most common human-interacted services of online social networks. An integrated platform consisting of various text-mining techniques, such as natural language processing, matrix processing and content analysis via a latent semantic model, is proposed. In the system implementation, we first collect a series of fraud events, all of which happened in Taiwan, to construct analysis modules for detecting such fraud events. An Android-based application is then built for alert notification when dubious logs and fraud events happen.
Kento OHTANI Kenta NIWA Kazuya TAKEDA
A single-dimensional interface which enables users to obtain diverse localizations of audio sources is proposed. In many conventional interfaces for arranging audio sources, there are multiple arrangement parameters, some of which allow users to control positions of audio sources. However, it is difficult for users who are unfamiliar with these systems to optimize the arrangement parameters since the number of possible settings is huge. We propose a simple, single-dimensional interface for adjusting arrangement parameters, allowing users to sample several diverse audio source arrangements and easily find their preferred auditory localizations. To select subsets of arrangement parameters from all of the possible choices, auditory-localization space vectors (ASVs) are defined to represent the auditory localization of each arrangement parameter. By selecting subsets of ASVs which are approximately orthogonal, we can choose arrangement parameters which will produce diverse auditory localizations. Experimental evaluations were conducted using music composed of three audio sources. Subjective evaluations confirmed that novice users can obtain diverse localizations using the proposed interface.
This paper presents a hierarchical-masked image filtering method for privacy-protection. Cameras are widely used for various applications, e.g., crime surveillance, environment monitoring, and marketing. However, invasion of privacy has become a serious social problem, especially regarding the use of surveillance cameras. Many surveillance cameras point at many people; thus, a large amount of our private information of our daily activities are under surveillance. However, several surveillance cameras currently on the market and related research often have a complicated or institutional masking privacy-protection functionality. To overcome this problem, a Hierarchical-Masked image Filtering (HMF) method is proposed, which has unmaskable (mask reversal) capability and is applicable to current surveillance camera systems for privacy-information protection and can satisfy privacy-protection related requirements. This method has five main features: unmasking of the original image from only the masked image and a cipher key, hierarchical-mask level control using parameters for the length of a pseudorandom number, robustness against malicious attackers, fast processing on an embedded processor, and applicability of mask operation to current surveillance camera systems. Previous studies have difficulty in providing these features. To evaluate HMF on actual equipment, an HMF-based prototype system is developed that mainly consists of a USB web camera, ultra-compact single board computer, and notebook PC. Through experiments, it is confirmed that the proposed method achieves mask level control and is robust against attacks. The increase in processing time of the HMF-based prototype system compared with a conventional non-masking system is only about 1.4%. This paper also reports on the comparison of the proposed method with conventional privacy protection methods and favorable responses of people toward the HMF-based prototype system both domestically and abroad. Therefore, the proposed HMF method can be applied to embedded systems such as those equipped with surveillance cameras for protecting privacy.
Fei XU Pinxin LIU Jing XU Jianfeng YANG S.M. YIU
Bloom Filter is a bit array (a one-dimensional storage structure) that provides a compact representation for a set of data, which can be used to answer the membership query in an efficient manner with a small number of false positives. It has a lot of applications in many areas. In this paper, we extend the design of Bloom Filter by using a multi-dimensional matrix to replace the one-dimensional structure with three different implementations, namely OFFF, WOFF, FFF. We refer the extended Bloom Filter as Feng Filter. We show the false positive rates of our method. We compare the false positive rate of OFFF with that of the traditional one-dimensional Bloom Filter and show that under certain condition, OFFF has a lower false positive rate. Traditional Bloom Filter can be regarded as a special case of our Feng Filter.
Toshiko TOMINAGA Kanako SATO Noriko YOSHIMURA Masataka MASUDA Hitoshi AOKI Takanori HAYASHI
Web browsing services are expanding as smartphones are becoming increasingly popular worldwide. To provide customers with appropriate quality of web-browsing services, quality design and in-service quality management on the basis of quality of experience (QoE) is important. We propose a web-browsing QoE estimation model. The most important QoE factor for web-browsing is the waiting time for a web page to load. Next, the variation in the communication quality based on a mobile network should be considered. We developed a subjective quality assessment test to clarify QoE characteristics in terms of waiting time using 20 different types of web pages and constructed a web-page QoE estimation model. We then conducted a subjective quality assessment test of web-browsing to clarify the relationship between web-page QoE and web-browsing QoE for three web sites. We obtained the following two QoE characteristics. First, the main factor influencing web-browsing QoE is the average web-page QoE. Second, when web-page QoE variation occurs, a decrease in web-page QoE with a huge amplitude causes the web-browsing QoE to decrease. We used these characteristics in constructing our web-browsing QoE estimation model. The verification test results using non-training data indicate the accuracy of the model. We also show that our findings are applicable to web-browsing quality design and solving management issues on the basis of QoE.
Ahmet Ihsan CANBOLAT Kazuhiko FUKAWA
To suppress intercell interference for three-cell half-duplex relay systems, joint interference suppression and multiuser detection (MUD) schemes that estimate weight coefficients by the recursive least-squares (RLS) algorithm have been proposed but show much worse bit error rate (BER) performance than maximum likelihood detection (MLD). To improve the BER performance, this paper proposes a joint interference suppression and MUD scheme that estimates the weight coefficients by eigenvalue decomposition. The proposed scheme carries the same advantages as the conventional RLS based schemes; it does not need channel state information (CSI) feedback while incurring much less amount of computational complexity than MLD. In addition, it needs to know only two out of three preambles used in the system. Computer simulations of orthogonal frequency-division multiplexing (OFDM) transmission under three-cell and frequency selective fading conditions are conducted. It is shown that the eigendecomposition-based scheme overwhelmingly outperforms the conventional RLS-based scheme although requiring higher computational complexity.
Zhihao ZHONG Jianhua PENG Kaizhi HUANG
In order to satisfy the very high traffic demand in crowded hotspot areas and realize adequate security in future fifth-generation networks, this paper studies physical-layer security in the downlink of a two-tier ultra dense heterogeneous network, where a ubiquitous array formed by ultra dense deployed small-cells surrounds a macrocell base station. In this paper, the locations of legitimate users and eavesdroppers are drawn from Poisson point processes. Then, the cumulative distribution functions of the receive signal-to-interference-plus-noise ratio for legitimate users and eavesdroppers are derived. Further, the average secrecy rate and secrecy coverage probability for each tier as well as for the whole network are investigated. Finally, we analyze the influences on secrecy performance caused by eavesdropper density, transmit power allocation ratio, antenna number allocation ratio, and association area radius.
Kouhei SUZUKI Hideya SO Daisuke GOTO Yoshinori SUZUKI Fumihiro YAMASHITA Katsuya NAKAHIRA Kiyoshi KOBAYASHI Takatoshi SUGIYAMA
This paper introduces distributed array antenna (DAA) systems that offer high antenna gain. A DAA consists of several small antennas with improved antenna gain. This paper proposes a technique that suppresses the off-axis undesired radiation and compensates the time delay by combining signal processing with optimization of array element positioning. It suppresses the undesired radiation by compensating the delay timing with high accuracy and deliberately generating the inter-symbol interference (ISI) in side-lobe directions. Computer simulations show its effective suppression of the equivalent isotropic radiated power (EIRP) pattern and its excellent BER performance.
Ioannis MOSCHOLIOS Michael LOGOTHETIS Shigeo SHIODA
We consider a multirate loss system that accommodates several service-classes with cooperative and non-cooperative users, which generate random or quasi-random arriving calls (depending on the users population). The term “ cooperative” refers to users that can retry (with a certain probability, when the total occupied bandwidth of the system is below a predefined threshold) to be connected in the system with a reduced bandwidth, if they are blocked with their initial peak-bandwidth requirement. This behavior increases the quality of service (QoS) perceived by other users. Due to the retries, the system model does not have a product form solution for the steady state distribution. However, we propose an efficient calculation of system's occupancy distribution, congestion probabilities and system's utilization, while avoiding complex state space enumeration and processing. As it is shown through simulation, the proposed recursive formulas are consistent and quite accurate. For evaluation, we use the conventional trunk/bandwidth reservation control to equalize the congestion probabilities and compare them with the results of the proposed models. Besides, we generalize the proposed models by considering the coexistence of random and quasi-random arrivals. Furthermore, we propose (a) a heuristic method for the determination of desired retry probabilities according to a fairness index and (b) an optimization procedure whereby we assess the retry threshold so that the QoS of the least speed non-cooperative calls is guaranteed for certain retry probabilities of cooperative calls.
Maki ARAI Masashi IWABUCHI Kei SAKAGUCHI Kiyomichi ARAKI
This paper proposes a new methodology to design optimal antennas for MIMO (Multi-Input Multi-Output) communication systems by using spherical mode expansion. Given spatial channel properties of a MIMO channel, such as the angular profile at both sides, the optimal MIMO antennas should provide the largest channel capacity with a constraint of the limited implementation space (volume). In designing a conventional MIMO antenna, first the antenna structure (current distribution) is determined, second antenna directivity is calculated based on the current distribution, and thirdly MIMO channel capacity is calculated by using given angular profiles and obtained antenna directivity. This process is repeated by adjusting the antenna structure until the performance satisfies a predefined threshold. To the contrary, this paper solves the optimization problem analytically and finally gives near optimal antenna structure (current distribution) without any greedy search. In the proposed process, first the optimal directivity of MIMO antennas is derived by applying spherical mode expansion to the angular profiles, and second a far-near field conversion is applied on the derived optimal directivity to achieve near optimal current distributions on a limited surface. The effectiveness of the proposed design methodology is validated via numerical calculation of MIMO channel capacity as in the conventional design method while giving near optimal current distribution with constraint of an antenna structure derived from proposed methodology.
Jae-Yoon JUNG Gyunyoung HEO Kyuhyup OH
Smart card payment systems provide a convenient billing mechanism for public transportation providers and passengers. In this paper, a smart card-based transit log is used to reveal functionally related regions in a city, which are called zones. To discover significant zones based on the transit log data, two algorithms, minimum spanning trees and agglomerative hierarchical clustering, are extended by considering the additional factors of geographical distance and adjacency. The hierarchical spatial geocoding system, called Geohash, is adopted to merge nearby bus stops to a region before zone discovery. We identify different urban zones that contain functionally interrelated regions based on passenger trip data stored in the smart card-based transit log by manipulating the level of abstraction and the adjustment parameters.
Sang-Chul LEE Christos FALOUTSOS Dong-Kyu CHAE Sang-Wook KIM
This paper deals with a novel, interesting problem of detecting frauds in comparison-shopping services (CSS). In CSS, there exist frauds who perform excessive clicks on a target item. They aim at making the item look very popular and subsequently ranked high in the search and recommendation results. As a result, frauds may distort the quality of recommendations and searches. We propose an approach of detecting such frauds by analyzing click behaviors of users in CSS. We evaluate the effectiveness of the proposed approach on a real-world clickstream dataset.
Kangru WANG Lei QU Lili CHEN Jiamao LI Yuzhang GU Dongchen ZHU Xiaolin ZHANG
In this paper, a novel approach is proposed for stereo vision-based ground plane detection at superpixel-level, which is implemented by employing a Disparity Texture Map in a convolution neural network architecture. In particular, the Disparity Texture Map is calculated with a new Local Disparity Texture Descriptor (LDTD). The experimental results demonstrate our superior performance in KITTI dataset.
Constant composition codes (CCCs) are a special class of constant-weight codes. They include permutation codes as a subclass. The study and constructions of CCCs with parameters meeting certain bounds have been an interesting research subject in coding theory. A bridge from zero difference balanced (ZDB) functions to CCCs with parameters meeting the Luo-Fu-Vinck-Chen bound has been established by Ding (IEEE Trans. Information Theory 54(12) (2008) 5766-5770). This provides a new approach for obtaining optimal CCCs. The objective of this letter is to construct two classes of ZDB functions whose parameters not covered in the literature, and then obtain two classes of optimal CCCs meeting the Luo-Fu-Vinck-Chen bound from these new ZDB functions.
Yoshinori AONO Takuya HAYASHI Le Trieu PHONG Lihua WANG
We build a privacy-preserving system of linear regression protecting both input data secrecy and output privacy. Our system achieves those goals simultaneously via a novel combination of homomorphic encryption and differential privacy dedicated to linear regression and its variants (ridge, LASSO). Our system is proved scalable over cloud servers, and its efficiency is extensively checked by careful experiments.
Yoshiaki SHIRAISHI Masaki KAMIZONO Masanori HIROTOMO Masami MOHRI
In the case of drive-by download attacks, most malicious web sites identify the software environment of the clients and change their behavior. Then we cannot always obtain sufficient information appropriate to the client organization by automatic dynamic analysis in open services. It is required to prepare for expected incidents caused by re-accessing same malicious web sites from the other client in the organization. To authors' knowledge, there is no study of utilizing analysis results of malicious web sites for digital forensic on the incident and hedging the risk of expected incident in the organization. In this paper, we propose a system for evaluating the impact of accessing malicious web sites by using the results of multi-environment analysis. Furthermore, we report the results of evaluating malicious web sites by the multi-environment analysis system, and show how to utilize analysis results for forensic analysis and risk hedge based on actual cases of analyzing malicious web sites.
Sang-Young KIM Won-Chang KIM Hyoung-Kyu SONG
This letter proposes a relay selection scheme in order to improve a performance in the wireless cooperative communication system. The cooperative communication uses the relays in order to obtain a improved performance. The relay selection scheme has a great influence on the performance of the wireless cooperative communication. Because the diversity gain is affected by the superposition of the channels, a superposition of the channels is important in the wireless cooperative communication. The constructive superposition of the channels can improve the performance of the wireless cooperative communication. Because the conventional schemes do not consider the superposition of the channels, the conventional schemes are not suitable for the cooperative communication using the multiple relays. The new scheme considers the superposition of channels and selects the relays that can achieve the constructive superposition. Therefore, the new scheme can provide the improved performance by using the phase information between channels. The simulation results show that the bit error performance of the proposed scheme is better than the conventional schemes.
Yuanfeng SHE Masanobu HIROSE Yuto KATO Takayuki ISHIZONE Satoru KUROKAWA Shinya IWASAWA Sintaro ARATA
This article proposes a simply structured transverse slot linear array antenna with a low cross-polarization in X band on a quasi-TEM (transverse electromagnetic) mode waveguide. The fabrication technology of this antenna is very simple and suitable for mass production. A center fed linear slot array has been designed and measured. The quasi-TEM wave is propagating in the conventional waveguide with dielectrics at sidewalls. The simulation and the measurement results show that the baffle plates enhance the gain and reduce the beamwidth effectively. The uncertainties of the electric properties of the dielectric and fabrication errors are also discussed.
Jiang ZHU Bai WANG Bin WU Weiyu ZHANG
Community detection is a pivotal task in data mining, and users' emotional behaviors have an important impact on today's society. So it is very significant for society management or marketing strategies to detect emotional communities in social networks. Based on the emotional homophily of users in social networks, it could confirm that users would like to gather together to form communities according to emotional similarity. This paper exploits multivariate emotional behaviors of users to measure users' emotional similarity, then takes advantage of users' emotional similarity as edge weight to remodel an emotional network and detect communities. The detailed process of detecting emotional communities is as follows: 1) an emotional network is constructed and emotional homophily in experimental dataset is verified; 2) both CNM and BGLL algorithms are employed to detect emotional communities in emotional network, and emotional characters of each community are analyzed; 3) in order to verify the superiority of emotional network for detecting emotional communities, 1 unweighted network and 3 other weighted and undirected networks are constructed as comparison. Comparison experiments indicate that the emotional network is more suitable for detecting emotional communities, the users' emotional behaviors are more similar and denser in identical communities of emotional network than the contrastive networks' communities.
Na RUAN Mingli WU Shiheng MA Haojin ZHU Weijia JIA Songyang WU
As a new generation voice service, Voice over LTE (VoLTE) has attracted worldwide attentions in both the academia and industry. Different from the traditional voice call based on circuit-switched (CS), VoLTE evolves into the packet-switched (PS) field, which has long been open to the public. Though designed rigorously, similar to VoIP services, VoLTE also suffers from SIP (Session Initiation Protocal) flooding attacks. Due to the high performance requirement, the SIP flooding attacks in VoLTE is more difficult to defend than that in traditional VoIP service. In this paper, enlightened by Counting Bloom Filter (CBF), we design a versatile CBF-like structure, PFilter, to detect the flooding anomalies. Compared with previous relevant works, our scheme gains advantages in many aspects including detection of low-rate flooding attack and stealthy flooding attack. Moreover, not only can our scheme detect the attacks with high accuracy, but also find out the attackers to ensure normal operation of VoLTE by eliminating their negative effects. Extensive experiments are performed to well evaluate the performance of the proposed scheme.