bluuebunny/crossref_metadata_2025_split huggingface dataset:
RTL Design of Joint CFO and IQ-Imbalance Compensator for Narrow-Band Wireless System
Authors: Yoshida Takuro , Nojima Daisuke , Lanante Jr Leonardo , Nagao Yuhei , Kurosaki Masayuki , Sai Baiko , Ochi Hiroshi 
Published: April 2020

Direct conversion receiver is a well-known receiver architecture that enables small, low power and cheap radio. However, I/Q imbalance caused by non-orthogonality between in-phase component and quadrature-phase component from the imperfections of quadrature demodulator is a major problem in this architecture. In addition, carrier frequency offset (CFO) occurs as well. In this paper, we present a register transfer level (RTL) design of joint CFO and I/Q imbalance compensator. We verify that our system can compensate CFO from -500 Hz to 500 Hz when sampling rate is 9.6 kbps under the effect of I/Q imbalance.
Target and Equalizer Design for High-Density Bit-Patterned Media Recording
Authors: Koonkarnkhai Santi , Keeratiwintakorn Phongsak , Kovintavewat Piya 
Published: April 2020

In bit-patterned media recording (BPMR) channels, the inter-track interference (ITI) is extremely severe at ultra high areal densities, which significantly degrades the system performance. The partial-response maximum-likelihood (PRML) technique that uses an one-dimensional (1D) partial response target might not be able to cope with this severe ITI, especially in the presence of media noise and track mis-registration (TMR). This paper describes the target and equalizer design for highdensity BPMR channels. Specifically, we proposes a two-dimensional (2D) cross-track asymmetric target, based on a minimum mean-squared error (MMSE) approach, to combat media noise and TMR. Results indicate that the proposed 2D target performs better than the previously proposed 2D targets, especially when media noise and TMR is severe.
Binary Classication Tree for Multiclass Classication with Observation-based Clustering
Authors: Athimethphat Maythapolnun , Lerteerawong Boontarika 
Published: April 2020

Many classification techniques are originally designed to solve a binary problem, but practically many classification problems involve more than two classes. A multiclass problem can be decomposed into binary sub-problems, each solved by a binary classifier. Aside from using one-against-one (OAO) or one-against-all (OAA) decomposition scheme, an ensemble of binary classifiers can be constructed hierarchically. In this study, we focus in multiclass classification with a binary classification tree and propose a new approach in splitting a top-down tree by grouping observations into two clusters with k-mean clustering. Unlike a traditional class-clustering approach, this observation-based algorithm allows one class to appear in two meta-classes so it can be examined in both sub-trees. A data cleaning process is also performed to avoid insignificant tree splits. The experiment shows how our proposed algorithm (BCTOB) performed on different data sets, compared with other binary classification tree algorithms. Then advantages and disadvantages of the algorithm are discussed.
Mining Rare Association Rules on Banpheo Hospital (Public Organization) via Apriori MSG-P Algorithm
Authors: Ouypornkochagorn Taweechai 
Published: April 2020

Mining association rule is one of the important techniques in data mining to exploit hidden knowledge in large database. Many businesses in several areas need this technique for examine their enormous information, and public health is the one area that highly requires. Several hidden information conceal in daily operation data such as relation between visit time and symptom, relation between disease and patient age, etc. By the way, association rule discovery via traditional Apriori algorithm, the fundamental way to retrieve hidden rules, has to pay with tremendous resources and time. This research implements the modification of association rule mining technique, Apriori MSG-P, in operational database of Banpheo hospital (Public Organization), Sumutsakon province, Thailand. The objectives target on epidemic information and patient behavior on hospital’s services. The research’s outcomes show that our implementation can evaluate a lot of valuable information that can be used by both of operation staffs and executive staffs. Moreover, the research’s outcomes demonstrate that Apriori MSG-P can be the proper one technique that can implement the realworld databases.
Cloud Provisioning for Work ow Application with Deadline using Discrete PSO
Authors: Netjinda Nuttapong , Achalakul Tiranee , Sirinaovakul Booncharoen 
Published: April 2020

