Query: Anatomy of a web-scale resale market: a data mining approach

Relevant passages:
Learning from the past: answering new questions with past answers <=SEP=> Community-based Question Answering sites, such as Yahoo! Answers or Baidu Zhidao, allow users to get answers to complex, detailed and personal questions from other users. However, since answering a question depends on the ability and willingness of users to address the asker's needs, a significant fraction of the questions remain unanswered. We measured that in Yahoo! Answers, this fraction represents 15% of all incoming English questions. At the same time, we discovered that around 25% of questions in certain categories are recurrent, at least at the question-title level, over a period of one year.
 We attempt to reduce the rate of unanswered questions in Yahoo! Answers by reusing the large repository of past resolved questions, openly available on the site. More specifically, we estimate the probability whether certain new questions can be satisfactorily answered by a best answer from the past, using a statistical model specifically trained for this task. We leverage concepts and methods from query-performance prediction and natural language processing in order to extract a wide range of features for our model. The key challenge here is to achieve a level of quality similar to the one provided by the best human answerers.
 We evaluated our algorithm on offline data extracted from Yahoo! Answers, but more interestingly, also on online data by using three "live" answering robots that automatically provide past answers to new questions when a certain degree of confidence is reached. We report the success rate of these robots in three active Yahoo! Answers categories in terms of both accuracy, coverage and askers' satisfaction. This work presents a first attempt, to the best of our knowledge, of automatic question answering to questions of social nature, by reusing past answers of high quality.

Empirical comparison of algorithms for network community detection <=SEP=> Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses an objective function that captures the intuition of a network cluster as set of nodes with better internal connectivity than external connectivity, and then one applies approximation algorithms or heuristics to extract sets of nodes that are related to the objective function and that "look like" good communities for the application of interest.
 In this paper, we explore a range of network community detection methods in order to compare them and to understand their relative performance and the systematic biases in the clusters they identify. We evaluate several common objective functions that are used to formalize the notion of a network community, and we examine several different classes of approximation algorithms that aim to optimize such objective functions. In addition, rather than simply fixing an objective and asking for an approximation to the best cluster of any size, we consider a size-resolved version of the optimization problem. Considering community quality as a function of its size provides a much finer lens with which to examine community detection algorithms, since objective functions and approximation algorithms often have non-obvious size-dependent behavior.

Netprobe: a fast and scalable system for fraud detection in online auction networks <=SEP=> Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implementation of NetProbe, a system that we propose for solving this problem. NetProbe models auction users and transactions as a Markov Random Field tuned to detect the suspicious patterns that fraudsters create, and employs a Belief Propagation mechanism to detect likely fraudsters. Our experiments show that NetProbe is both efficient and effective for fraud detection. We report experiments on synthetic graphs with as many as 7,000 nodes and 30,000 edges, where NetProbe was able to spot fraudulent nodes with over 90% precision and recall, within a matter of seconds. We also report experiments on a real dataset crawled from eBay, with nearly 700,000 transactions between more than 66,000users, where NetProbe was highly effective at unearthing hidden networks of fraudsters, within a realistic response time of about 6 minutes. For scenarios where the underlying data is dynamic in nature, we propose IncrementalNetProbe, which is an approximate, but fast, variant of NetProbe. Our experiments prove that Incremental NetProbe executes nearly doubly fast as compared to NetProbe, while retaining over 99% of its accuracy.

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms <=SEP=> In this paper, we establish max-flow min-cut theorems for several important classes of multicommodity flow problems. In particular, we show that for any n-node multicommodity flow problem with uniform demands, the max-flow for the problem is within an O(log n) factor of the upper bound implied by the min-cut. The result (which is existentially optimal) establishes an important analogue of the famous 1-commodity max-flow min-cut theorem for problems with multiple commodities. The result also has substantial applications to the field of approximation algorithms. For example, we use the flow result to design the first polynomial-time (polylog n-times-optimal) approximation algorithms for well-known NP-hard optimization problems such as graph partitioning, min-cut linear arrangement, crossing number, VLSI layout, and minimum feedback arc set. Applications of the flow results to path routing problems, network reconfiguration, communication in distributed networks, scientific computing and rapidly mixing Markov chains are also described in the paper.

