Force and tactile feedback in preloaded cantilever snap-fits under manual assembly

The purpose of this study was to investigate the tactile feedback of snap-fit fasteners when used in manual assembly. An important aspect of this assembly process is the assembler’s ability to perceive the snap-fit’s engagement. This sensing of engagement yields a high level of confidence that assembly is both complete and secure. Force and tactile feedback are critical elements in this process. Many snap-fits are used in conjunction with sealing elements that produce a constant force that remains in effect after snap-fit assembly is completed. The effect of sealing element preload magnitude and stiffness was studied using a test station, force deflection measurements, and jury pool data. A low value of preload with low stiffness was determined to be most favorable in terms of force and tactile feedback, with no preload only slightly less favorable. In order to sense the engagement signal of the catch, some resistance to assembly was found to be beneficial. A dimensionless term called “engagement signal-to-hold-force ratio” is proposed as an additional way of rating the effect of assembly forces for snap-fits. It was found that higher signal-to-hold-force ratio, as well as higher values of engagement signal, corresponded to higher confidence of assembly among experimental subjects.

Relevance to Industry

In the automotive industry, force and tactile feedback are essential for sensing the full engagement of snap-fit parts during the assembly of critical components, such as electrical and fuel system interconnects. Both the design of the snap-fit and the presence or absence of preload will affect force and tactile feedback. Many of these applications require the compression of an elastic gasket with a preload needed for air, fuel, or electrical isolation. Preload and preload stiffness factors are examined in this paper with the aim of achieving a better understanding of these effects so that snap-fit confidence of assembly and assembly robustness can be enhanced in industrial settings.     

Cops and Robbers from a distance

Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where the cops win if at least one of them is of distance at most k from the robber in G. The cop number of a graph G is the minimum number of cops needed to capture the robber in G. The distance k analogue of the cop number, written c_k(G), equals the minimum number of cops needed to win at a given distance k. We study the parameter c_k from algorithmic, structural, and probabilistic perspectives. We supply a classification result for graphs with bounded c_k(G) values and develop an O(n^2s+3) algorithm for determining if c_k(G)≤s for s fixed. We prove that if s is not fixed, then computing c_k(G) is NP-hard. Upper and lower bounds are found for c_k(G) in terms of the order of G. We prove that

     

Mining frequent closed patterns in pointset databases

In this paper, we proposed an efficient algorithm, called PCP-Miner (Pointset Closed Pattern Miner), for mining frequent closed patterns from a pointset database, where a pointset contains a set of points. Our proposed algorithm consists of two phases. First, we find all frequent patterns of length two in the database. Second, for each pattern found in the first phase, we recursively generate frequent closed patterns by a frequent pattern tree in a depth-first search manner. Since the PCP-Miner does not generate unnecessary candidates, it is more efficient and scalable than the modified Apriori, SASMiner and MaxGeo. The experimental results show that the PCP-Miner algorithm outperforms the comparing algorithms by more than one order of magnitude.     

Image Comparison by Compound Disjoint Information with Applications to Perceptual Visual Quality Assessment, Image Registration and Tracking

In this paper, we study (normalized) disjoint information as a metric for image comparison and its applications to perceptual image quality assessment, image registration, and video tracking. Disjoint information is the joint entropy of random variables excluding the mutual information. This measure of statistical dependence and information redundancy satisfies more rigorous metric conditions than mutual information, including self-similarity, minimality, symmetry and triangle inequality. It is applicable to two or more random variables, and can be computed by vector histogramming, vector Parzen window density approximation, and upper bound approximation involving fewer variables. We show such a theoretic advantage does have implications in practice. In the domain of digital image and video, multiple visual features are extracted and (normalized) compound disjoint information is derived from a set of marginal densities of the image distributions, thus enriching the vocabulary of content representation. The proposed metric matching functions are applied to several domain applications to demonstrate their efficacy.     

A generic approach for developing process-level hydrologic modeling components

Component software architectures offer an alternative approach for building large, complex hydrologic modeling systems. In contrast to more traditional software paradigms (i.e. procedural or object-oriented approaches), using component-based approaches allows individuals to construct autonomous modeling units that can be linked together through shared boundary conditions during a simulation run. One of the challenges in component-based modeling is designing a simple yet robust means for authoring model components. We address this challenge by presenting an approach for efficiently creating standards-based, process-level hydrologic modeling components. Using this approach, a hydrologic process is implemented as a modeling component by (1) authoring a configuration file that defines the properties of the component and (2) creating a class with three methods that define the pre-run, runtime, and post-run behavior of the modeling component. We present the design and implementation of this approach, which we call the Simple Model Wrapper (SMW), and demonstrate how it can be applied to create an Open Modeling Interface (OpenMI)-compliant modeling component for a basic hydrologic process.     