The need of cloud consumers to optimize all options offered by cloud provider has been rapidly arisen during the recent years. The consideration involves the appropriate number of VMs must be purchased along with the allocation of supporting resources. Moreover, commercial clouds may have many different purchasing options. Finding optimal provisioning solutions is thus an NP-hard problem. Currently, there are many research works discussing the cloud provisioning cost optimization. However, most of the works mainly concerned with task scheduling. In this paper, we proposed a new framework where number of purchased instance, instance type, purchasing options, and task scheduling are considered within an optimization process. The Particle Swarm Optimization (PSO) technique is used to find the optimal solution. The initial results show a promising performance in both the perspectives of the total cost and fitness convergence. The designed system provides the solutions of purchasing options with optimum budget for any specified workflow-based application based on the required performance.
Robust Digital Control for an LLC Current-Resonant DC-DC Converter
Authors: Nishimura Tomoya , Adachi Yuto , Ohta Yoshihiro , Higuchi Kohji , Takegami Eiji , Tomioka Satoshi , Jirasereeamornkul Kamon , Chamnongthai Kosin 
Published: April 2020

If a pulse frequency and a load resistance of an LLC current-resonant DC-DC converter are changed, the dynamic characteristics are varied greatly, that is, the LLC current-resonant DC-DC converter has non-linear characteristics. In many applications of DC-DC converters, loads cannot be specified in advance, and they will be changed suddenly from no loads to full loads. A DC-DC converter system used a conventional single controller cannot be adapted to change dynamics and it occurs large output voltage variation. In this paper, a robust digital controllerfor suppress the change of step response characteristics and variation of output voltage in the load sudden change is proposed. Experimental studies using a micro-processor for the controller demonstrate that this type of digital controller is effective to suppress the variation.
Depth Map Renement Using Reliability Based Joint Trilateral Filter
Authors: Matsuo Takuya , Kodera Naoki , Fukushima Norishige , Ishibashi Yutaka 
Published: April 2020

In this paper, we propose a renement lter for depth maps. The lter convolutes an image and a depth map with a cross computed kernel. We call the lter joint trilateral lter. Main advantages of the proposed method are that the lter ts outlines of objects in the depth map to silhouettes in the im- age, and the lter reduces Gaussian noise in other areas. The eects reduce rendering artifacts when a free viewpoint image is generated by point cloud ren- dering and depth image based rendering techniques. Additionally, their computational cost is independent of depth ranges. Thus we can obtain accurate depth maps with the lower cost than the conventional ap- proaches, which require Markov random eld based optimization methods. Experimental results show that the accuracy of the depth map in edge areas goes up and its running time decreases. In addition, the lter improves the accuracy of edges in the depth map from Kinect sensor. As results, the quality of the rendering image is improved.
Case Studies: Business and Technical Perspectives in Migration of Legacy Systems to Service Oriented Architecture
Authors: Galinium Maulahikmah , Shahbaz Negar 
Published: April 2020

In adoption process of Service Oriented Architecture (SOA), the legacy systems of a company can not be neglected. The reason is the legacy systems have been deployed in the past and have been running critical business processes within an enterprise in its current IT architecture. However not all migration process of legacy systems to SOA has been successfull. Highlighting the right factors to reach legacy systems migration success in a specific company is the key value. The main adopted research method in this study has been interviewed for different companies with different enterprises including bank, furniture, engineering and airline companies in Europe. Through separate interviews, critical success factors of migrating legacy systems into SOA have been collected and identified in each case company. Finally collected results are analyzed and presented as the recognized factors affecting successful migration oflegacy assets into SOA from business and technical perspectives.
A Novel Application to Image Restoration Based on Regularized SL0 Algorithm in Frequency Domain
Authors: Hong Ha Pham , Patanavijit Vorapoj 
Published: April 2020

In these recent years, Compressive Sensing (CS) is becoming an attractive topic in the field of Information Theory. It is widely used in several area including networking, image processing and digital camera. In particular, image reconstruction based on small number of measured components is known as the most useful application. In this paper, SL0 algorithm is specially used for the reconstruction process. It significantly decrease the processing time by utilizing a matrix in which the number of row is much smaller than number of column. Therefore, SL0 is known as one of the fastest and most accurate algorithm in CS. However due to ill-posed condition, if the prior information of the original image is undetermined, the reconstruction procedure of SL0 is much affected by the noise. Unfortunately, the investigation for solving this SL0 ill-posed condition is very limited therefore SL0 is not widely applied in many application. Consequently, this paper proposes a novel regularization technique for SL0 algorithm in the frequency domain. In order to reduce and constraint the space of reconstructed image, the frequency domain Tikhonov regularization technique is employed. It is shown that the quality of the reconstructed image is much better compared to the traditional algorithm under the noisy environment. The experimental result is exclusively simulated for 3 images: Lena, Sussie and Cameraman under both Gaussian and Non-Gaussian noise models (such as AWGN, Poisson noise, Salt & Pepper noise and Speckle noise) at different noise powers.
The Parameterization of all Disturbance Observers for Time-Delay Plants with any Input and Output Disturbances
Authors: Hu Jie , Yamada Kou , Sakanushi Tatsuya 
Published: April 2020

In this paper, we examine the parameterization of all disturbance observers for time-delay plants with any input and output disturbances. The disturbance observers have been used to estimate the disturbance in the plant. Several papers on design methods of disturbance observers have been published. Recently, the parameterization of all disturbance observers for plants with any input and output disturbances was clarified. However, no paper examines the parameterization of all disturbance observers for time-delay plants with any input and output disturbances. In this paper, we propose parameterizations of all disturbance observers and all linear functional disturbance observers for time-delay plants with any input and output disturbances.
Effects of TiO2 capping layer on reset current of lateral phase change memory
Authors: Sainon Santipab , Sa-ngiamsak Chiranut 
Published: April 2020

Lateral Phase Change Memories (LPCMs) gained a lot of interesting due to its simpler fabrication process and lower reset current comparing with verticalstructure phase change memories. The capping layer can be easily fabricated and changed on the active phase-change region of LPCM. The knowledge of capping layer on the thermal generation and diffusion on LPCM can provide an alternative design approach to alleviate the high reset current issue of PCM. The location and thickness of TiO2 capping layer were studied in order to achieve higher power consumption efficiency using finite element analysis. The four LPCM structures with various location of capping layer were modelled. The simulation results found that addition of TiO2 capping layer can increase power efficiency. The suitable location to place TiO2 capping layer is at the centre of the active phase-change layer found in Model 4. The thickness of capping layer was developed based on Model 4; and thickness of 40nm was given the best result. The combination of proper location and thickness of TiO2 capping layer can offer a reduction of the LPCM reset current by 24%.
On the output feedback control of discrete-valued input systems
Authors: Sawada Kenji , Shin Seiichi 
Published: April 2020

This paper considers an output feedback control for quantized feedback systems. Our controller focuses on high accuracy control performance for embedded devices with low-resolution AD/DA converters and networked systems with band-limited channels. The synthesis problem we address is the simultaneous synthesis of the nominal controller and the delta-sigma modulator (where the modulators are called the dynamic quantizers). For certain systems, we provide closed form and numerical solutions for the synthesis problem based on the invariant set analysis and the LMI technique. First, this paper proposes a synthesis condition that is recast as a set of matrix inequality conditions. The condition reduces to a tractable numerical optimization problem. Second, a closed form solution of optimal controller for the quantized feedback system is clarified within the invariant set framework. Third, we discuss the controller synthesis conditions which are characterized by the transmission zero property. Finally, to verify the validity of our method, numerical examples are presented and then the contributions related to the existing dynamic quantizer synthesis are clarified.
Robust Digital Control for Interleaved PFC Boost Converter Using Approximate 2DOF
Authors: Satake Yuki , Furuya Hiroyuki , Mochizuki Yohei , Fukaishi Yuji , Higuchi Kohji , Chamnongthai Kosin 
Published: April 2020

