Hierarchical Indexing Structure for Efficient Similarity Search in Video Retrieval

With the rapid increase in both centralized video archives and distributed WWW video resources, content-based video retrieval is gaining its importance. To support such applications efficiently, content-based video indexing must be addressed. Typically, each video is represented by a sequence of frames. Due to the high dimensionality of frame representation and the large number of frames, video indexing introduces an additional degree of complexity. In this paper, we address the problem of content-based video indexing and propose an efficient solution, called the ordered VA-file (OVA-file) based on the VA-file. OVA-file is a hierarchical structure and has two novel features: 1) partitioning the whole file into slices such that only a small number of slices are accessed and checked during k nearest neighbor (kNN) search and 2) efficient handling of insertions of new vectors into the OVA-file, such that the average distance between the new vectors and those approximations near that position is minimized. To facilitate a search, we present an efficient approximate kNN algorithm named ordered VA-LOW (OVA-LOW) based on the proposed OVA-file. OVA-LOW first chooses possible OVA-slices by ranking the distances between their corresponding centers and the query vector, and then visits all approximations in the selected OVA-slices to work out approximate kNN. The number of possible OVA-slices is controlled by a user-defined parameter delta. By adjusting delta, OVA-LOW provides a trade-off between the query cost and the result quality. Query by video clip consisting of multiple frames is also discussed. Extensive experimental studies using real video data sets were conducted and the results showed that our methods can yield a significant speed-up over an existing VA-file-based method and (distance with high query result quality. Furthermore, by incorporating temporal correlation of video content, our methods achieved much more efficient performance     

浅谈FAS系统

本文以某国际大型乳品厂为例,通过对FAS(Factory Automation System)系统的基本概念、网络结构、数据流、装置单元、管理维护、ERP支持及人员角色职责等方面内容的阐述,使读者对工厂自动化的理念有更深刻的认识,尤其在进行工厂自动化系统的设计、管理时给予更多地参考和借鉴,以促进其在各领域的广泛应用.     

Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization

Randomized search heuristics like local search, tabu search, simulated annealing, or all kinds of evolutionary algorithms have many applications. However, for most problems the best worst-case expected run times are achieved by more problem-specific algorithms. This raises the question about the limits of general randomized search heuristics. Here a framework called black-box optimization is developed. The essential issue is that the problem but not the problem instance is knownto the algorithm which can collect information about the instance only by asking for the value of points in the search space. All known randomized search heuristics fit into this scenario. Lower bounds on the black-box complexity of problems are derived without complexity theoretical assumptions and are compared with upper bounds in this scenario.     

A survey of approaches for the visual model-driven development of next generation software-intensive systems

Software-intensive systems of the future are expected to be highly distributed and to exhibit adaptive and anticipatory behavior when operating in highly dynamic environments and interfacing with the physical world. Therefore, visual modeling techniques to address these software-intensive systems require a mix of models from a multitude of disciplines such as software engineering, control engineering, and business process engineering. As in this concert of techniques software provides the most flexible element, the integration of these different views can be expected to happen in the software. The software thus includes complex information processing capabilities as well as hard real-time coordination between distributed technical systems and computers.In this article, we identify a number of general requirements for the visual model-driven specification of next generation software-intensive systems. As business process engineering and software engineering are well integrated areas and in order to keep this survey focused, we restrict our attention here to approaches for the visual model-driven development of adaptable software-intensive systems where the integration of software engineering with control engineering concepts and safety issues are important. In this survey, we identify requirements and use them to classify and characterize a number of approaches that can be employed for the development of the considered class of software-intensive systems.     

Action Planning for Directed Model Checking of Petri Nets

Petri nets are fundamental to the analysis of distributed systems especially infinite-state systems. Finding a particular marking corresponding to a property violation in Petri nets can be reduced to exploring a state space induced by the set of reachable markings. Typical exploration(reachability analysis) approaches are undirected and do not take into account any knowledge about the structure of the Petri net. This paper proposes heuristic search for enhanced exploration to accelerate the search. For different needs in the system development process, we distinguish between different sorts of estimates.Treating the firing of a transition as an action applied to a set of predicates induced by the Petri net structure and markings, the reachability analysis can be reduced to finding a plan to an AI planning problem. Having such a reduction broadens the horizons for the application of AI heuristic search planning technology. In this paper we discuss the transformations schemes to encode Petri nets into PDDL. We show a concise encoding of general place-transition nets in Level 2 PDDL2.2, and a specification for bounded place-transition nets in ADL/STRIPS. Initial experiments with an existing planner are presented.     

How Iterative are Iterative Algebras?

Iterative algebras are defined by the property that every guarded system of recursive equations has a unique solution. We prove that they have a much stronger property: every system of recursive equations has a unique strict solution. And we characterize those systems that have a unique solution in every iterative algebra.     

Information sharing across multiple humanitarian organizations—a web-based information exchange platform for project reporting

This article analyzes information sharing problems in the humanitarian development sector and proposes the concept of a web-based exchange platform to face some of the technical challenges. The “Development Information Exchange System” is a mediator-wrapper-architecture that uses XML documents to loosely couple autonomous and heterogeneous information systems. Detailed project information of humanitarian organizations that resides on data provider systems can be formatted with XSL stylesheets according to the needs of the users and shared within or between organizations. The system can help to close the control loop by providing qualitative information about humanitarian projects. This makes project management more efficient. The proposed architecture solves an interface problem between the various partners and stakeholders of humanitarian projects. It is a first step towards a service-oriented architecture between humanitarian organizations. The next step could be the definition of cross-organizational business processes. These processes may be defined platform-independently with the Business Process Execution Language for Web Services. A prototype of the exchange platform is presented and evaluated in this article.     

中外网络银行发展基础的差异性分析

通过对中外网络银行产生和发展的分析，揭示了我国网络银行在发展基础方面与国外网络银行的差距和不足，从商业银行的角度论述了促进我国网络银行理性发展的对策。     

对毕业设计与学生能力培养的几点看法

本文对日本大学生的毕业设计过程进行了介绍与分析，就毕业课题与学生能力的培养提出了几点看法。