Formation of ω-Al7Cu2Fe phase during laser processing of quasicrystal-forming Al-Cu-Fe alloy

The formation of an ω-Al7Cu2Fe phase during laser cladding of quasicrystal-forming Al65Cu23.3Fe11.7 alloy on a pure aluminium substrate is reported. This phase is found to nucleate at the periphery of primary icosahedral-phase particles. A large number of ω-phase particles form an envelope around the icosahedral phase. On the outer side, they form an interface with an agr-Al solid solution. Detailed transmission electron microscopic observations show that the ω phase exhibits an orientation relationship with the icosahedral phase. Analysis of experimental results suggests that the ω phase forms by precipitation on an icosahedral phase by heterogeneous nucleation and grows into the aluminium-rich melt until supersaturation is exhausted. The microstructural observations are explained in terms of available models of phase transformations.

Brain imaging of chronic pain

Acute pain has substantial survival value because of its protective function in the everyday environment. Instead, chronic pain lacks survival and adaptive function, causes great amount of individual suffering, and consumes the resources of the society due to the treatment costs and loss of production. The treatment of chronic pain has remained challenging because of inadequate understanding of mechanisms working at different levels of the nervous system in the development, modulation, and maintenance of chronic pain. Especially in unclear chronic pain conditions the treatment may be suboptimal because it can not be targeted to the underlying mechanisms. Noninvasive neuroimaging techniques have greatly contributed to our understanding of brain activity associated with pain in healthy individuals. Many previous studies, focusing on brain activations to acute experimental pain in healthy individuals, have consistently demonstrated a widely-distributed network of brain regions that participate in the processing of acute pain. The aim of the present thesis was to employ non-invasive brain imaging to better understand the brain mechanisms in patients suffering from chronic pain. In Study I, we used magnetoencephalography (MEG) to measure cortical responses to painful laser stimulation in healthy individuals for optimization of the stimulus parameters for patient studies. In Studies II and III, we monitored with MEG the cortical processing of touch and acute pain in patients with complex regional pain syndrome (CRPS). We found persisting plastic changes in the hand representation area of the primary somatosensory (SI) cortex, suggesting that chronic pain causes cortical reorganization. Responses in the posterior parietal cortex to both tactile and painful laser stimulation were attenuated, which could be associated with neglect-like symptoms of the patients. The primary motor cortex reactivity to acute pain was reduced in patients who had stronger spontaneous pain and weaker grip strength in the painful hand. The tight coupling between spontaneous pain and motor dysfunction supports the idea that motor rehabilitation is important in CRPS. In Studies IV and V we used MEG and functional magnetic resonance imaging (fMRI) to investigate the central processing of touch and acute pain in patients who suffered from recurrent herpes simplex virus infections and from chronic widespread pain in one side of the body. With MEG, we found plastic changes in the SI cortex, suggesting that many different types of chronic pain may be associated with similar cortical reorganization. With fMRI, we found functional and morphological changes in the central pain circuitry, as an indication of central contribution for the pain. These results show that chronic pain is associated with morphological and functional changes in the brain, and that such changes can be measured with functional imaging.

High-rate, Single-Symbol Decodable Distributed STBCs for Partially-Coherent Cooperative Networks

Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of an the channels and the relays have only the phase information of the source-to-relay channels. In our earlier work, we had derived a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC. Using these conditions, in this paper we show that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from 2/N when the relays do not have CSI to 1/2, which is independent of N. We also show that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property. Using this property we are able to construct codes that are SSD and have higher rate than 2/N but giving full diversity only for signal constellations satisfying certain conditions.

Hot deformation behaviour of Mg–3Al alloy—A study using processing map

The hot deformation behaviour of Mg–3Al alloy has been studied using the processing-map technique. Compression tests were conducted in the temperature range 250–550 °C and strain rate range 3 × 10−4 to 102 s−1 and the flow stress data obtained from the tests were used to develop the processing map. The various domains in the map corresponding to different dissipative characteristics have been identified as follows: (i) grain boundary sliding (GBS) domain accommodated by slip controlled by grain boundary diffusion at slow strain-rates (<10−3 s−1) in the temperature range from 350 to 450 °C, (ii) two different dynamic recrystallization (DRX) domains with a peak efficiency of 42% at 550 °C/10−1 s−1 and 425 °C/102 s−1 governed by stress-assisted cross-slip and thermally activated climb as the respective rate controlling mechanisms and (iii) dynamic recovery (DRV) domain below 300 °C in the intermediate strain rate range from 3 × 10−2 to 3 × 10−1 s−1. The regimes of flow instability have also been delineated in the processing map using an instability criterion. Adiabatic shear banding at higher strain rates (>101 s−1) and solute drag by substitutional Al atoms at intermediate strain rates (3 × 10−2 to 3 × 10−1 s−1) in the temperature range (350–450 °C) are responsible for flow instability. The relevance of these mechanisms with reference to hot working practice of the material has been indicated. The processing maps of Mg–3Al alloy and as-cast Mg have been compared qualitatively to elucidate the effect of alloying with aluminum on the deformation behaviour of magnesium.

