Abstract:
In this paper, we introduce the notion of L-topological spaces based on a complete bounded integral residuated lattice and discuss some properties of interior and left (right) closure operators.

Abstract:
The size of the profit in a firm or a production system not only depends on the quantity of inputs and outputs, but also depends on the market structure that means the market is perfect competition or imperfect competition. In general, the relationship between output and inputs can be defined as the production structure, which is usually decided by production technology. Therefore, under the market economy system, the production structure regulation has to follow the market structure variation. Here we assume that production technology is a C-D function, and then to determine the effects of different market structures, which we find, they are in close contacted with both production and market structures, especially some variations of elasticities. Through out a series of deduction and equilibrium analysis, the restricted conditions of the maximum profit have been found. Therefore, the consequences show that the values of elasticities have taken an important role in profit obtained for producer, the profits in a perfect competition market hardly depends on market demand elasticity, in which production elasticity requires rather small. However, in the imperfect competition market, monopoly make both price of demand and production elasticities impact on the profit. Those also prove that market monopoly factors make production lose efficiency, or lead to the market failure. In the actual process of production and management, production elasticities and related market information should be strengthened for measurement, which will be useful for analysis price fluctuation risk and management decision.

Abstract:
This paper solves the problem of logistics node space relationship beyond expression based on computer vision technology, proposes internal layout optimization mathematical model of logistics node on the basis of overall consideration of function zone geometry shape, the optimal area utilization rate, and the minimum material handling cost, and then designs a highly mixed genetic simulated annealing algorithm based on multiagent to get layout solution. Through contrasting, the result has shown that the model and algorithms put forward in this paper can realize large-scale internal layout optimization of logistics node under the conditions of complex terrain and multiple constraints. 1. Introduction Layout problem can be widely found in city planning, transportation, architectural design, machinery manufacturing, and other fields, with a high degree of complexity. Logistics node internal layout problem can be divided into discontinuous layout and continuous layout; when the function zone number is greater than 15, it has been proved that these two kinds of logistics node layout optimization belong to NP-hard [1]. As early as 1970s, there have been some computer algorithms and programs being applied to layout planning with remarkable effect [2, 3]. But on the whole, there are still some shortcomings on the research of layout programming of logistics node, affecting its theory and application values. Layout optimization of logistics node should take various aspects and detailed technical requirements into consideration; the present research usually considers a large amount of data as follows [4]: where expresses product, expresses quantity, expresses process route, expresses service and support, and expresses time. Research on layout problem is mostly confined in the rectangular function zone, and irregular function zones could be transformed into rectangular ones through various ways. For traditional layout method, selected region is taken as a “white paper,” without taking into consideration the internal geographic barriers and trunk road on the regional segmentation and also the requirements of activity relationship between the surrounding regions and interior regions. Moreover, most of the published researches on layout problem established objective function minimizing the logistics cost as follows: while they ignored function zone’s geometry shape, area utilization rate, and other factors. In general, the in-depth research on internal layout optimization of logistics node under the conditions of complex terrain and various constraint conditions is

Abstract:
Amino acid
neurotransmitters represent a major class of compounds that are involved in
neuronal communication at CNS
synapses, which can provide the basis for a variety of disease diagnosis and
treatments and the study of the mechanism of mental illness. An analytical
method for the determination of several amino acids in saliva was established
with reversed-phase high performance liquid chromatography (RP-HPLC) with UV detector.
About ten kinds of amino acids were detected in saliva. Nine subjects have participated in the
stress experiments which have undergone a 50-min three-dimensional cartoon
watching. The result of the experiment has proved that four kinds of salivary amino
acids respond to the vision stress experiment obviously

Abstract:
In the network environment, how to protect the server's data and prev ent the harmful manipulating is a very important thing. A valid way is to restri ct the users within the operation software to prevent the direct manipulating to the server's data.

Abstract:
Spatial analysis and GIS are both useful tools for spatial information analysis. Under the supporting of computer , remote sensing and other techniques , they have been widely used in the study of social , economic and natural phenomena . The combination of them can offer users with very useful tools in dealing with spatial data. On the one hand , the combination of them can widen the spatial analysis function of GIS , obtaining more useful information from original data. On the other hand , spatial analysis can get strong support from GIS since they are both dealing with spatial data. However , the combination of these two techniques is not quite popular in soft- ware market and application fields . More efforts should be made in finding ways to solving this problem. In this paper , the autho discussed the potential of the combination of spatial analysis and GIS , as well as the way of the combination. As pointed in this paper , spatial analysis can offers GIS with strong ability , like spatial structure analysis , spatial autocorrelation analysis , kriging analysis , spatial simulation , etc. At the same time , GIS can help in determining the sampling manner and obtaining large amount of data which are. needed in theoretical study of spatial analy- sis. GIS is also quite powerful in presenting the analytical results of spatial analysis. The combination of GIS and spatial analysis can be performed in two ways : The first is adding a data exchange interface between GIS and spatial analysis software. The second way is adding the spatial analysis module into GIS software packages. Considering the current situation of software market , the combination of these two techniques should be developed step by step.

