BCL—3：Aigh Performance Basic Communication Protocol for Commodity Superserver DAWNING—3000

This paper introduces the design and implemetation of BCL-3,a high performance low-level communication software running on a cluster of SMPs(CLUMPS) called DAWNING-3000,BCL-3 provides flexible and sufficient functionality to fulfill the communication requirements of fundamental system software developed for DAWNING-3000 while guaranteeing security,scalability,and reliability,Important features of BCL-3 are presented in the paper,including special support for SMP and heterogeneous network environment,semiuser-level communication,reliable and ordered data transfer and scalable flow control,The performance evaluation of BCL-3 over Myrinet is also given.     

Improving retrieval performance by region constraints and relevance feedback

In this paper, region features and relevance feedback are used to improve the performance of CBIR. Unlike existing region-based approaches where either individual regions are used or only simple spatial layout is modeled, the proposed approach simultaneously models both region properties and their spatial relationships in a probabilistic framework. Furthermore, the retrieval performance is improved by an adaptive filter based relevance feedback. To illustrate the performance of the proposed approach, extensive experiments have been carried out on a large heterogeneous image collection with 17,000 images, which render promising results on a wide variety of queries.     

Blending parametric patches with subdivision surfaces

In this paper the problem of blending parametric surfaces using subdivision patches is discussed.A new approach,named removing-boundary,is presented to generate piecewise-smooth subdivision surfaces through discarding the outmost quadrilaterals of the open meshes derived by each subdivision step.Then the approach is employed both to blend parametric bicubic B-spline surfaces and to fill n-sided holes.It is easy to produce piecewise-smooth subdivision surfaces with both convex and concave corners on the boundary,and limit surfaces are guaranteed to be C^2 continuous on the boundaries except for a few singular points by the removing-boundary approach Thus the blending method is very efficient and the blending surface generated is of good effect.     

Efficient mining of association rules by reducing the number of passes over the database

This paper introduces a new algorithm of mining association rules.The algorithm RP counts the itemsets with different sizes in the same pass of scanning over the database by dividing the database into m partitions.The total number of pa sses over the database is only(k 2m-2)/m,where k is the longest size in the itemsets.It is much less than k .     

An Efficient VLSI Architecture for Motion Compensation of AVS HDTV Decoder

In the part 2 of advanced Audio Video coding Standard （AVS-P2）, many efficient coding tools are adopted in motion compensation, such as new motion vector prediction, symmetric matching, quarter precision interpolation, etc. However, these new features enormously increase the computational complexity and the memory bandwidth requirement, which make motion compensation a difficult component in the implementation of the AVS HDTV decoder. This paper proposes an efficient motion compensation architecture for AVS-P2 video standard up to the Level 6.2 of the Jizhun Profile. It has a macroblock-level pipelined structure which consists of MV predictor unit, reference fetch unit and pixel interpolation unit. The proposed architecture exploits the parallelism in the AVS motion compensation algorithm to accelerate the speed of operations and uses the dedicated design to optimize the memory access. And it has been integrated in a prototype chip which is fabricated with TSMC 0.18-#m CMOS technology, and the experimental results show that this architecture can achieve the real time AVS-P2 decoding for the HDTV 1080i （1920 - 1088 4 ： 2 ： 0 60field/s） video. The efficient design can work at the frequency of 148.5MHz and the total gate count is about 225K.     

Test Resource Partitioning Based on Efficient Response Compaction for Test Time and Tester Channels Reduction

This paper presents a test resource partitioning technique based on an efficient response compaction design called quotient compactor(q-Compactor). Because q-Compactor is a single-output compactor, high compaction ratios can be obtained even for chips with a small number of outputs. Some theorems for the design of q-Compactor are presented to achieve full diagnostic ability, minimize error cancellation and handle unknown bits in the outputs of the circuit under test (CUT). The q-Compactor can also be moved to the load-board, so as to compact the output response of the CUT even during functional testing. Therefore, the number of tester channels required to test the chip is significantly reduced. The experimental results on the ISCAS ‘89 benchmark circuits and an MPEG 2 decoder SoC show that the proposed compactionscheme is very efficient.     

Dyanmic Data Prefetching in Home—Based Software DSMs

A major overhead in software DSM(Distributed Shared Memory)is the cost of remote memory accesses necessitated by the protocol as well as induced by false sharing.This paper introduces a dynamic prefetching method implemented in the JIAJIA software DSM to reduce system overhead caused by remote accesses.The prefetching method records the interleaving string of INV(invalidation)and GETP (getting a remote page)operations for each cached page and analyzes the periodicity of the string when a page is invalidated on a lock or barrier.A prefetching request is issued after the lock or barrier if the periodicity analysis indicates that GETP will be the next operation in the string.Multiple prefetching requests are merged into the same message if they are to the same host,Performance evaluation with eight well-accepted benchmarks in a cluster of sixteen PowerPC workstations shows that the prefetching scheme can significantly reduce the page fault overhead and as a result achieves a performance increase of 15%-20% in three benchmarks and around 8%-10% in another three.The average extra traffic caused by useless prefetches is only 7%-13% in the evaluation.     

