Sparse Non-rigid Registration of 3D Shapes

Non-rigid registration of 3D shapes is an essential task of increasing importance as commodity depth sensors become more widely available for scanning dynamic scenes. Non-rigid registration is much more challenging than rigid registration as it estimates a set of local transformations instead of a single global transformation, and hence is prone to the overfitting issue due to underdetermination. The common wisdom in previous methods is to impose an ℓ2-norm regularization on the local transformation differences. However, the ℓ2-norm regularization tends to bias the solution towards outliers and noise with heavy-tailed distribution, which is verified by the poor goodness-of-fit of the Gaussian distribution over transformation differences. On the contrary, Laplacian distribution fits well with the transformation differences, suggesting the use of a sparsity prior. We propose a sparse non-rigid registration (SNR) method with an ℓ1-norm regularized model for transformation estimation, which is effectively solved by an alternate direction method (ADM) under the augmented Lagrangian framework. We also devise a multi-resolution scheme for robust and progressive registration. Results on both public datasets and our scanned datasets show the superiority of our method, particularly in handling large-scale deformations as well as outliers and noise.


THE STRUCTURE ( S ) OF PARTICLE VERBS

• complex heads are formed either in the lexicon (cf. Booij 1990 , Johnson 1991 , Koizumi 1993, Neeleman 1994, Neeleman & Weerman 1993, Stiebels 1996, Stiebels & Wunderlich 1994, Wiese 1996, Ackerman & Webelhuth 1998 ) or by some kind of overt or covert incorporation of the particle into the verb (cf. van Riemsdijk 1978, Baker 1988, Koopman 1995, Olsen 1995a, 1995b, Zeller 1997a, 1997b, 1998) • small clause structure (cf. Kayne 1985, Guéron 1987 , 1990, Hoekstra 1988, Grewendorf 1990, Bennis 1992, Mulder 1992 , den Dikken 1992, 1995 , Zwart 1997 among others) 1


State of the Art in Stereoscopic and Autostereoscopic Displays

Underlying principles of stereoscopic direct-view displays, binocular head-mounted displays, and autostereoscopic direct-view displays are explained and some early work as well as the state of the art in those technologies are reviewed. Stereoscopic displays require eyewear and can be categorized based on the multiplexing scheme as: 1) color multiplexed (old technology but there are some recent developments; low-quality due to color reproduction and crosstalk issues; simple and does not require additional electronics hardware); 2) polarization multiplexed (requires polarized light output and polarization-based passive eyewear; high-resolution and high-quality displays available); and 3) time multiplexed (requires faster display hardware and active glasses synchronized with the display; high-resolution commercial products available). Binocular head-mounted displays can readily provide 3-D, virtual images, immersive experience, and more possibilities for interactive displays. However, the bulk of the optics, matching of the left and right ocular images and obtaining a large field of view make the designs quite challenging. Some of the recent developments using unconventional optical relays allow for thin form factors and open up new possibilities. Autostereoscopic displays are very attractive as they do not require any eyewear. There are many possibilities in this category including: two-view (the simplest implementations are with a parallax barrier or a lenticular screen), multiview, head tracked (requires active optics to redirect the rays to a moving viewer), and super multiview (potentially can solve the accommodation-convergence mismatch problem). Earlier 3-D booms did not last long mainly due to the unavailability of enabling technologies and the content. Current developments in the hardware technologies provide a renewed interest in 3-D displays both from the consumers and the display manufacturers, which is evidenced by the recent commercial products and new research results in this field.


Importance of audio feature reduction in automatic music genre classification

Multimedia database retrieval is rapidly growing and its popularity in online retrieval systems is consequently increasing. Large datasets are major challenges for searching, retrieving, and organizing the music content. Therefore, a robust automatic music-genre classification method is needed for organizing this music data into different classes according to specific viable information. Two fundamental components are to be considered for genre classification: audio feature extraction and classifier design. In this paper, we propose diverse audio features to precisely characterize the music content. The feature sets belong to four groups: dynamic, rhythmic, spectral, and harmonic. From the features, five statistical parameters are considered as representatives, including the fourth-order central moments of each feature as well as covariance components. Ultimately, insignificant representative parameters are controlled by minimum redundancy and maximum relevance. This algorithm calculates the score level of all feature attributes and orders them. Only high-score audio features are considered for genre classification. Moreover, we can recognize those audio features and distinguish which of the different statistical parameters derived from them are important for genre classification. Among them, mel frequency cepstral coefficient statistical parameters, such as covariance components and variance, are more frequently selected than the feature attributes of other groups. This approach does not transform the original features as do principal component analysis and linear discriminant analysis. In addition, other feature reduction methodologies, such as locality-preserving projection and non-negative matrix factorization are considered. The performance of the proposed system is measured based on the reduced features from the feature pool using different feature reduction techniques. The results indicate that the overall classification is competitive with existing state-of-the-art frame-based methodologies.


A Dual-Band Dual-Circular-Polarization Antenna for Ka-Band Satellite Communications

A novel Ka-band dual-band dual-circularly-polarized antenna array is presented in this letter. A dual-band antenna with left-hand circular polarization for the Ka-band downlink frequencies and right-hand circular polarization for the Ka-band uplink frequencies is realized with compact annular ring slots. By applying the sequential rotation technique, a 2 × 2 subarray with good performance is obtained. This letter describes the design process and presents simulation and measurement results.


Using machine learning algorithms for housing price prediction: The case of Fairfax County, Virginia housing data

House sales are determined based on the Standard & Poor’s Case-Shiller home price indices and the housing price index of the Office of Federal Housing Enterprise Oversight (OFHEO). These reflect the trends of the US housing market. In addition to these housing price indices, the development of a housing price prediction model can greatly assist in the prediction of future housing prices and the establishment of real estate policies. This study uses machine learning algorithms as a research methodology to develop a housing price prediction model. To improve the accuracy of housing price prediction, this paper analyzes the housing data of 5359 townhouses in Fairfax County, Virginia, gathered by the Multiple Listing Service (MLS) of the Metropolitan Regional Information Systems (MRIS). We develop a housing price prediction model based on machine learning algorithms such as C4.5, RIPPER, Naïve Bayesian, and AdaBoost and compare their classification accuracy performance. We then propose an improved housing price prediction model to assist a house seller or a real estate agent make better informed decisions based on house price valuation. The experiments demonstrate that the RIPPER algorithm, based on accuracy, consistently outperforms the other models in the performance of housing price prediction. 2014 Elsevier Ltd. All rights reserved.


Using plane + parallax for calibrating dense camera arrays

A light field consists of images of a scene taken from different viewpoints. Light fields are used in computer graphics for image-based rendering and synthetic aperture photography, and in vision for recovering shape. In this paper, we describe a simple procedure to calibrate camera arrays used to capture light fields using a plane + parallax framework. Specifically, for the case when the cameras lie on a plane, we show (i) how to estimate camera positions up to an affine ambiguity, and (ii) how to reproject light field images onto a family of planes using only knowledge of planar parallax for one point in the scene. While planar parallax does not completely describe the geometry of the light field, it is adequate for the first two applications which, it turns out, do not depend on having a metric calibration of the light field. Experiments on acquired light fields indicate that our method yields better results than full metric calibration.


Performance Analysis, Mapping, and Multiobjective Optimization of a Hybrid Robotic Machine Tool

A serial-parallel hybrid machine tool is expected to integrate the respective features of pure serial/parallel mechanism. The traditional method of hybridization is to connect n (n ≥ 2) mechanisms bottom to head, in which at least one should be a parallel mechanism. One unique approach called Mechanism Hybridization is to embed one serial mechanism inside of a pure parallel mechanism, which greatly changes its overall performance. Based on this idea, an X-Y gantry system including a five-axis hybrid manipulator is developed, which is expected to be applied as the next generation of computer numerical control machine. The inverse kinematics and Jacobian matrix are derived. Since performance improvement is one of the most important factors that greatly affect the application potential of hybrid manipulators in different industry fields, to deeply investigate the comprehensive features, the local/global performance indexes of stiffness, dexterity, and manipulability are mathematically modeled and mapped. A discrete-boundary-searching method is developed to calculate and visualize the workspace. Pareto-based evolutionary multiobjective performance optimization is implemented to simultaneously improve the four indexes, and the representative nondominated solutions are listed. The proposed methodologies are generic and applicable for the design, modeling, and improvement of other parallel/hybrid robotic machine tools.


Simulation in software engineering training

Simulation is frequently used for training in many application areas like aviation and economics, but not in software engineering. We present the SESAM project which focuses on software engineering education using simulation. In the SESAM project a simulator was developed. Using this simulator, a student can take the role of a software project manager. The simulated software project can be finished within a couple of hours because it is simulated in “quick-motion” mode.
In this paper, the background and goals of the SESAM project are presented. A new simulation model, the so called QA model, is introduced. The model behavior is demonstrated by investigating and comparing different strategies for software development. The results of experiments based on the QA model are reported. Finally, conclusions are drawn from the experiments and future work is outlined.


Effects of Transformational Leadership Training on Attitudinal and Financial Outcomes : A Field Experiment

A pretest-posttest control-group design (N = 20) was used to assess the effects of transformational leadership training, with 9 and 11 managers assigned randomly to training and control groups, respectively. Training consisted of a 1-day group session and 4 individual booster sessions thereafter on a monthly basis. Multivariate analyses of covariance, with pretest scores as the covariate, showed that the training resulted in significant effects on subordinates' perceptions of leaders' transformational leadership, subordinates' own organizational commitment, and 2 aspects of branch-level financial performance.