Abstract:
Under some simple conditions, by using some techniques such as truncated method for random variables (see e.g., Gut (2005)) and properties of martingale differences, we studied the moving process based on martingale differences and obtained complete convergence and complete moment convergence for this moving process. Our results extend some related ones.

Abstract:
We get the strong law of large numbers, strong growth rate, and the integrability of supremum for the partial sums of asymptotically almost negatively associated sequence. In addition, the complete convergence for weighted sums of asymptotically almost negatively associated sequences is also studied. 1. Introduction Definition 1.1. A finite collection of random variables is said to be negatively associated (NA) if, for every pair of disjoint subsets , of , whenever and are coordinate-wise nondecreasing such that this covariance exists. An infinite sequence is NA if every finite subcollection is NA. The concept of negative association was introduced by Joag-Dev and Proschan [1] and Block et al. [2]. By inspecting the proof of maximal inequality for the NA random variables in Matu？a [3], one also can allow negative correlations provided they are small. Primarily motivated by this, Chandra and Ghosal [4, 5] introduced the following dependence. Definition 1.2. A sequence of random variables is called asymptotically almost negatively associated (AANA) if there exists a nonnegative sequence as such that for all and for all coordinate-wise nondecreasing continuous functions and whenever the variances exist. The family of AANA sequence contains NA (in particular, independent) sequences (with , ) and some more sequences of random variables which are not much deviated from being negatively associated. An example of an AANA sequence which is not NA was constructed by Chandra and Ghosal [4]. Since the concept of AANA sequence was introduced by Chandra and Ghosal [4], many applications have been found. For example, Chandra and Ghosal [4] derived the Kolmogorov-type inequality and the strong law of large numbers of Marcinkiewicz-Zygmund, Chandra and Ghosal [5] obtained the almost sure convergence of weighted averages, Ko et al. [6] studied the Hájek-Rényi-type inequality, and Wang et al. [7] established the law of the iterated logarithm for product sums. Recently, Yuan and An [8] established some Rosenthal-type inequalities for maximum partial sums of AANA sequence. As applications of these inequalities, they derived some results on convergence, where , and complete convergence. In addition, they estimated the rate of convergence in Marcinkiewicz-Zygmund strong law for partial sums of identically distributed random variables. The main purpose of the paper is to study the strong law of large numbers, strong growth rate, and the integrability of supremum for AANA sequence. In addition, the complete convergence for weighted sums of AANA sequence is also studied.

Abstract:
Let be an array of rowwise asymptotically almost negatively associated random variables. Some sufficient conditions for complete convergence for arrays of rowwise asymptotically almost negatively associated random variables are presented without assumptions of identical distribution. As an application, the Marcinkiewicz-Zygmund type strong law of large numbers for weighted sums of asymptotically almost negatively associated random variables is obtained. 1. Introduction The concept of complete convergence was introduced by Hsu and Robbins [1] as follows. A sequence of random variables is said to converge completely to a constant if for all . In view of the Borel-Cantelli lemma, this implies that almost surely (a.s.). The converse is true if the are independent. Hsu and Robbins [1] proved that the sequence of arithmetic means of independent and identically distributed (i.i.d.) random variables converges completely to the expected value if the variance of the summands is finite. Since then many authors studied the complete convergence for partial sums and weighted sums of random variables. The main purpose of the present investigation is to provide the complete convergence results for weighted sums of asymptotically almost negatively associated random variables and arrays of rowwise asymptotically almost negatively associated random variables. Firstly, let us recall the definitions of negatively associated and asymptotically almost negatively associated random variables. Definition 1.1. A finite collection of random variables is said to be negatively associated (NA, in short) if for every pair of disjoint subsets of , whenever and are coordinatewise nondecreasing such that this covariance exists. An infinite sequence is NA if every finite subcollection is negatively associated. An array of random variables is called rowwise NA random variables if, for every , is a sequence of NA random variables. The concept of negative association was introduced by Joag-Dev and Proschan [2]. By inspecting the proof of maximal inequality for the NA random variables in Matula [3], one also can allow negative correlations provided they are small. Primarily motivated by this, Chandra and Ghosal [4, 5] introduced the following dependence. Definition 1.2. A sequence of random variables is called asymptotically almost negatively associated (AANA, in short) if there exists a nonnegative sequence as such that for all and for all coordinatewise nondecreasing continuous functions and whenever the variances exist. An array of random variables is called rowwise AANA random variables