IGCT 综合型电荷控制 模型的建立和仿真

以电荷控制方程而建立的IGCT综合型电荷控制模型，经关键性的关断电流和关断电压进行了仿真分析，所得结果与实际结果吻合。因此该模型是有效的，可用于IGCT的开关特性分析和集成门极电路设计。     

Mechanisms of resistance in a human cell line exposed to sequential topoisomerase poisoning

Camptothecins are a new class of anticancer drugs that target DNA topoisomerase I; current efforts are directed toward elucidating optimal combinations of these drugs with other antineoplastic agents. A rationale for the use of sequential therapy involving the combination of camptothecins with topoisomerase II-targeting drugs, such as etoposide, has arisen from observations of increased topoisomerase II protein levels in cell lines resistant to camptothecin. In an effort to understand potential mechanisms of resistance to this strategy, we developed a U-937 cell subline, denoted RERC, that is capable of surviving exposure to sequential topoisomerase poisoning. The RERC cells are 200-fold resistant to camptothecin, 8-fold resistant to etoposide, and 10-fold hypersensitive to cisplatin compared to the parental U-937 cells. Biochemical analyses indicate that the resistant phenotype involves alterations in both topoisomerase I and topoisomerase IIalpha. Topoisomerase I catalytic activity in the resistant cells is similar to that of the parental line but is resistant to camptothecin. Moreover, the resistant cells express a single mRNA species of topoisomerase I that codes for a mutation in codon 533. In addition, topoisomerase IIalpha protein levels are decreased 10-fold in the resistant line, coincident with a two-fold decrease in the expression of topoisomerase IIalpha mRNA. Collectively, these results indicate that resistance to sequential topoisomerase poisoning may involve a reduction in total cellular topoisomerase activity.     

海南省水资源配置决策的层次分析模型研究

海南省特殊的地理位置决定了其水资源配置问题的独特性,在水资源配置方案中,呈现出多阶段、多层次、多目标、多决策主体的特点,使得水资源配置模型难以确定并给决策带来了很大的风险性。本文研究了适合于海南省水资源优化配置所需的评比指标,对层次分析法加以改进,结合海南省水资源配置问题的决策要求,用改进后的层次分析法进行评价指标优化计算,最终得出了较为满意的结果。     

Retrospective adaptive prefetching for interactive Web GIS applications

A major task of a Web GIS (Geographic Information Systems) system is to transfer map data to client applications over the Internet, which may be too costly. To improve this inefficient process, various solutions are available. Caching the responses of the requests on the client side is the most commonly implemented solution. However, this method may not be adequate by itself. Besides caching the responses, predicting the next possible requests from a client and updating the cache with responses for those requests together provide a remarkable performance improvement. This procedure is called “prefetching” and makes caching mechanisms more effective and efficient. This paper proposes an efficient prefetching algorithm called Retrospective Adaptive Prefetch (RAP), which is constructed over a heuristic method that considers the former actions of a given user. The algorithm reduces the user-perceived response time and improves user navigation efficiency. Additionally, it adjusts the cache size automatically, based on the memory size of the client’s machine. RAP is compared with four other prefetching algorithms. The experiments show that RAP provides better performance enhancements than the other methods.     

Maximization of total surface area of Pt-SnO<Subscript>2</Subscript>/Al<Subscript>2</Subscript>O<Subscript>3</Subscript> catalyst by the Taguchi method

The maximization of the total surface area of Pt-SnO₂/Al₂O₃ catalyst was studied by using the Taguchi method of experimental design. The catalysts were prepared by sol-gel method. The effects of HNO₃, H₂O and aluminum nitrate concentrations and the stirring rate on the total surface area were studied at three levels of each. L₉ orthogonal array leading nine experiments was used in the experimental design. The parameter levels that give maximum total surface area were determined and experimentally verified. In the range of conditions studied it was found that, medium levels of HNO₃ and H₂O concentration and lower levels of aluminum nitrate concentration and stirring rate maximize the total surface area.     

HamleDT: Harmonized multi-language dependency treebank

We present HamleDT—a HArmonized Multi-LanguagE Dependency Treebank. HamleDT is a compilation of existing dependency treebanks (or dependency conversions of other treebanks), transformed so that they all conform to the same annotation style. In the present article, we provide a thorough investigation and discussion of a number of phenomena that are comparable across languages, though their annotation in treebanks often differs. We claim that transformation procedures can be designed to automatically identify most such phenomena and convert them to a unified annotation style. This unification is beneficial both to comparative corpus linguistics and to machine learning of syntactic parsing.     

One-Way Functions Using Algorithmic and Classical Information Theories

We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by?E(K ^t (x|f(x))). These results are in both directions. More precisely, conditions on?E(K ^t (x|f(x))) that imply that?f is a weak one-way function, and properties of?E(K ^t (x|f(x))) that are implied by the fact that?f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function?f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate?E(K ^t (x|f(x))) and two forms of time-bounded entropy, the unpredictable entropy?H ^unp, in which ??one-wayness?? of a function can be easily expressed, and the Yao⁺ entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.     

A general topology-based framework for adaptive insertion of cohesive elements in finite element meshes

Large-scale simulation of separation phenomena in solids such as fracture, branching, and fragmentation requires a scalable data structure representation of the evolving model. Modeling of such phenomena can be successfully accomplished by means of cohesive models of fracture, which are versatile and effective tools for computational analysis. A common approach to insert cohesive elements in finite element meshes consists of adding discrete special interfaces (cohesive elements) between bulk elements. The insertion of cohesive elements along bulk element interfaces for fragmentation simulation imposes changes in the topology of the mesh. This paper presents a unified topology-based framework for supporting adaptive fragmentation simulations, being able to handle two- and three-dimensional models, with finite elements of any order. We represent the finite element model using a compact and “complete” topological data structure, which is capable of retrieving all adjacency relationships needed for the simulation. Moreover, we introduce a new topology-based algorithm that systematically classifies fractured facets (i.e., facets along which fracture has occurred). The algorithm follows a set of procedures that consistently perform all the topological changes needed to update the model. The proposed topology-based framework is general and ensures that the model representation remains always valid during fragmentation, even when very complex crack patterns are involved. The framework correctness and efficiency are illustrated by arbitrary insertion of cohesive elements in various finite element meshes of self-similar geometries, including both two- and three-dimensional models. These computational tests clearly show linear scaling in time, which is a key feature of the present data-structure representation. The effectiveness of the proposed approach is also demonstrated by dynamic fracture analysis through finite element simulations of actual engineering problems.

A Multiagent Platform for Ubiquitous Service Provision

The Virtual Home Environment is very important in contemporary mobile telecommunications infrastructure as it caters for the ubiquitous provision of services irrespective of network, location and user device. The universality of systems like Universal Mobile Telecommunications System and wi-fi increases the need for the rapid introduction of efficient VHE schemes. In this paper, we study the adoption of Mobile Agents for handling the VHE functionality. Mobile agents are nicely harmonized with the broader idea of VHE as they allow the autonomous execution of tasks by components that roam from node to node and network to network. We present the detailed modeling of a VHE provisioning architecture and investigate its suitability for different use cases and technical options (e.g., end user devices). The adoption of mobile agents for the ubiquitous provision of telecommunication services is quite promising in terms of efficiency. Through a series of experiments we quantify the performance benefits stemming from the adoption of mobile agents in contrast to conventional service provisioning schemes.