• Publications
  • Influence
Finding an optimum edit script between an XML document and a DTD
  • N. Suzuki
  • Computer Science
  • SAC '05
  • 13 March 2005
TLDR
We first show a polynomial-time algorithm that finds an optimum edit script between an XML document (modeled as an ordered tree) and a DTD. Expand
  • 25
  • 3
Finding K Optimum Edit Scripts between an XML Document and a RegularTree Grammar
TLDR
We propose an algorithm for finding K optimum edit scripts between an XML document and a regular tree grammar. Expand
  • 6
  • 2
  • PDF
Noninvasive Biological Sensor System for Detection of Drunk Driving
TLDR
We used the frequency time series analysis to attempt to distinguish between normal and intoxicated states of a person as the basis of the sensing system. Expand
  • 39
  • 1
  • PDF
An edit operation-based approach to the inclusion problem for DTDs
  • N. Suzuki
  • Computer Science
  • SAC '07
  • 11 October 2006
TLDR
In this paper, we propose a subproblem of the inclusion problem in terms of edit operations to regular expressions, and show a polynomial-time algorithm for solving the subproblem. Expand
  • 9
  • 1
An Algorithm for Inferring K Optimum Transformations of XML Document from Update Script to DTD
  • N. Suzuki
  • Computer Science
  • IEICE Trans. Inf. Syst.
  • 1 August 2010
TLDR
We show that the problem of inferring K optimum transformations of an XML document from an update script is NP-hard even if K = 1. Expand
  • 3
  • 1
  • PDF
On Inferring K Optimum Transformations of XML Document from Update Script to DTD
TLDR
In this paper, we show that the problem of inferring K optimum transformations of an XML document from an update script is NP-hard even if K = 1. Expand
  • 3
  • 1
  • PDF
Construction and use of a bottom-up HAC vector for transgene expression.
Recent technological advances have enabled visualization of the organization and dynamics of local -chromatin structures; however, the global mechanisms by which chromatin organization modulates geneExpand
  • 14
Satisfiability of simple xpath fragments in the presence of dtds
TLDR
For an XPath expression q and a DTD D, q is satisfiable under D if there exists an XML document t such that t is valid against D and that the answer of q on t is nonempty. Expand
  • 6