Combating Web Spam with TrustRank <=SEP=> Web spam pages use various techniques to achieve higher-than-deserved rankings in a search engine’s results. While human experts can identify spam, it is too expensive to manually evaluate a large number of pages. Instead, we propose techniques to semiautomatically separate reputable, good pages from spam. We first select a small set of seed pages to be evaluated by an expert. Once we manually identify the reputable seed pages, we use the link structure of the web to discover other pages that are likely to be good. In this paper we discuss possible ways to implement the seed selection and the discovery of good pages. We present results of experiments run on the World Wide Web indexed by AltaVista and evaluate the performance of our techniques. Our results show that we can effectively filter out spam from a significant fraction of the web, based on a good seed set of less than 200 sites.

Requirements Traceability: a Systematic Review and Industry Case Study <=SEP=> Requirements traceability enables software engineers to trace a requirement from its emergence to its ful ̄llment. In this paper we examine requirements traceability de ̄nitions, challenges, tools and techniques, by the use of a systematic review performing an exhaustive search through the years 1997 2007. We present a number of common de ̄nitions, challenges, available tools and techniques (presenting empirical evidence when found), while complementing the results and analysis with a static validation in industry through a series of interviews.

Practical Byzantine Fault Tolerance <=SEP=> Our growing reliance on online services accessible on the Internet demands highly-available systems that provide correct service without interruptions. Byzantine faults such as software bugs, operator mistakes, and malicious attacks are the major cause of service interruptions. This thesis describes a new replication algorithm, BFT, that can be used to build highly-available systems that tolerate Byzantine faults. It shows, for the first time, how to build Byzantine-fault-tolerant systems that can be used in practice to implement real services because they do not rely on unrealistic assumptions and they perform well. BFT works in asynchronous environments like the Internet, it incorporates mechanisms to defend against Byzantine-faulty clients, and it recovers replicas proactively. The recovery mechanism allows the algorithm to tolerate any number of faults over the lifetime of the system provided fewer than 1/3 of the replicas become faulty within a small window of vulnerability. The window may increase under a denial-of-service attack but the algorithm can detect and respond to such attacks and it can also detect when the state of a replica is corrupted by an attacker. BFT has been implemented as a generic program library with a simple interface. The BFT library provides a complete solution to the problem of building real services that tolerate Byzantine faults. We used the library to implement the first Byzantine-fault-tolerant NFS file system, BFS. The BFT library and BFS perform well because the library incorporates several important optimizations. The most important optimization is the use of symmetric cryptography to authenticate messages. Public-key cryptography, which was the major bottleneck in previous systems, is used only to exchange the symmetric keys. The performance results show that BFS performs 2% faster to 24% slower than production implementations of the NFS protocol that are not replicated. Therefore, we believe that the BFT library can be used to build practical systems that tolerate Byzantine faults. Thesis Supervisor: Barbara H. Liskov Title: Ford Professor of Engineering

StudentLife: assessing mental health, academic performance and behavioral trends of college students using smartphones <=SEP=> Much of the stress and strain of student life remains hidden. The StudentLife continuous sensing app assesses the day-to-day and week-by-week impact of workload on stress, sleep, activity, mood, sociability, mental well-being and academic performance of a single class of 48 students across a 10 week term at Dartmouth College using Android phones. Results from the StudentLife study show a number of significant correlations between the automatic objective sensor data from smartphones and mental health and educational outcomes of the student body. We also identify a Dartmouth term lifecycle in the data that shows students start the term with high positive affect and conversation levels, low stress, and healthy sleep and daily activity patterns. As the term progresses and the workload increases, stress appreciably rises while positive affect, sleep, conversation and activity drops off. The StudentLife dataset is publicly available on the web.

Human3.6M: Large Scale Datasets and Predictive Methods for 3D Human Sensing in Natural Environments <=SEP=> We introduce a new dataset, Human3.6M, of 3.6 Million accurate 3D Human poses, acquired by recording the performance of 5 female and 6 male subjects, under 4 different viewpoints, for training realistic human sensing systems and for evaluating the next generation of human pose estimation models and algorithms. Besides increasing the size of the datasets in the current state-of-the-art by several orders of magnitude, we also aim to complement such datasets with a diverse set of motions and poses encountered as part of typical human activities (taking photos, talking on the phone, posing, greeting, eating, etc.), with additional synchronized image, human motion capture, and time of flight (depth) data, and with accurate 3D body scans of all the subject actors involved. We also provide controlled mixed reality evaluation scenarios where 3D human models are animated using motion capture and inserted using correct 3D geometry, in complex real environments, viewed with moving cameras, and under occlusion. Finally, we provide a set of large-scale statistical models and detailed evaluation baselines for the dataset illustrating its diversity and the scope for improvement by future work in the research community. Our experiments show that our best large-scale model can leverage our full training set to obtain a 20% improvement in performance compared to a training set of the scale of the largest existing public dataset for this problem. Yet the potential for improvement by leveraging higher capacity, more complex models with our large dataset, is substantially vaster and should stimulate future research. The dataset together with code for the associated large-scale learning models, features, visualization tools, as well as the evaluation server, is available online at http://vision.imar.ro/human3.6m.

