协同知识管理中利用共享本体建立产品状态模型

产品状态模型描述某个时刻的产品、相关的过程、资源等特征信息及其相互耦合关系,是协同知识管理的知识表达模型．运用广义QFD法分析了基于共享本体的产品状态模型,并在共享概念模型、领域特征字典和XML语法模型的基础上建立了产品共享状态模型的表达,为开发离散制造业的产品知识表达协议探索了一种有意义的理论和实践方法。     

Creating Ideas for Innovation: Effects of Organizational Distance on Knowledge Creation Processes

Innovation is to a large extent considered a social and communicative process, and input from other individuals potentially improves the generation of novel and valuable ideas also in the early stages of idea creation and development. Both colleagues inside organizations and external parties have frequently been proposed as important sources of information and knowledge within this part of the innovation process. Other contributions addressing social networks and innovation bring into focus the potentially negative effects that certain network structures may have on innovation, pointing to inconsistencies in received theory. In order to address these inconsistencies, an empirical study of ideation in a Swedish multinational firm was performed, taking into account two different knowledge creation processes – combination and in‐depth analysis – and their inter‐relationships with organizational distance between contributing individuals. Data was collected using a survey and was analysed using regression models. It was found that different levels of organizational distance correlate with different knowledge creation processes. In‐depth analysis occurred more often with employees' close colleagues, whereas the combination of existing ideas and information was more frequent in interaction with employees' close colleagues and with external parties. Both these interaction patterns were also found to be positive for the generation of patents, whereas no such relationship could be seen when individuals interacted with colleagues in other departments in the same firm. The findings have implications for theory on cognitive distance, and also suggest that management needs to facilitate different types of collaboration and networking when aiming to facilitate and support ideation, taking into consideration the type of innovation aimed for, as well as its supporting knowledge creation processes.     

The State‐of‐the‐Art in Predictive Visual Analytics

Predictive analytics embraces an extensive range of techniques including statistical modeling, machine learning, and data mining and is applied in business intelligence, public health, disaster management and response, and many other fields. To date, visualization has been broadly used to support tasks in the predictive analytics pipeline. Primary uses have been in data cleaning, exploratory analysis, and diagnostics. For example, scatterplots and bar charts are used to illustrate class distributions and responses. More recently, extensive visual analytics systems for feature selection, incremental learning, and various prediction tasks have been proposed to support the growing use of complex models, agent‐specific optimization, and comprehensive model comparison and result exploration. Such work is being driven by advances in interactive machine learning and the desire of end‐users to understand and engage with the modeling process. In this state‐of‐the‐art report, we catalogue recent advances in the visualization community for supporting predictive analytics. First, we define the scope of predictive analytics discussed in this article and describe how visual analytics can support predictive analytics tasks in a predictive visual analytics (PVA) pipeline. We then survey the literature and categorize the research with respect to the proposed PVA pipeline. Systems and techniques are evaluated in terms of their supported interactions, and interactions specific to predictive analytics are discussed. We end this report with a discussion of challenges and opportunities for future research in predictive visual analytics.     

State‐of‐the‐Art Report in Web‐based Visualization

In this report, we review the current state of the art of web‐based visualization applications. Recently, an increasing number of web‐based visualization applications have emerged. This is due to the fact that new technologies offered by modern browsers greatly increased the capabilities for visualizations on the web. We first review these technical aspects that are enabling this development. This includes not only improvements for local rendering like WebGL and HTML5, but also infrastructures like grid or cloud computing platforms. Another important factor is the transfer of data between the server and the client. Therefore, we also discuss advances in this field, for example methods to reduce bandwidth requirements like compression and other optimizations such as progressive rendering and streaming. After establishing these technical foundations, we review existing web‐based visualization applications and prototypes from various application domains. Furthermore, we propose a classification of these web‐based applications based on the technologies and algorithms they employ. Finally, we also discuss promising application areas that would benefit from web‐based visualization and assess their feasibility based on the existing approaches.     

Weak Convex Decomposition by Lines‐of‐sight

