A shrinking technique for complex object decomposition

A shrinking technique is described for the segmentation of a 2D complex object, represented by a binary array, into compact subobjects. A novel feature of the technique is that it uses the distance values on the skeleton of the object to estimate the number of shrinking steps needed in order to decompose the object.     

ACASH: an adaptive web caching method based on the heterogeneity of web object and reference characteristics

The use of cache to store and process web objects has increased, and studies on effective web caching have been actively conducted. A processing unit of web caching contains web objects, and changes in the heterogeneity of these web objects and their reference characteristics become a major factor of decreased performance in the existing method. This study proposes ACASH, a new web caching method. ACASH manages a cache scope by dividing it based on the heterogeneity of web objects. Also, it adaptively reflects changes in the reference characteristics of the object according to the time elapsed. In addition, it is shown in an experimental model, which captures the heterogeneity of the object that the proposed method performs better than the existing method.     

Grid VFS中代理管理客户端磁盘缓存的设计与实现

设计并实现了在网格虚拟文件系统Grid VFS客户端采用代理管理磁盘缓存来隐藏网络延迟，提高网格数据利用率。此方法扩展了虚拟化分布式文件系统，提高了对网格资源有效完整的数据访问。在Grid VFS中，客户端代理动态地产生和管理磁盘缓存，每一个未修改的应用程序和OS都能应用，支持write-back策略、文件系统之间缓存的共享以及磁盘缓存的多级化，通过用户级VFS可以完整的集成到网格应用程序和资源中，从而提高了网格数据的访问性能。     

Design and implementation of an efficient web cluster with content-based request distribution and file caching

We have implemented an efficient and scalable web cluster named LVS-CAD/FC (i.e. LVS with Content-Aware Dispatching and File Caching). In LVS-CAD/FC, a kernel-level one-way content-aware web switch based on TCP Rebuilding is implemented to examine and distribute the HTTP requests from clients to web servers, and the fast Multiple TCP Rebuilding is implemented to efficiently support persistent connection. Besides, a file-based web cache stores a small set of the most frequently accessed web files in server RAM to reduce disk I/Os and a light-weight redirect method is developed to efficiently redirect requests to this cache. In this paper, we have further proposed new policies related to content-based workload-aware request distribution, in which the web switch considers the content of requests and workload characterization in request dispatching. In particular, web files with more access frequencies would be duplicated in more servers’ file-based caches, such that hot web files can be served by more servers. Our goals are to improve cluster performance by obtaining better memory utilization and increasing the cache hit rates while achieving load balancing among servers. Experimental results of practical implementation on Linux show that LVS-CAD/FC is efficient and scales well. Besides, LVS-CAD/FC with the proposed policies can achieve 66.89% better performance than the Linux Virtual Server with a content-blind web switch.     

SHORT: Segmented histogram technique for robust real-time object recognition

Multimedia Tools and Applications - Object recognition is a broad area that covers several topics including face recognition, gesture recognition, human gait recognition, traffic road signs...     

适用于C语言的对象模型的研究与实现

为了解决在低端嵌入式设备中用C语言编写的代码难以维护以及重用率低等问题,提出了一种新的对象模型.将面向对象的思想与C语言开发相结合,利用现代C编译器的宏等特性以及元编程技巧,对C语言本身进行扩展,模拟了面向对象思想中单根继承,多态等特性,并在风格上和C++保持一致.在提升了其代码的可维护和可重用性的同时,简化了使用支持面向对象特性编程语言编写的代码向C语言移植的过程.     

An alternative implementation of an insertion-only recovery technique

Summary In an earlier paper [7] Fischer, Milton and Quiring developed algorithms for insertion-only error recovery. In related work [3] a simple factorisation lemma for error repairs was developed; by applying this lemma to the work of Fischer, Milton and Quiring their implementation is simplified and storage requirements reduced though there may be a small penalty in the execution time of the algorithm. In addition some flaws in their theoretical analyses are corrected and an alternative to the immediate error detection property is proposed.Currently on leave at Laboratory for Programming Methodology, Department of Computer Science, University of Göteborg — Chalmers University of Technology, S-412 96 Göteborg, SwedenNow at Department of Computer Science, University of Essex, Colchester CO4 3SQ, England     

ViewFinder: an object browser

ViewFinder is a graphical tool for browsing in databases that provides a flexible, yet intuitive environment for exploratory searches. The design approach has been to provide maximum functionality and generality without sacrificing simplicity. The constructs of ViewFinder’s external model are essentially object-oriented: class and token objects, membership relationships between tokens and classes, generalization relationships between classes, inheritance, and so on. This external model is based on an internal model which resembles a semantic network. Such a network may be extracted from a variety of data models, including object-oriented, entity-relationship and extended relational models. This architecture gives ViewFinder a large degree of model independence. The main construct of the external model are displays of objects (either classes or tokens), called views. Commands are available for efficient traversal of the database, displaying views of any class or token. To speed up repetitive searches, views may be synchronized: the user sets up several views, linked in a tree-like structure, so that when the information displayed in the root view is modified (e.g. scrolled by the user), the contents of the other views change automatically. Additional commands are available to search, order, aggregate and select the information displayed in a view, thus providing a simple query facility.     

A multiview facial analysis technique for identity authentication

