Rule learning is an important ability that enables human beings to adapt to nature and develop civilizations.There have been many discussions on the mechanism and characteristics of algebraic rule learning,but there a...Rule learning is an important ability that enables human beings to adapt to nature and develop civilizations.There have been many discussions on the mechanism and characteristics of algebraic rule learning,but there are still controversies due to the lack of theoretical guidance.Based on the dual-process theory,this study discussed the following arguments for algebraic rule learning across human and animal studies:whether algebraic rule learning is simply Type 1 processing,whether algebraic rule learning is a domain-general ability,whether algebraic rule learning is shared by humans and animals,and whether an algebraic rule is learned consciously.Moreover,we propose that algebraic rule learning is possibly a cognitive process that combines both Type 1 and Type 2 processing.Further exploration is required to establish the essence and neural basis of algebraic rule learning.展开更多
This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times...This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH-distributios. A GI/M/1 type Markov process for a generalized age process of batches of customers is constructed. The stationary distribution of the GI/M/1 type Markov process is found explicitly and, consequently, the distributions of the age of the batch in service, the total workload in the system, waiting times, and sojourn times of different batches and different types of customers are obtained. The paper gives the matrix representations of the PH-distributions of waiting times and sojourn times. Some results are obtained for the distributions of queue lengths at departure epochs and at an arbitrary time. These results can be used to analyze not only the queue length, but also the composition of the queue. Computational methods are developed for calculating steady state distributions related to the queue lengths, sojourn times, and waiting times.展开更多
文摘Rule learning is an important ability that enables human beings to adapt to nature and develop civilizations.There have been many discussions on the mechanism and characteristics of algebraic rule learning,but there are still controversies due to the lack of theoretical guidance.Based on the dual-process theory,this study discussed the following arguments for algebraic rule learning across human and animal studies:whether algebraic rule learning is simply Type 1 processing,whether algebraic rule learning is a domain-general ability,whether algebraic rule learning is shared by humans and animals,and whether an algebraic rule is learned consciously.Moreover,we propose that algebraic rule learning is possibly a cognitive process that combines both Type 1 and Type 2 processing.Further exploration is required to establish the essence and neural basis of algebraic rule learning.
文摘This paper studies a continuous time queueing system with multiple types of customers and a first-come-first-served service discipline. Customers arrive according to a semi-Markov arrival process and the service times of individual types of customers have PH-distributios. A GI/M/1 type Markov process for a generalized age process of batches of customers is constructed. The stationary distribution of the GI/M/1 type Markov process is found explicitly and, consequently, the distributions of the age of the batch in service, the total workload in the system, waiting times, and sojourn times of different batches and different types of customers are obtained. The paper gives the matrix representations of the PH-distributions of waiting times and sojourn times. Some results are obtained for the distributions of queue lengths at departure epochs and at an arbitrary time. These results can be used to analyze not only the queue length, but also the composition of the queue. Computational methods are developed for calculating steady state distributions related to the queue lengths, sojourn times, and waiting times.