We define the convexity rank of a set of points to be the portion of mutually visible pairs of points out of the total number of pairs. Based on this definition of weak convexity, we introduce a spectral method that decomposes a given shape into weakly convex regions. The decomposition is applied without explicitly measuring the convexity rank. The method merely amounts to a spectral clustering of a matrix representing the all‐pairs line of sight. Our method can be directly applied on an oriented point cloud and does not require any topological information, nor explicit concavity or convexity measures. We demonstrate the efficiency of our algorithm on a large number of examples and compare them qualitatively with competitive approaches.     

Coherent Out‐of‐Core Point‐Based Global Illumination

We describe a new technique for coherent out‐of‐core point‐based global illumination and ambient occlusion. Point‐based global illumination (PBGI) is used in production to render tremendously complex scenes, so in‐core storage of point and octree data structures quickly becomes a problem. However, a simple out‐of‐core extension of a classical top‐down octree building algorithm would be extremely inefficient due to large amount of I/O required. Our method extends previous PBGI algorithms with an out‐of‐core technique that uses minimal I/O and stores data on disk compactly and in coherent chunks for later access during shading. Using properties of a space‐filling Z‐curve, we are able to preprocess the data in two passes: an external ID‐sort and an octree construction pass.     

Benchmarking urban six‐degree‐of‐freedom simultaneous localization and mapping

Quite a number of approaches for solving the simultaneous localization and mapping (SLAM) problem exist by now. Some of them have recently been extended to mapping environments with six‐degree‐of‐freedom poses, yielding 6D SLAM approaches. To demonstrate the capabilities of the respective algorithms, it is common practice to present generated maps and successful loop closings in large outdoor environments. Unfortunately, it is nontrivial to compare different 6D SLAM approaches objectively, because ground truth data about the outdoor environments used for demonstration are typically unavailable. We present a novel benchmarking method for generating the ground truth data based on reference maps. The method is then demonstrated by comparing the absolute performance of some previously existing 6D SLAM algorithms that build a large urban outdoor map. © 2008 Wiley Periodicals, Inc.     

State‐of‐the‐Art in GPU‐Based Large‐Scale Volume Visualization

This survey gives an overview of the current state of the art in GPU techniques for interactive large‐scale volume visualization. Modern techniques in this field have brought about a sea change in how interactive visualization and analysis of giga‐, tera‐ and petabytes of volume data can be enabled on GPUs. In addition to combining the parallel processing power of GPUs with out‐of‐core methods and data streaming, a major enabler for interactivity is making both the computational and the visualization effort proportional to the amount and resolution of data that is actually visible on screen, i.e. ‘output‐sensitive’ algorithms and system designs. This leads to recent output‐sensitive approaches that are ‘ray‐guided’, ‘visualization‐driven’ or ‘display‐aware’. In this survey, we focus on these characteristics and propose a new categorization of GPU‐based large‐scale volume visualization techniques based on the notions of actual output‐resolution visibility and the current working set of volume bricks—the current subset of data that is minimally required to produce an output image of the desired display resolution. Furthermore, we discuss the differences and similarities of different rendering and data traversal strategies in volume rendering by putting them into a common context—the notion of address translation. For our purposes here, we view parallel (distributed) visualization using clusters as an orthogonal set of techniques that we do not discuss in detail but that can be used in conjunction with what we present in this survey.     

The State‐of‐the‐Art of Set Visualization

Sets comprise a generic data model that has been used in a variety of data analysis problems. Such problems involve analysing and visualizing set relations between multiple sets defined over the same collection of elements. However, visualizing sets is a non‐trivial problem due to the large number of possible relations between them. We provide a systematic overview of state‐of‐the‐art techniques for visualizing different kinds of set relations. We classify these techniques into six main categories according to the visual representations they use and the tasks they support. We compare the categories to provide guidance for choosing an appropriate technique for a given problem. Finally, we identify challenges in this area that need further research and propose possible directions to address these challenges. Further resources on set visualization are available at http://www.setviz.net .     

极限编程中的知识创造

通过识别极限编程中的知识创造活动,分析了极限编程的知识创造机理和特点,从而解释了极限编程的有效性。     

Bag‐of‐words‐driven,single‐camera simultaneous localization and mapping

