Modeling Of Hydrolytic Polymerization In A Semibatch Nylon 6 Reactor

Hydrolytic polymerization of caprolactam to Nylon 6 in a semibatch reactor is carried out by heating a mixture of water and caprolactam. Evaporation of volatiles caused by heating results in a pressure build-up. After the pressure reaches a predetermined value, vapors are vented to keep the pressure constant for some time, and thereafter, to lower the pressure to a value slightly above atmospheric in a preprogrammed manner. The characteristics of the polymer are determined by the chemical reactions and the vaporization of water and caprolactam. The semibatch operation has been simulated and the predictions have been compared with industria data. The observed temperature and pressure histories were predicted with a fair degree of accuracy. It was found that the predictions of the degree of polymerization however are sensitive to the vapor-liquid equilibrium relations. A comparison with an earlier model, which neglected mass transfer resistance, indicates that simulation using the VLE data of Giori and Hayes and accounting for mass transfer resistance is more reliable.

Geometric representations of graphs in low dimension

We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in $1.5 (\Delta + 2) \ln n$ dimensions, where $\Delta$ is the maximum degree of G. We also show that $\boxi(G) \le (\Delta + 2) \ln n$ for any graph G. Our bound is tight up to a factor of $\ln n$. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree $\Delta$, we show that for almost all graphs on n vertices, its boxicity is upper bound by $c\cdot(d_{av} + 1) \ln n$ where d_{av} is the average degree and c is a small constant. Also, we show that for any graph G, $\boxi(G) \le \sqrt{8 n d_{av} \ln n}$, which is tight up to a factor of $b \sqrt{\ln n}$ for a constant b.

The hazard potential of the western segment of the Makran subduction zone, northern Arabian Sea

Evaluating the hazard potential of the Makran subduction zone requires understanding the previous records of the large earthquakes and tsunamis. We address this problem by searching for earthquake and tectonic proxies along the Makran Coast and linking those observations with the available constraints on historical seismicity and the tell-tale characteristics of sea floor morphology. The earthquake of Mw 8.1 of 1945 and the consequent tsunami that originated on the eastern part of the Makran are the only historically known hazardous events in this region. The seismic status of the western part of the subduction zone outside the rupture area of the 1945 earthquake remains an enigma. The near-shore shallow stratigraphy of the central part of Makran near Chabahar shows evidence of seismically induced liquefaction that we attribute to the distant effects of the 1945 earthquake. The coastal sites further westward around Jask are remarkable for the absence of liquefaction features, at least at the shallow level. Although a negative evidence, this possibly implies that the western part of Makran Coast region may not have been impacted by near-field large earthquakes in the recent past-a fact also supported by the analysis of historical data. On the other hand, the elevated marine terraces on the western Makran and their uplift rates are indicative of comparable degree of long-term tectonic activity, at least around Chabahar. The offshore data suggest occurrences of recently active submarine slumps on the eastern part of the Makran, reflective of shaking events, owing to the great 1945 earthquake. The ocean floor morphologic features on the western segment, on the contrary, are much subdued and the prograding delta lobes on the shelf edge also remain intact. The coast on the western Makran, in general, shows indications of progradation and uplift. The various lines of evidence thus suggest that although the western segment is potentially seismogenic, large earthquakes have not occurred there in the recent past, at least during the last 600 years. The recurrence period of earthquakes may range up to 1,000 years or more, an assessment based on the age of the youngest dated coastal ridge. The long elapsed time points to the fact that the western segment may have accumulated sufficient slip to produce a major earthquake.

EXIT Chart Based Design of Irregular LDPC Codes for Large-MIMO Systems

In this letter, we characterize the extrinsic information transfer (EXIT) behavior of a factor graph based message passing algorithm for detection in large multiple-input multiple-output (MIMO) systems with tens to hundreds of antennas. The EXIT curves of a joint detection-decoding receiver are obtained for low density parity check (LDPC) codes of given degree distributions. From the obtained EXIT curves, an optimization of the LDPC code degree profiles is carried out to design irregular LDPC codes matched to the large-MIMO channel and joint message passing receiver. With low complexity joint detection-decoding, these codes are shown to perform better than off-the-shelf irregular codes in the literature by about 1 to 1.5 dB at a coded BER of 10(-5) in 16 x 16, 64 x 64 and 256 x 256 MIMO systems.

