Efficient simplex computation for fixture layout design

Fixture, to hold an object by making multiple contacts, is a fundamental tool in manufacturing. A fixture layout is an arrangement of contacts on an object’s surface. Designing a fixture layout of an object can be reduced to computing the largest simplex and the resulting simplex is classified using the radius of the largest inscribed ball centered at the origin. We present three different algorithms to compute such a simplex: a simple randomized algorithm, an interchange algorithm, and a branch-and-bound algorithm. We also present methods to combine different algorithms to improve the performance and highlight their performance on complex 3D models consisting of thousands of triangles. Our randomized algorithm computes a feasible fixture layout in linear time and is well-suited for real-time applications. The interchange algorithm computes an optimal simplex in linear time such that no single vertex can be changed to enlarge the simplex, and it provides a practical method for complex 3D objects. The branch-and-bound algorithm computes the largest simplex by using lower and upper bounds on the radius of the inscribed ball, by which the computation time is reduced by a factor of five in comparison with the brute-force search.     

Connections between the filtered discontinuous Galerkin method and the flux reconstruction approach to high order discretizations

The purpose of this paper is to provide new insights on the connections that exist between the discontinuous Galerkin method (DG), the flux reconstruction method (FR) and the recently identified energy stable flux reconstruction method (ESFR) when solving time dependent conservation laws. All these schemes appear to be quite similar and it is important to understand how they are related. In this paper, we first review results on the stability of the discontinuous Galerkin method and extend it to the filtered discontinuous Galerkin method. We then consider the flux reconstruction approach and show its connections with DG. In particular, we show how the Energy Stable Flux Reconstruction method introduced by Vincent et al. is equivalent to a filtered DG method, hence giving a new proof of its stability. Also, it allows the use of the method without having to know the special form of the flux correction polynomials. Finally, we underline some fundamental differences that exist between FR and DG.     

A singular ES-FEM for plastic fracture mechanics

The stress and strain fields around the crack tip for power hardening material, which are singular as r approaches zero, are crucial to fracture and fatigue of structures. To simulate effectively the strain and stress around the crack tip, we develop a seven-node singular element which has a displacement field containing the HRR term and the second order term. The novel singular element is formulated based on the edge-based smoothed finite element method (ES-FEM). With one layer of these singular elements around the crack tip, the ES-FEM works very well for simulating plasticity around the crack tip based on the small strain formulation. Two examples are presented with detailed comparison with other methods. It is found that the results of the presented singular ES-FEM are closer to reference solution, which demonstrates the applicability and the effectiveness of our method for the plastic field around the crack tip.     

Sensitivity analysis and optimization of vehicle–bridge systems based on combined PEM–PIM strategy

This paper presents a new optimization method for coupled vehicle–bridge systems subjected to uneven road surface excitation. The vehicle system is simplified as a multiple rigid-body model and the single-span bridge is modeled as a simply supported Bernoulli–Euler beam. The pseudo-excitation method transforms the random surface roughness into the superposition of a series of deterministic pseudo-harmonic excitations, which enables convenient and accurate computation of first and second order sensitivity information. The precise integration method is used to compute the vertical random vibrations for both the vehicle and the bridge. The sensitivities are used to find the optimal solution, with vehicle ride comfort taken as the objective function. Optimization efficiency and computational accuracy are demonstrated numerically.     

Discrimination of quarry blasts and earthquakes in the vicinity of Istanbul using soft computing techniques

