Discovery of Spatial Periodicities in a Coronal Loop Using Automated Edge-Tracking Algorithms

A new method for automated coronal loop tracking, in both spatial and temporal domains, is presented. Applying this technique to TRACE data, obtained using the 171 angstrom filter on 1998 July 14, we detect a coronal loop undergoing a 270 s kink-mode oscillation, as previously found by Aschwanden et al. However, we also detect flare-induced, and previously unnoticed, spatial periodicities on a scale of 3500 km, which occur along the coronal loop edge. Furthermore, we establish a reduction in oscillatory power for these spatial periodicities of 45% over a 222 s interval. We relate the reduction in detected oscillatory power to the physical damping of these loop-top oscillations.

A Survey of Search Methodologies and Automated System Development for Examination Timetabling

Exam timetabling is one of the most important administrative activities that takes place in academic institutions. In this paper we present a critical discussion of the research on exam timetabling in the last decade or so. This last ten years has seen an increased level of attention on this important topic. There has been a range of significant contributions to the scientific literature both in terms of theoretical andpractical aspects. The main aim of this survey is to highlight the new trends and key research achievements that have been carried out in the last decade.We also aim to outline a range of relevant important research issues and challenges that have been generated by this body of work.

We first define the problem and review previous survey papers. Algorithmic approaches are then classified and discussed. These include early techniques (e.g. graph heuristics) and state-of-the-art approaches including meta-heuristics, constraint based methods, multi-criteria techniques, hybridisations, and recent new trends concerning neighbourhood structures, which are motivated by raising the generality of the approaches. Summarising tables are presented to provide an overall view of these techniques. We discuss some issues on decomposition techniques, system tools and languages, models and complexity. We also present and discuss some important issues which have come to light concerning the public benchmark exam timetabling data. Different versions of problem datasetswith the same name have been circulating in the scientific community in the last ten years which has generated a significant amount of confusion. We clarify the situation and present a re-naming of the widely studied datasets to avoid future confusion. We also highlight which research papershave dealt with which dataset. Finally, we draw upon our discussion of the literature to present a (non-exhaustive) range of potential future research directions and open issues in exam timetabling research.

Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems

In this paper, we present a random iterative graph based hyper-heuristic to produce a collection of heuristic sequences to construct solutions of different quality. These heuristic sequences can be seen as dynamic hybridisations of different graph colouring heuristics that construct solutions step by step. Based on these sequences, we statistically analyse the way in which graph colouring heuristics are automatically hybridised. This, to our knowledge, represents a new direction in hyper-heuristic research. It is observed that spending the search effort on hybridising Largest Weighted Degree with Saturation Degree at the early stage of solution construction tends to generate high quality solutions. Based on these observations, an iterative hybrid approach is developed to adaptively hybridise these two graph colouring heuristics at different stages of solution construction. The overall aim here is to automate the heuristic design process, which draws upon an emerging research theme on developing computer methods to design and adapt heuristics automatically. Experimental results on benchmark exam timetabling and graph colouring problems demonstrate the effectiveness and generality of this adaptive hybrid approach compared with previous methods on automatically generating and adapting heuristics. Indeed, we also show that the approach is competitive with the state of the art human produced methods.

Systematic Usage of Embedded Modelling Languages in Automated Model Transformation Chains

Annotation of programs using embedded Domain-Specific Languages (embedded DSLs), such as the program annotation facility for the Java programming language, is a well-known practice in computer science. In this paper we argue for and propose a specialized approach for the usage of embedded Domain-Specific Modelling Languages (embedded DSMLs) in Model-Driven Engineering (MDE) processes that in particular supports automated many-step model transformation chains. It can happen that information defined at some point, using an embedded DSML, is not required in the next immediate transformation step, but in a later one. We propose a new approach of model annotation enabling flexible many-step transformation chains. The approach utilizes a combination of embedded DSMLs, trace models and a megamodel. We demonstrate our approach based on an example MDE process and an industrial case study.

Automated detection and tracking of solar magnetic bright points