Biometric systems, which use people's physiological characteristics for identification or authentication, have become increasingly popular for countering fraud In this article, we describe a face recognition system that uses a new distance measure for authentication. It performs matching on a fusion of multiple views of each person.     

Fast buffering for FPGA implementation of vision-based object recognition systems

Real-time frame rate is an important factor for practical deployment of computer vision systems. Field programmable gate array (FPGA) technology has been considered for many applications due to its parallel computing capability. FPGA implementations of computer vision algorithms normally involve buffering data on external memory devices, which could slow down the whole system. This paper proposes a buffering scheme suitable for implementing real-time vision-based systems on an FPGA that does not require external memory to buffer data. A stop sign detection system implemented on an FPGA employing the proposed buffering scheme is presented as an example system. This system is capable of processing over 200?fps at the frame size of 480?×?752 pixels.     

An inference structure for process feedback: technique and implementation

This paper presents an automatic technique for making simple inferences about the stages in a software production process, discusses implementation of the technique, and validates the technique using defect data from several software development projects. The technique represents an approach to automate process feedback that may be based on either experience and common sense or historical data. Specifically, we present

1. A software defect classification scheme that relates defects to process stages. As an example of such a scheme, we describe ‘orthogonal defect classification’, which associates types of defects with stages, such as high-level design, low-level design, code, and system test. These associations are summarized in a ‘principal association’ table, which serves as a model for the production process.
2. Rules that provide simple in-process feedback about a process stage based on the defects associated with that stage. We discuss how inferences can be made, with and without historical information for the process, and illustrate application of the inference technique to the software production process.
3. An implementation of the rules using a statistical programming language.

Finally, we consider the technique in the software production context as a particular case of a general technique that makes use of both human judgment and historical data, and discuss extensions.     

SPACE: A lightweight collaborative caching for clusters

In this paper, we introduce Systematic P2P Aided Cache Enhancement or SPACE, a new collaboration scheme among clients in a computer cluster of a high performance computing facility to share their caches with each other. The collaboration is achieved in a distributed manner, and is designed based on peer-to-peer computing model. The objective is to provide (1) a decentralized solution, and (2) a near optimal performance with reasonably low overhead. Simulation results are given to demonstrate the performance of the proposed scheme. In addition, the results show that SPACE evenly distributes work loads among participators, and entirely eliminates any requirement of a central cache manager.     

A new implementation technique for applicative languages

It is shown how by using results from combinatory logic an applicative language, such as LISP, can be translated into a form from which all bound variables have been removed. A machine is described which can efficiently execute the resulting code. This implementation is compared with a conventional interpreter and found to have a number of advantages. Of these the most important is that programs which exploit higher order functions to achieve great compactness of expression are executed much more efficiently.     

Tactile array sensor for object identification using complex moments

This article explores object identification by complex moment features obtained using a tactile array sensor. Some complex moment invariants have been derived and implemented eliminating the effects of lateral displacement and rotation from the tactile images. The generation of a decision tree and use of the complex moment features, allow easy identification of object shapes from the tactile array sensor.     

Organization of the infosphere for a large-scale research-and-production complex as an object of the information industry

This paper presents a model of an infosphere that is designed for the military–industrial complex as a large-scale research-and-production complex using the system method. The tasks of development and modernization of the infosphere in the military–industrial sector are formulated. A draft concept of a modernized infosphere that is designed for the military–industrial complex is presented.     

Design and implementation of a framework for building distributed smart object systems

A smart object system encompasses the synergy between computationally augmented everyday objects and external applications. This paper presents a software framework for building smart object systems following a declarative programming approach centered around custom written documents that glue the smart objects together. More specifically, in the proposed framework, applications’ requirements and smart objects’ services are objectified through structured documents. A runtime infrastructure provides the spontaneous federation between smart objects and applications through structural type matching of these documents. There are three primary advantages of our approach: firstly, it allows developers to write applications in a generic way without prior knowledge of the smart objects that could be used by the applications. Secondly, smart object management (locating, accessing, etc.) issues are completely handled by the infrastructure; thus application development becomes rapid and simple. Finally, the programming abstraction used in the framework allows extension of functionalities of smart objects and applications very easily. We describe an implemented prototype of our framework and show examples of its use in a real life scenario to illustrate its feasibility.     

一种内存管理技术的研究与实现

内存管理在计算机系统设计中是及其重要且必须的部分.高效的内存分配,垃圾回收和整理,在并行,分布式和实时应用中变的越来越重要.提出了一种利用二叉树来管理可利用内存分区的算法,并通过试验得出的数据分析,表明为什么该方法比其它算法更为方便高效,实现起来也比较简单易行.     

Application of optimization heuristics for complex astronomical object model identification

Detection and localization of astronomical objects are two of the most fundamental topics in astronomical science where localization uses detection results. Object localization is based on modeling of point spread function and estimation of its parameters. Commonly used models as Gauss or Moffat in objects localization provide good approximation of analyzed objects but cannot be sufficient in the case of exact applications such as object energy estimation. Thus the use of sophisticated models is upon the place. One of the key roles plays also the way of the objective function estimation. The least square method is often used, but it expects data with normal distribution, thus there is a question of a maximum likelihood method application. Another important factor of presented problem is choice of the right optimization method. Classical methods for objective function minimization usually require a good initial estimate for all parameters and differentiation of the objective function with respect to model parameters. The results indicated that stochastic methods such as simulated annealing or harmony search achieved better results than the classical optimization methods.