An approach to finite-time controller design for a class of T-S fuzzy systems

This paper studies the finite-time stabilization problem for a class of nonlinear systems described by Takagi-Sugeno (T-S) fuzzy dynamic models with parametric uncertainties. A novel non-Lipschitz continuous state feedback control scheme with augmented dynamics is developed. It is shown that finite-time convergence of the closed loop system can be achieved, and the potential controller singularity problem can be avoided. Finally, one example is given to illustrate the effectiveness of the proposed control approach.


The Human Hippocampus and Spatial and Episodic Memory

Finding one's way around an environment and remembering the events that occur within it are crucial cognitive abilities that have been linked to the hippocampus and medial temporal lobes. Our review of neuropsychological, behavioral, and neuroimaging studies of human hippocampal involvement in spatial memory concentrates on three important concepts in this field: spatial frameworks, dimensionality, and orientation and self-motion. We also compare variation in hippocampal structure and function across and within species. We discuss how its spatial role relates to its accepted role in episodic memory. Five related studies use virtual reality to examine these two types of memory in ecologically valid situations. While processing of spatial scenes involves the parahippocampus, the right hippocampus appears particularly involved in memory for locations within an environment, with the left hippocampus more involved in context-dependent episodic or autobiographical memory.


3D Sampling Textures for Creative Design and Manufacturing

1 Texture synthesized from 3D scans of snake-skin and mushroom laminae. ABSTRACT 3D sampling is a robust new strategy for exploring and creating designs. 3D textures are sampled and mixed almost like music to create new multifunctional surfaces and material microstructures (Figure 1). This paper presents several design cases performed using 3D sampling techniques, demonstrating how they can be used to explore and enhance product ideas, variations, and functions in subtle and responsive ways. In each case, design variations are generated and their mechanical behavior is evaluated against performance criteria using computational simulation or empirical testing. This work aims to promote creativity and discovery by introducing irregular geometric structures within trial-and-error feedback loops. Sayjel Vijay Patel SUTD DManD Centre


Large-Scale Liquid Simulation on Adaptive Hexahedral Grids

Regular grids are attractive for numerical fluid simulations because they give rise to efficient computational kernels. However, for simulating high resolution effects in complicated domains they are only of limited suitability due to memory constraints. In this paper we present a method for liquid simulation on an adaptive octree grid using a hexahedral finite element discretization, which reduces memory requirements by coarsening the elements in the interior of the liquid body. To impose free surface boundary conditions with second order accuracy, we incorporate a particular class of Nitsche methods enforcing the Dirichlet boundary conditions for the pressure in a variational sense. We then show how to construct a multigrid hierarchy from the adaptive octree grid, so that a time efficient geometric multigrid solver can be used. To improve solver convergence, we propose a special treatment of liquid boundaries via composite finite elements at coarser scales. We demonstrate the effectiveness of our method for liquid simulations that would require hundreds of millions of simulation elements in a non-adaptive regime.


Power optimization for FinFET-based circuits using genetic algorithms

Reducing power consumption is one of the important design goals for circuit designers. Power optimization techniques for bulk CMOS-based circuit designs have been extensively studied. As technology scales, FinFET has been proposed as an alternative for bulk CMOS when technology scales beyond 32 nm technology (E.J. Nowak et al., 2004). In this paper, we propose a power optimization framework for FinFET based circuit design, based on genetic algorithms. We exploit the unique feature of independent gate (IG) controls for FinFET devices to reduce the power consumption, and combine with other low power techniques such as multi-Vdd and gate sizing to achieve power optimization for FinFET-based circuits. We use 32 nm PTM FinFET device model (W. Zhao and Y. Cao, 2006) and conduct experiments on ISCAS benchmarks. The experimental results show that our methodology can achieve over 80% power reduction while satisfying the same performance constraints, comparing to the case that all the FinFET transistors are tuned to be the fastest ones.


Improving the intrinsic calibration of a Velodyne LiDAR sensor

LiDAR (Light detection and ranging) sensors are widely used in research and development. As such, they build the base for the evaluation of newly developed ADAS (Advanced Driver Assistance Systems) functions in the automotive field where they are used for ground truth establishment. However, the factory calibration provided for the sensors is not able to satisfy the high accuracy requirements by such applications. In this paper we propose a concept to easily improve the existing calibration of a Velodyne LiDAR sensor without the need for special calibration setups which can even be used to enhance already recorded data.


Combining template tracking and laser peak detection for 3D reconstruction and grasping in underwater environments

Autonomous grasping of unknown objects by a robot is a highly challenging skill that is receiving increasing attention in the last years. This problem becomes still more challenging (and less explored) in underwater environments, with highly unstructured scenarios, limited availability of sensors and, in general, adverse conditions that affect in different degree the robot perception and control systems. This paper describes an approach for semi-autonomous grasping and recovery on underwater unknown objects from floating vehicles. A laser stripe emitter is attached to a robot forearm that performs a scan of a target of interest. This scan is captured by a camera that also estimates the motion of the floating vehicle while doing the scan. The scanned points are triangulated and transformed according to the motion estimation, thus recovering partial 3D structure of the scene with respect to a fixed frame. A user then indicates the part where to grab the object, and the final grasp is automatically planned on that area. The approach herein presented is tested and validated in water tank conditions.


Clear underwater vision

Underwater imaging is important for scientific research and technology, as well as for popular activities. We present a computer vision approach which easily removes degradation effects in underwater vision. We analyze the physical effects of visibility degradation. We show that the main degradation effects can be associated with partial polarization of light. We therefore present an algorithm which inverts the image formation process, to recover a good visibility image of the object. The algorithm is based on a couple of images taken through a polarizer at different orientations. As a by product, a distance map of the scene is derived as well. We successfully used our approach when experimenting in the sea using a system we built. We obtained great improvement of scene contrast and color correction, and nearly doubled the underwater visibility range.


Girona 500 AUV: From Survey to Intervention

This paper outlines the specifications and basic design approach taken on the development of the Girona 500, an autonomous underwater vehicle whose most remarkable characteristic is its capacity to reconfigure for different tasks. The capabilities of this new vehicle range from different forms of seafloor survey to inspection and intervention tasks.


ROS: an open-source Robot Operating System

This paper gives an overview of ROS, an opensource robot operating system. ROS is not an operating system in the traditional sense of process management and scheduling; rather, it provides a structured communications layer above the host operating systems of a heterogenous compute cluster. In this paper, we discuss how ROS relates to existing robot software frameworks, and briefly overview some of the available application software which uses ROS.


Design and Control of Autonomous Underwater Robots: A Survey

During the 1990s, numerous worldwide research and development activities have occurred in underwater robotics, especially in the area of autonomous underwater vehicles (AUVs). As the ocean attracts great attention on environmental issues and resources as well as scientific and military tasks, the need for and use of underwater robotic systems has become more apparent. Great efforts have been made in developing AUVs to overcome challenging scientific and engineering problems caused by the unstructured and hazardous ocean environment. In the 1990s, about 30 new AUVs have been built worldwide. With the development of new materials, advanced computing and sensory technology, as well as theoretical advancements, R&D activities in the AUV community have increased. However, this is just the beginning for more advanced, yet practical and reliable AUVs. This paper surveys some key areas in current state-of-the-art underwater robotic technologies. It is by no means a complete survey but provides key references for future development. The new millennium will bring advancements in technology that will enable the development of more practical, reliable AUVs.


Logic Tensor Networks: Deep Learning and Logical Reasoning from Data and Knowledge

We propose Logic Tensor Networks: a uniform framework for integrating automatic learning and reasoning. A logic formalism called Real Logic is defined on a first-order language whereby formulas have truth-value in the interval [0,1] and semantics defined concretely on the domain of real numbers. Logical constants are interpreted as feature vectors of real numbers. Real Logic promotes a well-founded integration of deductive reasoning on a knowledge-base and efficient data-driven relational machine learning. We show how Real Logic can be implemented in deep Tensor Neural Networks with the use of Google’s TENSORFLOW primitives. The paper concludes with experiments applying Logic Tensor Networks on a simple but representative example of knowledge comple-


Survey on Data Classification and Data Encryption Techniques Used in Cloud Computing

Cloud computing is an imminent revolution in information technology (IT) industry because of its performance, accessibility, low cost and many other luxury features. Security of data in the cloud is one of the major issues which acts as barrier in the implementation of cloud computing. In past years, a number of research works have targeted this problem. In this paper discuss some of the data classification techniques widely used in cloud computing. The objective of data classification is to find out the required level of security for data and to protect data by providing sufficient level of security according to the risk levels of data. In this paper also discuss a survey of existing solutions for security problem, discuss their advantages, and point out any disadvantages for future research. Specifically, focus on the use of encryption techniques, and provide a comparative study of the major encryption techniques.


Metaphor in the Mind : The Cognition of Metaphor

