DemNet: A Convolutional Neural Network for the detection of Alzheimer's Disease and Mild Cognitive Impairment

The early diagnosis of Alzheimer's Disease (AD) and its prodromal form, Mild Cognitive Impairment (MCI), has been the subject of extensive research in recent years. Some recent studies have shown promising results in the diagnosis of AD and MCI using structural Magnetic Resonance Imaging (MRI) scans. In this paper, we propose the use of a Convolutional Neural Network (CNN) in the detection of AD and MCI. In particular, we modified the 16-layered VGGNet for the 3-way classification of AD, MCI and Healthy Controls (HC) on the Alzheimer's Disease Neuroimaging Initiative (ADNI) dataset achieving an overall accuracy of 91.85% and outperforming several classifiers from other studies.


Thoraco-omphalopagus conjoined twins in Chamois-coloured domestic goat kids.

Conjoined twins have been observed in a wide range of mammalian and non-mammalian species; they are considered to be more common in bovine, less frequent in sheep and pig and extremely rare in horse and goat. A pair of female conjoined twins was delivered from a 2-year-old Chamois-coloured domestic goat. Post-mortem examination revealed two identical and symmetrical twins, fused from the manubrium sterni to the region just caudal to the umbilicus. The rib cages were conjoined in the ventral plane with a single set of pericardial, pleural and peritoneal cavities. Internal examination revealed the presence of a common diaphragm and a single enlarged liver. Within a single central pericardium, two malformed hearts were present. Reports on this type of congenital duplication in goats have not been found in the literature. Thoracopagus and thoraco-omphalopagus are the most common types of conjoined twins in human beings and are associated with the highest mortality because of the frequent incidence of complex cardiac anatomy.


Advertising and Consumers' Communications

U recently, brand identities were built by firms via brand image advertising. However, the flourishing consumer communication weakened the firms’ grip on their brands. The interaction between advertising and consumer communications and their joint impact on brand identity is the focal point of this paper. We present a model in which consumer preference for functional attributes may correlate with the identity they desire to project of themselves. This correlation is known to the firm but not to the consumers. Both the firm and the consumers can communicate their desired brand identity, although the actual brand identity is determined endogeneously by the composition of consumers who purchase it (i.e., what types of people consume the brand). We find that sometimes the firm can strengthen the identity of its brand by refraining from advertising. This result is based on the following intermediate finding: advertising can diminish the endogeneous informativeness of consumer communications by making it one-sided. Furthermore, it turns out that refraining from brand image advertising may be optimal for the firm when the product is especially well positioned to create a strong identity—i.e., when consumer preferences for functional and self-expressive attributes are highly correlated.


Extreme visualization: squeezing a billion records into a million pixels

Database searches are usually performed with query languages and form fill in templates, with results displayed in tabular lists. However, excitement is building around dynamic queries sliders and other graphical selectors for query specification, with results displayed by information visualization techniques. These filtering techniques have proven to be effective for many tasks in which visual presentations enable discovery of relationships, clusters, outliers, gaps, and other patterns. Scaling visual presentations from millions to billions of records will require collaborative research efforts in information visualization and database management to enable rapid aggregation, meaningful coordinated windows, and effective summary graphics. This paper describes current and proposed solutions (atomic, aggregated, and density plots) that facilitate sense-making for interactive visual exploration of billion record data sets.


Discovering interpretable geo-social communities for user behavior prediction

Social community detection is a growing field of interest in the area of social network applications, and many approaches have been developed, including graph partitioning, latent space model, block model and spectral clustering. Most existing work purely focuses on network structure information which is, however, often sparse, noisy and lack of interpretability. To improve the accuracy and interpretability of community discovery, we propose to infer users' social communities by incorporating their spatiotemporal data and semantic information. Technically, we propose a unified probabilistic generative model, User-Community-Geo-Topic (UCGT), to simulate the generative process of communities as a result of network proximities, spatiotemporal co-occurrences and semantic similarity. With a well-designed multi-component model structure and a parallel inference implementation to leverage the power of multicores and clusters, our UCGT model is expressive while remaining efficient and scalable to growing large-scale geo-social networking data. We deploy UCGT to two application scenarios of user behavior predictions: check-in prediction and social interaction prediction. Extensive experiments on two large-scale geo-social networking datasets show that UCGT achieves better performance than existing state-of-the-art comparison methods.


Mobile Phone Use and Sleep Quality and Length in College Students

Proper sleep length and quality are essential for physical and mental health and have found to be related to a variety of negative outcomes (Brown, Buboltz, &Soper, 2002). College is a time,a transition for individuals where they begin laying a foundation for their future and acquiring sufficient sleep is of great value. College students are recognized as one of the most sleep-deprived groups, but also, as one of the most technologically-oriented population. Due to this combination, college students’ sleep habits and mobile phone use habits havebegun to receiveattention. The purpose of this study was to examine the relationship between sleep quality/length and mobile phone use among college students. Three hundred and fifty college students voluntarily participated by completing the Sleep Quality Index (SQI), The Sleep Habits Survey,the Mobile Phone Problem Use Scale(MPPUS), the SMS Problem Use Scale (SMS-PUDQ) and the Mini IPIP. Results indicate that various aspects of mobile phone use such as problem mobile phone use, addictive text messaging, problematic texting, and pathological texting are related to sleep quality, but not sleep length. Additionally, extraverted individuals were found to engage in greater mobile phone use and problematic text messaging.


Energy Big Data Analytics and Security: Challenges and Opportunities

The limited available fossil fuels and the call for sustainable environment have brought about new technologies for the high efficiency in the use of fossil fuels and introduction of renewable energy. Smart grid is an emerging technology that can fulfill such demands by incorporating advanced information and communications technology (ICT). The pervasive deployment of the advanced ICT, especially the smart metering, will generate big energy data in terms of volume, velocity, and variety. The generated big data can bring huge benefits to the better energy planning, efficient energy generation, and distribution. As such data involve end users' privacy and secure operation of the critical infrastructure, there will be new security issues. This paper is to survey and discuss new findings and developments in the existing big energy data analytics and security. Several taxonomies have been proposed to express the intriguing relationships of various variables in the field.


A Feature-Based, Robust, Hierarchical Algorithm for Registering Pairs of Images of the Curved Human Retina

ÐThis paper describes a robust hierarchical algorithm for fully-automatic registration of a pair of images of the curved human retina photographed by a fundus microscope. Accurate registration is essential for mosaic synthesis, change detection, and design of computer-aided instrumentation. Central to the new algorithm is a 12-parameter interimage transformation derived by modeling the retina as a rigid quadratic surface with unknown parameters, imaged by an uncalibrated weak perspective camera. The parameters of this model are estimated by matching vascular landmarks extracted by an algorithm that recursively traces the blood vessel structure. The parameter estimation technique, which could be generalized to other applications, is a hierarchy of models and methods: an initial match set is pruned based on a zeroth order transformation estimated as the peak of a similarity-weighted histogram; a first order, affine transformation is estimated using the reduced match set and least-median of squares; and the final, second order, 12-parameter transformation is estimated using an M-estimator initialized from the first order estimate. This hierarchy makes the algorithm robust to unmatchable image features and mismatches between features caused by large interframe motions. Before final convergence of the M-estimator, feature positions are refined and the correspondence set is enhanced using normalized sum-of-squared differences matching of regions deformed by the emerging transformation. Experiments involving 3,000 image pairs (I; HPR Â I; HPR pixels) from 16 different healthy eyes were performed. Starting with as low as 20 percent overlap between images, the algorithm improves its success rate exponentially and has a negligible failure rate above 67 percent overlap. The experiments also quantify the reduction in errors as the model complexities increase. Final registration errors less than a pixel are routinely achieved. The speed, accuracy, and ability to handle small overlaps compare favorably with retinal image registration techniques published in the literature.


Enhanced differential super class-AB OTA

A fully differential Super Class AB Operational Transconductance Amplifier (OTA) is presented. To provide additional dynamic current boosting and increased gain-bandwidth product (GBW), not only adaptive biasing techniques has been applied at the differential input stage, but also Local Common Mode Feedback (LCMFB). Additionally, Quasi Floating Gate (QFG) transistors are employed, enhancing the performance of the amplifier. The OTA has been fabricated in a standard 0.5-μm CMOS process. Simulation results yield a slew rate improvement by factor 86 and a GBW enhancement by factor 16 when compared to the class A OTA while driving the same 70-pF load. Supply voltages are ±1-V and the value of the quiescent current is 10 μA. The overhead in terms of quiescent power, silicon area, and noise level is small.


The neural correlates of maternal and romantic love

Romantic and maternal love are highly rewarding experiences. Both are linked to the perpetuation of the species and therefore have a closely linked biological function of crucial evolutionary importance. Yet almost nothing is known about their neural correlates in the human. We therefore used fMRI to measure brain activity in mothers while they viewed pictures of their own and of acquainted children, and of their best friend and of acquainted adults as additional controls. The activity specific to maternal attachment was compared to that associated to romantic love described in our earlier study and to the distribution of attachment-mediating neurohormones established by other studies. Both types of attachment activated regions specific to each, as well as overlapping regions in the brain's reward system that coincide with areas rich in oxytocin and vasopressin receptors. Both deactivated a common set of regions associated with negative emotions, social judgment and 'mentalizing', that is, the assessment of other people's intentions and emotions. We conclude that human attachment employs a push-pull mechanism that overcomes social distance by deactivating networks used for critical social assessment and negative emotions, while it bonds individuals through the involvement of the reward circuitry, explaining the power of love to motivate and exhilarate.


