Abstract:
In order to improve the quality of clinker produced by pellet rotary kiln, flame temperature that it is a very important factor of affecting on the quality of clinker is studied. The flame images collected from pellet rotary kiln are decomposed into three gray images by the method of RGB, so we can get more information of flame. Taking advantage of gray level co-occurrence matrix, the monitoring model for flame temperature based on image texture is established with RGB channels. In order to test the universality of the algorithm, candle flame temperature is detected by this method. The maximum error of the model is less than 3%.

Wireless statistic division multiplexing
(WSDM) is a multiplexing scheme that transmits multiple signals simultaneously
in the same frequency band over wireless channels. Based on the Shannon
capacity of band-limited waveform AWGN channel with input power constraint, we
obtain channel capacity of WSDM. Compared to time division multiplexing (TDM),
frequency division multiplexing (FDM), and code division multiplexing (CDM),
WSDM is more effective in raising spectrum efficiency. What’s more, we propose
information optimization method to separate time-frequency mixed signals.
Computer simulations also verify that the proposed method is feasible and performs
better than traditional algorithms.

Abstract:
This paper is devoted to the study of the coordinate stability in undirected networks of dynamical agents with time-varying transmission delay. Neighbor-based rules are adopted to realize local control strategies for these continuous-time autonomous agents. Sufficient and necessary conditions in terms of linear matrix inequalities (LMIs) are given to guarantee the coordination of dynamical agents. Numerical simulations are given and demonstrate that our theoretical results are effective.

Abstract:
This paper examines the former location-based social medium Brightkite, over its three-year life span, based on the concept of natural cities. The term 'natural cities' refers to spatially clustered geographic events, such as the agglomerated patches aggregated from individual social media users' locations. We applied the head/tail division rule to derive natural cities, based on the fact that there are far more low-density locations than high-density locations on the earth surface. More specifically, we generated a triangulated irregular network, made up of individual unique user locations, and then categorized small triangles (smaller than an average) as natural cities for the United States (mainland) on a monthly basis. The concept of natural cities provides a powerful means to develop new insights into the evolution of real cities, because there are virtually no data available to track the history of cities across their entire life spans and at very fine spatial and temporal scales. Therefore, natural cities can act as a good proxy of real cities, in the sense of understanding underlying interactions, at a global level, rather than of predicting cities, at an individual level. Apart from the data produced and the contributed methods, we established new insights into the structure and dynamics of natural cities, e.g., the idea that natural cities evolve in nonlinear manners at both spatial and temporal dimensions. Keywords: Big data, head/tail breaks, ht-index, power laws, fractal, and nonlinearity

Abstract:
A major open problem in communication complexity is whether or not quantum protocols can be exponentially more efficient than classical protocols on _total_ Boolean functions in the two-party interactive model. The answer appears to be ``No''. In 2002, Razborov proved this conjecture for so far the most general class of functions F(x, y) = f(x_1 * y_1, x_2 * y_2, ..., x_n * y_n), where f is a_symmetric_ Boolean function on n Boolean inputs, and x_i, y_i are the i'th bit of x and y, respectively. His elegant proof critically depends on the symmetry of f. We develop a lower-bound method that does not require symmetry and prove the conjecture for a broader class of functions. Each of those functions F(x, y) is obtained by what we call the ``block-composition'' of a ``building block'' g : {0, 1}^k by {0, 1}^k --> {0, 1}, with an f : {0, 1}^n -->{0, 1}, such that F(x, y) = f(g(x_1, y_1), g(x_2, y_2), ..., g(x_n, y_n)), where x_i and y_i are the i'th k-bit block of x and y, respectively. We show that as long as g itself is ``hard'' enough, its block-composition with an_arbitrary_ f has polynomially related quantum and classical communication complexities. Our approach gives an alternative proof for Razborov's result (albeit with a slightly weaker parameter), and establishes new quantum lower bounds. For example, when g is the Inner Product function for k=\Omega(\log n), the_deterministic_ communication complexity of its block-composition with_any_ f is asymptotically at most the quantum complexity to the power of 7.

Abstract:
We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain tensor norms of the measurement operator. As applications, we show that (a) If the amount of communication is constant, quantum and classical communication protocols with unlimited amount of shared entanglement or shared randomness compute the same set of functions; (b) A local hidden variable model needs only a constant amount of communication to create, within an arbitrarily small statistical distance, a distribution resulted from local measurements of an entangled quantum state, as long as the number of measurement outcomes is constant.

Abstract:
We introduce a simple stochastic volatility model, which takes into account hitting times of the asset price, and study the optimal stopping problem corresponding to a put option whose time horizon (after the asset price hits a certain level) is exponentially distributed. We obtain explicit optimal stopping rules in various cases one of which is interestingly complex because of an unexpectedly disconnected continuation region. Finally, we discuss in detail how these stopping rules could be used for trading an American put when the trader expects a market drop in the near future.

Abstract:
This paper deals with an important specimen, Podozamites and Cycadocarpidium, found in the same specimen at Ya-an, Sichuan.The specimen was described here as an old species resemble Podozamiles schenkii, which is the characteristic plant in the Upper Triassic. Because its strobile, Cycadocarpidium, was coexisted in the same specimen at the same locality. The specimen was first found in China.The specimen is preserved at coal-bearing bed of Ya-an, Sichuan. The age of this coal-hearing bed is assigned to the Late Triassic.Three strobiles of Cycadocarpidium are clearly preserved in the same specimen.

Abstract:
In this paper, the control of a two-time-scale plant, where the sensor is connected to a linear controller/actuator via a network is addressed. The slow and fast systems of singularly perturbed systems are used to produce an estimate of the plant state behavior between transmission times, by which one can reduce the usage of the network. The approximate solutions of the whole systems are derived and it is shown that the whole systems via the network control are generally asymptotically stable as long as their slow and fast systems are both stable. These results are also extended to the case of network delay.

Abstract:
The Sec translocon of bacterial plasma membranes mediates the linear translocation of secretory proteins as well as the lateral integration of membrane proteins. Integration of many membrane proteins occurs co-translationally via the signal recognition particle (SRP)-dependent targeting of ribosome-associated nascent chains to the Sec translocon. In contrast, translocation of classical secretory proteins across the Sec translocon is a post-translational event requiring no SRP but the motor protein SecA. Secretory proteins were, however, reported to utilize SRP in addition to SecA, if the hydrophobicity of their signal sequences exceeds a certain threshold value. Here we have analyzed transport of this subgroup of secretory proteins across the Sec translocon employing an entirely defined in vitro system. We thus found SecA to be both necessary and sufficient for translocation of secretory proteins with hydrophobic signal sequences, whereas SRP and its receptor improved translocation efficiency. This SRP-mediated boost of translocation is likely due to the early capture of the hydrophobic signal sequence by SRP as revealed by site-specific photo cross-linking of ribosome nascent chain complexes.