Symmetry in scalar field topology

Study of symmetric or repeating patterns in scalar fields is important in scientific data analysis because it gives deep insights into the properties of the underlying phenomenon. Though geometric symmetry has been well studied within areas like shape processing, identifying symmetry in scalar fields has remained largely unexplored due to the high computational cost of the associated algorithms. We propose a computationally efficient algorithm for detecting symmetric patterns in a scalar field distribution by analysing the topology of level sets of the scalar field. Our algorithm computes the contour tree of a given scalar field and identifies subtrees that are similar. We define a robust similarity measure for comparing subtrees of the contour tree and use it to group similar subtrees together. Regions of the domain corresponding to subtrees that belong to a common group are extracted and reported to be symmetric. Identifying symmetry in scalar fields finds applications in visualization, data exploration, and feature detection. We describe two applications in detail: symmetry-aware transfer function design and symmetry-aware isosurface extraction.     

Selection of industrial robots using compromise ranking and outranking methods

Selection of a robot for a specific industrial application is one of the most challenging problems in real time manufacturing environment. It has become more and more complicated due to increase in complexity, advanced features and facilities that are continuously being incorporated into the robots by different manufacturers. At present, different types of industrial robots with diverse capabilities, features, facilities and specifications are available in the market. Manufacturing environment, product design, production system and cost involved are some of the most influencing factors that directly affect the robot selection decision. The decision maker needs to identify and select the best suited robot in order to achieve the desired output with minimum cost and specific application ability. This paper attempts to solve the robot selection problem using two most appropriate multi-criteria decision-making (MCDM) methods and compares their relative performance for a given industrial application. The first MCDM approach is ‘VIsekriterijumsko KOmpromisno Rangiranje’ (VIKOR), a compromise ranking method and the other one is ‘ELimination and Et Choice Translating REality’ (ELECTRE), an outranking method. Two real time examples are cited in order to demonstrate and validate the applicability and potentiality of both these MCDM methods. It is observed that the relative rankings of the alternative robots as obtained using these two MCDM methods match quite well with those as derived by the past researchers.     

A bandpass filter with adjustable bandwidth and predictable transmission zeros

In this article, a microstrip bandpass filter with an adjustable bandwidth and predictable transmission zeros is proposed. The proposed filter is implemented by combining two hairpin edge‐coupled resonators with interdigital capacitors. Compared to typical edge‐coupled filters, the proposed filter provides a wider bandwidth resulting from a higher coupling strength between its resonators. To further increase the coupling and consequently the bandwidth, a pair of etched slots in the ground plane is used. By adjusting the geometrical parameters of the interdigital capacitors and etched slots, the bandwidth can be easily adjusted. The filter features two transmission zeros, which are determined by means of the semi‐analytical model developed as part of this work. Furthermore, the proposed filters can be cascaded to obtain a sharper cutoff frequency response. Frequency responses of the filters from measurements are in good agreement with those simulated using IE3D in the 5–9 GHz range. © 2009 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2010.     

Automated dynamic detection of busy–wait synchronizations

With the advent of multicores, multithreaded programming has acquired increased importance. In order to obtain good performance, the synchronization constructs in multithreaded programs need to be carefully implemented. These implementations can be broadly classified into two categories: busy–wait and schedule‐based. For shared memory architectures, busy–wait synchronizations are preferred over schedule‐based synchronizations because they can achieve lower wakeup latency, especially when the expected wait time is much shorter than the scheduling time. While busy–wait synchronizations can improve the performance of multithreaded programs running on multicore machines, they create a challenge in program debugging, especially in detecting and identifying the causes of data races. Although significant research has been done on data race detection, prior works rely on one important assumption—the debuggers are aware of all the synchronization operations performed during a program run. This assumption is a significant limitation as multithreaded programs, including the popular SPLASH‐2 benchmark have busy–wait synchronizations such as barriers and flag synchronizations implemented in the user code. We show that the lack of knowledge of these synchronization operations leads to unnecessary reporting of numerous races. To tackle this problem, we propose a dynamic technique for identifying user‐defined synchronizations that are performed during a program run. Both software and hardware implementations are presented. Furthermore, our technique can be easily exploited by a record/replay system to significantly speedup the replay. It can also be leveraged by a transactional memory system to effectively resolve a livelock situation. Our evaluation confirms that our synchronization detector is highly accurate with no false negatives and very few false positives. We further observe that the knowledge of synchronization operations results in 23% reduction in replay time. Finally, we show that using synchronization knowledge livelocks can be efficiently avoided during runtime monitoring of programs. Copyright © 2009 John Wiley & Sons, Ltd.     