Improved Optimization for the Robust and Accurate Linear Registration and Motion Correction of Brain Images

Linear registration and motion correction are important components of structural and functional brain image analysis. Most modern methods optimize some intensity-based cost function to determine the best registration. To date, little attention has been focused on the optimization method itself, even though the success of most registration methods hinges on the quality of this optimization. This paper examines the optimization process in detail and demonstrates that the commonly used multiresolution local optimization methods can, and do, get trapped in local minima. To address this problem, two approaches are taken: (1) to apodize the cost function and (2) to employ a novel hybrid global-local optimization method. This new optimization method is specifically designed for registering whole brain images. It substantially reduces the likelihood of producing misregistrations due to being trapped by local minima. The increased robustness of the method, compared to other commonly used methods, is demonstrated by a consistency test. In addition, the accuracy of the registration is demonstrated by a series of experiments with motion correction. These motion correction experiments also investigate how the results are affected by different cost functions and interpolation methods.


The rises and falls of disconnection syndromes.

In a brain composed of localized but connected specialized areas, disconnection leads to dysfunction. This simple formulation underlay a range of 19th century neurological disorders, referred to collectively as disconnection syndromes. Although disconnectionism fell out of favour with the move against localized brain theories in the early 20th century, in 1965, an American neurologist brought disconnection to the fore once more in a paper entitled, 'Disconnexion syndromes in animals and man'. In what was to become the manifesto of behavioural neurology, Norman Geschwind outlined a pure disconnectionist framework which revolutionized both clinical neurology and the neurosciences in general. For him, disconnection syndromes were higher function deficits that resulted from white matter lesions or lesions of the association cortices, the latter acting as relay stations between primary motor, sensory and limbic areas. From a clinical perspective, the work reawakened interest in single case studies by providing a useful framework for correlating lesion locations with clinical deficits. In the neurosciences, it helped develop contemporary distributed network and connectionist theories of brain function. Geschwind's general disconnectionist paradigm ruled clinical neurology for 20 years but in the late 1980s, with the re-emergence of specialized functional roles for association cortex, the orbit of its remit began to diminish and it became incorporated into more general models of higher dysfunction. By the 1990s, textbooks of neurology were devoting only a few pages to classical disconnection theory. Today, new techniques to study connections in the living human brain allow us, for the first time, to test the classical formulation directly and broaden it beyond disconnections to include disorders of hyperconnectivity. In this review, on the 40th anniversary of Geschwind's publication, we describe the changing fortunes of disconnection theory and adapt the general framework that evolved from it to encompass the entire spectrum of higher function disorders in neurology and psychiatry.


EEG-correlated fMRI of human alpha activity

Electroencephalography-correlated functional magnetic resonance imaging (EEG/fMRI) can be used to identify blood oxygen level-dependent (BOLD) signal changes associated with both physiological and pathological EEG events. Here, we implemented continuous and simultaneous EEG/fMRI to identify BOLD signal changes related to spontaneous power fluctuations in the alpha rhythm (8-12 Hz), the dominant EEG pattern during relaxed wakefulness. Thirty-two channels of EEG were recorded in 10 subjects during eyes-closed rest inside a 1.5-T magnet resonance (MR) scanner using an MR-compatible EEG recording system. Functional scanning by echoplanar imaging covered almost the entire cerebrum every 4 s. Off-line MRI artifact subtraction software was applied to obtain continuous EEG data during fMRI acquisition. The average alpha power over 1-s epochs was derived at several electrode positions using a Fast Fourier Transform. The power time course was then convolved with a canonical hemodynamic response function, down-sampled, and used for statistical parametric mapping of associated signal changes in the image time series. At all electrode positions studied, a strong negative correlation of parietal and frontal cortical activity with alpha power was found. Conversely, only sparse and nonsystematic positive correlation was detected. The relevance of these findings is discussed in view of the current theories on the generation and significance of the alpha rhythm and the related functional neuroimaging findings.


An evaluation framework for viable business models for m-commerce in the information technology sector

This paper presents a study of the characteristics of viable business models in the field of Mobile Commerce (m-commerce). Mobility has given new dimensions to the way commerce works. All over the world various stakeholder organisations are consistently probing into the areas where m-commerce can be exploited and can generate revenue or value for them, even though some of those implementations are making the business environment more complex and uncertain. This paper proposes a viable business model evaluation framework, based on the VISOR model, which helps in determining the sustainability capabilities of a business model. Four individual cases were conducted with diverse organisations in the Information Technology sector. The four cases discussed dealt with mobile business models and the primary data was collected via semi structured interviews, supplemented by an extensive range of secondary data. A cross-case comparative data analysis was used to review the patterns of different viable business components across the four cases and, finally, the findings and conclusions of the study are presented.


Delving into adversarial attacks on deep policies

Adversarial examples have been shown to exist for a variety of deep learning architectures. Deep reinforcement learning has shown promising results on training agent policies directly on raw inputs such as image pixels. In this paper we present a novel study into adversarial attacks on deep reinforcement learning polices. We compare the effectiveness of the attacks using adversarial examples vs. random noise. We present a novel method for reducing the number of times adversarial examples need to be injected for a successful attack, based on the value function. We further explore how re-training on random noise and FGSM perturbations affects the resilience against adversarial examples.


Columbia-IBM news video story segmentation in trecvid 2004

In this technical report, we give an overview our technical developments in the story segmentation task in TRECVID 2004. Among them, we propose an information-theoretic framework, visual cue cluster construction (VC), to automatically discover adequate mid-level features. The problem is posed as mutual information maximization, through which optimal cue clusters are discovered to preserve the highest information about the semantic labels. We extend the Information Bottleneck framework to high-dimensional continuous features and further propose a projection method to map each video into probabilistic memberships over all the cue clusters. The biggest advantage of the proposed approach is to remove the dependence on the manual process in choosing the mid-level features and the huge labor cost involved in annotating the training corpus for training the detector of each mid-level feature. When tested in TRECVID 2004 news video story segmentation, the proposed approach achieves promising performance gain over representations derived from conventional clustering techniques and even the mid-level features selected manually; meanwhile, it achieved one of the top performances, F1=0.65, close to the highest performance, F1=0.69, by other groups. We also experiment with other promising visual features and continue investigating effective prosody features. The introduction of post-processing also provides practical improvements. Furthermore, the fusion from other modalities, such as speech prosody features and ASR-based segmentation scores are significant and have been confirmed again in this experiment.


Detection and Discrimination of Open-Phase Fault in Permanent Magnet Synchronous Motor Drive System

Open-phase fault in permanent magnet synchronous motor (PMSM) drive system occurs as the phase winding is disconnected or one leg of the inverter bridge fails. It may generate large electromagnetic torque ripple and serious mechanical vibration. Therefore, a rapid fault detection method is greatly required to identify this fault at early stage and prevent damage to the system. This paper develops a method of the open-phase fault detection and discrimination for the PMSM drive system based on the zero-sequence voltage components, in which the discrimination of the fault types, namely internal stator winding failure and switches failure of the inverter is realized. Then, appropriate fault-tolerant measures may be taken according to the different fault types. The experimental platform is established, and the experimental results verify the effectiveness of the proposed method, showing that not only the open-phase fault can be rapidly detected, but also the fault type can be effectively discriminated.


Google App Engine

Cloud computing becomes more popular day by day. The “dream” of users to “to get rid” of administrators, huge investments on expensive hardware and human resources becomes true. The goal of this paper is to present a general overview of the new coming service offered by Google company Google App Engine. “What is it for?”, “What can I do with the system?” and “How does it work?” are some of the questions on which this paper will try to give an answer. In addition, brief overview and description of “cloud computing” and comparison of Google App Engine with other similar products will be provided to the reader as well.


The utility of low frequency heart rate variability as an index of sympathetic cardiac tone: a review with emphasis on a reanalysis of previous studies.

This article evaluates the suitability of low frequency (LF) heart rate variability (HRV) as an index of sympathetic cardiac control and the LF/high frequency (HF) ratio as an index of autonomic balance. It includes a comprehensive literature review and a reanalysis of some previous studies on autonomic cardiovascular regulation. The following sources of evidence are addressed: effects of manipulations affecting sympathetic and vagal activity on HRV, predictions of group differences in cardiac autonomic regulation from HRV, relationships between HRV and other cardiac parameters, and the theoretical and mathematical bases of the concept of autonomic balance. Available data challenge the interpretation of the LF and LF/HF ratio as indices of sympathetic cardiac control and autonomic balance, respectively, and suggest that the HRV power spectrum, including its LF component, is mainly determined by the parasympathetic system.


Solving ill-posed inverse problems using iterative deep neural networks

We propose a partially learned approach for the solution of ill posed inverse problems with not necessarily linear forward operators. The method builds on ideas from classical regularization theory and recent advances in deep learning to perform learning while making use of prior information about the inverse problem encoded in the forward operator, noise model and a regularizing functional. The method results in a gradient-like iterative scheme, where the “gradient” component is learned using a convolutional network that includes the gradients of the data discrepancy and regularizer as input in each iteration. We present results of such a partially learned gradient scheme on a non-linear tomographic inversion problem with simulated data from both the Sheep-Logan phantom as well as a head CT. The outcome is compared against filtered backprojection and total variation reconstruction and the proposed method provides a 5.4 dB PSNR improvement over the total variation reconstruction while being significantly faster, giving reconstructions of 512× 512 pixel images in about 0.4 s using a single graphics processing unit (GPU).


Two-stream Attentive CNNs for Image Retrieval