The most sustained and innovative recent work on metaphor has occurred in cognitive science and psychology. Psycholinguistic investigation suggests that novel, poetic metaphors are processed differently than literal speech, while relatively conventionalized and contextually salient metaphors are processed more like literal speech. This conflicts with the view of “cognitive linguists” like George Lakoff that all or nearly all thought is essentially metaphorical. There are currently four main cognitive models of metaphor comprehension: juxtaposition, category-transfer, feature-matching, and structural alignment. Structural alignment deals best with the widest range of examples; but it still fails to account for the complexity and richness of fairly novel, poetic metaphors. 1. General Issues in the Study of Metaphor Philosophers have often adopted a dismissive attitude toward metaphor. Hobbes (ch. 8) advocated excluding metaphors from rational discourse because they “openly profess deceit,” while Locke (Bk. 3, ch. 10) claimed that figurative uses of language serve only “to insinuate wrong ideas, move the passions, and thereby mislead the judgment; and so indeed are perfect cheats.” Later, logical positivists like Ayer and Carnap assumed that because metaphors like (1) How sweet the moonlight sleeps upon this bank!2 involve category mistakes, they have no real meaning or verification conditions. Thus, they too mentioned metaphor only to place it beyond the pale of rational discourse. Starting in the 1960s and 70s, philosophers and linguists began to take more positive interest in metaphor. Black argued forcefully that metaphors do have a distinctive, essentially non-propositional meaning or cognitive significance, which is produced by the “interaction” of the “systems of associated commonplaces” for the metaphor’s “primary” and “secondary” subjects (e.g., with moonlight and sleeping sweetly). Other theorists were more friendly to the idea that metaphorical and literal meaning are of the same essential kind. Many of them proposed that the literal absurdity of metaphors © Blackwell Publishing 2006 Philosophy Compass 1/2 (2006): 154–170, 10.1111/j.1747-9991.2006.00013.x


Faculty at Saudi Electronic University attitudes toward using augmented reality in education

This study aims to examine the possibility of implementing the Augmented Reality (AR) application in higher education by answering three questions: Which extended faculty at the Saudi Electronic University are familiar with such applications, what the perceptions do they hold toward using it in education, and what barriers do they believe may hinder implementing this technology. An online survey was designed and distributed to faculty members at two colleges selected randomly to collect data from participants. Even though the faculty were at an accepted level of familiarity with this technology, they did not use it in their classes. Results showed that faculty have a positive attitude toward the use of AR and have confidence in its potential to enrich the learning environment. This result is connected to the AR advantages the faculty were in agreement with. Results also showed that faculty have concerns about some barriers that might impact implementation of AR in the education environment, such as the lack of technical support.


Impact of supply chain integration and selective disintegration on supply chain efficiency and organization performance

An efficient business system integration (BSI) is the key determinant factor for the organization to stay competitive. The goal of this study is to develop and execute a research project to study BSI in the oil & gas industry and how an efficient BSI in supply chain (SCI) can be used to gain advantage. A mixed (qualitative & quantitative) survey method was employed and structural equation modeling (SEM) is applied to test the theoretical framework and hypotheses. Findings reveal that, total integration do not offer optimum performance and selective disintegration (DIS) is necessary for supply chain efficiency (SCE) and organization performance (PER). This study helps to better understand the degree of integration required for optimum supply chain performance and came up with new construct DIS. Specifically, this study investigated the effect of SCI and DIS on SCE and PER. The compelled sample size precludes evaluating and testing of additional broad models of the relationship amongst the constructs. The main managerial lesson is that, in contrast to what has been written in many books and other popular publications, selective disintegration is necessary for optimum supply chain efficiency.


Learning to summarize web image and text mutually

We consider the problem of learning to summarize images by text and visualize text utilizing images, which we call Mutual-Summarization. We divide the web image-text data space into three subspaces, namely pure image space (PIS), pure text space (PTS) and image-text joint space (ITJS). Naturally, we treat the ITJS as a knowledge base.
 For summarizing images by sentence issue, we map images from PIS to ITJS via image classification models and use text summarization on the corresponding texts in ITJS to summarize images. For text visualization problem, we map texts from PTS to ITJS via text categorization models and generate the visualization by choosing the semantic related images from ITJS, where the selected images are ranked by their confidence. In above approaches images are represented by color histograms, dense visual words and feature descriptors at different levels of spatial pyramid; and the texts are generated according to the Latent Dirichlet Allocation (LDA) topic model. Multiple Kernel (MK) methodologies are used to learn classifiers for image and text respectively. We show the Mutual-Summarization results on our newly collected dataset of six big events ("Gulf Oil Spill", "Haiti Earthquake", etc.) as well as demonstrate improved cross-media retrieval performance over existing methods in terms of MAP, Precision and Recall.


A-PNR: Automatic Plate Number Recognition

Automatic Plate Number Recognition (APNR) has important applications in traffic surveillance, toll booth, protected parking lot, No parking zone, etc. It is a challenging problem, especially when the license plates have varying sizes, the number of lines, fonts, background diversity etc. This work aims to address APNR using deep learning method for real-time traffic images. We first extract license plate candidates from each frame using edge information and geometrical properties, ensuring high recall using one class SVM. The verified candidates are used for NP recognition purpose along with a spatial transformer network (STN) for character recognition. Our system is evaluated on several traffic images with vehicles having different license plate formats in terms of tilt, distances, colors, illumination, character size, thickness etc. Also, the background was very challenging. Results demonstrate robustness to such variations and impressive performance in both the localization and recognition.


Virtual reality job interview training in adults with autism spectrum disorder.

The feasibility and efficacy of virtual reality job interview training (VR-JIT) was assessed in a single-blinded randomized controlled trial. Adults with autism spectrum disorder were randomized to VR-JIT (n = 16) or treatment-as-usual (TAU) (n = 10) groups. VR-JIT consisted of simulated job interviews with a virtual character and didactic training. Participants attended 90 % of laboratory-based training sessions, found VR-JIT easy to use and enjoyable, and they felt prepared for future interviews. VR-JIT participants had greater improvement during live standardized job interview role-play performances than TAU participants (p = 0.046). A similar pattern was observed for self-reported self-confidence at a trend level (p = 0.060). VR-JIT simulation performance scores increased over time (R(2) = 0.83). Results indicate preliminary support for the feasibility and efficacy of VR-JIT, which can be administered using computer software or via the internet.


Event-based stock market prediction

There are various studies on the behavior of the market. In particular, derivatives such as futures and options have taken a lot of attentions, lately. Predicting these derivatives is not only important for the risk management purposes, but also for price speculative activities. Besides that accurate prediction of the market’s direction can help investors to gain enormous profits with small amount of capital [Tsaih et al., 1998]. Stock market prediction can be viewed as a challenging time-series prediction [Kim, 2003]. There are many factors that are influential on the financial markets, including political events, natural disasters, economic conditions, and so on. Despite the complexity of the movements in market prices, the market behavior is not completely random. Instead, it is governed by a highly nonlinear dynamical system [Blank, 1991]. Forecasting the future prices is carried out based on the technical analysis, which studies the market’s action using past prices and the other market information. Market analysis is in contradiction with the Efficient Market Hypothesis (EMH). EMH was developed in 1970 by economist Eugene Fama [Fama, 1965a, Fama, 1965b] whose theory stated that it is not possible for an investor to outperform the market because all available information is already built into all stock prices. If the EMH was true, it would not be possible to use machine learning techniques for market prediction. Nevertheless, there are many successful technical analysis in the financial world and number of studies appearing in academic literature that are using machine learning techniques for market prediction [Choudhry and Garg, 2008]. One way to forecast the market movement is by analyzing the special events of the market such as earnings announcements. Earnings announcement for each stock is an official public statement of a company’s profitability for a specific time period, typically a quarter or a year. Each company has its specific earnings announcement dates. Stock price of a company is affected by the earnings announcement event. Equity analysts usually predict the earnings per share (EPS) prior to the announcement date. In this project, using machine-learning techniques, we want to predict whether a given stock will be rising in the following day after earnings announcement or not. This will lead to a binary classification problem, which can be tackled based on the huge amount of available public data. This project consists of two major tasks: data collection and application of machine learning algorithms. In §2, we will discuss our efforts to collect the required data. In continuation in §3, features definitions and selections are described. We have considered and discussed different machine learning algorithms in §4. In §5, the summary of our results and possible extensions are explained.


Effects of early-life abuse differ across development: infant social behavior deficits are followed by adolescent depressive-like behaviors mediated by the amygdala.

Abuse during early life, especially from the caregiver, increases vulnerability to develop later-life psychopathologies such as depression. Although signs of depression are typically not expressed until later life, signs of dysfunctional social behavior have been found earlier. How infant abuse alters the trajectory of brain development to produce pathways to pathology is not completely understood. Here we address this question using two different but complementary rat models of early-life abuse from postnatal day 8 (P8) to P12: a naturalistic paradigm, where the mother is provided with insufficient bedding for nest building; and a more controlled paradigm, where infants undergo olfactory classical conditioning. Amygdala neural assessment (c-Fos), as well as social behavior and forced swim tests were performed at preweaning (P20) and adolescence (P45). Our results show that both models of early-life abuse induce deficits in social behavior, even during the preweaning period; however, depressive-like behaviors were observed only during adolescence. Adolescent depressive-like behavior corresponds with an increase in amygdala neural activity in response to forced swim test. A causal relationship between the amygdala and depressive-like behavior was suggested through amygdala temporary deactivation (muscimol infusions), which rescued the depressive-like behavior in the forced swim test. Our results indicate that social behavior deficits in infancy could serve as an early marker for later psychopathology. Moreover, the implication of the amygdala in the ontogeny of depressive-like behaviors in infant abused animals is an important step toward understanding the underlying mechanisms of later-life mental disease associated with early-life abuse.


Neural correlates of cognitive processing in monolinguals and bilinguals.

