Indium selenide microrod films: chemical bath deposition from acidic bath

Films of indium selenide was deposited onto glass and indium tin oxide coated glass substrates in acidic medium using chemical bath deposition at room temperature. Indium sulphate and sodium selenosulphate were used as precursors of In³⁺ and Se^2?, respectively. The structural, surface morphological and optical properties of the deposited films were studied. Diffractograms in structural study revealed the deposited material is In₂Se₃ films. Controlled bath conditions resulted in the evolution of the In₂Se₃ microrod-like morphology. The optical band gap of the film was found to be 1.7 eV.     

Reinterpretable Imager: Towards Variable Post‐Capture Space,Angle and Time Resolution in Photography

We describe a novel multiplexing approach to achieve tradeoffs in space, angle and time resolution in photography. We explore the problem of mapping useful subsets of time‐varying 4D lightfields in a single snapshot. Our design is based on using a dynamic mask in the aperture and a static mask close to the sensor. The key idea is to exploit scene‐specific redundancy along spatial, angular and temporal dimensions and to provide a programmable or variable resolution tradeoff among these dimensions. This allows a user to reinterpret the single captured photo as either a high spatial resolution image, a refocusable image stack or a video for different parts of the scene in post‐processing. A lightfield camera or a video camera forces a‐priori choice in space‐angle‐time resolution. We demonstrate a single prototype which provides flexible post‐capture abilities not possible using either a single‐shot lightfield camera or a multi‐frame video camera. We show several novel results including digital refocusing on objects moving in depth and capturing multiple facial expressions in a single photo.     

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.     

Experimental technique using FTIR to estimate IR optical properties at variable temperatures: application to PMDA-ODA polyimide thin films from 100 to 380 degrees C

An experimental technique is presented to measure reflectance at high sample temperature with respect to room temperature in the infrared using Fourier transform infrared fitted with a reflectometer. Sample temperature artifacts are accounted for by sequential measurements taken with the lamp source on and with the lamp source off. The sequential measurements are shown mathematically to correct for the modulation of sample and detector thermal emissions. Further, the technique is applied to a polyimide (PMDA-ODA) film on a layer of gold deposited on a thermally oxidized Si wafer. It is shown that the optical properties (index of refraction and extinction coefficient) remain relatively constant with temperature (from room temperature to 380 degrees C) in the 4000-6000 cm(-1) spectral region. The significant changes that occur with temperature are the change in thickness of the film and also the spectral properties in the 2000-4000 cm(-1) region. Also, by using a Lorentz oscillator model, it is shown that this method is able to discern that spectral features corresponding to the OH stretching bands at 3630 and 3470 cm(-1) show significant variation with increasing temperature.     

Apportioning: a technique for efficient reachability analysis ofconcurrent object-oriented programs

The object-oriented paradigm in software engineering provides support for the construction of modular and reusable program components and is attractive for the design of large and complex distributed systems. Reachability analysis is an important and well-known tool for static analysis of critical properties in concurrent programs, such as deadlock freedom. It involves the systematic enumeration of all possible global states of program execution and provides the same level of assurance for properties of the synchronization structure in concurrent programs, such as formal verification. However, direct application of traditional reachability analysis to concurrent object-oriented programs has many problems, such as incomplete analysis for reusable classes (not safe) and increased computational complexity (not efficient). We propose a novel technique called apportioning, for safe and efficient reachability analysis of concurrent object-oriented programs, that is based upon a simple but powerful idea of classification of program analysis points as local (having influence within a class) and global (having possible influence outside a class). We have developed a number of apportioning-based algorithms, having different degrees of safety and efficiency. We present the details of one of these algorithms, formally show its safety for an appropriate class of programs, and present experimental results to demonstrate its efficiency for various examples     

Evaluation of a workplace technology for mental health assessment: A meaning-making process

This paper describes the results of a summative evaluation conducted to explore the usability and acceptability of an automated telephone-based technology, designed and developed as a screening tool for mental health disorders in the workplace. The system screens employees for symptoms and subsequently provides educational information and referrals to improve mental health and enhance productivity. The qualitative evaluation was a sub-study of a larger randomized controlled trial (RCT). We conducted in-depth interviews with 15 individuals who participated in the RCT and had used the system. A phenomenological theoretical framework was utilized to analyze the narrative data. Results indicated that participants had mostly positive experience with the system and perceived it as a confidential program that allowed them to reflect on their symptoms without inhibition, fear of judgment or embarrassment. We also learned that asking mere questions about mental health symptoms can be a positive, instructive and possibly a restorative experience. There is a likelihood that for many participants, exposure to questions about their emotional and mental distress validated their feelings about their symptoms and was sufficiently compelling to promote help-seeking behavior. This evaluation study demonstrates that computers can be utilized in the workplace as effective screening and educational tools to improve employees’ mental health.     

A system for debugging via online tracing and dynamic slicing

Dynamic slicing is a promising trace based technique that helps programmers in the process of debugging. In order to debug a failed run, dynamic slicing requires the dynamic dependence graph (DDG) information for that particular run. The two major challenges involved in utilizing dynamic slicing as a debugging technique are the efficient computation of the DDG and the efficient computation of the dynamic slice, given the DDG. In this paper, we present an efficient debugger, which first computes the DDG efficiently while the program is executing; dynamic slicing is later performed efficiently on the computed DDG, on demand. To minimize program slowdown during the online computation of DDG, we make the design decision of not outputting the computed dependencies to a file, instead, storing them in memory in a specially allocated fixed size circular buffer. The size of the buffer limits the length of the execution history that can be stored. To maximize the execution history that can be maintained, we introduce optimizations to eliminate the storage of most of the generated dependencies, at the same time ensuring that those that are stored are sufficient to capture the bug. Experiments conducted on CPU‐intensive programs show that our optimizations are able to reduce the trace rate from 16 to 0.8 bytes per executed instruction. This enables us to store the dependence trace history for a window of 20 million executed instructions in a 16‐MB buffer. Our debugger is also very efficient, yielding slicing times of around a second, and only slowing down the execution of the program by a factor of 19 during the online tracing step. Using recently proposed architectural support for monitoring, we are also able to handle multithreaded programs running on multicore processors. Copyright © 2011 John Wiley & Sons, Ltd.