Abstract:
this paper analyzes work organization features within companies belonging to different argentinean production networks as well as their relationship with innovation processes. the research is based on a survey applied to automotive, clothing, agricultural machinery, and iron and steel production networks. a cluster analysis and logit models have been used. the study concludes that, in a context where low complexity work organization style prevails, beneficiai innovative dynamics stands out among learning organizations.

Abstract:
El objetivo principal del presente artículo es analizar las características que adopta la organización del trabajo en un conjunto de empresas pertenecientes a diferentes ramas productivas argentinas y su vinculación con los procesos de innovación. Este estudio se basa en datos de una encuesta realizada a empresas de las ramas automotriz, textil, de maquinaria agrícola y siderúrgica de Argentina. Para el análisis se utilizaron dos técnicas estadísticas: análisis de cluster y modelos logit. En un contexto de fuerte predominio de formas de organización del trabajo de escasa complejidad, se concluye que las dinámicas innovativas más virtuosas prevalecen entre las empresas que se caracterizan por esquemas formativos. This paper analyzes work organization features within companies belonging to different Argentinean production networks as well as their relationship with innovation processes. The research is based on a survey applied to automotive, clothing, agricultural machinery, and iron and steel production networks. A cluster analysis and logit models have been used. The study concludes that, in a context where low complexity work organization style prevails, beneficiai innovative dynamics stands out among learning organizations.

Abstract:
A sequence of nonnegative integers $\pi$ is {\it graphic} if it is the degree sequence of some graph $G$. In this case we say that $G$ is a \textit{realization} of $\pi$, and we write $\pi=\pi(G)$. A graphic sequence $\pi$ is {\it potentially $H$-graphic} if there is a realization of $\pi$ that contains $H$ as a subgraph. Given nonincreasing graphic sequences $\pi_1=(d_1,\ldots,d_n)$ and $\pi_2 = (s_1,\ldots,s_n)$, we say that $\pi_1$ {\it majorizes} $\pi_2$ if $d_i \geq s_i$ for all $i$, $1 \leq i \leq n$. In 1970, Erd\H{o}s showed that for any $K_{r+1}$-free graph $H$, there exists an $r$-partite graph $G$ such that $\pi(G)$ majorizes $\pi(H)$. In 2005, Pikhurko and Taraz generalized this notion and showed that for any graph $F$ with chromatic number $r+1$, the degree sequence of an $F$-free graph is, in an appropriate sense, nearly majorized by the degree sequence of an $r$-partite graph. In this paper, we give similar results for degree sequences that are not potentially $H$-graphic. In particular, there is a graphic sequence $\pi^*(H)$ such that if $\pi$ is a graphic sequence that is not potentially $H$-graphic, then $\pi$ is close to being majorized by $\pi^*(H)$. Similar to the role played by complete multipartite graphs in the traditional extremal setting, the sequence $\pi^*(H)$ asymptotically gives the maximum possible sum of a graphic sequence $\pi$ that is not potentially $H$-graphic.

Abstract:
Given graphs $G$ and $H$, $G$ is $H$-saturated if $H$ is not a subgraph of $G$, but for all $e \notin E(G)$, $H$ appears as a subgraph of $G + e$. While for every $n \ge |V(H)|$, there exists an $n$-vertex graph that is $H$-saturated, the same does not hold for induced subgraphs. That is, there exist graphs $H$ and values of $n \ge |V(H)|$ for which every $n$-vertex graph $G$ either contains $H$ as an induced subgraph, or there exists $e \notin E(G)$ such that $G + e$ does not contain $H$ as an induced subgraph. To circumvent this, Martin and Smith make use of trigraphs when introducing the concept of induced saturation and the induced saturation number of graphs. This allows for edges that can be included or excluded when searching for an induced copy of H, and the induced saturation number is the minimum number of such edges that are required. In this paper, we show that the induced saturation number of many common graphs is zero. Consequently, this yields graphs, instead of trigraphs, that are H-induced-saturated. We introduce a new parameter for such graphs, indsat*(n;H), which is the minimum number of edges in an H-induced-saturated graph on n vertices. We provide bounds on indsat*(n;H) for many graphs. In particular, we determine indsat*(n;paw) completely, and indsat*(n;$K_{1,3}$) for infinitely many n.

Abstract:
Occupational functioning represents both an important outcome for military servicemembers returning from Operation Iraqi Freedom (OIF) and Operation Enduring Freedom and a predictor for long-term mental health functioning. We investigated the role of mental health diagnoses, determined by structured clinical interviews, on occupational functioning in a group of 262 National Guard/Reserve servicemembers within 1 year of returning from a 16-month OIF combat deployment. We assessed occupational functioning at the time of diagnostic interviews and 1 year later. We hypothesized that servicemembers with diagnoses of posttraumatic stress disorder (PTSD), depression, and/or alcohol abuse or dependence would exhibit lower rates of employment at both time points and lower rates of reported work and/or school role functioning. Servicemembers with a diagnosis of PTSD (5%, n = 13), subthreshold PTSD (6%, n = 15), a major depressive disorder (11%, n = 29), or alcohol abuse or dependence (11%, n = 28) did not differ on employment status from servicemembers without a diagnosis at either time point. However, those with a diagnosis of PTSD, depression, and/or alcohol abuse or dependence reported lower levels of work role functioning. In addition, servicemembers with a diagnosis of PTSD reported greater rates of deterioration in work role functioning over time.

Abstract:
This work deals with enzymatic hydrolysis of babassu oil by immobilized lipase in membrane reactors of two types: a flat plate nylon membrane and a hollow fiber polyetherimide membrane on which surface commercial lipases were immobilized by adsorption. Experiments conducted in the hollow fiber reactor showed that during the immobilization step enzyme adsorption followed a sigmoid model, with a maximum adsorption equilibrium time of 30 minutes. Concerning the hydrodynamics of the liquid phases, the results indicate that main diffusional limitations occurred in the organic phase. The amount of protein immobilized and the maximum productivity were, respectively, 1.97 g/m2 and 44 m molH+/m2.s for the hollow fiber and 1.2 g/m2 and 56 m molH+/m2.s for the flat and plate membrane. Both reactors were able to perform the hydrolysis reaction, while maintaining absolute separation of the two phases by the membrane