Here, we review the neural correlates of cognitive control associated with bilingualism. We demonstrate that lifelong practice managing two languages orchestrates global changes to both the structure and function of the brain. Compared with monolinguals, bilinguals generally show greater gray matter volume, especially in perceptual/motor regions, greater white matter integrity, and greater functional connectivity between gray matter regions. These changes complement electroencephalography findings showing that bilinguals devote neural resources earlier than monolinguals. Parallel functional findings emerge from the functional magnetic resonance imaging literature: bilinguals show reduced frontal activity, suggesting that they do not need to rely on top-down mechanisms to the same extent as monolinguals. This shift for bilinguals to rely more on subcortical/posterior regions, which we term the bilingual anterior-to-posterior and subcortical shift (BAPSS), fits with results from cognitive aging studies and helps to explain why bilinguals experience cognitive decline at later stages of development than monolinguals.


Low-frequency Fourier analysis of speech rhythm.

A method for studying speech rhythm is presented, using Fourier analysis of the amplitude envelope of bandpass-filtered speech. Rather than quantifying rhythm with time-domain measurements of interval durations, a frequency-domain representation is used--the rhythm spectrum. This paper describes the method in detail, and discusses approaches to characterizing rhythm with low-frequency spectral information.


Simple sequence repeat markers that identify Claviceps species and strains

Claviceps purpurea is a pathogen that infects most members of Pooideae, a subfamily of Poaceae, and causes ergot, a floral disease in which the ovary is replaced with a sclerotium. When the ergot body is accidently consumed by either man or animal in high enough quantities, there is extreme pain, limb loss and sometimes death. This study was initiated to develop simple sequence repeat (SSRs) markers for rapid identification of C. purpurea. SSRs were designed from sequence data stored at the National Center for Biotechnology Information database. The study consisted of 74 ergot isolates, from four different host species, Lolium perenne, Poa pratensis, Bromus inermis, and Secale cereale plus three additional Claviceps species, C. pusilla, C. paspali and C. fusiformis. Samples were collected from six different counties in Oregon and Washington over a 5-year period. Thirty-four SSR markers were selected, which enabled the differentiation of each isolate from one another based solely on their molecular fingerprints. Discriminant analysis of principle components was used to identify four isolate groups, CA Group 1, 2, 3, and 4, for subsequent cluster and molecular variance analyses. CA Group 1 consisting of eight isolates from the host species P. pratensis, was separated on the cluster analysis plot from the remaining three groups and this group was later identified as C. humidiphila. The other three groups were distinct from one another, but closely related. These three groups contained samples from all four of the host species. These SSRs are simple to use, reliable and allowed clear differentiation of C. humidiphila from C. purpurea. Isolates from the three separate species, C. pusilla, C. paspali and C. fusiformis, also amplified with these markers. The SSR markers developed in this study will be helpful in defining the population structure and genetics of Claviceps strains. They will also provide valuable tools for plant breeders needing to identify resistance in crops or for researchers examining fungal movements across environments.


Lifetime-Aware Scheduling and Power Control for M2M Communications in LTE Networks

In this paper the scheduling and transmit power control are investigated to minimize the energy consumption for battery-driven devices deployed in LTE networks. To enable efficient scheduling for a massive number of machine-type subscribers, a novel distributed scheme is proposed to let machine nodes form local clusters and communicate with the base-station through the cluster-heads. Then, uplink scheduling and power control in LTE networks are introduced and lifetime-aware solutions are investigated to be used for the communication between cluster-heads and the base-station. Beside the exact solutions, low-complexity suboptimal solutions are presented in this work which can achieve near optimal performance with much lower computational complexity. The performance evaluation shows that the network lifetime is significantly extended using the proposed protocols.


Rumor detection for Persian Tweets

Nowadays, striking growth of online social media has led to easier and faster spreading of rumors on cyber space, in addition to tradition ways. In this paper, rumor detection on Persian Twitter community has been addressed for the first time by exploring and analyzing the significances of two categories of rumor features: Structural and Content-based features. While applying both feature sets leads to precision more than 80%, precision around 70% using only structural features has been obtained. Moreover, we show how features of users tending to produce and spread rumors are effective in rumor detection process. Also, the experiments have led to learning of a language model of collected rumors. Finally, all features have been ranked and the most discriminative ones have been discussed.


Covalsa: Covariance estimation from compressive measurements using alternating minimization

The estimation of covariance matrices from compressive measurements has recently attracted considerable research efforts in various fields of science and engineering. Owing to the small number of observations, the estimation of the covariance matrices is a severely ill-posed problem. This can be overcome by exploiting prior information about the structure of the covariance matrix. This paper presents a class of convex formulations and respective solutions to the high-dimensional covariance matrix estimation problem under compressive measurements, imposing either Toeplitz, sparseness, null-pattern, low rank, or low permuted rank structure on the solution, in addition to positive semi-definiteness. To solve the optimization problems, we introduce the Co-Variance by Augmented Lagrangian Shrinkage Algorithm (CoVALSA), which is an instance of the Split Augmented Lagrangian Shrinkage Algorithm (SALSA). We illustrate the effectiveness of our approach in comparison with state-of-the-art algorithms.


Control Strategy to Naturally Balance Hybrid Converter for Variable-Speed Medium-Voltage Drive Applications

In this paper, a novel control strategy to naturally balance a hybrid converter is presented for medium-voltage induction motor drive applications. Fundamental current of the motor is produced by a three-level quasi-square-wave converter. Several single-phase full-bridge converters are connected in series with this quasi-square-wave converter to eliminate harmonic voltages from the net output voltage of this hybrid converter. Various novel modulation strategies for these series cells are proposed. These lead to a naturally regulated dc-bus voltage of series cells. These also optimize the number of series cells required. Variable fundamental voltage and frequency control of induction motor is adopted with a constant dc-bus voltage of the three-level quasi-square-wave converter. Experimental results are also produced here to validate the proposed modulation strategies for induction motor drives using low-voltage protomodel. Based on the aforementioned, a 2.2-kV induction motor drive has been built, and results are also produced in this paper.


Improvement of Intrusion Detection System in Data Mining using Neural Network

Many researchers have argued that Artificial Neural Networks (ANNs) can improve the performance of intrusion detection systems (IDS). One of the central areas in network intrusion detection is how to build effective systems that are able to distinguish normal from intrusive traffic. In this paper four different algorithms are used namely as Multilayer Perception, Radial Base Function, Logistic Regression and Voted Perception. All these neural based algorithms are implemented in WEKA data mining tool to evaluate the performance. For experimental work, NSL KDD dataset is used. Each neural based algorithm is tested with conducted dataset. It is shown that the Multilayer Perception neural network algorithm is providing more accurate results than other algorithms. Keywords— Data Mining, Intrusion Detection System, Neural network classifier algorithm, NSL KDD dataset


Valid items for screening dysphagia risk in patients with stroke: a systematic review.

BACKGROUND AND PURPOSE
Screening for dysphagia is essential to the implementation of preventive therapies for patients with stroke. A systematic review was undertaken to determine the evidence-based validity of dysphagia screening items using instrumental evaluation as the reference standard.

METHODS
Four databases from 1985 through March 2011 were searched using the terms cerebrovascular disease, stroke deglutition disorders, and dysphagia. Eligibility criteria were: homogeneous stroke population, comparison to instrumental examination, clinical examination without equipment, outcome measures of dysphagia or aspiration, and validity of screening items reported or able to be calculated. Articles meeting inclusion criteria were evaluated for methodological rigor. Sensitivity, specificity, and predictive capabilities were calculated for each item.

RESULTS
Total source documents numbered 832; 86 were reviewed in full and 16 met inclusion criteria. Study quality was variable. Testing swallowing, generally with water, was the most commonly administered item across studies. Both swallowing and nonswallowing items were identified as predictive of aspiration. Neither swallowing protocols nor validity were consistent across studies.

CONCLUSIONS
Numerous behaviors were found to be associated with aspiration. The best combination of nonswallowing and swallowing items as well as the best swallowing protocol remains unclear. Findings of this review will assist in development of valid clinical screening instruments.


Distributed Subgradient Methods for Multi-Agent Optimization

We study a distributed computation model for optimizing a sum of convex objective functions corresponding to multiple agents. For solving this (not necessarily smooth) optimization problem, we consider a subgradient method that is distributed among the agents. The method involves every agent minimizing his/her own objective function while exchanging information locally with other agents in the network over a time-varying topology. We provide convergence results and convergence rate estimates for the subgradient method. Our convergence rate results explicitly characterize the tradeoff between a desired accuracy of the generated approximate optimal solutions and the number of iterations needed to achieve the accuracy.


Monte-Carlo Localization for Mobile Wireless Sensor Networks

Localization is crucial to many applications in wireless sensor networks. In this article, we propose a range-free anchor-based localization algorithm for mobile wireless sensor networks that builds upon the Monte Carlo Localization algorithm. We concentrate on improving the localization accuracy and efficiency by making better use of the information a sensor node gathers and by drawing the necessary location samples faster. To do so, we constrain the area from which samples are drawn by building a box that covers the region where anchors’ radio ranges overlap. This box is the region of the deployment area where the sensor node is localized. Simulation results show that localization accuracy is improved by a minimum of 4% and by a maximum of 73%, on average 30%, for varying node speeds when considering nodes with knowledge of at least three anchors. The coverage is also strongly affected by speed and its improvement ranges from 3% to 55%, on average 22%. Finally, the processing time is reduced by 93% for a similar localization accuracy.


On the economic significance of ransomware campaigns: A Bitcoin transactions perspective

