著者
Fumio HIAI
出版者
The Editorial Committee of the Interdisciplinary Information Sciences
雑誌
Interdisciplinary Information Sciences (ISSN:13409050)
巻号頁・発行日
vol.16, no.2, pp.139-248, 2010 (Released:2010-09-16)
参考文献数
80
被引用文献数
35 36

These lecture notes are concerned with several topics in matrix analysis covering the Löwner and Kraus theory on matrix/operator monotone and convex functions, the Kubo–Ando theory on operator means, spectral variation and majorization, and means for matrices. Matrix norm inequalities related to majorization and means for matrices are also discussed.
著者
Emmanuel Jesuyon DANSU Hiromi SENO
出版者
The Editorial Committee of the Interdisciplinary Information Sciences
雑誌
Interdisciplinary Information Sciences (ISSN:13409050)
巻号頁・発行日
vol.28, no.1, pp.75-93, 2022 (Released:2022-07-31)
参考文献数
24
被引用文献数
1

Mark Granovetter promoted the threshold model of social behavior in which the acceptance value of an action is determined by the proportion of a population that already accepted it. The model is about an individual embracing an idea once a sufficient number of people embrace it. In this paper, we propose a mathematically accurate population dynamics model based on Granovetter's idea for the spread of information in a population. Individual threshold values with respect to the acceptance of a piece of information are distributed throughout the population ranging from low (easily accepts information) to high (hardly accepts). Results from the mathematical analysis on our model show that critical values exist for initial knower population size, mean and variance of threshold values. These critical values are about the drastic difference in the proportion of the population that end up knowing the information, depending on respective features of the population according to the information spread.
著者
Masaaki HIGASHIJIMA Yujin WOO
出版者
The Editorial Committee of the Interdisciplinary Information Sciences
雑誌
Interdisciplinary Information Sciences (ISSN:13409050)
巻号頁・発行日
pp.2022.R.05, (Released:2022-12-27)
参考文献数
50

Refugee issues are among the most imminent and important problems facing modern societies. This review essay systematically reviews recent social scientific literature that quantitatively measures national refugee policies. In so doing, we compare several recent and prominent cross-national data sets on this topic, namely those constructed by de Haas, Natter, and Vezzoli (2015), Hatton (2016), Helbling et al. (2017), Blair, Grossman, and Weinstein (2022), and Savun (2022). We point to both the advantages and disadvantages of the respective data sets while providing suggestions on how to practically apply them and how to merge their scopes and perspectives in a more comprehensive manner in order to better fit researchers' and practitioners' scopes of interest. We conclude this article by suggesting future research agendas by highlighting the significance and feasibility of a compilation of a more extensive data set based on the existing ones.
著者
Kazunori D YAMADA Samy BALADRAM Fangzhou LIN
出版者
The Editorial Committee of the Interdisciplinary Information Sciences
雑誌
Interdisciplinary Information Sciences (ISSN:13409050)
巻号頁・発行日
vol.28, no.1, pp.95-105, 2022 (Released:2022-07-31)
参考文献数
40
被引用文献数
1

Thus far, we have experienced three artificial intelligence (AI) booms. In the third one, we succeeded in developing AI that partially surpassed human capabilities. However, we are yet to develop AI that, like humans, can perform a series of cognitive processes. Consciousness built into devices is called machine consciousness. Related research has been conducted from two perspectives: studying machine consciousness as a tool to elucidate human consciousness and achieving the technological goal of furthering AI research with conscious AI. Herein, we survey the research conducted on machine consciousness from the second perspective. For AI to attain machine consciousness, its implementation must be evaluated. Therefore, we only surveyed attempts to implement consciousness as systems on devices. We collected research results in chronological order and found no breakthroughs that could deliver machine consciousness soon. Moreover, there is no method to evaluate whether an implemented machine consciousness system possesses consciousness, thus making it difficult to confirm the certainty of the implementation. This field of research is a new frontier. It is an exciting field with many discoveries expected in the future.
著者
Masaaki HIGASHIJIMA Yujin WOO
出版者
The Editorial Committee of the Interdisciplinary Information Sciences
雑誌
Interdisciplinary Information Sciences (ISSN:13409050)
巻号頁・発行日
vol.29, no.2, pp.109-117, 2023 (Released:2023-07-14)
参考文献数
50

Refugee issues are among the most imminent and important problems facing modern societies. This review essay systematically reviews recent social scientific literature that quantitatively measures national refugee policies. In so doing, we compare several recent and prominent cross-national data sets on this topic, namely those constructed by de Haas, Natter, and Vezzoli (2015), Hatton (2016), Helbling et al. (2017), Blair, Grossman, and Weinstein (2022), and Savun (2022). We point to both the advantages and disadvantages of the respective data sets while providing suggestions on how to practically apply them and how to merge their scopes and perspectives in a more comprehensive manner in order to better fit researchers' and practitioners' scopes of interest. We conclude this article by suggesting future research agendas by highlighting the significance and feasibility of a compilation of a more extensive data set based on the existing ones.
著者
Masaki JUMONJI Hajime URAKAWA
出版者
The Editorial Committee of the Interdisciplinary Information Sciences
雑誌
Interdisciplinary Information Sciences (ISSN:13409050)
巻号頁・発行日
vol.14, no.2, pp.191-223, 2008 (Released:2008-08-30)
参考文献数
19