This paper describes BoWSLAM, a scheme for a robot to reliably navigate and map previously unknown environments, in real time, using monocular vision alone. BoWSLAM can navigate challenging dynamic and self‐similar environments and can recover from gross errors. Key innovations allowing this include new uses for the bag‐of‐words image representation; this is used to select the best set of frames from which to reconstruct positions and to give efficient wide‐baseline correspondences between many pairs of frames, providing multiple position hypotheses. A graph‐based representation of these position hypotheses enables the modeling and optimization of errors in scale in a dual graph and the selection of only reliable position estimates in the presence of gross outliers. BoWSLAM is demonstrated mapping a 25‐min, 2.5‐km trajectory through a challenging and dynamic outdoor environment without any other sensor input, considerably farther than previous single‐camera simultaneous localization and mapping (SLAM) schemes. © 2010 Wiley Periodicals, Inc.     

State‐of‐the‐Art in Compressed GPU‐Based Direct Volume Rendering

Great advancements in commodity graphics hardware have favoured graphics processing unit (GPU)‐based volume rendering as the main adopted solution for interactive exploration of rectilinear scalar volumes on commodity platforms. Nevertheless, long data transfer times and GPU memory size limitations are often the main limiting factors, especially for massive, time‐varying or multi‐volume visualization, as well as for networked visualization on the emerging mobile devices. To address this issue, a variety of level‐of‐detail (LOD) data representations and compression techniques have been introduced. In order to improve capabilities and performance over the entire storage, distribution and rendering pipeline, the encoding/decoding process is typically highly asymmetric, and systems should ideally compress at data production time and decompress on demand at rendering time. Compression and LOD pre‐computation does not have to adhere to real‐time constraints and can be performed off‐line for high‐quality results. In contrast, adaptive real‐time rendering from compressed representations requires fast, transient and spatially independent decompression. In this report, we review the existing compressed GPU volume rendering approaches, covering sampling grid layouts, compact representation models, compression techniques, GPU rendering architectures and fast decoding techniques.     

Out‐of‐Core Construction of Sparse Voxel Octrees

Voxel‐based rendering has recently received significant attention due to its potential in the context of efficiently rendering massively large and highly detailed scenes. Unfortunately, few scenes are available in the form of sparse voxel octrees. In this paper, we present an out‐of‐core algorithm for constructing a sparse voxel octree from a triangle mesh. Our algorithm allows the input triangle mesh, the output sparse voxel octree and, most importantly, the intermediate high‐resolution 3D voxel grid, to be larger than available memory. We demonstrate that our out‐of‐core algorithm can construct sparse voxel octrees from triangle meshes using only a fraction of the memory required by an in‐core algorithm in roughly the same time, and that our out‐of‐core algorithm can also handle extremely large triangle meshes.     

A multidegree‐of‐freedom manipulator for curtain‐wall installation

Recently, the trend in architectural forms has been towards larger and taller buildings. Building materials are, therefore, also becoming larger and heavier. Typical construction machineries are not adequate for handling such materials, and most construction works are still managed by a human operator. Construction processes are, therefore, fraught with a number of problems, including frequent accidents, high construction cost, and heterogeneous construction quality depending on the experience of the workers. Automation has been introduced at various sites to address these construction problems. In this paper, the process of a curtain‐wall installation in a skyscraper is analyzed, and the prototype of a construction robot for curtain‐wall installation (CRCWI) is proposed. Use of the proposed CRCWI can reduce the need for manpower and the construction period and cost, and can assure safety in the curtain‐wall construction site. The performance of the proposed CRCWI was verified with a real application test in a skyscraper construction site. © 2006 Wiley Periodicals, Inc.     

Sliding‐mode control of a three‐degrees‐of‐freedom nanopositioner

This paper presents the sliding‐mode control of a three‐degrees‐of‐freedom nanopositioner (Z, θ_x, θ_y). This nanopositioner is actuated by piezoelectric actuators. Capacitive gap sensors are used for position feedback. In order to design the feedback controller, the open‐loop characteristics of this nanopositioner are investigated. Based on the results of the investigation, each pair of piezoelectric actuators and corresponding gap sensors is treated as an independent system and modeled as a first‐order linear model coupled with hysteresis. When the model is identified and the hysteresis nonlinearity is linearized, a linear system model with uncertainty is used to design the controller. When designing the controller, the sliding‐mode disturbance (uncertainty) estimation and compensation scheme is used. The structure of the proposed controller is similar to that of a proportional integral derivative controller. Thus, it can be easily implemented. Experimental results show that 3‐nm tracking resolution can be obtained. Copyright © 2008 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

