DSpace Repository

Browsing テクニカルレポート / Technical Report by Title

Browsing テクニカルレポート / Technical Report by Title

Sort by: Order: Results:

  • Monden, Akito; Monsifrot, Antoine; Thomborson, Clark (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2003-11)
    Many computer systems are designed to make it easy for end-users to install and update software. An undesirable side-effect, from the perspective of many software producers, is that hostile end-users may analyze or tamper ...
  • Mori, Takeshi; Nakamura, Yutaka; Ishii, Shin (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2005-11)
    Recently-developed Natural Actor-Critic (NAC) [1] [2], which employs natural policy gradient learning for the actor and LSTD-Q(λ) for the critic, has provided a good model-free reinforcement learning scheme applicable to ...
  • Seki, Hiroyuki; Kato, Yuki (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2006-09)
    Several grammars of which generative power is between context-free grammar and context-sensitive grammar were proposed. Among them, multiple context-free grammar and variable-linear macro grammar are known to be recognizable ...
  • Nakanishi, Masaki; Indoh, Takao; Hamaguchi, Kiyoharu; Kashiwabara, Toshinobu (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2001-03)
    One of important questions on quantum computing is whether there is a computational gap between the models that is allowed to use quantum effects and the models that is not. Several types of quantum computational models ...
  • Tang, Yuansheng; Kasami, Tadao; Fujiwara, Toru (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 1997-06)
    Concerning the optimality of candidate codewords generated in the procedure of soft-decision decoding binary linear Block codes, here we give some further discussions on the sufficient conditions proposed by Kasami et.al. ...
  • Nakanishi, Masaki (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2003-10)
    We show that there is a non-context-free language which quantum pushdown automata with classical stack operations can recognize with one-sided error.
  • Tachibana, Takuji; Kasahara, Shoji (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2004-09)
    In this paper, we consider a lightpath establishment policy for WDM networks with full-range wavelength conversion capability. The optimal policy considered here is such that the service differentiation for the connection ...
  • Larsson, Erik; Fujiwara, Hideo (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2002-07)
    In this paper, we show that the test access mechanism (TAM) scheduling is equal to the independent job scheduling on independent machines. We make use of an existing preemptive scheduling algorithm, which produces an optimal ...
  • Tang, Yuansheng; Kasami, Tadao; Fujiwara, Toru (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 1998-10)
    For the iterative soft-decision decoding algorithms, a testing condition on the optimality of a decoded codeword based on h candidate codewords is proposed by Kasami et.al. recently. The greater the number h of the candidate ...
  • Utsuro, Takehito (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 1995-01)
    The nearest neighbor algorithm is the most basic class of techniques in the sub-fields of machine learning such as case-based reasoning (CBR), memory-based reasoning (MBR), and instance-based learning (IBL). In the nearest ...
  • Yoshikawa, Yuki; Ohtake, Satoshi; Fujiwara, Hideo (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2007-06)
    While design-for-testability (DFT) techniques are generally used in order to reduce test generation complexity, they induce over-testing problems. In general, DFT techniques make a large number of untestable paths testable. ...
  • Tachibana, Takuji; Kasahara, Shoji (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2003-02)
    In this paper, we propose a dynamic lightpath conguration method for WDM ring network. With this method, lightpaths are established according to the congestion state of node and are released after some holding time. The ...
  • Tachibana, Takuji; Kasahara, Shoji (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2004-09)
    In this paper, we analyze the performance of a timer-based burst assembly for optical burst switching (OBS) networks. In our analytical model, an ingress edge node has multiple buffers where IP packets are stored depending ...
  • Tomono, Mitsuru; Nakanishi, Masaki; Yamashita, Shigeru; Nakashima, Yasuhiko (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2007-03)
    In recent decades, reconfigurable devices have been extensively researched to improve computer system performance, with a reconfigurable 1-bit processor array (1-bit RPA) having been proposed as an outcome of this research. ...
  • Morimura, Tetsuro; Uchibe, Eiji; Yoshimoto, Junichiro; Doya, Kenji (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2007-09)
    Conventional policy gradient reinforcement learning (PGRL) algorithms neglect a term in the average reward gradient, which is dependent upon the change in the stationary distribution by the policy parameter change. Although ...
  • Yoneda, Tomokazu; Masuda, Kimihiko; Fujiwara, Hideo (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2005-06)
    This paper presents a wrapper and test access mechanism design for multi-clock domain SoCs that consists of cores with different clock frequencies during test. We also propose a test scheduling algorithm for multi-clock ...
  • Yoshihara, Tadafumi; Kasahara, Shoji; Takahashi, Yutaka (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 1998-04)
    Recent measurements of packet/cell streams in multimedia communication networks have revealed that they have the self-similar property and are of different character istics from traditional traffic streams. Therefore, a ...
  • Larsson, Erik; Fujiwara, Hideo (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2002-01)
    We investigate power constrained test access mechanism (TAM) scheduling for core-based system by combining scan-chain partitioning and preemption. We discuss scan-chain partitioning in core-based design to minimize test ...
  • Takata, Yoshiaki; Noda, Jun; Takahashi, Mie; Mouri, Hisashi; Hosomi, Itaru; Taguchi, Daigo; Seki, Hiroyuki (Nara Institute of Science and Technology奈良先端科学技術大学院大学, 2005-10)
    We propose a new architecture for trust management in ubiquitous environments that deals with RBAC policy, digital signatures, and user presence in a uniform framework. The proposed architecture includes inferences about ...
  • Akinori Ihara; Takashi Ishio (奈良先端科学技術大学院大学Nara Institute of Science and Technology, 2010-12)

Search DSpace


Advanced Search

Browse

My Account