query: Implementation of a 3 D pose estimation algorithm

positive: Fast Feature Pyramids for Object Detection Multi-resolution image features may be approximated via extrapolation from nearby scales, rather than being computed explicitly. This fundamental insight allows us to design object detection algorithms that are as accurate, and considerably faster, than the state-of-the-art. The computational bottleneck of many modern detectors is the computation of features at every scale of a finely-sampled image pyramid. Our key insight is that one may compute finely sampled feature pyramids at a fraction of the cost, without sacrificing performance: for a broad family of features we find that features computed at octave-spaced scale intervals are sufficient to approximate features on a finely-sampled pyramid. Extrapolation is inexpensive as compared to direct feature computation. As a result, our approximation yields considerable speedups with negligible loss in detection accuracy. We modify three diverse visual recognition systems to use fast feature pyramids and show results on both pedestrian detection (measured on the Caltech, INRIA, TUD-Brussels and ETH data sets) and general object detection (measured on the PASCAL VOC). The approach is general and is widely applicable to vision algorithms requiring fine-grained multi-scale analysis. Our approximation is valid for images with broad spectra (most natural images) and fails for images with narrow band-pass spectra (e.g., periodic textures).

positive: Fast Explicit Diffusion for Accelerated Features in Nonlinear Scale Spaces We propose a novel and fast multiscale feature detection and description approach that exploits the benefits of nonlinear scale spaces. Previous attempts to detect and describe features in nonlinear scale spaces are highly time consuming due to the computational burden of creating the nonlinear scale space. In this paper we propose to use recent numerical schemes called Fast Explicit Diffusion (FED) embedded in a pyramidal framework to dramatically speed-up feature detection in nonlinear scale spaces. In addition, we introduce a Modified-Local Difference Binary (M-LDB) descriptor that is highly efficient, exploits gradient information from the nonlinear scale space, is scale and rotation invariant and has low storage requirements. We present an extensive evaluation that shows the excellent compromise between speed and performance of our approach compared to state-of-the-art methods such as BRISK, ORB, SURF, SIFT and KAZE.

positive: Polynomial Eigenvalue Solutions to the 5-pt and 6-pt Relative Pose Problems In this paper we provide new fast and simple solutions to two important minimal problems in computer vision, the five-point relative pose problem and the six-point focal length problem. We show that these two problems can easily be formulated as polynomial eigenvalue problems of degree three and two and solved using standard efficient numerical algorithms. Our solutions are somewhat more stable than state-of-the-art solutions by Nister and Stewenius and are in some sense more straightforward and easier to implement since polynomial eigenvalue problems are well studied with many efficient and robust algorithms available. The quality of the solvers is demonstrated in experiments 1.

positive: Object Recognition from Local Scale-Invariant Features Proc. of the International Conference on Computer Vision, Corfu (Sept. 1999) An object recognition system has been developed that uses a new class of local image features. The features are invariant to image scaling, translation, and rotation, and partially invariant to illumination changes and affine or 3D projection. These features share similar properties with neurons in inferior temporal cortex that are used for object recognition in primate vision. Features are efficiently detected through a staged filtering approach that identifies stable points in scale space. Image keys are created that allow for local geometric deformations by representing blurred image gradients in multiple orientation planes and at multiple scales. The keys are used as input to a nearest-neighbor indexing method that identifies candidate object matches. Final verification of each match is achieved by finding a low-residual least-squares solution for the unknown model parameters. Experimental results show that robust object recognition can be achieved in cluttered partially-occluded images with a computation time of under 2 seconds.

positive: Multi-image matching using multi-scale oriented patches This paper describes a novel multi-view matching framework based on a new type of invariant feature. Our features are located at Harris corners in discrete scale-space and oriented using a blurred local gradient. This defines a rotationally invariant frame in which we sample a feature descriptor, which consists of an 8 /spl times/ 8 patch of bias/gain normalised intensity values. The density of features in the image is controlled using a novel adaptive non-maximal suppression algorithm, which gives a better spatial distribution of features than previous approaches. Matching is achieved using a fast nearest neighbour algorithm that indexes features based on their low frequency Haar wavelet coefficients. We also introduce a novel outlier rejection procedure that verifies a pairwise feature match based on a background distribution of incorrect feature matches. Feature matches are refined using RANSAC and used in an automatic 2D panorama stitcher that has been extensively tested on hundreds of sample inputs.

negative: The Option-Critic Architecture We first studied the behavior of the intra-option policy gradient algorithm when the initiation sets and subgoals are fixed by hand. In this case, options terminate with probability 0.9 in a hallway state and four of its incoming neighboring states. We chose to parametrize the intra-option policies using the softmax distribution with a one-hot encoding of state-action pairs as basis functions. Learning both intra-option policies and terminations

negative: Dark vs. Dim Silicon and Near-Threshold Computing Due to limited scaling of supply voltage, power density is expected to grow in future technology nodes. This increasing power density potentially limits the number of transistors switching at full speed in the future. Near-threshold operation can increase the number of simultaneously active cores, at the expense of much lower operating frequency (“dim silicon”). Although promising to increase overall throughput, dim cores suffer from diminishing returns as the number of cores increases. At this point, hardware accelerators become more efficient alternatives. To explore such a broad design space, we have developed a framework called Lumos to analytically quantify the performance limits of many-core, heterogeneous systems operating at near-threshold voltage. Lumos augments Amdahl’s Law with detailed scaling of frequency and power, calibrated by circuit-level simulations using a modified Predictive Technology Model (PTM) and factors in effects of process variations. While our results show that dim cores do indeed boost throughput, even in the presence of process variations, significant benefits are only achieved in applications with very high parallelism or with novel architectures to mitigate variation. A more beneficial 1 and scalable approach is to use accelerators. However, reconfigurable logic that supports a variety of accelerators is more beneficial than a dedicated, fixed-logic accelerator, unless 1) the dedicated kernel has overwhelming coverage across applications (e.g. twice as large as the total of all others), or 2) the speedup of the dedicated accelerator over the reconfigurable equivalent is significant (e.g. 10x-50x).

negative: AmiGO: online access to ontology and annotation data AmiGO is a web application that allows users to query, browse and visualize ontologies and related gene product annotation (association) data. AmiGO can be used online at the Gene Ontology (GO) website to access the data provided by the GO Consortium; it can also be downloaded and installed to browse local ontologies and annotations. AmiGO is free open source software developed and maintained by the GO Consortium.

negative: A GLOBAL MEASURE OF PERCEIVED STRESS Aim: To evaluate validity of the Greek version of a global measure of perceived stress PSS−14 (Perceived Stress Scale – 14 item). Materials and Methods: The original PSS−14 (theoretical range 0−56) was translated into Greek and then back-translated. One hundred men and women (39±10 years old, 40 men) participated in the validation process. Firstly, participants completed the Greek PSS−14 and, then they were interviewed by a psychologist specializing in stress management. Cronbach’s alpha (α) evaluated internal consistency of the measurement, whereas Kendall’s tau-b and Bland & Altman methods assessed consistency with the clinical evaluation. Exploratory and Confirmatory Factor analyses were conducted to reveal hidden factors within the data and to confirm the two-dimensional character of the scale. Results: Mean (SD) PSS−14 score was 25(7.9). Strong internal consistency (Cronbach’s α = 0.847) as well as moderate-to-good concordance between clinical assessment and PSS−14 (Kendall’s tau-b = 0.43, p<0.01) were observed. Two factors were extracted. Factor one explained 34.7% of variability and was heavily laden by positive items, and factor two that explained 10.6% of the variability by negative items. Confirmatory factor analysis revealed that the model with 2 factors had chi-square equal to 241.23 (p<0.001), absolute fix indexes were good (i.e. GFI=0.733, AGFI=0.529), and incremental fix indexes were also adequate (i.e. NFI=0.89 and CFI=0.92). Conclusion: The developed Greek version of PSS−14 seems to be a valid instrument for the assessment of perceived stress in the Greek adult population living in urban areas; a finding that supports its local use in research settings as an evaluation tool measuring perceived stress, mainly as a risk factor but without diagnostic properties.

negative: Stress and hippocampal plasticity. The hippocampus is a target of stress hormones, and it is an especially plastic and vulnerable region of the brain. It also responds to gonadal, thyroid, and adrenal hormones, which modulate changes in synapse formation and dendritic structure and regulate dentate gyrus volume during development and in adult life. Two forms of structural plasticity are affected by stress: Repeated stress causes atrophy of dendrites in the CA3 region, and both acute and chronic stress suppresses neurogenesis of dentate gyrus granule neurons. Besides glucocorticoids, excitatory amino acids and N-methyl-D-aspartate (NMDA) receptors are involved in these two forms of plasticity as well as in neuronal death that is caused in pyramidal neurons by seizures and by ischemia. The two forms of hippocampal structural plasticity are relevant to the human hippocampus, which undergoes a selective atrophy in a number of disorders, accompanied by deficits in declarative episodic, spatial, and contextual memory performance. It is important, from a therapeutic standpoint, to distinguish between a permanent loss of cells and a reversible atrophy.