Bitcoin cryptocurrency system enables users to transact securely and pseudo-anonymously by using an arbitrary number of aliases (Bitcoin addresses). Cybercriminals exploit these characteristics to commit immutable and presumably untraceable monetary fraud, especially via ransomware; a type of malware that encrypts files of the infected system and demands ransom for decryption. In this paper, we present our comprehensive study on all recent ransomware and report the economic impact of such ransomware from the Bitcoin payment perspective. We also present a lightweight framework to identify, collect, and analyze Bitcoin addresses managed by the same user or group of users (cybercriminals, in this case), which includes a novel approach for classifying a payment as ransom. To verify the correctness of our framework, we compared our findings on CryptoLocker ransomware with the results presented in the literature. Our results align with the results found in the previous works except for the final valuation in USD. The reason for this discrepancy is that we used the average Bitcoin price on the day of each ransom payment whereas the authors of the previous studies used the Bitcoin price on the day of their evaluation. Furthermore, for each investigated ransomware, we provide a holistic view of its genesis, development, the process of infection and execution, and characteristic of ransom demands. Finally, we also release our dataset that contains a detailed transaction history of all the Bitcoin addresses we identified for each ransomware.


Localized Multiple Kernel Learning With Dynamical Clustering and Matrix Regularization

Localized multiple kernel learning (LMKL) is an attractive strategy for combining multiple heterogeneous features with regard to their discriminative power for each individual sample. However, the learning of numerous local solutions may not scale well even for a moderately sized training set, and the independently learned local models may suffer from overfitting. Hence, in existing local methods, the distributed samples are typically assumed to share the same weights, and various unsupervised clustering methods are applied as preprocessing. In this paper, to enable the learner to discover and benefit from the underlying local coherence and diversity of the samples, we incorporate the clustering procedure into the canonical support vector machine-based LMKL framework. Then, to explore the relatedness among different samples, which has been ignored in a vector  $\ell _{p}$ -norm analysis, we organize the cluster-specific kernel weights into a matrix and introduce a matrix-based extension of the  $\ell _{p}$ -norm for constraint enforcement. By casting the joint optimization problem as a problem of alternating optimization, we show how the cluster structure is gradually revealed and how the matrix-regularized kernel weights are obtained. A theoretical analysis of such a regularizer is performed using a Rademacher complexity bound, and complementary empirical experiments on real-world data sets demonstrate the effectiveness of our technique.


Optimal Execution with Nonlinear Impact Functions and Trading-Enhanced Risk

We determine optimal trading strategies for liquidation of a large single-asset portfolio to minimize a combination of volatility risk and market impact costs. We take the market impact cost per share to be a power law function of the trading rate, with an arbitrary positive exponent. This includes, for example, the square-root law that has been proposed based on market microstructure theory. In analogy to the linear model, we define a “characteristic time” for optimal trading, which now depends on the initial portfolio size and decreases as execution proceeds. We also consider a model in which uncertainty of the realized price is increased by demanding rapid execution; we show that optimal trajectories are described by a “critical portfolio size” above which this effect is dominant and below which it may be neglected.


Mining Offensive Language on Social Media

English. The present research deals with the automatic annotation and classification of vulgar ad offensive speech on social media. In this paper we will test the effectiveness of the computational treatment of the taboo contents shared on the web, the output is a corpus of 31,749 Facebook comments which has been automatically annotated through a lexicon-based method for the automatic identification and classification of taboo expressions. Italiano. La presente ricerca affronta il tema dell’annotazione e della classificazione automatica dei contenuti volgari e offensivi espressi nei social media. Lo scopo del nostro lavoro consiste nel testare l’efficacia del trattamento computazionale dei contenuti tabù condivisi in rete. L’output che forniamo un corpus di 31,749 commenti generati dagli utenti di Facebook e annotato automaticamente attraverso un metodo basato sul lessico per l’identificazione e la classificazione delle


Incremental Algorithms for Hierarchical Classification

We study the problem of hierarchical classification when labels corresponding to partial and/or multiple paths in the underlying taxonomy are allowed. We introduce a new hierarchical loss function, the H-loss, implementing the simple intuition that additional mistakes in the subtree of a mistaken class should not be charged for. Based on a probabilistic data model introduced in earlier work, we derive the Bayes-optimal classifier for the H-loss. We then empirically compare two incremental approximations of the Bayes-optimal classifier with a flat SVM classifier and with classifiers obtained by using hierarchical versions of the Perceptron and SVM algorithms. The experiments show that our simplest incremental approximation of the Bayes-optimal classifier performs, after just one training epoch, nearly as well as the hierarchical SVM classifier (which performs best). For the same incremental algorithm we also derive an H-loss bound showing, when data are generated by our probabilistic data model, exponentially fast convergence to the H-loss of the hierarchical classifier based on the true model parameters.


An integrated framework for optimizing automatic monitoring systems in large IT infrastructures

The competitive business climate and the complexity of IT environments dictate efficient and cost-effective service delivery and support of IT services. These are largely achieved by automating routine maintenance procedures, including problem detection, determination and resolution. System monitoring provides an effective and reliable means for problem detection. Coupled with automated ticket creation, it ensures that a degradation of the vital signs, defined by acceptable thresholds or monitoring conditions, is flagged as a problem candidate and sent to supporting personnel as an incident ticket. This paper describes an integrated framework for minimizing false positive tickets and maximizing the monitoring coverage for system faults.
 In particular, the integrated framework defines monitoring conditions and the optimal corresponding delay times based on an off-line analysis of historical alerts and incident tickets. Potential monitoring conditions are built on a set of predictive rules which are automatically generated by a rule-based learning algorithm with coverage, confidence and rule complexity criteria. These conditions and delay times are propagated as configurations into run-time monitoring systems. Moreover, a part of misconfigured monitoring conditions can be corrected according to false negative tickets that are discovered by another text classification algorithm in this framework. This paper also provides implementation details of a program product that uses this framework and shows some illustrative examples of successful results.


Learning with kernels

All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher.


Fast Exact Inference with a Factored Model for Natural Language Parsing

We presenta novel generati ve model for natural languagetree structuresin whichsemantic(lexical dependenc y) andsyntacticstructuresare scoredwith separatemodels.Thisfactorizationprovidesconceptual simplicity, straightforwardopportunitiesfor separatelyimproving the componentmodels,anda level of performancealreadycloseto thatof similar, non-factoredmodels.Most importantly, unlikeothermodernparsing models,thefactoredmodeladmitsanextremelyeffectiveA parsingalgorithm,which makesefficient,exactinferencefeasible.


Large margin hierarchical classification

We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded by a rooted tree which induces a metric over the label set. Our approach combines ideas from large margin kernel methods and Bayesian analysis. Following the large margin principle, we associate a prototype with each label in the tree and formulate the learning task as an optimization problem with varying margin constraints. In the spirit of Bayesian methods, we impose similarity requirements between the prototypes corresponding to adjacent labels in the hierarchy. We describe new online and batch algorithms for solving the constrained optimization problem. We derive a worst case loss-bound for the online algorithm and provide generalization analysis for its batch counterpart. We demonstrate the merits of our approach with a series of experiments on synthetic, text and speech data.


A ZigBee -wireless wearable remote physiological monitoring system

Wearable health monitoring systems use integrated sensors to monitor vital physiological parameters of the wearer. The paper discusses the preliminary results of a prototype wearable physiological monitoring system to monitor physiological parameters such as Electrocardiogram (ECG), Heart Rate (HR), Electroencephalogram (EEG) and Body Temperature. The ECG and EEG signals are acquired using a textile electrodes integrated into the fabric of the wearer. The acquired ECG and EEG signals are processed to remove noises and the parameters are extracted and trend analysis is carried out. The physiological parameters are monitored at the remote monitoring station using a ZigBee wireless communication.


A survey of datasets for visual tracking

For 15 years now, visual tracking has been a very active research area of the computer vision community. But an increasing amount of works can be observed in the last five years. This has led to the development of numerous algorithms that can deal with more and more complex video sequences. Each of them has its own strengths and weaknesses. That is the reason why it becomes necessary to compare those algorithms. For this purpose, some datasets dedicated to visual tracking as well as, sometimes, their ground truth annotation files are regularly made publicly available by researchers. However, each dataset has its own specificities and is sometimes dedicated to test the ability of some algorithms to tackle only one or a few specific visual tracking subproblems. This article provides an overview of some of the datasets that are most used by the visual tracking community, but also of others that address specific tasks. We also propose a cartography of these datasets from a novel perspective, namely that of the difficulties the datasets present for visual tracking.


DC Voltage Balancing for PWM Cascaded H-Bridge Converter Based STATCOM

This paper presents a new control method for cascaded connected H-bridge converter based STATCOMs. These converters have been classically commutated at fundamental line-frequencies, but the evolution of power semiconductors has allowed to increase switching frequencies and the power ratings of these devices, permitting the use of PWM modulation techniques. This paper mainly focuses the DC bus voltage balancing problems, and proposes a new control technique that solves these balancing problems maintaining the delivered reactive power equally distributed among all the H-bridges of the converter


Emotion recognition from text using semantic labels and separable mixture models

This study presents a novel approach to automatic emotion recognition from text. First, emotion generation rules (EGRs) are manually deduced from psychology to represent the conditions for generating emotion. Based on the EGRs, the emotional state of each sentence can be represented as a sequence of semantic labels (SLs) and attributes (ATTs); SLs are defined as the domain-independent features, while ATTs are domain-dependent. The emotion association rules (EARs) represented by SLs and ATTs for each emotion are automatically derived from the sentences in an emotional text corpus using the a priori algorithm. Finally, a separable mixture model (SMM) is adopted to estimate the similarity between an input sentence and the EARs of each emotional state. Since some features defined in this approach are domain-dependent, a dialog system focusing on the students' daily expressions is constructed, and only three emotional states, happy, unhappy, and neutral, are considered for performance evaluation. According to the results of the experiments, given the domain corpus, the proposed approach is promising, and easily ported into other domains.


