THEORETICAL INVESTIGATION ON HEAT TRANSFER CHARACTERISTICS WITH ROTATING THERMAL SOURCE

By reduction to one dimensional, periodic as well as rotating pulse heat sources, investigation on heat transfer characteristics with rotating body is carried out. Similar to the fluid flow, a new set of dimensionless numbers, namely quasi-Peclet numbers Pe 1, Pe 2 and Biot number Bi composed of angular velocity ω , thermophysical parameter, and geometry size are proposed, and applied to the dimensionless equations. Simulation result shows that it plays a decisive role in the process of the heat transfer. However, more important is that the numerical simulation depicts the difference between microcosmic and macroscopic structures of the temperature distribution, and reveals the influence of the relative relation of the dimensionless criterion numbers upon heat transfer characteristics.

释《周易》之“艰”字

《周易》古经中的"艰"字汉帛书本俱作"根",艰与很、根皆从艮得声,可通用。《周易》古经中的"艰(很)"字是人的一种品质,是一种在艰难困苦面前坚韧不拔的毅力和意志。周人的"艰(很)"字品格产生于周人忧患的历史生存环境之中,并表现于生活的各个方面。

A non-monotone Phase-1 method in linear programming

To gain superior computational efficiency, it might be necessary to change the underlying philosophy of the simplex method. In this paper, we propose a Phase-1 method along this line. We relax not only the conventional condition that some function value increases monotonically, but also the condition that all feasible variables remain feasible after basis change in Phase-1. That is, taking a purely combinatorial approach to achieving feasibility. This enables us to get rid of ratio test in pivoting, reducing computational cost per iteration to a large extent. Numerical results on a group of problems are encouraging.

A novel MAC mechanism to resolve 802.11 performance anomaly

In the 802.11b networks, the guarantee of an equal long-run channel access probability causes performance anomaly in a multi-rate wireless cell. Much interest has been involved in this issue and many effective mechanisms have been proposed. The usual MAC layer solutions include the initial contention window adaptation, the maximum transfer unit size adaptation and the packet bursting. In this paper, we propose a novel approach which introduces a new parameter called the transmission prob- ability pt to the legacy protocol. By adjusting pt according to the transmission rate, the proposed scheme can solve the performance anomaly problem cleanly. Throughput analysis and performance evaluation show that our scheme achieves significant im- provement in the aggregate throughput and the fairness.

Symmetry Reduction, Exact Solutions, and Conservation Laws of （2＋1）-Dimensional Burgers Korteweg-de Vries Equation

Using the classical Lie method of infinitesimals, we first obtain the symmetry of the （2＋1）-dimensional Burgers-Korteweg-de-Vries （3D-BKdV） equation. Then we reduce the 3D-BKdV equation using the symmetry and give some exact solutions of the 3D-BKdV equation. When using the direct method, we restrict a condition and get a relationship between the new solutions and the old ones. Given a solution of the 3D-BKdV equation, we can get a new one from the relationship. The relationship between the symmetry obtained by using the classical Lie method and that obtained by using the direct method is also mentioned. At last, we give the conservation laws of the 3D-BKdV equation.

Unbiased Estimation Formula of Unit Weight Standard Deviation in Regularization Solution

Regularization method is an effective method for solving ill\|posed equation. In this paper the unbiased estimation formula of unit weight standard deviation in the regularization solution is derived and the formula is verified with numerical case of 1 000 sample data by use of the typical ill\|posed equation, i.e. the Fredholm integration equation of the first kind.

Hamiltonian Cycles in Regular 2-Connected Claw-Free Graphs

A known result by Jackson Bill is that every 2-connected k-regular graph on at most 3k vertices is Hamiltonian. In this paper,it is proved that every 2-connected k-regular claw-free graph on at most 5k(k≥10)vertices is Hamiltonian. Moreover, the bound 5k is best possible. A counterexample of a 2-connected k-regular claw-free non-Hamiltonian graph on 5k+1 vertices is given, and it is conjectured that every 3-connected k-regular claw-free graph on at most 12k-7 vertices is Hamiltonian.

Performance Improvement of DCF Supporting Multi-Rate in IEEE 802.11b Wireless LAN