In content-based image retrieval, the most challenging (and ambiguous) part is to define the similarity between images. For the human-being, such similarity can be defined with respect to where they pay attention to and what semantic attributes they understand. Inspired by this fact, this paper presents two-stream attentive CNNs for image retrieval. As the human-being does, the proposed network has two streams that simultaneously handle two tasks. The Main stream focuses on extracting discriminative visual features that are tightly correlated with semantic attributes. Meanwhile, the Auxiliary stream aims to facilitate the main stream by redirecting the feature extraction operation mainly to the image content that human may pay attention to. By fusing these two streams into the Main and Auxiliary CNNs (MAC), image similarity can be computed as the human-being does by reserving the conspicuous content and suppressing the irrelevant regions. Extensive experiments show that the proposed model achieves impressive performance in image retrieval on four public datasets.


A Hierarchical Recurrent Neural Network for Symbolic Melody Generation

In recent years, neural networks have been used to generate symbolic melodies. However, the long-term structure in the melody has posed great difficulty for designing a good model. In this paper, we present a hierarchical recurrent neural network for melody generation, which consists of three Long-Short-Term-Memory (LSTM) subnetworks working in a coarse-to-fine manner along time. Specifically, the three subnetworks generate bar profiles, beat profiles and notes in turn, and the output of the high-level subnetworks are fed into the low-level subnetworks, serving as guidance for generating the finer time-scale melody components in low-level subnetworks. Two human behavior experiments demonstrate the advantage of this structure over the single-layer LSTM which attempts to learn all hidden structures in melodies. Compared with the state-of-the-art models MidiNet (Yang, Chou, and Yang 2017) and MusicVAE (Roberts et al. 2018), the hierarchical recurrent neural network produces better melodies evaluated by humans. Introduction Automatic music generation using neural networks has attracted much attention. There are two classes of music generation approaches, symbolic music generation (Hadjeres, Pachet, and Nielsen 2017)(Waite et al. 2016)(Yang, Chou, and Yang 2017) and audio music generation (van den Oord et al. )(Mehri et al. 2016). In this study, we focus on symbolic melody generation, which requires learning from sheet music. Many music genres such as pop music consist of melody and harmony. Since usually beautiful harmonies can be ensured by using legitimate chord progressions which have been summarized by musicians, we only focus on melody generation, similar to some recent studies (Waite et al. 2016)(Yang, Chou, and Yang 2017)(Colombo, Seeholzer, and Gerstner 2017)(Roberts et al. 2018). This greatly simplifies the melody generation problem. Melody is a linear succession of musical notes along time. It has both short time scale such as notes and long time scale such as phrases and movements, which makes the melody generation a challenging task. Existing methods generate pitches and rhythm simultaneously (Waite et al. 2016) or sequentially (Chu, Urtasun, and Fidler 2016) using Recurrent Neural Networks (RNNs), but they usually work on the note scale without explicitly modeling the larger time-scale components such as rhythmic patterns. It is difficult for them to learn long-term dependency or structure in melody. Theoretically, an RNN can learn the temporal structure of any length in the input sequence, but in reality, as the sequence gets longer it is very hard to learn long-term structure. Different RNNs have different learning capability, e.g., LSTM (Hochreiter and Schmidhuber 1997) performs much better than the simple Elman network. But any model has a limit for the length of learnable structure, and this limit depends on the complexity of the sequence to be learned. To enhance the learning capability of an RNN, one approach is to invent a new structure. In this work we take another approach: increase the granularity of the input. Since each symbol in the sequence corresponds to longer segment than the original representation, the same model would learn longer temporal structure. To implement this idea, we propose a Hierarchical Recurrent Neural Network (HRNN) for learning melody. It consists of three LSTM-based sequence generators — Bar Layer, Beat Layer and Note Layer. The Bar Layer and Beat Layer are trained to generate bar profiles and beat profiles, which are designed to represent the high-level temporal features of melody. The Note Layer is trained to generate melody conditioned on the bar profile sequence and beat profile sequence output by the Bar Layer and Beat Layer. By learning on different time scales, the HRNN can grasp the general regular patterns of human composed melodies in different granularities, and generate melody with realistic long-term structures. This method follows the general idea of granular computing (Bargiela and Pedrycz 2012), in which different resolutions of knowledge or information is extracted and represented for problem solving. With the shorter profile sequences to guide the generation of note sequence, the difficulty of generating note sequence with wellorganized structure is alleviated. Related Work Melody Generation with Neural Networks There is a long history of generating melody with RNNs. A recurrent autopredictive connectionist network called CONCERT is used to compose music (Mozer 1994). With a set of composition rules as constraints to evaluate ar X iv :1 71 2. 05 27 4v 2 [ cs .S D ] 5 S ep 2 01 8 melodies, an evolving neural network is employed to create melodies (Chen and Miikkulainen 2001). As an important form of RNN, LSTM (Hochreiter and Schmidhuber 1997) is used to capture the global music structure and improve the quality of the generated music (Eck and Schmidhuber 2002). Boulanger-Lewandowski, Bengio, and Vincent explore complex polyphonic music generation with an RNNRBM model (Boulanger-Lewandowski, Bengio, and Vincent 2012). Lookback RNN and Attention RNN are proposed to tackle the problem of creating melody’s long-term structure (Waite et al. 2016). The Lookback RNN introduces a handcrafted lookback feature that makes the model repeat sequences easier while the Attention RNN leverages an attention mechanism to learn longer-term structures. Inspired by convolution, two variants of RNN are employed to attain transposition invariance (Johnson 2017). To model the relation between rhythm and melody flow, a melody is divided into pitch sequence and duration sequence and these two sequences are processed in parallel (Colombo et al. 2016). This approach is further extended in (Colombo, Seeholzer, and Gerstner 2017). A hierarchical VAE is employed to learn the distribution of melody pieces in (Roberts et al. 2018), the decoder of which is similar to our model. The major difference is that the higher layer of its decoder uses the automatically learned representation of bars, while our higher layers use predefined representation of bars and beats which makes the learning problem easier. Generative Adversarial Networks (GANs) have also been used to generate melodies. For example, RNN-based GAN (Mogren 2016) and CNN-based GAN (Yang, Chou, and Yang 2017) are employed to generate melodies, respectively. However, the generated melodies also lack realistic long-term structures. Some models are proposed to generate multi-track music. A 4-layer LSTM is employed to produce the key, press, chord and drum of pop music seperately (Chu, Urtasun, and Fidler 2016). With pseudo-Gibbs sampling, a model can generate highly convincing chorales in the style of Bach (Colombo, Seeholzer, and Gerstner 2017). Three GANs for symbolic-domain multi-track music generation were proposed (Dong et al. 2018). An end-to-end melody and arrangement generation framework XiaoIce Band was proposed to generate a melody track with accompany tracks with RNN (Zhu et al. 2018). Hierarchical and Multiple Time Scales Networks The idea of hierarchical or multiple time scales has been used in neural network design, especially in the area of natural language processing. The Multiple Timescale Recurrent Neural Network (MTRNN) realizes the self-organization of a functional hierarchy with two types of neurons “fast” unit and “slow” unit (Yamashita and Tani 2008). Then it is shown that the MTRNN can acquire the capabilities to recognize, generate, and correct sentences in a hierarchical way: characters grouped into words, and words into sentences (Hinoshita et al. 2011). An LSTM auto-encoder is trained to preserve and reconstruct paragraphs by hierarchically building embeddings of words, sentences and paragraphs (Li, Luong, and Jurafsky 2015). To process inputs at multiple time Time signature Bar Key signature


Less guilty by reason of adolescence: developmental immaturity, diminished responsibility, and the juvenile death penalty.

The authors use a developmental perspective to examine questions about the criminal culpability of juveniles and the juvenile death penalty. Under principles of criminal law, culpability is mitigated when the actor's decision-making capacity is diminished, when the criminal act was coerced, or when the act was out of character. The authors argue that juveniles should not be held to the same standards of criminal responsibility as adults, because adolescents' decision-making capacity is diminished, they are less able to resist coercive influence, and their character is still undergoing change. The uniqueness of immaturity as a mitigating condition argues for a commitment to a legal environment under which most youths are dealt with in a separate justice system and none are eligible for capital punishment.


Alzheimer disease therapy—moving from amyloid-β to tau

Disease-modifying treatments for Alzheimer disease (AD) have focused mainly on reducing levels of amyloid-β (Aβ) in the brain. Some compounds have achieved this goal, but none has produced clinically meaningful results. Several methodological issues relating to clinical trials of these agents might explain this failure; an additional consideration is that the amyloid cascade hypothesis—which places amyloid plaques at the heart of AD pathogenesis—does not fully integrate a large body of data relevant to the emergence of clinical AD. Importantly, amyloid deposition is not strongly correlated with cognition in multivariate analyses, unlike hyperphosphorylated tau, neurofibrillary tangles, and synaptic and neuronal loss, which are closely associated with memory deficits. Targeting tau pathology, therefore, might be more clinically effective than Aβ-directed therapies. Furthermore, numerous immunization studies in animal models indicate that reduction of intracellular levels of tau and phosphorylated tau is possible, and is associated with improved cognitive performance. Several tau-related vaccines are in advanced preclinical stages and will soon enter clinical trials. In this article, we present a critical analysis of the failure of Aβ-directed therapies, discuss limitations of the amyloid cascade hypothesis, and suggest the potential value of tau-targeted therapy for AD.


What maintains parental support for vaccination when challenged by anti-vaccination messages? A qualitative study.

