snu-aidas/HVMap-dataset huggingface dataset:
Combining multispectral aerial imagery and digital surface models to extract urban buildings

This paper presents an automated classification of buildings in Coleraine, Northern Ireland. The classification was generated using very high spatial resolution data (10 cm) from a Digital Mapping Camera (DMC) for March 2009. The visible to near infrared (VNIR) bands of the DMC enabled a supervised classification to be performed to extract buildings from vegetation. A Digital Surface Model (DSM) was also created from the image to differentiate between buildings and other land classes with similar spectral profiles, such as roads. The supervised classification had the lowest classification accuracy (50%) while the DSM had an accuracy of 81%. The combination of the DSM and the supervised classification achieved an overall classification accuracy of 95%. Two spatial metrics (percentage of the landscape and number of patches) were also used to test the level of agreement between the classification and digitised building data. The results suggest that fine resolution multispectral aerial imagery can automatically detect buildings to a very high level of accuracy. Current space borne sensors, such as IKONOS and QuickBird, lag behind airborne sensors with VNIR bands provided at a much coarser spatial resolution (4m and 2.4m respectively). Techniques must be developed from current airborne sensors that can be applied to new space borne sensors in the future. The ability to generate DSMs from high resolution aerial imagery will afford new insights into the three-dimensional aspects of urban areas which will in turn inform future urban planning. (Received 19th August 2010; Revised 26th January 2011; Accepted 9th February 2011) ISSN 1744-5647 doi:10.4113/jom.2011.1152 51 Journal of Maps, 2011, 51-59 McNally, A.J.D. & McKenzie, S.J.P.
Bugs as deviant behavior: a general approach to inferring errors in systems code

A major obstacle to finding program errors in a real system is knowing what correctness rules the system must obey. These rules are often undocumented or specified in an ad hoc manner. This paper demonstrates techniques that automatically extract such checking information from the source code itself, rather than the programmer, thereby avoiding the need for a priori knowledge of system rules. The cornerstone of our approach is inferring programmer “beliefs” that we then cross-check for contradictions. Beliefs are facts implied by code: a dereference of a pointer, p, implies a belief that p is non-null, a call to “unlock(l)” implies that l was locked, etc. For beliefs we know the programmer must hold, such as the pointer dereference above, we immediately flag contradictions as errors. For beliefs that the programmer may hold, we can assume these beliefs hold and use a statistical analysis to rank the resulting errors from most to least likely. For example, a call to “spin lock” followed once by a call to “spin unlock” implies that the programmer may have paired these calls by coincidence. If the pairing happens 999 out of 1000 times, though, then it is probably a valid belief and the sole deviation a probable error. The key feature of this approach is that it requires no a priori knowledge of truth: if two beliefs contradict, we know that one is an error without knowing what the correct belief is. Conceptually, our checkers extract beliefs by tailoring rule “templates” to a system – for example, finding all functions that fit the rule template “<a> must be paired with <b>.” We have developed six checkers that follow this conceptual framework. They find hundreds of bugs in real systems such as Linux and OpenBSD. From our experience, they give a dramatic reduction in the manual effort needed to check a large system. Compared to our previous work [9], these template checkers find ten to one hundred times more rule instances and derive properties we found impractical to specify manually.
A SELF-RATING DEPRESSION SCALE.
A Review of Window Query Processing for Data Streams

In recent years, progress in hardware technology has resulted in the possibility of monitoring many events in real time. The volume of incoming data may be so large, that monitoring all individual data might be intractable. Revisiting any particular record can also be impossible in this environment. Therefore, many database schemes, such as aggregation, join, frequent pattern mining, and indexing, become more challenging in this context. This paper surveys the previous efforts to resolve these issues in processing data streams. The emphasis is on specifying and processing sliding window queries, which are supported in many stream processing engines. We also review the related work on stream query processing, including synopsis structures, plan sharing, operator scheduling, load shedding, and disorder control. Category: Ubiquitous computing
Exploring the factors associated with Web site success in the context of electronic commerce

Web sites are being widely deployed commercially. As the widespread use and dependency on Web technology increases, so does the need to assess factors associated with Web site success. The objective is to explore these factors in the context of electronic commerce (EC). The research framework was derived from information systems and marketing literature. Webmasters from Fortune 1000 companies were used as the target group for a survey. Four factors that are critical to Web site success in EC were identi®ed: (1) information and service quality, (2) system use, (3) playfulness, and (4) system design quality. An analysis of the data provides valuable managerial implications for Web site success in the context of electronic commerce. # 2000 Elsevier Science B.V. All rights reserved.
Web Site Usability, Design, and Performance Metrics

