This paper is concerned with the problem of identifying names which occur frequently in an ordered list of names. Such names are called hot spots. Hot spots can be identiied easily by counting the occurrences of each name and then selecting those with large counts. However, this simple solution requires space proportional to the number of names that occur in the list. In this paper, we present ...

A new analysis method is introduced for investigating whether major flares are clustered in certain fixed regions of the Sun in rigidly-rotating coordinate systems. This method is applied to analysis of major flares of solar cycles 19–23. Northern and southern hemispheres are separately analyzed, and it is found that longitude distributions of flares in the two hemispheres are different. Theref...

6 Developing Functional Programs 2 6.1 Chapter Introduction . . . . . . . . . . . . . . . . . . . . . . . . . 2 6.2 Developing a Cosequential Processing Family . . . . . . . . . . . 2 6.2.1 Function generalization . . . . . . . . . . . . . . . . . . . 2 6.2.2 Scope . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 6.2.3 Frozen spots . . . . . . . . . . . . . . . . . . . . . . . . . 3 ...

We propose a dynamic load balancing scheme for the tele-traac hot spot problem in cellular networks. A tele-traac hot spot is a region of adjacent hot cells where the channel demand has exceeded a certain threshold. A hot spot is depicted as a stack of hexagonaìRings' of cells and is classiied as complete if all cells within it are hot. Otherwise it is termed incomplete. The rings containing al...

Packet contention is one of the fundamental problems that must be overcome in designing packet switches. In banyan network, which has multistage interconnection structure of many small switch elements, we must be concerned with output port conflicts and internal collisions. Dilated banyan network which provides multiple path for internal link can reduce packet loss due to internal collisions in...