Direct 5-axis tool-path generation from point cloud input using 3D biarc fitting

In reverse engineering, geometrical information of a product is obtained directly from a physical shape by a digitizing device. To fabricate the product, manufacturing information (usually tool-path) must be generated from a CAD model. The data digitized must be processed and in most cases, a surface model is constructed from them using some of the surface fitting technologies. However, these technologies are usually complicated and the process for constructing a surface patch from a massive digitizing data is time-consuming. To simplify the process for getting tool-path information, a simple algorithm is proposed in this paper. The algorithm is used to generate a 5-axis machining tool-path. Instead of implementing any complicated surface fitting techniques, a direct method is proposed for constructing three-dimensional (3D) triangular mesh from the digitizing data with the mesh points considered as the tool contact locations. Depending on the locations of the points digitized, a decimation procedure is applied such that some of the digitizing data will be filtered out. Then, the tool axis orientations which must be determined in 5-axis tool-path are calculated and the tool center locations are determined accordingly. A 3D biarc fitting technique is applied for all the tool center locations so that a complete 5-axis tool-path is obtained.     

Analysis and scheduling of practical network coding in OFDMA relay networks

Network coding has become a prominent approach to improve throughput of wireless networks. However, most of work in the literature concentrates mainly on 802.11-like random access networks. New technologies such as OFDMA (orthogonal frequency division multiple access), offer new opportunities for employing network coding. This paper considers how to apply the practical network coding scheme in OFDMA relay networks via cross-layer optimization. Specifically, we aim to explore the following questions: (1) When and how can wireless nodes select relay paths in the presence of network coding? (2) How can an OFDMA relay system assign network resource such as subcarrier and power for all the transmitting nodes? (3) What are the impacts of OFDMA system parameters on the network coding gain? To answer these questions, two efficient coding-aware relay strategies are presented to select forwarding paths with fixed and dynamic power allocation. In order to exploit the network capacity in slow frequency selective fading channels, we formulate optimization frameworks and propose channel-aware coding-aware resource allocation algorithms for an arbitrary traffic pattern. Our studies show that the network coding (i.e. XOR) gain depends on the nodes’ powers, traffic patterns etc. Especially, OFDMA relay network with dynamic power possesses both coding gain and power gain. Extensive simulations are performed to verify our analysis and demonstrate the throughput improvement of our proposals in the presence of XOR coding.     

Global sliding‐mode control with generalized sliding dynamics

A global sliding‐mode control (GSMC) scheme is proposed to provide a framework for ensuring the existence of a sliding mode throughout an entire response. Based on this framework, robust eigenvalue‐assignment GSMC (REA‐GSMC) is proposed to robustly assign closed‐loop eigenvalues that must be real. The eigenvalues being all real, however, leads to sluggish responses. According to most error criteria such as IAE, ISE, and ITAE, the optimum system should have complex eigenvalues. This paper proposes a GSMC scheme with generalized sliding dynamics, referred to as Generalized GSMC, in order to release the previous constraint on the REA‐GSMC. Thus, the Generalized GSMC can be designed to achieve a system that is both robust and optimum in the sense that it minimizes certain error performance indices in spite of the presence of system uncertainties. Experiments were conducted on a two‐link direct‐drive manipulator to demonstrate the effectiveness of the proposed scheme. Copyright © 2009 John Wiley and Sons Asia Pte Ltd and Chinese Automatic Control Society     

Correlated light scattering by a dense distribution of condensation droplets on a window pane

An analytical model of the scattering structure factor for an assembly of noninteracting hard disks has recently appeared in the literature [Phys. Rev. A 42, 5978-5989 (1990)]. We employ this model to calculate correlated light scattering by monodispersions and binary mixtures of condensation droplets on a window pane. We find that an area fraction of ? ≥ 0.6 is required for producing the near-forward direction scattering suppression and that a moderately wide polydispersion of droplet sizes is capable of producing the experimentally observed bright ring of colored light.     

Img2Logo: Generating Golden Ratio Logos from Images

