An experimental investigation into soft-pad grinding of wire-sawn silicon wafers

Silicon is the primary semiconductor material used to fabricate microchips. A series of processes are required to manufacture high-quality silicon wafers. Surface grinding is one of the processes used to flatten wire-sawn wafers. A major issue in grinding of wire-sawn wafers is reduction and elimination of wire-sawing induced waviness. Results of finite element analysis have shown that soft-pad grinding is very effective in reducing the waviness. This paper presents an experimental investigation into soft-pad grinding of wire-sawn silicon wafers. Wire-sawn wafers from a same silicon ingot were used for the study to ensure that these wafers have similar waviness. These wafers were ground using two different soft pads. As a comparison, some wafers were also ground on a rigid chuck. Effectiveness of soft-pad grinding in removing waviness has been clearly demonstrated.     

Empirical evaluation of computational fear contagion models in crowd dispersions

In social psychology, emotional contagion describes the widely observed phenomenon of one person’s emotions being influenced by surrounding people’s emotions. While the overall effect is agreed upon, the underlying mechanism of the spread of emotions has seen little quantification and application to computational agents despite extensive evidence of its impacts in everyday life. In this paper, we examine computational models of emotional contagion by implementing two models (Bosse et al., European council on modeling and simulation, pp. 212–218, 2009) and Durupinar, From audiences to mobs: Crowd simulation with psychological factors, PhD dissertation, Bilkent University, 2010) that draw from two separate lines of contagion research: thermodynamics-based and epidemiological-based. We first perform sensitivity tests on each model in an evacuation simulation, ESCAPES, showing both models to be reasonably robust to parameter variations with certain exceptions. We then compare their ability to reproduce a real crowd panic scene in simulation, showing that the thermodynamics-style model (Bosse et al., European council on modeling and simulation, pp. 212–218, 2009) produces superior results due to the ill-suited contagion mechanism at the core of epidemiological models. We also identify that a graduated effect of fear and proximity-based contagion effects are key to producing the superior results. We then reproduce the methodology on a second video, showing that the same results hold, implying generality of the conclusions reached in the first scene.     

Biosynthesis of zinc oxide nanoparticles by petals extract of Rosa indica L., its formulation as nail paint and evaluation of antifungal activity against fungi causing onychomycosis

Aim: The authors report the biological synthesis of zinc oxide nanoparticles (ZnO‐NPs) from the petals extract of Rosa indica L. (rose). Its efficacy was evaluated against two dermatophytes: namely: Trichophyton mentagrophytes and Microsporum canis which cause onychomycosis. The activity of antibiotics against the tested dermatophytes was enhanced, when evaluated in combination with ZnO‐NPs. Methods and results: The synthesised ZnO‐NPs were preliminary detected by using ultraviolet UV visible spectroscopy, which showed specific absorbance. The ZnO‐NPs were further characterised by nanoparticle tracking analysis (NTA), Fourier transform infrared spectroscopy (FTIR), transmission electron microscopy (TEM), X‐ray diffraction and Zetasizer. Moreover, nanoparticles containing nail paint (nanopaint) was formulated and its antifungal activity was also assessed against T. mentagrophytes and M. canis. ZnO‐NPs and formulated nanopaint containing ZnO‐NPs, both showed significant antifungal activity. The maximum activity was noted against M. canis and lesser against T. mentagrophytes. Minimum inhibitory concentration of ZnO‐NPs was also determined against the dermatophytes causing onychomycosis infection. Conclusion: ZnO‐NPs can be utilised as a potential antifungal agent for the treatment of onychomycosis after more experimental trials.Inspec keywords: diseases, zinc compounds, nanoparticles, nanofabrication, antibacterial activity, microorganisms, nanomedicine, ultraviolet spectra, visible spectra, Fourier transform infrared spectra, transmission electron microscopy, X‐ray diffraction, biomedical materials, patient treatmentOther keywords: zinc oxide nanoparticle biosynthesis, Rosa indica L petals extract, nail paint, antifungal activity evaluation, dermatophyte, Trichophyton mentagrophytes, Microsporum canis, antibiotics activity, ultraviolet‐visible spectroscopy, nanoparticle tracking analysis, Fourier transform infrared spectroscopy, transmission electron microscopy, X‐ray diffraction, zetasizer, antifungal agent, onychomycosis treatment     

Identifying factors causing cost overrun of the construction projects in India

Delay and cost overrun are common phenomena in projects worldwide. However, these are especially severe in developing countries. In India as per MOSPI report, 235 projects out of 410 were severely affected cost overrun due to certain factors. A short questionnaire was conducted with 15 prominent factors responsible for cost overrun and forwarded to 190 constructional professionals across India. Total 85 responses were received and it was analyzed using various statistical tools such as analysis of variance (ANOVA) and factor analysis tool using SPSS. In this study, top three factors affecting cost overruns were identified such as price escalation of raw material, delay in planned activity and lack of co-ordination between construction parties which could be significantly responsible for cost overnun of construction project in India. Factor analysis method was also carried out to group the factors into three components of overall questionnaire. These components, such as client control component, project management component, and contractor control component, would be useful to the various parties involved in the construction activities. This paper also provides suggestive frameworks which have been framed after discussing with large number of construction professionals or expert.     

Robust solutions to Stackelberg games: Addressing bounded rationality and limited observations in human cognition