Websites provide the key interface for consumer use of the Internet. This research reports on a series of three studies that develop and validate Web site usability, design and performance metrics, including download delay, navigability, site content, interactivity, and responsiveness. The performance metric that was developed includes the subconstructs user satisfaction, the likelihood of return, and the frequency of use. Data was collected in 1997, 1999, and 2000 from corporate Web sites via three methods, namely, a jury, third-party ratings, and a software agent. Significant associations betweenWeb site design elements and Web site performance indicate that the constructs demonstrate good nomological validity. Together, the three studies provide a set of measures with acceptable validity and reliability. The findings also suggest lack of significant common methods biases across the jury-collected data, third-party data, and agent-collected data. Results suggest that Web site success is a first-order construct. Moreover, Web site success is significantly associated with Web site download delay (speed of access and display rate within the Web site), navigation (organization, arrangement, layout, and sequencing), content (amount and variety of product information), interactivity (customization and interactivity), and responsiveness (feedback options and FAQs). (e-Commerce, Web Metrics, or Measurement;Web Site Usability;Design and Performance Constructs; Construct Validity; Nomological Validity)
Screening for trisomy 18 by maternal age, fetal nuchal translucency, free beta-human chorionic gonadotropin and pregnancy-associated plasma protein-A.

OBJECTIVES
To derive a model and examine the performance of first-trimester screening for trisomy 18 by maternal age, fetal nuchal translucency (NT) thickness, and maternal serum free beta-human chorionic gonadotropin (beta-hCG) and pregnancy-associated plasma protein-A (PAPP-A).


METHODS
Prospective combined screening for trisomy 21 was performed at 11 + 0 to 13 + 6 weeks in 56 893 singleton pregnancies, including 56 376 cases of euploid fetuses, 395 with trisomy 21 and 122 with trisomy 18. The measured free beta-hCG and PAPP-A were converted into a multiple of the median (MoM) and then into likelihood ratios (LR). Similarly, the measured NT was transformed into LRs using the mixture model of NT distributions. In each case the LRs for NT and the biochemical markers were multiplied by the age and gestation-related risk to derive the risk for trisomy 21 and trisomy 18. Detection rates (DRs) and false-positive rates (FPRs) were calculated by taking the proportions with risks above a given risk threshold.


RESULTS
In screening with the algorithm for trisomy 21, at a FPR of 3%, the estimated DRs of trisomies 21 and 18 were 89% and 82%, respectively. The use of an algorithm for trisomy 18 identified 93% of affected fetuses at a FPR of 0.2%. When the algorithm for trisomy 21 was used and screen positivity was fixed at a FPR of 3%, and in addition the algorithm for trisomy 18 was used and screen positivity was fixed at a FPR of 0.2%, the overall FPR was 3.1% and the DRs of trisomies 21 and 18 were 90% and 97%, respectively.


CONCLUSIONS
A beneficial side effect of first-trimester combined screening for trisomy 21 is the detection of a high proportion of fetuses with trisomy 18. If an algorithm for trisomy 18 in addition to the one for trisomy 21 is used, more than 95% of trisomy 18 fetuses can be detected with a minor increase of 0.1% in the overall FPR.
Education, Signaling and Mismatch

We assess the importance education as a signal of workersskills and the e¤ects of poor signaling quality on labor market outcomes. We do so by merging a frictional labor market model with a signaling setup where there is a privately observed idiosyncratic component in the cost of education. Given that highly skilled workers cannot correctly signal their abilities, their wages will be lower and they will not be matched to the "right" vacancies, or may be unemployed. Skilled workers will then have lower incentives to move to high productivity markets. Furthermore, fewer vacancies will be created in labor markets where skills matter, and incentives for workers to invest in education will be lower. Overall, an economy where education is a noisier signal generates lower educational attainment, higher unemployment and lower productivity. In addition, we provide evidence suggesting that education plays a poor signaling role in Latin American countries. We then calibrate our model using Peruvian data, and through a quantitative exercise we show that this mechanism could be relevant to explain the relatively bad performance of labor markets in Latin American countries. 1E-mail: larozamena@utdt.edu, hru¤o@utdt.edu. We are grateful to Fernando Álvarez Parra for his comments and suggestions.
Attribute bagging: improving accuracy of classifier ensembles by using random feature subsets

We present attribute bagging (AB), a technique for improving the accuracy and stability of classi#er ensembles induced using random subsets of features. AB is a wrapper method that can be used with any learning algorithm. It establishes an appropriate attribute subset size and then randomly selects subsets of features, creating projections of the training set on which the ensemble classi#ers are built. The induced classi#ers are then used for voting. This article compares the performance of our AB method with bagging and other algorithms on a hand-pose recognition dataset. It is shown that AB gives consistently better results than bagging, both in accuracy and stability. The performance of ensemble voting in bagging and the AB method as a function of the attribute subset size and the number of voters for both weighted and unweighted voting is tested and discussed. We also demonstrate that ranking the attribute subsets by their classi#cation accuracy and voting using only the best subsets further improves the resulting performance of the ensemble. ? 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
Effects of small-sided games on physical conditioning and performance in young soccer players.

