Branched Coverings and Embedded Surfaces in Four-manifolds

In this paper, we get a lower bound on the genera of surfaces re, presenting certain divisible classes in some 4-manifold X with Hi（X; Z） finite.     

Multi-Valued Performance Metrics for Real-Time Embedded Systems

To rapidly explore the design space of a real-time embedded system, it is essential to be able to efficiently analyze the timing behaviors of different system architectures. This includes not only determining if a design can satisfy all the timing constraints but also comparing the timing performance of different designs for tradeoff purposes. Understanding the exact timing behavior of a large system can be computationally prohibitive. Previous work in this area has mostly focused on producing a yes/no answer to the schedulability of a system architecture under the worst-case scenario. This not only often leads to overly pessimistic designs, but also provides no insight as how to rank different architectural designs with respect to their timing performance. In this paper, we present several metrics that may be used to measure the timing performance of a design. The metrics were analyzed using workloads from both real-world task systems and randomly generated task systems. A superior metric has been identified through analysis of large sets of experiments. We also show, through an example, how this metric can be used effectively during a design exploration process.     

On critical values of numerical parameters characterizing intersections of embedded sets

To study intersections of embedded bounded closed sets in Banach space, a numerical parameter was introduced earlier; in a certain sense, this parameter describes the deviation of the shape of a set from that of a sphere. Critical values of this parameter for some classes of Banach spaces are determined, a new numerical parameter serving the same purpose is introduced, and the relation between the two parameters is examined. Translated fromMatematicheskie Zametki, Vol. 68, No. 2, pp. 303–310, August, 2000.     

CartGen: Robust,efficient and easy to implement uniform/octree/embedded boundary Cartesian grid generator

An efficient and easy to implement method to generate Cartesian grids is presented. The presented method generates various kinds of Cartesian grids such as uniform, octree and embedded boundary grids. It supports the variation of grid size along each spatial direction as well as anisotropic and non‐graded refinements. The efficiency and ease of implementation are the main benefits of the presented method in contrast to the alternative methods. Regarding octree grid generation, applying a simple and efficient data compression method permits to store all grid levels without considerable memory overhead. The presented method generates octree grids up to a 13‐level refinement (8192³ grids on the finest level) from a complicated geometry in a few minutes on the traditional desktop computers. The FORTRAN 90 implementation of the presented method is freely available under the terms of the GNU general public license. Copyright © 2007 John Wiley & Sons, Ltd.     

GI~X/M~b/1/N排队系统

本文主要研究了顾客一般独立批到达、指数批服务、缓冲器容量有限的单个服务器的排队系统，本文首先使用补充变量和嵌入马氏链的方法，在部分拒绝和全部拒绝情形下，得到系统排队队长的稳态分布，进而得到相应的性能指标，如系统的平均排队长、平均等待时间、损失概率等．其次对等待时间进行了分析．     

嵌入式脉象采集仪电路设计

该脉象采集仪采用IP核技术、SoPC技术，将脉象采集的大部分功能都集成在一片FPGA内部，并自主进行了脉象采集控制的FPGA设计。该设计采用在SoPC系统外做控制电路部分，三路脉搏信号共用一个ADC，只需要很少的外部器件就能实现。与早期采用工控机、PC机，或者现在多采用的ARM设计方法相比，该脉象采集仪具有成本低，功耗低，体积小，便于扩展，稳定性高和系统维护方便等优点。     

嵌入式系统与IP-CORE、M-CORE设计技术

介绍了一些标志性嵌入式设备与技术的特征以及IP-CORE、M-CORE嵌入技术应用设计的特点和发展动向。     

基于微处理器核的媒体系统芯片结构设计

围绕基于微处理器核的AAC解码器结构设计展开讨论，对IP定制、数据通路及存储设计进行了研究，并成功开发了一个基于微处理器核的MPEG-4AAC解码系统芯片。     

An adaptive cut‐cell method for environmental fluid mechanics

In this work we present a numerical method for solving the incompressible Navier–Stokes equations in an environmental fluid mechanics context. The method is designed for the study of environmental flows that are multiscale, incompressible, variable‐density, and within arbitrarily complex and possibly anisotropic domains. The method is new because in this context we couple the embedded‐boundary (or cut‐cell) method for complex geometry with block‐structured adaptive mesh refinement (AMR) while maintaining conservation and second‐order accuracy. The accurate simulation of variable‐density fluids necessitates special care in formulating projection methods. This variable‐density formulation is well known for incompressible flows in unit‐aspect ratio domains, without AMR, and without complex geometry, but here we carefully present a new method that addresses the intersection of these issues. The methodology is based on a second‐order‐accurate projection method with high‐order‐accurate Godunov finite‐differencing, including slope limiting and a stable differencing of the nonlinear convection terms. The finite‐volume AMR discretizations are based on two‐way flux matching at refinement boundaries to obtain a conservative method that is second‐order accurate in solution error. The control volumes are formed by the intersection of the irregular embedded boundary with Cartesian grid cells. Unlike typical discretization methods, these control volumes naturally fit within parallelizable, disjoint‐block data structures, and permit dynamic AMR coarsening and refinement as the simulation progresses. We present two‐ and three‐dimensional numerical examples to illustrate the accuracy of the method. Copyright © 2008 John Wiley & Sons, Ltd.     

Structural transformations in silver nanoparticles

A molecular dynamics simulation was performed for silver clusters of 147, 309, and 561 atoms with the initial cuboctahedral habit in the temperature range 0–1000 K with an embedded atom potential for silver. Structural transitions of the silver clusters to complex twins (icosahedral habit) with coherent (111)/(111) boundaries over all edges of icosahedra were found, which started at temperatures of 50 K, 350 K, and 700 K, respectively. To analyze the structural transformations in nanoparticles, an algorithm is proposed based on a simplicial Delaunay decomposition (Delaunay triangulation). It was found that after the transition of silver nanoparticles to complex twins, the atomic motion becomes vibrational; the atoms vibrate around the sites that correspond to the vertices of the regular polyhedra. In the case of the 147-atom silver nanoparticle, the polyhedra are arranged in the following sequence, starting from the center of mass: icosahedron (12 atoms), icosododecahedron (30 atoms), icosahedron (12 atoms), dodecahedron (20 atoms), truncated icosahedron (60 atoms, isostructural with fullerene C₆₀), icosahedron (12 atoms), and one atom at the center of mass.