Handling non-canonical software requirements based on Annotated Predicate Calculus

Eliciting requirements for a proposed system inevitably involves the problem of handling undesirable information about customer's needs, including inconsistency, vagueness, redundancy, or incompleteness. We term the requirements statements involved in the undesirable information non-canonical software requirements. In this paper, we propose an approach to handling non-canonical software requirements based on Annotated Predicate Calculus (APC). Informally, by defining a special belief lattice appropriate for representing the stakeholder's belief in requirements statements, we construct a new form of APC to formalize requirements specifications. We then show how the APC can be employed to characterize non-canonical requirements. Finally, we show how the approach can be used to handle non-canonical requirements through a case study. Kedian Mu received B.Sc. degree in applied mathematics from Beijing Institute of Technology, Beijing, China, in 1997, M.Sc. degree in probability and mathematical statistics from Beijing Institute of Technology, Beijing, China, in 2000, and Ph.D. in applied mathematics from Peking University, Beijing, China, in 2003. From 2003 to 2005, he was a postdoctoral researcher at Institute of Computing Technology, Chinese Academy of Sciences, China. He is currently an assistant professor at School of Mathematical Sciences, Peking University, Beijing, China. His research interests include uncertain reasoning in artificial intelligence, knowledge engineering and science, and requirements engineering. Zhi Jin was awarded B.Sc. in computer science from Zhejiang University, Hangzhou, China, in 1984, and studied for her M.Sc. in computer science (expert system) and her Ph.D. in computer science (artificial intelligence) at National Defence University of Technology, Changsha, China. She was awarded Ph.D. in 1992. She is a senior member of China Computer Federation. She is currently a professor at Academy of Mathematics and System Sciences, Chinese Academy of Science. Her research interests include knowledge-based systems, artificial intelligence, requirements engineering, ontology engineering, etc. Her current research focuses on ontology-based requirements elicitation and analysis. She has got about 60 papers published, including co-authoring one book. Ruqian Lu is a professor of computer science of the Institute of Mathematics, Chinese Academy of Sciences. His research interests include artificial intelligence, knowledge engineering and knowledge based software engineering. He designed the “Tian Ma” software systems that have been widely applied in more than 20 fields, including the national defense and the economy. He has won two first class awards from Chinese Academy of Sciences and a National second class prize from the Ministry of Science and Technology. He has also won the sixth Hua Lookeng Prize for Mathematics. Yan Peng received B.Sc. degree in software from Jilin University, Changchun, China, in 1992. From June 2002 to December 2005, he studied for his M.E. in software engineering at College of Software Engineering, Graduate School of Chinese Academy of Sciences, Beijing, China. He was awarded M.E degree in 2006. He is currently responsible for CRM (customer relationship management) and BI (business intelligence) project in the BONG. His research interests include customer relationship management, business intelligence, data ming, software engineering and requirements engineering.     

A Novel Computer Architecture to Prevent Destruction by Viruses

In today‘s Internet computing world,illegal activities by crackers pose a serious threat to computer security.It is well known that computer viruses,Trojan horses and other intrusive programs may cause sever and often catastrophic consequences. This paper proposes a novel secure computer architecture based on security-code.Every instruction/data word is added with a security-code denoting its security level.External programs and data are automatically addoed with security-code by hadware when entering a computer system.Instruction with lower security-code cannot run or process instruction/data with higher security level.Security-code cannot be modified by normal instruction.With minor hardware overhead,then new architecture can effectively protect the main computer system from destruction or theft by intrusive programs such as computer viruses.For most PC systems it includes an increase of word-length by 1 bit on register,the memory and the hard disk.     

Automatic Segmentation of News Items Based on Video and Audio Features

The automatic segmentation of news items is a key for implementing the automatic cataloging system of news video.This paper presents an approach which manages audio and video feature infomation to automatically segment news items.The integration of audio and visual analyses can overcome the weakness of the approach using only image analysis techniques.It makes the approach more adaptable to various situations of news items.The proposed approach detects silence segments in accompanying audio,and integrates them with shot segmentation results,as ewll as anchor shot detection results,to determine the boundaries among news items,Expeimental results show that the integration of audio and video features is an effective approach to solving the problem of automatic segmentation of news items.     

Leakage current estimation of CMOS circuit with stack effect

Leakage current of CMOS circuit increases dramatically with the technology scaling down and has become a critical issue of high performance system. Subthreshold, gate and reverse biased junction band-to-band tunneling (BTBT) leakages are considered three main determinants of total leakage current. Up to now, how to accurately estimate leakage current of large-scale circuits within endurable time remains unsolved, even though accurate leakage models have been widely discussed. In this paper, the authors first dip into the stack effect of CMOS technology and propose a new simple gate-level leakage current model. Then, a table-lookup based total leakage current simulator is built up according to the model. To validate the simulator, accurate leakage current is simulated at circuit level using popular simulator HSPICE for comparison. Some further studies such as maximum leakage current estimation, minimum leakage current generation and a high-level average leakage current macromodel are introduced in detail. Experiments on ISCAS85 and ISCAS89 benchmarks demonstrate that the two proposed leakage current estimation methods are very accurate and efficient.     