Assessment of the Relationships Among Design Methods, Design Activities, and Creativity

This paper presents an experimental study that was conducted to compare the results obtained from using different design methods (brainstorming (BR), functional analysis (FA), and SCAMPER) in design processes. The objectives of this work are twofold. The first was to determine whether there are any differences in the length of time devoted to the different types of activities that are carried out in the design process, depending on the method that is employed; in other words, whether the design methods that are used make a difference in the profile of time spent across the design activities. The second objective was to analyze whether there is any kind of relationship between the time spent on design process activities and the degree of creativity in the solutions that are obtained. Creativity evaluation has been done by means of the degree of novelty and the level of resolution of the designed solutions using creative product semantic scale (CPSS) questionnaire. The results show that there are significant differences between the amounts of time devoted to activities related to understanding the problem and the typology of the design method, intuitive or logical, that are used. While the amount of time spent on analyzing the problem is very small in intuitive methods, such as brainstorming and SCAMPER (around 8-9% of the time), with logical methods like functional analysis practically half the time is devoted to analyzing the problem. Also, it has been found that the amount of time spent in each design phase has an influence on the results in terms of creativity, but results are not enough strong to define in which measure are they affected. This paper offers new data and results on the distinct benefits to be obtained from applying design methods. DOI: 10.1115/1.4007362]

Representing a cubic graph as the intersection graph of axis-parallel boxes in three dimensions

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if their corresponding vertices are adjacent. In fact, we construct a representation in which any two intersecting boxes just touch at their boundaries. Further, this construction can be realized in linear time.

Study of dynamic behaviour of recession curves

Since Brutsaert and Neiber (1977), recession curves are widely used to analyse subsurface systems of river basins by expressing -dQ/dt as a function of Q, which typically take a power law form: -dQ/dt=kQ, where Q is the discharge at a basin outlet at time t. Traditionally recession flows are modelled by single reservoir models that assume a unique relationship between -dQ/dt and Q for a basin. However, recent observations indicate that -dQ/dt-Q relationship of a basin varies greatly across recession events, indicating the limitation of such models. In this study, the dynamic relationship between -dQ/dt and Q of a basin is investigated through the geomorphological recession flow model which models recession flows by considering the temporal evolution of its active drainage network (the part of the stream network of the basin draining water at time t). Two primary factors responsible for the dynamic relationship are identified: (i) degree of aquifer recharge (ii) spatial variation of rainfall. Degree of aquifer recharge, which is likely to be controlled by (effective) rainfall patterns, influences the power law coefficient, k. It is found that k has correlation with past average streamflow, which confirms the notion that dynamic -dQ/dt-Q relationship is caused by the degree of aquifer recharge. Spatial variation of rainfall is found to have control on both the exponent, , and the power law coefficient, k. It is noticed that that even with same and k, recession curves can be different, possibly due to their different (recession) peak values. This may also happen due to spatial variation of rainfall. Copyright (c) 2012 John Wiley & Sons, Ltd.

REPRESENTING A CUBIC GRAPH AS THE INTERSECTION GRAPH OF AXIS-PARALLEL BOXES IN THREE DIMENSIONS

We show that every graph of maximum degree 3 can be represented as the intersection graph of axis parallel boxes in three dimensions, that is, every vertex can be mapped to an axis parallel box such that two boxes intersect if and only if their corresponding vertices are adjacent. In fact, we construct a representation in which any two intersecting boxes touch just at their boundaries.

Vertex Cover Gets Faster and Harder on Low Degree Graphs

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns out to be exactly the vertex cover problem on restricted classes of graphs. In this work we explore a particular instance of such a phenomenon. We consider the problem of hitting all axis-parallel slabs induced by a point set P, and show that it is equivalent to the problem of finding a vertex cover on a graph whose edge set is the union of two Hamiltonian Paths. We show the latter problem to be NP-complete, and also give an algorithm to find a vertex cover of size at most k, on graphs of maximum degree four, whose running time is 1.2637(k) n(O(1)).

