Hamaguchi, K.
Overview
Works:  26 works in 34 publications in 2 languages and 55 library holdings 

Genres:  Fiction Academic theses 
Roles:  Author, Other, Inventor 
Classifications:  QA76.952, 530 
Publication Timeline
.
Most widely held works by
K Hamaguchi
Nonthermal dark matter from AffleckDine baryogenesis by
Masaaki Fujii(
Book
)
4 editions published in 2002 in English and held by 8 WorldCat member libraries worldwide
4 editions published in 2002 in English and held by 8 WorldCat member libraries worldwide
Another look at LTL model checking by
Edmund M Clarke(
Book
)
3 editions published between 1993 and 1994 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite efficient in practice. In particular, we show how the SMV model checking system developed by McMillan [16] can be extended to permit LTL specifications. The results that we have obtained are quite surprising. For the examples we considered, the LTL model checker required at most twice as much time and space as the CTL model checker. Although additional examples still need to be tried, it appears that efficient LTL model checking is possible when the specifications are not excessively complicated."
3 editions published between 1993 and 1994 in English and held by 6 WorldCat member libraries worldwide
Abstract: "We show how LTL model checking can be reduced to CTL model checking with fairness constraints. Using this reduction, we also describe how to construct a symbolic LTL model checker that appears to be quite efficient in practice. In particular, we show how the SMV model checking system developed by McMillan [16] can be extended to permit LTL specifications. The results that we have obtained are quite surprising. For the examples we considered, the LTL model checker required at most twice as much time and space as the CTL model checker. Although additional examples still need to be tried, it appears that efficient LTL model checking is possible when the specifications are not excessively complicated."
The discovery of the nasopharyngitis and its influence on general diseases by
Shinsaku Horiguchi(
Book
)
1 edition published in 1975 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1975 in English and held by 5 WorldCat member libraries worldwide
The complexity of the optimal variable ordering problems of shared binary decision diagrams by S Tani(
Book
)
2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "A binary decision diagram (BDD) proposed by Akers and Bryant is a directed acyclic graph for representing a Boolean function. BDD's are widely used in various areas which require Boolean function manipulation, since BDD's can represent efficiently many of Boolean functions for practical use and can have other desirable properties. A shared binary decision diagram (SBDD) is the extension of BDD's and represents more than one Boolean functions [sic]. Recently some improvements such as the introduction of attributed edges were proposed and SBDD's are used in wide areas such as logic design verification, test generation and logic synthesis. It is important to represent Boolean functions by the smaller size of BDD's or SBDD's, because computation time and storage requirements for Boolean function manipulation are highly influenced by the size of the graph. In general the number of nodes largely depends on the variable ordering. Therefore it is important to find a variable ordering that minimizes the size of the graph. From the theoretical point of view, it was shown by Bryant that the problem of computing a variable ordering that minimizes the size of the graph for a given Boolean formula is co NPcomplete. However it has not been shown how hard it is to solve the problem of finding an optimal variable ordering for a given BDD. There is the case that the number of nodes of BDD's (an SBDD) corresponding to the Boolean formulas of the polynomial size is exponential for any variable ordering (for example, multiplier functions). Thus, since it is impossible to show a trivial polynomial transformation from the problem for a given Boolean formula to the problem for a given BDD, the two problems are essentially different. In this report, it is proved that the optimal variable ordering problem of SBDD (OVO) is NP complete. The problem is to decide whether, for a given SBDD with n nodes and a positive integer k(<n), there exists a variable ordering for some graph whose nodes are less than or equal to k and which represents the same Boolean functions as are represented by the given SBDD."
2 editions published in 1993 in English and held by 3 WorldCat member libraries worldwide
Abstract: "A binary decision diagram (BDD) proposed by Akers and Bryant is a directed acyclic graph for representing a Boolean function. BDD's are widely used in various areas which require Boolean function manipulation, since BDD's can represent efficiently many of Boolean functions for practical use and can have other desirable properties. A shared binary decision diagram (SBDD) is the extension of BDD's and represents more than one Boolean functions [sic]. Recently some improvements such as the introduction of attributed edges were proposed and SBDD's are used in wide areas such as logic design verification, test generation and logic synthesis. It is important to represent Boolean functions by the smaller size of BDD's or SBDD's, because computation time and storage requirements for Boolean function manipulation are highly influenced by the size of the graph. In general the number of nodes largely depends on the variable ordering. Therefore it is important to find a variable ordering that minimizes the size of the graph. From the theoretical point of view, it was shown by Bryant that the problem of computing a variable ordering that minimizes the size of the graph for a given Boolean formula is co NPcomplete. However it has not been shown how hard it is to solve the problem of finding an optimal variable ordering for a given BDD. There is the case that the number of nodes of BDD's (an SBDD) corresponding to the Boolean formulas of the polynomial size is exponential for any variable ordering (for example, multiplier functions). Thus, since it is impossible to show a trivial polynomial transformation from the problem for a given Boolean formula to the problem for a given BDD, the two problems are essentially different. In this report, it is proved that the optimal variable ordering problem of SBDD (OVO) is NP complete. The problem is to decide whether, for a given SBDD with n nodes and a positive integer k(<n), there exists a variable ordering for some graph whose nodes are less than or equal to k and which represents the same Boolean functions as are represented by the given SBDD."
Efficient construction of binary moment diagrams for verifying arithmetic circuits by
K Hamaguchi(
Book
)
2 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Binary Decision Diagrams (BDDs) have been used as a very powerful tool for manipulating Boolean functions in various application domains, in particular, design verification of logic circuits. We can represent many practical functions with reasonable size of BDDs, and perform Boolean operations very efficiently. Unfortunately, the sizes of the BDDs for representing multiplication are known to blow up exponentially to the number of inputs. Binary Moment Diagrams (BMDs) are graph representations of mappings from binary vectors to integers. BMDs also provide canonical representations to those functions. When we use BMDs, we can represent the output function at the word level. We can represent the functions expressing multiplication with BMDs whose size grows only linearly with the number of variables. Bryant and Chen reported a BMDbased polynomialtime algorithm for verifying multipliers. This approach requires highlevel information such as specifications to subcomponents. From users' point of view, is is convenient to handle circuit descriptions without giving specifications to subcomponents. This paper presents a new technique called backward sweeping. Using this technique, we can verify arithmetic circuits without any highlevel information. Although our experiments are preliminary, the results for array multipliers and Wallacetree multipliers both show that the order of the computation time is approximately n[superscript 3.5], where n is the number of inputs. We have successfully verified 31bit Wallacetree multipliers in 260 seconds with 3 Mbyte of memory on SPARCstation 10/51. We have also built the *BMD for c6288 in 72 seconds with 2 Mbyte of memory. This result outperforms previous BDDbased approaches for verifying multipliers."
2 editions published in 1995 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Binary Decision Diagrams (BDDs) have been used as a very powerful tool for manipulating Boolean functions in various application domains, in particular, design verification of logic circuits. We can represent many practical functions with reasonable size of BDDs, and perform Boolean operations very efficiently. Unfortunately, the sizes of the BDDs for representing multiplication are known to blow up exponentially to the number of inputs. Binary Moment Diagrams (BMDs) are graph representations of mappings from binary vectors to integers. BMDs also provide canonical representations to those functions. When we use BMDs, we can represent the output function at the word level. We can represent the functions expressing multiplication with BMDs whose size grows only linearly with the number of variables. Bryant and Chen reported a BMDbased polynomialtime algorithm for verifying multipliers. This approach requires highlevel information such as specifications to subcomponents. From users' point of view, is is convenient to handle circuit descriptions without giving specifications to subcomponents. This paper presents a new technique called backward sweeping. Using this technique, we can verify arithmetic circuits without any highlevel information. Although our experiments are preliminary, the results for array multipliers and Wallacetree multipliers both show that the order of the computation time is approximately n[superscript 3.5], where n is the number of inputs. We have successfully verified 31bit Wallacetree multipliers in 260 seconds with 3 Mbyte of memory on SPARCstation 10/51. We have also built the *BMD for c6288 in 72 seconds with 2 Mbyte of memory. This result outperforms previous BDDbased approaches for verifying multipliers."
Monsanmissheru to kinkō no machi e : shinpi no shima ni miserarete by
Kenji Hamaguchi(
Book
)
2 editions published in 2018 in Japanese and held by 2 WorldCat member libraries worldwide
2 editions published in 2018 in Japanese and held by 2 WorldCat member libraries worldwide
<> by
K Hamaguchi(
)
1 edition published in 2015 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2015 in English and held by 2 WorldCat member libraries worldwide
Does eradication of Helicobacter pylori reduce the risk of carcinogenesis in the residual stomach after gastrectomy for early
gastric cancer? Comparison of mucosal lesions in the residual stomach before and after Helicobacter pylori eradication by
K Hamaguchi(
)
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 2 WorldCat member libraries worldwide
Magnetic activities on young stars by
Kenji Hamaguchi(
)
1 edition published in 2001 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2001 in English and held by 2 WorldCat member libraries worldwide
Nonthermal Xrays from colliding wind shock acceleration in the massive binary Eta Carinae by
Kenji Hamaguchi(
)
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2018 in English and held by 2 WorldCat member libraries worldwide
Abstracts of the Nineteenth Annual Meeting of the Japanese Society of Biometeorology, Hamamatsu, 2829 November 1980 by Y Okuwaki(
)
1 edition published in 1982 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1982 in English and held by 2 WorldCat member libraries worldwide
Hydrodynamic and radiative transfer modeling of Xray emission from colliding WR winds WR 140 & the Galactic center by
C. M. P Russell(
)
1 edition published in 2015 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2015 in English and held by 2 WorldCat member libraries worldwide
IDDM susceptibility associated with polymorphisms in the insulin gene region A study of blacks, Caucasians and orientals by
D. E Undlien(
)
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Novel germline mutations of the MEN1 gene in Japanese patients with multiple endocrine neoplasia type 1 by
K Hamaguchi(
)
1 edition published in 1999 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 1999 in English and held by 2 WorldCat member libraries worldwide
Wasuremaji Shōwa ano hi ano toki : genbakushō de hikisakareta shōnentachi by
Kenji Hamaguchi(
Book
)
1 edition published in 2009 in Japanese and held by 2 WorldCat member libraries worldwide
Kensuke and his classmates are exposed to a high level of radiation during the World War II atomic bomb attack in Nagasaki, Japan, and Kensuke faces his classmates dying in struggle with severe aftereffects of intense radiation exposition
1 edition published in 2009 in Japanese and held by 2 WorldCat member libraries worldwide
Kensuke and his classmates are exposed to a high level of radiation during the World War II atomic bomb attack in Nagasaki, Japan, and Kensuke faces his classmates dying in struggle with severe aftereffects of intense radiation exposition
VLTIMATISSE chromatic aperturesynthesis imaging of eta Carinae's stellar wind across the Br alpha line Periastron passage
observations in February 2020 by G Weigelt(
)
1 edition published in 2021 in English and held by 1 WorldCat member library worldwide
Context. Eta Carinae is a highly eccentric, massive binary system (semimajor axis similar to 15.5 au) with powerful stellar winds and a phasedependent windwind collision (WWC) zone. The primary star, eta Car A, is a luminous blue variable (LBV); the secondary, eta Car B, is a WolfRayet or O star with a faster but less dense wind. Aperturesynthesis imaging allows us to study the mass loss from the enigmatic LBV eta Car. Understanding LBVs is a crucial step toward improving our knowledge about massive stars and their evolution. Aims. Our aim is to study the intensity distribution and kinematics of eta Car's WWC zone. Methods. Using the VLTIMATISSE midinfrared interferometry instrument, we perform Br alpha imaging of eta Car's distorted wind. Results. We present the first VLTIMATISSE aperturesynthesis images of eta Car A's stellar windin several spectral channels distributed across the Br alpha 4.052 mu m line (spectral resolving power R similar to 960). Our observations were performed close to periastron passage in February 2020 (orbital phase similar to 14.0022). The reconstructed isovelocity images show the dependence of the primary stellar wind on wavelength or lineofsight (LOS) velocity with a spatial resolution of 6 mas (similar to 14 au). The radius of the faintest outer wind regions is similar to 26 mas (similar to 60 au). At several negative LOS velocities, the primary stellar wind is less extended to the northwest than in other directions. This asymmetry is most likely caused by the WWC. Therefore, we see both the velocity field of the undisturbed primary wind and the WWC cavity. In continuum spectral channels, the primary star wind is more compact than in line channels. A fit of the observed continuum visibilities with the visibilities of a stellar wind CMFGEN model (CMFGEN is an atmosphere code developed to model the spectra of a variety of objects) provides a full width at half maximum fit diameter of the primary stellar wind of 2.84 +/ 0.06 mas (6.54 +/ 0.14 au). We comparethe derived intensity distributions with the CMFGEN stellar wind model and hydrodynamic WWC models
1 edition published in 2021 in English and held by 1 WorldCat member library worldwide
Context. Eta Carinae is a highly eccentric, massive binary system (semimajor axis similar to 15.5 au) with powerful stellar winds and a phasedependent windwind collision (WWC) zone. The primary star, eta Car A, is a luminous blue variable (LBV); the secondary, eta Car B, is a WolfRayet or O star with a faster but less dense wind. Aperturesynthesis imaging allows us to study the mass loss from the enigmatic LBV eta Car. Understanding LBVs is a crucial step toward improving our knowledge about massive stars and their evolution. Aims. Our aim is to study the intensity distribution and kinematics of eta Car's WWC zone. Methods. Using the VLTIMATISSE midinfrared interferometry instrument, we perform Br alpha imaging of eta Car's distorted wind. Results. We present the first VLTIMATISSE aperturesynthesis images of eta Car A's stellar windin several spectral channels distributed across the Br alpha 4.052 mu m line (spectral resolving power R similar to 960). Our observations were performed close to periastron passage in February 2020 (orbital phase similar to 14.0022). The reconstructed isovelocity images show the dependence of the primary stellar wind on wavelength or lineofsight (LOS) velocity with a spatial resolution of 6 mas (similar to 14 au). The radius of the faintest outer wind regions is similar to 26 mas (similar to 60 au). At several negative LOS velocities, the primary stellar wind is less extended to the northwest than in other directions. This asymmetry is most likely caused by the WWC. Therefore, we see both the velocity field of the undisturbed primary wind and the WWC cavity. In continuum spectral channels, the primary star wind is more compact than in line channels. A fit of the observed continuum visibilities with the visibilities of a stellar wind CMFGEN model (CMFGEN is an atmosphere code developed to model the spectra of a variety of objects) provides a full width at half maximum fit diameter of the primary stellar wind of 2.84 +/ 0.06 mas (6.54 +/ 0.14 au). We comparethe derived intensity distributions with the CMFGEN stellar wind model and hydrodynamic WWC models
Dilaton destabilization at high temperature by
W Buchmüller(
)
1 edition published in 2004 in English and held by 1 WorldCat member library worldwide
1 edition published in 2004 in English and held by 1 WorldCat member library worldwide
Signatures of axinos and gravitinos at colliders by
Alexander Brandenburg(
)
1 edition published in 2005 in English and held by 1 WorldCat member library worldwide
1 edition published in 2005 in English and held by 1 WorldCat member library worldwide
Xray study of the intermediate mass young stars Herbig Ae/Be stars by
Kenji Hamaguchi(
Book
)
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
Gravitino dark matter in Rparity breaking vacua by
W Buchmüller(
)
1 edition published in 2008 in English and held by 1 WorldCat member library worldwide
1 edition published in 2008 in English and held by 1 WorldCat member library worldwide
more
fewer
Audience Level
0 

1  
General  Special 
Related Identities
 SpringerLink (Online service) Other
 Fujii, Masaaki Other Author
 Grumberg, O.
 Clarke, Edmund Author
 Yajima, S.
 Horiguti, Sinsak Author
 Buchmüller, Wilfried Author
 Corcoran, M. F.
 Moffat, Anthony F. J. Other
 Morita, Akihito