In this paper, we show new formulas on finite element method (FEM) and three dimensional FEM. By making use of them, we give several computer visions for the eigenvalue problems of the Laplacian for bounded domains and embedded compact surfaces in the three dimensional Euclidean space. As its applications, we can examine several examples to Yau’s problem on the eigenvalues between embedded surfaces and their enclosed three dimensional bounded domains.
著者
Ryuhei UEHARA
出版者
The Editorial Committee of the Interdisciplinary Information Sciences
雑誌
Interdisciplinary Information Sciences (ISSN:13409050)
巻号頁・発行日
pp.2022.R.06, (Released:2022-12-27)
参考文献数
112
被引用文献数
2

Since the 1930s, mathematicians and computer scientists have been interested in computation. While mathematicians investigate recursion theory, computer scientists investigate computational complexity based on Turing machine model to understand what a computation is. Beside them, there is another approach of research on computation, which is the investigation of puzzles and games. Once we regard the rules used in puzzles and games as the set of basic operations of computation, we can perform some computation by solving puzzles and playing games. In fact, research on puzzles and games from the viewpoint of theoretical computer science has continued without any break in the history of theoretical computer science. Sometimes the research on computational complexity classes has proceeded by understanding the tons of puzzles. The wide collection of complete problems for a specific computational complexity class shares a common property, which gives us a deep understanding of the class. In this survey paper, we give a brief history of research on computational complexities of puzzles and games with related results and trends in theoretical computer science.
著者
Yukihiro TSUTSUMI
出版者
The Editorial Committee of the Interdisciplinary Information Sciences
雑誌
Interdisciplinary Information Sciences (ISSN:13409050)
巻号頁・発行日
vol.9, no.1, pp.53-60, 2003 (Released:2003-06-04)
参考文献数
8
被引用文献数
5 6

A universal bound on the number of mutually disjoint non-parallel genus one Seifert surfaces for hyperbolic knots in non-Haken manifolds is given.
著者
Akihiro MUSA Yoshiei SATO Ryusuke EGAWA Hiroyuki TAKIZAWA Koki OKABE Hiroaki KOBAYASHI
出版者
The Editorial Committee of the Interdisciplinary Information Sciences
雑誌
Interdisciplinary Information Sciences (ISSN:13409050)
巻号頁・発行日
vol.15, no.1, pp.51-66, 2009 (Released:2009-03-25)
参考文献数
21
被引用文献数
2 3

Thanks to the highly effective memory bandwidth of the vector systems, they can achieve the high computation efficiency for computation-intensive scientific applications. However, they have been encountering the memory wall problem and the effective memory bandwidth rate has decreased, resulting in the decrease in the bytes per flop rates of recent vector systems from 4 (SX-7 and SX-8) to 2 (SX-8R) and 2.5 (SX-9). The situation is getting worse as many functions units and/or cores will be brought into a single chip, because the pin bandwidth is limited and does not scale. To solve the problem, we propose an on-chip cache, called vector cache, to maintain the effective memory bandwidth rate of future vector supercomputers. The vector cache employs a bypass mechanism between the main memory and register files under software controls. We evaluate the performance of the vector cache on the NEC SX vector processor architecture with bytes per flop rates of 2 B/FLOP and 1 B/FLOP, to clarify the basic characteristics of the vector cache. For the evaluation, we use the NEC SX-7 simulator extended with the vector cache mechanism. Benchmark programs for performance evaluation are two DAXPY-like loops and five leading scientific applications. The results indicate that the vector cache boosts the computational efficiencies of the 2 B/FLOP and 1 B/FLOP systems up to the level of the 4 B/FLOP system. Especially, in the case where cache hit rates exceed 50%, the 2 B/FLOP system can achieve a performance comparable to the 4 B/FLOP system. The vector cache with the bypass mechanism can provide the data both from the main memory and the cache simultaneously. In addition, from the viewpoints of designing the cache, we investigate the impact of cache associativity on the cache hit rate, and the relationship between cache latency and the performance. The results also suggest that the associativity hardly affects the cache hit rate, and the effects of the cache latency depend on the vector loop length of applications. The cache shorter latency contributes to the performance improvement of the applications with shorter loop lengths, even in the case of the 4 B/FLOP system. In the case of longer loop lengths of 256 or more, the latency can effectively be hidden, and the performance is not sensitive to the cache latency. Finally, we discuss the effects of selective caching using the bypass mechanism and loop unrolling on the vector cache performance for the scientific applications. The selective caching is effective for efficient use of the limited cache capacity. The loop unrolling is also effective for the improvement of performance, resulting in a synergistic effect with caching. However, there are exceptional cases; the loop unrolling worsens the cache hit rate due to an increase in the working space to process the unrolled loops over the cache. In this case, an increase in the cache miss rate cancels the gain obtained by unrolling.