"none"

Let S be a set of k distinct elements. An oriented k coloring of an oriented graph D is a mapping f:V(D)¡÷S such that (i) if xy is conatined in A(D), then f(x)¡Úf(y) and (ii) if xy,zt are conatined in A(D) and f(x)=f(t), then f(y)¡Úf(z). The oriented chromatic number Xo(D) of an oriented graph D is defined as the minimum k where there exists an oriented k-coloring of D. For an undirected graph G, let O(G) be the set of all orientations D of G. We define the oriented chromatic number Xo(G) of G to be the maximum of Xo(D) over D conatined by O(G). In this thesis, we determine the oriented chromatic number of complete bipartite graphs and complete k-partite graphs. A grid G(m,n) is a graph with the vertex set V(G(m,n))={(i,j) | 1¡Øi¡Øm,1¡Øj¡Øn} and the edge set E(G(m,n))={(i,j)(x,y) | (i=x+1 and j=y) or (i=x and j=y+1)}. Fertin, Raspaud and Roychowdhury [3] proved Xo(G(4,5))¡Ù7 by computer programs. Here, we give a proof of Xo(D(5,6)=7 where D(5,6) is the orientation of G(5,6).

The AspectOPTIMA project aims to build an aspect-oriented framework that provides run-time support for transactions. The previously established decomposition of the ACID (atomicity, consistency, isolation, durability) properties into ten well-defined reusable aspects had one limitation: it didn't take into account the concerns of transaction life-time support, resulting in the creation of a cross-cutting concern among the aspects. This thesis removes the cross-cutting concern by integrating the transactional life cycle management issues such as determining the transaction boundaries, maintaining a well-defined state and managing the involvement of the participants. The integration process results in the creation of new aspects that serve as building blocks for various transactional models. The thesis also demonstrates how these base aspects can be configured and composed in different ways to design customized transaction models with different concurrency control and recovery strategies.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.