negative: Conservative treatment of carpal tunnel syndrome: comparison between laser therapy and Fascial Manipulation(®). The etiopathogenesis of Carpal Tunnel Syndrome (CTS) is multifactorial and most cases are classified as idiopathic (Thurston 2013). A randomized controlled trial was performed to compare the effectiveness of Fascial Manipulation(®) (FM) and Low-Level Laser Therapy (LLLT) for CTS. This prospective trial included 42 patients (70 hands with symptoms) with clinical and electroneuromyographic diagnosis of CTS. The patients were randomly assigned to receive multiple sessions of FM or multiple session of LLLT. The Visual Analogic Scale (VAS) and Boston Carpal Tunnel Questionnaire (BCTQ) were performed at baseline, end of treatment and after three months. The group that received FM showed a significant reduction in subjective pain perception and an increased function assessed by BCTQ at the end of the treatment and follow-up. The group that received LLLT showed an improvement in the BCTQ at the end of the treatment but the improvement level was not sustained at the three month follow-up. FM is a valid alternative treatment for CTS.

negative: An OFDMA based multiple access protocol with QoS guarantee for next generation WLAN To provide better QoS guarantee for the next generation WLAN, IEEE 802.11ax task group is founded in March 2014. As a promising technology to accommodate multiple nodes concurrent transmissions in dense deployment scenario, orthogonal frequency division multiple access (OFDMA) will be adopted in IEEE 802.11ax with great possibility. In this paper, an OFDMA based multiple access protocol with QoS guarantee is proposed for the next generation WLAN. Firstly, a redundant access mechanism is given to increase the access success probability of the video traffic where the video stations can concurrently send multiple RTS packets in multiple subchannels. Secondly, a priority based resource allocation scheme is presented to let AP allocate more resources to the video stations. Simulation results show that our protocol outperforms the existing OFDMA based multiple access for IEEE 802.11ax (OMAX) protocol in terms of delay and delay jitter of video traffic in dense deployment scenario.

negative: 10.6 THz figure-of-merit phase-change RF switches with embedded micro-heater We report on GeTe-based phase-change RF switches with embedded micro-heater for thermal switching. With heater parasitics reduced, GeTe RF switches show onstate resistance of 0.05 ohm*mm and off-state capacitance of 0.3 pF/mm. The RF switch figure-of-merit is estimated to be 10.6 THz, which is about 15 times better than state-of-the-art silicon-on-insulator switches. With on-state resistance of 1 ohm and off-state capacitance of 15 fF, RF insertion loss was measured at <;0.2 dB, and isolation was >25 dB at 20 GHz, respectively. RF power handling was >5.6 W for both onand off-state of GeTe.

negative: The Mediator complex: a central integrator of transcription The RNA polymerase II (Pol II) enzyme transcribes all protein-coding and most non-coding RNA genes and is globally regulated by Mediator — a large, conformationally flexible protein complex with a variable subunit composition (for example, a four-subunit cyclin-dependent kinase 8 module can reversibly associate with it). These biochemical characteristics are fundamentally important for Mediator's ability to control various processes that are important for transcription, including the organization of chromatin architecture and the regulation of Pol II pre-initiation, initiation, re-initiation, pausing and elongation. Although Mediator exists in all eukaryotes, a variety of Mediator functions seem to be specific to metazoans, which is indicative of more diverse regulatory requirements.

negative: From information security to ... business security? This short opinion paper argues that information security, the discipline responsible for protecting a company's information assets against business risks, has now become such a crucial component of good Corporate Governance, that it should rather be called Business Security instead of Information Security. During the last year or two, driven by developments in the field of Corporate Governance, including IT Governance, it became apparent that the scope of Information Security is much wider than just (directly) protecting the data, information and software of a business. Such data, information and software had become invaluable assets of the business as a whole, and not properly protecting this information could have profound business and legal implications. Basically, the data and information of the business became its 'life blood', and compromising this life blood, could kill the business. Executive Management and Boards started realizing that Information Security Governance was becoming their direct responsibility, and that serious personal consequences, specifically legally, could flow from ignoring information security. Information security governance had become an

negative: Support Vector Machines For Synthetic Aperture Radar Automatic Target Recognition Algorithms that produce classifiers with large margins, such as support vector machines (SVMs), AdaBoost, etc. are receiving more and more attention in the literature. This paper presents a real application of SVMs for synthetic aperture radar automatic target recognition (SAR/ATR) and compares the result with conventional classifiers. The SVMs are tested for classification both in closed and open sets (recognition). Experimental results showed that SVMs outperform conventional classifiers in target classification. Moreover, SVMs with the Gaussian kernels are able to form a local " bounded " decision region around each class that presents better rejection to confusers.

negative: A SiC-Based High-Efficiency Isolated Onboard PEV Charger With Ultrawide DC-Link Voltage Range In LLC-based onboard battery charging architectures used in plug-in electric vehicles (PEV), the dc link voltage can be actively regulated to follow the battery pack voltage so that the LLC converter can operate in proximity of resonant frequency and achieve high efficiencies over the wide range of battery pack voltage. However, conventional boost-type power factor correction (PFC) converters are unable to provide ultrawide dc link voltages since their output voltages should always be larger than their input voltages. This paper proposes a Silicon Carbide (SiC)-based onboard PEV charger using single-ended primary-inductor converter (SEPIC) PFC converter followed by an isolated LLC resonant converter. With the proposed charger architecture, the SEPIC PFC converter is able to provide an ultrawide range for dc link voltage, and consequently enhance the efficiency of the LLC stage by ensuring operation in proximity of resonant frequency. A 1-kW SiC-based prototype is designed to validate the proposed idea. The experimental result shows that the SEPIC PFC converter achieves unity power factor, 2.72% total harmonic distortion, and 95.3% peak conversion efficiency. The LLC  converter achieves 97.1% peak efficiency and always demonstrates a very high efficiency across the ultrawide dc-link voltage range. The overall efficiency of the charger is 88.5% to 93.5% from 20% of the rated load to full load.

negative: EKG-based key agreement in Body Sensor Networks Preserving a person's privacy in an efficient manner is very important for critical, life-saving infrastructures like body sensor networks (BSN). This paper presents a novel key agreement scheme which allows two sensors in a BSN to agree to a common key generated using electrocardiogram (EKG) signals. This EKG-based key agreement (EKA) scheme aims to bring the "plug-n-play" paradigm to BSN security whereby simply deploying sensors on the subject can enable secure communication, without requiring any form of initialization such as pre-deployment. Analysis of the scheme based on real EKG data (obtained from MIT PhysioBank database) shows that keys resulting from EKA are: random, time variant, can be generated based on short-duration EKG measurements, identical for a given subject and different for separate individuals.

negative: Zero-Current Switching Switched-Capacitor Zero-Voltage-Gap Automatic Equalization System for Series Battery String The series battery string or supercapacitor string automatic equalization system based on quasi-resonant switched-capacitor converter is presented in this paper. It realizes the zero-voltage gap between cells and allows maximum energy recovery in a series battery system or supercapacitor system. It not only inherits the advantage of conventional switched-capacitor battery cell balancing system, but also overcomes the drawback of conduction loss, switching loss, and finite voltage difference among battery cells. All switches are MOSFET and controlled by just a pair of complementary signals in synchronous trigger pattern and the resonant tanks operate alternatively between the two states of charging and discharging. Zero-current switching and zero-voltage gap are achieved in this paper. Different resonant tank designs can meet the needs of different balancing time to meet the needs of different energy storage devices. Experimental results indicate that the efficiency of the system is high exceeding 98%. The system is very suitable for balancing used in battery management system.

negative: Wireless access monitoring and control system based on digital door lock We propose a novel wireless access monitoring and control system based on the digital door lock, which is explosively used as a digital consumer device. Digital door lock is an electronic locking system operated by the combination of digital key, security password or number codes. This paper presents a prototype of the proposed system and shows a scheme for the implementation. To implement the system with ZigBee network protocol, four types of modules are developed, ZigBee module, digital door lock module, human detection module, and ZigBee relay module. ZigBee module is designed to support wireless sensor network and also used for the ZigBee tag to identify the access objects. Digital door lock module is implemented as a digital consumer device to control the access system as well as locking system. It is very convenient system for the consumers and has extensible and flexible characteristics. That is, it can be used as a home security system by the ZigBee network with additional sensor devices. Therefore, it can be a good practical product for the realization of an access monitoring and control system. It also can be applied to the real market for home networking system. Furthermore, the system can be extended to another service such as a connection between mobile phone and home networking system.

negative: Code Conjurer: Pulling Reusable Software out of Thin Air For many years, the IT industry has sought to accelerate the software development process by assembling new applications from existing software assets. However, true component-based reuse of the form Douglas Mcllroy envisaged in the 1960s is still the exception rather than the rule, and most of the systematic software reuse practiced today uses heavyweight approaches such as product-line engineering or domain-specific frameworks. By component, we mean any cohesive and compact unit of software functionality with a well-defined interface - from simple programming language classes to more complex artifacts such as Web services and Enterprise JavaBeans.

negative: Synthetic aperture radar at millimeter wavelength for UAV surveillance applications The airborne monitoring of scenes using unmanned aircrafts is becoming increasingly important. Several types of airborne sensors - in the optical, infrared or millimeter wave spectrum - are available for the different platforms. Beside the all-weather suitability of the sensors, the deployment scenarios, often also demand for the ability to look through dust clouds, smoke, and fog. The only sensor, which is capable to cope with such environmental restrictions and is able to deliver high-resolution images, is the synthetic aperture radar (SAR). In this paper we focus on miniaturized SAR systems which were developed and optimized for utilization in a UA V (unmanned aerial vehicle) with a low loading capacity. This not only requires a compact and light radar sensor but the processing also has to cope with the unstable flight conditions of a small aircraft. Therefore, a high-precision inertial measurement unit (IMU) and motion compensating SAR-algorithms are needed. Thanks to the utilization of a high transmit frequency of either 35 GHz or 94 GHz, the sensors are suitable for the detection of small-scale objects. A very high resolution of 15 cm × 15 cm can be achieved when using modern FMCW (frequency modulated continuous wave) generation with a high bandwidth (up to 1 GHz) in combination with small antennas.