Identifying and overcoming the challenges of implementing a project management office

With the ongoing challenge of successfully managing information technology (IT) projects, organizations are recognizing the need for greater project management discipline. For many organizations, this has meant ratcheting up project management skills, processes, and governance structures by implementing a project management office (PMO). While anecdotal evidence suggests that implementing a PMO can be quite difficult, few studies discuss the specific challenges involved, and how organizations can overcome them. To address this gap in existing knowledge, we conducted a Delphi study to (1) identify the challenges of implementing a PMO for managing IT projects, (2) rank these challenges in order of importance, (3) discover ways in which some organizations have overcome the top-ranked challenges, and (4) understand the role of PMO structure, metrics, and tools in the implementation of a PMO.We identified 34 unique challenges to implementing a PMO and refined this list to 13 challenges that our Delphi panelists considered most important. The top-three challenges were (1) rigid corporate culture and failure to manage organizational resistance to change, (2) lack of experienced project managers (PMs) and PMO leadership, and (3) lack of appropriate change management strategy. Through follow-up interviews with selected panelists, we identified a series of actions that can be taken to overcome these challenges including having a strong PMO champion, starting small and demonstrating the value of the PMO, obtaining support from opinion leaders, hiring an experienced program manager who understands the organization, bringing the most talented PMs into the PMO implementation team, adopting a flexible change management strategy, and standardizing processes prior to PMO implementation. The interviews were also used to better understand the role of PMO structure, metrics, and tools. In terms of PMO structure, we found that ‘light’ PMOs were more likely to be implemented successfully. Most organizations eschew formal metrics, instead relying on subjective indicators of PMO success. Lastly, it appears that PMO tools are difficult to implement unless a project management culture has been established.     

Intelligent adaptive observer-based optimal control of overhead transmission line de-icing robot manipulator

In cold season, wet snow ice accretion on overhead transmission lines increases wind load effects which in turn increases line tension. This increased line tension causes undesirable effects in power systems. This paper discusses the design of an observer-based boundary sliding mode control (BSMC) for 3 DOF overhead transmission line de-icing robot manipulator (OTDIRM). A robust radial basis functional neural network (RBFNN) observer-based neural network (NN) controller is developed for the motion control of OTDIRM, which is a combination of BSMC, NN approximation and adaptation law. The RBFNN-based adaptive observer is designed to estimate the positions and velocities. The weights of both NN observer and NN approximator are tuned off-line using particle swarm optimization. Using Lyapunov analysis the closed loop tracking error was verified for a 3 DOF OTDIRM. Finally, the robustness of the proposed neural network-based adaptive observer boundary sliding mode control (NNAOBSMC) was verified against the input disturbances and uncertainties.     

Universal instability modes in internal and external flows

Two prototypical external and internal flows have been studied which display linear temporal instability followed by nonlinear saturation taking the flows to a new equilibrium state. Direct simulation results are obtained using a specific formulation and numerical methods with very high accuracy. These results are analyzed via proper orthogonal decomposition (POD), which reveal similar modes for flow past a circular cylinder and flow inside a lid-driven cavity, indicating universality of such modes. Unlike many other efforts on reduced order modeling via POD, here the emphasis has been on understanding the physical aspect of the flow instability which requires very high accuracy of the simulation. Then, the obtained POD modes are related to the instability modes (in the classical sense of defining the latter) and new generic types of instability modes are identified in the studied external and internal flows. These new modes have been reported for flow past a circular cylinder [Sengupta TK, Singh N, Suman VK. Dynamical system approach to instability of flow past a circular cylinder. J Fluid Mech 2010;656:82–115] which help one in understanding the instability sequence and the relative importance of these modes in the flow evolution starting from an impulsive start. Present comparative study, furthermore, reveals universality of such instability modes by showing their presence for the flow inside a lid-driven cavity as well. Despite seeming dissimilarities between these two flows, similarities between the instability portrait of these two flows suggest universality of such modes. From the equilibrium amplitude of vorticity time-series, we establish the presence of multiple modes and multiple bifurcation sequences for these flows in parameter space. Existing theory due to Landau and Stuart that considers only a single dominant mode and its self-interaction does not explain all these features. We invoke a multi-modal interaction model in the cited reference above, termed as Landau–Stuart–Eckhaus (LSE) equation in recognition of Eckhaus’ work in modifying the classical Stuart–Landau equation. We also show that the new instability modes do not follow either the classical Stuart–Landau or the newly proposed LSE model equations and for this reason we call these as anomalous modes. Two specific classes of anomalous modes are identified and classified in the present work. Empirical expressions for the evolution of these anomalous modes are presented and their unambiguous role during instabilities is discussed.     