Project Aura: Toward Distraction-Free Pervasive Computing

A s the effects of Moore's law cause computing systems to become cheaper and more plentiful, a new problem arises: increasingly, the bottleneck in computing is not its disk capacity, processor speed, or communication bandwidth, but rather the limited resource of human attention. Human attention refers to a user's ability to attend to his or her primary tasks, ignoring system-generated distractions such as poor performance and failures. By exploiting plentiful computing resources to reduce user distraction, Project Aura is creating a system whose effectiveness is considerably greater than that of other systems today. Aura is specifically intended for pervasive computing environments involving wireless communication , wearable or handheld computers, and smart spaces. Human attention is an especially scarce resource in such environments, because the user is often preoccupied with walking, driving, or other real-world interactions. In addition, mobile computing poses difficult challenges such as intermittent and variable-bandwidth connectivity, concern for battery life, and the client resource constraints that weight and size considerations impose. To accomplish its ambitious goals, research in Aura spans every system level: from the hardware, through the operating system, to applications and end users. Underlying this diversity of concerns, Aura applies two broad concepts. First, it uses proactivity, which is a system layer's ability to anticipate requests from a higher layer. In today's systems , each layer merely reacts to the layer above it. Second, Aura is self-tuning: layers adapt by observing the demands made on them and adjusting their performance and resource usage characteristics accordingly. Currently, system-layer behavior is relatively static. Both of these techniques will help lower demand for human attention. To illustrate the kind of world we are trying to create, we present two hypothetical Aura scenarios. Although these might seem far-fetched today, they represent the kind of scenarios we expect to make commonplace through our research. In the first scenario, Jane is at Gate 23 in the Pitts-burgh airport, waiting for her connecting flight. She has edited many large documents and would like to use her wireless connection to email them. Unfortunately , bandwidth is miserable because many passengers at Gates 22 and 23 are surfing the Web. Aura observes that, at the current bandwidth, Jane won't be able to finish sending her documents before her flight departs. Consulting the airport's wireless network bandwidth service and flight schedule service, Aura discovers that wireless bandwidth is excellent at Gate 15, and that there are …


Potassium and sodium transporters of Pseudomonas aeruginosa regulate virulence to barley

We investigated the role of three uncharacterized cation transporters of Pseudomonas aeruginosa PAO1 as virulence factors for barley: PA1207, PA5021, and PA2647. PAO1 displayed reduced barley virulence with inactivated PA1207, PA5021, and PA2647 as well as with one known Na+/H+ antiporter, PA1820. Using the Escherichia coli LB2003 mutant lacking three K+ uptake systems, the expression of the PA5021 gene repressed LB2003 growth with low K+, but the strain acquired tolerance to high K+. In contrast, the expression of the PA1207 gene enhanced growth of LB2003 with low K+ but repressed its growth with high K+; therefore, the PA5021 protein exports K+, while the PA1207 protein imports K+. The PA5021 mutant of P. aeruginosa also showed impaired growth at 400 mM KCl and at 400 mM NaCl; therefore, the PA5021 protein may also export Na+. The loss of the PA5021 protein also decreased production of the virulence factor pyocyanin; corroborating this result, pyocyanin production decreased in wild-type PAO1 under high salinity. Whole-genome transcriptome analysis showed that PAO1 induced more genes in barley upon infection compared to the PA5021 mutant. Additionally, PAO1 infection induced water stress-related genes in barley, which suggests that barley may undergo water deficit upon infection by this pathogen.


Design of broadband circularly polarized horn antenna using an L-shaped probe

This paper deals with a circular horn antenna fed by an L-shaped probe. The design process for broadband matching to a 50 Omega coaxial cable, and the antenna performance in axial ratio and gain are presented. The simulation results of this paper were obtained using Ansoft HFSS 9.2


COMPUTATION OF CONDITIONAL PROBABILITY STATISTICS BY 8-MONTH-OLD INFANTS

321 Abstract— A recent report demonstrated that 8-month-olds can segment a continuous stream of speech syllables, containing no acoustic or prosodic cues to word boundaries, into wordlike units after only 2 min of listening experience (Saffran, Aslin, & Newport, 1996). Thus, a powerful learning mechanism capable of extracting statistical information from fluent speech is available early in development. The present study extends these results by documenting the particular type of statistical computation—transitional (conditional) probability—used by infants to solve this word-segmentation task. An artificial language corpus, consisting of a continuous stream of trisyllabic nonsense words, was presented to 8-month-olds for 3 min. A postfamiliarization test compared the infants' responses to words versus part-words (tri-syllabic sequences spanning word boundaries). The corpus was constructed so that test words and part-words were matched in frequency, but differed in their transitional probabilities. Infants showed reliable discrimination of words from part-words, thereby demonstrating rapid segmentation of continuous speech into words on the basis of transitional probabilities of syllable pairs. Many aspects of the patterns of human languages are signaled in the speech stream by what is called distributional evidence, that is, regularities in the relative positions and order of elements over a corpus of utterances (Bloomfield, 1933; Maratsos & Chalkley, 1980). This type of evidence, along with linguistic theories about the characteristics of human languages, is what comparative linguists use to discover the structure of exotic languages (Harris, 1951). Similarly, this type of evidence , along with tendencies to perform certain kinds of analyses on language input (Chomsky, 1957), could be used by human language learners to acquire their native languages. However, using such evidence would require rather complex distributional and statistical computations , and surprisingly little is known about the abilities of human infants and young children to perform these computations. By using the term computation, we do not mean, of course, that infants are consciously performing a mathematical calculation, but rather that they might be sensitive to and able to store quantitative aspects of distribu-tional information about a language corpus. Recently, we have begun studying this problem by investigating the abilities of human learners to use statistical information to dis-Words are known to vary dramatically from one language to another, so finding the words of a language is clearly a problem that must involve learning from the linguistic environment. Moreover, the beginnings and ends of the sequences of sounds that form words in a …


A deep learning-based multi-sensor data fusion method for degradation monitoring of ball screws

As ball screw has complex structure and long range of distribution, single signal collected by one sensor is difficult to express its condition fully and accurately. Multi-sensor data fusion usually has a better effect compared with single signal. Multi-sensor data fusion based on neural network(BP) is a commonly used multi-sensor data fusion method, but its application is limited by local optimum problem. Aiming at this problem, a multi-sensor data fusion method based on deep learning for ball screw is proposed in this paper. Deep learning, which consists of unsupervised learning and supervised learning, is the development and evolution of traditional neural network. It can effectively alleviate the optimization difficulty. Parallel superposition on frequency spectra of signals is directly done in the proposed deep learning-based multi-sensor data fusion method, and deep belief networks(DBN) are established by using fused data to adaptively mine available fault characteristics and automatically identify the degradation condition of ball screw. Test is designed to collect vibration signals of ball screw in 7 different degradation conditions by using 5 acceleration sensors installed on different places. The proposed fusion method is applied in identifying the degradation degree of ball screw in the test to demonstrate its efficacy. Finally, the multi-sensor data fusion based on neural network is also applied in degradation degree monitoring. The monitoring accuracy of deep learning-based multi-sensor data fusion is higher compared with that of neural network-based multi-sensor data fusion, which means the proposed method has more superiority.


Dual methods for nonconvex spectrum optimization of multicarrier systems

The design and optimization of multicarrier communications systems often involve a maximization of the total throughput subject to system resource constraints. The optimization problem is numerically difficult to solve when the problem does not have a convexity structure. This paper makes progress toward solving optimization problems of this type by showing that under a certain condition called the time-sharing condition, the duality gap of the optimization problem is always zero, regardless of the convexity of the objective function. Further, we show that the time-sharing condition is satisfied for practical multiuser spectrum optimization problems in multicarrier systems in the limit as the number of carriers goes to infinity. This result leads to efficient numerical algorithms that solve the nonconvex problem in the dual domain. We show that the recently proposed optimal spectrum balancing algorithm for digital subscriber lines can be interpreted as a dual algorithm. This new interpretation gives rise to more efficient dual update methods. It also suggests ways in which the dual objective may be evaluated approximately, further improving the numerical efficiency of the algorithm. We propose a low-complexity iterative spectrum balancing algorithm based on these ideas, and show that the new algorithm achieves near-optimal performance in many practical situations


A Comprehensive Framework for Evaluation in Design Science Research

Evaluation is a central and essential activity in conducting rigorous Design Science Research (DSR), yet there is surprisingly little guidance about designing the DSR evaluation activity beyond suggesting possible methods that could be used for evaluation. This paper extends the notable exception of the existing framework of Pries-Heje et al [11] to address this problem. The paper proposes an extended DSR evaluation framework together with a DSR evaluation design method that can guide DSR researchers in choosing an appropriate strategy for evaluation of the design artifacts and design theories that form the output from DSR. The extended DSR evaluation framework asks the DSR researcher to consider (as input to the choice of the DSR evaluation strategy) contextual factors of goals, conditions, and constraints on the DSR evaluation, e.g. the type and level of desired rigor, the type of artifact, the need to support formative development of the designed artifacts, the properties of the artifact to be evaluated, and the constraints on resources available, such as time, labor, facilities, expertise, and access to research subjects. The framework and method support matching these in the first instance to one or more DSR evaluation strategies, including the choice of ex ante (prior to artifact construction) versus ex post evaluation (after artifact construction) and naturalistic (e.g., field setting) versus artificial evaluation (e.g., laboratory setting). Based on the recommended evaluation strategy(ies), guidance is provided concerning what methodologies might be appropriate within the chosen strategy(ies).