negative: Effect of rule weights in fuzzy rule-based classification systems This paper examines the effect of rule weights in fuzzy rule-based classification systems. Each fuzzy IF–THEN rule in our classification system has antecedent linguistic values and a single consequent class. We use a fuzzy reasoning method based on a single winner rule in the classification phase. The winner rule for a new pattern is the fuzzy IF–THEN rule that has the maximum compatibility grade with the new pattern. When we use fuzzy IF–THEN rules with certainty grades (i.e., rule weights), the winner is determined as the rule with the maximum product of the compatibility grade and the certainty grade. In this paper, the effect of rule weights is illustrated by drawing classification boundaries using fuzzy IF–THEN rules with/without certainty grades. It is also shown that certainty grades play an important role when a fuzzy rule-based classification system is a mixture of general rules and specific rules. Through computer simulations, we show that comprehensible fuzzy rule-based systems with high classification performance can be designed without modifying the membership functions of antecedent linguistic values when we use fuzzy IF–THEN rules with certainty grades.

negative: FindingHuMo: Real-Time Tracking of Motion Trajectories from Anonymous Binary Sensing in Smart Environments In this paper we have proposed and designed FindingHuMo (Finding Human Motion), a real-time user tracking system for Smart Environments. FindingHuMo can perform device-free tracking of multiple (unknown and variable number of) users in the Hallway Environments, just from non-invasive and anonymous (not user specific) binary motion sensor data stream. The significance of our designed system are as follows: (a) fast tracking of individual targets from binary motion data stream from a static wireless sensor network in the infrastructure. This needs to resolve unreliable node sequences, system noise and path ambiguity, (b) Scaling for multi-user tracking where user motion trajectories may crossover with each other in all possible ways. This needs to resolve path ambiguity to isolate overlapping trajectories, FindingHumo applies the following techniques on the collected motion data stream: (i) a proposed motion data driven adaptive order Hidden Markov Model with Viterbi decoding (called Adaptive-HMM), and then (ii) an innovative path disambiguation algorithm (called CPDA). Using this methodology the system accurately detects and isolates motion trajectories of individual users. The system performance is illustrated with results from real-time system deployment experience in a Smart Environment.

negative: On the role of color in the perception of motion in animated visualizations Although luminance contrast plays a predominant role in motion perception, significant additional effects are introduced by chromatic contrasts. In this paper, relevant results from psychophysical and physiological research are described to clarify the role of color in motion detection. Interpreting these psychophysical experiments, we propose guidelines for the design of animated visualizations, and a calibration procedure that improves the reliability of visual motion representation. The guidelines are applied to examples from texture-based flow visualization, as well as graph and tree visualization.

negative: Forward models and passive psychotic symptoms Pickering and Clark (2014) present two ways of viewing the role of forward models in human cognition: the auxiliary forward model (AFM) account and the integral forward model (IFM) account. The AFM account “assumes a dedicated prediction mechanism implemented by additional circuitry distinct from the core mechanisms of perception and action” (p. 451). The standard AFM account exploits a corollary discharge from the motor command in order to compute the sensory consequences of the action. In contrast, on the IFM account, “perception itself involves the use of a forward (generative) model, whose role is to construct the incoming sensory signal ‘from the top down”’ (p. 453). Furthermore, within this account, motor commands are dispensed with: they are predictions that are fulfilled by movement as part of the prediction error minimization that is taken to govern all aspects of cognition (Adams et al., 2013). Pickering and Clark present two “testing grounds” for helping us adjudicate between IFMs and AFMs, which are committed to the idea, derived from Pickering’s own work, that one predicts others in a way that is similar to the way that one predicts oneself. Although I like this “prediction by simulation” account, in this commentary, I want to emphasize that neither the IFM nor the AFM accounts are necessarily wedded to it. A less committal, and hence perhaps more compelling, testing ground is to be found in psychotic symptoms, and the capacity of the two frameworks to account for them. Indeed, using psychosis to illustrate forward modelling is not new: the inability to self-tickle was taken to be convincing data for the presence of forward models (viewed, by default, within an AFM account), and in particular for problems with them in patients with diagnoses of schizophrenia (Frith et al., 2000). The AFM account has been used more generally to explain symptoms of schizophrenia. Something goes wrong with the generation of the forward model, and so the sensory consequences of selfgenerated stimuli are poorly predicted, and hence fail to be attenuated, and are, ultimately, misattributed to an external source. Although most have accepted this for delusions of control, some have questioned the application of this model to passive symptoms (Stephens and Graham, 2000), namely those which do not involve action, such as auditory verbal hallucinations (AVHs). If the symptoms of schizophrenia are explainable in terms of problems with an AFM, and this is constructed out of a motor command, then non-motoric (“passive”) symptoms cannot be so explained. One move has been to keep working within the AFM framework but claim that “passive” symptoms merely look passive: they are actually “active.” Several theorists (e.g., Jones and Fernyhough, 2007) have attempted to explain AVHs in terms of inner speech misattribution, where inner speech is taken to involve motoric elements. This motoric involvement has been empirically supported by several electromyographical (EMG) studies (which measured muscular activity during inner speech) some of which date as far back as the early 1930s (Jacobsen, 1931). Later experiments made the connection between inner speech and AVH, showing that similar muscular activation is involved in healthy inner speech and AVH (Gould, 1948). The involvement of motoric elements in both inner speech and in AVH is further supported by findings (Gould, 1950) showing that when subjects hallucinated, subvocalizations occurred which could be picked up with a throat microphone. That these subvocalizations were causally responsible for the inner speech allegedly implicated in AVHs, and not just echoing it, was suggested by data (Bick and Kinsbourne, 1987) demonstrating that if people experiencing hallucinations opened their mouths wide, stopping vocalizations, then the majority of AVHs stopped. However, this does not seem to capture all AVH subtypes. For example, Dodgson and Gordon (2009) convincingly present “hypervigilance hallucinations,” which are not based on self-generated stimuli, but constitute hypervigilant boosting and molding of external stimuli. As I have argued (Wilkinson, 2014) recently, one can account for both inner speech-based and hypervigilance hallucinations, within an IFM framework (although I called it a “Predictive Processing Framework”). Since it is good practice to support models that accommodate more phenomena, assuming (as seems plausible) that hypervigilance hallucinations are a genuine subtype of AVH, the IFM account is preferable to the AFM account. In conclusion, although I agree with Pickering and Clark that the IFM account is preferable, I do so on the basis of a

negative: Finding objects for blind people based on SURF features Nowadays computer vision technology is helping the visually impaired by recognizing objects in their surroundings. Unlike research of navigation and wayfinding, there are no camera-based systems available in the market to find personal items for the blind. This paper proposes an object recognition method to help blind people find missing items using Speeded-Up Robust Features (SURF). SURF features can extract distinctive invariant features that can be utilized to perform reliable matching between different images in multiple scenarios. These features are invariant to image scale, translation, rotation, illumination, and partial occlusion. The proposed recognition process begins by matching individual features of the user queried object to a database of features with different personal items which are saved in advance. Experiment results demonstrate the effectiveness and efficiency of the proposed method.

negative: UAV vision aided positioning system for location and landing The research and use of UAVs (Unmanned Aerial Vehicles) have grown in attention and new ideas in the last couple of decades, mainly due to technology improvement of its construction parts, sensors and controllers. When it comes to its autonomous behavior, robust techniques make themselves necessary to assure the security of the aircraft and people around it. This work presents the use of computer vision techniques to improve the positioning of a quadrotor UAV in the landing moment, adding security and precision, overcoming intrinsic errors of other positioning sensors, such as GPS. A landmark was built to be detected by the camera with contour detection, image thresholding and other mathematical techniques in order to obtain fast, simple and robust processing and results. A GoPro camera model was used with a developed algorithm to remove the image distortion. With this set up, the vehicle can be programmed to develop any mission, with this works control algorithm taking part with the vision aided positioning in the landing moment. The quadrotor was conceived and built at the GRIn (Grupo de Robtica Inteligente) laboratory at UFJF (Juiz de Fora Federal University), and uses open source code for its control, with Mavlink communication protocol to exchange messages with the vision-based control algorithm for mission and landing. This algorithm was developed in Python language, and is in charge of image characteristics segmentation, extracting distances and altitude from the data. The control commands are sent to the quadrotor using the mentioned protocol. The system is structured with a remote laptop connected with a serial port to the quadrotor, and a router transmits messages back and forth among the GCS (Ground Control Station, on the laptop) and the high-level control algorithm (mission planning and vision based control) through TCP ports to the quadrotor itself. The camera is connected via Wi-Fi built-in network to the laptop, so all the image processing is done inside the last one. The results obtained in outdoor tests show the efficacy and fast processing of the vision methods and ensure safety in the landing moment. Furthermore, the positioning techniques can be extended to other UAV applications, such as transmission lines and utility equipment inspection and monitoring. Future works look forward to embedding the process in a companion board attached to the UAV, so the process would become automatic and the risk of communication interference and lost heavily reduced.

