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

Keyword Search Result

[Keyword] NDIR(25hit)

21-25hit(25hit)

  • An Analytical Approach to Model Indirect Effect Caused by Electrostatic Discharge

    Osamu FUJIWARA  

     
    PAPER

      Vol:
    E79-B No:4
      Page(s):
    483-489

    It is well recognized that the electromagnetic interference due to indirect electrostatic discharge (ESD) is not always proportional to the ESD voltage and also that the lower voltage ESD sometimes causes the more serious failure to high-tech information equipment. In order to theoretically examine the peculiar phenomenon, we propose an analytical approach to model the indirect ESD effect. A source ESD model is given here using the spark resistance presented by Rompe and Weizel. Transient electromagnetic fields due to the ESD event are analyzed, which are compared with the experimental data carefully given by Wilson and Ma. A model experiment for indirect ESD is also conducted to confirm the validity of the ESD model presented here.

  • Shape Reconstruction of Hybrid Reflectance Object Using Indirect Diffuse Illumination

    Tae Eun KIM  Jong Soo CHOI  

     
    PAPER

      Vol:
    E78-D No:12
      Page(s):
    1581-1590

    A new approach is presented for recovering the 3-D shape from shading image. Photometric Stereo Method (PSM) is generally based on the direct illumination. PSM in this paper is modified with the indirect diffuse illumination method (IDIM), and then applied to hybrid reflectance model which consists of two components; the Lambertian reflectance and the specular reflectance. Under the hybrid reflectance model and the indirect diffuse illumination circumstances, the 3-D shape of objects can be recovered from the surface normal vector extracted from the surface roughness, the surface reflectance ratio, and the intensity value of a pixel. This method is rapid because of using the reference table, simplifies the restriction condition about the reflectance function in prior studies without any loss in performance, and can be applied to various types of surfaces by defining general reflectance function.

  • Parameter Adjustment Using Neural-Network-Based Genetic Algorithms for Guaranteed QOS in ATM Networks

    Li-Der CHOU  Jean-Lien C. WU  

     
    PAPER

      Vol:
    E78-B No:4
      Page(s):
    572-579

    A number of flexible control mechanisms used in buffer management, congestion control and bandwidth allocation have been proposed to improve the performance of ATM networks by introducing parameters, such as threshold, push-out probability and incremental bandwidth size of a virtual path, which are adjustable by network providers. However, it is difficult to adaptively adjust these parameters, since the traffic in ATM networks is further complicated by accommodating various kinds of services. To overcome the problem, we propose in this paper a control scheme based on the genetic algorithms and the neural estimator. The neural estimator forecasts the future QOS values for each candidate parameter set, and the genetic algorithms select the best one to control the real network. An example of buffer management in an ATM switch is examined in this paper. Simulation results show the effectiveness of the proposed control scheme in adaptively adjusting the parameter set even when the traffic environment and the QOS requirements are dynamically changing.

  • Computing the Expected Maximum Number of Vertex-Disjoint s-t Paths in a Probabilistic Basically Series-Parallel Digraph

    Peng CHENG  Shigeru MASUYAMA  

     
    PAPER-Graphs, Networks and Matroids

      Vol:
    E76-A No:12
      Page(s):
    2089-2094

    In this paper, we propose a polynomial time algorithm for computing the expected maximum number of vertex-disjoint s-t paths in a probabilistic basically series-parallel directed graph and a probabilistic series-parallel undirected graph with distinguished source s and sink t(st), where each edge has a mutually independent failure probability and each vertex is assumed to be failure-free.

  • On a Realization of "Flow-Saturation" by Adding Edges in an Undirected Vertex-Capacitated Network

    Yoshihiro KANEKO  Shoji SHINODA  Kazuo HORIUCHI  

     
    PAPER-Graphs, Networks and Matroids

      Vol:
    E75-A No:12
      Page(s):
    1785-1792

    A vertex-capacitated network is a graph whose edges and vertices have infinite positive capacities and finite positive capacities, respectively. Such a network is a model of a communication system in which capacities of links are much larger than those of stations. This paper considers a problem of realizing a flow-saturation in an undirected vertex-capacitated network by adding the least number of edges. By defining a set of influenced vertex pairs by adding edges, we show the follwing results.(1) It suffices to add the least number of edges to unsaturated vertex pairs for realizing flow-saturation.(2) An associated graph of a flow-unsaturated network defined in this paper gives us a sufficient condition that flow-saturation is realized by adding a single edge.

21-25hit(25hit)