Rigidity and flexibility of virtual polytopes

All 3-dimensional convex polytopes are known to be rigid. Still their Minkowski differences (virtual polytopes) can be flexible with any finite freedom degree. We derive some sufficient rigidity conditions for virtual polytopes and present some examples of flexible ones. For example, Bricard's first and second flexible octahedra can be supplied by the structure of a virtual polytope.     

Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates

We provide an approximate analysis of the transient sojourn time for a processor sharing queue with time varying arrival and service rates, where the load can vary over time, including periods of overload. Using the same asymptotic technique as uniform acceleration as demonstrated in [12] and [13], we obtain fluid and diffusion limits for the sojourn time of the M_t/M_t/1 processor-sharing queue. Our analysis is enabled by the introduction of a “virtual customer” which differs from the notion of a “tagged customer” in that the former has no effect on the processing time of the other customers in the system. Our analysis generalizes to non-exponential service and interarrival times, when the fluid and diffusion limits for the queueing process are known.     

使用BXP无盘网络改造计算机实验室

计算机实验室一般采用带有保护卡的有盘系统,该模式下,计算机故障率高且可维护性差。该文以BXP技术为对象,介绍在无盘网络模式下,计算机实验室彻底克服了有盘系统的缺点。     

Packing two disks into a polygonal environment

We consider the following problem. Given a polygon P, possibly with holes, and having n vertices, compute a pair of equal radius disks that do not intersect each other, are contained in P, and whose radius is maximized. Our main result is a simple randomized algorithm whose expected running time, on any input, is O(nlogn). This is optimal in the algebraic decision tree model of computation.     

Division and <Emphasis Type="Italic">k</Emphasis>-th root theorems for <Emphasis Type="Italic">Q</Emphasis>-manifolds

We prove that a locally compact ANR-space X is a Q-manifold if and only if it has the Disjoint Disk Property (DDP), all points of X are homological Z _∞-points and X has the countable-dimensional approximation property (cd-AP), which means that each map f: K → X of a compact polyhedron can be approximated by a map with the countable-dimensional image. As an application we prove that a space X with DDP and cd-AP is a Q-manifold if some finite power of X is a Q-manifold. If some finite power of a space X with cd-AP is a Q-manifold, then X ² and X × [0, 1] are Q-manifolds as well. We construct a countable family χ of spaces with DDP and cd-AP such that no space X ∈ χ is homeomorphic to the Hilbert cube Q whereas the product X × Y of any different spaces X, Y ∈ χ is homeomorphic to Q. We also show that no uncountable family χ with such properties exists. This work was supported by the Slovenian-Ukrainian (Grant No. SLO-UKR 04-06/07)     

On hyperbolic virtual polytopes and hyperbolic fans

Hyperbolic virtual polytopes arose originally as polytopal versions of counterexamples to the following A.D.Alexandrov’s uniqueness conjecture: Let K ⊂ ℝ³ be a smooth convex body. If for a constant C, at every point of ∂K, we have R ₁ ≤ C ≤ R ₂ then K is a ball. (R ₁ and R ₂ stand for the principal curvature radii of ∂K.) This paper gives a new (in comparison with the previous construction by Y.Martinez-Maure and by G.Panina) series of counterexamples to the conjecture. In particular, a hyperbolic virtual polytope (and therefore, a hyperbolic hérisson) with odd an number of horns is constructed. Moreover, various properties of hyperbolic virtual polytopes and their fans are discussed.     

中国服装业虚拟经营模式分析

介绍20世纪90年代以来中国服装业经营模式的发展变化，分析我国服装业虚拟经营的现状和利弊，并对如何有效地发展这种模式提出一些看法和建议。     

Geometric separation and exact solutions for the parameterized independent set problem on disk graphs

We consider the parameterized problem, whether for a given set  of n disks (of bounded radius ratio) in the Euclidean plane there exists a set of k non-intersecting disks. For this problem, we expose an algorithm running in time that is—to our knowledge—the first algorithm with running time bounded by an exponential with a sublinear exponent. For λ-precision disk graphs of bounded radius ratio, we show that the problem is fixed parameter tractable with a running time  . The results are based on problem kernelization and a new “geometric ( -separator) theorem” which holds for all disk graphs of bounded radius ratio. The presented algorithm then performs, in a first step, a “geometric problem kernelization” and, in a second step, uses divide-and-conquer based on our new “geometric separator theorem.”     

硬盘的几种常见故障及解决方法

阐述了硬盘的几种常见故障和解决方法，包括简单的数据恢复方法。     

生物质裂解产物的制备及HPLC检测其成分的虚拟仿真实验开发

In order to improve university laboratory teaching and practical education under the background of information technology, as well as overcome the difficulty for practical training, develop a virtual simulation experiment platform for rapid pyrolysis of natal materials and high-performance liquid chromatographic (HPLC) detection of its components. The experiment integrates the actual operation process of the plant to produce cleaved products by rapid pyrolysis of biomass with HPLC detection. The virtual experiment is divided into biomass sample pretreatment, rapid biomass pyrolysis, bio-oil extraction, and HPLC determination of complex components, making the biomass cleavage workshop "real" through simulation. This virtual simulation experiment fully integrates the utilization of biomass resources and basic chemistry courses (such as organic chemistry, instrumental analysis, chemical engineering principles, etc.), which are widely involved in agricultural and forestry majors with advantageous characteristics value.