Clustering to Find Exemplar Terms for Keyphrase Extraction

Keyphrases are widely used as a brief summary of documents. Since manual assignment is time-consuming, various unsupervised ranking methods based on importance scores are proposed for keyphrase extraction. In practice, the keyphrases of a document should not only be statistically important in the document, but also have a good coverage of the document. Based on this observation, we propose an unsupervised method for keyphrase extraction. Firstly, the method finds exemplar terms by leveraging clustering techniques, which guarantees the document to be semantically covered by these exemplar terms. Then the keyphrases are extracted from the document using the exemplar terms. Our method outperforms sate-of-the-art graphbased ranking methods (TextRank) by 9.5% in F1-measure.


TextRay: Mining Clinical Reports to Gain a Broad Understanding of Chest X-Rays

The chest X-ray (CXR) is by far the most commonly performed radiological examination for screening and diagnosis of many cardiac and pulmonary diseases. There is an immense world-wide shortage of physicians capable of providing rapid and accurate interpretation of this study. A radiologist-driven analysis of over two million CXR reports generated an ontology including the 40 most prevalent pathologies on CXR. By manually tagging a relatively small set of sentences, we were able to construct a training set of 959k studies. A deep learning model was trained to predict the findings given the patient frontal and lateral scans. For 12 of the findings we compare the model performance against a team of radiologists and show that in most cases the radiologists agree on average more with the algorithm than with each other.


Fast bayesian compressive sensing using Laplace priors

In this paper we model the components of the compressive sensing (CS) problem using the Bayesian framework by utilizing a hierarchical form of the Laplace prior to model sparsity of the unknown signal. This signal prior includes some of the existing models as special cases and achieves a high degree of sparsity. We develop a constructive (greedy) algorithm resulting from this formulation where necessary parameters are estimated solely from the observation and therefore no user-intervention is needed. We provide experimental results with synthetic 1D signals and images, and compare with the state-of-the-art CS reconstruction algorithms demonstrating the superior performance of the proposed approach.


Structure, culture and Simmelian ties in entrepreneurial firms

This article develops a cultural agreement approach to organizational culture that emphasizes how clusters of individuals reinforce potentially idiosyncratic understandings of many aspects of culture including the structure of network relations. Building on recent work concerning Simmelian tied dyads (defined as dyads embedded in three-person cliques), the research examines perceptions concerning advice and friendship relations in three entrepreneurial firms. The results support the idea that Simmelian tied dyads (relative to dyads in general) reach higher agreement concerning who is tied to whom, and who are embedded together in triads in organizations. © 2002 Elsevier Science B.V. All rights reserved.


Thinking like a nurse: a research-based model of clinical judgment in nursing.

This article reviews the growing body of research on clinical judgment in nursing and presents an alternative model of clinical judgment based on these studies. Based on a review of nearly 200 studies, five conclusions can be drawn: (1) Clinical judgments are more influenced by what nurses bring to the situation than the objective data about the situation at hand; (2) Sound clinical judgment rests to some degree on knowing the patient and his or her typical pattern of responses, as well as an engagement with the patient and his or her concerns; (3) Clinical judgments are influenced by the context in which the situation occurs and the culture of the nursing care unit; (4) Nurses use a variety of reasoning patterns alone or in combination; and (5) Reflection on practice is often triggered by a breakdown in clinical judgment and is critical for the development of clinical knowledge and improvement in clinical reasoning. A model based on these general conclusions emphasizes the role of nurses' background, the context of the situation, and nurses' relationship with their patients as central to what nurses notice and how they interpret findings, respond, and reflect on their response.


Efficient Sparse Coding in Early Sensory Processing: Lessons from Signal Recovery

Sensory representations are not only sparse, but often overcomplete: coding units significantly outnumber the input units. For models of neural coding this overcompleteness poses a computational challenge for shaping the signal processing channels as well as for using the large and sparse representations in an efficient way. We argue that higher level overcompleteness becomes computationally tractable by imposing sparsity on synaptic activity and we also show that such structural sparsity can be facilitated by statistics based decomposition of the stimuli into typical and atypical parts prior to sparse coding. Typical parts represent large-scale correlations, thus they can be significantly compressed. Atypical parts, on the other hand, represent local features and are the subjects of actual sparse coding. When applied on natural images, our decomposition based sparse coding model can efficiently form overcomplete codes and both center-surround and oriented filters are obtained similar to those observed in the retina and the primary visual cortex, respectively. Therefore we hypothesize that the proposed computational architecture can be seen as a coherent functional model of the first stages of sensory coding in early vision.


The Security Development Lifecycle in the Context of Accreditation Policies and Standards

The proposed security development lifecycle (SecDLC) model delivers a perpetual cycle of information security management and refinement. Using real-world examples, the authors show how SecDLC ensures the goals of preserving, monitoring, and improving security practices, policies, and standards in private and public sectors. The authors describe the four phases of SecDLC, comparing and contrasting them to existing security development models.


Upgrading Lignocellulosic Biomasses : Hydrogenolysis of Platform Derived Molecules Promoted by Heterogeneous Pd-Fe Catalysts

This review provides an overview of heterogeneous bimetallic Pd-Fe catalysts in the C–C and C–O cleavage of platform molecules such as C2–C6 polyols, furfural, phenol derivatives and aromatic ethers that are all easily obtainable from renewable cellulose, hemicellulose and lignin (the major components of lignocellulosic biomasses). The interaction between palladium and iron affords bimetallic Pd-Fe sites (ensemble or alloy) that were found to be very active in several sustainable reactions including hydrogenolysis, catalytic transfer hydrogenolysis (CTH) and aqueous phase reforming (APR) that will be highlighted. This contribution concentrates also on the different synthetic strategies (incipient wetness impregnation, deposition-precipitaion, co-precipitaion) adopted for the preparation of heterogeneous Pd-Fe systems as well as on the main characterization techniques used (XRD, TEM, H2-TPR, XPS and EXAFS) in order to elucidate the key factors that influence the unique catalytic performances observed.


Proposed embedded security framework for Internet of Things (IoT)

IoT is going to be an established part of life by extending the communication and networking anytime, anywhere. Security requirements for IoT will certainly underline the importance of properly formulated, implemented, and enforced security policies throughout their life-cycle. This paper gives a detailed survey and analysis of embedded security, especially in the area of IoT. Together with the conventional security solutions, the paper highlights the need to provide in-built security in the device itself to provide a flexible infrastructure for dynamic prevention, detection, diagnosis, isolation, and countermeasures against successful breaches. Based on this survey and analysis, the paper defines the security needs taking into account computational time, energy consumption and memory requirements of the devices. Finally, this paper proposes an embedded security framework as a feature of software/hardware co-design methodology.


A New Modular Bipolar High-Voltage Pulse Generator

Adapting power-electronic converters that are used in pulsed-power application attracted considerable attention during recent years. In this paper, a modular bipolar high-voltage pulse generator is proposed based on the voltage multipliers and half-bridge converters concept by using power electronics switches. This circuit is capable to generate repetitive high voltage bipolar pulses with a flexible output pattern, by using low voltage power supply and elements. The proposed topology was simulated in MATLAB/Simulink. To verify the circuit operation a four-stage laboratory prototype has been assembled and tested. The results confirm the theoretical analysis and show the validity of the converter scheme.


JOINT IMAGE SHARPENING AND DENOISING BY 3 D TRANSFORM-DOMAIN COLLABORATIVE FILTERING

In order to simultaneously sharpen image details and attenuate noise, we propose to combine the recent blockmatching and 3D Þltering (BM3D) denoising approach, based on 3D transform-domain collaborative Þltering, with alpha-rooting, a transform-domain sharpening technique. The BM3D exploits grouping of similar image blocks into 3D arrays (groups) on which collaborative Þltering (by hard-thresholding) is applied. We propose two approaches of sharpening by alpha-rooting; the Þrst applies alpharooting individually on the 2D transform spectra of each grouped block; the second applies alpha-rooting on the 3D-transform spectra of each 3D array in order to sharpen Þne image details shared by all grouped blocks and further enhance the interblock differences. The conducted experiments with the proposed method show that it can preserve and sharpen Þne image details and effectively attenuate noise.


ACIQ: Analytical Clipping for Integer Quantization of neural networks

Unlike traditional approaches that focus on the quantization at the network level, in this work we propose to minimize the quantization effect at the tensor level. We analyze the trade-off between quantization noise and clipping distortion in low precision networks. We identify the statistics of various tensors, and derive exact expressions for the mean-square-error degradation due to clipping. By optimizing these expressions, we show marked improvements over standard quantization schemes that normally avoid clipping. For example, just by choosing the accurate clipping values, more than 40% accuracy improvement is obtained for the quantization of VGG16-BN to 4-bits of precision. Our results have many applications for the quantization of neural networks at both training and inference time. One immediate application is for a rapid deployment of neural networks to low-precision accelerators without time-consuming fine tuning or the availability of the full datasets.


Latent fault detection in large scale services

