query: Survey on modeling and indexing events in multimedia

positive: Evaluating Color Descriptors for Object and Scene Recognition Image category recognition is important to access visual information on the level of objects and scene types. So far, intensity-based descriptors have been widely used for feature extraction at salient points. To increase illumination invariance and discriminative power, color descriptors have been proposed. Because many different descriptors exist, a structured overview is required of color invariant descriptors in the context of image category recognition. Therefore, this paper studies the invariance properties and the distinctiveness of color descriptors (software to compute the color descriptors from this paper is available from http://www.colordescriptors.com) in a structured way. The analytical invariance properties of color descriptors are explored, using a taxonomy based on invariance properties with respect to photometric transformations, and tested experimentally using a data set with known illumination conditions. In addition, the distinctiveness of color descriptors is assessed experimentally using two benchmarks, one from the image domain and one from the video domain. From the theoretical and experimental results, it can be derived that invariance to light intensity changes and light color changes affects category recognition. The results further reveal that, for light intensity shifts, the usefulness of invariance is category-specific. Overall, when choosing a single descriptor and no prior knowledge about the data set and object and scene categories is available, the OpponentSIFT is recommended. Furthermore, a combined set of color descriptors outperforms intensity-based SIFT and improves category recognition by 8 percent on the PASCAL VOC 2007 and by 7 percent on the Mediamill Challenge.

positive: Automatic annotation of human actions in video This paper addresses the problem of automatic temporal annotation of realistic human actions in video using minimal manual supervision. To this end we consider two associated problems: (a) weakly-supervised learning of action models from readily available annotations, and (b) temporal localization of human actions in test videos. To avoid the prohibitive cost of manual annotation for training, we use movie scripts as a means of weak supervision. Scripts, however, provide only implicit, noisy, and imprecise information about the type and location of actions in video. We address this problem with a kernel-based discriminative clustering algorithm that locates actions in the weakly-labeled training data. Using the obtained action samples, we train temporal action detectors and apply them to locate actions in the raw video data. Our experiments demonstrate that the proposed method for weakly-supervised learning of action models leads to significant improvement in action detection. We present detection results for three action classes in four feature length movies with challenging and realistic video data.

positive: Semi-supervised hashing for scalable image retrieval Large scale image search has recently attracted considerable attention due to easy availability of huge amounts of data. Several hashing methods have been proposed to allow approximate but highly efficient search. Unsupervised hashing methods show good performance with metric distances but, in image search, semantic similarity is usually given in terms of labeled pairs of images. There exist supervised hashing methods that can handle such semantic similarity but they are prone to overfitting when labeled data is small or noisy. Moreover, these methods are usually very slow to train. In this work, we propose a semi-supervised hashing method that is formulated as minimizing empirical error on the labeled data while maximizing variance and independence of hash bits over the labeled and unlabeled data. The proposed method can handle both metric as well as semantic similarity. The experimental results on two large datasets (up to one million samples) demonstrate its superior performance over state-of-the-art supervised and unsupervised methods.

positive: Investigating Causal Relations by Econometric Models and Cross-spectral Methods Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at http://www.jstor.org/journals/econosoc.html. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

positive: Semantic analysis of soccer video using dynamic Bayesian network Video semantic analysis is formulated based on the low-level image features and the high-level knowledge which is encoded in abstract, nongeometric representations. This paper introduces a semantic analysis system based on Bayesian network (BN) and dynamic Bayesian network (DBN). It is validated in the particular domain of soccer game videos. Based on BN/DBN, it can identify the special events in soccer games such as goal event, corner kick event, penalty kick event, and card event. The video analyzer extracts the low-level evidences, whereas the semantic analyzer uses BN/DBN to interpret the high-level semantics. Different from previous shot-based semantic analysis approaches, the proposed semantic analysis is frame-based for each input frame, it provides the current semantics of the event nodes as well as the hidden nodes. Another contribution is that the BN and DBN are automatically generated by the training process instead of determined by ad hoc. The last contribution is that we introduce a so-called temporal intervening network to improve the accuracy of the semantics output

negative: A Flexible Model-Driven Game Development Approach Game developers are facing an increasing demand for new games every year. Game development tools can be of great help, but require highly specialized professionals. Also, just as any software development effort, game development has some challenges. Model-Driven Game Development (MDGD) is suggested as a means to solve some of these challenges, but with a loss in flexibility. We propose a MDGD approach that combines multiple domain-specific languages (DSLs) with design patterns to provide flexibility and allow generated code to be integrated with manual code. After experimentation, we observed that, with the approach, less experienced developers can create games faster and more easily, and the product of code generation can be customized with manually written code, providing flexibility. However, with MDGD, developers become less familiar with the code, making manual codification more difficult.

negative: Matchmaking in multi-player on-line games: studying user traces to improve the user experience Designing and implementing a quality matchmaking service for Multiplayer Online Games requires an extensive knowledge of the habits, behaviors and expectations of the players. Gathering and analyzing traces of real games offers insight on these matters, but game server providers are very protective of such data in order to deter possible reuse by the competition and to prevent cheating. We circumvented this issue by gathering public data from a League of Legends server (information over more than 28 million game sessions). In this paper, we present our database which is freely available online, and we detail the analysis and conclusions we draw from this data regarding the expected requirements for the matchmaking service.

negative: Knowledge sharing in organisational contexts: a motivation-based perspective Purpose – Facilitating knowledge sharing within organisations is a difficult task: the willingness of individuals to share and integrate their knowledge is one of the central barriers. This paper aims to develop a motivation-based perspective to explore how organisations resolve the social dilemma of knowledge sharing. Design/methodology/approach – The analysis builds on a three-category taxonomy of motivation, adding ‘‘hedonic’’ motivation to the traditional dichotomy of ‘‘extrinsic’’ and ‘‘intrinsic’’ motivation. It uses case studies gleaned from the literature to explore the interactive effects between the different motivators in two different types of knowledge-intensive organisations: professional bureaucracy and operating adhocracy. Findings – Within a professional bureaucracy, the social dilemma of knowledge sharing may be overcome through normative motivation, with provision of hedonic motivation through extrinsic incentives such as training and career progression. In an operating adhocracy where interdependent teamwork is vital, it may be overcome through normative alignment reinforced by intensive socialisation. Extrinsic motivators that align with hedonic motivation may also reinforce the propensity for knowledge sharing. In both organisational types, financial extrinsic incentives do not appear to be relevant on their own, and may ‘‘crowd out’’ other motivators. Research limitations/implications – The cases reported were chosen from the existing literature and, although many were not designed specifically to address motivational issues, suggestive conclusions are drawn. Most of the cases were drawn from organisations rooted in the Anglo-American context and thus care would be needed in generalising the findings to organisations in other contexts. Originality/value – The paper represents the first attempt to apply a three-category taxonomy of motivation to examine knowledge-sharing behaviour in organisations. It highlights the interaction between the different motivators and provides a basis to integrate further the work of social psychologists and socio-economists on incentives and motivation in the context of knowledge sharing.

negative: A versatile FMCW Radar System Simulator for Millimeter-Wave Applications For the successful design of low-cost and high-performance radar systems accurate and efficient system simulation is a key requirement. In this paper we present a new versatile simulation environment for frequency-modulated continuous-wave radar systems. Besides common hardware simulation it covers integrated system simulation and concept analysis from signal synthesis to baseband. It includes a flexible scenario generator, accurate noise modeling, and efficiently delivers simulation data for development and testing of signal processing algorithms. A comparison of simulations and measurement results for an integrated 77-GHz radar prototype shows the capabilities of the simulator on two different scenarios.

negative: Automatic multilabel classification for Indonesian news articles Problem transformation and algorithm adaptation are the two main approaches in machine learning to solve multilabel classification problem. The purpose of this paper is to investigate both approaches in multilabel classification for Indonesian news articles. Since this classification deals with a large number of features, we also employ some feature selection methods to reduce feature dimension. There are four factors as the focuses of this paper, i.e., feature weighting method, feature selection method, multilabel classification approach, and single-label classification algorithm. These factors will be combined to determine the best combination. The experiments show that the best performer for multilabel classification of Indonesian news articles is the combination of TF-IDF feature weighting method, Symmetrical Uncertainty feature selection method, Calibrated Label Ranking - which belongs to problem transformation approach -, and SVM algorithm. This best combination achieves F-measure of 85.13% in 10-fold cross-validation, but the F-measure decreases to 76.73% in testing because of OOV.

negative: Topic Models for Mortality Modeling in Intensive Care Units Mortality prediction is an important problem in the intensive care unit (ICU) because it is helpful for understanding patients’ evolving severity, quality of care, and comparing treatments. Most ICU mortality models primarily consider structured data and physiological waveforms (Le Gall et al., 1993). An important limitation of these structured data approaches is that they miss a lot of vital information captured in providers’ free text notes and reports. In this paper, we propose an approach to mortality prediction that incorporates the information from free text notes using topic modeling.

negative: A non-isolated three-port converter for stand-alone renewable power system A novel non-isolated three-port converter (NI-TPC) is proposed interfacing one PV port, one bidirectional battery port and one load port. Single stage power conversion between any two of the three ports is achieved. The topology is derived by decoupling the bidirectional power flow path of the conventional structure into two unidirectional ones. Two of the three ports can be tightly regulated to achieve maximum power harvesting for PV or charge control for battery, and maintain the load voltage constant at the same time, while the third port is left flexible to compensate the power imbalance of the converter. Operation states are analyzed. The multi-regulator competition control strategy is presented to achieve autonomous and smooth state switching when the PV input power fluctuates. The analysis is verified by the experimental results.

negative: A Framework for Coordinated Surface Operations Planning at Dallas-Fort Worth International Airport An Integer Programming formulation is developed for optimizing surface operations at Dallas-Fort Worth airport, with the goal of assessing the potential benefits of taxi route planning. The model is based on operations in the eastern half of the airport under the most frequently used configuration. The focus is on operational concepts that optimize taxi routes by utilizing different control points on the airport surface. The benefits of two different concepts for optimizing taxiway operations, namely controlled pushback and taxi reroutes are analyzed, for both current data and a projected data set with approximately twice the traffic density. The analysis estimates that: (1) for current traffic densities, controlled pushback would reduce the average departure taxi time by 17% without altering runway schedule conformance, while the benefits of taxi reroutes would be minimal; and (2) for high-density operations, controlled pushback would reduce the average departure taxi time by 18%, while incorporating taxi reroutes would reduce the average arrival taxi time by 14%. Other benefits analyzed for these control strategies include a decrease in the average time spent in runway crossing queues.

negative: Unsupervised Learning of Sequence Representations by Autoencoders Sequence data is challenging for machine learning approaches, because the lengths of the sequences may vary between samples. In this paper, we present an unsupervised learning model for sequence data, called the Integrated Sequence Autoencoder (ISA), to learn a fixed-length vectorial representation by minimizing the reconstruction error. Specifically, we propose to integrate two classical mechanisms for sequence reconstruction which takes into account both the global silhouette information and the local temporal dependencies. Furthermore, we propose a stop feature that serves as a temporal stamp to guide the reconstruction process, which results in a higher-quality representation. The learned representation is able to effectively summarize not only the apparent features, but also the underlying and high-level style information. Take for example a speech sequence sample: our ISA model can not only recognize the spoken text (apparent feature), but can also discriminate the speaker who utters the audio (more high-level style). One promising application of the ISA model is that it can be readily used in the semi-supervised learning scenario, in which a large amount of unlabeled data is leveraged to extract high-quality sequence representations and thus to improve the performance of the subsequent supervised learning tasks on limited labeled data.

negative: A practical path loss model for indoor WiFi positioning enhancement Positioning within a local area refers to technology whereby each node is self-aware of its position. Based on empirical study, this paper proposes an enhancement to the path loss model in the indoor environment for improved accuracy in the relationship between distance and received signal strength. We further demonstrate the potential of our model for the WiFi positioning system, where the mean errors in the distance estimation are 2.3 m and 2.9 m for line of sight and non line of sight environments, respectively.

negative: xLED: Covert Data Exfiltration from Air-Gapped Networks via Router LEDs In this paper we show how attackers can covertly leak data (e.g., encryption keys, passwords and files) from highly secure or air-gapped networks via the row of status LEDs that exists in networking equipment such as LAN switches and routers. Although it is known that some network equipment emanates optical signals correlated with the information being processed by the device ('side-channel'), intentionally controlling the status LEDs to carry any type of data ('covert-channel') has never studied before. A malicious code is executed on the LAN switch or router, allowing full control of the status LEDs. Sensitive data can be encoded and modulated over the blinking of the LEDs. The generated signals can then be recorded by various types of remote cameras and optical sensors. We provide the technical background on the internal architecture of switches and routers (at both the hardware and software level) which enables this type of attack. We also present amplitude and frequency based modulation and encoding schemas, along with a simple transmission protocol. We implement a prototype of an exfiltration malware and discuss its design and implementation. We evaluate this method with a few routers and different types of LEDs. In addition, we tested various receivers including remote cameras, security cameras, smartphone cameras, and optical sensors, and also discuss different detection and prevention countermeasures. Our experiment shows that sensitive data can be covertly leaked via the status LEDs of switches and routers at a bit rates of 10 bit/sec to more than 1Kbit/sec per LED. Keywords— ezfiltration; air-gap; network; optical; covertchannel (key words)

negative: Steganalysis of QIM Steganography in Low-Bit-Rate Speech Signals Steganalysis of the quantization index modulation QIM steganography in a low-bit-rate encoded speech stream is conducted in this research. According to the speech generation theory and the phoneme distribution properties in language, we first point out that the correlation characteristics of split vector quantization VQ codewords of linear predictive coding filter coefficients are changed after the QIM steganography. Based on this observation, we construct a model called the Quantization codeword correlation network QCCN based on split VQ codeword from adjacent speech frames. Furthermore, the QCCN model is pruned to yield a stronger correlation network. After quantifying the correlation characteristics of vertices in the pruned correlation network, we obtain feature vectors that are sensitive to steganalysis. Finally, we build a high-performance detector using the support vector machine SVM classifier. It is shown by experimental results that the proposed QCCN steganalysis method can effectively detect the QIM steganography in encoded speech stream when it is applied to low-bit-rate speech codec such as G.723.1 and G.729.

negative: Relation Extraction : A Survey With the advent of the Internet, large amount of digital text is generated everyday in the form of news articles, research publications, blogs, question answering forums and social media. It is important to develop techniques for extracting information automatically from these documents, as lot of important information is hidden within them. This extracted information can be used to improve access and management of knowledge hidden in large text corpora. Several applications such as Question Answering, Information Retrieval would benefit from this information. Entities like persons and organizations, form the most basic unit of the information. Occurrences of entities in a sentence are often linked through well-defined relations; e.g., occurrences of person and organization in a sentence may be linked through relations such as employed at. The task of Relation Extraction (RE) is to identify such relations automatically. In this paper, we survey several important supervised, semi-supervised and unsupervised RE techniques. We also cover the paradigms of Open Information Extraction (OIE) and Distant Supervision. Finally, we describe some of the recent trends in the RE techniques and possible future research directions. This survey would be useful for three kinds of readers i) Newcomers in the field who want to quickly learn about RE; ii) Researchers who want to know how the various RE techniques evolved over time and what are possible future research directions and iii) Practitioners who just need to know which RE technique works best in various settings.