The purpose of this study was to examine, first, the movement actions performed during two different small-sided games and, second, their effects on a series of field endurance and technical tests. Thirty-four young soccer players (age: 13 ± 0.9 yrs; body mass: 62.3 ± 15.1 kg; height: 1.65 ± 0.06 m) participated in the study. Small-sided games included three-a-side (3 versus 3 players) and six-a-side (6 versus 6 players) games consisting of 10 bouts of 4 min duration with 3 min active recovery between bouts. Soccer player performance was evaluated using five field tests: a) 30m sprint, b) throw-in for distance, c) Illinois Agility Test, d) dribbling the ball and e) horizontal jump before, in the middle and after the implementation of both game situations. Heart rate was monitored during the entire testing session. Each game was also filmed to measure soccer movements within the game. The ANOVA analysis indicated that the three-a- side games displayed significantly higher heart rate values compared with the six-a-side games (p < 0.05). The number of short passes, kicks, tackles, dribbles and scoring goals were significantly higher during the three-a-side compared with the six-a-side game condition (p < 0. 05) while players performed more long passes and headed the ball more often during the six-a-side (p < 0.05). After the three-a-side games, there was a significant decline in sprint and agility performance (p < 0.05), while after both game conditions significant alterations in the throw-in and the horizontal jump performance were observed (p < 0.05). The results of the present study indicated that three-a-side games provide higher stimulus for physical conditioning and technical improvement than six-a-side games and their use for training young soccer players is recommended. Key pointsThree-a-side games display higher HR compared with six-a-side games.In the three-a-side games players performed more short passes, kicks, dribbles, tackles and scored more goals compared with the six-a-side games.Impairment in endurance and field test performance was observed mainly after three-a-side games.The use of the three-a-side games to develop physical fitness and technique in young soccer players is recommended.
A review of soft computing applications in supply chain management

It is broadly recognised by global companies that supply chain management is one of the major core competencies for an organisation to compete in the marketplace. Organisational strategies are mainly concentrated on improvement of customer service levels as well as reduction of operational costs in order to maintain profit margins. Therefore supply chain performance has attracted researchers’ attention. A variety of soft computing techniques including fuzzy logic and genetic algorithms have been employed to improve effectiveness and efficiency in various aspects of supply chain management. Meanwhile, an increasing number of papers have been published to address related issues. The aim of this paper is to summarise the findings by a systematic review of existing research papers concerning the application of soft computing techniques to supply chain management. Some areas in supply chain management that have rarely been exposed in existing papers, such as customer relationship management and reverse logistics, are therefore suggested for future research. 2009 Elsevier B.V. All rights reserved.
Natural language Interface for Database: A Brief review

Information is playing an important role in our lives. One of the major sources of information is databases. Databases and database technology are having major impact on the growing use of computers. Almost all IT applications are storing and retrieving information from databases. Retrieving information database requires knowledge of database languages like SQL. The Structured Query Language (SQL) norms are been pursued in almost all languages for relational database systems. However, not everybody is able to write SQL queries as they may not be aware of the structure of the database. So this has led to the development of Intelligent Database System ( IDBS) . There is an overwhelming need for non-expert users to query relational databases in their natural language instead of working with the values of the attributes. As a result many intelligent natural language interfaces to databases have been developed, which provides flexible options for manipulating queries. The idea of using Natural Language instead of SQL has prompted the development of new type of processing called Natural language Interface to Database. NLIDB is a step towards the development of intelligent database systems (IDBS) to enhance the users in performing flexible querying in databases. This paper is an introduction to Intelligent Database System and Natural Language Interface to Databases. Then a brief overview of NLIDB subcomponents is given and then discussion then moves on to NLIDB architectures and various approaches for the development of NLIDB systems.
Out-of-bag Estimation

In bagging, predictors are constructed using bootstrap samples from the training set and then aggregated to form a bagged predictor. Each bootstrap sample leaves out about 37% of the examples. These left-out examples can be used to form accurate estimates of important quantities. For instance, they can be used to give much improved estimates of node probabilities and node error rates in decision trees. Using estimated outputs instead of the observed outputs improves accuracy in regression trees. They can also be used to give nearly optimal estimates of generalization errors for bagged predictors. Introduction: We assume that there is a training set T= {(y n ,x n), n=1, ... ,N} and a method for constructing a predictor Q(x,T) using the given training set. The output variable y can either be a class label (classification) or numerical (regression). In bagging (Breiman[1996a]) a sequence of training sets T B,1 , ... , T B,K are generated of the same size as T by bootstrap selection from T. Then K predictors are constructed such that the kth predictor Q(x,T k,B) is based on the kth bootstrap training set. It was shown that if these predictors are aggregated-averaging in regression or voting in classification, then the resultant predictor can be considerably more accurate than the original predictor.
Intelligent Human Robot Interaction (iHRI)
Bartender: a fast and accurate clustering algorithm to count barcode reads

