ATM网络的视频编码

该文研究了ＡＴＭ网络环境下的视频压缩编码技术。给出了ＡＴＭ网络的视频压缩编码方案,它是以基于小波变换的分层编码和基于遗传算法的矢量量化技术为基础,其中主要讨论了视频的运动估计、优先级的分配和信元的构成、丢失信元的补偿和比特率的平滑及缓冲技术。     

智能ERP系统决策支持子系统设计

提出了智能ERP系统决策支持系统设计方案。叙述了决策支持系统的两个层次的技术手段及五个方面的决策支持信息以及三个关键技术路径。     

An efficient non-dominated sorting method for evolutionary algorithms

We present a new non-dominated sorting algorithm to generate the non-dominated fronts in multi-objective optimization with evolutionary algorithms, particularly the NSGA-II. The non-dominated sorting algorithm used by NSGA-II has a time complexity of O(MN(2)) in generating non-dominated fronts in one generation (iteration) for a population size N and M objective functions. Since generating non-dominated fronts takes the majority of total computational time (excluding the cost of fitness evaluations) of NSGA-II, making this algorithm faster will significantly improve the overall efficiency of NSGA-II and other genetic algorithms using non-dominated sorting. The new non-dominated sorting algorithm proposed in this study reduces the number of redundant comparisons existing in the algorithm of NSGA-II by recording the dominance information among solutions from their first comparisons. By utilizing a new data structure called the dominance tree and the divide-and-conquer mechanism, the new algorithm is faster than NSGA-II for different numbers of objective functions. Although the number of solution comparisons by the proposed algorithm is close to that of NSGA-II when the number of objectives becomes large, the total computational time shows that the proposed algorithm still has better efficiency because of the adoption of the dominance tree structure and the divide-and-conquer mechanism.     

Balloon focus: a seamless multi-focus+context method for treemaps

The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a greater level of detail becomes very challenging. In this paper, we present a seamless multi-focus and context technique, called Balloon Focus, that allows the user to smoothly enlarge multiple treemap items served as the foci, while maintaining a stable treemap layout as the context. Our method has several desirable features. First, this method is quite general and hence can be used with different treemap layout algorithms. Second, as the foci are enlarged, the relative positions among all items are preserved. Third, the foci are placed in a way that the remaining space is evenly distributed back to the non-focus treemap items. When Balloon Focus maximizes the possible zoom factor for the focus items, these features ensure that the treemap will maintain a consistent appearance and avoid any abrupt layout changes. In our algorithm, a DAG (Directed Acyclic Graph) is used to maintain the positional constraints, and an elastic model is employed to govern the placement of the treemap items. We demonstrate a treemap visualization system that integrates data query, manual focus selection, and our novel multi-focus+context technique, Balloon Focus, together. A user study was conducted. Results show that with Balloon Focus, users can better perform the tasks of comparing the values and the distribution of the foci.     

HP VEE与自动测试技术

本文结合现代测试自动化的要求,重点讨论了HP VEE及其进行自动测试的软硬件关键技术,并在此基础上给出了基于HP VEE自动测试的实例。     

Mode I equivalent state of crack-like defects in multiaxial stress fields

The novel concept of equivalent state randomly oriented flaws developed from the generalized fracture toughness theory [1] is presented. Based on this concept, planar defects located in multiaxial stress field regions, characterized by modes I, II, and III stress intensity factor combinations, are distinguished by a mode I equivalent state stress intensity factor % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGak0dh9WrFfpC0xh9vqqj-hEeeu0xXdbba9frFj0-OqFf% ea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs0dXdbPYxe9vr0-vr% 0-vqpWqaaeaabiGaaiaacaqabeaadaqaaqaaaOqaaiqadUeagaqeaa% aa!3846!\[\bar K\]₁ of identical function. Accordingly, the complex mode fracture criterion is exactly replaced by the conventional mode I criterion % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGak0dh9WrFfpC0xh9vqqj-hEeeu0xXdbba9frFj0-OqFf% ea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs0dXdbPYxe9vr0-vr% 0-vqpWqaaeaabiGaaiaacaqabeaadaqaaqaaaOqaaiqadUeagaqeaa% aa!3846!\[\bar K\]₁ K _1C . It is demonstrated that this criterion is mathematically equivalent to other more complex generalized fracture criteria [2,4,5], i.e., it predicts the same critical conditions.Current approximate procedures applied to crack-like defects detected in structural components, based on reorienting or orthogonally projecting the defect over a plane normal to the maximum principal tensile stress, are discussed and applied to two simple structural applications. When the results are compared with those from the proposed equivalent state flaw method, it is concluded that, to a large extent, the procedures are inconsistent and generate significant errors that may lead to incorrect decisions over the remaining service life of the structure.The equivalent state flaw concept is used to establish the equivalent state mode I threshold value % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGak0dh9WrFfpC0xh9vqqj-hEeeu0xXdbba9frFj0-OqFf% ea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs0dXdbPYxe9vr0-vr% 0-vqpWqaaeaabiGaaiaacaqabeaadaqaaqaaaOqaaiqadUeagaqeaa% aa!3846!\[\bar K\]₁ corresponding to complex stress state fatigue loadings.

---

