default search action
Yoshihiro Tohma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j17]Yoshihiro Tohma:
The Transfer Function of Amplitude Modulation Circuits Using Varactor Diode. IEEE Trans. Circuits Syst. II Express Briefs 66-II(4): 532-536 (2019)
2000 – 2009
- 2007
- [j16]Osamu Miyakawa, Yoshihiro Tohma:
Software reliability evaluation in service operation. Syst. Comput. Jpn. 38(1): 97-104 (2007) - 2004
- [j15]Yoshihiro Tohma:
Incorporating Fault Tolerance into an Autonomic-Computing Environment. IEEE Distributed Syst. Online 5(2) (2004) - [c13]Yoshihiro Tohma, Masao Mukaidono:
Current research activities on dependable computing and other dependability issues in Japan. IFIP Congress Topical Sessions 2004: 121-134 - 2003
- [c12]Yoshihiro Tohma:
Dependability Issue on Autonomic Computing Environment. ISORC 2003: 71-74 - 2002
- [c11]Yoshihiro Tohma:
Fault Tolerance in Autonomic Computing Environment. PRDC 2002: 3-8
1990 – 1999
- 1999
- [j14]Yoshihiro Tohma, Takuya Iwata:
Fault-tolerant neural networks with higher functionality. Syst. Comput. Jpn. 30(10): 22-33 (1999) - 1996
- [j13]Yoshihiro Tohma, Yoichi Koyanagi:
Fault-Tolerant Design of Neural Networks for Solving Optimization Problems. IEEE Trans. Computers 45(12): 1450-1455 (1996) - 1995
- [c10]Takashi Minohara, Yoshihiro Tohma:
Parameter estimation of hyper-geometric distribution software reliability growth model by genetic algorithms. ISSRE 1995: 324-329 - 1993
- [c9]Yoshihiro Tohma, Yoichi Koyanagi:
Design of Neural Networks to Tolerate the Mixture of Two Types of Faults. FTCS 1993: 268-277 - 1992
- [c8]Yoichi Koyanagi, Yoshihiro Tohma:
Fault Tolerant Neural Networks in Optimization Problems. FTCS 1992: 412-418 - 1991
- [j12]Tomohiro Yoneda, Yoshihiro Tohma, Yutaka Kondo:
Acceleration of timing verification method based on time petri nets. Syst. Comput. Jpn. 22(12): 37-52 (1991) - [j11]Yoshihiro Tohma, Hisashi Yamano, Morio Ohba, Raymond Jacoby:
The Estimation of Parameters of the Hypergeometric Distribution and Its Application to the Software Reliability Growth Model. IEEE Trans. Software Eng. 17(5): 483-489 (1991) - [c7]Raymond Jacoby, Yoshihiro Tohma:
Parameter Value Computation by Least Square Method and Evaluation of Software Availability and Reliability at Service-Operation by the Hyper-Geometric Distribution Software Reliability Growth Model (HGDM). ICSE 1991: 226-237 - [c6]Yoshihiro Tohma, Hisashi Yamano, Morio Ohba, Raymond Jacoby:
Parameter estimation of the hyper-geometric distribution model for real test/debug data. ISSRE 1991: 28-34 - 1990
- [c5]Raymond Jacoby, Yoshihiro Tohma:
The hyper-geometric distribution software reliability growth model (HGDM): precise formulation and applicability. COMPSAC 1990: 13-19
1980 – 1989
- 1989
- [j10]Yoshihiro Tohma, Kenshin Tokunaga, Shinji Nagase, Yukihisa Murata:
Structural Approach to the Estimation of the Number of Residual Software Faults Based on the Hyper-Geometric Distribution. IEEE Trans. Software Eng. 15(3): 345-355 (1989) - [c4]Yoshihiro Tohma:
Models to estimate the number of faults still resident in the software after test/debug process. COMPSAC 1989: 491-492 - [c3]Yoshihiro Tohma, Raymond Jacoby, Yukihisa Murata, Moriki Yamamoto:
Hyper-geometric distribution model to estimate the number of residual software faults. COMPSAC 1989: 610-617 - [c2]Tomohiro Yoneda, Kazutoshi Nakade, Yoshihiro Tohma:
A fast timing verification method based on the independence of units. FTCS 1989: 134-141 - 1988
- [j9]Prab Varma, Yoshihiro Tohma:
A knowledge-based test generator for standard cell and iterative array logic circuits. IEEE J. Solid State Circuits 23(2): 428-436 (1988) - 1987
- [c1]Yoshihiro Tohma, Kenji Goto:
Test Generation for Large-Scale Combinational Circuits by Using Prolog. LP 1987: 298-312 - 1985
- [j8]Tomohiro Yoneda, Takashi Suzuoka, Yoshihiro Tohma:
Interrupt handling in the loosely synchronized TMR system. Syst. Comput. Jpn. 16(5): 50-59 (1985)
1970 – 1979
- 1979
- [j7]Takashi Nanya, Yoshihiro Tohma:
Universal Multicode STT State Assignments for Asynchronous Sequential Machines. IEEE Trans. Computers 28(11): 811-818 (1979) - 1978
- [j6]Takashi Nanya, Yoshihiro Tohma:
On Universal Single Transition Time Asynchronous State Assignments. IEEE Trans. Computers 27(8): 781-782 (1978) - 1974
- [j5]Y. Mukai, Yoshihiro Tohma:
A Method for the Realization of Fail-Safe Asynchronous Sequential Circuits. IEEE Trans. Computers 23(7): 736-739 (1974) - [j4]Yoshihiro Tohma:
Design Technique of Fail-Safe Sequential Circuits Using Flip-Flops For Internal Memory. IEEE Trans. Computers 23(11): 1149-1154 (1974) - 1971
- [j3]Yoshihiro Tohma, Susumu Aoyagi:
Failure-Tolerant Sequential Machines with Past Information. IEEE Trans. Computers 20(4): 392-396 (1971) - [j2]Yoshihiro Tohma, Yasuyoshi Ohyama, Ryozo Sakai:
Realization of Fail-Safe Sequential Machines by Using a k-out-of-n Code. IEEE Trans. Computers 20(11): 1270-1275 (1971)
1960 – 1969
- 1964
- [j1]Yoshihiro Tohma:
Decompositions of Logical Functions Using Majority Decision Elements. IEEE Trans. Electron. Comput. 13(6): 698-705 (1964)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint