Carbon capture from natural gas combined cycle power plants: Solvent performance comparison at an industrial scale

Natural gas is an important source of energy. This article addresses the problem of integrating an existing natural gas combined cycle (NGCC) power plant with a carbon capture process using various solvents. The power plant and capture process have mutual interactions in terms of the flue gas flow rate and composition vs. the extracted steam required for solvent regeneration. Therefore, evaluating solvent performance at a single (nominal) operating point is not indicative and solvent performance should be considered subject to the overall process operability and over a wide range of operating conditions. In the present research, a novel optimization framework was developed in which design and operation of the capture process are optimized simultaneously and their interactions with the upstream power plant are fully captured. The developed framework was applied for solvent comparison which demonstrated that GCCmax, a newly developed solvent, features superior performances compared to the monoethanolamine baseline solvent

The number of subsets of integers with no kk-term arithmetic progression

Addressing a question of Cameron and Erd\Ho s, we show that, for infinitely many values of $n$, the number of subsets of $\{1,2,\ldots, n\}$ that do not contain a $k$-term arithmetic progression is at most $2^{O(r_k(n))}$, where $r_k(n)$ is the maximum cardinality of a subset of $\{1,2,\ldots, n\}$ without a $k$-term arithmetic progression. This bound is optimal up to a constant factor in the exponent. For all values of $n$, we prove a weaker bound, which is nevertheless sufficient to transfer the current best upper bound on $r_k(n)$ to the sparse random setting. To achieve these bounds, we establish a new supersaturation result, which roughly states that sets of size $\Theta(r_k(n))$ contain superlinearly many $k$-term arithmetic progressions. For integers $r$ and $k$, Erd\Ho s asked whether there is a set of integers $S$ with no $(k+1)$-term arithmetic progression, but such that any $r$-coloring of $S$ yields a monochromatic $k$-term arithmetic progression. Ne\v{s}et\v{r}il and R\"odl, and independently Spencer, answered this question affirmatively. We show the following density version: for every $k\ge 3$ and $\delta>0$, there exists a reasonably dense subset of primes $S$ with no $(k+1)$-term arithmetic progression, yet every $U\subseteq S$ of size $|U|\ge\delta|S|$ contains a $k$-term arithmetic progression. Our proof uses the hypergraph container method, which has proven to be a very powerful tool in extremal combinatorics. The idea behind the container method is to have a small certificate set to describe a large independent set. We give two further applications in the appendix using this idea.Comment: To appear in International Mathematics Research Notices. This is a longer version than the journal version, containing two additional minor applications of the container metho

Rock Joint Surfaces Measurement and Analysis of Aperture Distribution under Different Normal and Shear Loading Using GIS

Geometry of the rock joint is a governing factor for joint mechanical and hydraulic behavior. A new method of evaluating aperture distribution based on measurement of joint surfaces and three dimensional characteristics of each surface is developed. Artificial joint of granite surfaces are measured,processed, analyzed and three dimensional approaches are carried out for surface characterization. Parameters such as asperity's heights, slope angles, and aspects distribution at micro scale,local concentration of elements and their spatial localization at local scale are determined by Geographic Information System (GIS). Changes of aperture distribution at different normal stresses and various shear displacements are visualized and interpreted. Increasing normal load causes negative changes in aperture frequency distribution which indicates high joint matching. However, increasing shear displacement causes a rapid increase in the aperture and positive changes in the aperture frequency distribution which could be due to unmatching, surface anisotropy and spatial localization of contact points with proceeding shear

On two problems in Ramsey-Tur\'an theory

Alon, Balogh, Keevash and Sudakov proved that the $(k-1)$-partite Tur\'an graph maximizes the number of distinct $r$-edge-colorings with no monochromatic $K_k$ for all fixed $k$ and $r=2,3$, among all $n$-vertex graphs. In this paper, we determine this function asymptotically for $r=2$ among $n$-vertex graphs with sub-linear independence number. Somewhat surprisingly, unlike Alon-Balogh-Keevash-Sudakov's result, the extremal construction from Ramsey-Tur\'an theory, as a natural candidate, does not maximize the number of distinct edge-colorings with no monochromatic cliques among all graphs with sub-linear independence number, even in the 2-colored case. In the second problem, we determine the maximum number of triangles asymptotically in an $n$-vertex $K_k$-free graph $G$ with $\alpha(G)=o(n)$. The extremal graphs have similar structure to the extremal graphs for the classical Ramsey-Tur\'an problem, i.e.~when the number of edges is maximized.Comment: 22 page

Modeling of Social Transitions Using Intelligent Systems

In this study, we reproduce two new hybrid intelligent systems, involve three prominent intelligent computing and approximate reasoning methods: Self Organizing feature Map (SOM), Neruo-Fuzzy Inference System and Rough Set Theory (RST),called SONFIS and SORST. We show how our algorithms can be construed as a linkage of government-society interactions, where government catches various states of behaviors: solid (absolute) or flexible. So, transition of society, by changing of connectivity parameters (noise) from order to disorder is inferred