Institution
University of Electro-Communications
Education•Tokyo, Japan•
About: University of Electro-Communications is a education organization based out in Tokyo, Japan. It is known for research contribution in the topics: Laser & Robot. The organization has 8041 authors who have published 16950 publications receiving 235832 citations. The organization is also known as: UEC & Denki-Tsūshin Daigaku.
Topics: Laser, Robot, Ion, Mobile robot, Fiber laser
Papers published on a yearly basis
Papers
More filters
••
TL;DR: If the difference hierarchy over NP collapses to levelk, then PH collapses to (P(k−1)NP)NP, the class of sets recognized in polynomial time withk − 1 nonadaptive queries to a set in NPNP and an unlimited number of queries toA set in NP.
Abstract: Chang and Kadin have shown that if the difference hierarchy over NP collapses to level $k$, then the polynomial hierarchy (PH) is equal to the $k$th level of the difference hierarchy over $\Sigma_{2}^{p}$. We simplify their proof and obtain a slightly stronger conclusion: If the difference hierarchy over NP collapses to level $k$, then PH = $\left(P_{(k-1)-tt}^{NP}\right)^{NP}$. We also extend the result to classes other than NP: For any class $C$ that has $\leq_{m}^{p}$-complete sets and is closed under $\leq_{conj}^{p}$and $\leq_{m}^{NP}$-reductions, if the difference hierarchy over $C$ collapses to level $k$, then $PH^{C} = $\left(P_{(k-1)-tt}^{NP}\right)^{C}$. Then we show that the exact counting class $C_{=}P$ is closed under $\leq_{disj}^{p}$and $\leq_{m}^{co-NP}$-reductions. Consequently, if the difference hierarchy over $C_{=}P$ collapses to level $k$ then $PH^{PP}$ is equal to $\left(P_{(k-1)-tt}^{NP}\right)^{PP}$. In contrast, the difference hierarchy over the closely related class PP is known to collapse. Finally, we consider two ways of relativizing the bounded query class $P_{k-tt}^{NP}$: the restricted relativization $P_{k-tt}^{NP^{C}}$, and the full relativization $\left(P_{k-tt}^{NP}\right)^{C}$. If $C$ is NP-hard, then we show that the two relativizations are different unless $PH^{C}$ collapses.
54 citations
••
TL;DR: A high-performance, highly scalable eigenvalue solver is introduced with the goal of realizing the K-computer system, which is a next-generation supercomputer system.
Abstract: For current supercomputer systems, multicore and multisocket processors are required in order to build a system, and choice of interconnection is essential. In addition, for effective development of new code, high-performance, scalable, and reliable numerical software is key. ScaLAPACK and PETSc are software developed for distributed memory parallel computer systems. Real computation requires software that is highly tuned for implementation on new architectures, such as many-core processors. In the present study, we introduce a high-performance, highly scalable eigenvalue solver with the goal of realizing the K-computer system, which is a next-generation supercomputer system. We have developed two versions of this eigenvalue solver, namely, the standard version (eigen_s) and an enhanced-performance version (eigen_sx), both of which were developed on the T2K cluster system housed at the University of Tokyo. Eigen_s uses conventional algorithms, such as Householder tridiagonalization, the divide and conquer (DC) algorithm, and the Householder backtransformation. These algorithms are carefully implemented using a blocking technique and flexible two-dimensional data-distribution in order to reduce the overhead of memory traffic and data transfer, respectively. Eigen_s performs excellently on the T2K system with 4,096 cores (theoretical peak: 37.6 TFLOPS) and exhibits fine performance (3.0 TFLOPS) with a 200,000-dimensional matrix. The enhanced version, eigen_sx, uses more advanced algorithms, such as the narrow-band reduction algorithm, DC for band matrices, and the block Householder back-transformation with WY- representation. Even though this version is still in the test stage, eigen_sxhas realized 4.7 TFLOPS with a 200,000-dimensional matrix.
54 citations
••
TL;DR: In this paper, the elementary processes of excitation and ionization of atomic hydrogen in an intense 800-nm pulse with intensity in the 1.0 to 2.2$ range were studied.
Abstract: We studied the elementary processes of excitation and ionization of atomic hydrogen in an intense 800-nm pulse with intensity in the 1.0 to $2.5\ifmmode\times\else\texttimes\fi{}{10}^{14}$ ${\mathrm{W}/\mathrm{cm}}^{2}$ range. By analyzing excitation as a continuation of above-threshold ionization (ATI) into the below-threshold negative energy region, we show that modulation of excitation probability and the well-known shift of low-energy ATI peaks vs laser intensity share the same origin. Modulation of excitation probability is a general strong field phenomenon and is shown to be a consequence of channel closing in multiphoton ionization processes. Furthermore, the excited states populated in general have large orbital angular momentum and they are stable against ionization by the intense 800-nm laser---they are the underlying reason for population trapping of atoms and molecules in intense laser fields.
54 citations
••
TL;DR: This work proposes that a chain of five-membered rings (polyaminotriazole) should be ferromagnetic with an appropriate doping that is envisaged to be feasible with a field-effect transistor structure and explains the magnetism in terms of the Mielke and Tasaki flatband ferromagnetism with the Hubbard model.
Abstract: We propose that a chain of five-membered rings (polyaminotriazole) should be ferromagnetic with an appropriate doping that is envisaged to be feasible with a field-effect transistor structure. The ferromagnetism is confirmed by a spin density functional calculation, which also shows that ferromagnetism survives the Peierls instability. We explain the magnetism in terms of the Mielke and Tasaki flatband ferromagnetism with the Hubbard model. This opens a new possibility of band ferromagnetism in purely organic polymers.
54 citations
••
06 Jan 2014TL;DR: A mobile food recognition system with Fisher Vector and liner one-vs-rest SVMs which enables us to record the authors' food habits easily and achieves the 79.2% classification rate for the top 5 category candidates when the ground-truth bounding boxes are given.
Abstract: In the demo, we demonstrate a mobile food recognition system with Fisher Vector and liner one-vs-rest SVMs which enables us to record our food habits easily. In the experiments with 100 kinds of food categories, we have achieved the 79.2% classification rate for the top 5 category candidates when the ground-truth bounding boxes are given. The prototype system is open to the public as an Android-based smartphone application.
54 citations
Authors
Showing all 8079 results
Name | H-index | Papers | Citations |
---|---|---|---|
Mildred S. Dresselhaus | 136 | 762 | 112525 |
Matthew Nguyen | 131 | 1291 | 84346 |
Juan Bisquert | 107 | 450 | 46267 |
Dapeng Yu | 94 | 745 | 33613 |
Riichiro Saito | 91 | 502 | 48869 |
Shun-ichi Amari | 90 | 495 | 40383 |
Shigeru Nagase | 76 | 617 | 22099 |
Ingrid Verbauwhede | 72 | 575 | 21110 |
Satoshi Hasegawa | 69 | 708 | 22153 |
Yu Qiao | 69 | 484 | 29922 |
Yukio Tanaka | 68 | 744 | 19942 |
Zhijun Li | 68 | 614 | 14518 |
Iván Mora-Seró | 67 | 235 | 23229 |
Kazuo Tanaka | 63 | 535 | 27559 |
Da Xing | 63 | 624 | 14766 |