In recent years, improving of power factor and reducing harmonic distortion in electrical instruments are needed. In general, a current conduction mode boost converter is used for active PFC (Power Factor Correction). In a PFC boost converter, if a duty ratio, a load resistance and an input voltage are changed, the dynamic characteristics are varied greatly. This is the prime reason of difficulty of controlling the interleaved PFC boost converter. In this paper, a robust digital controller for suppressing the change of step response characteristics and variation of output voltage at a DC-DC buck converter load sudden change with high power factor and low harmonic is proposed. Experimental studies using a micro-processor for controller demonstrate that the proposed digital controller is effective to improve power factor and to suppress output voltage variation.
A Novel Strategy for Formal Verication of Asynchronous Circuit Design in PAiD tool
Authors: Nguyen Tin Thien , LE-HUU Khoi-Nguyen , Bui Thang H. , Dinh-Duc Anh-Vu 
Published: April 2020

EDA has been proposed for a long time as a category of reliable software tools for designing electronic systems. Although some of them have been considered as powerful tools for asynchronous circuits, a prominent approach to cope with the biggest defect of synchronous circuits: clock distribution issue, researches in verifying the correctness of those circuits are still limited. Therefore, an enhanced version of PAiD, an EDA tool that has been developed at Ho Chi Minh City University of Technology (HCMUT), will be proposed in this work along with case studies. It will enable engineers not only design, synthesize asynchronous circuits but also verify them. Furthermore, a good strategy to improve the verifying performance is also discussed.
Crowd Aided Web Search: Concept and Implementation
Authors: Tseng Chun-Hsiung 
Published: April 2020

Although keyword-based search algorithms usually do their jobs well, they may sometimes yield weird results. Despite of the fact that theWeb is the largest database, comparing to relational databases, the set of search operations for the Web is still primitive. This paper proposes two ways to remedy this: first, advanced information sources should be created. The role of advanced information sources of the Web is analogous to views of relational databases. Second, we propose several data processing tools based on the concept of advanced information sources. With these two mechanisms, the researcher tries to distinguish the data-centric view from the presentation view of the Web. In the paper, both the concept and an implementation are proposed.
Scheduling Parallel Work ow Applications with Energy-Aware on a Cloud Platform
Authors: Thanavanich Thanawut , Uthayopas Putchong 
Published: April 2020

An inefficient energy consumption of computing resources in a large cloud datacenter is a very important issue since the energy cost is now a major part of the operating expense. In this paper, the challenge of scheduling a parallel application on a cloud platform to achieve both time and energy efficiency is addressed by two new proposed algorithms Enhancing Heterogonous Earliest Finish Time (EHEFT) and Enhancing Critical Path on a Processor (ECPOP). The objective of these two algorithms is to reduce the energy consumption while achieving the best execution makespan. The algorithms use a metric that identifies and turns off the inefficient processors to reduce energy consumption. Then, the application tasks are rescheduled on fewer processors to obtain better energy efficiency. The experimental results from the simulation using real-world application workload show that the proposed algorithms not only reduce the energy consumption, but also maintain an acceptable scheduling quality. Thus, these algorithms can be employed to substantially reduce the operating cost in a large cloud computing system.
Parallel Similarity Join with Data Partitioning for Prex Filtering
Authors: Chongstitvatana Jaruloj , Bhirakit Methus 
Published: April 2020