negative: The Treatment of Missing Values and its Effect on Classifier Accuracy The presence of missing values in a dataset can affect the performance of a classifier constructed using that dataset as a training sample. Several methods have been proposed to treat missing data and the one used most frequently deletes instances containing at least one missing value of a feature. In this paper we carry out experiments with twelve datasets to evaluate the effect on the misclassification error rate of four methods for dealing with missing values: the case deletion method, mean imputation, median imputation, and the KNN imputation procedure. The classifiers considered were the Linear Discriminant Analysis (LDA) and the KNN classifier. The first one is a parametric classifier whereas the second one is a non parametric classifier.

negative: Designing Media Architecture: Tools and Approaches for Addressing the Main Design Challenges Media Architecture is reaching a level of maturity at which we can identify tools and approaches for addressing the main challenges for HCI practitioners working in this field. While previous influential contributions within Media Architecture have identified challenges for designers and offered case studies of specific approaches, here, we (1) provide guidance on how to tackle the domain-specific challenges of Media Architecture design -- pertaining to the interface, integration, content, context, process, prototyping, and evaluation -- on the basis of the development of numerous installations over the course of seven years, and thorough studies of related work, and (2) present five categories of tools and approaches -- software tools, projection, 3D models, hardware prototyping, and evaluation tools -- developed to address these challenges in practice, exemplified through six concrete examples from real-life cases.