Magnetic bright points (MBPs) in the internetwork are among the smallest objects in the solar photosphere and appear bright against the ambient environment. An algorithm is presented that can be used for the automated detection of the MBPs in the spatial and temporal domains. The algorithm works by mapping the lanes through intensity thresholding. A compass search, combined with a study of the intensity gradient across the detected objects, allows the disentanglement of MBPs from bright pixels within the granules. Object growing is implemented to account for any pixels that might have been removed when mapping the lanes. The images are stabilized by locating long-lived objects that may have been missed due to variable light levels and seeing quality. Tests of the algorithm, employing data taken with the Swedish Solar Telescope, reveal that approximate to 90 per cent of MBPs within a 75 x 75 arcsec(2) field of view are detected.

Are Shy Adults Really Bolder Online? It Depends on the Context

We examined whether individual differences in shyness and context influenced the amount of computer-mediated self-disclosure and use of affective language during an unfamiliar dyadic social interaction. Unfamiliar young adults were selected for high and low self-reported shyness and paired in mixed dyads (one shy and one nonshy). Each dyad was randomly assigned to either a live webcam or no webcam condition. Participants then engaged in a 20-minute online free chat over the Internet in the laboratory. Free chat conversations were archived, and the transcripts were objectively coded for traditional communication variables, conversational style, and the use of affective language. As predicted, shy adults engaged in significantly fewer spontaneous self-disclosures than did their nonshy counterparts only in the webcam condition. Shy versus nonshy adults did not differ on spontaneous self-disclosures in the no webcam condition. However, context did not influence the use of computer-mediated affective language. Although shy adults used significantly less active and pleasant words than their nonshy counterparts, these differences were not related to webcam condition. The present findings replicate and extend earlier work on shyness, context, and computer-mediated communication to a selected sample of shy adults. Findings suggest that context may influence some, but not all, aspects of social communication in shy adults.

Is shyness context specific? Relation between shyness and online self-disclosure with and without a live webcam in young adults

The Internet provides a new tool to investigate old questions in experimental social psychology regarding Person x Context interaction. We examined the interaction of self-reported shyness and context on computer-mediated communication measures. Sixty female undergraduates unfamiliar were paired in dyads and engaged in a 10 min free chat conversation on the Internet with and without a live webcam. Free chat conversations were archived, transcripts were objectively coded for communication variables, and a linear mixed model used for data analysis of dyadic interaction was performed on each communication measure. As predicted, increases in self-reported shyness were significantly related to decreases in the number of prompted self-disclosures (after controlling for the number of opportunities to self-disclose) only in the webcam condition. Self-reported shyness was not related to the number of prompted self-disclosures in the no webcam condition, suggesting that shyness was context dependent. The present study appears to be the first to objectively code measures of Internet behaviour in relation to the study of personality in general and shyness in particular. Theoretical and clinical implications for understanding the contextual nature of shyness are discussed. (C) 2006 Elsevier Inc. All rights reserved.

Online CORDIC algorithm and VLSI architecture for implementing QR-array processors

A novel most significant digit first CORDIC architecture is presented that is suitable for the VLSI design of systolic array processor cells for performing QR decomposition. This is based on an on-line CORDIC algorithm with a constant scale factor and a latency independent of the wordlength. This has been derived through the extension of previously published CORDIC algorithms. It is shown that simplifying the calculation of convergence bounds also greatly simplifies the derivation of suitable VLSI architectures. Design studies, based on a 0.35-µ CMOS standard cell process, indicate that 20 such QR processor cells operating at rates suitable for radar beamfoming can be readily accommodated on a single chip.

Trust considerations on attitudes towards online purchasing: The moderating effect of privacy and security concerns

The research examines the relationships between three common trust considerations (vendor, Internet and third parties) and attitudes towards online purchasing. The study incorporates privacy and security concerns as a moderating variable and finds that these relationships vary depending on the level of concerns a consumer has when purchasing online. The study suggests that "fears" surrounding the Internet as a place to do business still hinder the use of it for e-commerce purposes, but that the presence of a reputable agent might in some manner mitigate this risk. In the context of business to consumer relationships trust in the vendor is important for the consumer to accept any risk associated with a transaction. Theoretical implications for online customer behavior theory are also discussed. © 2009 Elsevier Inc.