Abstract:
Virginia Woolf is a master of language, and she is also very familiar with the rhythm of music. As the forerunner of stream of consciousness, she devotes herself to the innovation of the form, so as to achieve the beauty of a formal unity. The structure of To the Lighthouse coordinates the movement of sonata form, which fully expresses the conflict and harmony of the feelings and thoughts, and makes the whole novel develop smoothly. This paper is focused on the sonata form integrate into the narrative art, so as to show the way Woolf builds the wholeness out of the fragments in human mind.

Abstract:
Four women are selected from Tennessee’s four dramas. The four women all struggle for survival and they are “Error” women according to Aristotle’s “Error” theory. There are two kinds of “Error”. These four women in the plays make one of the mistakes or make two mistakes at the same time. They make mistakes for the purpose of survival. Their tragedy is survival tragedy. The “error” is one essential part of the play’s plot and helps construct the effect of a tragedy.

Abstract:
We mainly study the max problem of scheduling n groups of jobs on n special-purpose processors and m general-purpose processors at different speeds provided that the setup time of each job is less than times of its processing time. We first propose an improved LS algorithm. Then, by applying this new algorithm, we obtain two bounds for the ratio of the approximate solution LS to the optimal solution T* under two different conditions.

Abstract:
To aware the topology of wireless sensor networks (WSN) with time-variety, and load-balance the resource of communication and energy, an opportunistic routing protocol for WSN based on Opportunistic Routing Entropy and ant colony optimization, called ACO-TDOP, is proposed. At first, based on the second law of thermo-dynamics, we introduce the concept of Opportunistic Routing Entropy which is a parameter representing the transmission state of each node by taking into account the power left and the distance to the sink node. Then, it is proved that the problem of route thinking about Opportunistic Routing Entropy is shown to be NP-hard. So the protocol, ACO-TDOP, is proposed. At last, numerical results confirm that the ACO-TDOP is energy conservative and throughput gainful compared with other two existing routing protocols, and show that it is efficacious to analyze and uncover fundamental of message transmission with Opportunistic Routing in wireless network using the second law of thermodynamics.

Abstract:
In the 6000 kN·m energy level dynamic compaction on Inner Mongolia wind-blown sand foundation treatment process, the dynamic characteristics and dynamic response are measured. Vibration action time, vibration main frequency, peak acceleration and peak velocity are analyzed. The vibration acting time is very short, the vertical average vibration acting time increases obviously with distance increasing, and the horizontal average vibration time does hardly change. The main frequency of vibration is at 4.60 - 24.90 Hz, which depends on the soil properties and soil layer distribution. The peak acceleration and peak velocity space distribution are similar. The maximum of horizontal acceleration peak is close to vertical velocity peak, and is near to 51 g under rammer. The maximum of horizontal velocity peak is close to vertical velocity peak, and is near to 54 m/s under rammer. The peak acceleration and velocity are rapidly attenuated, but the vertical peak acceleration and peak velocity are slowly attenuated than horizontal direction. The effective treating depth arrives 13 m for wind-blown wind, peak acceleration is 1.8 g or so, and peak velocity is 2.1 m/s or so. Horizontal treating range is 2.6 times of rammer diameter, and vertical treating range is 5.65 times of rammer diameter.

Abstract:
We present here a systems biology approach that allows systematic search for effective reprogramming recipes and monitoring the reprogramming progress to uncover the underlying mechanisms. Using budding yeast as a model system, we have curated a genetic network regulating cell cycle and sporulation. Phenotypic consequences of perturbations can be predicted from the network without any prior knowledge, which makes it possible to computationally reprogram cell fate. As the heterogeneity of natural cells is important in many biological processes, we find that the extent of this heterogeneity restored by the reprogrammed cells varies significantly upon reprogramming recipes. The heterogeneity difference between the reprogrammed and natural cells may have functional consequences.Our study reveals that cellular reprogramming can be achieved by many different perturbations and the reprogrammability of a cell depends on the heterogeneity of the original cell state. We provide a general framework that can help discover new recipes for cellular reprogramming in human.In response to environmental or developmental signals, eukaryote cells normally transit to a specific state defined by the realization of its genetic network that specifies the gene expression and protein abundance levels. In the landscape of the cell state space, there exist attractors corresponding to different cell fates [1-4] and barriers between these attractors constrain cells to one attractor (one cell fate). Perturbations such as overexpression of a set of genes may push cells overcome the barriers and thus move from one attractor to another in the cell state space. An example is the generation of induced pluripotent stem cells (iPSCs) from differentiated somatic cells by overexpression of several genes [5-8]. A challenging problem is how to efficiently find effective, ideally the optimal, perturbations to reprogram a cell's fate. In addition, there are other unanswered questions such as how exactly cellu

Abstract:
With the encouragement from success of P2P systems in real world application, recently we have seen active research on synergy of P2P systems and mobile ad hoc networks. The paper proposes a solution for mobility disturbance problem in initialization of ring-based P2P systems over ad hoc networks. It is a decentralized ring construction protocol in presence of mobility. A Mobile Ring Ad-hoc Networks (MRAN) protocol is presented. MRAN is an extension of RAN [1] under the mobile condition. Simulation result shows MRAN works well with mobility. Upper bound of maximum speed of moving nodes is investigated in simulation.

Abstract:
We present a mechanism for displaying the transmission property of the discrete Heisenberg ferromagnetic spin chain (DHF) via a geometric approach. By the aid of a discrete nonlinear Schr\"odinger-like equation which is the discrete gauge equivalent to the DHF, we show that the determination of transmitting coefficients in the transmission problem is always bistable. Thus a definite algorithm and general stochastic algorithms are presented. A new invariant periodic phenomenon of the non-transmitting behavior for the DHF, with a large probability, is revealed by an adoption of various stochastic algorithms.

Abstract:
By a new orthogonal direct sum decomposition $E_{M} = Y \oplus Z$, which $Z$ is related to $\Delta u_i(i=1,2,3,....,M)$, and a new functional $I(u)$, the method in [2] is improved to obtain new multiple periodic solutions with negativity hypothesis on $F$ for a second-order discrete Hamiltonian system. Moreover, we exhibit an instructive example to make our result more clear, which hasn't been solved by the known results.

Abstract:
In this paper, the large-scale MU-MIMO system is considered where a base station (BS) with extremely large number of antennas (N) serves relatively less number of users (K). In order to achieve largest sum rate, it is proven that the amount of users must be limited such that the number of antennas at the BS is preponderant over that of the antennas at all the users. In other words, the antennas at the BS should be excess. The extra antennas at the BS are no longer just an optional approach to enhance the system performance but the prerequisite to the largest sum rate. Based on this factor, for a fixed N, the optimal K that maximizes the sum rate is further obtained. Additionally, it is also pointed out that the sum rate can be substantially improved by only adding a few antennas at the BS when the system is N=KM with M denoting the antennas at each user. The derivations are under the assumption of N and M going to infinity, and being implemented on different precoders. Numerical simulations verify the tightness and accuracy of our asymptotic results even for small N and M.