The purpose of this article is to demonstrate the use of feedforward neural networks (FFNNs), adaptive neural fuzzy inference systems (ANFIS), and probabilistic neural networks (PNNs) to discriminate between earthquakes and quarry blasts in Istanbul and vicinity (the Marmara region). The tectonically active Marmara region is affected by the Thrace-Eski?ehir fault zone and especially the North Anatolian fault zone (NAFZ). Local MARNET stations, which were established in 1976 and are operated by the Kandilli Observatory and Earthquake Research Institute (KOERI), record not only earthquakes that occur in the region, but also quarry blasts. There are a few quarry-blasting areas in the Gaziosmanpa?a, Çatalca, Ömerli, and Hereke regions. Analytical methods were applied to a set of 175 seismic events (2001-2004) recorded by the stations of the local seismic network (ISK, HRT, and CTT stations) operated by the KOERI National Earthquake Monitoring Center (NEMC). Out of a total of 175 records, 148 are related to quarry blasts and 27 to earthquakes. The data sets were divided into training and testing sets for each region. In all the models developed, the input vectors consist of the peak amplitude ratio (S/P ratio) and the complexity value, and the output is a determination of either earthquake or quarry blast. The success of the developed models on regional test data varies between 97.67% and 100%.     

CCS-MAC: Exploiting the overheard data for compression in wireless sensor networks

Both the overhearing and overhearing avoidance in a densely distributed sensor network may inevitably incur considerable power consumption. In this paper we propose a so-called CCS-MAC (collaborative compression strategy-based MAC) MAC protocol which facilitates to exploit those overheard data that is treated useless in traditional MAC protocols for the purpose of cost and energy savings. Particularly the CCS-MAC enables different sensor nodes to perform data compression cooperatively with regard to those overheard data, so that the redundancy of data prepared for the link layer transmission can be totally eliminated at the earliest. The problem of collaborative compression is analyzed and discussed along with a corresponding linear programming model formulated. Based on it a heuristic node-selection algorithm with a time complexity of (O(N²)) is proposed to the solve the linear programming problem. The node-selection algorithm is implemented in CCS-MAC at each sensor node in a distributed manner. The experiment results verify that the proposed CCS-MAC scheme can achieve a significant energy savings so as to prolong the lifetime of the sensor networks so far.     

Function point measurement from Web application source code based on screen transitions and database accesses

A function point (FP) is a unit of measurement that expresses the degree of functionality that an information system provides to a user. Many software organizations use FPs to estimate the effort required for software development. However, it is essential that the definition of 1 FP be based on the software development experience of the organization. In the present study, we propose a method by which to automatically extract data and transaction functions from Web applications under several conditions using static analysis. The proposed method is based on the International Function Point Users Group (IFPUG) method and has been developed as an FP measurement tool. We applied the proposed method to several Web applications and examined the difference between FP counts obtained by the tool and those obtained by a certified FP specialist (CFPS). The results reveal that the numbers of data and transaction functions extracted by the tool is approximately the same as the numbers of data and transaction functions extracted by the specialist.     

Property specifications for workflow modelling

Previously we provided two formal behavioural semantics for the Business Process Modelling Notation (BPMN) in the process algebra CSP. By exploiting CSP’s refinement orderings, developers may formally compare their BPMN models. However, BPMN is not a specification language, and it is difficult and sometimes impossible to use it to construct behavioural properties against which other BPMN models may be verified. This paper considers a pattern-based approach to expressing behavioural properties. We describe a property specification language PL for capturing a generalisation of Dwyer et al.’s Property Specification Patterns, and present a translation from PL into a bounded, positive fragment of linear temporal logic, which can then be automatically translated into CSP for simple refinement checking. We present a detailed example studying the behavioural properties of an airline ticket reservation business process. Using the same example we also describe some recent results on expressing behavioural compatibility within our semantic models. These results lead to a compositional approach for ensuring deadlock freedom of interacting business processes.     

A global structural optimization technique using an interval method

This paper deals with a global optimization scheme for structural systems that require finite element analysis to evaluate the constraints or the objective function. The paper proposes a strategy for finding the global optimum using an interval method in conjunction with a multipoint function approximation. The highly nonlinear and nonconvex objective and constraint functions are first represented in the design space using linear and adaptive local approximations and these approximations are blended globally with the use of proper weighting functions. The interval method is then employed to trace the global optimum in the approximated function space. The procedure is tested with several examples with known global solutions and it is successfully applied to optimize the fiber-orientation angles of laminated composite plates for minimum deflections. Received December 22, 2000