This study sought to explore how parents respond to competing media messages about vaccine safety. Six focus groups with mothers of infants were shown television vignettes of typical pro- and anti-vaccination claims. Thematic analysis of transcripts was undertaken. Mothers expressed surprise and concern about alleged vaccine risks but quickly reinstated their support for vaccination by deference to authority figures; type-casting immunisation opponents; and notions of anticipatory regret, good parenting and social responsibility. We conclude that personal experiences, value systems and level of trust in health professionals are fundamental to parental decision making about vaccination. Vaccination advocacy should increase the focus on matters of process such as maintaining trust and public confidence, particularly in health professionals. Stories about people affected by vaccine-preventable diseases need to re-enter the public discourse.


SuggestBot: using intelligent task routing to help people find work in wikipedia

Member-maintained communities ask their users to perform tasks the community needs. From Slashdot, to IMDb, to Wikipedia, groups with diverse interests create community-maintained artifacts of lasting value (CALV) that support the group's main purpose and provide value to others. Said communities don't help members find work to do, or do so without regard to individual preferences, such as Slashdot assigning meta-moderation randomly. Yet social science theory suggests that reducing the cost and increasing the personal value of contribution would motivate members to participate more.We present SuggestBot, software that performs intelligent task routing (matching people with tasks) in Wikipedia. SuggestBot uses broadly applicable strategies of text analysis, collaborative filtering, and hyperlink following to recommend tasks. SuggestBot's intelligent task routing increases the number of edits by roughly four times compared to suggesting random articles. Our contributions are: 1) demonstrating the value of intelligent task routing in a real deployment; 2) showing how to do intelligent task routing; and 3) sharing our experience of deploying a tool in Wikipedia, which offered both challenges and opportunities for research.


Application-Managed Flash

In flash storage, an FTL is a complex piece of code that resides completely inside the storage device and is provided by the manufacturer. Its principal virtue is providing interoperability with conventional HDDs. However, this virtue is also its biggest impediment in reaching the full performance of the underlying flash storage. We propose to refactor the flash storage architecture so that it relies on a new block I/O interface which does not permit overwriting of data without intervening erasures.We demonstrate how high-level applications, in particular file systems, can deal with this restriction efficiently by employing append-only segments. This refactoring dramatically reduces flash management overhead and improves performance of applications, such as file systems and databases, by permitting them to directly manage flash storage. Our experiments on a machine with the new block I/O interface show that DRAM in the flash controller is reduced by 128X and the performance of the file system improves by 80% over conventional SSDs.


Expected Stock Returns and Volatility

This paper examines the relation between stock returns and stock market volatility. We find evidence that the expected market risk premium (the expected return on a stock portfolio minus the Treasury bill yield) is positively related to the predictable volatility of stock returns. There is also evidence that unexpected stock market returns are negatively related to the unexpected change in the volatility of stock returns. This negative relation provides indirect evidence of a positive relation between expected risk premiums and volatility. Disciplines Finance | Finance and Financial Management Comments At the time of publication, author Robert F. Stambaugh was affiliated with the University of Chicago. Currently, he is a faculty member at the Wharton School at the University of Pennsylvania. This journal article is available at ScholarlyCommons: http://repository.upenn.edu/fnce_papers/363 Expected Stock Returns and Volatility by Kenneth R. French* G. William Schwert** Robert F. Starnbaugh*


Rated aspect summarization of short comments

Web 2.0 technologies have enabled more and more people to freely comment on different kinds of entities (e.g. sellers, products, services). The large scale of information poses the need and challenge of automatic summarization. In many cases, each of the user-generated short comments comes with an overall rating. In this paper, we study the problem of generating a ``rated aspect summary'' of short comments, which is a decomposed view of the overall ratings for the major aspects so that a user could gain different perspectives towards the target entity. We formally define the problem and decompose the solution into three steps. We demonstrate the effectiveness of our methods by using eBay sellers' feedback comments. We also quantitatively evaluate each step of our methods and study how well human agree on such a summarization task. The proposed methods are quite general and can be used to generate rated aspect summary automatically given any collection of short comments each associated with an overall rating.


Deep Learning as Feature Encoding for Emotion Recognition

Deep learning is popular as an end-to-end framework extracting the prominent features and performing the classification also. In this paper, we extensively investigate deep networks as an alternate to feature encoding technique of lowlevel descriptors for emotion recognition on the benchmark EmoDB dataset. Fusion performance with such obtained encoded features with other available features is also investigated. Highest performance to date in the literature is observed.


Camera/Laser/GPS Fusion Method for Vehicle Positioning Under Extended NIS-Based Sensor Validation

Vehicle localization and autonomous navigation consist of precisely positioning a vehicle on road by the use of different kinds of sensors. This paper presents a vehicle localization method by integrating a stereoscopic system, a laser range finder (LRF) and a global localization sensor GPS. For more accurate LRF-based vehicle motion estimation, an outlier-rejection invariant closest point method (ICP) is proposed to reduce the matching ambiguities of scan alignment. The fusion approach starts by a sensor selection step that is applied to validate the coherence of the observations from different sensors. Then the information provided by the validated sensors is fused with an unscented information filter. To demonstrate its performance, the proposed multisensor localization method is tested with real data and evaluated by RTK-GPS data as ground truth. The fusion approach also facilitates the incorporation of more sensors if needed.


mOS: A Reusable Networking Stack for Flow Monitoring Middleboxes

Stateful middleboxes, such as intrusion detection systems and application-level firewalls, have provided key functionalities in operating modern IP networks. However, designing an efficient middlebox is challenging due to the lack of networking stack abstraction for TCP flow processing. Thus, middlebox developers often write the complex flow management logic from scratch, which is not only prone to errors, but also wastes efforts for similar functionalities across applications. This paper presents the design and implementation of mOS, a reusable networking stack for stateful flow processing in middlebox applications. Our API allows developers to focus on the core application logic instead of dealing with low-level packet/flow processing themselves. Under the hood, it implements an efficient event system that scales to monitoring millions of concurrent flow events. Our evaluation demonstrates that mOS enables modular development of stateful middleboxes, often significantly reducing development efforts represented by the source lines of code, while introducing little performance overhead in multi-10Gbps network environments.


An architecture of diversity for commonsense reasoning

Although computers excel at certain bounded tasks that are difficult for humans, such as solving integrals, they have difficulty performing commonsense tasks that are easy for humans, such as understanding stories. In this Technical Forum contribution, we discuss commonsense reasoning and what makes it difficult for computers. We contend that commonsense reasoning is too hard a problem to solve using any single artificial intelligence technique. We propose a multilevel architecture consisting of diverse reasoning and representation techniques that collaborate and reflect in order to allow the best techniques to be used for the many situations that arise in commonsense reasoning. We present story understanding—specifically, understanding and answering questions about progressively harder children’s texts—as a task for evaluating and scaling up a commonsense reasoning system.


The role of satellites in 5G

The next generation of mobile radio communication systems - so called 5G - will provide some major changes to those generations to date. The ability to cope with huge increases in data traffic at reduced latencies and improved quality of user experience together with major reduction in energy usage are big challenges. In addition future systems will need to embody connections to billions of objects - the so called Internet of Things (IoT) which raise new challenges. Visions of 5G are now available from regions across the World and research is ongoing towards new standards. The consensus is a flatter architecture that adds a dense network of small cells operating in the millimetre wave bands and which are adaptable and software controlled. But what place for satellites in such a vision? The paper examines several potential roles for satellite including coverage extension, content distribution, providing resilience, improved spectrum utilisation and integrated signalling systems.


Survey of Pedestrian Detection for Advanced Driver Assistance Systems

Advanced driver assistance systems (ADASs), and particularly pedestrian protection systems (PPSs), have become an active research area aimed at improving traffic safety. The major challenge of PPSs is the development of reliable on-board pedestrian detection systems. Due to the varying appearance of pedestrians (e.g., different clothes, changing size, aspect ratio, and dynamic shape) and the unstructured environment, it is very difficult to cope with the demanded robustness of this kind of system. Two problems arising in this research area are the lack of public benchmarks and the difficulty in reproducing many of the proposed methods, which makes it difficult to compare the approaches. As a result, surveying the literature by enumerating the proposals one--after-another is not the most useful way to provide a comparative point of view. Accordingly, we present a more convenient strategy to survey the different approaches. We divide the problem of detecting pedestrians from images into different processing steps, each with attached responsibilities. Then, the different proposed methods are analyzed and classified with respect to each processing stage, favoring a comparative viewpoint. Finally, discussion of the important topics is presented, putting special emphasis on the future needs and challenges.


A study on LIWC categories for opinion mining in Spanish reviews

With the exponential growth of social media i.e. blogs and social networks, organizations and individual persons are increasingly using the number of reviews of these media for decision making about a product or service. Opinion mining detects whether the emotions of an opinion expressed by a user on Web platforms in natural language, is positive or negative. This paper presents extensive experiments to study the effectiveness of the classification of Spanish opinions in five categories: highly positive, highly negative, positive, negative and neutral, using the combination of the psychological and linguistic features of LIWC. LIWC is a text analysis software that enables the extraction of different psychological and linguistic features from natural language text. For this study, two corpora have been used, one about movies and one about technological products. Furthermore, we have conducted a comparative assessment of the performance of various classification techniques: J48, SMO and BayesNet, using precision, recall and F-measure metrics. All in all, findings have revealed that the positive and negative categories provide better results than the other categories. Finally, experiments on both corpora indicated that SMO produces better results than BayesNet and J48 algorithms, obtaining an F-measure of 90.4% and 87.2% in each domain.


Crowdsourcing for on-street smart parking