negative: More is Less: On the End-to-End Security of Group Chats in Signal, WhatsApp, and Threema Secure instant messaging is utilized in two variants: one-to-one communication and group communication. While the first variant has received much attention lately (Frosch et al., EuroS Cohn-Gordon et al., EuroS Kobeissi et al., EuroS&P17), little is known about the cryptographic mechanisms and security guarantees of secure group communication in instant messaging. To approach an investigation of group instant messaging protocols, we first provide a comprehensive and realistic security model. This model combines security and reliability goals from various related literature to capture relevant properties for communication in dynamic groups. Thereby the definitions consider their satisfiability with respect to the instant delivery of messages. To show its applicability, we analyze three widely used real-world protocols: Signal, WhatsApp, and Threema. By applying our model, we reveal several shortcomings with respect to the security definition. Therefore we propose generic countermeasures to enhance the protocols regarding the required security and reliability goals. Our systematic analysis reveals that (1) the communications' integrity – represented by the integrity of all exchanged messages – and (2) the groups' closeness – represented by the members' ability of managing the group – are not end-to-end protected. We additionally show that strong security properties, such as Future Secrecy which is a core part of the one-to-one communication in the Signal protocol, do not hold for its group communication.

negative: Existential meaning's role in the enhancement of hope and prevention of depressive symptoms. The authors confirmed that existential meaning has a unique relationship with and can prospectively predict levels of hope and depressive symptoms within a population of college students. Baseline measures of explicit meaning (i.e., an individual's self-reported experience of a sense of coherence and purpose in life) and implicit meaning (i.e., an individual's self-reported embodiment of the factors that are normatively viewed as comprising a meaningful life) explained significant amounts of variance in hope and depressive symptoms 2 months later beyond the variance explained by baseline levels of hope/depression, neuroticism, conscientiousness, agreeableness, openness to experience, extraversion, and social desirability. The authors discuss implications of these findings for the field of mental health treatment and suggest ways of influencing individuals' experience of existential meaning.

negative: Why software fails [software failure] Most IT experts agree that software failures occur far more often than they should despite the fact that, for the most part, they are predictable and avoidable. It is unfortunate that most organizations don't see preventing failure as an urgent matter, even though that view risks harming the organization and maybe even destroying it. Because software failure has tremendous implications for business and society, it is important to understand why this attitude persists.

negative: Transfer learning for class imbalance problems with inadequate data A fundamental problem in data mining is to effectively build robust classifiers in the presence of skewed data distributions. Class imbalance classifiers are trained specifically for skewed distribution datasets. Existing methods assume an ample supply of training examples as a fundamental prerequisite for constructing an effective classifier. However, when sufficient data are not readily available, the development of a representative classification algorithm becomes even more difficult due to the unequal distribution between classes. We provide a unified framework that will potentially take advantage of auxiliary data using a transfer learning mechanism and simultaneously build a robust classifier to tackle this imbalance issue in the presence of few training samples in a particular target domain of interest. Transfer learning methods use auxiliary data to augment learning when training examples are not sufficient and in this paper we will develop a method that is optimized to simultaneously augment the training data and induce balance into skewed datasets. We propose a novel boosting-based instance transfer classifier with a label-dependent update mechanism that simultaneously compensates for class imbalance and incorporates samples from an auxiliary domain to improve classification. We provide theoretical and empirical validation of our method and apply to healthcare and text classification applications.

negative: Player Type Models: Towards Empirical Validation Player type models -- such as the BrainHex model -- are popular approaches for personalizing digital games towards individual preferences of players. Although several player type models have been developed and are currently used in game design projects, there is still a lack of data on their validity. To close this research gap we currently investigate the psychometric properties (factor structure, reliability, stability) and predictive validity (if player type scores can predict player experience) of the player type model BrainHex in an ongoing project. Results of two online studies (n1=592, n2=243) show that the psychometric properties of the BrainHex model could be improved. We suggest to improve the according questionnaire and sketch how the predictive validity could be investigated in future studies.

negative: Scalable Metadata Management Techniques for Ultra-Large Distributed Storage Systems - A Systematic Review The provisioning of an efficient ultra-large scalable distributed storage system for expanding cloud applications has been a challenging job for researchers in academia and industry. In such an ultra-large-scale storage system, data are distributed on multiple storage nodes for performance, scalability, and availability. The access to this distributed data is through its metadata, maintained by multiple metadata servers. The metadata carries information about the physical address of data and access privileges. The efficiency of a storage system highly depends on effective metadata management. This research presents an extensive systematic literature analysis of metadata management techniques in storage systems. This research work will help researchers to find the significance of metadata management and important parameters of metadata management techniques for storage systems. Methodical examination of metadata management techniques developed by various industry and research groups is described. The different metadata distribution techniques lead to various taxonomies. Furthermore, the article investigates techniques based on distribution structures and key parameters of metadata management. It also presents strengths and weaknesses of individual existing techniques that will help researchers to select the most appropriate technique for specific applications. Finally, it discusses existing challenges and significant research directions in metadata management for researchers.

negative: An Integral Model to Provide Reactive and Proactive Services in an Academic CSIRT Based on Business Intelligence Cyber-attacks have increased in severity and complexity. That requires, that the CERT/CSIRT research and develops new security tools. Therefore, our study focuses on the design of an integral model based on Business Intelligence (BI), which provides reactive and proactive services in a CSIRT, in order to alert and reduce any suspicious or malicious activity on information systems and data networks. To achieve this purpose, a solution has been assembled, that generates information stores, being compiled from a continuous network transmission of several internal and external sources of an organization. However, it contemplates a data warehouse, which is focused like a correlator of logs, being formed by the information of feeds with diverse formats. Furthermore, it analyzed attack detection and port scanning, obtained from sensors such as Snort and Passive Vulnerability Scanner, which are stored in a database, where the logs have been generated by the systems. With such inputs, we designed and implemented BI systems using the phases of the Ralph Kimball methodology, ETL and OLAP processes. In addition, a software application has been implemented using the SCRUM methodology, which allowed to link the obtained logs to the BI system for visualization in dynamic dashboards, with the purpose of generating early alerts and constructing complex queries using the user interface through objects structures. The results demonstrate, that this solution has generated early warnings based on the level of criticality and level of sensitivity of malware and vulnerabilities as well as monitoring efficiency, increasing the level of security of member institutions.

negative: Extensive Analysis and Prediction of Optimal Inventory levels in supply chain management based on Particle Swarm Optimization Algorithm Efficient inventory management is a complex process which entails the management of the inventory in the whole supply chain. The dynamic nature of the excess stock level and shortage level from one period to another is a serious issue. In addition, consideration of multiple products and more supply chain members leads to very complex inventory management process. Moreover, the supply chain cost increases because of the influence of lead times for supplying the stocks as well as the raw materials. A better optimization methodology would consider all these factors in the prediction of the optimal stock levels to be maintained in order to minimize the total supply chain cost. Here, we are proposing an optimization methodology that utilizes the Particle Swarm Optimization algorithm, one of the best optimization algorithms, to overcome the impasse in maintaining the optimal stock levels at each member of the supply chain.

negative: CIO and Business Executive Leadership Approaches to Establishing Company-wide Information Orientation In the digital world, business executives have a heightened awareness of the strategic importance of information and information management to their companies’ value creation. This presents both leadership opportunities and challenges for CIOs. To prevent the CIO position from being marginalized and to enhance CIOs’ contribution to business value creation, they must move beyond being competent IT utility managers and play an active role in helping their companies build a strong information usage culture. The purpose of this article is to provide a better understanding of the leadership approaches that CIOs and business executives can adopt to improve their companies’ information orientation. Based on our findings from four case studies, we have created a four-quadrant leadership-positioning framework. This framework is constructed from the CIO’s perspective and indicates that a CIO may act as a leader, a follower or a nonplayer in developing the company’s information orientation to achieve its strategic focus. The article concludes with guidelines that CIOs can use to help position their leadership challenges in introducing or sustaining their companies’ information orientation initiatives and recommends specific leadership approaches depending on CIOs’ particular situations.

negative: Applying Machine Learning Techniques to Analysis of Gene Expression Data: Cancer Diagnosis Classification of patient samples is a crucial aspect of cancer diagnosis. DNA hybridization arrays simultaneously measure the expression levels of thousands of genes and it has been suggested that gene expression may provide the additional information needed to improve cancer classification and diagnosis. This paper presents methods for analyzing gene expression data to classify cancer types. Machine learning techniques, such as Bayesian networks, neural trees, and radial basis function (RBF) networks, are used for the analysis of CAMDA Data Set 2. These techniques have their own properties including the ability of finding important genes for cancer classification, revealing relationships among genes, and classifying cancer. This paper reports on comparative evaluation of the experimental results of these methods.

negative: Social network security: Issues, challenges, threats, and solutions Social networks are very popular in today‘s world. Millions of people use various forms of social networks as they allow individuals to connect with friends and family, and share private information. However, issues related to maintaining the privacy and security of a user‘s information can occur, especially when the user‘s uploaded content is multimedia, such as photos, videos, and audios. Uploaded multimedia content carries information that can be transmitted virally and almost instantaneously within a social networking site and beyond. In this paper, we present a comprehensive survey of different security and privacy threats that target every user of social networking sites. In addition, we separately focus on various threats that arise due to the sharing of multimedia content within a social networking site. We also discuss current state-ofthe-art defense solutions that can protect social network users from these threats. We then present future direction and discuss some easy-to-apply response techniques to achieve the goal of a trustworthy and secure social network ecosystem. KeywordsSocial network service, Security and privacy, Multimedia data, Security threats

negative: Semantics in Visual Information Retrieval V isual information retrieval systems have entered a new era. First-generation systems allowed access to images and videos through textual data. 1,2 Typical searches for these systems include, for example, " all images of paintings of the Florentine school of the 15th century " or " all images by Cezanne with landscapes. " Such systems expressed information through alphanumeric keywords or scripts. They employed representation schemes like relational models, frame models, and object-oriented models. On the other hand, current-generation retrieval systems support full retrieval by visual content. 3,4 Access to visual information is not only performed at a conceptual level, using keywords as in the textu-al domain, but also at a perceptual level, using objective measurements of visual content. In these systems, image processing, pattern recognition , and computer vision constitute an integral part of the system's architecture and operation. They objectively analyze pixel distribution and extract the content descriptors automatically from raw sensory data. Image content descriptors are commonly represented as feature vectors, whose elements correspond to significant parameters that model image attributes. Therefore, visual attributes are regarded as points in a multidimen-sional feature space, where point closeness reflects feature similarity. These advances (for comprehensive reviews of the field, see the " Further Reading " sidebar) have paved the way for third-generation systems, featuring full multimedia data management and networking support. Forthcoming standards such as MPEG-4 and MPEG-7 (see the Nack and Lindsay article in this issue) provide the framework for efficient representation, processing, and retrieval of visual information. Yet many problems must still be addressed and solved before these technologies can emerge. An important issue is the design of indexing structures for efficient retrieval from large, possibly distributed , multimedia data repositories. To achieve this goal, image and video content descriptors can be internally organized and accessed through multidimensional index structures. 5 A second key problem is to bridge the semantic gap between the system and users. That is, devise representations capturing visual content at high semantic levels especially relevant for retrieval tasks. Specifically, automatically obtaining a representation of high-level visual content remains an open issue. Virtually all the systems based on automatic storage and retrieval of visual information proposed so far use low-level perceptual representations of pictorial data, which have limited semantics. Building up a representation proves tantamount to defining a model of the world, possibly through a formal description language, whose semantics capture only a few …

negative: ESTIMATION METHODS FOR STOCHASTIC VOLATILITY MODELS : A SURVEY Although stochastic volatility (SV) models have an intuitive appeal, their empirical application has been limited mainly due to difficulties involved in their estimation. The main problem is that the likelihood function is hard to evaluate. However, recently, several new estimation methods have been intro duced and the literature on SV models has grown substantially. In this article, we review this literature. We describe the main estimators of the parameters and the underlying volatilities focusing on their advantages and limitations both from the theoretical and empirical point of view. We complete the survey with an application of the most important procedures to the S&P 500 stock price index.

negative: A survey of wireless sensor technologies applied to precision agriculture This paper gives a state-of-art of wireless sensor network (WSN) technologies and solutions applied to precision agriculture (PA). The paper first considers applications and existing experiences that show how WSN technologies have been introduced in to agricultural applications. Then, a survey in hardware and software solutions is related with special emphasis on technological aspects. Finally, the paper shows how five networking and technological solutions may impact the next generation of sensors. These are (i) scalar wireless sensor networks, (ii) wireless multimedia sensor networks, (iii) Mobility of nodes, (iv) tag-based systems, and (v) smart-phone applications.

negative: School Leadership and Cyberbullying—A Multilevel Analysis Cyberbullying is a relatively new form of bullying, with both similarities and differences to traditional bullying. While earlier research has examined associations between school-contextual characteristics and traditional bullying, fewer studies have focused on the links to students' involvement in cyberbullying behavior. The aim of the present study is to assess whether school-contextual conditions in terms of teachers' ratings of the school leadership are associated with the occurrence of cyberbullying victimization and perpetration among students. The data are derived from two separate data collections performed in 2016: The Stockholm School Survey conducted among students in the second grade of upper secondary school (ages 17-18 years) in Stockholm municipality, and the Stockholm Teacher Survey which was carried out among teachers in the same schools. The data include information from 6067 students distributed across 58 schools, linked with school-contextual information based on reports from 1251 teachers. Cyberbullying victimization and perpetration are measured by students' self-reports. Teachers' ratings of the school leadership are captured by an index based on 10 items; the mean value of this index was aggregated to the school level. Results from binary logistic multilevel regression models show that high teacher ratings of the school leadership are associated with less cyberbullying victimization and perpetration. We conclude that a strong school leadership potentially prevents cyberbullying behavior among students.

negative:
Application of ordinal logistic regression analysis in determining risk factors of child malnutrition in Bangladesh BACKGROUND
The study attempts to develop an ordinal logistic regression (OLR) model to identify the determinants of child malnutrition instead of developing traditional binary logistic regression (BLR) model using the data of Bangladesh Demographic and Health Survey 2004.

METHODS
Based on weight-for-age anthropometric index (Z-score) child nutrition status is categorized into three groups-severely undernourished (< -3.0), moderately undernourished (-3.0 to -2.01) and nourished (≥-2.0). Since nutrition status is ordinal, an OLR model-proportional odds model (POM) can be developed instead of two separate BLR models to find predictors of both malnutrition and severe malnutrition if the proportional odds assumption satisfies. The assumption is satisfied with low p-value (0.144) due to violation of the assumption for one co-variate. So partial proportional odds model (PPOM) and two BLR models have also been developed to check the applicability of the OLR model. Graphical test has also been adopted for checking the proportional odds assumption.

RESULTS
All the models determine that age of child, birth interval, mothers' education, maternal nutrition, household wealth status, child feeding index, and incidence of fever, ARI & diarrhoea were the significant predictors of child malnutrition; however, results of PPOM were more precise than those of other models.

CONCLUSION
These findings clearly justify that OLR models (POM and PPOM) are appropriate to find predictors of malnutrition instead of BLR models.

negative: iPhone 3 GS Forensics : Logical analysis using Apple iTunes Backup Utility The iPhone mobile is used worldwide due to its enhanced computing capabilities, increased storage capacity as well as its attractive touch interface. These characteristics made the iPhone a popular smart phone device. The increased use of the iPhone lead it to become a potential source of digital evidence in criminal investigations. Therefore, iPhone forensics turned into an essential practice for forensic and security practitioners today. This research aimed at investigating and examining the logical backup acquisition of the iPhone 3GS mobile device using the Apple iTunes backup utility. It was found that significant data of forensic value such as e-mail messages, text and multimedia messages, calendar events, browsing history, GPRS locations, contacts, call history and voicemail recording can be retrieved using this method of iPhone acquisition.


query: Supervised distance metric learning through maximization of the Jeffrey divergence

positive: Nearest neighbor pattern classification The case of n unity-variance random variables x1, XZ,. * *, x, governed by the joint probability density w(xl, xz, * * * x,) is considered, where the density depends on the (normalized) cross-covariances pii = E[(xi jzi)(xi li)]. It is shown that the condition holds for an “arbitrary” function f(xl, x2, * * * , x,) of n variables if and only if the underlying density w(xl, XZ, * * * , x,) is the usual n-dimensional Gaussian density for correlated random variables. This result establishes a generalized form of Price’s theorem in which: 1) the relevant condition (*) subsumes Price’s original condition; 2) the proof is accomplished without appeal to Laplace integral expansions; and 3) conditions referring to derivatives with respect to diagonal terms pii are avoided, so that the unity variance assumption can be retained. Manuscript received February 10, 1966; revised May 2, 1966. The author is with the Ordnance Research Laboratory, Pennsylvania State University, State College, Pa. RICE’S THEOREM and its various extensions ([l]-[4]) have had great utility in the determination of output correlations between zero-memory nonlinearities subjected to jointly Gaussian inputs. In its original form, the theorem considered n jointly normal random variables, x1, x2, . . . x,, with respective means 21, LE2, . . . ) Z, and nth-order joint probability density, P(z 1, .x2, . 1 . , :r,,) = (27p ply,, y . exp { -a F F ;;;, ~ (2,. 2,)(:r, 5,) I , (1) where IM,l is the determinant’ of J1,, = [p,,], Pr-. = E[(sr 5$.)(x, ,2J] = xvx, &IL:, is the correlation coefficient of x, and x,, and Ail,, is the cofactor of p.? in ilf,. From [l], the theorem statement is as follows: “Let there be n zero-memory nonlinear devices specified by the input-output relationship f<(x), i = 1, 2, . 1 . , n. Let each xi be the single input to a corresponding fi(x) Authorized licensed use limited to: West Virginia University. Downloaded on February 26, 2009 at 13:41 from IEEE Xplore. Restrictions apply.

positive: Least squares quantization in PCM It has long been realized that in pulse-code modulation (PCM), with a given ensemble of signals to handle, the quantum values should be spaced more closely in the voltage regions where the signal amplitude is more likely to fall. It has been shown by Panter and Dite that, in the limit as the number of quanta becomes infinite, the asymptotic fractional density of quanta per unit voltage should vary as the one-third power of the probability density per unit voltage of signal amplitudes. In this paper the corresponding result for any finite number of quanta is derived; that is, necessary conditions are found that the quanta and associated quantization intervals of an optimum finite quantization scheme must satisfy. The optimization criterion used is that the average quantization noise power be a minimum. It is shown that the result obtained here goes over into the Panter and Dite result as the number of quanta become large. The optimum quantization schemes for 26 quanta, b = 1,2, t ,7, are given numerically for Gaussian and for Laplacian distribution of signal amplitudes.

positive: 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.

positive: Robust Face Recognition via Sparse Representation We consider the problem of automatically recognizing human faces from frontal views with varying expression and illumination, as well as occlusion and disguise. We cast the recognition problem as one of classifying among multiple linear regression models and argue that new theory from sparse signal representation offers the key to addressing this problem. Based on a sparse representation computed by C1-minimization, we propose a general classification algorithm for (image-based) object recognition. This new framework provides new insights into two crucial issues in face recognition: feature extraction and robustness to occlusion. For feature extraction, we show that if sparsity in the recognition problem is properly harnessed, the choice of features is no longer critical. What is critical, however, is whether the number of features is sufficiently large and whether the sparse representation is correctly computed. Unconventional features such as downsampled images and random projections perform just as well as conventional features such as eigenfaces and Laplacianfaces, as long as the dimension of the feature space surpasses certain threshold, predicted by the theory of sparse representation. This framework can handle errors due to occlusion and corruption uniformly by exploiting the fact that these errors are often sparse with respect to the standard (pixel) basis. The theory of sparse representation helps predict how much occlusion the recognition algorithm can handle and how to choose the training images to maximize robustness to occlusion. We conduct extensive experiments on publicly available databases to verify the efficacy of the proposed algorithm and corroborate the above claims.

positive: High-dimensional covariance estimation by minimizing $\ell_1$-penalized log-determinant divergence Given i.i.d. observations of a random vector X ∈ R, we study the problem of estimating both its covariance matrix Σ, and its inverse covariance or concentration matrix Θ = (Σ). When X is multivariate Gaussian, the non-zero structure of Θ is specified by the graph of an associated Gaussian Markov random field; and a popular estimator for such sparse Θ is the l1-regularized Gaussian MLE. This estimator is sensible even for for non-Gaussian X, since it corresponds to minimizing an l1-penalized log-determinant Bregman divergence. We analyze its performance under high-dimensional scaling, in which the number of nodes in the graph p, the number of edges s, and the maximum node degree d, are allowed to grow as a function of the sample size n. In addition to the parameters (p, s, d), our analysis identifies other key quantities that control rates: (a) the l∞-operator norm of the true covariance matrix Σ; and (b) the l∞ operator norm of the sub-matrix Γ∗SS , where S indexes the graph edges, and Γ∗ = (Θ) ⊗ (Θ); and (c) a mutual incoherence or irrepresentability measure on the matrix Γ∗ and (d) the rate of decay 1/f(n, δ) on the probabilities {|Σ̂ij − Σ∗ij | > δ}, where Σ̂ is the sample covariance based on n samples. Our first result establishes consistency of our estimate Θ̂ in the elementwise maximum-norm. This in turn allows us to derive convergence rates in Frobenius and spectral norms, with improvements upon existing results for graphs with maximum node degrees d = o( √ s). In our second result, we show that with probability converging to one, the estimate Θ̂ correctly specifies the zero pattern of the concentration matrix Θ∗. We illustrate our theoretical results via simulations for various graphs and problem parameters, showing good correspondences between the theoretical predictions and behavior in simulations. AMS 2000 subject classifications: Primary 62F12; secondary 62F30.

negative: A novel wavelet transform technique for on-line partial discharge measurements. 1. WT de-noising algorithm Medium and high voltage power cables are widely used in the electrical industry with substantial growth over the last 20-30 years ago, particular in the use of XLPE insulated systems. Ageing of the cable insulation is becoming an increasing problem that requires development of reliable methods for on-line condition assessment. For insulation condition assessment of MV and HV cables, partial discharge (PD) monitoring is one of the most effective techniques. However on-site and on-line PD measurements are affected by electromagnetic interference (EMI) that makes sensitive PD detection very difficult, if not impossible. This paper describes implementation of wavelet transform techniques to reject noise from on-line partial discharge measurements on cables. A new wavelet threshold determination method is proposed with the technique. With implementation of this novel de-noising method, PD measurement sensitivity has been greatly improved. In addition, a full AC cycle data recovery can be achieved instead of focusing only on recovering individual PD pulses. Other wavelet threshold de-noising methods are discussed and examined under a noisy environment to compare their performance with the new method proposed here. The method described here has been found to be superior to the other wavelet-based methods

negative: Malware detection using adaptive data compression A popular approach in current commercial anti-malware software detects malicious programs by searching in the code of programs for scan strings that are byte sequences indicative of malicious code. The scan strings, also known as the signatures of existing malware, are extracted by malware analysts from known malware samples, and stored in a database often referred to as a virus dictionary. This process often involves a significant amount of human efforts. In addition, there are two major limitations in this technique. First, not all malicious programs have bit patterns that are evidence of their malicious nature. Therefore, some malware is not recorded in the virus dictionary and can not be detected through signature matching. Second, searching for specific bit patterns will not work on malware that can take many forms--obfuscated malware. Signature matching has been shown to be incapable of identifying new malware patterns and fails to recognize obfuscated malware. This paper presents a malware detection technique that discovers malware by means of a learning engine trained on a set of malware instances and a set of benign code instances. The learning engine uses an adaptive data compression model--prediction by partial matching (PPM)--to build two compression models, one from the malware instances and the other from the benign code instances. A code instance is classified, either as "malware" or "benign", by minimizing its estimated cross entropy. Our preliminary results are very promising. We achieved about 0.94 true positive rate with as low as 0.016 false positive rate. Our experiments also demonstrate that this technique can effectively detect unknown and obfuscated malware.

negative: An updated survey of GA-based multiobjective optimization techniques After using evolutionary techniques for single-objective optimization during more than two decades, the incorporation of more than one objective in the fitness function has finally become a popular area of research. As a consequence, many new evolutionary-based approaches and variations of existing techniques have recently been published in the technical literature. The purpose of this paper is to summarize and organize the information on these current approaches, emphasizing the importance of analyzing the operations research techniques in which most of them are based, in an attempt to motivate researchers to look into these mathematical programming approaches for new ways of exploiting the search capabilities of evolutionary algorithms. Furthermore, a summary of the main algorithms behind these approaches is provided, together with a brief criticism that includes their advantages and disadvantages, degree of applicability, and some known applications. Finally, further trends in this area and some possible paths for further research are also addressed.

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: Pattern classification of foot strike type using body worn accelerometers The automatic classification of foot strike patterns into the three basic categories forefoot, midfoot and rearfoot striking plays an important role for applications like shoe fitting with instant feedback. This paper presents methods for this classification based on body worn accelerometers that allow giving the required direct feedback to the user. For our study, we collected data from 40 runners who had a standard accelerometer in a custom-built sensor pod attached to the laces of their running shoes. The acceleration in three axes was recorded continuously while the runners conducted their runs. Data for repeated runs at two different speed levels were collected in order to have sufficient sensor data for classification. The data was analyzed using features computed for individual steps of the runners to distinguish the three foot strike pattern classes. The labels for the strike pattern classes were established using high-speed video that was concurrently collected. We could show that the classification of the strike types based on the measured accelerations and the extracted features was up to 95.3% accurate. The established classification system can be used to support runners, for example by giving running shoe recommendations that ideally match the prevailing strike type of the runner.

negative: SUPPRESSION OF GATE INDUCED DRAIN LEAKAGE CURRENT ( GIDL ) BY GATE WORKFUNCTION ENGINEERING : ANALYSIS AND MODEL Leakage current reduction is of primary importance as the technology scaling trends continue towards deep sub-micrometer regime. One of the leakage mechanisms which contribute significantly to power dissipation is the Gate Induced Drain Leakage (GIDL). GIDL sets an upper limit on the VLSI MOSFET scaling and may even lead to device breakdown. Thus, in order to improve performance, static power consumption becomes a major concern in such miniaturized devices. With the CMOS technology in the nanometer regime, metal gates emerge as a powerful booster over the poly-Si gates, keeping the leakage mechanisms in control. This work presents a systematic study of the Gate Induced Drain Leakage current reduction by changing the gate workfunction. In this work, an attempt has been made to model the metal gates in the field equations in the gate-drain overlap region. The modeling has been accomplished by taking the physical property of the metals into account i.e. the workfunction. The analytical model has been used to study the impact of gate workfunction engineering on GIDL. The model includes the calculation of band bending, the resultant electric field in the gate-drain overlap region and the GIDL current. It has been observed that the electric field and the GIDL current decreases as the gate workfunction is increased continuously from 4.0~5.2 eV. Further, the results are more interesting at low applied voltages where the decrease in the current is of about 6 orders of magnitude as compared to that at higher voltages.

negative: On the Interpolation of Data with Normally Distributed Uncertainty for Visualization In many fields of science or engineering, we are confronted with uncertain data. For that reason, the visualization of uncertainty received a lot of attention, especially in recent years. In the majority of cases, Gaussian distributions are used to describe uncertain behavior, because they are able to model many phenomena encountered in science. Therefore, in most applications uncertain data is (or is assumed to be) Gaussian distributed. If such uncertain data is given on fixed positions, the question of interpolation arises for many visualization approaches. In this paper, we analyze the effects of the usual linear interpolation schemes for visualization of Gaussian distributed data. In addition, we demonstrate that methods known in geostatistics and machine learning have favorable properties for visualization purposes in this case.

negative: Two-factor authentication for the Bitcoin protocol We show how to realize two-factor authentication for a Bitcoin wallet. To do so, we explain how to employ an ECDSA adaption of the two-party signature protocol by MacKenzie and Reiter (Int J Inf Secur 2(3–4):218–239, 2004. doi: 10.1007/s10207-004-0041-0 ) in the context of Bitcoin and present a prototypic implementation of a Bitcoin wallet that offers both: two-factor authentication and verification over a separate channel. Since we use a smart phone as the second authentication factor, our solution can be used with hardware already available to most users and the user experience is quite similar to the existing online banking authentication methods.

negative: Jointly Detecting and Separating Singing Voice: A Multi-Task Approach A main challenge in applying deep learning to music processing is the availability of training data. One potential solution is Multi-task Learning, in which the model also learns to solve related auxiliary tasks on additional datasets to exploit their correlation. While intuitive in principle, it can be challenging to identify related tasks and construct the model to optimally share information between tasks. In this paper, we explore vocal activity detection as an additional task to stabilise and improve the performance of vocal separation. Further, we identify problematic biases specific to each dataset that could limit the generalisation capability of separation and detection models, to which our proposed approach is robust. Experiments show improved performance in separation as well as vocal detection compared to single-task baselines. However, we find that the commonly used Signal-to-Distortion Ratio (SDR) metrics did not capture the improvement on non-vocal sections, indicating the need for improved evaluation methodologies.

negative: Authenticity and Subjective Wellbeing within the Context of a Religious Organization Although authenticity has a long history as a philosophical and psychological idea, this concept has received scarce attention in the business literature until very lately. Nevertheless, scholars belonging to a broad array of disciplines have pointed out the escalation in the individuals' search for authenticity within developed societies. Hence, the purpose of this paper is to assess the link between authenticity and subjective wellbeing within the rarely explored context of faith-driven organizations, where the management of emotions attains a particular significance. Specifically, this study links authenticity with subjective wellbeing among the distinct groups that shape a large international Catholic organization. This study uses Partial Least Squares (PLS) to test our research model and hypotheses. This paper covers two noteworthy research gaps. On the one hand, it provides evidence of the relationship between authenticity and subjective wellbeing within the context of religious organizations. On the other hand, our results suggest that this relationship is not homogeneous among the distinct groups that shape the organization. Implications of the research are finally discussed.

negative: Data-Driven Feature Characterization Techniques for Laser Printer Attribution Laser printer attribution is an increasing problem with several applications, such as pointing out the ownership of crime proofs and authentication of printed documents. However, as commonly proposed methods for this task are based on custom-tailored features, they are limited by modeling assumptions about printing artifacts. In this paper, we explore solutions able to learn discriminant-printing patterns directly from the available data during an investigation, without any further feature engineering, proposing the first approach based on deep learning to laser printer attribution. This allows us to avoid any prior assumption about printing artifacts that characterize each printer, thus highlighting almost invisible and difficult printer footprints generated during the printing process. The proposed approach merges, in a synergistic fashion, convolutional neural networks (CNNs) applied on multiple representations of multiple data. Multiple representations, generated through different pre-processing operations, enable the use of the small and lightweight CNNs whilst the use of multiple data enable the use of aggregation procedures to better determine the provenance of a document. Experimental results show that the proposed method is robust to noisy data and outperforms existing counterparts in the literature for this problem.

negative: A Low-delay Protocol for Multihop Wireless Body Area Networks Wireless body area networks (WBANs) form a new and interesting area in the world of remote health monitoring. An important concern in such networks is the communication between the sensors. This communication needs to be energy efficient and highly reliable while keeping delays low. Mobility also has to be supported as the nodes are positioned on different parts of the body that move with regard to each other. In this paper, we present a new cross-layer communication protocol for WBANs: CICADA or Cascading Information retrieval by Controlling Access with Distributed slot Assignment. The protocol sets up a network tree in a distributed manner. This tree structure is subsequently used to guarantee collision free access to the medium and to route data towards the sink. The paper analyzes CICADA and shows simulation results. The protocol offers low delay and good resilience to mobility. The energy usage is low as the nodes can sleep in slots where they are not transmitting or receiving.

negative: The Role of Smart Meters in Enabling Real-Time Energy Services for Households : The Italian Case The Smart Meter (SM) is an essential tool for successful balancing the demand-offer energy curve. It allows the linking of the consumption and production measurements with the time information and the customer’s identity, enabling the substitution of flat-price billing with smarter solutions, such as Time-of-Use or Real-Time Pricing. In addition to sending data to the energy operators for billing and monitoring purposes, Smart Meters must be able to send the same data to customer devices in near-real-time conditions, enabling new services such as instant energy awareness and home automation. In this article, we review the ongoing situation in Europe regarding real-time services for the final customers. Then, we review the architectural and technological options that have been considered for the roll-out phase of the Italian second generation of Smart Meters. Finally, we identify a collection of use cases, along with their functional and performance requirements, and discuss what architectures and communications technologies can meet these requirements.

negative: Ichthyosis congenita, harlequin fetus type: a case report. Ichthyosis is a very heterogeneous family of skin disorders with harlequin ichthyosis being the most severe genetic form. It is a rare autosomal recessive condition, characterized by dry, severely thickened skin with large plates of hyperkeratotic scale, separated by deep fissures. Infants are very susceptible to metabolic abnormalities and infections. They usually do not survive for very long, but several long term survivals have been noted. The vast majority of affected individuals are homozygous for mutations in the ABCA12 gene, which cause a deficiency of the epidermal lipid transporter, resulting in hyperkeratosis and abnormal barrier function. We report a case of a newborn with harlequin ichthyosis, born to unrelated parents, who had a favorable evolution with topical treatment and intensive care.

negative: Classification accuracy is not enough We argue that an evaluation of system behavior at the level of the music is required to usefully address the fundamental problems of music genre recognition (MGR), and indeed other tasks of music information retrieval, such as autotagging. A recent review of works in MGR since 1995 shows that most (82 %) measure the capacity of a system to recognize genre by its classification accuracy. After reviewing evaluation in MGR, we show that neither classification accuracy, nor recall and precision, nor confusion tables, necessarily reflect the capacity of a system to recognize genre in musical signals. Hence, such figures of merit cannot be used to reliably rank, promote or discount the genre recognition performance of MGR systems if genre recognition (rather than identification by irrelevant confounding factors) is the objective. This motivates the development of a richer experimental toolbox for evaluating any system designed to intelligently extract information from music signals.

negative: A game-theoretic method of fair resource allocation for cloud computing services As cloud-based services become more numerous and dynamic, resource provisioning becomes more and more challenging. A QoS constrained resource allocation problem is considered in this paper, in which service demanders intend to solve sophisticated parallel computing problem by requesting the usage of resources across a cloud-based network, and a cost of each computational service depends on the amount of computation. Game theory is used to solve the problem of resource allocation. A practical approximated solution with the following two steps is proposed. First, each participant solves its optimal problem independently, without consideration of the multiplexing of resource assignments. A Binary Integer Programming method is proposed to solve the independent optimization. Second, an evolutionary mechanism is designed, which changes multiplexed strategies of the initial optimal solutions of different participants with minimizing their efficiency losses. The algorithms in the evolutionary mechanism take both optimization and fairness into account. It is demonstrated that Nash equilibrium always exists if the resource allocation game has feasible solutions.

negative: Time-frequency Analysis 3.1 Time-frequency Analysis Let f (t) be a mathematical idealization of some physical signal depending on time t. Perhaps f can be considered as a superposition of oscillating components but these oscillations have to be limited to some finite extension in time. This is a fundamental problem of the Fourier inversion formula which states that, for a well-behaved signal f one has f (t) = ∞ −∞ˆf (ξ)e 2πitξ dξ expressing a complex signal f as a superposition of exponentials e 2πitξ. If f vanishes outside some finite set then the exponentials, which extend over all time, must cancel each other in some fantastic way that makes it virtually impossible to quantify in any intuitive way which frequencies play a dominant role at any particular time t. 3.1.2 Frequency Local in time Consider a physical signal to be a square integrable real-valued function of time, x(t). One can define a complex extension z(t) = x(t) + iy(t) bey letting y(t) be the inverse Fourier transform of −isgn (t)ˆ x(ξ) where sgn denotes the signum function ξ/|ξ|. In this casê z = ˆ x + iˆy has only positive frequencies. Exercise 3.1.1. Explain why z(t) has an extension to a complex argument t + is, s > 0 that is analytic in the upper half plane {t + is : s > 0}. You may assume that x(t) is a continuous, bounded, absolutely integrable function. The analytic signal z has the polar form r(t)e iθ(t) where r = x 2 + y 2 and θ = arctan y/x. The instantaneous frequency can be defined as dθ/dt. This point of view however is a little too simple because x(t) can be a superposition of multiple oscillating components and the instantaneous frequency cannot resolve multiple oscillating contributions. We will return to this point later in this chapter. First we want to consider some fundamental issues governing the impossibility of joint time-frequency localization and, in view of these limitations, mathematical tools that aim to characterize compositions of signals in terms of time localized oscillations in view of such limitations. One typically refers to such tools as time-frequency representations. As with the case of Fourier transforms we will encounter both continuous and discrete parameter time-frequency representations. 3.1.3 The Heisenberg-Wiener inequality Variance inequalities Theorem 3.1.2. (Heisenberg uncertainty principle) If f ∈ L 2 (R) with f 2 = 1 then xf (x) 2 ξ ˆ f (ξ) 2 ≥ …

negative: Effect of subjective perspective taking during simulation of action: a PET investigation of agency Perspective taking is an essential component in the mechanisms that account for intersubjectivity and agency. Mental simulation of action can be used as a natural protocol to explore the cognitive and neural processing involved in agency. Here we took PET measurements while subjects simulated actions with either a first-person or a third-person perspective. Both conditions were associated with common activation in the SMA, the precentral gyrus, the precuneus and the MT/V5 complex. When compared to the first-person perspective, the third-person perspective recruited right inferior parietal, precuneus, posterior cingulate and frontopolar cortex. The opposite contrast revealed activation in left inferior parietal and somatosensory cortex. We suggest that the right inferior parietal, precuneus and somatosensory cortex are specifically involved in distinguishing self-produced actions from those generated by others.

negative: Agile Software Development Methods: Review and Analysis Agile – denoting “the quality of being agile; readiness for motion; nimbleness, activity, dexterity in motion” – software development methods are attempting to offer an answer to the eager business community asking for lighter weight along with faster and nimbler software development processes. This is especially the case with the rapidly growing and volatile Internet software industry as well as for the emerging mobile application environment. The new agile methods have evoked a substantial amount of literature and debates. However, academic research on the subject is still scarce, as most of existing publications are written by practitioners or consultants. The aim of this publication is to begin filling this gap by systematically reviewing the existing literature on agile software development methodologies. This publication has three purposes. First, it proposes a definition and a classification of agile software development approaches. Second, it analyses ten software development methods that can be characterized as being ”agile” against the defined criteria. Third, it compares these methods and highlights their similarities and differences. Based on this analysis, future research needs are identified and discussed.

negative: A Framework for Clustering Uncertain Data Streams In recent years, uncertain data management applications have grown in importance because of the large number of hardware applications which measure data approximately. For example, sensors are typically expected to have considerable noise in their readings because of inaccuracies in data retrieval, transmission, and power failures. In many cases, the estimated error of the underlying data stream is available. This information is very useful for the mining process, since it can be used in order to improve the quality of the underlying results. In this paper we will propose a method for clustering uncertain data streams. We use a very general model of the uncertainty in which we assume that only a few statistical measures of the uncertainty are available. We will show that the use of even modest uncertainty information during the mining process is sufficient to greatly improve the quality of the underlying results. We show that our approach is more effective than a purely deterministic method such as the CluStream approach. We will test the approach on a variety of real and synthetic data sets and illustrate the advantages of the method in terms of effectiveness and efficiency.

negative: Weakly Supervised Affordance Detection Localizing functional regions of objects or affordances is an important aspect of scene understanding and relevant for many robotics applications. In this work, we introduce a pixel-wise annotated affordance dataset of 3090 images containing 9916 object instances. Since parts of an object can have multiple affordances, we address this by a convolutional neural network for multilabel affordance segmentation. We also propose an approach to train the network from very few keypoint annotations. Our approach achieves a higher affordance detection accuracy than other weakly supervised methods that also rely on keypoint annotations or image annotations as weak supervision.

negative: SearchQA: A New Q&A Dataset Augmented with Context from a Search Engine We publicly release a new large-scale dataset, called SearchQA, for machine comprehension, or question-answering. Unlike recently released datasets, such as DeepMind CNN/DailyMail and SQuAD, the proposed SearchQA was constructed to reflect a full pipeline of general question-answering. That is, we start not from an existing article and generate a question-answer pair, but start from an existing question-answer pair, crawled from J! Archive, and augment it with text snippets retrieved by Google. Following this approach, we built SearchQA, which consists of more than 140k question-answer pairs with each pair having 49.6 snippets on average. Each question-answer-context tuple of the SearchQA comes with additional meta-data such as the snippet’s URL, which we believe will be valuable resources for future research. We conduct human evaluation as well as test two baseline methods, one simple word selection and the other deep learning based, on the SearchQA. We show that there is a meaningful gap between the human and machine performances. This suggests that the proposed dataset could well serve as a benchmark for question-answering.

negative: A Framework for Evaluating Mobile App Repackaging Detection Algorithms Because it is not hard to reverse engineer the Dalvik bytecode used in the Dalvik virtual machine, Android application repackaging has become a serious problem. With repackaging, a plagiarist can simply steal others’ code violating the intellectual property of the developers. More seriously, after repackaging, popular apps can become the carriers of malware, adware or spy-ware for wide spreading. To maintain a healthy app market, several detection algorithms have been proposed recently, which can catch some types of repackaged apps in various markets efficiently. However, they are generally lack of valid analysis on their effectiveness. After analyzing these approaches, we find simple obfuscation techniques can potentially cause false negatives, because they change the main characteristics or features of the apps that are used for similarity detections. In practice, more sophisticated obfuscation techniques can be adopted (or have already been performed) in the context of mobile apps. We envision this obfuscation based repackaging will become a phenomenon due to the arms race between repackaging and its detection. To this end, we propose a framework to evaluate the obfuscation resilience of repackaging detection algorithms comprehensively. Our evaluation framework is able to perform a set of obfuscation algorithms in various forms on the Dalvik bytecode. Our results provide insights to help gauge both broadness and depth of algorithms’ obfuscation resilience. We applied our framework to conduct a comprehensive case study on AndroGuard, an Android repackaging detector proposed in Black-hat 2011. Our experimental results have demonstrated the effectiveness and stability of our framework.

negative: Mining Personal Data Using Smartphones and Wearable Devices: A Survey The staggering growth in smartphone and wearable device use has led to a massive scale generation of personal (user-specific) data. To explore, analyze, and extract useful information and knowledge from the deluge of personal data, one has to leverage these devices as the data-mining platforms in ubiquitous, pervasive, and big data environments. This study presents the personal ecosystem where all computational resources, communication facilities, storage and knowledge management systems are available in user proximity. An extensive review on recent literature has been conducted and a detailed taxonomy is presented. The performance evaluation metrics and their empirical evidences are sorted out in this paper. Finally, we have highlighted some future research directions and potentially emerging application areas for personal data mining using smartphones and wearable devices.

negative: Comparison of linear, nonlinear, and feature selection methods for EEG signal classification The reliable operation of brain-computer interfaces (BCIs) based on spontaneous electroencephalogram (EEG) signals requires accurate classification of multichannel EEG. The design of EEG representations and classifiers for BCI are open research questions whose difficulty stems from the need to extract complex spatial and temporal patterns from noisy multidimensional time series obtained from EEG measurements. The high-dimensional and noisy nature of EEG may limit the advantage of nonlinear classification methods over linear ones. This paper reports the results of a linear (linear discriminant analysis) and two nonlinear classifiers (neural networks and support vector machines) applied to the classification of spontaneous EEG during five mental tasks, showing that nonlinear classifiers produce only slightly better classification results. An approach to feature selection based on genetic algorithms is also presented with preliminary results of application to EEG during finger movement.

negative: Integrating constraints and metric learning in semi-supervised clustering Semi-supervised clustering employs a small amount of labeled data to aid unsupervised learning. Previous work in the area has utilized supervised data in one of two approaches: 1) constraint-based methods that guide the clustering algorithm towards a better grouping of the data, and 2) distance-function learning methods that adapt the underlying similarity metric used by the clustering algorithm. This paper provides new methods for the two approaches as well as presents a new semi-supervised clustering algorithm that integrates both of these techniques in a uniform, principled framework. Experimental results demonstrate that the unified approach produces better clusters than both individual approaches as well as previously proposed semi-supervised clustering algorithms.

negative: Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis This letter presents theoretical, algorithmic, and experimental results about nonnegative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. We describe how IS-NMF is underlaid by a well-defined statistical model of superimposed gaussian components and is equivalent to maximum likelihood estimation of variance parameters. This setting can accommodate regularization constraints on the factors through Bayesian priors. In particular, inverse-gamma and gamma Markov chain priors are considered in this work. Estimation can be carried out using a space-alternating generalized expectation-maximization (SAGE) algorithm; this leads to a novel type of NMF algorithm, whose convergence to a stationary point of the IS cost function is guaranteed. We also discuss the links between the IS divergence and other cost functions used in NMF, in particular, the Euclidean distance and the generalized Kullback-Leibler (KL) divergence. As such, we describe how IS-NMF can also be performed using a gradient multiplicative algorithm (a standard algorithm structure in NMF) whose convergence is observed in practice, though not proven. Finally, we report a furnished experimental comparative study of Euclidean-NMF, KL-NMF, and IS-NMF algorithms applied to the power spectrogram of a short piano sequence recorded in real conditions, with various initializations and model orders. Then we show how IS-NMF can successfully be employed for denoising and upmix (mono to stereo conversion) of an original piece of early jazz music. These experiments indicate that IS-NMF correctly captures the semantics of audio and is better suited to the representation of music signals than NMF with the usual Euclidean and KL costs.

negative: Clustering with Bregman Divergences A wide variety of distortion functions, such as squared Eucl idean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been use d for clustering. In this paper, we propose and analyze parametric hard and soft clustering algori thms based on a large class of distortion functions known as Bregman divergences. The proposed algor ithms unify centroid-based parametric clustering approaches, such as classical kmeans, the Linde-Buzo-Gray (LBG) algorithm and information-theoretic clustering, which arise by special hoices of the Bregman divergence. The algorithms maintain the simplicity and scalability of the c lassicalkmeans algorithm, while generalizing the method to a large class of clustering loss functi o s. This is achieved by first posing the hard clustering problem in terms of minimizing the loss i n Bregman information, a quantity motivated by rate distortion theory, and then deriving an it erative algorithm that monotonically decreases this loss. In addition, we show that there is a biject ion between regular exponential families and a large class of Bregman divergences, that we call regula r Bregman divergences. This result enables the development of an alternative interpretation o f a efficient EM scheme for learning mixtures of exponential family distributions, and leads to a si mple soft clustering algorithm for regular Bregman divergences. Finally, we discuss the connection be tween rate distortion theory and Bregman clustering and present an information theoretic analys is of Bregman clustering algorithms in terms of a trade-off between compression and loss in Bregman information.

negative: ON SUPERVISED AND SEMI-SUPERVISED k-NEAREST NEIGHBOR ALGORITHMS The k-nearest neighbor (kNN) is one of the simplest classification methods used in machine learning. Since the main component of kNN is a distance metric, kernelization of kNN is possible. In this paper kNN and semi-supervised kNN algorithms are empirically compared on two data sets (the USPS data set and a subset of the Reuters-21578 text categorization corpus). We use a soft version of the kNN algorithm to handle multi-label classification settings. Semi-supervision is performed by using data-dependent kernels.

negative: Non-rigid image registration using self-supervised fully convolutional networks without training data A novel non-rigid image registration algorithm is built upon fully convolutional networks (FCNs) to optimize and learn spatial transformations between pairs of images to be registered in a self-supervised learning framework. Different from most existing deep learning based image registration methods that learn spatial transformations from training data with known corresponding spatial transformations, our method directly estimates spatial transformations between pairs of images by maximizing an image-wise similarity metric between fixed and deformed moving images, similar to conventional image registration algorithms. The image registration is implemented in a multi-resolution image registration framework to jointly optimize and learn spatial transformations and FCNs at different spatial resolutions with deep self-supervision through typical feedforward and backpropagation computation. The proposed method has been evaluated for registering 3D structural brain magnetic resonance (MR) images and obtained better performance than state-of-the-art image registration algorithms.

negative: End-to-end Learning of Latent Dirichlet Allocation by Mirror-Descent Back Propagation We develop a fully discriminative learning approach for supervised Latent Dirichlet Allocation (LDA) model, which maximizes the posterior probability of the prediction variable given the input document. Different from traditional variational learning or Gibbs sampling approaches, the proposed learning method applies (i) the mirror descent algorithm for exact maximum a posterior inference and (ii) back propagation with stochastic gradient descent for model parameter estimation, leading to scalable learning of the model in an end-to-end discriminative manner. As a byproduct, we also apply this technique to develop a new learning method for the traditional unsupervised LDA model. Experimental results on two real-world regression and classification tasks show that the proposed methods significantly outperform the previous supervised/unsupervised LDA learning methods.

negative: Large-Scale Supervised Multimodal Hashing with Semantic Correlation Maximization Due to its low storage cost and fast query speed, hashing has been widely adopted for similarity search in multimedia data. In particular, more and more attentions have been payed to multimodal hashing for search in multimedia data with multiple modalities, such as images with tags. Typically, supervised information of semantic labels is also available for the data points in many real applications. Hence, many supervised multimodal hashing (SMH) methods have been proposed to utilize such semantic labels to further improve the search accuracy. However, the training time complexity of most existing SMH methods is too high, which makes them unscalable to large-scale datasets. In this paper, a novel SMH method, called semantic correlation maximization (SCM), is proposed to seamlessly integrate semantic labels into the hashing learning procedure for large-scale data modeling. Experimental results on two real-world datasets show that SCM can significantly outperform the state-of-the-art SMH methods, in terms of both accuracy and scalability.