State‐of‐the‐art in Multi‐Light Image Collections for Surface Visualization and Analysis

Multi‐Light Image Collections (MLICs), i.e., stacks of photos of a scene acquired with a fixed viewpoint and a varying surface illumination, provide large amounts of visual and geometric information. In this survey, we provide an up‐to‐date integrative view of MLICs as a mean to gain insight on objects through the analysis and visualization of the acquired data. After a general overview of MLICs capturing and storage, we focus on the main approaches to produce representations usable for visualization and analysis. In this context, we first discuss methods for direct exploration of the raw data. We then summarize approaches that strive to emphasize shape and material details by fusing all acquisitions in a single enhanced image. Subsequently, we focus on approaches that produce relightable images through intermediate representations. This can be done both by fitting various analytic forms of the light transform function, or by locally estimating the parameters of physically plausible models of shape and reflectance and using them for visualization and analysis. We finally review techniques that improve object understanding by using illustrative approaches to enhance relightable models, or by extracting features and derived maps. We also review how these methods are applied in several, main application domains, and what are the available tools to perform MLIC visualization and analysis. We finally point out relevant research issues, analyze research trends, and offer guidelines for practical applications.     

Distributed Out‐of‐Core Stochastic Progressive Photon Mapping

At present, stochastic progressive photon mapping (SPPM) is one of the most comprehensive methods for a consistent global illumination computation. Even though the number of photons is unlimited due to their progressive nature, the scene size is still bound by the available main memory. In this paper, we present the first consistent out‐of‐core SPPM algorithm. In order to cope with large scenes, we automatically subdivide the geometry and parallelly trace photons and eye rays in a portal‐based system, distributed across multiple machines in a commodity cluster. Moreover, modifications of the original SPPM method are introduced that keep both the utilization of tracer machines high and the network traffic low. Therefore, compared to a portal‐based single machine setup, our distributed approach achieves a significant speedup. We compare a GPU‐based with a CPU‐based implementation and demonstrate our system in multiple large test scenes of up to 90 million triangles.     

State‐of‐the‐Art Report: Visual Computing in Radiation Therapy Planning

Radiation therapy (RT) is one of the major curative approaches for cancer. It is a complex and risky treatment approach, which requires precise planning, prior to the administration of the treatment. Visual Computing (VC) is a fundamental component of RT planning, providing solutions in all parts of the process—from imaging to delivery. Despite the significant technological advancements of RT over the last decades, there are still many challenges to address. This survey provides an overview of the compound planning process of RT, and of the ways that VC has supported RT in all its facets. The RT planning process is described to enable a basic understanding in the involved data, users and workflow steps. A systematic categorization and an extensive analysis of existing literature in the joint VC/RT research is presented, covering the entire planning process. The survey concludes with a discussion on lessons learnt, current status, open challenges, and future directions in VC/RT research.     

A state‐of‐art review on band‐notch characteristics in UWB antennas

Ultra‐wideband technology has experienced a rapid growth over the last decade for its contribution in different sectors of human society. Printed antennas are considered as preferred platform for implementing this technology because of its alluring characteristics like light weight, low cost, ease of fabrication, integration capability with other systems, etc. Antennas developed for ultra‐wideband applications are desired to have notch characteristics for avoiding interference with other existing radio communication systems. The techniques related to design and developments of printed band‐notched antennas are continuously upgraded for improving the antenna performance. In this article, a comprehensive review has been carried out on ultra‐wideband antennas with band notch characteristics proposed in around last decade. The band notched UWB antennas available in the literature have broadly been classified into five different categories based on their notch characteristics like single band‐notch, dual band‐notch, triple band‐notch, quad/multiple band‐notch, and reconfigurable/tunable band‐notch, respectively. This review exercise may be helpful for beginners working on ultra‐wideband band‐notched antennas and also such a review process is not available in the open literature to the best of author's knowledge.