Crowdsourcing has inspired a variety of novel mobile applications. However, identifying common practices across different applications is still challenging. In this paper, we use smart parking as a case study to investigate features of crowdsourcing that may apply to other mobile applications. Based on this we derive principles for efficiently harnessing crowdsourcing. We draw three key guidelines: First, we suggest that that the organizer can play an important role in coordinating participants', a key factor to successful crowdsourcing experience. Second, we suggest that the expected participation rate is a key factor when designing the crowdsourcing system: a system with a lower expected participation rate will place a higher burden in individual participants (e.g., through more complex interfaces that aim to improve the accuracy of the collected data). Finally, we suggest that not only above certain threshold of contributors, a crowdsourcing-based system is resilient to freeriding but, surprisingly, that including freeriders (i.e., actors that do not participate in system effort but share its benefits in terms of coordination) benefits the entire system.


Optimal Dynamic Assortment Planning with Demand Learning

We study a family of stylized assortment planning problems, where arriving customers make purchase decisions among offered products based on maximizing their utility. Given limited display capacity and no a priori information on consumers’ utility, the retailer must select which subset of products to offer. By offering different assortments and observing the resulting purchase behavior, the retailer learns about consumer preferences, but this experimentation should be balanced with the goal of maximizing revenues. We develop a family of dynamic policies that judiciously balance the aforementioned tradeoff between exploration and exploitation, and prove that their performance cannot be improved upon in a precise mathematical sense. One salient feature of these policies is that they “quickly” recognize, and hence limit experimentation on, strictly suboptimal products.


A Fast Deep Learning Model for Textual Relevance in Biomedical Information Retrieval

Publications in the life sciences are characterized by a large technical vocabulary, with many lexical and semantic variations for expressing the same concept. Towards addressing the problem of relevance in biomedical literature search, we introduce a deep learning model for the relevance of a document’s text to a keyword style query. Limited by a relatively small amount of training data, the model uses pre-trained word embeddings. With these, the model first computes a variable-length Delta matrix between the query and document, representing a difference between the two texts, which is then passed through a deep convolution stage followed by a deep feed-forward network to compute a relevance score. This results in a fast model suitable for use in an online search engine. The model is robust and outperforms comparable state-of-the-art deep learning approaches.


SK-LSH: An Efficient Index Structure for Approximate Nearest Neighbor Search

Approximate Nearest Neighbor (ANN) search in high dimensional space has become a fundamental paradigm in many applications. Recently, Locality Sensitive Hashing (LSH) and its variants are acknowledged as the most promising solutions to ANN search. However, state-of-the-art LSH approaches suffer from a drawback: accesses to candidate objects require a large number of random I/O operations. In order to guarantee the quality of returned results, sufficient objects should be verified, which would consume enormous I/O cost. To address this issue, we propose a novel method, called SortingKeys-LSH (SK-LSH), which reduces the number of page accesses through locally arranging candidate objects. We firstly define a new measure to evaluate the distance between the compound hash keys of two points. A linear order relationship on the set of compound hash keys is then created, and the corresponding data points can be sorted accordingly. Hence, data points that are close to each other according to the distance measure can be stored locally in an index file. During the ANN search, only a limited number of disk pages among few index files are necessary to be accessed for sufficient candidate generation and verification, which not only significantly reduces the response time but also improves the accuracy of the returned results. Our exhaustive empirical study over several real-world data sets demonstrates the superior efficiency and accuracy of SK-LSH for the ANN search, compared with state-of-the-art methods, including LSB, C2LSH and CK-Means.


Ontology-based Aspect Extraction for an Improved Sentiment Analysis in Summarization of Product Reviews

Current approaches in aspect-based sentiment analysis ignore or neutralize unhandled issues emerging from the lexicon-based scoring (i.e., SentiWordNet), whereby lexical sentiment analysis only classifies text based on affect word presence and word count are limited to these surface features. This is coupled with considerably low detection rate among implicit concepts in the text. To address this issues, this paper proposed the use of ontology to i) enhance aspect extraction process by identifying features pertaining to implicit entities, and ii) eliminate lexicon-based sentiment scoring issues which, in turn, improve sentiment analysis and summarization accuracy. Concept-level sentiment analysis aims to go beyond word-level analysis by employing ontologies which act as a semantic knowledge base rather than the lexicon. The outcome is an Ontology-Based Product Sentiment Summarization (OBPSS) framework which outperformed other existing summarization systems in terms of aspect extraction and sentiment scoring. The improved performance is supported by the sentence-level linguistic rules applied by OBPSS in providing a more accurate sentiment analysis.


RECOGNITION WITH WEIGHTED FINITE-STATE TRANSDUCERS

This chapter describes a general representation and algorithmic framework for speech recognition based on weighted finite-state transducers. These transducers provide a common and natural representation for major components of speech recognition systems, including hidden Markov models (HMMs), context-dependency models, pronunciation dictionaries, statistical grammars, and word or phone lattices. General algorithms for building and optimizing transducer models are presented, including composition for combining models, weighted determinization and minimization for optimizing time and space requirements, and a weight pushing algorithm for redistributing transition weights optimally for speech recognition. The application of these methods to large-vocabulary recognition tasks is explained in detail, and experimental results are given, in particular for the North American Business News (NAB) task, in which these methods were used to combine HMMs, full cross-word triphones, a lexicon of forty thousand words, and a large trigram grammar into a single weighted transducer that is only somewhat larger than the trigram word grammar and that runs NAB in real-time on a very simple decoder. Another example demonstrates that the same methods can be used to optimize lattices for second-pass recognition.


Ranking in context using vector spaces

This paper presents a principled approach to the problem of retrieval in context. The notion of basis of a vector space was introduced previously to describe context. Any basis vectors represents a distinct piece of context, such as time, space, or word meaning. A vector is generated by a basis just as an informative object or an information need is generated in a context. As a consequence a different basis generates a different vector as a different context would generate different information needs or informative objects. Also the Vector Space Model (VSM) describes information needs and informative objects as query vectors and document vectors, respectively. However the VSM assumes that there is a unique basis, which is the set of versors and always generates the same vector provided the same coefficients. Thus a drawback of the VSM is that the vectors are insensitive to context, i.e. they are generated and ranked in the same way independently of the context in which information need and informative objects are. This paper also proposes a function to rank documents in context. Since a basis spans a subspace, which includes all the vectors of object being in the same context, the ranking function is a distance measure between the document vector and the subspace. Even though ranking is still based on an inner product between two vectors, the basic difference is that projection and distance depend on the basis, i.e. on the pieces of context and then ultimately on context. Since an informative object can be produced by different contexts, different bases can arise and then ranking can change. Mathematically, object vector generation is given by x = p1b1 + · · · p k b k = x = B · p, where B is a n × k (k ≤ n) complex matrix and p is a k × 1 real vector. The b's are independent vectors and as such form a basis B of a subspace L(B) of C n. The basis generates all the vectors in L(B) and every vector in it describes an informative object produced within the context described by B. It should be clear that every vector x in L(B) is entirely contained in the subspace spanned by B. Any other vector of the vector space may not be entirely contained in the subspace L(B) and may be more or less close to it. A vector y …


A Comparative Study of Bug Algorithms for Robot Navigation

This paper presents a literature survey and a comparative study of Bug Algorithms, with the goal of investigating their potential for robotic navigation. At first sight, these methods seem to provide an efficient navigation paradigm, ideal for implementations on tiny robots with limited resources. Closer inspection, however, shows that many of these Bug Algorithms assume perfect global position estimate of the robot which in GPS-denied environments implies considerable expenses of computation and memory – relying on accurate Simultaneous Localization And Mapping (SLAM) or Visual Odometry (VO) methods. We compare a selection of Bug Algorithms in a simulated robot and environment where they endure different types noise and failure-cases of their on-board sensors. From the simulation results, we conclude that the implemented Bug Algorithms’ performances are sensitive to many types of sensor-noise, which was most noticeable for odometry-drift. This raises the question if Bug Algorithms are suitable for real-world, on-board, robotic navigation as is. Variations that use multiple sensors to keep track of their progress towards the goal, were more adept in completing their task in the presence of sensor-failures. This shows that Bug Algorithms must spread their risk, by relying on the readings of multiple sensors, to be suitable for real-world deployment.


Adaptive Binary Search Trees Jonathan Carlyle Derryberry

A ubiquitous problem in the field of algorithms and data structures is that of searching for an element from an ordered universe. The simple yet powerful binary search tree (BST) model provides a rich family of solutions to this problem. Although BSTs require Ω(lg n) time per operation in the worst case, various adaptive BST algorithms are capable of exploiting patterns in the sequence of queries to achieve tighter, input-sensitive, bounds that can be o(lg n) in many cases. This thesis furthers our understanding of what is achievable in the BST model along two directions. First, we make progress in improving instance-specific lower bounds in the BST model. In particular, we introduce a framework for generating lower bounds on the cost that any BST algorithm must pay to execute a query sequence, and we show that this framework generalizes previous lower bounds. This suggests that the optimal lower bound in the framework is a good candidate for being tight to within a constant factor of the optimal BST algorithm for each input. Further, we show that lower bounds in this framework are also valid lower bounds for instances of the partial-sums problem in a restricted model of computation, which suggests that augmented BSTs may be the most efficient way of maintaining sums over ranges of an array when the entries of the array can be updated throughout time. Second, we improve the input-sensitive upper bounds that are known to be achievable in the BST model by introducing two new BST algorithms, skip-splay and cache-splay. These two algorithms are the first BSTs that are known to have running times that have nontrivial competitiveness to Iacono’s Unified Bound, which is a generalization of the dynamic finger and working set bounds. Skip-splay is a simple algorithm that is nearly identical to splaying, and it achieves a running time that is within additive O(lg lg n) per operation of the Unified Bound. Cache-splay is a slightly more complicated splay-based algorithm that is the first BST to achieve the Unified Bound to within a constant factor.