Mining Web navigation patterns with a path traversal graph

Understanding the navigational behaviour of website visitors is a significant factor of success in the emerging business models of electronic commerce and even mobile commerce. However, Web traversal patterns obtained by traditional Web usage mining approaches are ineffective for the content management of websites. They do not provide the big picture of the intentions of the visitors. The Web navigation patterns, termed throughout-surfing patterns (TSPs) as defined in this paper, are a superset of Web traversal patterns that effectively display the trends toward the next visited Web pages in a browsing session. TSPs are more expressive for understanding the purposes of website visitors. In this paper, we first introduce the concept of throughout-surfing patterns and then present an efficient method for mining the patterns. We propose a compact graph structure, termed a path traversal graph, to record information about the navigation paths of website visitors. The graph contains the frequent surfing paths that are required for mining TSPs. In addition, we devised a graph traverse algorithm based on the proposed graph structure to discover the TSPs. The experimental results show the proposed mining method is highly efficient to discover TSPs.     

Switching model predictive attitude control for a quadrotor helicopter subject to atmospheric disturbances

In this article a switching model predictive attitude controller for an unmanned quadrotor helicopter subject to atmospheric disturbances is presented. The proposed control scheme is computed based on a piecewise affine (PWA) model of the quadrotor's attitude dynamics, where the effects of the atmospheric turbulence are taken into consideration as additive disturbances. The switchings among the PWA models are ruled by the rate of the rotation angles and for each PWA system a corresponding model predictive controller is computed. The suggested algorithm is verified in experimental studies in the execution of sudden maneuvers subject to forcible wind disturbances. The quadrotor rejects the induced wind disturbances while performing accurate attitude tracking.     

Video game experience predicts virtual, but not real navigation performance

In recent years, studies have shown that video game experience is related to improvements across a variety of cognitive and visuospatial tasks. This study investigated the relationship between prior video game experience and spatial performance in virtual and real environments. Across two experiments, gaming experience was related to performance in desktop virtual environments; those with more video game experience were more accurate in pointing to nonvisible targets. In contrast, gaming experience was unrelated to three different real environment tasks, suggesting that video games may primarily influence perceptual and cognitive abilities in the visual domain over abilities that also involve kinesthetic or vestibular input. Contrary to expectations, gaming experience was also related to performance in immersive virtual environments, which may be related to the use of a joystick interface during immersive travel. Video game experience was also positively related to performance in a dynamic spatial task and to verbal SAT and math SAT scores. Sex differences in desktop virtual navigation and dynamic spatial ability were eliminated when game experience was included as a covariate.     

Time-extended multi-robot coordination for domains with intra-path constraints

Many applications require teams of robots to cooperatively execute tasks. Among these domains are those in which successful coordination must respect intra-path constraints, which are constraints that occur on the paths of agents and affect route planning. This work focuses on multi-agent coordination for disaster response with intra-path precedence constraints, a compelling application that is not well addressed by current coordination methods. In this domain a group of fire truck agents attempt to address fires spread throughout a city in the wake of a large-scale disaster. The disaster has also caused many city roads to be blocked by impassable debris, which can be cleared by bulldozer robots. A high-quality coordination solution must determine not only a task allocation but also what routes the fire trucks should take given the intra-path precedence constraints and which bulldozers should be assigned to clear debris along those routes.     

Mining closed patterns in multi-sequence time-series databases

In this paper, we propose an efficient algorithm, called CMP-Miner, to mine closed patterns in a time-series database where each record in the database, also called a transaction, contains multiple time-series sequences. Our proposed algorithm consists of three phases. First, we transform each time-series sequence in a transaction into a symbolic sequence. Second, we scan the transformed database to find frequent patterns of length one. Third, for each frequent pattern found in the second phase, we recursively enumerate frequent patterns by a frequent pattern tree in a depth-first search manner. During the process of enumeration, we apply several efficient pruning strategies to remove frequent but non-closed patterns. Thus, the CMP-Miner algorithm can efficiently mine the closed patterns from a time-series database. The experimental results show that our proposed algorithm outperforms the modified Apriori and BIDE algorithms.