Similarity join is necessary for many applications, such as text search and data preparation. Measuring the similarity between two strings is expensive because inexact match is allowed and strings in databases are long. To reduce the cost of similarity join, the filtering-and-verify approach reduces the number of string pairs which require the computation of the similarity function. Prefix filtering is a filterand- verify method that filters out dissimilar strings by examining only their prefixes. The effectiveness of prefix filtering depends on the length of the examined prefix. An adaptive method is proposed to find a suitable prefix length for filtering. Based on this concept, we propose to divide a dataset into partitions, and a suitable prefix length is determined for each partition. It also allows similarity join to run in parallel for each data partition. From our experiment, the proposed method achieves higher performance because the number of candidates is reduced and the program can execute in parallel. Moreover, the performance of the proposed method depends on the number of data partitions. If the data partition is too small, the chosen prefix length for each partition may not be optimal.
A Joint SVD based Watermarking and Encryption Scheme using Chaotic Logistic Map
Authors: Saikia Monjul , Majumder Swanirbhar 
Published: April 2020

Copyright protection and secrecy of some sensitive data is essential in this present digital era which deals with the advances in cloud computing and big data analytics. Digital watermarking is a popular method for copyright protection whereas cryptography takes care in hiding information as well as for secure transmission of data in a manner that is unreadable to a third party. Combination of both these techniques enhances the security and copyright protection aspects for the concealment of transmitted information. This paper presents a way of achieving those by combining both of these methods together as a joint scheme. Here a robust SVD based algorithm is proposed for embedding a watermark on a host image and then encrypts the resultant stego-image using chaotic logistic map in DCT coefficients. The decryption process is non-blind and requires the help of the key used in encryption. The joint algorithm has been found to be image independent due to its good performance for several popular test images.
Joint Optimal Resource Allocation and PAPR Reduction Algorithm for OFDMA Systems
Authors: Phoomchusak Pattama , Pirak Chaiyod 
Published: April 2020

One of the drawbacks of an orthogonal frequency division multiplexing (OFDM) system is the larger peak to averaged power ratio (PAPR). The PAPR reduction scheme is a complicated problem, especially when a resource allocation is considered jointly. In this paper, a joint algorithm for determining an optimal resource allocation with PAPR awareness is proposed. Firstly, an adaptive tone reservation assignment is performed by optimally choosing a group of subcarriers, whose channel gains are sufficiently high, to be the data subcarriers and the remaining subcarriers will be used as the reserved tones for reducing PAPR to the desired level. Secondly, an adaptive power adjustment for PAPR reduction technique is introduced for determining the allocated power of data subcarriers by using the water-filling approach with the joint PAPR and capacity constraints. By using the proposed joint algorithm, the PAPR threshold level is satisfied while the desired capacity could be achieved. From the results, the proposed algorithm achieves the better results comparing with a conventional partial transmit sequence (PTS) technique and the tone reservation (TR) technique in terms of PAPR, and probability of error performances, in which the side information is not required, in contrast with the other techniques.
A Novel technique for Reference Node Placement in Wireless Indoor Positioning Systems based on Fingerprint Technique
Authors: Kondee Kittipob , Aomumpai Supattra , Prommak Chutima 
Published: April 2020

Accuracy of location determination is one of the keys to success for any indoor positioning system. This performance metric is influenced by how reference nodes (RNs) are installed. However, most of existing research studies ignored the problem of optimal reference node placement and efficient system design for indoor positioning systems. In this paper, we propose a novel technique using heuristic approach that can design suitable location to install the reference nodes and improve the location determination performance for a single-floor area and the multi-floor building. A mathematical formulation of reference node placement is developed as a Binary Integer Linear Programming (BILP) problem. The proposed formulation aims to minimize the number of reference nodes and derive their suitable locations for the indoor positioning systems. We developed an efficient solution technique based on Simulated Annealing algorithm (SA), called Maximizing Summation of the Maximum RSS for Multi-floor building (MSMR-M). The results from performance study show that by using the proposed RN placement technique, the indoor positioning systems can gain up to five meters of accuracy at 90% precision for single-floor building. Moreover, in the case of the multi-floor building, the proposed technique can improve the error distances up to 20% which is better than those of the other techniques. The proposed technique can provide an average error distance within 1.42 meters where the grid spacing of fingerprint is 2m2m.