Finite Element Analysis Based Design of Mobile Robot for Removing Plug Oil Well <=SEP=> In order to develop the mobile robot for removing the plug oil well, the robot was designed based on the wheeltype and leg-type robot mechanism. A well functioning prototype has been manufactured. To demonstrate the validity and the benefit of the mobile robot, supporting mechanism and guiding rod were chosen to design based on the FEM. The mathematical model of the supporting mechanism is established and the mechanical property is analyzed using the FEM. The deformation and stress of some components of the supporting mechanism and the guiding rod is investigated. The results show that the supporting mechanism and the guiding rod have excellent performance with little displacement and small stress under working condition. The strength and rigidity of supporting mechanism and the guiding rod are good enough to ensure the reliability of the whole robot mechanism.

Cognitive load and detection thresholds in car following situations: safety implications for using mobile (cellular) telephones while driving. <=SEP=> This study was aimed at investigating drivers' ability to detect a car ahead decelerating, while doing mobile phone related tasks. Nineteen participants aged between 20 and 29 years, (2000-125000 km driving experience) drove at 80 km/h, 50 m behind a lead car, on a 30 km section of motorway in normal traffic. During each trial the lead car started to decelerate at an average of 0.47 m/s2 while the participant either looked at the car in front (control), continuously dialed series of three random integers on a numeric keypad (divided visual attention), or performed a memory and addition task (non-visual attention). The results indicated that drivers' detection ability was impaired by about 0.5 s in terms of brake reaction time and almost 1 s in terms of time-to-collision, when they were doing the non-visual task whilst driving. This impairment was similar to when the drivers were dividing their visual attention between the road ahead and dialing numbers on the keypad. It was concluded that neither a hands-free option nor a voice controlled interface removes the safety problems associated with the use of mobile phones in a car.

Telerobotics, automation, and human supervisory control [Review] <=SEP=> In Telerobotics, Automation, and Human Supervisory Control, Thomas B. Sheridan shows that progress in robotics depends not only on change in technology, but also on advances in humans’ relationships to machines. Sheridan, Professor of Engineering and Applied Psychology at M.I.T., has spent decades studying human-machine relations. His idea of “human supervisory control” (just “supervisory control” for short) has the potential to bring robotics out of the laboratory and into the difficult and messy world. Traditionally, the public and researchers alike have focused on automation which seeks to build into a machine all necessary capabilities for achieving a particular task, including sensors, actuators, servos, and algorithms. In contrast to automatic control, supervisory control puts a human back “in the loop,” usually at the highest levels of abstraction, while maintaining lower-level functions within the machine. In a supervisory control system human and machine work together. The operator may intervene and operate manually in a particular situation, or she (Sheridan refers to the generic operator as female) might turn over control to an automatic controller for a time, acting as monitor of the task at hand. Typically the “system” (including the human) will operate somewhere on the spectrum between manual and automatic, dividing the task in different degrees depending on the situation. When the operator and the machine are not collocated but are connected by some communication channel, the system is said to be telerobotic. Determining the proper balance of man and machine, manual and automatic control, or providing tools to do so, is the goal of Sheridan’s book. An important modern example of a supervisory control system (although not a telerobotic one) is a modem aircraft. The pilot can command the flight surfaces directly and fly manually, or she can program an autopilot to fly a complete route, including nearly complete takeoff and landing. Typically, the pilot performs some

Internet Traffic Classification by Aggregating Correlated Naive Bayes Predictions <=SEP=> This paper presents a novel traffic classification scheme to improve classification performance when few training data are available. In the proposed scheme, traffic flows are described using the discretized statistical features and flow correlation information is modeled by bag-of-flow (BoF). We solve the BoF-based traffic classification in a classifier combination framework and theoretically analyze the performance benefit. Furthermore, a new BoF-based traffic classification method is proposed to aggregate the naive Bayes (NB) predictions of the correlated flows. We also present an analysis on prediction error sensitivity of the aggregation strategies. Finally, a large number of experiments are carried out on two large-scale real-world traffic datasets to evaluate the proposed scheme. The experimental results show that the proposed scheme can achieve much better classification performance than existing state-of-the-art traffic classification methods.

New relationships between breast microcalcifications and cancer <=SEP=> Background:Breast microcalcifications are key diagnostically significant radiological features for localisation of malignancy. This study explores the hypothesis that breast calcification composition is directly related to the local tissue pathological state.Methods:A total of 236 human breast calcifications from 110 patients were analysed by mid-Fouries transform infrared (FTIR) spectroscopy from three different pathology types (112 invasive carcinoma (IC), 64 in-situ carcinomas and 60 benign). The biochemical composition and the incorporation of carbonate into the hydroxyapatite lattice of the microcalcifications were studied by infrared microspectroscopy. This allowed the spectrally identified composition to be directly correlated with the histopathology grading of the surrounding tissue.Results:The carbonate content of breast microcalcifications was shown to significantly decrease when progressing from benign to malignant disease. In this study, we report significant correlations (P<0.001) between microcalcification chemical composition (carbonate content and protein matrix : mineral ratios) and distinct pathology grades (benign, in-situ carcinoma and ICs). Furthermore, a significant correlation (P<0.001) was observed between carbonate concentrations and carcinoma in-situ sub-grades. Using the two measures of pathology-specific calcification composition (carbonate content and protein matrix : mineral ratios) as the inputs to a two-metric discriminant model sensitivities of 79, 84 and 90% and specificities of 98, 82 and 96% were achieved for benign, ductal carcinoma in situ and invasive malignancies, respectively.Conclusions:We present the first demonstration of a direct link between the chemical nature of microcalcifications and the grade of the pathological breast disease. This suggests that microcalcifications have a significant association with cancer progression, and could be used for future objective analytical classification of breast pathology. A simple two-metric model has been demonstrated, more complex spectral analysis may yeild greater discrimination performance. Furthermore there appears to be a sequential progression of calcification composition.

Link prediction in complex networks: a local naïve Bayes model <=SEP=> Common-neighbor-based method is simple yet effective to predict missing links, which assume that two nodes are more likely to be connected if they have more common neighbors. In such method, each common neighbor of two nodes contributes equally to the connection likelihood. In this Letter, we argue that different common neighbors may play different roles and thus lead to different contributions, and propose a local näıve Bayes model accordingly. Extensive experiments were carried out on eight real networks. Compared with the common-neighbor-based methods, the present method can provide more accurate predictions. Finally, we gave a detailed case study on the US air transportation network. Introduction. – The problem of link prediction aims at estimating the likelihood of the existence of a link between two nodes in a given network, based on the observed links [1]. Recently, the study of link prediction has attracted much attention from disparate scientific communities. In the theoretical aspect, accurate prediction indeed gives evidence to some underlying mechanisms that drives the network evolution [2]. Moveover, it is very possible to build a fair evaluation platform for network modeling under the framework of link prediction, which might be interested by network scientists [1, 3]. In the practical aspect, for biological networks such as protein-protein interaction networks and metabolic networks [4–6], the experiments of uncovering the new links or interactions are costly, and thus to predict in advance and focus on the links most likely to exist can sharply reduce the experimental costs [7]. In addition, some of the representative methods of link prediction have been successfully applied to address the classification problem in partially labeled networks [8, 9], as well as identified the spurious links resulted from the inaccurate information in the data [10]. Motivated by the theoretical interests and practical significance, many methods for link predication have been proposed. Therein some algorithms are based on Markov chains [11–13] and machine learning [14, 15]. Another group of algorithms are based on node similarity [1, 16]. (a)Corresponding author:linyuan.lue@unifr.ch Common Neighbors (CN) is one of the simplest similarity indices. Empirically, Kossinets and Watts [17] analyzed a large-scale social network, suggesting that two students having many mutual friends are very probable to be friend in the future. Also in online society like Facebook, the users tend to be friend if they have common friends and therefore form a community. Extensive analysis on disparate networks suggests that CN index is of good performance on predicting the missing links [16, 18]. Lü et al. [19] suggested that in a network with large clustering coefficient, CN can provide competitively accurate predictions compared with the indices making use of global information. Very recently, Cui et al. [20] revealed that the nodes with more common neighbors are more likely to form new links in a growing network. The basic assumption of CN is that two nodes are more likely to be connected if they have more common neighbors. Simply counting the number of common neighbors indicates that each common neighbor gives equal contribution to the connection likelihood. However, sometimes different common neighbors may play different roles. For instance, the common close friends of two people who don’t know each other may contribute more to their possibly future friendship than their common nodding acquaintances. In this Letter, we propose a probabilistic model based on the Bayesian theory, called Local Näıve Bayes (LNB) model, to predict the missing links in complex networks. Based on the LNB model,

A Rank-Switching, Open-Row DRAM Controller for Time-Predictable Systems <=SEP=> We introduce ROC, a Rank-switching, Open-row Controller for Double Data Rate Dynamic RAM (DDR DRAM). ROC is optimized for mixed-criticality multicore systems using modern DDR devices: compared to existing real-time memory controllers, it provides significantly lower worst case latency bounds for hard real-time tasks and supports throughput-oriented optimizations for soft real-time applications. The key to improved performance is an innovative rank-switching mechanism which hides the latency of write-read transitions in DRAM devices without requiring unpredictable request reordering. We further employ open row policy to take advantage of the data caching mechanism (row buffering) in each device. ROC provides complete timing isolation between hard and soft tasks and allows for compositional timing analysis over the number of cores and memory ranks in the system. We implemented and synthesized the ROC back end in Verilog RTL, and evaluated its performance on both synthetic tasks and a set of representative benchmarks.

Interprofessional education: effects on professional practice and health care outcomes. <=SEP=> BACKGROUND
As patient care becomes more complex, effective collaboration between health and social care professionals is required. However, evidence suggests that these professionals do not collaborate well together. Interprofessional education (IPE) offers a possible way forward in this area.


OBJECTIVES
To assess the usefulness of IPE interventions compared to education in which the same professions were learning separately from one another.


SEARCH STRATEGY
We searched the Cochrane Effective Practice and Organisation of Care Group specialised register, MEDLINE (1968 to 1998) and Cinahl (1982 to 1998). We also hand searched the Journal of Interprofessional Care (1992 to 1998), the Centre for the Advancement of Interprofessional Education Bulletin (1987 to 1998), conference proceedings, the 'grey literature' held by relevant organisations, and reference lists of articles.


SELECTION CRITERIA
Randomised trials, controlled before and after studies and interrupted time series studies of IPE interventions designed to improve collaborative practice between health/social care practitioners and/or the health/well being of patients/clients. The participants included chiropodists/podiatrists, complementary therapists, dentists, dietitians, doctors/physicians, hygienists, psychologists, psychotherapists, midwives, nurses, pharmacists, physiotherapists, occupational therapists, radiographers, speech therapists and/or social workers. The outcomes included objectively measured or self reported (validated instrument) patient/client outcomes and reliable (objective or validated subjective) health care process measures.


DATA COLLECTION AND ANALYSIS
Two reviewers independently assessed the eligibility of potentially relevant studies.


MAIN RESULTS
The total yield from the search strategy was 1042, of which 89 were retained for further consideration. However none of these studies met the inclusion criteria.


REVIEWER'S CONCLUSIONS
Despite finding a large body of literature on the evaluation of IPE, these studies lacked the methodological rigour needed to begin to convincingly understand the impact of IPE on professional practice and/or health care outcomes.

Confidence-Based Data Association and Discriminative Deep Appearance Learning for Robust Online Multi-Object Tracking <=SEP=> Online multi-object tracking aims at estimating the tracks of multiple objects instantly with each incoming frame and the information provided up to the moment. It still remains a difficult problem in complex scenes, because of the large ambiguity in associating multiple objects in consecutive frames and the low discriminability between objects appearances. In this paper, we propose a robust online multi-object tracking method that can handle these difficulties effectively. We first define the tracklet confidence using the detectability and continuity of a tracklet, and decompose a multi-object tracking problem into small subproblems based on the tracklet confidence. We then solve the online multi-object tracking problem by associating tracklets and detections in different ways according to their confidence values. Based on this strategy, tracklets sequentially grow with online-provided detections, and fragmented tracklets are linked up with others without any iterative and expensive association steps. For more reliable association between tracklets and detections, we also propose a deep appearance learning method to learn a discriminative appearance model from large training datasets, since the conventional appearance learning methods do not provide rich representation that can distinguish multiple objects with large appearance variations. In addition, we combine online transfer learning for improving appearance discriminability by adapting the pre-trained deep model during online tracking. Experiments with challenging public datasets show distinct performance improvement over other state-of-the-arts batch and online tracking methods, and prove the effect and usefulness of the proposed methods for online multi-object tracking.

The Mini Nutritional Assessment (MNA) review of the literature--What does it tell us? <=SEP=> UNLABELLED
To review the literature on the MNA to Spring 2006, we searched MEDLINE, Web of Science and Scopus, and did a manual search in J Nutr Health Aging, Clin Nutr, Eur J Clin Nutr and free online available publications.


VALIDATION AND VALIDITY
The MNA was validated against two principal criteria, clinical status and comprehensive nutrition assessment using principal component and discriminant analysis. The MNA shortform (MNA-SF) was developed and validated to allow a 2-step screening process. The MNA and MNA-SF are sensitive, specific, and accurate in identifying nutrition risk.


NUTRITIONAL SCREENING
The prevalence of malnutrition in community-dwelling elderly (21 studies, n = 14149 elderly) is 2 +/- 0.1% (mean +/- SE, range 0- 8%) and risk of malnutrition is 24 +/- 0.4% (range 8-76%). A similar pattern is seen in out-patient and home care elderly (25 studies, n = 3119 elderly) with prevalence of undernutrition 9 +/- 0.5% (mean +/- SE, range 0-30%) and risk of malnutrition 45 +/- 0.9% (range 8-65%). A high prevalence of undernutrition has been reported in hospitalized and institutionalized elderly patients: prevalence of malnutrition is 23 +/- 0.5% (mean +/- SE, range 1- 74%) in hospitals (35 studies, n = 8596) and 21 +/- 0.5% (mean +/- SE, range 5-71%) in institutions (32 studies, n = 6821 elderly). An even higher prevalence of risk of malnutrition was observed in the same populations, with 46 +/- 0.5% (range 8-63%) and 51 +/- 0.6% (range 27-70%), respectively. In cognitively impaired elderly subjects (10 studies, n = 2051 elderly subjects), detection using the MNA, prevalence of malnutrition was 15 +/- 0.8% (mean +/- SE, range 0-62%), and 44 +/- 1.1% (range 19-87%) of risk of malnutrition.


CHARACTERISTICS
The large variability is due to differences in level of dependence and health status among the elderly. In hospital settings, a low MNA score is associated with an increase in mortality, prolonged length of stay and greater likelihood of discharge to nursing homes. Malnutrition is associated with functional and cognitive impairment and difficulties eating. The MNA(R) detects risk of malnutrition before severe change in weight or serum proteins occurs.


NUTRITIONAL INTERVENTION
Intervention studies demonstrate that timely intervention can stop weight loss in elderly at risk of malnutrition or undernourished and is associated with improvements in MNA scores. The MNA can also be used as a follow up assessment tool.


CONCLUSION
The MNA is a screening and assessment tool with a reliable scale and clearly defined thresholds, usable by health care professionals. It should be included in the geriatric assessment and is proposed in the minimum data set for nutritional interventions.

Examining students' online interaction in a live video streaming environment using data mining and text mining <=SEP=> 0747-5632/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.chb.2012.07.020 ⇑ Tel.: +1 757 683 5008; fax: +1 757 683 5639. E-mail address: whe@odu.edu This study analyses the online questions and chat messages automatically recorded by a live video streaming (LVS) system using data mining and text mining techniques. We apply data mining and text mining techniques to analyze two different datasets and then conducted an in-depth correlation analysis for two educational courses with the most online questions and chat messages respectively. The study found the discrepancies as well as similarities in the students’ patterns and themes of participation between online questions (student–instructor interaction) and online chat messages (student–students interaction or peer interaction). The results also identify disciplinary differences in students’ online participation. A correlation is found between the number of online questions students asked and students’ final grades. The data suggests that a combination of using data mining and text mining techniques for a large amount of online learning data can yield considerable insights and reveal valuable patterns in students’ learning behaviors. Limitations with data and text mining were also revealed and discussed in the paper. 2012 Elsevier Ltd. All rights reserved.

Learning to Detect Human-Object Interactions <=SEP=> We study the problem of detecting human-object interactions (HOI) in static images, defined as predicting a human and an object bounding box with an interaction class label that connects them. HOI detection is a fundamental problem in computer vision as it provides semantic information about the interactions among the detected objects. We introduce HICO-DET, a new large benchmark for HOI detection, by augmenting the current HICO classification benchmark with instance annotations. To solve the task, we propose Human-Object Region-based Convolutional Neural Networks (HO-RCNN). At the core of our HO-RCNN is the Interaction Pattern, a novel DNN input that characterizes the spatial relations between two bounding boxes. Experiments on HICO-DET demonstrate that our HO-RCNN, by exploiting human-object spatial relations through Interaction Patterns, significantly improves the performance of HOI detection over baseline approaches.

Biohashing: two factor authentication featuring fingerprint data and tokenised random number <=SEP=> Human authentication is the security task whose job is to limit access to physical locations or computer network only to those with authorisation. This is done by equipped authorised users with passwords, tokens or using their biometrics. Unfortunately, the first two suffer a lack of security as they are easy being forgotten and stolen; even biometrics also suffers from some inherent limitation and specific security threats. A more practical approach is to combine two or more factor authenticator to reap benefits in security or convenient or both. This paper proposed a novel two factor authenticator based on iterated inner products between tokenised pseudo-random number and the user specific fingerprint feature, which generated from the integrated wavelet and Fourier–Mellin transform, and hence produce a set of user specific compact code that coined as BioHashing. BioHashing highly tolerant of data capture offsets, with same user fingerprint data resulting in highly correlated bitstrings. Moreover, there is no deterministic way to get the user specific code without having both token with random data and user fingerprint feature. This would protect us for instance against biometric fabrication by changing the user specific credential, is as simple as changing the token containing the random data. The BioHashing has significant functional advantages over solely biometrics i.e. zero equal error rate point and clean separation of the genuine and imposter populations, thereby allowing elimination of false accept rates without suffering from increased occurrence of false reject rates. 2004 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

A weighted additive fuzzy programming approach for multi-criteria supplier selection <=SEP=> In supply chain management, to build strategic and strong relationships, firms should select best suppliers by applying appropriate method and selection criteria. In this paper, to handle ambiguity and fuzziness in supplier selection problem effectively, a new weighted additive fuzzy programming approach is developed. Firstly, linguistic values expressed as trapezoidal fuzzy numbers are used to assess the weights of the factors. By applying the distances of each factor between Fuzzy Positive Ideal Rating and Fuzzy Negative Ideal Rating, weights are obtained. Then applying suppliers’ constraints, goals and weights of the factors, a fuzzy multi-objective linear model is developed to overcome the selection problem and assign optimum order quantities to each supplier. The proposed model is explained by a numerical example. 2010 Elsevier Ltd. All rights reserved.

Artificial Neural Networks architectures for stock price prediction: comparisons and applications <=SEP=> We present an Artificial Neural Network (ANN) approach to predict stock market indices, particularly with respect to the forecast of their trend movements up or down. Exploiting different Neural Networks architectures, we provide numerical analysis of concrete financial time series. In particular, after a brief résumé of the existing literature on the subject, we consider the Multi-layer Perceptron (MLP), the Convolutional Neural Networks (CNN), and the Long Short-Term Memory (LSTM) recurrent neural networks techniques. We focus on the importance of choosing the correct input features, along with their preprocessing, for the specific learning algorithm one wants to use. Eventually, we consider the S&P500 historical time series, predicting trend on the basis of data from the past days, and proposing a novel approach based on combination of wavelets and CNN, which outperforms the basic neural networks ones. We show, that neural networks are able to predict financial time series movements even trained only on plain time series data and propose more ways to improve results. Key–Words: Artificial neural networks, Multi-layer neural network, Convolutional neural network, Long shortterm memory, Recurrent neural network, Deep Learning, Stock markets analysis, Time series analysis, financial forecasting

MIR_EVAL: A Transparent Implementation of Common MIR Metrics <=SEP=> Central to the field of MIR research is the evaluation of algorithms used to extract information from music data. We present mir_eval, an open source software library which provides a transparent and easy-to-use implementation of the most common metrics used to measure the performance of MIR algorithms. In this paper, we enumerate the metrics implemented by mir_eval and quantitatively compare each to existing implementations. When the scores reported by mir_eval differ substantially from the reference, we detail the differences in implementation. We also provide a brief overview of mir_eval’s architecture, design, and intended use. 1. EVALUATING MIR ALGORITHMS Much of the research in Music Information Retrieval (MIR) involves the development of systems that process raw music data to produce semantic information. The goal of these systems is frequently defined as attempting to duplicate the performance of a human listener given the same task [5]. A natural way to determine a system’s effectiveness might be for a human to study the output produced by the system and judge its correctness. However, this would yield only subjective ratings, and would also be extremely timeconsuming when evaluating a system’s output over a large corpus of music. Instead, objective metrics are developed to provide a well-defined way of computing a score which indicates each system’s output’s correctness. These metrics typically involve a heuristically-motivated comparison of the system’s output to a reference which is known to be correct. Over time, certain metrics have become standard for each ∗Please direct correspondence to craffel@gmail.com c © Colin Raffel, Brian McFee, Eric J. Humphrey, Justin Salamon, Oriol Nieto, Dawen Liang, Daniel P. W. Ellis. Licensed under a Creative Commons Attribution 4.0 International License (CC BY 4.0). Attribution: Colin Raffel, Brian McFee, Eric J. Humphrey, Justin Salamon, Oriol Nieto, Dawen Liang, Daniel P. W. Ellis.

Fuzzy Cognitive Map software <=SEP=> Fuzzy Cognitive Map (FCM) is a soft computing modelling methodology for complex systems. Beyond the mathematical formulation of the FCM theory, there was a need of developing a software tool to facilitate the implementation of FCMs. This paper describes the use of a software tool that was developed to construct FCM models. Some theoretical elements of Fuzzy Cognitive Maps are presented. Then, it is discussed how the software tool is used to develop a model and simulate the use of Fuzzy Cognitive Maps. The user interface of the software tool is described and how the FCM-Analyst is used to facilitate the implementation and simulation of Fuzzy Cognitive Maps.

In the mood: engaging teenagers in psychotherapy using mobile phones <=SEP=> Mental illness is a significant and growing problem throughout the world. Many mental health problems have their root in childhood, and early intervention is recommended. Engaging young people in psychotherapeutic activities is challenging, and treatment adherence is often poor. This paper presents a series of studies carried out as part of the development of a mobile and online symptom tracking tool for adolescents with mental health problems. Teenagers use the system to record symptoms on their mobile phones and can view this information in a clinical setting with a therapist. We focus on a clinical pilot of the system with ten users in public mental health clinics. As well as indicating that the mobile diary tool can increase client adherence to therapeutic activities, the study yields insight into the factors influencing the success of the design and informs the design of other systems to be used as adjuncts to therapy.

Perspectives on Live Streaming: Apps, Users, and Research <=SEP=> The emergence of mobile live streaming as a popular app over the past couple years provides a new platform for socio-technical interaction in the world. This panel brings together several different perspectives on live streaming: companies who are producing commercial apps, researchers studying how people are using live streaming, and users. We hope the discussion identifies design and research implications for the future.

Lightweight Management of Resource-Constrained Sensor Devices in Internet of Things <=SEP=> It is predicted that billions of intelligent devices and networks, such as wireless sensor networks (WSNs), will not be isolated but connected and integrated with computer networks in future Internet of Things (IoT). In order to well maintain those sensor devices, it is often necessary to evolve devices to function correctly by allowing device management (DM) entities to remotely monitor and control devices without consuming significant resources. In this paper, we propose a lightweight RESTful Web service (WS) approach to enable device management of wireless sensor devices. Specifically, motivated by the recent development of IPv6-based open standards for accessing wireless resource-constrained networks, we consider to implement IPv6 over low-power wireless personal area network (6LoWPAN)/routing protocol for low power and lossy network (RPL)/constrained application protocol (CoAP) protocols on sensor devices and propose a CoAP-based DM solution to allow easy access and management of IPv6 sensor devices. By developing a prototype cloud system, we successfully demonstrate the proposed solution in efficient and effective management of wireless sensor devices.

2011 terminology of the vulva of the International Federation for Cervical Pathology and Colposcopy. <=SEP=> OBJECTIVE
This study aimed to present the clinical and colposcopic terminology of the vulva (including the anus) of the International Federation of Cervical Pathology and Colposcopy.


MATERIALS AND METHODS
The terminology has been developed by the International Federation of Cervical Pathology and Colposcopy Nomenclature Committee during 2009-2011.


RESULTS
The terminology is part of a comprehensive terminology of the lower genital tract, allowing for standardization of nomenclature by colposcopists, clinicians, and researchers taking care of women with lesions in these areas. The terminology includes basic definitions and normal findings that are important for the clinician lacking experience with management of vulvar disease. This terminology introduces definitions for abnormal findings recently accepted by the International Society for the Study of Vulvovaginal Disease and includes patterns to identify malignancy.


CONCLUSIONS
The terminology differs from past terminologies in that it includes colposcopic patterns and anal colposcopy. Nevertheless, the role of the colposcope in the management of vulvar disease is limited.