Multilevel Color Transfer on Images for Providing an Artistic Sight of the World

This paper represents a twofold approach. On the one hand, we introduce a simple method that encompasses an ensemble of image processing algorithms with a multilevel color transfer approach at its core. On the other hand, the method is applied for providing an artistic look to standard images. The approach proposes a multilevel color transfer in a chromatic channel of the CIELAB color space. Once converted from red, green and blue, a specific channel on both images, input and target (reference), is thresholded in a number of levels. Later, the color transfer is performed between regions from corresponding levels using a classical color transfer method. In the application phase, the color palette of a recognized artwork of the Fauve movement is mapped to the input image, emulating the sight of the artist, characterized by the use of vivid colors. Filtering techniques are applied to the outcome, in order to emulate the basic brushstrokes of the artist. Experimental results are shown, visualizing and comparing the input images with the outcomes.


Collaborative process planning and manufacturing in product lifecycle management

Companies are moving towards quickly providing better customer-centric products and services improve market share and market size with continuously growing revenue. As such, the effective collaboration among customers, developers, suppliers, and manufacturers throughout the entire product lifecycle is becoming much more important for the most advanced competitiveness. To address this need, a framework for product lifecycle collaboration is proposed in this study. The details of these collaboration models throughout the entire product lifecycle are depicted. As one of the key elements in product lifecycle collaboration, technology to support collaborative product manufacturing is proposed, developed and implemented in this study. It is hoped that the developed technology for collaborative product manufacturing will lay a frontier basis for further research and development in product lifecycle management. # 2007 Elsevier B.V. All rights reserved.


Kalman Filtering in Wireless Sensor Networks

Challenges associated with the scarcity of bandwidth and power in wireless communications have to be addressed. For the state-estimation problems discussed in the paper, observations about a common state are collected by physically distributed terminals. To perform state estimation, wireless sensor networks (WSNs) may share these observations with each other or communicate them to a fusion center for centralized processing. With K vector observations {yk(n)}K k=1 available, the optimal mean squared error (MSE) estimation of the state x(n) for the linear model is accomplished by a Kalman filter.


A Novel Four-DOF Parallel Manipulator Mechanism and Its Kinematics

A novel 4-UPU parallel manipulator mechanism that can perform three-dimensional translations and rotation about Z axis is presented. The principle that the mechanism can perform the above motions is analyzed based on the screw theory, the mobility of the mechanism is calculated, and the rationality of the chosen input joints is discussed. The forward and inverse position kinematics solutions of the mechanism and corresponding numerical examples are given, the workspace and the singularity of the parallel mechanism are discussed. The mechanism having the advantages of simple symmetric structure and large stiffness can be applied to the developments of NC positioning platforms, parallel machine tools, four-dimensional force sensors and micro-positional parallel manipulators


A highly efficient power harvester with wide dynamic input power range for 900 MHz wireless power transfer applications

This work demonstrates the design of an adaptive reconfigurable rectifier to address the issue of early breakdown voltage in a conventional rectifier and extends the rectifier's operation for wide dynamic input power range. A depletion-mode field-effect transistor has been introduced to operate as a switch and compensate at low and high input power levels for rectifier. This design accomplishes 40% of RF-DC power conversion efficiency over a wide dynamic input power range from -10 dBm to 27 dBm, while exhibiting 78% of peak power efficiency at 22 dBm. The power harvester is designed to operate in the 900 MHz ISM band and suitable for Wireless Power Transfer applications.


FCNN: Fourier Convolutional Neural Networks

The Fourier domain is used in computer vision and machine learning as image analysis tasks in the Fourier domain are analogous to spatial domain methods but are achieved using different operations. Convolutional Neural Networks (CNNs) use machine learning to achieve state-of-the-art results with respect to many computer vision tasks. One of the main limiting aspects of CNNs is the computational cost of updating a large number of convolution parameters. Further, in the spatial domain, larger images take exponentially longer than smaller image to train on CNNs due to the operations involved in convolution methods. Consequently, CNNs are often not a viable solution for large image computer vision tasks. In this paper a Fourier Convolution Neural Network (FCNN) is proposed whereby training is conducted entirely within the Fourier domain. The advantage offered is that there is a significant speed up in training time without loss of effectiveness. Using the proposed approach larger images can therefore be processed within viable computation time. The FCNN is fully described and evaluated. The evaluation was conducted using the benchmark Cifar10 and MNIST datasets, and a bespoke fundus retina image dataset. The results demonstrate that convolution in the Fourier domain gives a significant speed up without adversely affecting accuracy. For simplicity the proposed FCNN concept is presented in the context of a basic CNN architecture, however, the FCNN concept has the potential to improve the speed of any neural network system involving convolution.


Information Gain-based Exploration Using Rao-Blackwellized Particle Filters

This paper presents an integrated approach to exploration, mapping, and localization. Our algorithm uses a highly efficient Rao-Blackwellized particle filter to represent the posterior about maps and poses. It applies a decision-theoretic framework which simultaneously considers the uncertainty in the map and in the pose of the vehicle to evaluate potential actions. Thereby, it trades off the cost of executing an action with the expected information gain and takes into account possible sensor measurements gathered along the path taken by the robot. We furthermore describe how to utilize the properties of the Rao-Blackwellization to efficiently compute the expected information gain. We present experimental results obtained in the real world and in simulation to demonstrate the effectiveness of our approach.


A Hybrid Approach to Vietnamese Word Segmentation Using Part of Speech Tags

Word segmentation is one of the most important tasks in NLP. This task, within Vietnamese language and its own features, faces some challenges, especially in words boundary determination. To tackle the task of Vietnamese word segmentation, in this paper, we propose the WS4VN system that uses a new approach based on Maximum matching algorithm combining with stochastic models using part-of-speech information. The approach can resolve word ambiguity and choose the best segmentation for each input sentence. Our system gives a promising result with an F-measure of 97%, higher than the results of existing publicly available Vietnamese word segmentation systems.


20 years of the SMART protein domain annotation resource

