Partitioning large networks without breaking communities

The identification of cohesive communities is a key process in social network analysis. However, the algorithms that are effective for finding communities do not scale well to very large problems, as their time complexity is worse than linear in the number of edges in the graph. This is an important issue for those interested in applying social network analysis techniques to very large networks, such as networks of mobile phone subscribers. In this respect, the contributions of this paper are twofold. First, we demonstrate these scaling issues using a prominent community-finding algorithm as a case study. Then, we show that a two-stage process, whereby the network is first decomposed into manageable subnetworks using a multilevel graph partitioning procedure, is effective in finding communities in networks with more than 10⁶ nodes.     

Stacking graphic elements to avoid over-plotting

An ongoing challenge for information visualization is how to deal with over-plotting forced by ties or the relatively limited visual field of display devices. A popular solution is to represent local data density with area (bubble plots, treemaps), color (heatmaps), or aggregation (histograms, kernel densities, pixel displays). All of these methods have at least one of three deficiencies:1) magnitude judgments are biased because area and color have convex downward perceptual functions, 2) area, hue, and brightness have relatively restricted ranges of perceptual intensity compared to length representations, and/or 3) it is difficult to brush or link to individual cases when viewing aggregations. In this paper, we introduce a new technique for visualizing and interacting with datasets that preserves density information by stacking overlapping cases. The overlapping data can be points or lines or other geometric elements, depending on the type of plot. We show real-dataset applications of this stacking paradigm and compare them to other techniques that deal with over-plotting in high-dimensional displays.     

FracMAP: A user-interactive package for performing simulation and orientation-specific morphology analysis of fractal-like solid nano-agglomerates

Computer simulation techniques have found extensive use in establishing empirical relationships between three-dimensional (3d) and two-dimensional (2d) projected properties of particles produced by the process of growth through the agglomeration of smaller particles (monomers). In this paper, we describe a package, FracMAP, that has been written to simulate 3d quasi-fractal agglomerates and create their 2d pixelated projection images by restricting them to stable orientations as commonly encountered for quasi-fractal agglomerates collected on filter media for electron microscopy. Resulting 2d images are analyzed for their projected morphological properties.

Program summary

Program title: FracMAPCatalogue identifier: AEDD_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDD_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 4722No. of bytes in distributed program, including test data, etc.: 27 229Distribution format: tar.gzProgramming language: C++Computer: PCOperating system: Windows, LinuxRAM: 2.0 MegabytesClassification: 7.7Nature of problem: Solving for a suitable fractal agglomerate construction under constraints of typical morphological parameters.Solution method: Monte Carlo approximation.Restrictions: Problem complexity is not representative of run-time, since Monte Carlo iterations are of a constant complexity.Additional comments: The distribution file contains two versions of the FracMAP code, one for Windows and one for Linux.Running time: 1 hour for a fractal agglomerate of size 25 on a single processor.     

A Unified Variational Volume Registration Method Based on Automatically Learned Brain Structures

We introduce a new volumetric registration technique that effectively combines active surfaces with the finite element method. The method simultaneously aligns multi-label automatic structural segmentation results, which can be obtained by the application of existing segmentation software, to produce an anatomically accurate 3D registration. This registration is obtained by the minimization of a single energy functional. Just like registering raw images, obtaining a 3D registration this way still requires solving a fundamentally ill-posed problem. We explain through academic examples as well as an MRI dataset with manual anatomical labels, which are hidden from the registration method, how the quality of a registration method can be measured and the advantages our approach offers.     

Tri‐band composite cylindrical dielectric resonator antenna with hybrid mode excitation and cross‐polarization suppression

This communication investigates composite cylindrical dielectric resonator antenna (CDRA) for various wireless applications. Three important features of proposed antenna design are (i) realization of two different hybrid modes, that is, HEM_11δ and HEM_12δ mode in CDRA with the help of modified annular ring printed line (work as both magnetic dipole and electric dipole), both the hybrid modes support broadside radiation characteristics (ii) suppression of HEM_21δ mode, in order to reduce the cross‐polarization level in H‐plane of other hybrid modes (HEM_11δ and HEM_12δ mode) by an amount of 8‐10 dB (iii) creation of triple‐band attribute using the concept of composite antenna. The proposed antenna design has been fabricated and practically tested. Simulated outcomes show good agreement with measured outcomes. It works in three frequency bands, that is, 2.25‐2.79 GHz, 3.1‐4.0 GHz, and 5.05‐5.6 GHz. The designed antenna structure is appropriate for WLAN and WiMAX applications.     

AutoTutor: Incorporating Back-Channel Feedback and Other Human-Like Conversational Behaviors into an Intelligent Tutoring System

