A data-driven generic simulation model for logistics-embedded assembly manufacturing lines

Simulation has been used to evaluate various aspects of manufacturing systems. However, building a simulation model of a manufacturing system is time-consuming and error-prone because of the complexity of the systems. This paper introduces a generic simulation modeling framework to reduce the simulation model build time. The framework consists of layout modeling software and a data-driven generic simulation model. The generic simulation model was developed considering the processing as well as the logistics aspects of assembly manufacturing systems. The framework can be used to quickly develop an integrated simulation model of the production schedule, operation processes and logistics of a system. The framework was validated by developing simulation models of cellular and conveyor manufacturing systems.     

Nanotextured superhydrophobic micromesh

A superhydrophobic micromesh covered with nanoprotrusions has been introduced and its applicability to a waterproof mobile phone speaker has been evaluated. The nanotextured superhydrophobic micromesh showed excellent water repellency, self-cleaning and waterproofing performances. In a waterproof speaker test using the fabricated nanotextured micromesh, the micromesh did not lose its waterproof function at 2 m water depth and did not form a remnant water film after being removed from the water. The packaged speaker showed almost the same sound quality before and after dipping at a 2 m water depth. These results demonstrate that the superhydrophobic nanotextured micromesh could be directly applicable for various products that need to resist water penetration, yet allow the transmission of gases and sound/light waves.     

Autonomous topological modeling of a home environment and topological localization using a sonar grid map

This paper presents a method of autonomous topological modeling and localization in a home environment using only low-cost sonar sensors. The topological model is extracted from a grid map using cell decomposition and normalized graph cut. The autonomous topological modeling involves the incremental extraction of a subregion without predefining the number of subregions. A method of topological localization based on this topological model is proposed wherein a current local grid map is compared with the original grid map. The localization is accomplished by obtaining a node probability from a relative motion model and rotational invariant grid-map matching. The proposed method extracts a well-structured topological model of the environment, and the localization provides reliable node probability even when presented with sparse and uncertain sonar data. Experimental results demonstrate the performance of the proposed topological modeling and localization in a real home environment.     

A fact-oriented ontological approach to human process modeling for knowledge-intensive business services

Modern business environment emphasizes the role of knowledge-intensive business services (KIBS). As well as the enterprises in any other kinds of industries, business process management (BPM) can be a source of core competency for the enterprises in KIBS industry. However, most of the business processes in KIBS are human processes which are collaborative, innovative, and dynamic, which cannot be supported well by current BPM technologies. Human interaction management (HIM) has emerged as an alternative theory to deal with human processes in KIBS. But, the current ways of process modeling and management in HIM have a problem of complexity, especially in terms of realizing its principle of ‘supportive activity management’. This research adopts fact-oriented ontological approach to address this problem. Based on fact-oriented approach, human-friendly condition modeling and state management during supportive activity management can be achieved.     

TSS BVHs: Tetrahedron Swept Sphere BVHs for Ray Tracing Subdivision Surfaces

We present a novel, compact bounding volume hierarchy, TSS BVH, for ray tracing subdivision surfaces computed by the Catmull‐Clark scheme. We use Tetrahedron Swept Sphere (TSS) as a bounding volume to tightly bound limit surfaces of such subdivision surfaces given a user tolerance. Geometric coordinates defining our TSS bounding volumes are implicitly computed from the subdivided mesh via a simple vertex ordering method, and each level of our TSS BVH is associated with a single distance bound, utilizing the Catmull‐Clark scheme. These features result in a linear space complexity as a function of the tree depth, while many prior BVHs have exponential space complexity. We have tested our method against different benchmarks with path tracing and photon mapping. We found that our method achieves up to two orders of magnitude of memory reduction with a high culling ratio over the prior AABB BVH methods, when we represent models with two to four subdivision levels. Overall, our method achieves three times performance improvement thanks to these results. These results are acquired by our theorem that rigorously computes our TSS bounding volumes.     

Mesh generation for confined fusion plasma simulation

XGC1 and M3D-C ¹ are two fusion plasma simulation codes being developed at Princeton Plasma Physics Laboratory. XGC1 uses the particle-in-cell method to simulate gyrokinetic neoclassical physics and turbulence (Chang et al. Phys Plasmas 16(5):056108, 2009; Ku et al. Nucl Fusion 49:115021, 2009; Admas et al. J Phys 180(1):012036, 2009). M3D-\(C^1\) solves the two-fluid resistive magnetohydrodynamic equations with the \(C^1\) finite elements (Jardin J comput phys 200(1):133–152, 2004; Jardin et al. J comput Phys 226(2):2146–2174, 2007; Ferraro and Jardin J comput Phys 228(20):7742–7770, 2009; Jardin J comput Phys 231(3):832–838, 2012; Jardin et al. Comput Sci Discov 5(1):014002, 2012; Ferraro et al. Sci Discov Adv Comput, 2012; Ferraro et al. International sherwood fusion theory conference, 2014). This paper presents the software tools and libraries that were combined to form the geometry and automatic meshing procedures for these codes. Specific consideration has been given to satisfy the mesh configuration and element shape quality constraints of XGC1 and M3D-\(C^1\).     

Online adaptive multiple pedestrian tracking in monocular surveillance video

Automatic online multiple pedestrian tracking is a rather important and challenging task in the field of machine vision. A new multiple pedestrian tracking system is proposed in this paper, which combines pedestrian detection, motion prediction, target matching and adaptive location adjustment methods. The clip-split strategy was adopted for optimization of the detected pedestrian candidates, which resulted in great improvement of the tracking accuracies, especially when the marginal areas of the detected target candidates contained background scenes. For each frame, the proposed adaptive location adjustment method was used to adjust the location and scale of the targets to deal with drifting problems where necessary, especially after severe occlusions. Experimental results on three challenging real-world datasets demonstrated that the proposed tracker has excellent performance over other state-of-the-art trackers based on MOT metrics.

     

Encouraging second-order consistency for multiple graph matching

The problems in computer vision of finding the global correspondences across a set of images can be formulated as a multiple graph matching problem consisting of pairwise matching problems. In the multiple graph matching problem, matching consistency is as important as matching accuracy for preventing the contrariety among matched results. Unfortunately, since the majority of conventional pairwise matching methods only approximate the original graph matching problem owing to its computational complexity, a framework that separately matches each graph pair could generate inconsistent results in practical environments. In this paper, we propose a novel multiple graph matching method based on the second-order consistency concept, which simultaneously considers the matching information of all possible graph pairs. We reformulate the multiple graph matching problem to encourage second-order consistency and design an iterative optimization framework. In our experiments, the proposed method outperforms the state-of-the-art methods in terms of both consistency and accuracy.