Time filter

Source Type

Saitama, Japan

Rissho University , one of the oldest universities in Japan, was founded in 1580, when a seminary was established as a learning center for young monks of the Nichiren shu.The university's name came from the Rissho Ankoku Ron, a thesis written by Nichiren, a prominent Buddhist priest of the Kamakura period. Rissho University enrolls approximately 11,900 students. It has 14 undergraduate departments and 6 graduate school research departments on two separate campuses. Wikipedia.

Kawahara S.,Rissho University
Environmental and Resource Economics | Year: 2014

This paper studies how one country's decision to liberalize trade affects the political economic structure that determines environmental policy in another country. By constructing a political economy model in which the formation of lobby groups and environmental policy are endogenously determined, we show that unilateral tariff reductions by a large country importing a polluting good will generate a lobby group with a relatively lower cost of organization in a small country exporting that good. A formulated lobby demands an inefficient environmental policy, and hence, the small country's environmental regulations become less efficient. Then, we show that when a lobby already exists, unilateral tariff reductions result in the formation of a rival lobby and consequently make the small country's environmental policy more efficient. © 2013 Springer Science+Business Media Dordrecht.

Okada I.,Soka University | Yamamoto H.,Rissho University
ACM Transactions on Intelligent Systems and Technology | Year: 2013

Which risk should one choose when facing alternatives with different levels of risk?We discuss here adaptive processes in such risk choice behavior by generalizing the study of Roos et al. [2010].We deal with an n-choice game in which every player sequentially chooses n times of lotteries of which there are two types: a safe lottery and a risky lottery. We analyze this model in more detail by elaborating the game. Based on the results of mathematical analysis, replicator dynamics analysis, and numerical simulations, we derived some salient features of risk choice behavior. We show that all the risk strategies can be divided into two groups: persistence and nonpersistence. We also proved that the dynamics with perturbation in which a mutation is installed is globally asymptotically stable to a unique equilibrium point for any initial population. The numerical simulations clarify that the number of persistent strategies seldom increases regardless of the increase in n, and suggest that a rarity of dominant choice strategies is widely observed in many social contexts. These facts not only go hand-in-hand with some well-known insights from prospect theory, but may also provide some theoretical hypotheses for various fields such as behavioral economics, ecology, sociology, and consumer behavioral theory. © 2013 ACM.

Enokido T.,Rissho University | Aikebaier A.,Seikei University | Takizawa M.,Seikei University
IEEE Transactions on Industrial Electronics | Year: 2011

Information systems are composed of various types of computers interconnected in networks. In addition, information systems are being shifted from the traditional clientserver model to the peer-to-peer (P2P) model. P2P systems are scalable and fully distributed without any centralized coordinator. Here, it is getting more significant to discuss how to reduce the total electric power consumption of computers in addition to developing distributed algorithms to minimize the computation time and memory space. In this paper, we do not discuss microlevel models like the hardware specifications of computers like low-energy CPUs. We rather discuss a macrolevel model to show the relation of the amount of computation and the total power consumption of multiple peer computers to perform Web types of application processes. We also discuss algorithms for allocating a process to a computer so that the deadline constraint is satisfied and the total power consumption is reduced. © 2010 IEEE.

Enokido T.,Rissho University | Takizawa M.,Seikei University
IEEE Transactions on Industrial Electronics | Year: 2011

Cyber engineering is getting more significant in not only manufacturing but also business applications. Information management technologies play a key role in cyber engineering. In order to realize the cyber engineering, objects in information systems are required to be not only secure but also consistent in the presence of security threats and multiple conflicting transactions. There are so far many discussions on each of the security management and concurrence control. However, there is no discussion on synchronization mechanisms to realize both of them. In this paper, we discuss a novel synchronization protocol to make an information system not only secure but also consistent. In the role-based access control model, authorized access requests are specified in roles which are collections of access rights. A transaction issued by a subject is assigned with a subfamily of the roles granted to the subjects, which are named purpose. We first define legal information flow relations among purposes. Based on the legal information flow relations, we discuss a purpose-marking (PM) protocol to prevent illegal information flow to occur by performing conflicting transactions in a serializable way. We evaluate the PM protocol in terms of the number of transactions to be aborted. © 2010 IEEE.

Enokido T.,Rissho University | Takizawa M.,Seikei University
Proceedings - International Conference on Advanced Information Networking and Applications, AINA | Year: 2012

The power consumption of information systems, especially servers has to be reduced to realize green eco-society. A client first selects a server in a collection of possible servers and issues a request to the server. The request is performed as a process in the server. In this paper, we consider a computation type of application where CPU resource is mainly used in a server. It is critical to discuss how to select a server for each request from clients in order to reduce the total power consumption. The power consumption laxity based (PCLB)algorithm for selecting a server is discussed in this paper, where a server to consume the minimum power to perform a process is selected. In a server, cooling devices like CPU fans consume the electronic power in addition to CPU and other devices. In our previous studies, we assume the cooling devices consume the constant power and propose the simple power consumption model. In the simple power consumption model, if at least one application process is performed on a server, the electric power is maximally consumed on the server. Otherwise, the electric power consumption is minimum. The rotation speed of a fan is controlled in servers based on the temperature of CPU and in the server's case. Thus, the total power consumption of a server depends on not only the power consumption of computational devices like CPU but also the power consumption of cooling devices like fans. In this paper, we extend the simple power consumption model to take into account the power consumption of cooling devices. We improve the PCLB algorithm based on the extended simple power consumption model. © 2012 IEEE.

Discover hidden collaborations