Interactive Distributed Source Coding in Asymmetric Communication Scenarios

We provide a new unified framework, called "multiple correlated informants - single recipient" communication, to address the variations of the traditional Distributed Source Coding (DSC) problem. Different combinations of the assumptions about the communication scenarios and the objectives of communication result in different variations of the DSC problem. For each of these variations, the complexities of communication and computation of the optimal solution is determined by the combination of the underlying assumptions. In the proposed framework, we address the asymmetric, interactive, and lossless variant of the DSC problem, with various objectives of communication and provide optimal solutions for those. Also, we consider both, the worst-case and average-case scenarios.

Low-Temperature Processing of ZrB2-ZrC Composites by Reactive Hot Pressing

Dense ZrB2-ZrC and ZrB2-ZrC x∼0.67 composites have been produced by reactive hot pressing (RHP) of stoichiometric and nonstoichiometric mixtures of Zr and B4C powders at 40 MPa and temperatures up to 1600 °C for 30 minutes. The role of Ni addition on reaction kinetics and densification of the composites has been studied. Composites of ∼97 pct relative density (RD) have been produced with the stoichiometric mixture at 1600 °C, while the composite with ∼99 pct RD has been obtained with excess Zr at 1200 °C, suggesting the formation of carbon deficient ZrC x that significantly aids densification by plastic flow and vacancy diffusion mechanism. Stoichiometric and nonstoichiometric composites have a hardness of ∼20 GPa. The grain sizes of ZrB2 and ZrC x∼0.67 are ∼0.6 and 0.4 μm, respectively, which are finer than those reported in the literature.

OFDM Based Distributed Space Time Coding for Asynchronous Relay Networks

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This transmission scheme is amazingly simple and achieves a diversity order of two for any number of relays. Motivated by its simplicity, this scheme is extended to a more general transmission scheme that can achieve full cooperative diversity for any number of relays. The conditions on the distributed space time block code (DSTBC) structure that admit its application in the proposed transmission scheme are identified and it is pointed out that the recently proposed full diversity four group decodable DST-BCs from precoded co-ordinate interleaved orthogonal designs and extended Clifford algebras satisfy these conditions. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Finally, four group decodable distributed differential space time block codes applicable in this new transmission scheme for power of two number of relays are also provided.

Mesh Processing for Computerized Facial Anthropometry

Understanding of the shape and size of different features of the human body from scanned data is necessary for automated design and evaluation of product ergonomics. In this paper, a computational framework is presented for automatic detection and recognition of important facial feature regions, from scanned head and shoulder polyhedral models. A noise tolerant methodology is proposed using discrete curvature computations, band-pass filtering, and morphological operations for isolation of the primary feature regions of the face, namely, the eyes, nose, and mouth. Spatial disposition of the critical points of these isolated feature regions is analyzed for the recognition of these critical points as the standard landmarks associated with the primary facial features. A number of clinically identified landmarks lie on the facial midline. An efficient algorithm for detection and processing of the midline, using a point sampling technique, is also presented. The results obtained using data of more than 20 subjects are verified through visualization and physical measurements. A color based and triangle skewness based schemes for isolation of geometrically nonprominent features and ear region are also presented. [DOI: 10.1115/1.3330420]

Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks

We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a function of the measurements and communicating it to an operator station. We restrict ourselves to the class of type-threshold functions (as defined in the work of Giridhar and Kumar, 2005), of which max, min, and indicator functions are important examples: our discussions are couched in terms of the max function. We view the problem as one of message-passing distributed computation over a geometric random graph. The network is assumed to be synchronous, and the sensors synchronously measure values and then collaborate to compute and deliver the function computed with these values to the operator station. Computation algorithms differ in (1) the communication topology assumed and (2) the messages that the nodes need to exchange in order to carry out the computation. The focus of our paper is to establish (in probability) scaling laws for the time and energy complexity of the distributed function computation over random wireless networks, under the assumption of centralized contention-free scheduling of packet transmissions. First, without any constraint on the computation algorithm, we establish scaling laws for the computation time and energy expenditure for one-time maximum computation. We show that for an optimal algorithm, the computation time and energy expenditure scale, respectively, as Theta(radicn/log n) and Theta(n) asymptotically as the number of sensors n rarr infin. Second, we analyze the performance of three specific computation algorithms that may be used in specific practical situations, namely, the tree algorithm, multihop transmission, and the Ripple algorithm (a type of gossip algorithm), and obtain scaling laws for the computation time and energy expenditure as n rarr infin. In particular, we show that the computation time for these algorithms scales as Theta(radicn/lo- g n), Theta(n), and Theta(radicn log n), respectively, whereas the energy expended scales as , Theta(n), Theta(radicn/log n), and Theta(radicn log n), respectively. Finally, simulation results are provided to show that our analysis indeed captures the correct scaling. The simulations also yield estimates of the constant multipliers in the scaling laws. Our analyses throughout assume a centralized optimal scheduler, and hence, our results can be viewed as providing bounds for the performance with practical distributed schedulers.