SMART (Simple Modular Architecture Research Tool) is a web resource (http://smart.embl.de) for the identification and annotation of protein domains and the analysis of protein domain architectures. SMART version 8 contains manually curated models for more than 1300 protein domains, with approximately 100 new models added since our last update article (1). The underlying protein databases were synchronized with UniProt (2), Ensembl (3) and STRING (4), doubling the total number of annotated domains and other protein features to more than 200 million. In its 20th year, the SMART analysis results pages have been streamlined again and its information sources have been updated. SMART's vector based display engine has been extended to all protein schematics in SMART and rewritten to use the latest web technologies. The internal full text search engine has been redesigned and updated, resulting in greatly increased search speed.


2-hop Blockchain : Combining Proof-of-Work and Proof-of-Stake Securely

Cryptocurrencies like Bitcoin have proven to be a phenomenal success. Bitcoin-like systems use proofof-work mechanism which is therefore considered as 1-hop blockchain, and their security holds if the majority of the computing power is under the control of honest players. However, this assumption has been seriously challenged recently and Bitcoin-like systems will fail when this assumption is broken. We propose the rst provably secure 2-hop blockchain by combining proof-of-work (rst hop) and proof-of-stake (second hop) mechanisms. On top of Bitcoin’s brilliant ideas of utilizing the power of the honest miners, via their computing resources, to secure the blockchain, we further leverage the power of the honest users/stakeholders, via their coins/stake, to achieve this goal. e security of our blockchain holds if the honest players control majority of the collective resources (which consists of both computing power and stake). at said, even if the adversary controls more than 50% computing power, the honest players still have the chance to defend the blockchain via honest stake. ∗An early version with title “Securing Bitcoin-like Blockchains against a Malicious Majority of Computing Power” appeared in ePrint Archive in July 2016. e current version shares the same motivation. But the construction idea and modeling approach have been completely revised. †Virginia Commonwealth University. Email: duong3@vcu.edu. ‡Shanghai Jiao Tong University. Most work done while visiting Cryptography Lab at Virginia Commonwealth University. Email: fanlei@sjtu.edu.cn. §Virginia Commonwealth University. Email: hszhou@vcu.edu.


An Approximation Algorithm for the Noah's Ark Problem with Random Feature Loss

The phylogenetic diversity (PD) of a set of species is a measure of their evolutionary distinctness based on a phylogenetic tree. PD is increasingly being adopted as an index of biodiversity in ecological conservation projects. The Noah's Ark Problem (NAP) is an NP-Hard optimization problem that abstracts a fundamental conservation challenge in asking to maximize the expected PD of a set of taxa given a fixed budget, where each taxon is associated with a cost of conservation and a probability of extinction. Only simplified instances of the problem, where one or more parameters are fixed as constants, have as of yet been addressed in the literature. Furthermore, it has been argued that PD is not an appropriate metric for models that allow information to be lost along paths in the tree. We therefore generalize the NAP to incorporate a proposed model of feature loss according to an exponential distribution and term this problem NAP with Loss (NAPL). In this paper, we present a pseudopolynomial time approximation scheme for NAPL.


Digital anthropometry for human body measurement on android platform

Anthropometry is the science of measuring the size and proportions of the human body. Based on the current researches, callipers and tape measures are the instruments used in measuring body length of an individual. Anthropometry is mostly conducted by the tailors as well as interior designers. This study aims to develop Digital Anthropometry for Human Body Measurement Using OpenCV on Android Platform which automatically measures human body using android phone. These body parts to be measured are represented by a marker; shoulder width, sleeve length, body length, back-waist length, back-neck-to-cuff, cross-back, outseam and inseam. For the accuracy, the distance requirement of the device is 30 inches away from the subject for upper body and 62 inches for the lower body. The required color shirt of the subject is a white and black pants or shorts, the required background color is white and bright surrounding is required.


Skin lesions on yellowfin tuna Thunnus albacares from Gulf of Mexico outer continental shelf: Morphological, molecular, and histological diagnosis of infection by a capsalid monogenoid.

We characterize lesion-associated capsaline infections on yellowfin tuna, Thunnus albacares, in the Gulf of Mexico by comparing our specimens with published descriptions and museum specimens ascribed to Capsala biparasiticum and its synonyms: vouchers of C. biparasiticum from parasitic copepods; the holotype of Capsala neothunni; and vouchers of Capsala abidjani. Those from parasitic copepods differed by having a small, rounded body, large anterior attachment organs, closely spaced dorsomarginal body sclerites, small testes, and a short and wide testicular field. No morphometric feature in the holotype of C. neothunni ranged outside of that reported for the newly-collected specimens, indicating conspecificity of our specimens. The specimens of C. abidjani differed by having a large anterior attachment organ, few and dendritic testes, and a short, wide testicular field. Large subunit ribosomal DNA (28S) sequences grouped our specimens and Capsala sp. as sister taxa and indicated a phylogenetic affinity of Nasicola klawei. The haptoral attachment site comprised a crater-like depression surrounded by a blackish-colored halo of extensively rugose skin, with abundant pockmarked-like, irregularly-shaped oblong or semi-circular epidermal pits surrounding these attachment sites. Histology confirmed extensive folding of epidermis and underlying stratum laxum, likely epidermal hyperplasia, foci of weak cell-to-cell adhesions among apical malpighian cells as well as that between stratum germinativum and stratum laxum, myriad goblet cells in epidermis, rodlet cells in apical layer of epidermis, and lymphocytic infiltrates and melanin in dermis. The present study comprises (i) the first published report of this parasite from yellowfin tuna captured in the Gulf of Mexico-NW Atlantic Ocean Basin, (ii) confirmation of its infection on the skin (rather than on a parasitic copepod), (iii) the first molecular data for this capsaline, and (iv) the first observations of histopathological changes associated with a capsalid infection on a wild-caught epipelagic fish.


Capturing Handwritten Ink Strokes with a Fast Video Camera

We present a system for capturing ink strokes written with ordinary pen and paper using a fast camera with a frame rate comparable to a stylus digitizer. From the video frames, ink strokes are extracted and used as input to an online handwriting recognition engine. A key component in our system is a pen up/down detection model for detecting the contact of the pen-tip with the paper in the video frames. The proposed model consists of feature representation with convolutional neural networks and classification with a recurrent neural network. We also use a high speed tracker with kernelized correlation filters to track the pen-tip. For training and evaluation, we collected labeled video data of users writing English and Japanese phrases from public datasets, and we report on character accuracy scores for different frame rates in the two languages.


Accelerating computer vision algorithms using OpenCL framework on the mobile GPU - A case study

Recently, general-purpose computing on graphics processing units (GPGPU) has been enabled on mobile devices thanks to the emerging heterogeneous programming models such as OpenCL. The capability of GPGPU on mobile devices opens a new era for mobile computing and can enable many computationally demanding computer vision algorithms on mobile devices. As a case study, this paper proposes to accelerate an exemplar-based inpainting algorithm for object removal on a mobile GPU using OpenCL. We discuss the methodology of exploring the parallelism in the algorithm as well as several optimization techniques. Experimental results demonstrate that our optimization strategies for mobile GPUs have significantly reduced the processing time and make computationally intensive computer vision algorithms feasible for a mobile device. To the best of the authors' knowledge, this work is the first published implementation of general-purpose computing using OpenCL on mobile GPUs.


Business ecosystem analysis framework

The concept of business ecosystems has gained popularity from researchers and practitioners since first introduced in Moore's article in Harvard Business Review in 1993 “Predators and prey: a new ecology of competition”. Inspired by biology, the concept of business ecosystems provides a metaphor to comprehend the inter-wined nature of industries [1]. The reason behind the popularity of this concept and its differentiation from other business theories like Osterwalder's Business Model Canvas [2] and Porter's Value Chain Approach [3] is its comprehensiveness and inclusion of several other components surrounding any business. In this paper, the necessary methods, components and tools for creating, analyzing and managing a business ecosystem successfully will be introduced. The aim of the paper is to propose a Business Ecosystem Analysis Framework that covers all the steps needed to analyze, manage and ensure the feasibility and sustainability of any ecosystem. This framework can be used to locate strengths and weaknesses of an ecosystem, identify its main actors and define how their maturity, interconnectedness and continuity can be improved. The results of the research can be applied to any industry sector.


A compact cavity filter with novel TM mode dielectric resonator structure

A novel transverse magnetic (TM) mode dielectric resonator and its filter realization are proposed for mobile communication system miniaturization applications. Single dielectric resonator and an eight-pole filter with three-transmission-zeros are modeled and designed for desired specification by using efficient optimization technique. About 30% horizontal dimensions are saved comparing with the common coaxial filter. Excellent filter responses are obtained and measured.


Exploiting Morphological Regularities in Distributional Word Representations

We present an unsupervised, language agnostic approach for exploiting morphological regularities present in high dimensional vector spaces. We propose a novel method for generating embeddings of words from their morphological variants using morphological transformation operators. We evaluate this approach on MSR word analogy test set (Mikolov et al., 2013d) with an accuracy of 85% which is 12% higher than the previous best known system.


Evolution for automatic assessment of the difficulty of sokoban boards

Many games have a collection of boards with the difficulty of an instance of the game determined by the starting configuration of the board. Correctly rating the difficulty of the boards is somewhat haphazard and required either a remarkable level of understanding of the game or a good deal of play-testing. In this study we explore evolutionary algorithms as a tool to automatically grade the difficulty of boards for a version of the game sokoban. Mean time-to-solution by an evolutionary algorithm and number of failures to solve a board are used as a surrogate for the difficulty of a board. Initial testing with a simple string-based representation, giving a sequence of moves for the sokoban agent, provided very little signal; it usually failed. Two other representations, based on a reactive linear genetic programming structure called an ISAc list, generated useful hardness-classification information for both hardness surrogates. These two representations differ in that one uses a randomly initialized population of ISAc lists while the other initializes populations with competent agents pre-trained on random collections of sokoban boards. The study encompasses four hardness surrogates: probability-of-failure and mean time-to-solution for each of these two representations. All four are found to generate similar information about board hardness, but probability-of-failure with pre-evolved agents is found to be faster to compute and to have a clearer meaning than the other three board-hardness surrogates.


Survey of microphthalmia in Japan

To report the current status of patients with microphthalmia based on a cross-sectional survey of patient hospital visits. A questionnaire was sent to the departments of ophthalmology in 1,151 major Japanese hospitals to survey the following: the number of patients with microphthalmia who visited the outpatient clinics between January 2008 and December 2009; gender; age; family history; associated ocular anomalies; complications and systemic diseases; surgical treatment; vision and management. A retrospective quantitative registry of 1,254 microphthalmic eyes (851 patients) from 454 hospitals (39.4%) was compiled. Of the patients for whom data were available, 50% ranged in age from 0 to 9 years. The major ocular findings were nanophthalmos, coloboma, and vitreoretinal malformations. Ocular complications frequently developed, including cataracts, glaucoma, and retinal detachment. Surgery was performed in 21.4% of all cases, and systemic diseases were present in 31% of all cases. The vision associated with microphthalmia exceeded 0.1 in about 30% of the eyes. Glasses and low vision aids were used by 21.6% of patients. Patients with microphthalmia often have ocular and systemic anomalies. Early assessment and preservation of vision and long-term complication management are needed.


Pose Estimation from Line Correspondences using Direct Linear Transformation

Ansar, the method by Ansar and Daniilidis (2003), implementation from Xu et al. (2016). Mirzaei, the method by Mirzaei and Roumeliotis (2011). RPnL, the method by Zhang et al. (2013). ASPnL, the method by Xu et al. (2016). LPnL Bar LS, the method by Xu et al. (2016). LPnL Bar ENull, the method by Xu et al. (2016). DLT-Lines, the method by Hartley and Zisserman (2004, p. 180), our implementation. DLT-Plücker-Lines, the method by Přibyl et al. (2015), our implementation. DLT-Combined-Lines, the proposed method.


New Maximum Power Point Tracker Using Sliding-Mode Observer for Estimation of Solar Array Current in the Grid-Connected Photovoltaic System

A new maximum power point tracker (MPPT) for a grid-connected photovoltaic system without solar array current sensor is proposed. The solar array current information is obtained from the sliding-mode observer and fed into the MPPT to generate the reference voltage. The parameter values such as capacitances can be changed up to 50% from their nominal values, and the linear observer cannot estimate the correct state values under the parameter variations and noisy environments. The structure of a sliding-mode observer is simple, but it shows the robust tracking property against modeling uncertainties and parameter variations. In this paper, the sliding-mode observer for the solar array current has been proposed to compensate for the parameter variations. The mathematical modeling and the experimental results verify the validity of the proposed method


THE CRIMINAL PSYCHOPATH: HISTORY, NEUROSCIENCE, TREATMENT, AND ECONOMICS.

The manuscript surveys the history of psychopathic personality, from its origins in psychiatric folklore to its modern assessment in the forensic arena. Individuals with psychopathic personality, or psychopaths, have a disproportionate impact on the criminal justice system. Psychopaths are twenty to twenty-five times more likely than non-psychopaths to be in prison, four to eight times more likely to violently recidivate compared to non-psychopaths, and are resistant to most forms of treatment. This article presents the most current clinical efforts and neuroscience research in the field of psychopathy. Given psychopathy's enormous impact on society in general and on the criminal justice system in particular, there are significant benefits to increasing awareness of the condition. This review also highlights a recent, compelling and cost-effective treatment program that has shown a significant reduction in violent recidivism in youth on a putative trajectory to psychopathic personality.


A Precoding-Based Multicarrier Non-Orthogonal Multiple Access Scheme for 5G Cellular Networks

Non-orthogonal multiple access (NOMA) has become one of the desirable schemes for the 5G cellular network standard due to its better cell coverage capability, higher data rate, and massive connectivity. Orthogonal frequency division multiplexing (OFDM) can be combined with NOMA to get the higher spectral efficiency. The main drawback of OFDM-based NOMA (OFDM-NOMA) scheme is high peak-to-average power ratio (PAPR). Therefore, this paper presents a new discrete-cosine transform matrix precoding-based uplink OFDM-NOMA scheme for PAPR reduction. Additionally, the proposed precoding-based uplink multicarrier NOMA scheme takes advantage of information spreading over the entire signal spectrum; thus, bit-error rate is also reduced. Simulation results show that the proposed precoding-based NOMA scheme outperforms as compared with the non-precoding-based NOMA schemes available in the literature.


Moral Responsibility and Determinism : The Cognitive Science of Folk Intuitions

The dispute between compatibilists and incompatibilists must be one of the most persistent and heated deadlocks in Western philosophy. Incompatibilists maintain that people are not fully morally responsible if determinism is true, i.e., if every event is an inevitable consequence of the prior conditions and the natural laws. By contrast, compatibilists maintain that even if determinism is true our moral responsibility is not undermined in the slightest, for determinism and moral responsibility are perfectly consistent.1 The debate between these two positions has invoked many different resources, including quantum mechanics, social psychology, and basic metaphysics. But recent discussions have relied heavily on arguments that draw on people’s intuitions about particular cases. Some philosophers have claimed that people have incompatibilist intuitions (e.g., Kane 1999, 218; Strawson 1986, 30; Vargas 2006); others have challenged this claim and suggested that people’s intuitions actually fit with compatibilism (Nahmias et al. 2005). But although philosophers have constructed increasingly sophisticated arguments about the implications of people’s intuitions, there has been remarkably little discussion about why people have the intuitions they do. That is to say, relatively little has been said about the specific psychological processes that generate or sustain people’s intuitions. And yet, it seems clear that questions about the sources of people’s intuitions could have a major impact on debates


Persian-English Machine Translation: An Overview of the Shiraz Project

This report describes the Shiraz project MT prototype for a Persian to English machine translation system using typed feature structures and unification. An overview of the linguistic properties of Persian is presented and the morphological and syntactic grammars developed within the Shiraz project are discussed. The underlying model for the system is a layered chart, capable of representing heterogeneous types of hypotheses in an integrated way. .. 2 ...... 2 ..... 4 ... 5 ..... 5 ... .. 9 ... 9 .... 9 .. 11 ... 11 ... 11 ... 11 13 ... 13 ..... 15 ..... 15 ... .... ... 16 ... 17 .... 17 ... 18 ... 18 ... 18 .... 19 ... 19 ... 19 .... 19 .... 20


False data injection attacks against state estimation in electric power grids

A power grid is a complex system connecting electric power generators to consumers through power transmission and distribution networks across a large geographical area. System monitoring is necessary to ensure the reliable operation of power grids, and state estimation is used in system monitoring to best estimate the power grid state through analysis of meter measurements and power system models. Various techniques have been developed to detect and identify bad measurements, including interacting bad measurements introduced by arbitrary, nonrandom causes. At first glance, it seems that these techniques can also defeat malicious measurements injected by attackers.
 In this article, we expose an unknown vulnerability of existing bad measurement detection algorithms by presenting and analyzing a new class of attacks, called false data injection attacks, against state estimation in electric power grids. Under the assumption that the attacker can access the current power system configuration information and manipulate the measurements of meters at physically protected locations such as substations, such attacks can introduce arbitrary errors into certain state variables without being detected by existing algorithms. Moreover, we look at two scenarios, where the attacker is either constrained to specific meters or limited in the resources required to compromise meters. We show that the attacker can systematically and efficiently construct attack vectors in both scenarios to change the results of state estimation in arbitrary ways. We also extend these attacks to generalized false data injection attacks, which can further increase the impact by exploiting measurement errors typically tolerated in state estimation. We demonstrate the success of these attacks through simulation using IEEE test systems, and also discuss the practicality of these attacks and the real-world constraints that limit their effectiveness.


Real versus imagined locomotion: A [<ce:sup loc=post>18</ce:sup>F]-FDG PET-fMRI comparison

The cortical, cerebellar and brainstem BOLD-signal changes have been identified with fMRI in humans during mental imagery of walking. In this study the whole brain activation and deactivation pattern during real locomotion was investigated by [(18)F]-FDG-PET and compared to BOLD-signal changes during imagined locomotion in the same subjects using fMRI. Sixteen healthy subjects were scanned at locomotion and rest with [(18)F]-FDG-PET. In the locomotion paradigm subjects walked at constant velocity for 10 min. Then [(18)F]-FDG was injected intravenously while subjects continued walking for another 10 min. For comparison fMRI was performed in the same subjects during imagined walking. During real and imagined locomotion a basic locomotion network including activations in the frontal cortex, cerebellum, pontomesencephalic tegmentum, parahippocampal, fusiform and occipital gyri, and deactivations in the multisensory vestibular cortices (esp. superior temporal gyrus, inferior parietal lobule) was shown. As a difference, the primary motor and somatosensory cortices were activated during real locomotion as distinct to the supplementary motor cortex and basal ganglia during imagined locomotion. Activations of the brainstem locomotor centers were more prominent in imagined locomotion. In conclusion, basic activation and deactivation patterns of real locomotion correspond to that of imagined locomotion. The differences may be due to distinct patterns of locomotion tested. Contrary to constant velocity real locomotion (10 min) in [(18)F]-FDG-PET, mental imagery of locomotion over repeated 20-s periods includes gait initiation and velocity changes. Real steady-state locomotion seems to use a direct pathway via the primary motor cortex, whereas imagined modulatory locomotion an indirect pathway via a supplementary motor cortex and basal ganglia loop.


ToneTrack: Leveraging Frequency-Agile Radios for Time-Based Indoor Wireless Localization

Indoor localization of mobile devices and tags has received much attention recently, with encouraging fine-grained localization results available with enough line-of-sight coverage and hardware infrastructure. Some of the most promising techniques analyze the time-of-arrival of incoming signals, but the limited bandwidth available to most wireless transmissions fundamentally constrains their resolution. Frequency-agile wireless networks utilize bandwidths of varying sizes and locations in a wireless band to efficiently share the wireless medium between users. ToneTrack is an indoor location system that achieves sub-meter accuracy with minimal hardware and antennas, by leveraging frequency-agile wireless networks to increase the effective bandwidth. Our novel signal combination algorithm combines time-of-arrival data from different transmissions as a mobile device hops across different channels, approaching time resolutions previously not possible with a single narrowband channel. ToneTrack's novel channel combination and spectrum identification algorithms together with the triangle inequality scheme yield superior results even in non-line-of-sight scenarios with one to two walls separating client and APs and also in the case where the direct path from mobile client to an AP is completely blocked. We implement ToneTrack on the WARP hardware radio platform and use six of them served as APs to localize Wi-Fi clients in an indoor testbed over one floor of an office building. Experimental results show that ToneTrack can achieve a median 90 cm accuracy when 20 MHz bandwidth APs overhear three packets from adjacent channels.


The synthesis and rendering of eroded fractal terrains

In standard fractal terrain models based on fractional Brownian motion the statistical character of the surface is, by design, the same everywhere. A new approach to the synthesis of fractal terrain height fields is presented which, in contrast to previous techniques, features locally independent control of the frequencies composing the surface, and thus local control of fractal dimension and other statistical characteristics. The new technique, termed noise synthesis, is intermediate in difficulty of implementation, between simple stochastic subdivision and Fourier filtering or generalized stochastic subdivision, and does not suffer the drawbacks of creases or periodicity. Varying the local crossover scale of fractal character or the fractal dimension with altitude or other functions yields more realistic first approximations to eroded landscapes. A simple physical erosion model is then suggested which simulates hydraulic and thermal erosion processes to create gloabl stream/valley networks and talus slopes. Finally, an efficient ray tracing algorithm for general height fields, of which most fractal terrains are a subset, is presented.


Design of Two-stage High Gain Operational Amplifier Using Current Buffer Compensation for Low Power Applications

i ii ACKNOWLEDGEMENT I wish to express my sincere appreciation to my thesis advisor, Mr. B. K. Hemant for his timely, informative feedback and support during this effort. It has been a great pleasure to learn from him during the process of expanding and refining my research. He has been a generous mentor. I also like to express my gratefulness to Dr. his perpetual encouragement, generous help and inspiring guidance. for their support and guidance. I am also very grateful for all the help I received from my classmates.