This paper describes our recent attempts to incorporate human-like conversational behaviors into the dialog moves delivered by an animated pedagogical agent that simulates human tutors. We first present a brief overview of the modules comprising AutoTutor, an intelligent tutoring system. The second section describes a set of conversational behaviors that are being incorporated into AutoTutor. The behaviors of interest involve variations in intonation, head movements, arm and hand movements, facial expressions, eye blinking, gaze direction, and back-channel feedback. The final section presents a recent empirical study concerned with back-channel feedback events during human-to-human tutoring sessions. The back-channel feedback events emitted by tutors are mostly positive (63%), mostly verbal (77%), and immediately follow speech-act boundaries or noun-phrase boundaries (83%). Tutors also deliver back-channelevents at a very high rate when students are emitting dialog, about 13 events per minute. Conversely, 88% of students' back-channel feedback events are head nods, and they occur at unbounded locations (63%).     

Towards the development of a virtual environment-based training system for mechanical assembly operations

In this paper, we discuss the development of Virtual Training Studio (VTS), a virtual environment-based training system that allows training supervisors to create training instructions and allows trainees to learn assembly operations in a virtual environment. Our system is mainly focused on the cognitive side of training so that trainees can learn to recognize parts, remember assembly sequences, and correctly orient the parts during assembly operations. Our system enables users to train using the following three training modes: (1) Interactive Simulation, (2) 3D Animation, and (3) Video. Implementing these training modes required us to develop several new system features. This paper presents an overview of the VTS system and describes a few main features of the system. We also report user test results that show how people train using our system. The user test results indicate that the system is able to support a wide variety of training preferences and works well to support training for assembly operations.

---

Study of variational inequality and equality formulations for elastostatic frictional contact problems

Summary An overview ofvariational inequality andvariational equality formulations for frictionless contact and frictional contact problems is provided. The aim is to discuss the state-of-the-art in these two formulations and clearly point out their advantages and disadvantages in terms of mathematical completeness and practicality. Various terms required to describe the contact configuration are defined.Unilateral contact law and classical Coulomb’s friction law are given.Elastostatic frictional contact boundary value problem is defined. General two-dimensional frictionless and frictional contact formulations for elastostatic problems are investigated. An example problem of a two bar truss-rigid wall frictionless contact system is formulated as an optimization problem based on the variational inequality approach. The problem is solved in a closed form using the Karush-Kuhn-Tucker (KKT) optimality conditions. The example problem is also formulated as a frictional contact system. It is solved in the closed form using a new two-phase analytical procedure. The procedure avoids use of the incremental/iterative techniques and user defined parameters required in a typical implementation based on the variational equality formulation. Numerical solutions for the frictionless and frictional contact problems are compared with the results obtained by using a general-purpose finite element program ANSYS (that uses variational equality formulation). ANSYS results match reasonably well with the solutions of KKT optimality conditions for the frictionless contact problem and the two-phase procedure for the frictional contact problem. The validity of the analytical formulation for frictional contact problems (with one contacting node) is verified. Thevariational equality formulation for frictionless and frictional, contact problems is also studied in detail. The incremental/iterative Newton-Raphson scheme incorporating the penalty approach is utilized. Studies are conducted to provide insights for the numerical solution techniques. Based on the present study it is concluded that alternate formulations and computational procedures need to be developed for analysis of frictional contact problems.     

Influence of Silicon Morphology and Mechanical Properties of Piston Alloys

In this paper, the influence of silicon particle morphology on mechanical properties of two piston alloys has been reported. Alloys having nominal composition Al-12%Si-1%Ni-0.8%Cu-0.6%Mg (LM13) and Al-17%Si-1%Ni-0.8%Cu-0.6%Mg (LM28) were prepared by melting and casting. The morphology of silicon crystals was changed using additives during the melt treatment and subsequently by heat treatment. Mechanical properties such as hardness, ductility, and tensile strength of experimental alloys were tested. Test results showed that the melt treatment and heat treatment of both the alloys increased the tensile strength, hardness, and ductility. However, the influence of melt treatment on mechanical properties was not as significant as that of heat treatment. Tensile strength and ductility of LM13 was found to be higher than the LM28 alloy under similar conditions. Hardness of LM28 was higher than the LM13 alloy. Optical and SEM studies showed a change in eutectic silicon morphology on melt treatment of LM13. However, change in morphology of primary silicon particles was not significant as for LM28. Heat treatment of both alloys caused spheroidization and better distribution of eutectic silicon crystals. Sharp-edged primary silicon particles were rounded off after the heat treatment of LM28. Scanning electron microscopy (SEM) of tensile fractured surfaces was carried out to study the influence of microstructure on fracture mode. Heat treatment of both alloys promotes dimple fracture. However, as-cast and melt-treated alloys show predominantly cleavage fracture.     

Querying websites using compact skeletons

Several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or XML documents. Much research has been devoted to this problem, resulting in several research prototypes and commercial implementations. Such systems rely on wrappers that provide relational or other structured interfaces to websites. Traditionally, wrappers have been constructed by hand on a per-website basis, constraining the scalability of the system. We introduce a website structure inference mechanism called compact skeletons that is a step in the direction of automated wrapper generation. Compact skeletons provide a transformation from websites or other hierarchical data, such as XML documents, to relational tables. We study several classes of compact skeletons and provide polynomial-time algorithms and heuristics for automated construction of compact skeletons from websites. Experimental results show that our heuristics work well in practice. We also argue that compact skeletons are a natural extension of commercially deployed techniques for wrapper construction.