This paper proposes a new channel access algorithm based on channel occupancy time （COT） fairness to guarantee fairness and improve the aggregate throughput of 802.11b multi-rate WLANs. In the algorithm, the COT is used as fairness index to analyze the fairness of WLANs instead of the channel access probability （CAP） used in the distributed coordination function （DCF）. The standard COT is given by access point （AP） and broadcasted to all wireless stations. The AP and wireless stations in the WLAN can achieve COT-based fairness by adjusting their packet length, sending the multiple back-to-back packets at one time, or giving up an opportunity to access the channel. Analysis and simulations show that our algorithm can provide COT-fairness. Compared with the CAP-based algorithm, the proposed algorithm leads to improvements in aggregate throughput of IEEE 802. lib multi-rate WLANs.

A New Wireless Packet Scheduling Algorithm Based on EDF and Its Application in Multi-bottleneck Networks

Most of current wireless packet scheduling algorithms aim at resource allocation as fairly as possible or maximizing throughput. This paper proposed a new packet scheduling algorithm that aims at satisfying delay requirement and is the improvement of earliest due first (EDF) algorithm in wired networks. The main idea is to classify the packets based on their delay bound, scheduling the most "urgent" class of user and the users that have the best channel condition with higher priority. This algorithm can easily integrate with common buffer management algorithms, when buffer management algorithm cannot accept new arrival packets, try to modify scheduling policy. Packet scheduling algorithms in multiple bottleneck wireless networks were also discussed. A new variable multi-hop factor was defined to estimate the congestion situation (including channel condition) of future hops. Multi-hop factor can be integrated into packet scheduling algorithms as assistant and supplement to improve its performance in multi-bottleneck wireless networks.

Deontology and the Decalogue of Opinion

With Perelman＇s Neo Rhetoric the ＂Rhetorical Empire＂ is built and with the contribution of Koorebyter＇s group this empire gets to its limits by including Opinion also in Natural Sciences. Concomitantly, within communication, the number and variety of opinions tend toward infinity. In this cultural context, a Deontology of Opinion is both possible and necessary. The first part establishes the theoretical frame of the issue on four axes： （1） the historical fate of Opinion; （2） the fundamental and specific Functors; （3） the relation between Certitude, Conviction, and Credence; （4） correctness, the second part presents 10 Deontological Rules of Opinion （out of the 18 possible）; and （5） it is a Code based on 10 Rules thus, a Decalogue. The Code presents each Rule, both in its positive （must） and negative （~must） form. Rules are first enunciated and then explained and illustrated. Being also a theory of Opinion, the paper can be considered a Meta-opinion. It can have four finalities： （1） one, purely theoretical, to be included among similar papers in the field; （2） a methodological one as it offers reference points for the elaboration of particular Deontological Codes; （3） a scientific one offering the background for sociologic researches of Opinion; and （4） an educational one aiming at forming correct （optimum） Opinions in various fields.

Regularized canonical correlation analysis with unlabeled data

In standard canonical correlation analysis (CCA), the data from definite datasets are used to estimate their canonical correlation. In real applications, for example in bilingual text retrieval, it may have a great portion of data that we do not know which set it belongs to. This part of data is called unlabeled data, while the rest from definite datasets is called labeled data. We propose a novel method called regularized canonical correlation analysis (RCCA), which makes use of both labeled and unlabeled samples. Specifically, we learn to approximate canonical correlation as if all data were labeled. Then, we describe a generalization of RCCA for the multi-set situation. Experiments on four real world datasets, Yeast, Cloud, Iris, and Haberman, demonstrate that, by incorporating the unlabeled data points, the accuracy of correlation coefficients can be improved by over 30%.

Exploration behaviour and behavioural flexibility in orb-web spiders： A review

Orb-web spiders and their webs constitute an ideal model system in which to study behavioural flexibility and spatial cognition in invertebrates due to the easily quantifiable nature of the orb web. A large number of studies demonstrate how spiders are able to modify the geometry of their webs in response to a range of different conditions including the ability to adapt their webs to spatial constraints. However, the mechanisms behind this impressive web-building flexibility in these cognitively limited animals remain poorly explored. One possible mechanism though may be spatial learning during the spiders＇ exploration of their immediate surroundings. This review discusses the importance of exploration behaviour, the reliance on simple behavioural rules, and the use of already laid threads as guidelines for web-building in orb-web spiders. The focus is on the spiders＇ ability to detect and adapt their webs to space limitations and other spatial disruptions. I will also review the few published studies on how spatial information is gathered during the exploration phase and discuss the possibility of the use of ＇cognitive map＇-like processes in spiders. Finally, the review provides suggestions for designing experimental studies to shed light on whether spiders gather metric information during the site exploration （cognitive map hypothesis） or rely on more simple binary information in combination with previously laid threads to build their webs （stigmergy hypothesis）.