How do we build algorithms for agent interactions with human adversaries? Stackelberg games are natural models for many important applications that involve human interaction, such as oligopolistic markets and security domains. In Stackelberg games, one player, the leader, commits to a strategy and the follower makes her decision with knowledge of the leader's commitment. Existing algorithms for Stackelberg games efficiently find optimal solutions (leader strategy), but they critically assume that the follower plays optimally. Unfortunately, in many applications, agents face human followers (adversaries) who — because of their bounded rationality and limited observation of the leader strategy — may deviate from their expected optimal response. In other words, human adversaries' decisions are biased due to their bounded rationality and limited observations. Not taking into account these likely deviations when dealing with human adversaries may cause an unacceptable degradation in the leader's reward, particularly in security applications where these algorithms have seen deployment. The objective of this paper therefore is to investigate how to build algorithms for agent interactions with human adversaries.To address this crucial problem, this paper introduces a new mixed-integer linear program (MILP) for Stackelberg games to consider human adversaries, incorporating: (i) novel anchoring theories on human perception of probability distributions and (ii) robustness approaches for MILPs to address human imprecision. Since this new approach considers human adversaries, traditional proofs of correctness or optimality are insufficient; instead, it is necessary to rely on empirical validation. To that end, this paper considers four settings based on real deployed security systems at Los Angeles International Airport (Pita et al., 2008 [35]), and compares 6 different approaches (three based on our new approach and three previous approaches), in 4 different observability conditions, involving 218 human subjects playing 2960 games in total. The final conclusion is that a model which incorporates both the ideas of robustness and anchoring achieves statistically significant higher rewards and also maintains equivalent or faster solution speeds compared to existing approaches.     

Analysis of fractal inter frame video coding using parallel approach

Digital video has many applications varying from telecommunications to broadcasting and so on. Video compression techniques have evolved over the past two decades with prominent technique being developed using fractal. However, this technique was not so popular because of its computationally intensive nature. This paper proposes an inter frame video compression technique, which consists of a combination of a block matching using fractal compression. The proposed algorithm is implemented on CUDA-enabled GPU which significantly reduces the encoding time of the video and provides a very high compression ratio with reasonable quality of the decoded video. Extensive simulations were carried out to analyze the performance of the proposed algorithm.     

Every team deserves a second chance: an extended study on predicting team performance

Voting among different agents is a powerful tool in problem solving, and it has been widely applied to improve the performance in finding the correct answer to complex problems. We present a novel benefit of voting, that has not been observed before: we can use the voting patterns to assess the performance of a team and predict their final outcome. This prediction can be executed at any moment during problem-solving and it is completely domain independent. Hence, it can be used to identify when a team is failing, allowing an operator to take remedial procedures (such as changing team members, the voting rule, or increasing the allocation of resources). We present three main theoretical results: (1) we show a theoretical explanation of why our prediction method works; (2) contrary to what would be expected based on a simpler explanation using classical voting models, we show that we can make accurate predictions irrespective of the strength (i.e., performance) of the teams, and that in fact, the prediction can work better for diverse teams composed of different agents than uniform teams made of copies of the best agent; (3) we show that the quality of our prediction increases with the size of the action space. We perform extensive experimentation in two different domains: Computer Go and Ensemble Learning. In Computer Go, we obtain high quality predictions about the final outcome of games. We analyze the prediction accuracy for three different teams with different levels of diversity and strength, and show that the prediction works significantly better for a diverse team. Additionally, we show that our method still works well when trained with games against one adversary, but tested with games against another, showing the generality of the learned functions. Moreover, we evaluate four different board sizes, and experimentally confirm better predictions in larger board sizes. We analyze in detail the learned prediction functions, and how they change according to each team and action space size. In order to show that our method is domain independent, we also present results in Ensemble Learning, where we make online predictions about the performance of a team of classifiers, while they are voting to classify sets of items. We study a set of classical classification algorithms from machine learning, in a data-set of hand-written digits, and we are able to make high-quality predictions about the final performance of two different teams. Since our approach is domain independent, it can be easily applied to a variety of other domains.     

Development of real-time reference evapotranspiration at the regional scale using satellite-based observations

Real-time data of reference evapotranspiration (ET₀) at different space-time scales are essential to regional agricultural drought assessment, water accounting at the watershed to basin scale, and provide irrigation advisory to farmers. Here, we present a data-fusion approach that integrates satellite-based insolation product (8 km) from an Indian geostationary satellite (Kalpana-1) sensor (VHRR; Very High Resolution Radiometer) and high-resolution (~ 5 km) short-range weather forecast into an FAO56 model based on the classical Penman–Monteith (P-M) formulation. Five year (2009–2013) mean monthly estimates from the daily ET₀ product over the Indian landmass were found to vary between 10 and 350 mm. It increased from January to May (70–350 mm), followed by a decrease to reach the lowest in November (10–140 mm), thus typically showing unimodal distribution. The comparison of daily space-based and station-based estimates (at six ground stations) produced a root mean square deviation (RMSD) ranging from 21% to 38% for 977 paired data sets with the correlation coefficient (r) varying from 0.32 to 0.82. The error was reduced from 25% to 10% with an increase in ‘r’ from 0.43 to 0.98 for daily to 10 day summation period. Spatial grid-to-grid comparison of monthly ET₀ estimates with Global Data Assimilation System (GDAS) potential evapotranspiration (PET) showed RMSD within a range of 1.4–18.4% for most of the months, except for two. Further ET₀ analysis over normal and drought years showed that it could be used for comprehensive drought assessment with other existing indicators.