Research Center for Environmental Genomics, Kobe University, Rokkodaicho 1-1, Nada, Kobe 657-8501, Japan. (T. G., H. M., X. F., T. I., K. M. and H. I.) Bioresource Laboratories, Mercian Corporation, 1808 Nakaizumi, Iwata, Shizuoka 438-0078, Japan. (T. M. and K. I.) Graduate School of Agricultural Science, Kobe University, Rokkodaicho 1-1, Nada, Kobe 657-8501, Japan. (T. U.) National Institute o...

g l o b a l c o m p e t i t i v e n e s s h a s r e c e n t l y b e c o m e a b i g c h a l l e n g e f o r m a n y c o m p a n i e s a r o u n d t h e w o r l d, w h i c h a r e f o r c e d t o s e e k l o w e r c o s t s a n d h i g h e r q u a l i t y f o r w h a t t h e y p r o d u c e. t h e p r o s p e r i t y o f m a n u f a c t u r i n g f i r m s d e p e n d s o n s e l e c t i n g a n...

Andrea, C., and Lorenzo, N. 2010. “‘We Don’t Need No Education’: Required Abilities in Online Labor Markets,” in Proceedings of the 31 International Conference on Information Systems, St. Louis, MO, December 12-15. Avital, M., Grover, V., Bjørn-Andersen, N., Li, E. Y., and Aviv, T. 2011. “Nurturing a Thriving Information Systems Discipline: A Call To Action,” in Proceedings of the 32 Internatio...

a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...

In this paper we study connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) by adding edges such that the resulting graph keeps the property. The aim is to add as few edges as possible. The property that we consider is planarity, both in an abstract graph-theoretic and in a geometric setting, where...

the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. the ...

a l t h o u g h m o s t c o m p a n i e s s p e n d l e s s o n p r o d u c t d e s i g n, e x p e r i e n c e s h o w s t h a t, t h e s e c o m p a n i e s h a v e t o p a y h i g h e r c o s t s d u e t o p r o d u c t i o n p r o b l e m s o r l o s s o f m a r k e t. l i t e r a t u r e s t u d i e s s h o w t h a t t h e d e s i g n f o r s i x s i g m a i s a p o w e r f u l a p p r o a ...