alpha-Tocopherol derived lipid dimers as efficient gene transfection agents. Mechanistic insights into lipoplex internalization and therapeutic induction of apoptotic activity

In this report, we present cationic dimeric (gemini) lipids for significant plasmid DNA (pDNA) delivery to different cell lines without any marked toxicity in the presence of serum. Six gemini lipids based on alpha-tocopherol were synthesized, which differed in their spacer chain lengths. Each of these gemini lipids mixed with a helper lipid, 1,2-dioleoyl phosphatidyl ethanolamine (DOPE), was capable of forming stable aqueous suspensions. These co-liposomal systems were examined for their potential to transfect pEGFP-C3 plasmid DNA into nine cell lines of different origins. The transfection efficacies noticed in terms of EGFP expression levels using flow cytometry were well corroborated using independent fluorescence microscopy studies. Significant EGFP expression levels were reported using the gemini co-liposomes, which counted significantly better than one well known commercial formulation, Lipofectamine 2000 (L2 K). Transfection efficacies were also analyzed in terms of the degree of intracellular delivery of labeled plasmid DNA (pDNA) using confocal microscopy, which revealed an efficient internalization in the presence of serum. The cell viability assays performed using optimized formulations demonstrated no significant toxicity towards any of the cell lines used in the study. We also had a look at the lipoplex internalization pathway to profile the uptake characteristics. A caveolae/lipid raft route was attributed to their excellent gene transfection capabilities. The study was further advanced by using a therapeutic p53-EGFP-C3 plasmid and the apoptotic activity was observed using FACS and growth inhibition assay.

On the Parameterized Complexity of Finding Separators with Non-Hereditary Properties

We study the problem of finding small s-t separators that induce graphs having certain properties. It is known that finding a minimum clique s-t separator is polynomial-time solvable (Tarjan in Discrete Math. 55:221-232, 1985), while for example the problems of finding a minimum s-t separator that induces a connected graph or forms an independent set are fixed-parameter tractable when parameterized by the size of the separator (Marx et al. in ACM Trans. Algorithms 9(4): 30, 2013). Motivated by these results, we study properties that generalize cliques, independent sets, and connected graphs, and determine the complexity of finding separators satisfying these properties. We investigate these problems also on bounded-degree graphs. Our results are as follows: Finding a minimum c-connected s-t separator is FPT for c=2 and W1]-hard for any ca parts per thousand yen3. Finding a minimum s-t separator with diameter at most d is W1]-hard for any da parts per thousand yen2. Finding a minimum r-regular s-t separator is W1]-hard for any ra parts per thousand yen1. For any decidable graph property, finding a minimum s-t separator with this property is FPT parameterized jointly by the size of the separator and the maximum degree. Finding a connected s-t separator of minimum size does not have a polynomial kernel, even when restricted to graphs of maximum degree at most 3, unless .

Campaigning in Heterogeneous Social Networks: Optimal Control of SI Information Epidemics

We study the optimal control problem of maximizing the spread of an information epidemic on a social network. Information propagation is modeled as a susceptible-infected (SI) process, and the campaign budget is fixed. Direct recruitment and word-of-mouth incentives are the two strategies to accelerate information spreading (controls). We allow for multiple controls depending on the degree of the nodes/individuals. The solution optimally allocates the scarce resource over the campaign duration and the degree class groups. We study the impact of the degree distribution of the network on the controls and present results for Erdos-Renyi and scale-free networks. Results show that more resource is allocated to high-degree nodes in the case of scale-free networks, but medium-degree nodes in the case of Erdos-Renyi networks. We study the effects of various model parameters on the optimal strategy and quantify the improvement offered by the optimal strategy over the static and bang-bang control strategies. The effect of the time-varying spreading rate on the controls is explored as the interest level of the population in the subject of the campaign may change over time. We show the existence of a solution to the formulated optimal control problem, which has nonlinear isoperimetric constraints, using novel techniques that is general and can be used in other similar optimal control problems. This work may be of interest to political, social awareness, or crowdfunding campaigners and product marketing managers, and with some modifications may be used for mitigating biological epidemics.