negative: On semi-supervised linear regression in covariate shift problems Semi-supervised learning approaches are trained using the full training (labeled) data and available testing (unlabeled) data. Demonstrations of the value of training with unlabeled data typically depend on a smoothness assumption relating the conditional expectation to high density regions of the marginal distribution and an inherent missing completely at random assumption for the labeling. So-called covariate shift poses a challenge for many existing semi-supervised or supervised learning techniques. Covariate shift models allow the marginal distributions of the labeled and unlabeled feature data to differ, but the conditional distribution of the response given the feature data is the same. An example of this occurs when a complete labeled data sample and then an unlabeled sample are obtained sequentially, as it would likely follow that the distributions of the feature data are quite different between samples. The value of using unlabeled data during training for the elastic net is justified geometrically in such practical covariate shift problems. The approach works by obtaining adjusted coefficients for unlabeled prediction which recalibrate the supervised elastic net to compromise: (i) maintaining elastic net predictions on the labeled data with (ii) shrinking unlabeled predictions to zero. Our approach is shown to dominate linear supervised alternatives on unlabeled response predictions when the unlabeled feature data are concentrated on a low dimensional manifold away from the labeled data and the true coefficient vector emphasizes directions away from this manifold. Large variance of the supervised predictions on the unlabeled set is reduced more than the increase in squared bias when the unlabeled responses are expected to be small, so an improved compromise within the bias-variance tradeoff is the rationale for this performance improvement. Performance is validated on simulated and real data.

negative: VIDEO GAMES: PERSPECTIVE, POINT-OF-VIEW, AND IMMERSION of Thesis Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Master of Arts VIDEO GAMES: PERSPECTIVE, POINT-OF-VIEW, AND IMMERSION By Laurie N. Taylor May 2002 Chair: Dr. Terry Harpold Department: English Presently, video game designers, players, and often even video game theorists approach the representation of point-of-view in video games as intuitive and uncomplicated. Drawing on the current critical work on video games, theories of immersion and engagement, and theories of human-computer-interaction, I question the significance of optical perspective in video games in terms of player point-of-view. Because video games are an experiential medium, critical study of video games must include the study of the diegetic, visual-auditory, interface, and experiential (often termed interactive or participatory) aspects of video game play. Through an analysis of the various points-of-view within different games and the differing points-of-view within a single game, I attempt to delineate the differences both in the creation of the experiential game space and in the possibilities for immersion within the game space. For this, I delimit two types of immersion: diegetic immersion, which corresponds to immersion in the game, and intra-diegetic or situated immersion, which corresponds to immersion

negative:
Better ϵ-Dependencies for Offline Approximate Nearest Neighbor Search, Euclidean Minimum Spanning Trees, and ϵ-Kernels Recently, Arya, da Fonseca, and Mount [STOC 2011, SODA 2012] made notable progress in improving the &epsis;-dependencies in the space/query-time tradeoffs for (1 + &epsis;)-factor approximate nearest neighbor search in fixed-dimensional Euclidean spaces. However, &epsis;-dependencies in the preprocessing time were not considered, and so their data structures cannot be used to derive faster algorithms for offline proximity problems. Known algorithms for many such problems, including approximate bichromatic closest pair (BCP) and approximate Euclidean minimum spanning trees (EMST), typically have factors near (1/&epsis;)d/2±O(1) in the running time when the dimension d is a constant.
 We describe a technique that breaks the (1/&epsis;)d/2 barrier and yields new results for many well-known proximity problems, including:
 • an O((1/&epsis;)d/3+O(1) n)-time randomized algorithm for approximate BCP,
 • an O((1/&epsis;)d/3+O(1) n log n)-time algorithm for approximate EMST, and
 • an O(n log n + (1/&epsis;)d/3+O(1) n)-time algorithm to answer n approximate nearest neighbor queries on n points.
 Using additional bit-packing tricks, we can shave off the log n factor for EMST, and even move most of the &epsis;-factors to a sublinear term.
 The improvement arises from a new time bound for exact "discrete Voronoi diagrams", which were previously used in the construction of &epsis;-kernels (or extent-based coresets), a well-known tool for another class of fundamental problems. This connection leads to more results, including:
 • a streaming algorithm to maintain an approximate diameter in O((1/&epsis;)d/3+O(1)) time per point using O((1/&epsis;)d/2+O(1)) space, and
 • a streaming algorithm to maintain an &epsis;-kernel in O((1/&epsis;)d/4+O(1)) time per point using O((1/&epsis;)d/2+O(1)) space.

negative: Finding the shortest paths by node combination By repeatedly combining the source node's nearest neighbor, we propose a node combination (NC) method to implement the Dijkstra's algorithm. The NC algorithm finds the shortest paths with three simple iterative steps: find the nearest neighbor of the source node, combine that node with the source node, and modify the weights on edges that connect to the nearest neighbor. The NC algorithm is more comprehensible and convenient for programming as there is no need to maintain a set with the nodes' distances. Experimental evaluations on various networks reveal that the NC algorithm is as efficient as Dijkstra's algorithm. As the whole process of the NC algorithm can be implemented with vectors, we also show how to find the shortest paths on a weight matrix. } is the set of nodes, E = {e ij j if there is a link from v i to v j } is the set of edges and W = {w ij j 1 6 i, j 6 N} is the weight matrix for E. Given two nodes v s , v t of G, the shortest path problem can be defined as how to find a path with the minimum sum of the weights on the edges in a v s , v t-path. Generally, v s and v t are called source node and sink node, respectively. The shortest path problem is one of the most fundamental network optimization problems with widespread applications [1–4]. Among the various shortest path algorithms developed [5–12], Dijkstra's algorithm is probably the most well-known. It maintains a set S of solved nodes, comprising those nodes whose final shortest path distance from the source v s has determined, and labels d(i), storing the upper bound of the shortest path distance from v s to v i. The algorithm repeatedly selects the node v k 2 VnS with the minimum d(i), adds v k to S, and updates d(i) for nodes that are incident to v k Step 1. Select a node v k from Q such that dðv k Þ ¼ min v j 2Q dðv j Þ, if d(v k) = 1, stop, otherwise go to Step 2. Step 3. for every v j 2 Q, update d(v j) = min{d(v j), d(v k) + w kj }. Go to Step 1. In practice, Dijkstra's algorithm relies heavily on the strategies used to select the next minimum labeled …

negative: Greed is good: Approximating independent sets in sparse and bounded-degree graphs Theminimum-degree greedy algorithm, or Greedy for short, is a simple and well-studied method for finding independent sets in graphs. We show that it achieves a performance ratio of (Δ+2)/3 for approximating independent sets in graphs with degree bounded by Δ. The analysis yields a precise characterization of the size of the independent sets found by the algorithm as a function of the independence number, as well as a generalization of Turán’s bound. We also analyze the algorithm when run in combination with a known preprocessing technique, and obtain an improved $$(2\bar d + 3)/5$$ performance ratio on graphs with average degree $$\bar d$$ , improving on the previous best $$(\bar d + 1)/2$$ of Hochbaum. Finally, we present an efficient parallel and distributed algorithm attaining the performance guarantees of Greedy.

negative: Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation This paper addresses the problem of parametric representation and estimation of complex planar curves in 2-D, surfaces in 3-D and nonplanar space curves in 3-D. Curves and surfaces can be defined either parametrically or implicitly, and we use the latter representation. A planar curve is the set of zeros of a smooth function of two variables X-Y, a surface is the set of zeros of a smooth function of three variables X-~-Z, and a space curve is the intersection of two surfaces, which are the set of zeros of two linearly independent smooth functions of three variables X-!/-Z. For example, the surface of a complex object in 3D can be represented as a subset of a single implicit surface, with similar results for planar and space curves. We show how this unified representation can be used for object recognition, object position estimation, and segmentation of objects into meaningful subobjects, that is, the detection of “interest regions” that are more complex than high curvature regions and, hence, more useful as features for object recognition. Fitting implicit curves and surfaces to data would be ideally based on minimizing the mean square distance from the data points to the curve or surface. Since the distance from a point to a curve or surface cannot be computed exactly by direct methods, the approximate distance, which is a first-order approximation of the real distance, is introduced, generalizing and unifying previous results. We fit implicit curves and surfaces to data minimizing the approximate mean square distance, which is a nonlinear least squares problem. We show that in certain cases, this problem reduces to the generalized eigenvector fit, which is the minimization of the sum of squares of the values of the functions that define the curves or surfaces under a quadratic constraint function of the data. This fit is computationally reasonable to compute, is readily parallelizable, and, hence, is easily computed in real time. In general, the generalized eigenvector lb provides a very good initial estimate for the iterative minimization of the approximate mean square distance. Although we are primarily interested in the 2-D and 3-D cases, the methods developed herein are dimension independent. We show that in the case of algebraic curves and surfaces, i.e., those defined by sets of zeros of polynomials, the minimizers of the approximate mean square distance and the generalized eigenvector fit are invariant with respect to similarity transformations. Thus, the generalized eigenvector lit is independent of the choice of coordinate system, which is a very desirable property for object recognition, position estimation, and the stereo matching problem. Finally, as applications of the previous techniques, we illustrate the concept of “interest regions” Manuscript received April 13, 1988; revised April 30, 1991. This work was supported by an IBM Fellowship and NSF Grant IRI-8715774. The author was with the Laboratory for Engineering Man/Machine Systems, Department of Engineering, Brown University, Providence, RI 02912. He is now with the Exploratory Computer Vision Group, IBM T. J. Watson Research Center, Yorktown Heights, NY 10598. IEEE Log Number 9102093. for object recognition and describe a variable-order segmentation algorithm that applies to the three cases of interest.