Résumé On présente le concept original de défauts équivalents répartis au hasard, développé à partir de la théorie généralisée sur la ténacité à la rupture [Réf. 1]. Sur base de ce concept, des défauts plans situés dans des zones à champs de contrainte multi-axiale, et caractérisés par des facteurs d'intensité de contrainte combinant les modes I, II et III, sont caractérisés par un facteur d'intensité de contrainte équivalent % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGak0dh9WrFfpC0xh9vqqj-hEeeu0xXdbba9frFj0-OqFf% ea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs0dXdbPYxe9vr0-vr% 0-vqpWqaaeaabiGaaiaacaqabeaadaqaaqaaaOqaaiqadUeagaqeaa% aa!3846!\[\bar K\]₁; relatif à un mode I et occupant la même fonction. Dès lors, le critère décrivant la rupture sous un mode complexe est en tous points remplacé par le critère conventionnel % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGak0dh9WrFfpC0xh9vqqj-hEeeu0xXdbba9frFj0-OqFf% ea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs0dXdbPYxe9vr0-vr% 0-vqpWqaaeaabiGaaiaacaqabeaadaqaaqaaaOqaaiqadUeagaqeaa% aa!3846!\[\bar K\]₁ K _1C .Ce critère est mathématiquement equivalent aux autres critères généralisés de rupture, de forme plus complexe [Réf. 2, 4, 5], en ce qu'il prédit les mêmes conditions critiques.On discute, et on applique à deux cas de structures simples, les procédures habituelles d'approximation pour des défauts assimilables à des fissures détectés dans des composants. Ces défauts sont réorientés ou projetés orthogonalement sur un plan normal à la plus grande tension principale.Lorsqu'on compare les résultats de ces procédures d'approximation à ceux que fournit la méthode proposée, on en conclut que ces procédures sont, dans une large mesure, incorrectes, et qu'elles donnent lieu à des erreurs importantes susceptibles de conduire à des décisions erronées sur la vie résiduelle d'une structure.Le concept de défaut équivalent est utilisé pour établir une valeur critique équivalente % MathType!MTEF!2!1!+-% feaafiart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGak0dh9WrFfpC0xh9vqqj-hEeeu0xXdbba9frFj0-OqFf% ea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs0dXdbPYxe9vr0-vr% 0-vqpWqaaeaabiGaaiaacaqabeaadaqaaqaaaOqaaiqadUeagaqeaa% aa!3846!\[\bar K\]₁ en mode I, correspondant à le seuil des sollicitations de fatigue de mode complexe.

---

---

Operated for the U.S. Department of Energy, Contract No. DE-AC12-76-N0052.     

Histology, histochemistry and stereology of the adipose fin of Prochilodus lineatus

The adipose fin is small, nonpared, and usually located medially between the dorsal and caudal fin. Its taxonomic occurrence is very restrict; thus, it represents an important trace for taxon distinction. As it does not play a known vital physiological roll and it is easily removed, it is commonly used in marking and recapture studies. The present study characterizes the adipose fin of Prochilodus lineatus, as it is poorly explored by the literature. The adipose fin consists basically of a loose connective core, covered by a stratified epithelium supported by collagen fibers. At the epithelium, pigmented cells and alarm substance cells are found. Despite the name, adipocytes or lipid droplets are not observed on the structure of the fin.     

基于OWPB和LS-SVM的电路板故障诊断系统

针对雷达电路板检修困难的问题,提出了基于最优小波包基和最小二乘支持向量机相结合的雷达电路板故障诊断方法。利用小波变换对采样数据进行去噪处理,通过小波包分解选择最优小波包基提取熵值作为故障特征向量,并作为基于最小二乘支持向量机的雷达故障诊断模型的输入向量,经诊断模型输出后,完成雷达电路板故障诊断。基于此方法设计了雷达电路板故障诊断系统,提高了雷达故障诊断的正确性和效率。     

Flocking based distributed self-deployment algorithms in mobile sensor networks

In this paper, we address a novel deployment problem in isotropic mobile sensor networks. Sensors are to be relocated uniformly in a region of interest (ROI) centered at a target of interest (TOI) which could be stationary or mobile. With the assumption that relative direction of a sensor to the TOI can be recognized or inferred by devices equipped in the sensor, distributed control algorithms based on first-order and second-order dynamic models are proposed for both stationary and mobile TOI situations. The Lyapunov stabilities and coverage guarantee are provided. To further improve the deployment such as coverage holes inside the network and uniformity of the deployment, four assisted rules are also proposed. Then algorithms proposed for the situation of a stationary TOI are extended to anisotropic sensor networks. Simulations demonstrate the effective performances of the proposed algorithms.     

Bridging logic and kernel machines

We propose a general framework to incorporate first-order logic (FOL) clauses, that are thought of as an abstract and partial representation of the environment, into kernel machines that learn within a semi-supervised scheme. We rely on a multi-task learning scheme where each task is associated with a unary predicate defined on the feature space, while higher level abstract representations consist of FOL clauses made of those predicates. We re-use the kernel machine mathematical apparatus to solve the problem as primal optimization of a function composed of the loss on the supervised examples, the regularization term, and a penalty term deriving from forcing real-valued constraints deriving from the predicates. Unlike for classic kernel machines, however, depending on the logic clauses, the overall function to be optimized is not convex anymore. An important contribution is to show that while tackling the optimization by classic numerical schemes is likely to be hopeless, a stage-based learning scheme, in which we start learning the supervised examples until convergence is reached, and then continue by forcing the logic clauses is a viable direction to attack the problem. Some promising experimental results are given on artificial learning tasks and on the automatic tagging of bibtex entries to emphasize the comparison with plain kernel machines.