Throughout this paper, G denotes a fixed, not necessarily connected, reductive algebraic group over an algebraically closed field k with a fixed connected component D which generates G. This paper is a part of a series [L9] which attempts to develop a theory of character sheaves on D. Our main result here is the classification of ”unipotent” character sheaves on D (under a mild assumption on th...

Adopting a person-centred approach, we integrate the job demands-control-support model with relational work design theory to investigate employee profiles involving autonomy, workload, social support and prosocial characteristics (representing combined influence of task significance beneficiary contact). For sample Australian not-for-profit employees ( N = 2421), identified four profiles: ‘acti...

The path number p(G) of a graph G is the minimum number of paths needed to partition the edge set of G. Gallai conjectured that p(G) b n+1 2 c for every connected graph G of order n. Because of the graph consisting of disjoint triangles, the best one could hope for in the disconnected case is p(G) b 2 3 nc. We prove the sharper result that p(G) 1 2 u + b 2 3 gc where u is the number of odd vert...

In this paper we present a replicated object store used to support disconnected operation. The system uses an optimistic replication approach to provide high read and write availability. The development of new applications is supported by an object framework that decomposes objects in several components, each one managing a different aspect related with data sharing, such as concurrency control...

We have introduced and investigated the notion of I-extremal disconnectedness on ideal topological spaces. First, we found that the notions of extremal disconnectedness and I-extremal disconnectedness are independent of each other. About the letter one, we observed that every open subset of an I-extremally disconnected space is also an I-extremally disconnected space. And also, in extremally di...

Workflow management systems are frequently used for modeling, monitoring and controlling the coordinated execution of activities performed by workgroups in a variety of contexts. With the widespread use of portable computers and their growing computational power, conventional systems have often proved to be overly restrictive, effectively limiting the level of autonomy of the users involved. Th...

The World Wide Web gives individuals access to huge amounts of data. This includes access to information also found in traditional formats such as news copy. This study addresses a desire to blend these two mediums in such a way that media consumers can move transparently from a hard copy of a given article to an electronic copy. Document retrieval experiments were performed in an attempt to de...

In this paper, we propose a routing protocol for disconnected ad hoc networks where most nodes tend to move about in groups. To the best of our knowledge, no routing protocol for disconnected ad hoc networks has been designed earlier keeping in mind possible group patterns formed by the movement of nodes. Our protocol works by identifying groups using an efficient distributed group membership p...

The need to continue to work in a mobile environment raises the problem of data availability in the presence of disconnections. Our approach aiming at solving this problem is to make a local replication of data and code on the mobile terminal. The system and the applications should also be reactive to mobile environment changes. The work presented in this paper is the continuation of Domint [6,...

The problem of finding a disconnected cut in a graph is NP-hard in general but polynomial-time solvable on planar graphs. The problem of finding a minimal disconnected cut is also NP-hard but its computational complexity was not known for planar graphs. We show that it is polynomial-time solvable on 3-connected planar graphs but NP-hard for 2-connected planar graphs. Our technique for the first...