negative:
A study of prefix hijacking and interception in the internet There have been many incidents of prefix hijacking in the Internet. The hijacking AS can blackhole the hijacked traffic. Alternatively, it can transparently intercept the hijacked traffic by forwarding it onto the owner. This paper presents a study of such prefix hijacking and interception with the following contributions: (1). We present a methodology for prefix interception, (2). We estimate the fraction of traffic to any prefix that can be hijacked and intercepted in the Internet today, (3). The interception methodology is implemented and used to intercept real traffic to our prefix, (4). We conduct a detailed study to detect ongoing prefix interception.
 We find that: Our hijacking estimates are in line with the impact of past hijacking incidents and show that ASes higher up in the routing hierarchy can hijack a significant amount of traffic to any prefix, including popular prefixes. A less apparent result is that the same holds for prefix interception too. Further, our implementation shows that intercepting traffic to a prefix in the Internet is almost as simple as hijacking it. Finally, while we fail to detect ongoing prefix interception, the detection exercise highlights some of the challenges posed by the prefix interception problem.

negative: An efficient sparse metric learning in high-dimensional space via l1-penalized log-determinant regularization This paper proposes an efficient sparse metric learning algorithm in high dimensional space via an l1-penalized log-determinant regularization. Compare to the most existing distance metric learning algorithms, the proposed algorithm exploits the sparsity nature underlying the intrinsic high dimensional feature space. This sparsity prior of learning distance metric serves to regularize the complexity of the distance model especially in the "less example number p and high dimension d" setting. Theoretically, by analogy to the covariance estimation problem, we find the proposed distance learning algorithm has a consistent result at rate O (√m2 log d)/n) to the target distance matrix with at most m nonzeros per row. Moreover, from the implementation perspective, this l1-penalized log-determinant formulation can be efficiently optimized in a block coordinate descent fashion which is much faster than the standard semi-definite programming which has been widely adopted in many other advanced distance learning algorithms. We compare this algorithm with other state-of-the-art ones on various datasets and competitive results are obtained.

negative: H-DenseUNet: Hybrid Densely Connected UNet for Liver and Tumor Segmentation From CT Volumes Liver cancer is one of the leading causes of cancer death. To assist doctors in hepatocellular carcinoma diagnosis and treatment planning, an accurate and automatic liver and tumor segmentation method is highly demanded in the clinical practice. Recently, fully convolutional neural networks (FCNs), including 2-D and 3-D FCNs, serve as the backbone in many volumetric image segmentation. However, 2-D convolutions cannot fully leverage the spatial information along the third dimension while 3-D convolutions suffer from high computational cost and GPU memory consumption. To address these issues, we propose a novel hybrid densely connected UNet (H-DenseUNet), which consists of a 2-D DenseUNet for efficiently extracting intra-slice features and a 3-D counterpart for hierarchically aggregating volumetric contexts under the spirit of the auto-context algorithm for liver and tumor segmentation. We formulate the learning process of the H-DenseUNet in an end-to-end manner, where the intra-slice representations and inter-slice features can be jointly optimized through a hybrid feature fusion layer. We extensively evaluated our method on the data set of the MICCAI 2017 Liver Tumor Segmentation Challenge and 3DIRCADb data set. Our method outperformed other state-of-the-arts on the segmentation results of tumors and achieved very competitive performance for liver segmentation even with a single model.


query: A Biomedical Information Extraction Primer for NLP Researchers

positive: Bootstrapping Biomedical Ontologies for Scientific Text using NELL We describe an open information extraction system for biomedical text based on NELL (the NeverEnding Language Learner) [7], a system designed for extraction from Web text. NELL uses a coupled semi-supervised bootstrapping approach to learn new facts from text, given an initial ontology and a small number of “seeds” for each ontology category. In contrast to previous applications of NELL, in our task the initial ontology and seeds are automatically derived from existing resources. We show that NELL’s bootstrapping algorithm is susceptible to ambiguous seeds, which are frequent in the biomedical domain. Using NELL to extract facts from biomedical text quickly leads to semantic drift. To address this problem, we introduce a method for assessing seed quality, based on a larger corpus of data derived from the Web. In our method, seed quality is assessed at each iteration of the bootstrapping process. Experimental results show significant improvements over NELL’s original bootstrapping algorithm on two types of tasks: learning terms from biomedical categories, and named-entity recognition for biomedical entities using a learned lexicon.

positive: Exploring Recurrent Neural Networks to Detect Named Entities from Biomedical Text Biomedical named entity recognition (bio-NER) is a crucial and basic step in many biomedical information extraction tasks. However, traditional NER systems are mainly based on complex hand-designed features which are derived from various linguistic analyses and maybe only adapted to specified area. In this paper, we construct Recurrent Neural Network to identify entity names with word embeddings input rather than hand-designed features. Our contributions mainly include three aspects: 1) we adapt a deep learning architecture Recurrent Neural Network (RNN) to entity names recognition; 2) based on the original RNNs such as Elman-type and Jordan-type model, an improved RNN model is proposed; 3) considering that both past and future dependencies are important information, we combine bidirectional recurrent neural networks based on information entropy at the top layer. The experiments conducted on the BioCreative II GM data set demonstrate RNN models outperform CRF and deep neural networks (DNN), furthermore, the improved RNN model performs better than two original RNN models and the combined method is effective.

positive: Extracting Complex Biological Events with Rich Graph-Based Feature Sets We describe a system for extracting complex events among genes and proteins from biomedical literature, developed in context of the BioNLP’09 Shared Task on Event Extraction. For each event, its text trigger, class, and arguments are extracted. In contrast to the prevailing approaches in the domain, events can be arguments of other events, resulting in a nested structure that better captures the underlying biological statements. We divide the task into independent steps which we approach as machine learning problems. We define a wide array of features and in particular make extensive use of dependency parse graphs. A rule-based post-processing step is used to refine the output in accordance with the restrictions of the extraction task. In the shared task evaluation, the system achieved an F-score of 51.95% on the primary task, the best performance among the participants.

positive: Distant Supervision for Relation Extraction via Piecewise Convolutional Neural Networks Two problems arise when using distant supervision for relation extraction. First, in this method, an already existing knowledge base is heuristically aligned to texts, and the alignment results are treated as labeled data. However, the heuristic alignment can fail, resulting in wrong label problem. In addition, in previous approaches, statistical models have typically been applied to ad hoc features. The noise that originates from the feature extraction process can cause poor performance. In this paper, we propose a novel model dubbed the Piecewise Convolutional Neural Networks (PCNNs) with multi-instance learning to address these two problems. To solve the first problem, distant supervised relation extraction is treated as a multi-instance problem in which the uncertainty of instance labels is taken into account. To address the latter problem, we avoid feature engineering and instead adopt convolutional architecture with piecewise max pooling to automatically learn relevant features. Experiments show that our method is effective and outperforms several competitive baseline methods.

positive: Coarse-to-Fine n-Best Parsing and MaxEnt Discriminative Reranking Discriminative reranking is one method for constructing high-performance statistical parsers (Collins, 2000). A discriminative reranker requires a source of candidate parses for each sentence. This paper describes a simple yet novel method for constructing sets of 50-best parses based on a coarse-to-fine generative parser (Charniak, 2000). This method generates 50-best lists that are of substantially higher quality than previously obtainable. We used these parses as the input to a MaxEnt reranker (Johnson et al., 1999; Riezler et al., 2002) that selects the best parse from the set of parses for each sentence, obtaining an f-score of 91.0% on sentences of length 100 or less.

negative: Controlling electromagnetic fields. Using the freedom of design that metamaterials provide, we show how electromagnetic fields can be redirected at will and propose a design strategy. The conserved fields-electric displacement field D, magnetic induction field B, and Poynting vector B-are all displaced in a consistent manner. A simple illustration is given of the cloaking of a proscribed volume of space to exclude completely all electromagnetic fields. Our work has relevance to exotic lens design and to the cloaking of objects from electromagnetic fields.

negative: Memory reduction method for deep neural network training Training deep neural networks requires a large amount of memory, making very deep neural networks difficult to fit on accelerator memories. In order to overcome this limitation, we present a method to reduce the amount of memory for training a deep neural network. The method enables to suppress memory increase during the backward pass, by reusing the memory regions allocated for the forward pass. Experimental results exhibit our method reduced the occupied memory size in training by 44.7% on VGGNet with no accuracy affection. Our method also enabled training speedup by increasing the mini batch size up to double.

negative: Requirements of Quality of Service in Wireless Sensor Network Sensor networks are distributed networks made up of small sensing devices equipped with processors, memory, and short-range wireless communication. They differ from traditional computer networks in that they have resource constraints, unbalanced mixture traffic, data redundancy, network dynamics, and energy balance. Work within wireless sensor networks (WSNs) Quality of service (QoS) has been isolated and specific either on certain functional layers or application scenarios. However the area of sensor network quality of service (QoS) remains largely open. In this paper we define WSNs QoS requirements within a WSNs application, and then analyzing Issues for QoS Monitoring.