Logos are one of the most important graphic design forms that use an abstracted shape to clearly represent the spirit of a community. Among various styles of abstraction, a particular golden-ratio design is frequently employed by designers to create a concise and regular logo. In this context, designers utilize a set of circular arcs with golden ratios (i.e., all arcs are taken from circles whose radii form a geometric series based on the golden ratio) as the design elements to manually approximate a target shape. This error-prone process requires a large amount of time and effort, posing a significant challenge for design space exploration. In this work, we present a novel computational framework that can automatically generate golden ratio logo abstractions from an input image. Our framework is based on a set of carefully identified design principles and a constrained optimization formulation respecting these principles. We also propose a progressive approach that can efficiently solve the optimization problem, resulting in a sequence of abstractions that approximate the input at decreasing levels of detail. We evaluate our work by testing on images with different formats including real photos, clip arts, and line drawings. We also extensively validate the key components and compare our results with manual results by designers to demonstrate the effectiveness of our framework. Moreover, our framework can largely benefit design space exploration via easy specification of design parameters such as abstraction levels, golden circle sizes, etc.     

Managing sequential ambidexterity in the electronics industry: roles of temporal switching capability and contingent factors

Researchers on organisational ambidexterity have proposed several solutions to address the potential conflicts between exploration activities and exploitation activities. Unlike simultaneous ambidexterity, sequential ambidexterity – defined as temporal switching between exploration and exploitation – has not been examined fully, and the conditions under which this temporal switching can be successful are unclear. This paper proposes the concept of temporal switching capability to better understand the process by which sequential ambidexterity is executed. In addition, we hypothesise that performance effects are contingent upon firm-specific factors: a firm’s business strategy and absorptive capacity. Utilising three sources of data – a secondary database, annual reports and a survey administered to 145 firms in the electronics industry with 10-year observations – we find support for our hypotheses. The results show that the temporal switching capability positively relates to new product performance and that business strategy type and absorptive capacity have moderating effects. The results are meaningful in both theory and practice.     

A multi-streaming SIMD multimedia computing engine

Current multimedia extensions provide a mechanism for general-purpose processors to meet the growing performance demand of multimedia applications. However, the computing performance of these extensions is often limited for the design conceptions of the single data stream. This paper presents an architecture called “multi-streaming SIMD” that enables current multimedia extensions to simultaneously manipulate multiple data streams. To efficiently and flexibly realize the proposed architecture, an operation cell is designed by fusing the logic gates and the storage cells together. Multiple operation cells then are connected to compose a register file with the ability of performing SIMD operations called “Multimedia Operation Storage Unit (MOSU)”. Further, many MOSUs are used to compose a multi-streaming SIMD computing engine that can simultaneously manipulate multiple data streams and exploit the subword parallelisms of the elements in each data stream. This paper also designs three instruction modes (global, coupling, and isolated modes) for programmers to dynamically configure the multi-streaming SIMD computing engine at the instruction level to manipulate different amounts of data streams. Simulation results show that when the multi-streaming SIMD architecture has four 4-register MOSUs, it provides a factor of 3.3×–5.5× performance enhancement for traditional MMX extensions on 12 multimedia kernels.     

Robust planning in optimization for production system subject to random machine breakdown and failure in rework

This study is concerned with robust planning in optimization, specifically in determining the optimal run time for production system that is subject to random breakdowns under abort/resume (AR) control policy and failure in rework. In most real-life production processes, generation of defective items and breakdowns of manufacturing equipment are inevitable. In this study, random defective rate is assumed and all manufactured items are screened. The perfect quality, reworkable and scrap items are identified and separated; failure-in-rework is assumed. The system is also subject to random machine breakdown; and when it occurs, the AR policy is adopted. Under such policy, the production of the interrupted lot will be immediately resumed when the machine is restored. Mathematical modeling and derivation of the production-inventory cost functions for both systems with/without breakdowns are presented. The renewal reward theorem is used to cope with the variable cycle length when integrating cost functions. The long-run average cost per unit time is obtained. Theorems on convexity and on bounds of production run time are proposed and proved. A recursive searching algorithm is developed for locating the optimal run time that minimizes the expected production-inventory costs. A numerical example with sensitivity analysis is provided to give insight into the optimal operational control of such an unreliable system.