Osamu TAKYU Yohtaro UMEDA Fumihito SASAMORI Shiro HANDA
This paper proposes the assignment of resource blocks (RBs) to reduce the peak-to-average power ratio (PAPR) of orthogonal frequency division multiplexing (OFDM) in a multi-user OFDM system. This system ranks the users according to the channel state information (CSI) for RB assignment. In our proposed technique, an RB is assigned to either the first- or second-ranked mobile station (MS) to minimize the PAPR of the OFDM signal. While this process reduces the PAPR, the throughput is also reduced because of the user diversity gain loss. A PAPR-throughput tradeoff is then established. Theoretical analyses and computer simulations confirm that when the number of MSs becomes large, the PAPR-throughput tradeoff is eased because of the minimal effect of the diversity gain loss. Therefore, significant PAPR reduction is achieved with only a slight degradation in the throughput.
Hao HAN Yinxing XUE Keizo OYAMA Yang LIU
The rendering mechanism plays an indispensable role in browser-based Web application. It generates active webpages dynamically and provides human-readable layout through template engines, which are used as a standard programming model to separate the business logic and data computations from the webpage presentation. The client-side rendering mechanism, owing to the advances of rich application technologies, has been widely adopted. The adoption of client side rendering brings not only various merits but also new problems. In this paper, we propose and construct “pagelet”, a segment-based template engine for developing flexible and extensible Web applications. By presenting principles, practice and usage experience of pagelet, we conduct a comprehensive analysis of possible advantages and disadvantages brought by client-side rendering mechanism from the viewpoints of both developers and end-users.
Young-Woong KO Min-Ja KIM Jeong-Gun LEE Chuck YOO
In this paper, we propose a new user-level file system to support block relocation by modifying the file allocation table without actual data copying. The key idea of the proposed system is to provide the block insertion and deletion function for file manipulation. This approach can be used very effectively for block-aligned file modification applications such as a compress utility and a TAR archival system. To show the usefulness of the proposed file system, we adapted the new functionality to TAR application by modifying TAR file to support an efficient sub-file management scheme. Experiment results show that the proposed system can significantly reduce the file I/O overhead and improve the I/O performance of a file system.
Jung-Ho UM Miyoung JANG Jae-Woo CHANG
With the advances in wireless Internet and mobile positioning technology, location-based services (LBSs) have become popular. In LBSs, users must send their exact locations in order to use the services, but they may be subject to several privacy threats. To solve this problem, query processing algorithms based on a cloaking method have been proposed. The algorithms use spatial cloaking methods to blur the user's exact location in a region satisfying the required privacy threshold (k). With the cloaked region, an LBS server can execute a spatial query processing algorithm preserving their privacy. However, the existing algorithms cannot provide good query processing performance. To resolve this problem, we, in this paper, propose a k-NN query processing algorithm based on network Voronoi diagram for spatial networks. Therefore, our algorithm can reduce network expansion overhead and share the information of the expanded road network. In order to demonstrate the efficiency of our algorithms, we have conducted extensive performance evaluations. The results show that our algorithm achieves better performance on retrieval time than the existing algorithms, such as PSNN and kRNN. This is because our k-NN query processing algorithm can greatly reduce a network expansion cost for retrieving k POIs.
Salah IBRAHIM Hiroshi ISHIKAWA Tatsushi NAKAHARA Yasumasa SUZAKI Ryo TAKAHASHI
An optoelectronic 32-bit serial-to-parallel converter with a novel conversion scheme and shared-trigger configuration has been developed for the label processing of 100-Gbps (25-Gbps $ imes 4 lambda)$ optical packets. No external optical trigger source is required to operate the converter, as the optical packet itself is used to perform self-triggering. Compared to prior optoelectronic label converters, the new device has a much higher gain even while converting labels at higher data rates, and exhibits tolerance to the voltage swing of received packets. The device response is presented together with the experimental demonstration of serial-to-parallel conversion for 4 different labels at 25 Gbps.
Takayoshi IWATA Hiroyuki MIYAZAKI Fumiyuki ADACHI
Scheduling imposes a trade-off between sum capacity and fairness among users. In some situations, fairness needs to be given the first priority. Therefore, a scheduling algorithm which can flexibly control sum capacity and fairness is desirable. In this paper, assuming the single-carrier frequency division multiple access (SC-FDMA), we propose three scheduling algorithms: modified max-map, proportional fairness (PF)-map, and max-min. The available subcarriers are grouped into a number of subcarrier-blocks each having the same number of subcarriers. The scheduling is done on a subcarrier-block by subcarrier-block basis to take advantage of the channel frequency-selectivity. The same number of non-contiguous subcarrier-blocks is assigned to selected users. The trade-off between sum capacity and fairness is controlled by changing the number of simultaneously scheduling users per time-slot. Capacity, fairness, and peak-to-average power ratio (PAPR) when using the proposed scheduling algorithms are examined by computer simulation.
Jingjie YAN Wenming ZHENG Minghai XIN Jingwei YAN
In this letter, a new sparse locality preserving projection (SLPP) algorithm is developed and applied to facial expression recognition. In comparison with the original locality preserving projection (LPP) algorithm, the presented SLPP algorithm is able to simultaneously find the intrinsic manifold of facial feature vectors and deal with facial feature selection. This is realized by the use of l1-norm regularization in the LPP objective function, which is directly formulated as a least squares regression pattern. We use two real facial expression databases (JAFFE and Ekman's POFA) to testify the proposed SLPP method and certain experiments show that the proposed SLPP approach respectively gains 77.60% and 82.29% on JAFFE and POFA database.
Hyunwook YANG Yeongyu HAN Seungwon CHOI
In a multi-user multiple-input multiple-output (MU-MIMO) system that adopts zero-forcing (ZF) as a precoder, the best selection is the combination of users who provide the smallest trace of the inverse of the channel auto-correlation matrix. Noting that the trace of the matrix is closely related to the determinant, we search for users that yield the largest determinant of their channel auto-correlation matrix. The proposed technique utilizes the determinant row-exchange criterion (DREC) for computing the determinant-changing ratio, which is generated whenever a user is replaced by one of a group of pre-selected users. Based on the ratio computed by the DREC, the combination of users providing the largest changing ratio is selected. In order to identify the optimal combination, the DREC procedure is repeated until user replacement provides no increase in the determinant. Through computer simulations of four transmit antennas, we show that the bit error rate (BER) per signal-to-noise ratio (SNR) as well as the sum-rate performance provided by the proposed method is comparable to that of the full search method. Furthermore, using the proposed method, a partial replacement of users can be performed easily with a new user who provides the largest determinant.
Toru SEGAWA Wataru KOBAYASHI Tatsushi NAKAHARA Ryo TAKAHASHI
We describe wavelength-routed switching technology for 25-Gbit/s optical packets using a tunable transmitter that monolithically integrates a parallel-ring-resonator tunable laser and an InGaAlAs electro-absorption modulator (EAM). The transmitter provided accurate wavelength tunability with 100-GHz spacing and small output power variation. A 25-Gbit/s burst-mode optical-packet data was encoded onto the laser output by modulating the integrated EAM with a constant voltage swing of 2 V at 45$^{circ}$C. Clear eye openings were observed at the output of the 100 GHz-spaced arrayed-waveguide grating with error-free operation being achieved for all packets. The tunable transmitter is very promising for realizing a high-speed, large-port-count and energy-efficient wavelength-routing switch that enables the forwarding of 100-Gbit/s optical packets.
Mohammad NASIR UDDIN Takaaki KIZU Yasuhiro HINOKUMA Kazuhiro TANABE Akio TAJIMA Kazutoshi KATO Kiichi HAMAMOTO
Laser diode capable of high speed direct modulation is one of the key solution for short distance applications due to their low power consumption, low cost and small size features. Realization of high modulation bandwidth for direct modulated laser maintaining the above mentioned feature is needed to enhance the short distance, low cost data transmission. One promising approach to enhance the modulation speed is to increase the photon density to achieve high modulation bandwidth. So to achieve this target, 1.55 $mu$m InGaAsP/InGaAsP multiple quantum well (MQW) asymmetric active multimode interferometer laser diode (active MMI-LD) has been demonstrated [1]. The split pumping concept has been applied for the active MMI-LD and significant enhancement of electrical to optical 3 dB down frequency bandwidth (f$_{mathrm{3dB}})$ up to 8 GHz has been successfully confirmed. The reported high bandwidth for split pump active MMI-LD is around 3.5 times higher than the previously reported maximum 3 dB bandwidth (2.3 GHz) of active MMI-LD without split pumping section. That shows, the splitted multimode pumping section behind the electrically isolated modulation section can potentially improve the modulation bandwidth of active MMI-LD. Clear and open eye diagram had also been confirmed for 2.5 Gbps, (2$^{mathrm{7}}$-1) pseudo random bit sequence (PRBS) modulation.
Fangming ZHAO Takashi NISHIDE Kouichi SAKURAI
We consider the problems of access control and encrypted keyword search for cryptographic cloud storage in such a way that they can be implemented for a multiple users setting. Our fine-grained access control aware multi-user secure keyword search approach interdependently harmonizes these two security notions, access control and encrypted keyword search. Owing to the shrinkage of the cloud server's search space to the user's decryptable subset, the proposed scheme both decreases information leakage and is shown to be efficient by the results of our contrastive performance simulation.
Mirza Golam KIBRIA Hidekazu MURATA Susumu YOSHIDA
This study analyzes the performance of a downlink beamformer with partitioned vector quantization under optimized feedback budget allocation. A multiuser multiple-input single-output downlink precoding system with perfect channel state information at mobile stations is considered. The number of feedback bits allocated to the channel quality indicator (CQI) and the channel direction indicator (CDI) corresponding to each partition are optimized by exploiting the quantization mean square error. In addition, the effects of equal and unequal partitioning on codebook memory and system capacity are studied and elucidated through simulations. The results show that with optimized CQI-CDI allocation, the feedback budget distributions of equal or unequal partitions are proportional to the size ratios of the partitioned subvectors. Furthermore, it is observed that for large-sized partitions, the ratio of optimal CDI to CQI is much higher than that for small-sized partitions.
Ahmad Iqbal Hakim SUHAIMI Yuichi GOTO Jingde CHENG
Information Security Management Systems (ISMSs) play important roles in helping organizations to manage their information securely. However, establishing, managing, and maintaining ISMSs is not an easy task for most organizations because an ISMS has many participants and tasks, and requires many kinds of documents. Therefore, organizations with ISMSs demand tools that can support them to perform all tasks in ISMS lifecycle processes consistently and continuously. To realize such support tools, a database system that manages ISO/IEC 27000 series, which are international standards for ISMSs, and ISMS documents, which are the products of tasks in ISMS lifecycle processes, is indispensable. The database system should manage data of the standards and documents for all available versions and translations, relationship among the standards and documents, authorization to access the standards and documents, and metadata of the standards and documents. No such database system has existed until now. This paper presents an information security management database system (ISMDS) that manages ISO/IEC 27000 series and ISMS documents. ISMDS is a meta-database system that manages several databases of standards and documents. ISMDS is used by participants in ISMS as well as tools supporting the participants to perform tasks in ISMS lifecycle processes. The users or tools can retrieve data from all versions and translations of the standards and documents. The paper also presents some use cases to show the effectiveness of ISMDS.
Duck-Ho BAE Jong-Min LEE Sang-Wook KIM Youngjoon WON Yongsu PARK
A burst of social network services increases the need for in-depth analysis of network activities. Privacy breach for network participants is a concern in such analysis efforts. This paper investigates structural and property changes via several privacy preserving methods (anonymization) for social network. The anonymized social network does not follow the power-law for node degree distribution as the original network does. The peak-hop for node connectivity increases at most 1 and the clustering coefficient of neighbor nodes shows 6.5 times increases after anonymization. Thus, we observe inconsistency of privacy preserving methods in social network analysis.
Dajuan FAN Zhiqiu HUANG Lei TANG
One of the most important problems in web services application is the integration of different existing services into a new composite service. Existing work has the following disadvantages: (i) developers are often required to provide a composite service model first and perform formal verifications to check whether the model is correct. This makes the synthesis process of composite services semi-automatic, complex and inefficient; (ii) there is no assurance that composite services synthesized by using the fully-automatic approaches are correct; (iii) some approaches only handle simple composition problems where existing services are atomic. To address these problems, we propose a correct assurance approach for automatically synthesizing composite services based on finite state machine model. The syntax and semantics of the requirement model specifying composition requirements is also proposed. Given a set of abstract BPEL descriptions of existing services, and a composition requirement, our approach automatically generate the BPEL implementation of the composite service. Compared with existing approaches, the composite service generated by utilizing our proposed approach is guaranteed to be correct and does not require any formal verification. The correctness of our approach is proved. Moreover, the case analysis indicates that our approach is feasible and effective.
Kazuto OGAWA Go OHTAKE Arisa FUJII Goichiro HANAOKA
For the sake of privacy preservation, services that are offered with reference to individual user preferences should do so with a sufficient degree of anonymity. We surveyed various tools that meet requirements of such services and decided that group signature schemes with weakened anonymity (without unlinkability) are adequate. Then, we investigated a theoretical gap between unlinkability of group signature schemes and their other requirements. We show that this gap is significantly large. Specifically, we clarify that if unlinkability can be achieved from any other property of group signature schemes, it becomes possible to construct a chosen-ciphertext secure cryptosystem from any one-way function. This result implies that the efficiency of group signature schemes can be drastically improved if unlinkability is not taken into account. We also demonstrate a way to construct a scheme without unlinkability that is significantly more efficient than the best known full-fledged scheme.
Toshiyuki MIYAMOTO Yasuwo HASEGAWA Hiroyuki OIMURA
A service-oriented architecture builds the entire system using a combination of independent software components. Such an architecture can be applied to a wide variety of computer systems. The problem of synthesizing service implementation models from choreography representing the overall specifications of service interaction is known as the choreography realization problem. In automatic synthesis, software models should be simple enough to be easily understood by software engineers. In this paper, we discuss a semi-formal method for synthesizing hierarchical state machine models for the choreography realization problem. The proposed method is evaluated using metrics for intelligibility.
Tomoya TANDAI Hiroshi SUZUKI Kazuhiko FUKAWA Satoshi SUYAMA
This paper proposes a multipacket-per-slot reservation-based random access protocol with multiuser detection (MD) and automatic repeat request (ARQ), called MPRMD, and analyzes its performance by computer simulations. In MPRMD, before data packet (DP) transmission, a user terminal (UT) transmits a small access request packet (AP) that is composed of an orthogonal preamble sequence and a UT identifier (UT-ID) in a randomly selected minislot during a short dedicated period. Even when several APs collide, a base station (BS) distinguishes them by matched filtering against the preamble part and then extracts the UT-IDs after separating each AP by MD. If the APs are not successfully detected, a small number of minislots are additionally arranged to retransmit them. Thus, by using MD under AP crowded conditions, BS can maximally detect the access requests in a short period, which results in reducing the overhead. Furthermore, in the assignment of a slot, BS intentionally assigns one slot to multiple UTs in order to enhance the efficiency and separates UT's DPs by MD. Since MPRMD can detect a multitude of access requests by utilizing MD in the short period and efficiently assign the slot to separable DPs by MD, it can enhance the system throughput. Computer simulations are conducted to demonstrate the effectiveness of MPRMD. It is shown that the maximum throughputs of MPRMD with the average SNR of 30dB reach 1.4 and 1.7 packets/slot when a data packet is 10 times and 50 times as long as a control packet, respectively.
Excimer laser annealing at 308nm in UV and semiconductor blue laser-diode annealing at 445nm were performed and compared in term of the crystallization depending on electrical properties of Si films. As a result for the thin Si films of 50nm thickness, both lasers are very effective to enlarge the grain size and to activate electrically the dopant atoms in the CVD Si film. Smooth Si surface can be obtained using blue-laser annealing of scanned CW mode. By improving the film quality of amorphous Si deposited by sputtering for subsequent crystallization, both laser annealing techniques are effective for LTPS applications not only on conventional glass but also on flexible sheet. By conducting the latter advanced annealing technique, small grain size as well as large grains can be controlled. As blue laser is effective to crystallize even rather thicker Si films of 1µm, high performance thin-film photo-sensor or photo-voltaic applications are also expected.
To better support data-intensive workflows which are typically built out of various independently developed executables, this paper proposes extensions to parallel database systems called User-Defined eXecutables (UDX) and collective queries. UDX facilitates the description of workflows by enabling seamless integrations of external executables into SQL statements without any efforts to write programs confirming to strict specifications of databases. A collective query is an SQL query whose results are distributed to multiple clients and then processed by them in parallel, using arbitrary UDX. It provides efficient parallelization of executables through the data transfer optimization algorithms that distribute query results to multiple clients, taking both communication cost and computational loads into account. We implement this concept in a system called ParaLite, a parallel database system based on a popular lightweight database SQLite. Our experiments show that ParaLite has several times higher performance over Hive for typical SQL tasks and has 10x speedup compared to a commercial DBMS for executables. In addition, this paper studies a real-world text processing workflow and builds it on top of ParaLite, Hadoop, Hive and general files. Our experiences indicate that ParaLite outperforms other systems in both productivity and performance for the workflow.