default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKen Umeno
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j27]Pavlos I. Zitis
, Shinji Kakinaka, Ken Umeno, Michael P. Hanias, Stavros G. Stavrinides, Stelios M. Potirakis:
Investigating Dynamical Complexity and Fractal Characteristics of Bitcoin/US Dollar and Euro/US Dollar Exchange Rates around the COVID-19 Outbreak. Entropy 25(2): 214 (2023)- [j26]Pavlos I. Zitis, Shinji Kakinaka, Ken Umeno, Stavros G. Stavrinides, Michael P. Hanias, Stelios M. Potirakis:
The Impact of COVID-19 on Weak-Form Efficiency in Cryptocurrency and Forex Markets. Entropy 25(12): 1622 (2023) - [j25]Hiroki Matsuyama, Minghui Kao, Ken Umeno:
Independent component analysis communication using complex spreading sequence with constant power. JSIAM Lett. 15: 37-40 (2023) - [j24]Tomoyuki Mao, Hidetoshi Okutomi, Ken Umeno:
Analysis of the limit values of chaos degree for infinite number of partitions in asymmetric tent maps. JSIAM Lett. 15: 41-44 (2023) - [j23]Hiroki Matsuyama, Minghui Kao, Ken Umeno:
Super orthogonal chaos codes with primitive roots. JSIAM Lett. 15: 129-132 (2023) - 2022
- [j22]Masaru Shintani, Ken Umeno:
Time-Rescaling regression method for exponential decay time series predictions. JSIAM Lett. 14: 45-48 (2022) - [j21]Masaru Shintani, Ken Umeno:
General dynamic pricing algorithms based on universal exponential booking curves. JSIAM Lett. 14: 49-52 (2022) - [j20]Yasunari Hikima, Atsushi Iwasaki, Ken Umeno:
The Reference Distributions of Maurer's Universal Statistical Test and Its Improved Tests. IEEE Trans. Inf. Theory 68(4): 2674-2683 (2022) - 2021
- [j19]Masataka Motoyama, Ken Umeno:
Demonstration of wireless power coloring. IEICE Electron. Express 18(5): 20210011 (2021) - [j18]Hirofumi Tsuda, Ken Umeno:
Randomization Approaches for Reducing PAPR with Partial Transmit Sequence and Semidefinite Relaxation. IEICE Trans. Commun. 104-B(3): 262-276 (2021) - 2020
- [j17]Isao Nakazawa, Ken Umeno:
Chaotic property of almost periodic frequency arrangement (APFA). JSIAM Lett. 12: 9-12 (2020)
2010 – 2019
- 2019
- [j16]Tomoyuki Mao, Hidetoshi Okutomi, Ken Umeno:
Investigation of the difference between Chaos Degree and Lyapunov exponent for asymmetric tent maps. JSIAM Lett. 11: 61-64 (2019) - 2018
- [j15]Hirofumi Tsuda, Ken Umeno:
Weyl Spreading Sequence Optimizing CDMA. IEICE Trans. Commun. 101-B(3): 897-908 (2018) - [j14]Atsushi Iwasaki, Ken Umeno:
Randomness Test to Solve Discrete Fourier Transform Test Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(8): 1204-1214 (2018) - [j13]Hirofumi Tsuda, Ken Umeno:
Non-Linear Programming: Maximize SINR for Designing Spreading Sequence. IEEE Trans. Commun. 66(1): 278-289 (2018) - [c2]Hirofumi Tsuda, Ken Umeno:
Randomization Algorithm for Partial Transmit Sequence with Semidefinite Relaxation. VTC Fall 2018: 1-5 - [i15]Hirofumi Tsuda, Ken Umeno:
Randomization Approaches for Reducing PAPR with Partial Transmit Sequences and Semidefinite Relaxation. CoRR abs/1805.04666 (2018) - 2017
- [j12]Atsushi Iwasaki, Ken Umeno:
One-stroke polynomials over a ring of modulo $2^w$. JSIAM Lett. 9: 5-8 (2017) - [j11]Hiroki Okada, Ken Umeno:
Randomness Evaluation With the Discrete Fourier Transform Test Based on Exact Analysis of the Reference Distribution. IEEE Trans. Inf. Forensics Secur. 12(5): 1218-1226 (2017) - [i14]Hiroki Okada, Ken Umeno:
Randomness Evaluation with the Discrete Fourier Transform Test Based on Exact Analysis of the Reference Distribution. CoRR abs/1701.01960 (2017) - [i13]Hirofumi Tsuda, Ken Umeno:
Method to Design UF-OFDM Filter and its Analysis. CoRR abs/1711.07197 (2017) - 2016
- [j10]Hirofumi Tsuda, Ken Umeno:
Orthogonal basis spreading sequence for optimal CDMA. JSIAM Lett. 8: 77-80 (2016) - [i12]Hirofumi Tsuda, Ken Umeno:
Weyl Spreading Sequence Optimizing CDMA. CoRR abs/1602.04584 (2016) - [i11]Atsushi Iwasaki, Ken Umeno:
Periodicity of odd degree Chebyshev polynomials over a ring of modulo $2^w$. CoRR abs/1602.08238 (2016) - [i10]Atsushi Iwasaki, Ken Umeno:
One-stroke polynomials over a ring of modulo $2^w$. CoRR abs/1605.03449 (2016) - [i9]Hirofumi Tsuda, Ken Umeno:
Orthogonal Basis Spreading Sequence for Optimal CDMA. CoRR abs/1605.04721 (2016) - [i8]Atsushi Iwasaki, Ken Umeno:
Further improving security of Vector Stream Cipher. CoRR abs/1607.08311 (2016) - [i7]Hirofumi Tsuda, Ken Umeno:
Numerical Approach to Maximize SNR for CDMA Systems. CoRR abs/1609.09577 (2016) - [i6]Hirofumi Tsuda, Ken Umeno:
SNR Maximization as a Non-Linear Programming -Towards Optimal Spreading Sequence-. CoRR abs/1610.04340 (2016) - [i5]Hirofumi Tsuda, Ken Umeno:
Non-Linear Programming: Maximize SNR for Designing Spreading Sequence - Part I: SNR versus Mean-Square Correlation. CoRR abs/1612.08232 (2016) - [i4]Hirofumi Tsuda, Ken Umeno:
Non-Linear Programming: Maximize SNR for Designing Spreading Sequence - Part II: Conditions for Optimal Spreading Sequences. CoRR abs/1612.08785 (2016) - 2014
- [j9]Ryo Takahashi, Ken Umeno:
Performance Evaluation of CDMA Using Chaotic Spreading Sequence with Constant Power in Indoor Power Line Fading Channels. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(7): 1619-1622 (2014) - 2013
- [j8]Ken Umeno, Aki-Hiro Sato:
Chaotic Method for Generating $q$-Gaussian Random Variables. IEEE Trans. Inf. Theory 59(5): 3199-3209 (2013) - 2012
- [i3]Ken Umeno, Aki-Hiro Sato:
Chaotic Method for Generating q-Gaussian Random Variables. CoRR abs/1205.1690 (2012) - [i2]Aki-Hiro Sato, Ken Umeno:
Correlational properties of two-dimensional solvable chaos on the unit circle. CoRR abs/1208.6205 (2012) - 2010
- [j7]Ryo Takahashi, Ken Umeno:
Performance Evaluation of Band-Limited Baseband Synchronous CDMA Using Orthogonal ICA Sequences. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(3): 577-582 (2010) - [j6]Ryo Takahashi, Etsushi Nameda, Ken Umeno:
Inner angle of triangle on unit circle made of consecutive three points generated by chaotic map. JSIAM Lett. 2: 9-12 (2010)
2000 – 2009
- 2009
- [j5]Ryo Takahashi, Ken Umeno:
Performance Analysis of Complex CDMA Using Complex Chaotic Spreading Sequence with Constant Power. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(12): 3394-3397 (2009) - 2008
- [j4]Masahiro Yukawa, Ken Umeno, Gen Hori:
Employing LSF at Transmitter Eases MMSE Adaptation at Receiver in Asynchronous CDMA Systems. EURASIP J. Wirel. Commun. Netw. 2008 (2008) - [j3]Song-Ju Kim, Ken Umeno:
Chaos-based communication systems using on-line ICA algorithm. IEICE Electron. Express 5(14): 510-515 (2008) - 2007
- [j2]Song-Ju Kim, Ken Umeno, Ryo Takahashi:
FPGA implementation of EASI algorithm. IEICE Electron. Express 4(22): 707-711 (2007) - [c1]Mikio Hasegawa, Ken Umeno:
Solvable Performances of Optimization Neural Networks with Chaotic Noise and Stochastic Noise with Negative Autocorrelation. ICONIP (1) 2007: 693-702 - 2004
- [i1]Song-Ju Kim, Ken Umeno, Akio Hasegawa:
Corrections of the NIST Statistical Test Suite for Randomness. IACR Cryptol. ePrint Arch. 2004: 18 (2004) - 2002
- [j1]Ken Umeno, Akihiro Yamaguchi:
Construction of Optimal Chaotic Spreading Sequence Using Lebesgue Spectrum Filter. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 85-A(4): 849-852 (2002)
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 2025-01-09 13:11 CET 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:
