Query: An Adaptive Version of the Boost by Majority Algorithm

Relevant passages:
Boosting the margin: A new explanation for the effectiveness of voting methods <=SEP=> One of the surprising recurring phenomena observed in experiments with boosting is that the test error of the generated classifier usually does not increase as its size becomes very large, and often is observed to decrease even after the training error reaches zero. In this paper, we show that this phenomenon is related to the distribution of margins of the training examples with respect to the generated voting classification rule, where the margin of an example is simply the difference between the number of correct votes and the maximum number of votes received by any incorrect label. We show that techniques used in the analysis of Vapnik’s support vector classifiers and of neural networks with small weights can be applied to voting methods to relate the margin distribution to the test error. We also show theoretically and experimentally that boosting is especially effective at increasing the margins of the training examples. Finally, we compare our explanation to those based on the bias-variance decomposition.

ADDITIVE LOGISTIC REGRESSION : A STATISTICAL VIEW OF BOOSTING <=SEP=> Boosting is one of the most important recent developments in classification methodology. Boosting works by sequentially applying a classification algorithm to reweighted versions of the training data and then taking a weighted majority vote of the sequence of classifiers thus produced. For many classification algorithms, this simple strategy results in dramatic improvements in performance. We show that this seemingly mysterious phenomenon can be understood in terms of well-known statistical principles, namely additive modeling and maximum likelihood. For the two-class problem, boosting can be viewed as an approximation to additive modeling on the logistic scale using maximum Bernoulli likelihood as a criterion. We develop more direct approximations and show that they exhibit nearly identical results to boosting. Direct multiclass generalizations based on multinomial likelihood are derived that exhibit performance comparable to other recently proposed multiclass generalizations of boosting in most situations, and far superior in some. We suggest a minor modification to boosting that can reduce computation, often by factors of 10 to 50. Finally, we apply these insights to produce an alternative formulation of boosting decision trees. This approach, based on best-first truncated tree induction, often leads to better performance, and can provide interpretable descriptions of the aggregate decision rule. It is also much faster computationally, making it more suitable to large-scale data mining applications.

Matching pursuits with time-frequency dictionaries <=SEP=> We introduce an algorithm, called matching pursuit, that decomposes any signal into a linear expansion of waveforms that are selected from a redundant dictionary of functions. These waveforms are chosen in order to best match the signal structures. Matching pursuits are general procedures to compute adaptive signal representations. With a dictionary of Gabor functions a matching pursuit defines an adaptive time-frequency transform. We derive a signal energy distribution in the time-frequency plane, which does not include interference terms, unlike Wigner and Cohen class distributions. A matching pursuit isolates the signal structures that are coherent with respect to a given dictionary. An application to pattern extraction from noisy signals is described. We compare a matching pursuit decomposition with a signal expansion over an optimized wavepacket orthonormal basis, selected with the algorithm of Coifman and Wickerhauser.

Projection Pursuit Regression <=SEP=> Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. 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.

Support-Vector Networks <=SEP=> The support-vector network is a new learning machine for two-group classification problems. The machine conceptually implements the following idea: input vectors are non-linearly mapped to a very high-dimension feature space. In this feature space a linear decision surface is constructed. Special properties of the decision surface ensures high generalization ability of the learning machine. The idea behind the support-vector network was previously implemented for the restricted case where the training data can be separated without errors. We here extend this result to non-separable training data. High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated. We also compare the performance of the support-vector network to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition.

Self-Oscillating Flyback Converter for Mobile Batteries Charging Applications <=SEP=> The self-oscillating flyback converter is a popular circuit for cost-sensitive applications due to its simplicity and low component count. This paper presents self-oscillating fly-back converter for mobile batteries charging applications. The converter is designed to step-down the high voltage input to an acceptable level from 220 VAC to 7VDC. By adding indictor and capacitor the power factor and input currant increased, and became 500mA, where the old input currant was 250mA, Diode was connected between Emitter and collector, so the output voltage was improved, and has less ripple, in addition to the soft switching was obtained, simulation model is developed by using MULTISIM software. The operation principle of this converter is described using some operating waveforms based on simulation results and a detailed circuit operation analysis. Analytical results are verified by laboratory experiment. With an input of 220 VAC, 500mA and an output of 7V DC, the efficiency of circuit was75%.

Attacks on Copyright Marking Systems <=SEP=> In the last few years, a large number of schemes have been proposed for hiding copyright marks and other information in digital pictures, video, audio and other multimedia objects. We describe some contenders that have appeared in the research literature and in the field; we then present a number of attacks that enable the information hidden by them to be removed or otherwise rendered unusable. 1 Information Hiding Applications The last few years have seen rapidly growing interest in ways to hide information in other information. A number of factors contributed to this. Fears that copyright would be eroded by the ease with which digital media could be copied led people to study ways of embedding hidden copyright marks and serial numbers in audio and video; concern that privacy would be eroded led to work on electronic cash, anonymous remailers, digital elections and techniques for making mobile computer users harder for third parties to trace; and there remain the traditional ‘military’ concerns about hiding one’s own traffic while making it hard for the opponent to do likewise. The first international workshop on information hiding [2] brought these communities together and a number of hiding schemes were presented there; more have been presented elsewhere. We formed the view that useful progress in steganography and copyright marking might come from trying to attack all these first generation schemes. In the related field of cryptology, progress was iterative: cryptographic algorithms were proposed, attacks on them were found, more algorithms were proposed, and so on. Eventually, theory emerged: fast correlation attacks on stream ciphers and differential and linear attacks on block ciphers, now help us understand the strength of cryptographic algorithms in much more detail than before. Similarly, many cryptographic protocols were proposed and almost all the early candidates were broken, leading to concepts of protocol robustness and techniques for formal verification [6]. So in this paper, we first describe the copyright protection context in which most recent schemes have been developed; we then describe a selection of these ? The first author is grateful to Intel Corporation for financial support under the grant ‘Robustness of Information Hiding Systems’ ?? The third author is supported by a European Commission Marie-Curie grant David Aucsmith (Ed.): Information Hiding 1998, LNCS 1525, pp. 218–238, 1998. c © Springer-Verlag Berlin Heidelberg 1998 Attacks on Copyright Marking Systems 219 schemes and present a number of attacks, which break most of them. We finally make some remarks on the meaning of robustness in the context of steganography in general and copyright marking in particular. 1.1 Copyright Protection Issues Digital recording media offer many new possibilities but their uptake has been hindered by widespread fears among intellectual property owners such as Hollywood and the rock music industry that their livelihoods would be threatened if users could make unlimited perfect copies of videos, music and multimedia works. One of the first copy protection mechanisms for digital media was the serial copy management system (SCMS) introduced by Sony and Phillips for digital audio tapes in the eighties [31]. The idea was to allow consumers to make a digital audio tape of a CD they owned in order to use it (say) in their car, but not to make a tape of somebody else’s tape; thus copies would be limited to first generation only. The implementation was to include a Boolean marker in the header of each audio object. Unfortunately this failed because the hardware produced by some manufacturers did not enforce it. More recently the Digital Video Disk, also known as Digital Versatile Disk (DVD) consortium called for proposals for a copyright marking scheme to enforce serial copy management. The idea is that the DVD players sold to consumers will allow unlimited copying of home videos and time-shifted viewing of TV programmes, but cannot easily be abused for commercial piracy [19, 44]. The proposed implementation is that videos will be unmarked, or marked ‘never copy’, or ‘copy once only’; compliant players would not record a video marked ‘never copy’ and when recording one marked ‘copy once only’ would change its mark to ‘never copy’. Commercially sold videos would be marked ‘never copy’, while TV broadcasts and similar material would be marked ‘copy once only’ and home videos would be unmarked. Electronic copyright management schemes have also been proposed by European projects such as Imprimatur and CITED [45, 66, 67], and American projects such as the proposed by the Working Group on Intellectual Property Rights [69].

Efficient and Low Latency Detection of Intruders in Mobile Active Authentication <=SEP=> Active authentication (AA) refers to the problem of continuously verifying the identity of a mobile device user for the purpose of securing the device. We address the problem of quickly detecting intrusions with lower false detection rates in mobile AA systems with higher resource efficiency. Bayesian and MiniMax versions of the quickest change detection (QCD) algorithms are introduced to quickly detect intrusions in mobile AA systems. These algorithms are extended with an update rule to facilitate low-frequency sensing which leads to low utilization of resources. Effectiveness of the proposed framework is demonstrated using three publicly available unconstrained face and touch gesture-based AA datasets. It is shown that the proposed QCD-based intrusion detection methods can perform better than many state-of-the-art AA methods in terms of latency and low false detection rates. Furthermore, it is shown that employing the proposed resource-efficient extension further improves the performance of the QCD-based setup.

Don't Be Lazy, Be Consistent: Postgres-R, A New Way to Implement Database Replication <=SEP=>  \ N\| N\wOEN^|< e\ eNNN¡  ^  N¢X\£<¤ N¥N ¦||§N| ̈\<©RN\dV\a | aN ¦|<§ « \\NX¡;aUN\ O¢X\ N¬  ^  \NW \0\|aUNN­@®u7 | a^NN¡e¤o  O¤ \ a \ aN\`¦||a |\ ̄ 0§N WJ§N|\§X a ¢N<N <£  | 7 §Xa  | \| O « aO¤ I J O¢X¦ \X§° a |± aNN­ 20\NO¢NN¡¤@\ O¤3 O¤¬ a\O3 ^\X \¦| \| §X ^9| §N\^\\NU| &&N¦  \a\w\£<\Na4­e ́ * WXjaμ§N \N*  N¤  \<§N¦|  ` N| |a  ¦|NaUN<\\| |·¶[\u3 _ ̧ 1 oe­R®u¦|\  O¢<μaN9N»<^N\|aUN<\¦[\N ¦|\  O¢ | @\ a a <£1⁄4j\ a& aN  0¦||a |\1⁄43 \|  O \N ¦||§N\| §NJ^4O¢μaN <£  μa \ a    μ\ \X§° a |± aNN­

A neural network students' performance prediction model (NNSPPM) <=SEP=> In the academic industry, students' early performance prediction is important to academic communities so that strategic intervention can be planned before students reach the final semester. This paper presents a study on Artificial Neural Network (ANN) model development in predicting academic performance of engineering students. Cumulative Grade Point Average (CGPA) was used to measure the academic achievement at semester eight. The study was conducted at the Faculty of Electrical Engineering, Universiti Teknologi MARA (UiTM), Malaysia. Students' results for the fundamental subjects in the first semester were used as independent variables or input predictor variables while CGPA at semester eight was used as the output or the dependent variable. The study was done for two different entry points namely Matriculation and Diploma intakes. Performances of the models were measured using the coefficient of Correlation R and Mean Square Error (MSE). The outcomes from the study showed that fundamental subjects at semester one and three have strong influence in the final CGPA upon graduation.

Deep Image Prior <=SEP=> 

The Pervasive Effects of an Antibiotic on the Human Gut Microbiota, as Revealed by Deep 16S rRNA Sequencing <=SEP=> The human intestinal microbiota is essential to the health of the host and plays a role in nutrition, development, metabolism, pathogen resistance, and regulation of immune responses. Antibiotics may disrupt these coevolved interactions, leading to acute or chronic disease in some individuals. Our understanding of antibiotic-associated disturbance of the microbiota has been limited by the poor sensitivity, inadequate resolution, and significant cost of current research methods. The use of pyrosequencing technology to generate large numbers of 16S rDNA sequence tags circumvents these limitations and has been shown to reveal previously unexplored aspects of the "rare biosphere." We investigated the distal gut bacterial communities of three healthy humans before and after treatment with ciprofloxacin, obtaining more than 7,000 full-length rRNA sequences and over 900,000 pyrosequencing reads from two hypervariable regions of the rRNA gene. A companion paper in PLoS Genetics (see Huse et al., doi: 10.1371/journal.pgen.1000255) shows that the taxonomic information obtained with these methods is concordant. Pyrosequencing of the V6 and V3 variable regions identified 3,300-5,700 taxa that collectively accounted for over 99% of the variable region sequence tags that could be obtained from these samples. Ciprofloxacin treatment influenced the abundance of about a third of the bacterial taxa in the gut, decreasing the taxonomic richness, diversity, and evenness of the community. However, the magnitude of this effect varied among individuals, and some taxa showed interindividual variation in the response to ciprofloxacin. While differences of community composition between individuals were the largest source of variability between samples, we found that two unrelated individuals shared a surprising degree of community similarity. In all three individuals, the taxonomic composition of the community closely resembled its pretreatment state by 4 weeks after the end of treatment, but several taxa failed to recover within 6 months. These pervasive effects of ciprofloxacin on community composition contrast with the reports by participants of normal intestinal function and with prior assumptions of only modest effects of ciprofloxacin on the intestinal microbiota. These observations support the hypothesis of functional redundancy in the human gut microbiota. The rapid return to the pretreatment community composition is indicative of factors promoting community resilience, the nature of which deserves future investigation.

OpenCL: A Parallel Programming Standard for Heterogeneous Computing Systems <=SEP=> The OpenCL standard offers a common API for program execution on systems composed of different types of computational devices such as multicore CPUs, GPUs, or other accelerators.

W-BAND MICROSTRIP-TO-WAVEGUIDE TRANSITION USING VIA FENCES <=SEP=> Abstract—The paper presents integrated probe for direct coupling to the WR-10 waveguide with the use of metal filled vias on both sides of the microstrip line. Design and optimization of this novel microstripto-waveguide transition has been performed using 3-D finite element method based software HFSS (High Frequency Structure Simulator). A back-to-back transition has been fabricated and measured between 75–110GHz. The measured return loss is higher than 10 dB and the insertion loss for a single microstrip-to-waveguide transition is about 1.15 dB.

E-LOYALTY IS NOT ALL ABOUT TRUST , PRICE ALSO MATTERS : EXTENDING EXPECTATION-CONFIRMATION THEORY IN BOOKSELLING WEBSITES <=SEP=> Identifying factors that influence customers’ e-loyalty is paramount for practitioners and academics to develop successful marketing strategies and behavioral models. Online bookselling is a rapid growing industry in the UK, where e-loyalty models have yet to reach a conclusive argument. This paper aims to explore factors influencing customers’ e-loyalty to five online bookselling websites in the UK by testing a theoretical model, based on expectation-confirmation theory. A quantitative approach was employed using questionnaires; the sample consisted of 290 respondents (50% males, age range: 18 to over 54). The questionnaire was pretested and confirmatory factor analysis was performed to assess the measurement model. Structural equation modeling and MANOVA were employed to examine the association between latent constructs. Eleven hypotheses were formulated examining different independent variables in the theoretical model; results showed a significant direct and positive association between satisfaction and e-loyalty. Web design affected e-loyalty significantly on all bookselling websites, perceived value was a significant predictor of satisfaction while price notably influenced e-trust development. Etrust was not associated with e-loyalty. This study introduces new variables that affect e-loyalty as well as illuminates new associations between existing factors – perceived value, price, and trust are new aspects which practitioners and academics should take into account for marketing strategies and behavioral models, respectively. Hence, managers will likely increase customer satisfaction and loyalty by improving web design and balancing quality with price, predisposing positively customer’s attitudes towards the website.

0.35μm, 30V fully isolated and low-Ron nLDMOS for DC-DC applications <=SEP=> In this paper, we present a new approach to integrate in a 0.35 μm BCD technology, low Ron LDMOS power transistors with highly competitive Specific Resistance figure of merit (Rsp, defined as Ron*Area). The LDMOS are fully isolated in order to support applications which may bias the source/drain electrodes below the substrate potential, which is critical for devices used in high-current, high-frequency switching applications. The new devices are suitable for high-efficiency DC-DC converter products with operating voltage of up to 30V, such as mobile PMICs. For maximum performance, two different extended-drain LDMOS structures have been developed to cover the entire operating voltage range: for 16V and below, a planar-gate structure is used and for 20V and above, a non-planar “offset-LOCOS” gate is used for 20V and above.

Wireless sensor networks: a survey on recent developments and potential synergies <=SEP=> Wireless sensor network (WSN) has emerged as one of the most promising technologies for the future. This has been enabled by advances in technology and availability of small, inexpensive, and smart sensors resulting in cost effective and easily deployable WSNs. However, researchers must address a variety of challenges to facilitate the widespread deployment of WSN technology in real-world domains. In this survey, we give an overview of wireless sensor networks and their application domains including the challenges that should be addressed in order to push the technology further. Then we review the recent technologies and testbeds for WSNs. Finally, we identify several open research issues that need to be investigated in future. Our survey is different from existing surveys in that we focus on recent developments in wireless sensor network technologies. We review the leading research projects, standards and technologies, and platforms. Moreover, we highlight a recent phenomenon in WSN research that is to explore synergy between sensor networks and other technologies and explain how this can help sensor networks achieve their full potential. This paper intends to help new researchers entering the domain of WSNs by providing a comprehensive survey on recent developments.

A Storage Solution for Massive IoT Data Based on NoSQL <=SEP=> Storage is an important research direction of the data management of the Internet of Things. Massive and heterogeneous data of the Internet of Things brings the storage huge challenges. Based on the analysis of the IoT data characteristics, this paper proposed a storage management solution called IOTMDB based on NoSQL as current storage solutions are not well support storing massive and heterogeneous IoT data. Besides, the storage strategies about expressing and organizing IoT data in a uniform manner were proposed, some evaluations were carried out. Furthermore, we not only just concerned about descripting the data itself, but also cared for sharing of the data, so a data sharing mechanism based on ontology was proposed. Finally, index was studied and a set of query syntaxes to meet the needs of different kinds of IoT queries based NoSQL was given.

Cost-effective low-loss flexible optical engine with microlens-imprinted film for high-speed on-board optical interconnection <=SEP=> There is a strong demand for optical interconnection technology to overcome bandwidth bottlenecks in high-end server systems. The interconnection speed in present systems is approaching 10 Gb/s, and higher-speed interconnections over 25 Gb/s are being discussed. To achieve such optical interconnections in commercial production, it is necessary to develop lower-cost and higher-speed optical transceiver modules. We propose a flexible printed circuit optical engine (FPC-OE) with a microlens-imprinted film and a polymer waveguide to achieve low-cost and high-speed operation. The microlens-imprinted film can be produced at low cost by using nanoimprint technology and can drastically reduce the optical loss of the FPC-OE with polymer waveguide. We successfully demonstrated error-free operation at 25 Gb/s with the fabricated optical transceiver that contains an FPC-OE, microlens-imprinted film, and a polymer waveguide.

Task constraints in visual working memory <=SEP=> This paper examines the nature of visual representations that direct ongoing performance in sensorimotor tasks. Performance of such natural tasks requires relating visual information from different gaze positions. To explore this we used the technique of making task relevant display changes during saccadic eye movements. Subjects copied a pattern of colored blocks on a computer monitor, using the mouse to drag the blocks across the screen. Eye position was monitored using a dual-purkinje eye tracker, and the color of blocks in the pattern was changed at different points in task performance. When the target of the saccade changed color during the saccade, the duration of fixations on the model pattern increased, depending on the point in the task that the change was made. Thus different fixations on the same visual stimulus served a different purpose. The results also indicated that the visual information that is retained across successive fixations depends on moment by moment task demands. This is consistent with previous suggestions that visual representations are limited and task dependent. Changes in blocks in addition to the saccade target led to greater increases in fixation duration. This indicated that some global aspect of the pattern was retained across different fixations. Fixation durations revealed effects of the display changes that were not revealed in perceptual report. This can be understood by distinguishing between processes that operate at different levels of description and different time scales. Our conscious experience of the world may reflect events over a longer time scale than those underlying the substructure of the perceptuo-motor machinery.

Automatic Definition of Modular Neural Networks <=SEP=> This paper illustrates an artiicial developmental system that is a computationally ee-cient technique for the automatic generation of complex Artiicial Neural Networks (ANN). Artiicial developmental system can develop a graph grammar into a modular ANN made of a combination of more simple subnetworks. A genetic algorithm is used to evolve coded grammars that generates ANNs for controlling a six-legged robot locomotion. A mechanism for the automatic deenition of sub-neural networks is incorporated. Using this mechanism, the genetic algorithm can automatically decompose a problem into subproblems, generate a subANN for solving the subproblem, and instantiate copies of this subANN to build a higher level ANN that solves the problem. We report some simulation results showing that the same problem cannot be solved if the mechanism for automatic deenition of sub-networks is suppressed. We support our argumentation with pictures describing the steps of development, how ANN structures are evolved, and how the ANNs compute.matic deention of sub-neural networks.

Analyzing the transitional region in low power wireless links <=SEP=> The wireless sensor networks community, has now an increased understanding of the need for realistic link layer models. Recent experimental studies have shown that real deployments have a "transitional region" with highly unreliable links, and that therefore the idealized perfect-reception-within-range models used in common network simulation tools can be very misleading. In this paper, we use mathematical techniques from communication theory to model and analyze the low power wireless links. The primary contribution of this work is the identification of the causes of the transitional region, and a quantification of their influence. Specifically, we derive expressions for the packet reception rate as a function of distance, and for the width of the transitional region. These expressions incorporate important channel and radio parameters such as the path loss exponent and shadowing variance of the channel; and the modulation and encoding of the radio. A key finding is that for radios using narrow-band modulation, the transitional region is not an artifact of the radio non-ideality, as it would exist even with perfect-threshold receivers because of multi-path fading. However, we hypothesize that radios with mechanisms to combat multi-path effects, such as spread-spectrum and diversity techniques, can reduce the transitional region.

Efficient Object Instance Search Using Fuzzy Objects Matching <=SEP=> Recently, global features aggregated from local convolutional features of the convolutional neural network have shown to be much more effective in comparison with hand-crafted features for image retrieval. However, the global feature might not effectively capture the relevance between the query object and reference images in the object instance search task, especially when the query object is relatively small and there exist multiple types of objects in reference images. Moreover, the object instance search requires to localize the object in the reference image, which may not be achieved through global representations. In this paper, we propose a Fuzzy Objects Matching (FOM) framework to effectively and efficiently capture the relevance between the query object and reference images in the dataset. In the proposed FOM scheme, object proposals are utilized to detect the potential regions of the query object in reference images. To achieve high search efficiency, we factorize the feature matrix of all the object proposals from one reference image into the product of a set of fuzzy objects and sparse codes. In addition, we refine the feature of the generated fuzzy objects according to its neighborhood in the feature space to generate more robust representation. The experimental results demonstrate that the proposed FOM framework significantly outperforms the state-of-theart methods in precision with less memory and computational cost on three public datasets. The task of object instance search, is to retrieve all the images containing a specific object query and localize the query object in the reference images. It has received a sustained attention over the last decade, leading to many object instance search systems (Meng et al. 2010; Jiang, Meng, and Yuan 2012; Jiang et al. 2015; Tolias, Avrithis, and Jégou 2013; Tao et al. 2014; Razavian et al. 2014a; 2014b; Tolias, Sicre, and Jégou 2016; Meng et al. 2016; Bhattacharjee et al. 2016b; 2016a; Mohedano et al. 2016; Cao et al. 2016; Wu et al. 2016). Since the query object only occupies a small part of an image, the global representation may not be effective to capture the relevance between the query object with reference image. Therefore, the relevance between the query object and one reference image is not determined by the overall similarity between the query and the reference image. Copyright c © 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. ...

A New Approach Layered Architecture Based Clustering for Prolong Life of Wireless Sensor Network (WSN) <=SEP=> Sensor nodes are the tiny particles which have to rely on limited power of energy. Sensor nodes with limited battery power are deployed to gather information in wireless environment throughout the field. Due to the small amount of energy in a node of sensor web, energy balancing among nodes is quite important. Secondly, due to lack of energy in a particular node we are also concerned to the power saving of a sensor node. We are also concerned here to prolong the life of sensor node so that it can sense the field for longer period of time. All these features are the prime necessity to introduce a new energy efficient routing algorithm in this paper.

Discrete Content-aware Matrix Factorization <=SEP=> Precisely recommending relevant items from massive candidates to a large number of users is an indispensable yet computationally expensive task in many online platforms (e.g., Amazon.com and Netflix.com). A promising way is to project users and items into a Hamming space and then recommend items via Hamming distance. However, previous studies didn't address the cold-start challenges and couldn't make the best use of preference data like implicit feedback. To fill this gap, we propose a Discrete Content-aware Matrix Factorization (DCMF) model, 1) to derive compact yet informative binary codes at the presence of user/item content information; 2) to support the classification task based on a local upper bound of logit loss; 3) to introduce an interaction regularization for dealing with the sparsity issue. We further develop an efficient discrete optimization algorithm for parameter learning. Based on extensive experiments on three real-world datasets, we show that DCFM outperforms the state-of-the-arts on both regression and classification tasks.

Application of Representation Theory to Dual-Mode Microwave Bandpass Filters <=SEP=> This paper discusses the physics behind the operation of dual-mode bandpass filters from a field theoretical point of view. It is argued that the two degenerate modes of the empty dual-mode cavity, commonly taken as the vertical and horizontal polarizations, become nonphysical when coupling and tuning elements are inserted. Instead, the original degenerate modes are rotated, or modified in a complex way, to generate two new modes whose characteristics depend on the coupling and tuning elements. It is shown that the tuning elements, as placed in existing dual-mode filter designs, act as both tuning and coupling elements. A working dual-mode filter can be designed with only ldquotuningrdquo elements present. A physical representation of dual-mode filters in terms of the eigenresonances of the dual-mode cavities, with the tuning and coupling elements present, is introduced. Two fourth-order dual-mode rectangular cavity filters with the same response in the passband and its vicinity are also presented to demonstrate the similar role played by ldquotuningrdquo and coupling elements in dual-mode cavities. The first filter uses only ldquotuningrdquo elements, while the second is based only on ldquocouplingrdquo elements.

Indra: A Word Embedding and Semantic Relatedness Server <=SEP=> In recent years word embedding/distributional semantic models evolved to become a fundamental component in many natural language processing (NLP) architectures due to their ability of capturing and quantifying semantic associations at scale. Word embedding models can be used to satisfy recurrent tasks in NLP such as lexical and semantic generalisation in machine learning tasks, finding similar or related words and computing semantic relatedness of terms. However, building and consuming specific word embedding models require the setting of a large set of configurations, such as corpus-dependant parameters, distance measures as well as compositional models. Despite their increasing relevance as a component in NLP architectures, existing frameworks provide limited options in their ability to systematically build, parametrise, compare and evaluate different models. To answer this demand, this paper describes INDRA, a multi-lingual word embedding/distributional semantics framework which supports the creation, use and evaluation of word embedding models. In addition to the tool, INDRA also shares more than 65 pre-computed models in 14 languages.

Association Rule Mining: A Survey <=SEP=> Data mining [Chen et al. 1996] is the process of extracting interesting (non-trivial, implicit, previously unknown and potentially useful) information or patterns from large information repositories such as: relational database, data warehouses, XML repository, etc. Also data mining is known as one of the core processes of Knowledge Discovery in Database (KDD). Many people take data mining as a synonym for another popular term, Knowledge Discovery in Database (KDD). Alternatively other people treat Data Mining as the core process of KDD. The KDD processes are shown in Figure 1 [Han and Kamber 2000]. Usually there are three processes. One is called preprocessing, which is executed before data mining techniques are applied to the right data. The preprocessing includes data cleaning, integration, selection and transformation. The main process of KDD is the data mining process, in this process different algorithms are applied to produce hidden knowledge. After that comes another process called postprocessing, which evaluates the mining result according to users’ requirements and domain knowledge. Regarding the evaluation results, the knowledge can be presented if the result is satisfactory, otherwise we have to run some or all of those processes again until we get the satisfactory result. The actually processes work as follows. First we need to clean and integrate the databases. Since the data source may come from different databases, which may have some inconsistences and duplications, we must clean the data source by removing those noises or make some compromises. Suppose we have two different databases, different words are used to refer the same thing in their schema. When we try to integrate the two sources we can only choose one of them, if we know that they denote the same thing. And also real world data tend to be incomplete and noisy due to the manual input mistakes. The integrated data sources can be stored in a database, data warehouse or other repositories. As not all the data in the database are related to our mining task, the second process is to select task related data from the integrated resources and transform them into a format that is ready to be mined. Suppose we want to find which items are often purchased together in a supermarket, while the database that records the purchase history may contains customer ID, items bought, transaction time, prices, number of each items and so on, but for this specific task we only need items bought. After selection of relevant data, the database that we are going to apply our data mining techniques to will be much smaller, consequently the whole process will be

Mobile robot positioning: Sensors and techniques <=SEP=> Exact knowledge of the position of a vehicle is a fundamental problem in mobile robot applications. In search for a solution, researchers and engineers have developed a variety of systems, sensors, and techniques for mobile robot positioning. This paper provides a review of relevant mobile robot positioning technologies. The paper defines seven categories for positioning systems: 1. Odometry; 2. Inertial Navigation; 3. Magnetic Compasses; 4. Active Beacons; 5. Global Positioning Systems; 6. Landmark Navigation; and 7. Model Matching. The characteristics of each category are discussed and examples of existing technologies are given for each category. The field of mobile robot navigation is active and vibrant, with more great systems and ideas being developed continuously. For this reason the examples presented in this paper serve only to represent their respective categories, but they do not represent a judgment by the authors. Many ingenious approaches can be found in the literature, although, for reasons of brevity, not all could be cited in this paper. 1) (Corresponding Author) The University of Michigan, Advanced Technologies Lab, 1101 Beal Avenue, Ann Arbor, MI 48109-2110, Ph.: 313-763-1560, Fax: 313-944-1113. Email: johannb@umich.edu 2) Naval Command, Control, and Ocean Surveillance Center, RDT&E Division 5303, 271 Catalina Boulevard, San Diego, CA 92152-5001, Email: Everett@NOSC.MIL 3) The University of Michigan, Advanced Technologies Lab, 1101 Beal Avenue, Ann Arbor, MI 481092110, Email: Feng@engin.umich.edu 4) The University of Michigan, Dept. of Nuclear Engineering and Radiological Sciences, 239 Cooley Bldg., Ann Arbor, MI 48109, Email: dkw@umich.edu

On the role of linguistic descriptions of data in the building of natural language generation systems <=SEP=> This paper explores the current state of the task of generating easily understandable information from data for people using natural language, which is currently addressed by two independent research fields: the natural language generation field — and, more specifically, the data-to-text sub-field — and the linguistic descriptions of data field. Both approaches are explained in a detailed description which includes: i) a methodological revision of both fields including basic concepts and definitions, models and evaluation procedures; ii) the most relevant systems, use cases and real applications described in the literature. Some reflections about the current state and future trends of each field are also provided, followed by several remarks that conclude by hinting at some potential points of mutual interest and convergence between both fields. © 2015 Elsevier B.V. All rights reserved.