Unexpected machine failures, with their resulting service outages and data loss, pose challenges to datacenter management. Existing failure detection techniques rely on domain knowledge, precious (often unavailable) training data, textual console logs, or intrusive service modifications. We hypothesize that many machine failures are not a result of abrupt changes but rather a result of a long period of degraded performance. This is confirmed in our experiments, in which over 20% of machine failures were preceded by such latent faults. We propose a proactive approach for failure prevention. We present a novel framework for statistical latent fault detection using only ordinary machine counters collected as standard practice. We demonstrate three detection methods within this framework. Derived tests are domain-independent and unsupervised, require neither background information nor tuning, and scale to very large services. We prove strong guarantees on the false positive rates of our tests.


An Optimal Auction Mechanism for Mobile Edge Caching

With the explosive growth of wireless data, mobile edge caching has emerged as a promising paradigm to support mobile traffic recently, in which the service providers (SPs) prefetch some popular contents in advance and cache them locally at the network edge. When requested, those locally cached contents can be directly delivered to users with low latency, thus alleviating the traffic load over backhaul channels during peak hours and enhancing the quality-of-experience (QoE) of users simultaneously. Due to the limited available cache space, it makes sense for the SP to cache the most profitable contents. Nevertheless, users' true valuations of contents are their private knowledge, which is unknown to the SP in general. This information asymmetry poses a significant challenge for effective caching at the SP side. Further, the cached contents can be delivered with different quality, which needs to be chosen judiciously to balance delivery costs and user satisfaction. To tackle these difficulties, in this paper, we propose an optimal auction mechanism from the perspective of the SP. In the auction, the SP determines the cache space allocation over contents and user payments based on the users' (possibly untruthful) reports of their valuations so that the SP's expected revenue is maximized. The advocated mechanism is designed to elicit true valuations from the users (incentive compatibility) and to incentivize user participation (individual rationality). In addition, we devise a computationally efficient method for calculating the optimal cache space allocation and user payments. We further examine the optimal choice of the content delivery quality for the case with a large number of users and derive a closed-form solution to compute the optimal delivery quality. Finally, extensive simulations are implemented to evaluate the performance of the proposed optimal auction mechanism, and the impact of various model parameters is highlighted to obtain engineering insights into the content caching problem.


3D object recognition in range images using visibility context

Recognizing and localizing queried objects in range images plays an important role for robotic manipulation and navigation. Even though it has been steadily studied, it is still a challenging task for scenes with occlusion and clutter.


Go-ICP: Solving 3D Registration Efficiently and Globally Optimally

Registration is a fundamental task in computer vision. The Iterative Closest Point (ICP) algorithm is one of the widely-used methods for solving the registration problem. Based on local iteration, ICP is however well-known to suffer from local minima. Its performance critically relies on the quality of initialization, and only local optimality is guaranteed. This paper provides the very first globally optimal solution to Euclidean registration of two 3D point sets or two 3D surfaces under the L2 error. Our method is built upon ICP, but combines it with a branch-and-bound (BnB) scheme which searches the 3D motion space SE(3) efficiently. By exploiting the special structure of the underlying geometry, we derive novel upper and lower bounds for the ICP error function. The integration of local ICP and global BnB enables the new method to run efficiently in practice, and its optimality is exactly guaranteed. We also discuss extensions, addressing the issue of outlier robustness.


Voting-based pose estimation for robotic assembly using a 3D sensor

We propose a voting-based pose estimation algorithm applicable to 3D sensors, which are fast replacing their 2D counterparts in many robotics, computer vision, and gaming applications. It was recently shown that a pair of oriented 3D points, which are points on the object surface with normals, in a voting framework enables fast and robust pose estimation. Although oriented surface points are discriminative for objects with sufficient curvature changes, they are not compact and discriminative enough for many industrial and real-world objects that are mostly planar. As edges play the key role in 2D registration, depth discontinuities are crucial in 3D. In this paper, we investigate and develop a family of pose estimation algorithms that better exploit this boundary information. In addition to oriented surface points, we use two other primitives: boundary points with directions and boundary line segments. Our experiments show that these carefully chosen primitives encode more information compactly and thereby provide higher accuracy for a wide class of industrial parts and enable faster computation. We demonstrate a practical robotic bin-picking system using the proposed algorithm and a 3D sensor.


Surface reconstruction from unorganized points

Computer Graphics, 26, 2, July 1992 Surface Reconstruction from Unorganized Points Hugues Hoppe* Tony DeRose* Tom Duchampt John McDonald$ Werner Stuetzle~ University of Washington Seattle, WA 98195 We describe and demonstrate an algorithm that takes as input an unorganized set of points {xl, . . . . x.} c IR3 on or near an unknown manifold M, and produces as output a simplicial surface that approximates M. Neither the topology, the presence of boundaries, nor the geometry of M are assumed to be known in advance — all are inferred automatically from the data. This problem natu rally arises in a variety of practical situations such as range scanning an object from multiple view points, recovery of biological shapes from two-dimensional slices, and interactive surface sketching. CR


Registration and Integration of Textured 3-D Data

In general, multiple views are required to create a complete 3-D model of an object or of a multi-roomed indoor scene. In this work, we address the problem of merging multiple textured 3-D data sets, each of which corresponds to a different view of a scene or object. There are two steps to the merging process: registration and integration. To register, or align, data sets we use a modified version of the Iterative Closest Point algorithm; our version, which we call color ICP, considers not only 3-D information, but color as well. We show experimentally that the use of color decreases registration error significantly. Once the 3-D data sets have been registered, we integrate them to produce a seamless, composite 3-D textured model. Our approach to integration uses a 3-D occupancy grid to represent likelihood of spatial occupancy through voting. In addition to occupancy information, we store surface normal in each voxel of the occupancy grid. Surface normal is used to robustly extract a surface from the occupancy grid; on that surface we blend textures from multiple views.


Neem and other Botanical insecticides: Barriers to commercialization

In spite of the wide recognition that many plants possess insecticidal properties, only a handful of pest control products directly obtained from plants,i. e., botanical insecticides, are in use in developed countries. The demonstrated efficacy of the botanical neem (based on seed kernel extracts ofAzadirachta indica), and its recent approval for use in the United States, has stimulated research and development of other botanical insecticides. However, the commercialization of new botanical insecticides can be hindered by a number of issues. The principal barriers to commercialization of new botanicals are (i) scarcity of the natural resource; (ii) standardization and quality control; and (iii) registration. These issues are no problem (i) or considerably less of a problem (ii, iii) with conventional insecticides. In this review I discuss these issues and suggest how the problems may be overcome in the future.


Trajectory learning from human demonstrations via manifold mapping

This work proposes a framework that enables arbitrary robots with unknown kinematics models to imitate human demonstrations to acquire a skill, and reproduce it in real-time. The diversity of robots active in non-laboratory environments is growing constantly, and to this end we present an approach for users to be able to easily teach a skill to a robot with any body configuration. Our proposed method requires a motion trajectory obtained from human demonstrations via a Kinect sensor, which is then projected onto a corresponding human skeleton model. The kinematics mapping between the robot and the human model is learned by employing Local Procrustes Analysis, which enables the transfer of the demonstrated trajectory from the human model to the robot. Finally, the transferred trajectory is modeled using Dynamic Movement Primitives, allowing it to be reproduced in real time. Experiments in simulation on a 4 degree of freedom robot show that our method is able to correctly imitate various skills demonstrated by a human.


A Chinese Text Corrector Based on Seq2Seq Model

In this paper, we build a Chinese text corrector which can correct spelling mistakes precisely in Chinese texts. Our motivation is inspired by the recently proposed seq2seq model which consider the text corrector as a sequence learning problem. To begin with, we propose a biased-decoding method to improve the bilingual evaluation understudy (BLEU) score of our model. Secondly, we adopt a more reasonable OOV token scheme, which enhances the robustness of our correction mechanism. Moreover, to test the performance of our proposed model thoroughly, we establish a corpus which includes 600,000 sentences from news data of Sogou Labs. Experiments show that our corrector model can achieve better corrector results based on the corpus.


Cloud Log Forensics Metadata Analysis

The increase in the quantity and questionable quality of the forensic information retrieved from the current virtualized data cloud system architectures has made it extremely difficult for law enforcement to resolve criminal activities within these logical domains. This paper poses the question of what kind of information is desired from virtual machine (VM) hosted operating systems (OS) investigated by a cloud forensic examiner. The authors gives an overview of the information that exists on current VM OS by looking at it's kernel hypervisor logs and discusses the shortcomings. An examination of the role that the VM kernel hypervisor logs provide as OS metadata in cloud investigations is also presented.


A novel wideband slotted mm wave microstrip patch antenna

In this paper, a novel approach for the design of a compact broadband planar microstrip patch antenna is presented for millimetre wave wireless applications. This antenna structure was realized on a Quartz crystal substrate of dielectric constant 3.8 with the thickness of 0.8mm with ground plane. In order to examine, the performances of this antenna it was designed at the frequency 30 GHz and simulated by IE3D software package of Zeland. This type of antenna is composed of two slots of different dimensions and fed by single coaxial feed. Appropriate design of the antenna structure resulted in three discontinuous resonant bands. The proposed antenna has a −10dB return loss impedance bandwidth of 10.3GHz. The performance of this antenna was verified and characterised in terms of the antenna return loss, radiation pattern, surface current distribution and power gain. Also, the numerical results show that the proposed antenna has good impedance bandwidth and radiation characteristics over the entire operating bands. Details of the proposed antenna configurations and design procedures are given.