default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNobuoki Eshima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j20]Nobuoki Eshima
, Claudio Giovanni Borroni, Minoru Tabata, Takeshi Kurosawa:
An Entropy-Based Tool to Help the Interpretation of Common-Factor Spaces in Factor Analysis. Entropy 23(2): 140 (2021)
2010 – 2019
- 2018
- [j19]Nobuoki Eshima, Minoru Tabata, Claudio Giovanni Borroni:
An Entropy-Based Approach for Measuring Factor Contributions in Factor Analysis Models. Entropy 20(9): 634 (2018) - 2015
- [j18]Minoru Tabata, Nobuoki Eshima, Yuusuke Sakai:
Existence and computation of solutions to the initial value problem for the replicator equation of evolutionary game defined by the Dixit-Stiglitz-Krugman model in an urban setting: Concentration of workers motivated by disparity in real wages. Appl. Math. Comput. 254: 419-451 (2015) - [j17]Nobuoki Eshima, Minoru Tabata, Claudio Giovanni Borroni, Yutaka Kano:
An Entropy-Based Approach to Path Analysis of Structural Generalized Linear Models: A Basic Idea. Entropy 17(7): 5117-5132 (2015) - 2014
- [j16]Minoru Tabata, Nobuoki Eshima, Yuusuke Sakai:
Existence, uniqueness, and computation of short-run and long-run equilibria of the Dixit-Stiglitz-Krugman model in an urban setting. Appl. Math. Comput. 234: 339-355 (2014) - 2011
- [j15]Nobuoki Eshima, Minoru Tabata:
Three predictive power measures for generalized linear models: The entropy coefficient of determination, the entropy correlation coefficient and the regression correlation coefficient. Comput. Stat. Data Anal. 55(11): 3049-3058 (2011) - 2010
- [j14]Nobuoki Eshima, Minoru Tabata:
Entropy coefficient of determination for generalized linear models. Comput. Stat. Data Anal. 54(5): 1381-1389 (2010) - [j13]Futoshi Anan, Takayuki Masaki, Tsuyoshi Shimomura, Minoru Fujiki, Yoshikazu Umeno, Nobuoki Eshima, Tetsunori Saikawa, Hironobu Yoshimatsu:
Abdominal visceral fat accumulation is associated with hippocampus volume in non-dementia patients with type 2 diabetes mellitus. NeuroImage 49(1): 57-62 (2010)
2000 – 2009
- 2008
- [j12]Nobuoki Eshima, Tohru Kohda:
Low-Complexity Code Acquisition Method in DS/CDMA Communication Systems: Application of the Maximum Likelihood Method to Propagation Delay Estimation. IEICE Trans. Commun. 91-B(5): 1472-1479 (2008) - 2007
- [j11]Nobuoki Eshima, Tohru Kohda, Minoru Tabata:
Statistical solution to the capacity problem in direct-sequence code-division multiple-access communication systems. IMA J. Math. Control. Inf. 24(3): 289-298 (2007) - 2006
- [j10]Nobuoki Eshima, Tohru Kohda:
Statistical approach to the code acquisition problem in direct-sequence spread-spectrum communication systems. IMA J. Math. Control. Inf. 23(2): 149-163 (2006) - 2005
- [j9]Tahir Abbas Khan, Nobuoki Eshima, Yutaka Jitsumatsu, Tohru Kohda:
Code Acquisition in DS/CDMA Systems by Employing a Detector Based on a posteriori Probability Calculation. IEICE Trans. Commun. 88-B(10): 4047-4055 (2005) - [c2]Tohru Abbas Khan, Nobuoki Eshima, Yutaka Jitsumatsu, Tohru Kohda:
A novel code acquisition algorithm and its application to Markov spreading codes. ISCAS (3) 2005: 2056-2059 - 2004
- [j8]Minoru Tabata, Nobuoki Eshima:
The behavior of stochastic agent-based models when the number of agents and the time variable tend to infinity. Appl. Math. Comput. 152(1): 47-70 (2004) - [c1]Nobuoki Eshima, Yutaka Jitsumatsu, Tohru Kohda:
Markovian SS codes imply inversion-free code acquisition in asynchronous DS/CDMA systems. ISCAS (4) 2004: 617-620 - 2003
- [j7]Minoru Tabata, Nobuoki Eshima:
A self-referential agent-based model that consists of a large number of agents moving stochastically in a discrete bounded domain. Appl. Math. Comput. 143(2-3): 443-483 (2003) - 2002
- [j6]Minoru Tabata, Nobuoki Eshima, Ichiro Takagi:
An infinite continuous model which derives from a finite discrete model describing the time evolution of the density of firms. Appl. Math. Comput. 125(1): 105-132 (2002) - [j5]Minoru Tabata, Nobuoki Eshima:
Blowing-up solutions to the Cauchy problem for the master equation. Appl. Math. Comput. 127(2-3): 181-193 (2002) - [j4]Minoru Tabata, Nobuoki Eshima:
The Cauchy problem for the nonlinear integro-partial differential equation in quantitative sociodynamics. Appl. Math. Comput. 132(2-3): 537-552 (2002) - 2000
- [j3]Minoru Tabata, Nobuoki Eshima:
The behavior of solutions to the Cauchy problem for the master equation. Appl. Math. Comput. 112(1): 79-98 (2000)
1990 – 1999
- 1999
- [j2]Minoru Tabata, Nobuoki Eshima, Ichiro Takagi:
The nonlinear integro-partial differential equation describing the logistic growth of human population with migration. Appl. Math. Comput. 98(2-3): 169-183 (1999) - 1998
- [j1]Minoru Tabata, Nobuoki Eshima, Ichiro Takagi, Takashi Hiroyama:
The Cauchy problem for the system of equations describing migration motivated by regional economic disparity. Appl. Math. Comput. 94(1): 45-64 (1998)
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-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
