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

Keyword Search Result

[Keyword] system(3183hit)

2081-2100hit(3183hit)

  • Evaluation of a Multi Agent Framework for Open Distributed Systems

    Nobukazu YOSHIOKA  Takahiro KAWAMURA  Akihiko OHSUGA  Shinichi HONIDEN  

     
    INVITED PAPER

      Vol:
    E85-A No:11
      Page(s):
    2396-2406

    Interoperability between different systems is becoming a more important issue for open distributed systems. In this paper, we investigate what kind of framework we need for constructing open distributed systems. Firstly, we enumerate the features and functions which the framework should have. We then evaluate a proposed multi-agent framework, Bee-gent, by using a typical example of open distributed systems. Lastly, we show clearly what is required for such a framework.

  • Security Architecture Using RCNC Code and M-Sequence for WLANs

    Hyung-Yun KONG  Il-Han JEONG  Kwang-Chun HO  

     
    LETTER-Information Security

      Vol:
    E85-A No:11
      Page(s):
    2547-2550

    To secure the interactive multimedia applications in WLANs (wireless local area networks), it is pertinent to implement a number of security services such as authentication, key exchange and real-time encryption/decryption. The implementation of those security services in WLANs presents a complex and challenging environment because these services may deplete the limited network resources and increases the burden of supporting the quality of service for multimedia applications. As an alternative solution, we thus introduce a new security system, which is based on RCNC (Random Connection Node Convolutional) code and M-sequence. The architecture of RCNC code formed by developing the conventional convolutional code structure has an excellent security operation as well as an error correction function. To verify the performance of our proposed system, the computer simulations have been performed in IEEE 802.11b environment.

  • Specification and Analysis of the Contract Net Protocol Based on State Machine Model

    Goichi ITABASHI  Yoshiaki HARAMOTO  Yasushi KATO  Kaoru TAKAHASHI  Norio SHIRATORI  

     
    LETTER

      Vol:
    E85-A No:11
      Page(s):
    2447-2452

    In this paper, we clarify the properties of the contract net protocol based on its formal specification. To specify the contract net protocol, we propose a formal specification method for an agent system. In this method, agents are modeled as communicating finite state machines. To deal with the behavior of agents and its time passage explicitly, we incorporate the concept of time into the communicating finite state machine. The contract net protocol is specified based on the specification method proposed in this paper. From the specification, we analyze the possibility about agent deadlock and its avoidance solution.

  • Efficient File Management for Hard Disk Drive Embedded Digital Satellite Receiver

    Yeong Kyeong SEONG  Yun-Hee CHOI  Tae-Sun CHOI  

     
    LETTER-Multimedia Systems

      Vol:
    E85-B No:11
      Page(s):
    2554-2557

    This paper presents efficient file management of a hard disk drive embedded digital satellite receiver. The digital broadcasting technology enables multimedia access via broadcasting systems. The amount of digital data to be processed is increased remarkably as compared to the previous analog broadcasting environments. The efficient digital data storage and management technology are discussed in this paper to cope with these changes. The DSR uses a new file system that is designed by considering disk cluster sizes and limited memories in the system, which is more appropriate than that of general Personal Computers. The proposed system enables us to watch broadcasting and to manage multimedia data efficiently.

  • Context-Dependent Agents for Real-Time Scheduling in Manufacturing Systems

    Toshiyuki MIYAMOTO  Bruce H. KROGH  Sadatoshi KUMAGAI  

     
    PAPER

      Vol:
    E85-A No:11
      Page(s):
    2407-2413

    Autonomous distributed manufacturing systems (ADMS) consist of multiple intelligent components with each component acting according to its own judgments. The ADMS objective is to realize more agile and adaptive manufacturing systems. This paper presents the introduction of context-dependent agents (CDAs) in ADMS that switch strategies depending on system conditions to achieve better performance than can be realized by agents that use the same strategies under all system conditions. For the real-time job scheduling problem, the paper presents a basic CDA architecture and the results of an extensive empirical evaluation of its performance relative to other rule-based schemes based on several common indices for real-time dispatch.

  • Reverse Link Capacity of Orthogonal Multi-Code DS-CDMA with Multiple Connections

    Fumiyuki ADACHI  

     
    LETTER-Wireless Communication Technology

      Vol:
    E85-B No:11
      Page(s):
    2522-2526

    DS-CDMA provides a flexible support for the low-to-high bit rate of multimedia services upon a specific user's request. A simple capacity expression is derived for a power-controlled reverse link of orthogonal multi-code DS-CDMA with multiple connections. It is found that an orthogonal multi-code user having multiple connections is equivalent to a single connection user, but with a spreading factor reduced by a factor of the total number of parallel codes and a required signal energy per symbol-to-interference plus noise power spectrum density ratio which is the average taken over multiple connections. Furthermore, the use of antenna diversity is found equivalent to the use of higher spreading factor increased by a factor of the number of antennas.

  • Verifying Fault Tolerance of Concurrent Systems by Model Checking

    Tomoyuki YOKOGAWA  Tatsuhiro TSUCHIYA  Tohru KIKUNO  

     
    PAPER

      Vol:
    E85-A No:11
      Page(s):
    2414-2425

    Model checking is a technique that can make a verification for finite state systems absolutely automatic. We propose a method for automatic verification of fault-tolerant concurrent systems using this technique. Unlike other related work, which is tailored to specific systems, we are aimed at providing an approach that can be used to verify various kinds of systems against fault tolerance. The main obstacle in model checking is state explosion. To avoid the problem, we design this method so that it can use a symbolic model checking tool called SMV (Symbolic Model Verifier). Symbolic model checking can overcome the problem by expressing the state space and the transition relation by Boolean functions. Assuming that a system to be verified is modeled as a guarded command program, we design a modeling language and propose a translation method from the modeling language to the input language of SMV. We show the results of applying the proposed method to various examples to demonstrate the feasibility of the method.

  • Reliability of Low Temperature Poly-Si GOLD (Gate-Overlapped LDD) Structure TFTs

    Tetsuo KAWAKITA  Hidehiro NAKAGAWA  Yukiharu URAOKA  Takashi FUYUKI  

     
    PAPER-Active Matrix Displays

      Vol:
    E85-C No:11
      Page(s):
    1854-1859

    Low-temperature poly-Si thin film transistor with gate-overlapped LDD (GOLD) structure was fabricated. Reliability was evaluated using electrical stress method comparing conventional LDD and single drain structures. As previous researchers have reported, we have confirmed that the degradation of ON current and the field effect mobility was very small compared to conventional LDD or non-LDD structures. We have analyzed the reliability of the GOLD TFT using two-dimensional device simulator. We have clarified that vertical negative field plays a dominant role for improving the reliability in the GOLD TFT. Impact ionization occurs far from the interface between the oxide and poly-silicon by the vertical negative field. GOLD structure is promising for the realization of system on panel.

  • Localization and Dynamic Tracking Using Wireless-Networked Sensors and Multi-Agent Technology: First Steps

    Zhidong DENG  Weixiong ZHANG  

     
    INVITED PAPER

      Vol:
    E85-A No:11
      Page(s):
    2386-2395

    We describe in this paper our experience of developing a large-scale, highly distributed multi-agent system using wireless-networked sensors. We provide solutions to the problems of localization (position estimation) and dynamic, real-time mobile object tracking, which we call PET problems for short, using wireless sensor networks. We propose system architectures and a set of distributed algorithms for organizing and scheduling cooperative computation in distributed environments, as well as distributed algorithms for localization and real-time object tracking. Based on these distributed algorithms, we develop and implement a hardware system and software simulator for the PET problems. Finally, we present some experimental results on distance measurement accuracy using radio signal strengths of the wireless sensors and discuss future work.

  • Performance of DCSK in Multipath Environments: A Comparison with Systems Using Gold Sequences

    Franco CHIARALUCE  Ennio GAMBI  Roberto GARELLO  Paola PIERLEONI  

     
    PAPER-Spread Spectrum Technologies and Applications

      Vol:
    E85-A No:10
      Page(s):
    2354-2363

    A performance comparison is developed between a chaotic communication system and a spread spectrum system with similar features in terms of bandwidth and transceiver structure but based on more conventional Gold sequences. Comparison is made in the presence of noise and multipath contributions which degrade the channel quality. It is shown that, because of its more favourable correlation properties, the chaotic scheme exhibits lower error rates, at a parity of the bandwidth expansion factor. The same favourable correlation properties are also used to explain and show, through a numerical example, the benefits of chaotic segments in a multi-user environment.

  • Wrinkly Surface Generated on Irregular Mesh by Using IST Generalized on Code Space and Multi-Dimensional Space: Unification of Interpolation Surface and Fractal

    Tadahiro FUJIMOTO  Yoshio OHNO  Kazunobu MURAOKA  Norishige CHIBA  

     
    PAPER-Computer Graphics

      Vol:
    E85-D No:10
      Page(s):
    1663-1677

    Interpolation surfaces, such as Bezier or B-spline surface, are usually used for representing smooth man-made objects and provide an excellent ability to control the shape of a surface by intuitively moving control points. In contrast, the fractal technique is used for creating various complex shapes, mainly of natural objects, that have self-similarity using simple procedures. We have proposed the "wrinkly surface (WR surface)" for combining the advantages of interpolation surfaces and fractals. In this paper, we propose the expansion of the construction scheme of the WR surface to irregular meshes. Control points of a WR surface are interpolated using the "Iterated Shuffle Transformation (IST)." Therefore, in order to achieve the expansion, we first generalize the IST on code spaces, and then propose multi-dimensional IST defined on geometric spaces. By creating various shape model examples, we demonstrate the usefulness of the WR surface as a modeling tool.

  • Joint System of Terrestrial and High Altitude Platform Station (HAPS) Cellular for W-CDMA Mobile Communications

    Shinya MASUMURA  Masao NAKAGAWA  

     
    PAPER

      Vol:
    E85-B No:10
      Page(s):
    2051-2058

    The plan of High Altitude Platform Station (HAPS) is considered as a revolutionary wireless system plan with several economic and technological advantages over both space- or ground-based counterparts. In this paper, we propose a joint system of terrestrial and HAPS cellular for Wideband-CDMA mobile communication. This system makes the conventional terrestrial W-CDMA cellular area smaller and the remainder area covered by HAPS to increase the total capacity. Furthermore in down link channel, we introduce the polarized wave and doughnut-like radiation. However, in the proposed system, the performance would be dependent on the terminal position especially near the boundary of doughnut-like cell zone. To overcome this, site diversity that uses both signals from terrestrial Base Station and HAPS Base Station is also introduced. To confirm the availability of the proposed system, we evaluate the system performance by computer simulation.

  • Minimizing Up-Front Data Transmission on Web Based Vector GIS

    Young-Hwan OH  Hae-Young BAE  

     
    PAPER-Databases

      Vol:
    E85-D No:10
      Page(s):
    1628-1635

    In conventional Web Geographic Information System (GIS), there are serious drawbacks of high waiting time and low accessibility because the subsequent query has to wait until all the spatial data has been completely transmitted. In addressing these problems, this paper proposes a progressive transmission method which can reduce waiting time and increase accessibility. The proposed method has the following steps. First, significant vertices of geographic objects are selected into based on an algorithm, Priority_Order_Estimation (POE). Second, the selected vertices are inserted the data structure, Priority_Order_Queue (POQ). This allows a client to view, to request and occasionally to reject spatial data, rather than waiting for the whole map to arrive. Third, the transmission steps are processed progressively, where significant vertices of POQ are sent from server to client one by one. In the final step, if necessary, the entire spatial data set of SENDOBJSP, which is a transmission structure, is transmitted so that the original map is accurately displayed. The performance of the system proposed here has been evaluated according to the factors such as system response time and client storage space. For the comparisons, the total transmission method, layer transmission method and the proposed four-step transmission method were used. Compared with the conventional Web-based GIS, the system response time is twenty-two percent shorter and client storage space is reduced by about twenty-one percent. As a result, performance improvement, fast response time and less client storage usage, is achieved. Therefore, the proposed method can make a significant contribution in support of Web-based Vector GIS applications such as Environmental Management, Map On Demand Service and Assessment and Planning System.

  • Equalization for Infrared Wireless Systems Using OOK-CDMA

    Hiroe YAMAGUCHI  Ryoko MATSUO  Tomoaki OHTSUKI  Iwao SASASE  

     
    PAPER-Optical Wireless Communications

      Vol:
    E85-B No:10
      Page(s):
    2292-2299

    In this paper, we propose an equalizer for indoor infrared wireless systems using on-off keying code-division multiple-access (OOK-CDMA). The proposed equalizer has a decision-feedforward filter to mitigate the effects of inter symbol interference (ISI) at the previous chip position of the sampling instant. We evaluate the performance of indoor infrared wireless systems using OOK-CDMA with three kinds of equalizers: the decision-feedback qualizer (DFE), the feedforward equalizer (FE), and the proposed equalizer. To estimate the impulse response, we use the training sequence that alternates '1' and '0' sequentially. Among three kinds of equalizers, we show that the system with the proposed equalizer can achieve the best bit error rate (BER) performance at high bit rate, while the system with the FE achieves the best BER performance when the bit rate is low.

  • Improvement of BPSK Space-Time Turbo Code with Full Rate and Full Antenna Diversity

    Chikara KOJIMA  Takahiko SABA  

     
    PAPER-Communication Theory and Signals

      Vol:
    E85-A No:10
      Page(s):
    2248-2255

    Space-time turbo codes have both advantages of space-time codes and turbo codes, and the space-time turbo code proposed by Su and Geraniotis is known to achieve full coding rate and full antenna diversity. This paper presents some improvements of their space-time turbo code in a two-antenna configuration. We first propose a new condition for full antenna diversity which imposes less constraints on the interleaver. Next, by applying a method used to improve turbo trellis-coded modulation to the space-time turbo code, we propose a new decoding algorithm which utilizes more precise estimates on extrinsic information. Simulation results show that the proposed condition assures full antenna diversity and the new decoding algorithm provides a better performance than that of Su and Geraniotis'.

  • MC-VSG BNet System for High-Rate Multimedia Applications

    Young-Hwan YOU  Cheol-Hee PARK  Dae-Ki HONG  Min-Chul JU  Myoung-Jin KIM  Jin-Woong CHO  

     
    PAPER

      Vol:
    E85-B No:10
      Page(s):
    2126-2135

    In this paper, a multi-coded variable spreading gain (MC-VSG) CDMA system employing a binary transmission of MC signals by introducing a level clipper, termed MC-VSG BNet system, is proposed for a possible candidate of wireless personal area network (WPAN) and 3 G cellular applications. With an emphasis on the MC-VSG BNet physical layer and the system performance, we address the concise specification of the MC-VSG BNet system including the spreading code, level clipping, modulation, coding, and frame format. Especially, we focus on the level clipping of multi-level MC signals for both power- and cost-efficient implementation and the VSG code design fir high-rate transmissions. From the receiver performance based on simulation results, in addition to simple receiver structure, an acceptable performance degradation of the MC-VSG BNet system over the existing DS/CDMA system is observed, while guaranteeing an high bit rate transmission.

  • The Development of a Multimedia Transcoding System for Mobile Access to Video Conferencing

    Hiroyuki KASAI  Mike NILSSON  Tim JEBB  Mike WHYBRAY  Hideyoshi TOMINAGA  

     
    PAPER

      Vol:
    E85-B No:10
      Page(s):
    2171-2181

    Today, many audiovisual delivery systems, including video streaming and video conferencing, are being developed for use over a range of networking technologies, the differing characteristics of which pose problems for service level interoperability. Multimedia transcoding is one means to provide interoperability between different types of audiovisual terminals and between terminals that connect to different networks. In this paper, we will present a multimedia transcoder system, which provides interoperability between video conferencing terminals on IP networks and mobile terminals on mobile networks.

  • An Efficiency Improvement on an Unlinkable Divisible Electronic Cash System

    Toru NAKANISHI  Yuji SUGIYAMA  

     
    PAPER-Information Security

      Vol:
    E85-A No:10
      Page(s):
    2326-2335

    We present an efficiency improvement on an existing unlinkable divisible e-cash system. In the based e-cash system, an e-coin can be divided to spent, and thus the exact payments are available. Furthermore, to protect customer's privacy, the system also satisfies the unlinkability in all the payments, which is not satisfied in other existing divisible e-cash systems. The unlinkability means the infeasibility of determining whether two payments are made by the same customer. However, in the unlinkable divisible e-cash system, the payment protocol needs O(N) computations, and thus inefficient, where N indicates the divisibility precision. For example, in case of N=100,000, about 200,000 exponentiations are needed for the worst. We improve the payment protocol using the tree approach. In case of N=100,000, the protocol with our improvement needs only about 600 exponentiations for the worst. This good result can be obtained for other N which is more than about 100.

  • A Novel Cryptosystem with Lock Generation and Sum-Difference Replacement Ladder

    Victor R. L. SHEN  Tzer-Shyong CHEN  

     
    LETTER-Applications of Information Security Techniques

      Vol:
    E85-D No:10
      Page(s):
    1719-1722

    According to the grey data generating techniques in grey system theory, we propose a novel cryptosystem, whose applications can develop a new direction in the field of information security. In this paper, we present the concepts of sum-lock, difference-lock, sum-ladder, and difference-ladder. By using these concepts, we can obtain a cryptosystem with lock generation and sum-difference replacement ladder. In addition, we provide the encryption and decryption algorithms of our cryptosystem and adopt an illustrative example to verify it.

  • Multiple Pre-Rake Filtering Based on the Predicted Channel Impulse Response in the Transmitter and a Rake Combiner in the Receiver for TDD/DS-CDMA Mobile Communication Systems

    Chang-Jun AHN  Iwao SASASE  

     
    PAPER-Wireless Communication Technology

      Vol:
    E85-B No:10
      Page(s):
    2282-2291

    The pre-Rake system is known as a technique in TDD DS/CDMA system to reduce the mobile complexity and achieve the same BER performance like Rake receiver. The pre-Rake system itself is not optimum, since the channel impulse responses of uplink and downlink are slightly different in TDD system, so the signal- to-noise ratio (SNR) can be maximized with a matched filter based Rake receiver, which has not been considered in the conventional pre-Rake system. Furthermore pre-Rake system is sensitive to the Doppler frequency. Even though the pre-Rake system has the ability to suppress other user interference, it is not efficient to maximize the received signal in high Doppler frequency. However, Rake combiner is utilized for the detection method in our proposed system. So the maximized signal can keep the orthogonality better than the pre-Rake system and our proposed system can compensate the Doppler frequency effect. From these reasons, our system achieves better BER performance than that of the pre-Rake system with increasing the number of users in high Doppler frequency.

2081-2100hit(3183hit)