A reverse Stroop task with mouse tracking

In a reverse Stroop task, observers respond to the meaning of a color word irrespective of the color in which the word is printed—for example, the word red may be printed in the congruent color (red), an incongruent color (e.g., blue), or a neutral color (e.g., white). Although reading of color words in this task is often thought to be neither facilitated by congruent print colors nor interfered with incongruent print colors, this interference has been detected by using a response method that does not give any bias in favor of processing of word meanings or processing of print colors. On the other hand, evidence for the presence of facilitation in this task has been scarce, even though this facilitation is theoretically possible. By modifying the task such that participants respond to a stimulus color word by pointing to a corresponding response word on a computer screen with a mouse, the present study investigated the possibility that not only interference but also facilitation would take place in a reverse Stroop task. Importantly, in this study, participants’ responses were dynamically tracked by recording the entire trajectories of the mouse. Arguably, this method provided richer information about participants’ performance than traditional measures such as reaction time and accuracy, allowing for more detailed (and thus potentially more sensitive) investigation of facilitation and interference in the reverse Stroop task. These trajectories showed that the mouse’s approach toward correct response words was significantly delayed by incongruent print colors but not affected by congruent print colors, demonstrating that only interference, not facilitation, was present in the current task. Implications of these findings are discussed within a theoretical framework in which the strength of association between a task and its response method plays a critical role in determining how word meanings and print colors interact in reverse Stroop tasks.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

Collecting data from distributed FOSS projects

A key trait of Free and Open Source Software (FOSS) development is its distributed nature. Nevertheless, two project-level operations, the fork and the merge of program code, are among the least well understood events in the lifespan of a FOSS project. Some projects have explicitly adopted these operations as the primary means of concurrent development. In this study, we examine the effect of highly distributed software development, is found in the Linux kernel project, on collection and modelling of software development data. We find that distributed development calls for sophisticated temporal modelling techniques where several versions of the source code tree can exist at once. Attention must be turned towards the methods of quality assurance and peer review that projects employ to manage these parallel source trees. Our analysis indicates that two new metrics, fork rate and merge rate, could be useful for determining the role of distributed version control systems in FOSS projects. The study presents a preliminary data set consisting of version control and mailing list data.

Collecting data from distributed FOSS projects

A key trait of Free and Open Source Software (FOSS) development is its distributed nature. Nevertheless, two project-level operations, the fork and the merge of program code, are among the least well understood events in the lifespan of a FOSS project. Some projects have explicitly adopted these operations as the primary means of concurrent development. In this study, we examine the effect of highly distributed software development, is found in the Linux kernel project, on collection and modelling of software development data. We find that distributed development calls for sophisticated temporal modelling techniques where several versions of the source code tree can exist at once. Attention must be turned towards the methods of quality assurance and peer review that projects employ to manage these parallel source trees. Our analysis indicates that two new metrics, fork rate and merge rate, could be useful for determining the role of distributed version control systems in FOSS projects. The study presents a preliminary data set consisting of version control and mailing list data.

Minimizing total weighted tardiness on a batch-processing machine with non-agreeable release times and due dates

This study considers the scheduling problem observed in the burn-in operation of semiconductor final testing, where jobs are associated with release times, due dates, processing times, sizes, and non-agreeable release times and due dates. The burn-in oven is modeled as a batch-processing machine which can process a batch of several jobs as long as the total sizes of the jobs do not exceed the machine capacity and the processing time of a batch is equal to the longest time among all the jobs in the batch. Due to the importance of on-time delivery in semiconductor manufacturing, the objective measure of this problem is to minimize total weighted tardiness. We have formulated the scheduling problem into an integer linear programming model and empirically show its computational intractability. Due to the computational intractability, we propose a few simple greedy heuristic algorithms and meta-heuristic algorithm, simulated annealing (SA). A series of computational experiments are conducted to evaluate the performance of the proposed heuristic algorithms in comparison with exact solution on various small-size problem instances and in comparison with estimated optimal solution on various real-life large size problem instances. The computational results show that the SA algorithm, with initial solution obtained using our own proposed greedy heuristic algorithm, consistently finds a robust solution in a reasonable amount of computation time.