Motivation
Barcode sequencing (bar-seq) is a high-throughput, and cost effective method to assay large numbers of cell lineages or genotypes in complex cell pools. Because of its advantages, applications for bar-seq are quickly growing-from using neutral random barcodes to study the evolution of microbes or cancer, to using pseudo-barcodes, such as shRNAs or sgRNAs to simultaneously screen large numbers of cell perturbations. However, the computational pipelines for bar-seq clustering are not well developed. Available methods often yield a high frequency of under-clustering artifacts that result in spurious barcodes, or over-clustering artifacts that group distinct barcodes together. Here, we developed Bartender, an accurate clustering algorithm to detect barcodes and their abundances from raw next-generation sequencing data.


Results
In contrast with existing methods that cluster based on sequence similarity alone, Bartender uses a modified two-sample proportion test that also considers cluster size. This modification results in higher accuracy and lower rates of under- and over-clustering artifacts. Additionally, Bartender includes unique molecular identifier handling and a 'multiple time point' mode that matches barcode clusters between different clustering runs for seamless handling of time course data. Bartender is a set of simple-to-use command line tools that can be performed on a laptop at comparable run times to existing methods.


Availability and implementation
Bartender is available at no charge for non-commercial use at https://github.com/LaoZZZZZ/bartender-1.1.


Contact
sasha.levy@stonybrook.edu or song.wu@stonybrook.edu.


Supplementary information
Supplementary data are available at Bioinformatics online.
Data-intensive applications, challenges, techniques and technologies: A survey on Big Data

It is already true that Big Data has drawn huge attention from researchers in information sciences, policy and decision makers in governments and enterprises. As the speed of information growth exceeds Moore’s Law at the beginning of this new century, excessive data is making great troubles to human beings. However, there are so much potential and highly useful values hidden in the huge volume of data. A new scientific paradigm is born as dataintensive scientific discovery (DISD), also known as Big Data problems. A large number of fields and sectors, ranging from economic and business activities to public administration, from national security to scientific researches in many areas, involve with Big Data problems. On the one hand, Big Data is extremely valuable to produce productivity in businesses and evolutionary breakthroughs in scientific disciplines, which give us a lot of opportunities to make great progresses in many fields. There is no doubt that the future competitions in business productivity and technologies will surely converge into the Big Data explorations. On the other hand, Big Data also arises with many challenges, such as difficulties in data capture, data storage, data analysis and data visualization. This paper is aimed to demonstrate a close-up view about Big Data, including Big Data applications, Big Data opportunities and challenges, as well as the state-of-the-art techniques and technologies we currently adopt to deal with the Big Data problems. We also discuss several underlying methodologies to handle the data deluge, for example, granular computing, cloud computing, bio-inspired computing, and quantum computing. 2014 Elsevier Inc. All rights reserved.
Privacy-preserving trajectory data publishing by local suppression

The pervasiveness of location-aware devices has spawned extensive research in trajectory data mining, resulting in many important real-life applications. Yet, the privacy issue in sharing trajectory data among different parties often creates an obstacle for effective data mining. In this paper, we study the challenges of anonymizing trajectory data: high dimensionality, sparseness, and sequentiality. Employing traditional privacy models and anonymization methods often leads to low data utility in the resulting data and ineffective data mining. In addressing these challenges, this is the first paper to introduce local suppression to achieve a tailored privacy model for trajectory data anonymization. The framework allows the adoption of various data utility metrics for different data mining tasks. As an illustration, we aim at preserving both instances of location-time doublets and frequent sequences in a trajectory database, both being the foundation of many trajectory data ∗Corresponding author Email addresses: ru_che@encs.concordia.ca (Rui Chen), fung@ciise.concordia.ca (Benjamin C. M. Fung), no_moham@encs.concordia.ca (Noman Mohammed), bcdesai@cs.concordia.ca (Bipin C. Desai) Preprint submitted to Information Sciences April 10, 2011 mining tasks. Our experiments on both synthetic and real-life data sets suggest that the framework is effective and efficient to overcome the challenges in trajectory data anonymization. In particular, compared with the previous works in the literature, our proposed local suppression method can significantly improve the data utility in anonymous trajectory data.