negative: The critical role of retrieval practice in long-term retention Learning is usually thought to occur during episodes of studying, whereas retrieval of information on testing simply serves to assess what was learned. We review research that contradicts this traditional view by demonstrating that retrieval practice is actually a powerful mnemonic enhancer, often producing large gains in long-term retention relative to repeated studying. Retrieval practice is often effective even without feedback (i.e. giving the correct answer), but feedback enhances the benefits of testing. In addition, retrieval practice promotes the acquisition of knowledge that can be flexibly retrieved and transferred to different contexts. The power of retrieval practice in consolidating memories has important implications for both the study of memory and its application to educational practice.

negative: An analysis of unreliability and asymmetry in low-power wireless links Experimental studies have demonstrated that the behavior of real links in low-power wireless networks (such as wireless sensor networks) deviates to a large extent from the ideal binary model used in several simulation studies. In particular, there is a large transitional region in wireless link quality that is characterized by significant levels of unreliability and asymmetry, significantly impacting the performance of higher-layer protocols. We provide a comprehensive analysis of the root causes of unreliability and asymmetry. In particular, we derive expressions for the distribution, expectation, and variance of the packet reception rate as a function of distance, as well as for the location and extent of the transitional region. These expressions incorporate important environmental and radio parameters such as the path loss exponent and shadowing variance of the channel, and the modulation, encoding, and hardware variance of the radios.

negative: An LED Driver With Pulse Current Driving Technique A novel driving technique, called pulse current driving technique for LED driver, is proposed. A complete introduction and analysis of the proposed driving technique and the conventional driving technique will be presented in this paper. The LED driver supply maximum peak current is 220 mA and operating frequency is between 500 kHz and1 MHz. Simulation and experimental results are presented to verify the analytical results. The LED driver is fabricated with CMOS 0.35-μm technology and chip area with pads is 0.89 mm 2. The design of the proposed circuit structure is simple, without additional output capacitance compensation for stability and with small power consumption, and is implemented in integrated circuit. As a result of the above benefits, the proposed approach is believed to be suitable in portable application.

negative: Flow Motifs in Soccer : What can passing behavior tell us ? In soccer, both individual and team performance is crucial to win matches. Passing is the backbone of the game and forms the basis of important decisions made by managers and owners; such as buying players, picking offensive or defensive strategies or even defining a style of play. These decisions can be supported by analyzing how a player performs and how his style affects team performance. The flow of a player or a team can be studied by finding unique passing motifs from the patterns in the subgraphs of a possession-passing network of soccer games. These flow motifs can be used to analyze individual players and teams based on the diversity and frequency of their involvement in different motifs. Building on the flow motif analyses, we introduce an expected goals model to measure the effectiveness of each style of play. We also make use of a novel way to represent motif data that is easy to understand and can be used to compare players, teams and seasons. Further, we exploit the relationship between play style and the pass probability matrix to support our analysis. Our data set has the last 4 seasons of 6 big European leagues with 8219 matches, 3532 unique players and 155 unique teams. We will use flow motifs to analyze different events, such as for example the transfer of Claudio Bravo to Pep Guardiola’s Manchester City, who Jean Seri is and why he must be an elite midfielder and the difference in attacking style between Lionel Messi and Cristiano Ronaldo. Ultimately, an analysis of Post-Fàbregas Arsenal is conducted wherein different techniques are combined to analyze the impact the acquisition of Mesut Özil and Alexis Sánchez had on the strategies implemented at Arsenal.

negative: An Alternative to NCD for Large Sequences, Lempel-Ziv Jaccard Distance The Normalized Compression Distance (NCD) has been used in a number of domains to compare objects with varying feature types. This flexibility comes from the use of general purpose compression algorithms as the means of computing distances between byte sequences. Such flexibility makes NCD particularly attractive for cases where the right features to use are not obvious, such as malware classification. However, NCD can be computationally demanding, thereby restricting the scale at which it can be applied. We introduce an alternative metric also inspired by compression, the Lempel-Ziv Jaccard Distance (LZJD). We show that this new distance has desirable theoretical properties, as well as comparable or superior performance for malware classification, while being easy to implement and orders of magnitude faster in practice.

negative: Number 693 December 2000 ON THE EFFECT OF THE INTERNET ON INTERNATIONAL TRADE The Internet stimulates trade. Using a gravity equation of trade among 56 countries, we find no evidence of an effect of the Internet on total trade flows in 1995 and only weak evidence of an effect in 1996. However, we find an increasing and significant impact from 1997 to 1999. Specifically, our results imply that a 10 percent increase in the relative number of web hosts in one country would have led to about 1 percent greater trade in 1998 and 1999. Surprisingly, we find that the effect of the Internet on trade has been stronger for poor countries than for rich countries, and that there is little evidence that the Internet has reduced the impact of distance on trade. The evidence is consistent with a model in which the Internet creates a global exchange for goods, thereby reducing market-specific sunk costs of exporting.

negative: Detecting Faulty Nodes with Data Errors for Wireless Sensor Networks Wireless Sensor Networks (WSN) promise researchers a powerful instrument for observing sizable phenomena with fine granularity over long periods. Since the accuracy of data is important to the whole system's performance, detecting nodes with faulty readings is an essential issue in network management. As a complementary solution to detecting nodes with functional faults, this article, proposes FIND, a novel method to detect nodes with data faults that neither assumes a particular sensing model nor requires costly event injections. After the nodes in a network detect a natural event, FIND ranks the nodes based on their sensing readings as well as their physical distances from the event. FIND works for systems where the measured signal attenuates with distance. A node is considered faulty if there is a significant mismatch between the sensor data rank and the distance rank. Theoretically, we show that average ranking difference is a provable indicator of possible data faults. FIND is extensively evaluated in simulations and two test bed experiments with up to 25 MicaZ nodes. Evaluation shows that FIND has a less than 5% miss detection rate and false alarm rate in most noisy environments.

negative: Impact of IEEE 802.11n/ac PHY/MAC High Throughput Enhancements over Transport/Application Layer Protocols - A Survey Since the inception of Wireless Local Area Networks (WLANs) in the year 1997, it has tremendously grown in the last few years. IEEE 802.11 is popularly known as WLAN. To provide the last mile wireless broadband connectivity to users, IEEE 802.11 is enriched with IEEE 802.11a, IEEE 802.11b and IEEE 802.11g. More recently, IEEE 802.11n, IEEE 802.11ac and IEEE 802.11ad are introduced with enhancements to the physical (PHY) layer and medium access control (MAC) sublayer to provide much higher data rates and thus these amendments are called High Throughput WLANs (HT-WLANs). In IEEE 802.11n, the data rate has increased up to 600 Mbps, whereas IEEE 802.11ac/ad is expected to support a maximum throughput of 1 to 7 Gbps over wireless media. For both standards, PHY is enhanced with multiple-input multiple-output (MIMO) antenna technologies, channel bonding, short guard intervals (SGI), enhanced modulation and coding schemes (MCS). At the same time, MAC layer overhead is reduced by introducing frame aggregation and block acknowledgement technologies. However, existing studies reveal that although PHY and MAC enhancements promise to improve physical data rate significantly, they yield negative impact over upper layer protocols – mainly for reliable end-to-end transport/application layer protocols. As a consequence, a large number of schools have focused researches on HT-WLANs to improve the coordination among PHY/MAC and upper layer protocols and thus, boost up the performance benefit. In this survey, we discuss the impact of enhancements of PHY/MAC layer in HT-WLANs over transport/application layer protocols. Several measures have been reported in the literature that boost up data rate of WLANs and use aforesaid enhancements effectively for performance benefit of end-to-end protocols. We also point out limitations of existing researches and list down different open challenges that can be explored for the development of next generation HT-WLAN technologies. Keywords-IEEE 802.11n, IEEE 802.11ac, MIMO, MU-MIMO, Channel bonding, Short-guard interval (SGI), Frame aggregation, Block Acknowledgement, TCP/UDP Throughput.

negative: A Lower-Back Robotic Exoskeleton: Industrial Handling Augmentation Used to Provide Spinal Support A lower-back exoskeleton prototype designed to provide back support for industrial workers who manually handle heavy materials is presented in this article. Reducing spinal loads during these tasks can reduce the risk of work-related back injuries. Biomechanical studies show that compression of the lumbar spine is a key risk factor for musculoskeletal injuries. To address this issue, we present a wearable exoskeleton designed to provide back support and reduce lumbar spine compression. To provide effective assistance and avoid injury to muscles or tendons, we apply a continuous torque of approximately 40 Nm on both hip joints to actively assist both hip abduction/adduction (HAA) and hip flexion/extension (HFE). Each actuation unit includes a modular and a compact series-elastic actuator (SEA) with a clutch. The SEA provides mechanical compliance at the interface between the exoskeleton and the user, and the clutches can automatically disengage the torque between the exoskeleton and the user. These experimental results show that the exoskeleton can lower lumbar compression by reducing the need for muscular activity in the spine. Furthermore, powering both HFE and HAA can effectively reduce the lumbar spinal loading user experience when lifting and lowering objects while in a twisted posture.

negative: News-based trading strategies The marvel of markets lies in the fact that dispersed information is instantaneously processed and used to adjust the price of goods, services and assets. Financial markets are particularly efficient when it comes to processing information; such information is typically embedded in textual news that is then interpreted by investors. Quite recently, researchers have started to automatically determine news sentiment in order to explain stock price movements. Interestingly, this so-called news sentiment works fairly well in explaining stock returns. In this paper, we design trading strategies that utilize textual news in order to obtain profits on the basis of novel information entering the market. We thus propose approaches for automated decisionmaking based on supervised and reinforcement learning. Altogether, we demonstrate how news-based data can be incorporated into an investment system.