Timestamping messages and events in a distributed system using synchronous communication

Determining order relationship between events of a distributed computation is a fundamental problem in distributed systems which has applications in many areas including debugging, visualization, checkpointing and recovery. Fidge/Mattern’s vector-clock mechanism captures the order relationship using a vector of size N in a system consisting of N processes. As a result, it incurs message and space overhead of N integers. Many distributed applications use synchronous messages for communication. It is therefore natural to ask whether it is possible to reduce the timestamping overhead for such applications. In this paper, we present a new approach for timestamping messages and events of a synchronously ordered computation, that is, when processes communicate using synchronous messages. Our approach depends on decomposing edges in the communication topology into mutually disjoint edge groups such that each edge group either forms a star or a triangle. We show that, to accurately capture the order relationship between synchronous messages, it is sufficient to use one component per edge group in the vector instead of one component per process. Timestamps for events are only slightly bigger than timestamps for messages. Many common communication topologies such as ring, grid and hypercube can be decomposed into edge groups, resulting in almost 50% improvement in both space and communication overheads. We prove that the problem of computing an optimal edge decomposition of a communication topology is NP-complete in general. We also present a heuristic algorithm for computing an edge decomposition whose size is within a factor of two of the optimal. We prove that, in the worst case, it is not possible to timestamp messages of a synchronously ordered computation using a vector containing fewer than components when N ≥ 2. Finally, we show that messages in a synchronously ordered computation can always be timestamped in an offline manner using a vector of size at most . An earlier version of this paper appeared in 2002 Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS). The author V. K. Garg was supported in part by the NSF Grants ECS-9907213, CCR-9988225, an Engineering Foundation Fellowship. This work was done while the author C. Skawratananond was a Ph.D. student at the University of Texas at Austin.     

Efficient computation of Morse-Smale complexes for three-dimensional scalar functions

The Morse-Smale complex is an efficient representation of the gradient behavior of a scalar function, and critical points paired by the complex identify topological features and their importance. We present an algorithm that constructs the Morse-Smale complex in a series of sweeps through the data, identifying various components of the complex in a consistent manner. All components of the complex, both geometric and topological, are computed, providing a complete decomposition of the domain. Efficiency is maintained by representing the geometry of the complex in terms of point sets.     

Residual phosphate fertilizer compounds in soils

A variety of P compounds can accumulate in soils as residues of fertilizer and may influence soil test versus plant yield relationships. This work evaluates specific chemical extractants for their capacity to identify such Al, Fe and Ca phosphates in soils as a basis for increasing the precision of yield prediction. Aluminium phosphate, iron phosphate, calcium phosphate (apatite) and P sorbed onto gibbsite, goethite and calcite were added to four Western Australian lateritic soils. These soils were then subjected to sequential selective extraction using a modified Chang and Jackson procedure in order to evaluate the selectivity of these extractants for the different forms of P with the sequence of extraction: 1 M NH₄Cl, 0.5 M NH₄F, 0.1 M NaOH + 1 M NaCl, citrate-dithionite-bicarbonate (CDB), 1 M NaOH and 1 M HCl. The results show that the procedure is not sufficiently specific and thus might be of little value for estimating the forms and amounts of residues of phosphate rock fertilizers in soils.