The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] Z(5900hit)

2161-2180hit(5900hit)

  • A Kind of Optimization Method of Loading Documents in OpenOffice.org

    Yuqing LAN  Li LI  Wenbin ZHOU  

     
    PAPER-Fundamentals of Information Systems

      Vol:
    E95-D No:3
      Page(s):
    778-785

    As a giant in open source community, OpenOffice.org has become the most popular office suite within Linux community. But OpenOffice.org is relatively slow while loading documents. Research shows that the most time consuming part is importing one page of whole document. If there are many pages in a document, the accumulation of time consumed can be astonishing. Therefore, this paper proposes a solution, which has improved the speed of loading documents through asynchronous importing mechanism: a document is not imported as a whole, but only part of the document is imported at first for display, then mechanism in the background is started to asynchronously import the remaining parts, and insert it into the drawing queue of OpenOffice.org for display. In this way, the problem can be solved and users don't have to wait for a long time. Application start-up time testing tool has been used to test the time consumed in loading different pages of documents before and after optimization of OpenOffice.org, then, we adopt the regression theory to analyse the correlation between the page number of documents and the loading time. In addition, visual modeling of the experimental data are acquired with the aid of matlab. An obvious increase in loading speed can be seen after a comparison of the time consumed to load a document before and after the solution is adopted. And then, using Microsoft Office compared with the optimized OpenOffice.org, their loading speeds are almost same. The results of the experiments show the effectiveness of this solution.

  • Ant Colony Optimization with Memory and Its Application to Traveling Salesman Problem

    Rong-Long WANG  Li-Qing ZHAO  Xiao-Fan ZHOU  

     
    PAPER-Numerical Analysis and Optimization

      Vol:
    E95-A No:3
      Page(s):
    639-645

    Ant Colony Optimization (ACO) is one of the most recent techniques for solving combinatorial optimization problems, and has been unexpectedly successful. Therefore, many improvements have been proposed to improve the performance of the ACO algorithm. In this paper an ant colony optimization with memory is proposed, which is applied to the classical traveling salesman problem (TSP). In the proposed algorithm, each ant searches the solution not only according to the pheromone and heuristic information but also based on the memory which is from the solution of the last iteration. A large number of simulation runs are performed, and simulation results illustrate that the proposed algorithm performs better than the compared algorithms.

  • Adaptive Digital Predistortion with Iterative Noise Cancelation for Power Amplifier Linearization

    Sungho JEON  Junghyun KIM  Jaekwon LEE  Young-Woo SUH  Jong-Soo SEO  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E95-B No:3
      Page(s):
    943-949

    In this paper, we propose a power amplifier linearization technique combined with iterative noise cancelation. This method alleviates the effect of added noises which prevents the predistorter (PD) from estimating the exact characteristics of the power amplifier (PA). To iteratively cancel the noise added in the feedback signal, the output signal of the power amplifier without noise is reconstructed by applying the inverse characteristics of the PD to the predistorted signals. The noise can be revealed by subtracting the reconstructed signals from the feedback signals. Simulation results based on the mean-square error (MSE) and power spectral density (PSD) criteria are presented to evaluate PD performance. The results show that the iterative noise cancelation significantly enhances the MSE performance, which leads to an improvement of the out-of-band power suppression. The performance of the proposed technique is verified by computer simulation and hardware test results.

  • Date Flow Optimization of Dynamically Coarse Grain Reconfigurable Architecture for Multimedia Applications

    Xinning LIU  Chen MEI  Peng CAO  Min ZHU  Longxing SHI  

     
    PAPER-Design Methodology

      Vol:
    E95-D No:2
      Page(s):
    374-382

    This paper proposes a novel sub-architecture to optimize the data flow of REMUS-II (REconfigurable MUltimedia System 2), a dynamically coarse grain reconfigurable architecture. REMUS-II consists of a µPU (Micro-Processor Unit) and two RPUs (Reconfigurable Processor Unit), which are used to speeds up control-intensive tasks and data-intensive tasks respectively. The parallel computing capability and flexibility of REMUS-II makes itself an excellent candidate to process multimedia applications, which require a large amount of memory accesses. In this paper, we specifically optimize the data flow to deal with those performance-hazard and energy-hungry memory accessing in order to meet the bandwidth requirement of parallel computing. The RPU internal memory could work in multiple modes, like 2D-access mode and transformation mode, according to different multimedia access patterns. This novel design can improve the performance up to 26% compared to traditional on-chip memory. Meanwhile, the block buffer is implemented to optimize the off-chip data flow through reducing off-chip memory accesses, which reducing up to 43% compared to direct DDR access. Based on RTL simulation, REMUS-II can achieve 1080p@30 fps of H.264 High Profile@ Level 4 and High Level MPEG2 at 200 MHz clock frequency. The REMUS-II is implemented into 23.7 mm2 silicon on TSMC 65 nm logic process with a 400 MHz maximum working frequency.

  • Performance-Driven Architectural Synthesis for Distributed Register-File Microarchitecture with Inter-Island Delay

    Juinn-Dar HUANG  Chia-I CHEN  Wan-Ling HSU  Yen-Ting LIN  Jing-Yang JOU  

     
    PAPER-VLSI Design Technology and CAD

      Vol:
    E95-A No:2
      Page(s):
    559-566

    In deep-submicron era, wire delay is becoming a bottleneck while pursuing higher system clock speed. Several distributed register (DR) architectures are proposed to cope with this problem by keeping most wires local. In this article, we propose the distributed register-file microarchitecture with inter-island delay (DRFM-IID). Though DRFM-IID is also one of the DR-based architectures, it is considered more practical than the previously proposed DRFM, in terms of delay model. With such delay consideration, the synthesis task is inherently more complicated than the one without inter-island delay concern since uncertain interconnect latency is very likely to seriously impact on the whole system performance. Therefore we also develop a performance-driven architectural synthesis framework targeting DRFM-IID. Several factors for evaluating the quality of results, such as number of inter-island transfers, timing-criticality of transfer, and resource utilization balancing, are adopted as the guidance while performing architectural synthesis for better optimization outcomes. The experimental results show that the latency and the number of inter-cluster transfers can be reduced by 26.9% and 37.5% on average; and the latter is commonly regarded as an indicator for power consumption of on-chip communication.

  • VANET Broadcast Protocol Based on Fuzzy Logic and Lightweight Retransmission Mechanism

    Celimuge WU  Satoshi OHZAHATA  Toshihiko KATO  

     
    PAPER-Network

      Vol:
    E95-B No:2
      Page(s):
    415-425

    Vehicular ad hoc networks have been attracting the interest of both academic and industrial communities on account of their potential role in Intelligent Transportation Systems (ITS). However, due to vehicle movement and fading in wireless communications, providing a reliable and efficient multi-hop broadcast service in vehicular ad hoc networks is still an open research topic. In this paper, we propose FUZZBR (FUZZy BRoadcast), a fuzzy logic based multi-hop broadcast protocol for information dissemination in vehicular ad hoc networks. FUZZBR has low message overhead since it uses only a subset of neighbor nodes to relay data messages. In the relay node selection, FUZZBR jointly considers multiple metrics of inter-vehicle distance, node mobility and signal strength by employing the fuzzy logic. FUZZBR also uses a lightweight retransmission mechanism to retransmit a packet when a relay fails. We use computer simulations to evaluate the performance of FUZZBR.

  • Distributed Estimation for Vector Signal in Linear Coherent Sensor Networks

    Chien-Hsien WU  Ching-An LIN  

     
    PAPER-Network

      Vol:
    E95-B No:2
      Page(s):
    460-465

    We introduce the distributed estimation of a random vector signal in wireless sensor networks that follow coherent multiple access channel model. We adopt the linear minimum mean squared error fusion rule. The problem of interest is to design linear coding matrices for those sensors in the network so as to minimize mean squared error of the estimated vector signal under a total power constraint. We show that the problem can be formulated as a convex optimization problem and we obtain closed form expressions of the coding matrices. Numerical results are used to illustrate the performance of the proposed method.

  • Multi-Antenna Secure Communications via Selective Diversity

    Ling TANG  Hao CHEN  Jianhui WU  

     
    LETTER-Fundamental Theories for Communications

      Vol:
    E95-B No:2
      Page(s):
    587-590

    We consider secure wireless communications, where a source is communicating to a destination in the presence of K (K > 1) eavesdroppers. The source and destination both are equipped with multiple antennas, while each eavesdropper has a single antenna. The source aims to maximize the communication rate to the destination, while concealing the message from all the eavesdroppers. Combined with selective diversity, we propose a heuristic secrecy transmission scheme where the multiple-input-multiple-output (MIMO) secrecy channel is simplified into a multiple-input-single-output (MISO) one with the highest orthogonality to the eavesdropper channels. Then convex optimization is applied to obtain the optimal transmit covariance matrix for this selected MISO secrecy channel. Numerical results are provided to illustrate the efficacy of the proposed scheme.

  • A Multi-Domain Access Control Infrastructure Based on Diameter and EAP

    Souheil BEN AYED  Fumio TERAOKA  

     
    PAPER

      Vol:
    E95-D No:2
      Page(s):
    503-513

    The evolution of Internet, the growth of Internet users and the new enabled technological capabilities place new requirements to form the Future Internet. Many features improvements and challenges were imposed to build a better Internet, including securing roaming of data and services over multiple administrative domains. In this research, we propose a multi-domain access control infrastructure to authenticate and authorize roaming users through the use of the Diameter protocol and EAP. The Diameter Protocol is a AAA protocol that solves the problems of previous AAA protocols such as RADIUS. The Diameter EAP Application is one of Diameter applications that extends the Diameter Base Protocol to support authentication using EAP. The contributions in this paper are: 1) first implementation of Diameter EAP Application, called DiamEAP, capable of practical authentication and authorization services in a multi-domain environment, 2) extensibility design capable of adding any new EAP methods, as loadable plugins, without modifying the main part, and 3) provision of EAP-TLS plugin as one of the most secure EAP methods. DiamEAP Server basic performances were evaluated and tested in a real multi-domain environment where 200 users attempted to access network using the EAP-TLS method during an event of 4 days. As evaluation results, the processing time of DiamEAP using the EAP-TLS plugin for authentication of 10 requests is about 20 ms while that for 400 requests/second is about 1.9 second. Evaluation and operation results show that DiamEAP is scalable and stable with the ability to handle more than 6 hundreds of authentication requests per second without any crashes. DiamEAP is supported by the AAA working group of the WIDE Project.

  • Control of the Cart-Pendulum System Based on Discrete Mechanics – Part I: Theoretical Analysis and Stabilization Control –

    Tatsuya KAI  

     
    PAPER-Systems and Control

      Vol:
    E95-A No:2
      Page(s):
    525-533

    This paper considers the discrete model of the cart-pendulum system modeled by discrete mechanics, which is known as a good discretizing method for mechanical systems and has not been really applied to control theory. We first sum up basic concepts on discrete mechanics and discuss the explicitness of the linear approximation of the discrete Euler-Lagrange Equations. Next, the discrete cart-pendulum system is derived and analyzed from the viewpoint of solvability of implicit nonlinear control systems. We then show a control algorithm to stabilize the discrete cart-pendulum based on the discrete-time optimal regulator theory. Finally, some simulations are shown to demonstrate the effectiveness of the proposed algorithm.

  • Bayesian Radar Detection with Orthogonal Rejection

    Chengpeng HAO  Xiuqin SHANG  Francesco BANDIERA  Long CAI  

     
    LETTER-Digital Signal Processing

      Vol:
    E95-A No:2
      Page(s):
    596-599

    This letter focuses on the design of selective receivers for homogeneous scenarios where a very small number of secondary data are available. To this end, at the design stage it is assumed that the cell under test (CUT) contains a fictitious signal orthogonal to the nominal steering vector under the null hypothesis; the clutter covariance matrix is modeled as a random matrix with an inverse complex Wishart distribution. Under the above assumptions, we devise two Bayesian detectors based on the GLRT criterion, both one-step and two-step. It is shown that the proposed detectors have the same detection structure as their non-Bayesian counterparts, substituting the colored diagonal sample covariance matrix (SCM) for the classic one. Finally, a performance assessment, conducted by Monte Carlo simulations, has shown that our detectors ensure better rejection capabilities of mismatched signals than the existing Bayesian detectors, at the price of a certain loss in terms of detection of matched signals.

  • Speech Prior Estimation for Generalized Minimum Mean-Square Error Short-Time Spectral Amplitude Estimator

    Ryo WAKISAKA  Hiroshi SARUWATARI  Kiyohiro SHIKANO  Tomoya TAKATANI  

     
    LETTER-Engineering Acoustics

      Vol:
    E95-A No:2
      Page(s):
    591-595

    In this paper, we introduce a generalized minimum mean-square error short-time spectral amplitude estimator with a new prior estimation of the speech probability density function based on moment-cumulant transformation. From the objective and subjective evaluation experiments, we show the improved noise reduction performance of the proposed method.

  • Design of Electromagnetic Wave Absorber Panels for Oblique Incidence Using Wire Array Sheet

    Shinichiro YAMAMOTO  Daisuke ISHIHARA  Kenichi HATAKEYAMA  

     
    LETTER-Electromagnetic Compatibility(EMC)

      Vol:
    E95-B No:2
      Page(s):
    631-634

    This paper proposes a method of designing EM absorber panels under oblique incident waves. TM and TE wave reflection characteristics of the absorber panel show its anisotropy under oblique incidence. By using the wire array sheet proposed this paper, TM and TE reflection coefficients in oblique incidence can be matched at almost the same frequency range.

  • Low Pass Filter-Less Pulse Width Controlled PLL Using Time to Soft Thermometer Code Converter Open Access

    Toru NAKURA  Kunihiro ASADA  

     
    PAPER-Integrated Electronics

      Vol:
    E95-C No:2
      Page(s):
    297-302

    This paper demonstrates a pulse width controlled PLL without using an LPF. A pulse width controlled oscillator accepts the PFD output where its pulse width controls the oscillation frequency. In the pulse width controlled oscillator, the input pulse width is converted into soft thermometer code through a time to soft thermometer code converter and the code controls the ring oscillator frequency. By using this scheme, our PLL realizes LPF-less as well as quantization noise free operation. The prototype chip achieves 60 µm 20 µm layout area using 65 nm CMOS technology along with 1.73 ps rms jitter while consuming 2.81 mW under a 1.2 V supply with 3.125 GHz output frequency.

  • Fully Distributed Self-Organization of Shortest Spanning Tree and Optimal Sink Node Position for Large-Scale Wireless Sensor Network

    Kazunori MIYOSHI  Masahiro JIBIKI  Tutomu MURASE  

     
    PAPER-Network

      Vol:
    E95-B No:2
      Page(s):
    449-459

    The primary challenges faced by wireless sensor networks are how to construct the shortest spanning tree and how to determine the optimal sink node position in terms of minimizing the data transmission times and their variances for data gathering from all sensor nodes to a sink node. To solve these two problems, we propose a novel algorithm that uses the polygonal affine shortening algorithm with flow aggregation. This algorithm enables a wireless sensor network that has movable sensor nodes and one movable sink node to self-organize the shortest spanning tree and self-determine the optimal sink node position in a fully distributed manner. We also show that our algorithm is faster than the existing shortest path algorithm in terms of computational complexity.

  • Control of the Cart-Pendulum System Based on Discrete Mechanics – Part II: Transformation to Continuous-Time Inputs and Experimental Verification –

    Tatsuya KAI  Kensuke BITO  Takeshi SHINTANI  

     
    PAPER-Systems and Control

      Vol:
    E95-A No:2
      Page(s):
    534-541

    In this paper, we consider a stabilization problem for the cart-pendulum system based on discrete mechanics, which is known as a good discretizing method for mechanical systems and has not been really applied to control theory. First, the continuous and discrete cart-pendulum systems are explained. We next propose a transformation method that converts a discrete-time input derived from the discrete-time optimal regulator theory into a continuous-time zero-order hold input, and carry out some simulations on stabilization of the cart-pendulum system by the transformation method. Then, we apply not only our proposed method but also existing methods to an experimental laboratory of the cart-pendulum system and perform some experiments in order to verify the availability of the proposed method.

  • Call Admission Control on Single Node Networks under Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) Scheduler

    Masaki HANADA  Hidenori NAKAZATO  Hitoshi WATANABE  

     
    PAPER-Network

      Vol:
    E95-B No:2
      Page(s):
    401-414

    Multimedia applications such as music or video streaming, video teleconferencing and IP telephony are flourishing in packet-switched networks. Applications that generate such real-time data can have very diverse quality-of-service (QoS) requirements. In order to guarantee diverse QoS requirements, the combined use of a packet scheduling algorithm based on Generalized Processor Sharing (GPS) and leaky bucket traffic regulator is the most successful QoS mechanism. GPS can provide a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds for leaky bucket constrained sessions under GPS are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In order to solve this problem, a scheduling policy called Output Rate-Controlled Generalized Processor Sharing (ORC-GPS) was proposed in [17]. ORC-GPS is a rate-based scheduling like GPS, and controls the service rate in order to lower the delay bounds for leaky bucket constrained sessions. In this paper, we propose a call admission control (CAC) algorithm for ORC-GPS, for leaky-bucket constrained sessions with deterministic delay requirements. This CAC algorithm for ORC-GPS determines the optimal values of parameters of ORC-GPS from the deterministic delay requirements of the sessions. In numerical experiments, we compare the CAC algorithm for ORC-GPS with one for GPS in terms of schedulable region and computational complexity.

  • A New Re-Ranking Method Using Enhanced Pseudo-Relevance Feedback for Content-Based Medical Image Retrieval

    Yonggang HUANG  Jun ZHANG  Yongwang ZHAO  Dianfu MA  

     
    LETTER-Image Processing and Video Processing

      Vol:
    E95-D No:2
      Page(s):
    694-698

    We propose a novel re-ranking method for content-based medical image retrieval based on the idea of pseudo-relevance feedback (PRF). Since the highest ranked images in original retrieval results are not always relevant, a naive PRF based re-ranking approach is not capable of producing a satisfactory result. We employ a two-step approach to address this issue. In step 1, a Pearson's correlation coefficient based similarity update method is used to re-rank the high ranked images. In step 2, after estimating a relevance probability for each of the highest ranked images, a fuzzy SVM ensemble based approach is adopted to re-rank the images. The experiments demonstrate that the proposed method outperforms two other re-ranking methods.

  • A 24 dB Gain 51–68 GHz Common Source Low Noise Amplifier Using Asymmetric-Layout Transistors

    Ning LI  Keigo BUNSEN  Naoki TAKAYAMA  Qinghong BU  Toshihide SUZUKI  Masaru SATO  Yoichi KAWANO  Tatsuya HIROSE  Kenichi OKADA  Akira MATSUZAWA  

     
    PAPER

      Vol:
    E95-A No:2
      Page(s):
    498-505

    At mm-wave frequency, the layout of CMOS transistors has a larger effect on the device performance than ever before in low frequency. In this work, the distance between the gate and drain contact (Dgd) has been enlarged to obtain a better maximum available gain (MAG). By using the asymmetric-layout transistor, a 0.6 dB MAG improvement is realized when Dgd changes from 60 nm to 200 nm. A four-stage common-source low noise amplifier is implemented in a 65 nm CMOS process. A measured peak power gain of 24 dB is achieved with a power dissipation of 30 mW from a 1.2-V power supply. An 18 dB variable gain is also realized by adjusting the bias voltage. The measured 3-dB bandwidth is about 17 GHz from 51 GHz to 68 GHz, and noise figure (NF) is from 4.0 dB to 7.6 dB.

  • Athermal Wavelength Filters toward Optical Interconnection to LSIs

    Yuki ATSUMI  Manabu ODA  Joonhyun KANG  Nobuhiko NISHIYAMA  Shigehisa ARAI  

     
    PAPER

      Vol:
    E95-C No:2
      Page(s):
    229-236

    Photonic integrated circuits (PICs) produced by large-scale integration (LSI) on Si platforms have been intensively researched. Since thermal diffusion from the LSI logic layer is a serious obstacle to realizing a Si-based optical integrated circuit, we have proposed and realized athermal wavelength filters using Si slot waveguides embedded with benzocyclobutene (BCB). First, the athermal conditions were theoretically investigated by controlling the waveguide and gap width of the slot waveguides. In order to introduce the calculated waveguide structures to wavelength filters, the propagation losses and bending losses of the Si slot waveguides were evaluated. The propagation losses were measured to be 5.6 and 5.3 dB/cm for slot waveguide widths of 500 and 700 nm, respectively. Finally, athermal wavelength filters, a ring resonator, and a Mach-Zhender interferometer (MZI) with a slot waveguide width of 700 nm were designed and fabricated. Further, a temperature coefficient of -0.9 pm/K for the operating wavelength was achieved with the athermal MZI.

2161-2180hit(5900hit)