negative: A Passive Gait-Based Weight-Support Lower Extremity Exoskeleton With Compliant Joints This paper presents the design and analysis of a passive body weight (BW)-support lower extremity exoskeleton (LEE) with compliant joints to relieve compressive load in the knee. The biojoint-like mechanical knee decouples human gait into two phases, stance and swing, by a dual snap fit. The knee joint transfers the BW to the ground in the stance phases and is compliant to free the leg in the swing phases. Along with a leg dynamic model and a knee biomechanical model, the unmeasurable knee internal forces are simulated. The concept feasibility and dynamic models of the passive LEE design have been experimentally validated with measured plantar forces. The reduced knee forces confirm the effectiveness of the LEE in supporting human BW during walking and also provide a basis for computing the internal knee forces as a percentage of BW. Energy harvested from the hip spring reveals that the LEE can save human walking energy.

negative: Lnc2Cancer: a manually curated database of experimentally supported lncRNAs associated with various human cancers Lnc2Cancer (http://www.bio-bigdata.net/lnc2cancer) is a manually curated database of cancer-associated long non-coding RNAs (lncRNAs) with experimental support that aims to provide a high-quality and integrated resource for exploring lncRNA deregulation in various human cancers. LncRNAs represent a large category of functional RNA molecules that play a significant role in human cancers. A curated collection and summary of deregulated lncRNAs in cancer is essential to thoroughly understand the mechanisms and functions of lncRNAs. Here, we developed the Lnc2Cancer database, which contains 1057 manually curated associations between 531 lncRNAs and 86 human cancers. Each association includes lncRNA and cancer name, the lncRNA expression pattern, experimental techniques, a brief functional description, the original reference and additional annotation information. Lnc2Cancer provides a user-friendly interface to conveniently browse, retrieve and download data. Lnc2Cancer also offers a submission page for researchers to submit newly validated lncRNA-cancer associations. With the rapidly increasing interest in lncRNAs, Lnc2Cancer will significantly improve our understanding of lncRNA deregulation in cancer and has the potential to be a timely and valuable resource.

negative: AN AUTOMATIC SYSTEM FOR DETECTING AND COUNTING RBC AND WBC USING FUZZY LOGIC Blood cell detection and counting is the initial process for detecting and diagnosing diseases. Several image processing algorithms are there for the blood cell classification and counting. The processed image helps to detect different blood related diseases. In all those algorithms several pre-processing steps are there for the process of detection and counting. Though all the algorithms give accurate results, the pre-processing steps are complex and time-consuming. This paper discusses about the RBC and WBC detection using fuzzy logic. Fuzzy logic toolbox software in MATLAB is used to develop the model on virtual platform.

negative: Scalable Gaussian Process Regression Using Deep Neural Networks We propose a scalable Gaussian process model for regression by applying a deep neural network as the feature-mapping function. We first pre-train the deep neural network with a stacked denoising auto-encoder in an unsupervised way. Then, we perform a Bayesian linear regression on the top layer of the pre-trained deep network. The resulting model, Deep-Neural-Network-based Gaussian Process (DNN-GP), can learn much more meaningful representation of the data by the finite-dimensional but deep-layered feature-mapping function. Unlike standard Gaussian processes, our model scales well with the size of the training set due to the avoidance of kernel matrix inversion. Moreover, we present a mixture of DNN-GPs to further improve the regression performance. For the experiments on three representative large datasets, our proposed models significantly outperform the state-of-the-art algorithms of Gaussian process regression.

negative: Bridging Neural Machine Translation and Bilingual Dictionaries Neural Machine Translation (NMT) has become the new state-of-the-art in several language pairs. However, it remains a challenging problem how to integrate NMT with a bilingual dictionary which mainly contains words rarely or never seen in the bilingual training data. In this paper, we propose two methods to bridge NMT and the bilingual dictionaries. The core idea behind is to design novel models that transform the bilingual dictionaries into adequate sentence pairs, so that NMT can distil latent bilingual mappings from the ample and repetitive phenomena. One method leverages a mixed word/character model and the other attempts at synthesizing parallel sentences guaranteeing massive occurrence of the translation lexicon. Extensive experiments demonstrate that the proposed methods can remarkably improve the translation quality, and most of the rare words in the test sentences can obtain correct translations if they are covered by the dictionary.

negative: Modeling and controller design for a voice coil actuated engine valve This paper presents a physical model of a spark ignition (SI) engine valve actuated by a voice coil actuator (VCA) and proposes a novel control strategy that achieves fast transitions and low seating velocities with high precision position control. The control strategy is based on applying two different pulse width modulated (PWM) voltages for transient and steady state performance. This novel switching control strategy performs better than current strategies using electromechanical valve actuators to implement variable valve timing (VVT). The main improvement over electromechanical actuators is the fact that the novel control strategy achieves the conflicting performance requirements of very fast transition times while simultaneously exhibiting low contact velocities

negative: Extension of heuristic evaluation method: a review and reappraisal As one of the major discount methods, the heuristic evaluation method (HE) is the most commonly used usability inspection method. We introduced the history and procedure of this method, as well as its strengths and weaknesses. We then reviewed the applications of this method to different Human-Computer Interaction systems with the adapted heuristic sets. We also reviewed many studies that extended the traditional HE method in different ways. Finally, the paper ends with a reappraisal of these extension methods and future research direction to improve the HE method.

negative: On-line Active Reward Learning for Policy Optimisation in Spoken Dialogue Systems The ability to compute an accurate reward function is essential for optimising a dialogue policy via reinforcement learning. In real-world applications, using explicit user feedback as the reward signal is often unreliable and costly to collect. This problem can be mitigated if the user’s intent is known in advance or data is available to pre-train a task success predictor off-line. In practice neither of these apply for most real world applications. Here we propose an on-line learning framework whereby the dialogue policy is jointly trained alongside the reward model via active learning with a Gaussian process model. This Gaussian process operates on a continuous space dialogue representation generated in an unsupervised fashion using a recurrent neural network encoder-decoder. The experimental results demonstrate that the proposed framework is able to significantly reduce data annotation costs and mitigate noisy user feedback in dialogue policy learning.

negative: The Analysis of the Disease Spectrum in China Analysis of the related risks of disease provides a scientific basis for disease prevention and treatment, hospital management, and policy formulation by the changes in disease spectrum of patients in hospital. Retrospective analysis was made to the first diagnosis, age, gender, daily average cost of hospitalized patients, and other factors in the First Affiliated Hospital of Nanjing Medical University during 2006-2013. The top 4 cases were as follows: cardiovascular disease, malignant tumors, lung infections, and noninsulin dependent diabetes mellitus. By the age of disease analysis, we found a younger age trend of cardiovascular disease, and the age of onset of cancer or diabetes was somewhat postponed. The average daily cost of hospitalization and the average daily cost of the main noncommunicable diseases were both on the rise. Noncommunicable diseases occupy an increasingly important position in the constitution of the disease, and they caused an increasing medical burden. People should pay attention to health from the aspects of lifestyle changing. Hospitals should focus on building the appropriate discipline. On the other hand, an integrated government response is required to tackle key risks. Multiple interventions are needed to lower the burden of these diseases and to improve national health.

negative: Mechanics and energetics of level walking with powered ankle exoskeletons. Robotic lower limb exoskeletons that can alter joint mechanical power output are novel tools for studying the relationship between the mechanics and energetics of human locomotion. We built pneumatically powered ankle exoskeletons controlled by the user's own soleus electromyography (i.e. proportional myoelectric control) to determine whether mechanical assistance at the ankle joint could reduce the metabolic cost of level, steady-speed human walking. We hypothesized that subjects would reduce their net metabolic power in proportion to the average positive mechanical power delivered by the bilateral ankle exoskeletons. Nine healthy individuals completed three 30 min sessions walking at 1.25 m s(-1) while wearing the exoskeletons. Over the three sessions, subjects' net metabolic energy expenditure during powered walking progressed from +7% to -10% of that during unpowered walking. With practice, subjects significantly reduced soleus muscle activity (by approximately 28% root mean square EMG, P<0.0001) and negative exoskeleton mechanical power (-0.09 W kg(-1) at the beginning of session 1 and -0.03 W kg(-1) at the end of session 3; P=0.005). Ankle joint kinematics returned to similar patterns to those observed during unpowered walking. At the end of the third session, the powered exoskeletons delivered approximately 63% of the average ankle joint positive mechanical power and approximately 22% of the total positive mechanical power generated by all of the joints summed (ankle, knee and hip) during unpowered walking. Decreases in total joint positive mechanical power due to powered ankle assistance ( approximately 22%) were not proportional to reductions in net metabolic power ( approximately 10%). The ;apparent efficiency' of the ankle joint muscle-tendon system during human walking ( approximately 0.61) was much greater than reported values of the ;muscular efficiency' of positive mechanical work for human muscle ( approximately 0.10-0.34). High ankle joint ;apparent efficiency' suggests that recoiling Achilles' tendon contributes a significant amount of ankle joint positive power during the push-off phase of walking in humans.

negative: Comparison among three analytical methods for knowledge communities group-decision analysis Knowledge management can greatly facilitate an organization’s learning via strategic insight. Assessing the achievements of knowledge communities (KC) includes both a theoretical basis and practical aspect; however, a cautionary word is in order, because using improper measurements will increase complexity and reduce applicability. Group decision-making, the essence of knowledge communities, lets one considers multi-dimensional problems for the decision-maker, sets priorities for each decision factor, and assesses rankings for all alternatives. The purpose of this study is to establish the objective and measurable patterns to obtain anticipated achievements of KC through conducting a group-decision comparison. The three multiple-criteria decision-making methods we used, simple average weight (SAW), ‘‘Technique for Order Preference by Similarity to an Ideal Solution’’ (TOPSIS) and ‘‘VlseKriterijumska Optimizacija I Kompromisno Resenje’’ (VIKOR), are based on an aggregating function representing ‘‘closeness to the ideal point’’. The TOPSIS and VIKOR methods were used to highlight our innovative idea, academic analysis, and practical appliance value. Simple average weight (SAW) is known to be a common method to get the preliminary outcome. Our study provides a comparison analysis of the above-three methods. An empirical case is illustrated to demonstrate the overall KC achievements, showing their similarities and differences to achieve group decisions. Our results showed that TOPSIS and simple average weight (SAW) had identical rankings overall, but TOPSIS had better distinguishing capability. TOPSIS and VIKOR had almost the same success setting priorities by weight. However, VIKOR produced different rankings than those from TOPSIS and SAW, and VIKOR also made it easy to choose appropriate strategies. Both the TOPSIS and VIKOR methods are suitable for assessing similar problems, provide excellent results close to reality, and grant superior analysis. 2006 Elsevier Ltd. All rights reserved.

negative: E-commerce customer churn prediction based on improved SMOTE and AdaBoost E-commerce customer churn rate is high and the customer churn dataset is seriously imbalanced. In order to improve the prediction accuracy of churn customers as well as strengthen to identify non-churn customers, this paper presents e-commerce customer churn prediction model based on improved SMOTE and AdaBoost. First, processing the churn data with improved SMOTE, which combines oversampling and undersampling methods to address the imbalance problem and subsequently integrates AdaBoost algorithm to predict. Finally, the empirical study on B2C E-commerce platform proves that this model has better efficiency and accuracy compared with the mature customer churn prediction algorithms.

negative: Semantic MEDLINE: An advanced information management application for biomedicine Semantic MEDLINE integrates information retrieval, advanced natural language processing, automatic summarization, and visualization into a single Web portal. The application is intended to help manage the results of PubMed searches by condensing core semantic content in the citations retrieved. Output is presented as a connected graph of semantic relations, with links to the original MEDLINE citations. The ability to connect salient information across documents helps users keep up with the research literature and discover connections which might otherwise go unnoticed. Semantic MEDLINE can make an impact on biomedicine by supporting scientific discovery and the timely translation of insights from basic research into advances in clinical practice and patient care. Marcelo Fiszman has an M.D. from the State University of Rio de Janeiro and a Ph.D. in biomedical informatics from the University of Utah. He was awarded a postdoctoral fellowship in biomedical informatics at the National Library of Medicine (NLM) and is currently a research scientist there. His work focuses on natural language processing algorithms that exploit symbolic, rule-based techniques for semantic interpretation of biomedical text. He is also interested in using extracted semantic information for automatic abstraction summarization and literaturebased discovery. These efforts underpin Semantic MEDLINE, which is currently under development at NLM. This innovative biomedical information management application combines document retrieval, semantic interpretation, automatic summarization, and knowledge visualization into a single application.

negative: SystemT: a system for declarative information extraction As applications within and outside the enterprise encounter increasing volumes of unstructured data, there has been renewed interest in the area of information extraction (IE) -- the discipline concerned with extracting structured information from unstructured text. Classical IE techniques developed by the NLP community were based on cascading grammars and regular expressions. However, due to the inherent limitations of grammarbased extraction, these techniques are unable to: (i) scale to large data sets, and (ii) support the expressivity requirements of complex information tasks. At the IBM Almaden Research Center, we are developing SystemT, an IE system that addresses these limitations by adopting an algebraic approach. By leveraging well-understood database concepts such as declarative queries and costbased optimization, SystemT enables scalable execution of complex information extraction tasks. In this paper, we motivate the SystemT approach to information extraction. We describe our extraction algebra and demonstrate the effectiveness of our optimization techniques in providing orders of magnitude reduction in the running time of complex extraction tasks.

negative: Understanding PubMed® user search behavior through log analysis This article reports on a detailed investigation of PubMed users' needs and behavior as a step toward improving biomedical information retrieval. PubMed is providing free service to researchers with access to more than 19 million citations for biomedical articles from MEDLINE and life science journals. It is accessed by millions of users each day. Efficient search tools are crucial for biomedical researchers to keep abreast of the biomedical literature relating to their own research. This study provides insight into PubMed users' needs and their behavior. This investigation was conducted through the analysis of one month of log data, consisting of more than 23 million user sessions and more than 58 million user queries. Multiple aspects of users' interactions with PubMed are characterized in detail with evidence from these logs. Despite having many features in common with general Web searches, biomedical information searches have unique characteristics that are made evident in this study. PubMed users are more persistent in seeking information and they reformulate queries often. The three most frequent types of search are search by author name, search by gene/protein, and search by disease. Use of abbreviation in queries is very frequent. Factors such as result set size influence users' decisions. Analysis of characteristics such as these plays a critical role in identifying users' information needs and their search habits. In turn, such an analysis also provides useful insight for improving biomedical information retrieval.Database URL:http://www.ncbi.nlm.nih.gov/PubMed.

negative: Jointly Embedding Entities and Text with Distant Supervision Learning representations for knowledge base entities and concepts is becoming increasingly important for NLP applications. However, recent entity embedding methods have relied on structured resources that are expensive to create for new domains and corpora. We present a distantly-supervised method for jointly learning embeddings of entities and text from an unnanotated corpus, using only a list of mappings between entities and surface forms. We learn embeddings from open-domain and biomedical corpora, and compare against prior methods that rely on human-annotated text or large knowledge graph structure. Our embeddings capture entity similarity and relatedness better than prior work, both in existing biomedical datasets and a new Wikipedia-based dataset that we release to the community. Results on analogy completion and entity sense disambiguation indicate that entities and words capture complementary information that can be effectively combined for downstream use.

negative: Domain Specific Sentence Level Mood Extraction from Malayalam Text Natural Language Processing (NLP) is a field which studies the interactions between computers and natural languages. NLP is used to enable computers to attain the capability of manipulating natural languages with a level of expertise equivalent to humans. There exists a wide range of applications for NLP, of which sentiment analysis(SA) plays a major role. In sentimental analysis, the emotional polarity of a given text is analysed, and classified as positive, negative or neutral. A more difficult task is to refine the classification into different moods such as happy, sad, angry etc. Analysing a natural language for mood extraction is not at all an easy task for a computer. Even after achieving capabilities of massive amount of computation within a matter of seconds, understanding the sentiments embodied in phrases and sentences of textual information remains one of the toughest tasks for a computer till date. This paper focuses on tagging the appropriate mood in Malayalam text. Tagging is used to specify whether a sentence indicates a sad, happy or angry mood of the person involved or if the sentence contains just facts, devoid of emotions. This research work is heavily dependent on the language since the structures vary from language to language. Mood extraction and tagging has been successfully implemented for English and other European languages. For the south Indian language Malayalam, no significant work has yet been done on mood extraction. We will be focusing on domain-specific sentence-level mood extraction from Malayalam text. The extraction process involves parts-of-speech tagging of the input sentence, extracting the patterns from the input sentence which will contribute to the mood of the sentence, such as the adjective, adverb etc., and finally scoring the sentence on an emotive scale by calculating the semantic orientation of the sentence using the extracted patterns. Sentiment classification is becoming a promising topic with the rise of social media such as blogs, social networking sites, where people express their views on various topics. Mood extraction enables computers to automate the activities performed by human for making decisions based on the moods of opinions expressed in Malayalam text.

negative: Telomere measurement by quantitative PCR. It has long been presumed impossible to measure telomeres in vertebrate DNA by PCR amplification with oligonucleotide primers designed to hybridize to the TTAGGG and CCCTAA repeats, because only primer dimer-derived products are expected. Here we present a primer pair that eliminates this problem, allowing simple and rapid measurement of telomeres in a closed tube, fluorescence-based assay. This assay will facilitate investigations of the biology of telomeres and the roles they play in the molecular pathophysiology of diseases and aging.

negative: A Survey and Analysis of Various Health-Related Knowledge Mining Techniques in Social Media Smart extraction of knowledge from social media has received the recent interest of the Biomedical and Health Informatics community for the simultaneous improvement of healthcare outcomes and lessen the expenses making use of consumergenerated reviews. Social media provides chances for patients and doctors to share their views and experiences without any obtrusion through online communities that might generate information, which is much beyond what is known by the domain experts. Nonetheless, for conventional public health surveillance systems, it is difficult to detect and then monitor the concerns related to health and the changes seen in attitudes of the public towards health-related problems. To solve this problem, several studies have shown the usage of information in social media for the discovery of biomedical and healthrelated information. Several disease-specific knowledge exchanges are now available on Face book and other portals of online social networking. These kind of new sources of information, support, and engagement have gone to become significant for patients who are suffering with the disease, and still the quality and the content of the knowledge contributed in these digital areas are not properly comprehended. The existing research methodologies are discussed with their merits and demerits, so that the further research works can be concentrated more. The experimental tests conducted were on all the research works in mat lab simulation environment and it is compared against each other to find the better approach under various performance measures such as Accuracy, Precision and Recall.