ARMiner: A Data Mining Tool Based on Association Rules

In this paper,ARM iner,a data mining tool based on association rules,is introduced.Beginning with the system architecture,the characteristics and functions are discussed in details,including data transfer,concept hierarchy generalization,mining rules with negative items and the re-development of the system.An example of the tool‘s application is also shown.Finally,Some issues for future research are presented.     

Method for estimating lineature by scanned samples of documents

The paper considers an algorithm for estimating lineature of scanned digital images based on the calculation of series lengths and local directional fields. The results of an experiment are given and the efficiency of the algorithm is investigated. Vitalii Anatol’evich Mitekin. Born in 1983. Graduated from Samara State Aerospace University (SSAU) in 2006. At present, he is a post-graduate student in the Department of Geoinformatics at SSAU. His scientific interests include image processing, stenography, and cryptography. He is the author of three publications, including three articles. Viktor Andreevich Fedoseev. Born in 1986. Defended a degree thesis at the Samara State Aerospace University in 2007. Continues teaching at the SSAU at present, and also works as a technician at the Institute of Image Processing Systems at the Russian Academy of Sciences. His scientific interests include computer graphics, image processing, stenography, and cryptography. He is the author of 11 publications, including six articles.     

A Transactional Asynchronous Replication Scheme for Mobile Database Systems

In mobile database systems,mobility of users has a significant impact on data replication.As a result,the various replica control protocols that exist today in traditional distributed and multidatabase environments are no longer suitable To solve this problem,a new mobile database replication scheme,the Transaction-Level Result-Set Propagation(TLRSP)model,is put forward in this paper,The conflict dectction and resolution strategy based on TLRSP is discussed in detail,and the implementation algorithm is proposed,In order to compare the performance of the TLRSP model with that of other mobile replication schemes,we have developed a detailde simulation model.Experimantal results show that the TLRSP model provides an effcient support for replicated mobile database systems by reducing reprocessing overhead and maintaining database consistency.     

A General Probability Formula of the Number of Location Areas＇ Boundaries Crossed by a Mobile Between Two Successive Call Arrivals

Mobility management is a challenging topic in mobile computing environment. Studying the situation of mobiles crossing the boundaries of location areas is significant for evaluating the costs and performances of various location management strategies. Hitherto, several formulae were derived to describe the probability of the number of location areas‘ boundaries crossed by a mobile. Some of them were widely used in analyzing the costs and performances of mobility management strategies. Utilizing the density evolution method of vector Markov processes, we propose a general probability formula of the number of location areas‘ boundaries crossed by a mobile between two successive calls. Fortunately, several widely-used formulae are special cases of the proposed formula.     

OpenMP on Networks of Workstations for Software DSMs

This paper describes the implementation of a sizable subset of OpenMP on networks of workstations(NOWs) and the source-to-source OpenMP complier(AutoPar） is used for the JIAJIA home-based shared virtual memory system (SVM).The paper suggests some simple modifications and extensions to the OpenMP standard for the difference between SVM and SMP(symmetric multi processor),at which the OpenMP specification is aimed.The OpenMP translator is based on an automatic paralleization compiler,so it is possible to check the correctness of the semantics of OpenMP programs which is not required in an OpenMP-compliant implementation AutoPar is measured for five applications including both programs from NAS Parallel Benchmarks and real applications on a cluster of eight Pentium Ⅱ PCs connected by a 100 Mbps switched Eternet.The evaluation shows that the parallelization by annotaing OpenMPdirectives is simple and the performance of generatd JIAJIA code is still acceptable on NOWs.     

Automatic Image-Based Pencil Sketch Rendering

This paper presents an automatic image-based approach for converting greyscale images to pencil sketches,in which strokes follow the image features.The algorithm first extracts a dense direction field automatically using Logical/Linear operators which embody the drawing mechanism.Next,a reconstruction approach based on a sampling-and-interpolation scheme is introduced to generate stroke paths from the direction field.Finally,pencil strokes are rendered along the specified paths with consideration of image tone and artificial illumingation.As an important application,the technique is applied to render portraits from images with little user interaction.The experimental results demonstrate that the approach can automatically achieve copmelling pencil sketches from reference images.     

Formal Ontology: Foundation of Domain Knowledge Sharing and Reusing

Domain analysis is the activity of identifying and representing the relevant information in a domain,so that the information can be shared and reused in similar systems.But until now,no efficient approaches are available for capturing and representing the results of domain analysis and then for sharing and reusing the domain knowledge.This paper proposes an ontology-oriented approach for formalizing the domain models.The architecture for the multiple-layer structure of the domain knowledge base is also discussed.And finally,some genetic algorithm-based methods have been given for supporting the knowledge sharing and reusing.     

A Type of Triangular Ball Surface and its Properties

A new type of bivariate generalized Ball basis function on a triangle is presented for free-form surface design.Some properties of the basis function are given,then degree elevation,recursive evaluation and some other properties of the generalized Ball surfaces are also derived.It is shown that the proposed recursive evaluation algorithm is more efficient than those of the old surfaces.