snu-aidas/HVMap-dataset huggingface dataset:
River flow estimation using adaptive neuro fuzzy inference system

Accurate estimation of River flow changes is a quite important problem for a wise and sustainable use. Such a problem is crucial to the works and decisions related to the water resources and management. In this study, an adaptive network-based fuzzy inference system (ANFIS) approach was used to construct a River flow forecasting system. In particular, the applicability of ANFIS as an estimation model for River flow was investigated. To illustrate the applicability and capability of the ANFIS, the River Great Menderes, located the west of Turkey and the most important water resource of Great Menderes Catchment’s, was chosen as a case study area. The advantage of this method is that it uses the input–output data sets. Totally 5844 daily data sets collected in 1985–2000 years were used to estimate the River flow. The models having various input structures were constructed and the best structure was investigated. In addition four various training/testing data sets were constructed by cross validation methods and the best data set was investigated. The performance of the ANFIS models in training and testing sets were compared with the observations and also evaluated. The results indicated that the ANFIS can be applied successfully and provide high accuracy and reliability for River flow estimation. © 2006 IMACS. Published by Elsevier B.V. All rights reserved.
Example-Based Super-Resolution

Image-based models for computer graphics lack resolution independence: they cannot be zoomed much beyond the pixel resolution they were sampled at without a degradation of quality. Interpolating images usually results in a blurring of edges and image details. We describe image interpolation algorithms which use a database of training images to create plausible high-frequency details in zoomed images. Image pre-processing steps allow the use of image detail from regions of the training images which may look quite di erent from the image to be processed. These methods preserve ne details, such as edges, generate believable textures, and can give good results even after zooming multiple octaves. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole or in part without payment of fee is granted for nonpro t educational and research purposes provided that all such whole or partial copies include the following: a notice that such copying is by permission of Mitsubishi Electric Information Technology Center America; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright notice. Copying, reproduction, or republishing for any other purpose shall require a license with payment of fee to Mitsubishi Electric Information Technology Center America. All rights reserved. Copyright c Mitsubishi Electric Information Technology Center America, 2001 201 Broadway, Cambridge, Massachusetts 02139 1. First printing, TR2001-30, August, 2001. Egon Pasztor's present address: MIT Media Lab 20 Ames St. Cambridge, MA 02139 Example-based Super-resolution William T. Freeman, Thouis R. Jones, Egon C. Pasztor MitsubishiElectricResearchLaboratories(MERL) 201Broadway Cambridge,MA 02139 (a) (b) Figure 1: An object modelledby traditionalpolygon techniques may lack someof the richnessof real-world objects,but behaves properlyunderzooming,(b).
Lean, six sigma and lean sigma: fads or real process improvement methods?

Purpose – The purpose of this paper is to explore if six sigma and lean are new methods, or if they are repackaged versions of previously popular methods – total quality management (TQM) and just-in-time (JIT). Design/methodology/approach – The study is based on a critical comparison of lean with JIT and six sigma with TQM, a study of the measure of the publication frequency – the number of academic articles published every year of the previous 30 years – for each topic, and a review of critical success factors (CSF) for change efforts. Findings – The more recent concepts of lean and six sigma have mainly replaced – but not necessarily added to – the concepts of JIT and TQM. lean and six sigma are essentially repackaged versions of the former, and the methods seem to follow the fad (product) life cycle. The literature offers fairly similar and rather general CSF for these methods, e.g. top management support and the importance of communication and information. What seems to be missing, however, is the need for a systemic approach to organizational change and improvement. Practical implications – A prediction is, given the fad or product life cycle phenomenon, that there will be a new method promoted soon, something perhaps already experienced with the borderline preposterous concept of lean six sigma. On the other hand, based on the gap in time between both JIT and lean, and TQM and six sigma – a gap filled by BRP/reengineering – the next method will be process oriented. This paper concludes with the discussion of the need for a process-based approach to organizational improvement efforts. Originality/value – This paper is of value in that it analyzes what lessons can be learnt from organizational change and improvement efforts. The analysis includes a comparison of CSF for any change project before discussing the need for a process (systems) perspective for successful organizational improvement efforts.
A Scalable Framework for Spatiotemporal Analysis of Location-based Social Media Data

In the past several years, social media (e.g., Twitter and Facebook) has been experiencing a spectacular rise and popularity, and becoming a ubiquitous discourse for content sharing and social networking. With the widespread of mobile devices and location-based services, social media typically allows users to share whereabouts of daily activities (e.g., check-ins and taking photos), and thus strengthens the roles of social media as a proxy to understand human behaviors and complex social dynamics in geographic spaces. Unlike conventional spatiotemporal data, this new modality of data is dynamic, massive, and typically represented in stream of unstructured media (e.g., texts and photos), which pose fundamental representation, modeling and computational challenges to conventional spatiotemporal analysis and geographic information science. In this paper, we describe a scalable computational framework to harness massive location-based social media data for efficient and systematic spatiotemporal data analysis. Within this framework, the concept of space-time trajectories (or paths) is applied to represent activity profiles of social media users. A hierarchical spatiotemporal data model, namely a spatiotemporal data cube model, is developed based on collections of space-time trajectories to represent the collective dynamics of social media users across aggregation boundaries at multiple spatiotemporal scales. The framework is implemented based upon a public data stream of Twitter feeds posted on the continent of North America. To demonstrate the advantages and performance of this framework, an interactive flow mapping interface (including both single-source and multiple-source flow mapping) is developed to allow real-time, and interactive visual exploration of movement dynamics in massive location-based social media at multiple scales. ∗Corresponding author Preprint submitted to Computers, Enviroment and Urban Systems September 10, 2014 ar X iv :1 40 9. 28 26 v1 [ cs .S I] 8 S ep 2 01 4
Speedy bus mastering PCI express

PCI Express is a ubiquitous bus interface providing the highest bandwidth connection in the PC platform. Sadly, support for it in FPGAs is limited and/or expensive. The Speedy PCIe core addresses this problem by bridging the gap from the bare bones interface to a user friendly, high performance design. This paper describes some of the fundamental design challenges and how they were addressed as well as giving detailed results. The hardware and software source code are available for free download from [12].
Has the Internet become indispensable?

As was empirically demonstrated in [3], “the adoption rate of the Internet has exceeded that of earlier mass communication technologies by several magnitudes,” making it an “irreversible” innovation. Studies have also shown that for the generation of U.S.-based youth that grew up with the Internet, it is gradually displacing television as their main source of entertainment, communication, and education [6]. Here, we explore how the Internet has become indispensable to people in their daily lives and develop a conceptual model allowing us to address the associated research questions. The idea is that the Internet has become so embedded in the daily fabric of people’s lives that they simply cannot live without it. How is the Internet indispensable and in what ways? For which groups of people is it indispensable, for what tasks, and how has BY DONNA L. HOFFMAN, THOMAS P. NOVAK, AND ALLADI VENKATESH
Continuous deployment of software intensive products and services: A systematic mapping study

BACKGROUND The software intensive industry is moving towards the adoption of a value-driven and adaptive real-time business paradigm. The traditional view of software as an item that evolves through releases every few months is being replaced by continuous evolution of software functionality. OBJECTIVE This study aims to classify and analyse literature related to continuous deployment in the software domain in order to scope the phenomenon, provide an overview of its state-of-the-art, investigate the scientific evidence in the reported results and identify areas that are suitable for further research. METHOD We conducted a systematic mapping study and classified the continuous deployment literature. The benefits and challenges related to continuous deployment were also analyzed. RESULTS The systematic mapping study includes 50 primary studies published between 2001 and 2014. An in-depth analysis of the primary studies revealed ten recurrent themes that characterize continuous deployment and provide researchers with directions for future work. In addition, a set of benefits and challenges of which practitioners may take advantage were identified. CONCLUSION Overall, although the topic area is very promising, it is still in its infancy, thus offering a plethora of new opportunities for both researchers and software intensive companies.
On the journey to continuous deployment: Technical and social challenges along the way

Context: Continuous deployment (CD) is an emerging software development process with organisations such as Facebook, Microsoft, and IBM successfully implementing and using the process. The CD process aims to immediately deploy software to customers as soon as new code is developed, and can result in a number of benefits for organizations, such as: new business opportunities, reduced risk for each release, and prevent development of wasted software. There is little academic literature on the challenges organisations face when adopting the CD process, however there are many anecdotal challenges that organisations have voiced on their online blogs. Objective: The aim of this research is to examine the challenges faced by organisations when adopting CD as well as the strategies to mitigate these challenges. Method: An explorative case study technique that involves in-depth interviews with software practitioners in an organisation that has adopted CD was conducted to identify these challenges. Results: This study found a total of 20 technical and social adoption challenges that organisations may face when adopting the CD process. The results are discussed to gain a deeper understanding of the strategies employed by organisations to mitigate the impacts of these challenges. Conclusion: While a number of individual technical and social adoption challenges were uncovered by the case study in this research, most challenges were not faced in isolation. The severity of these challenges were reduced by a number of mitigation strategies employed by the case study organization. It is concluded that organisations need to be well prepared to handle technical and social adoption challenges with their existing expertise, processes and tools before adopting the CD
Using thematic analysis in psychology

Thematic analysis is a poorly demarcated, rarely acknowledged, yet widely used qualitative analytic method within psychology. In this paper, we argue that it offers an accessible and theoretically flexible approach to analysing qualitative data. We outline what thematic analysis is, locating it in relation to other qualitative analytic methods that search for themes or patterns, and in relation to different epistemological and ontological positions. We then provide clear guidelines to those wanting to start thematic analysis, or conduct it in a more deliberate and rigorous way, and consider potential pitfalls in conducting thematic analysis. Finally, we outline the disadvantages and advantages of thematic analysis. We conclude by advocating thematic analysis as a useful and flexible method for qualitative research in and beyond psychology. Qualitative Research in Psychology 2006; 3: 77 /101
The qualitative interview in IS research: Examining the craft

The qualitative interview is one of the most important data gathering tools in qualitative research, yet it has remained an unexamined craft in IS research. This paper discusses the potential difficulties, pitfalls and problems of the qualitative interview in IS research. Building on Goffman’s seminal work on social life, the paper proposes a dramaturgical model as a useful way of conceptualizing the qualitative interview. Based on this model the authors suggest guidelines for the conduct of qualitative interviews. 2006 Elsevier Ltd. All rights reserved.
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs

The Hamiltonian cycle problem is one of the most popular NP-complete problems, and remains NP-complete even if we restrict ourselves to a class of (3-connected cubic) planar graphs [5,9]. Therefore, there seems to be no polynomial-time algorithm for the Hamiltonian cycle problem. However, for certain (nontrivial) classes of restricted graphs, there exist polynomial-time algorithms [3,4,6]. In fact, employing the proof technique used by Tutte [lo], Gouyou-Beauchamps has given an 0(n3) time algorithm for finding a Hamiltonian cycle in a 4-connected planar graph G, where n is the number of vertices of G [6]. Although such a graph G always has a Hamiltonian cycle [lo], it is not an easy matter to actually find a Hamiltonian cycle of G. However, for a little more restricted class of graphs, i.e., the class of 4-connected maximal planar graphs, we can construct an efficient algorithm. One can easily design an O(n*) time algorithm to find a Hamiltonian cycle in a 4-connetted maximal planar graph G with n vertices, entirely based on Whitney’s proof of his theorem [l 11. In this paper, we present an efficient algorithm for the problem, based on our simplified version of Whitney’s proof of his result. We employ ‘divide and conquer’ and some other techniques in the algorithm. The computational complexity of our algorithm is linear, thus optimal to within a constant factor.
1 USES OF TECHNOLOGY THAT SUPPORT PUPILS WITH SPECIAL EDUCATIONAL NEEDS
Concepts for dynamic obstacle avoidance and their extended application in underground navigation

An effective approach to dynamic obstacle avoidance for mobile robots is described in this paper. The main concepts in this approach include local Polar Object Chart (POC) for defining possible ways out, obstacle definition, detour mode, anchor for preventing getting lost, steering delimiting and velocity delimiting. The presented concepts and methods were tested and verified both by simulations and experiments on a developed prototype industrial Automated Guided Vehicle (AGV). This paper also presents the extended application of some of the concepts in underground navigation. © 2002 Elsevier Science B.V. All rights reserved.
HW/SW Codesign and FPGA Acceleration of Visual Odometry Algorithms for Rover Navigation on Mars

Future Mars exploration missions rely heavily on high-mobility autonomous rovers equipped with sophisticated scientific instruments and possessing advanced navigational capabilities. Increasing their navigation velocity and localization accuracy is essential for enabling these rovers to explore large areas on Mars. Contemporary Mars rovers move slowly, partially due to the long execution time of complex computer vision algorithms running on their slow space-grade CPUs. This paper exploits the advent of high-performance space-grade field-programmable gate arrays (FPGAs) to accelerate the navigation of future rovers. Specifically, it focuses on visual odometry (VO) and performs HW/SW codesign to achieve one order of magnitude faster execution and improved accuracy. Conforming to the specifications of the European Space Agency, we build a proof-of-concept system on an HW/SW platform with processing power resembling that to be available onboard future rovers. We develop a codesign methodology adapted to the rover's specifications, design parallel architectures, and customize several feature extraction, matching, and motion estimation algorithms. We implement and evaluate five distinct HW/SW pipelines on a Virtex6 FPGA and a 150 MIPS CPU. We provide a detailed analysis of their cost-time-accuracy tradeoffs and quantify the benefits of employing FPGAs for implementing VO. Our solution achieves a speedup factor of 16× over a CPU-only implementation, handling a stereo image pair in less than 1 s, with a 1.25% mean positional error after a 100 m traverse and an FPGA cost of 54 K LUTs and 1.46-MB RAM.
Shape from shading for the digitization of curved documents

Document digitization is faster and more affordable using digital cameras than scanners. On the other hand, if we aim at extending the basic digital camera functionalities for such a purpose, post-processings will be of first importance, at least to improve the text legibility. In this paper, we address the specific problem of the virtual flattening of curved documents, as for example the pages of an opened book lying on its spine. In order to compute the document shape, we use the shape from shading technique and discuss why, in some cases, it is more suitable than other 3D single-view reconstruction techniques. We extend the seminal work by Wada et al. (Proceedings of the IAPR Workshop on machine vision and applications, Tokyo, Japan, pp. 591–594, 1992) and consecutive papers, reformulating the problem in terms of perspective shape from shading. Finally, we design a complete post-processing algorithm and test it on real images. Even if the documents are much curved, it is shown that the restored images are almost identical to scanned images of the flattened documents.
Hatha yoga: improved vital capacity of college students.

CONTEXT
The vital capacity of the lungs is a critical component of good health. Vital capacity is an important concern for those with asthma, heart conditions, and lung ailments; those who smoke; and those who have no known lung problems.


OBJECTIVE
To determine the effects of yoga postures and breathing exercises on vital capacity.


DESIGN
Using the Spiropet spirometer, researchers measured vital capacity. Vital capacity determinants were taken near the beginning and end of two 17-week semesters. No control group was used.


SETTING
Midwestern university yoga classes taken for college credit.


PARTICIPANTS
A total of 287 college students, 89 men and 198 women.


INTERVENTION
Subjects were taught yoga poses, breathing techniques, and relaxation in two 50-minute class meetings for 15 weeks.


MAIN OUTCOME MEASURES
Vital capacity over time for smokers, asthmatics, and those with no known lung disease.


RESULTS
The study showed a statistically significant (P < .001) improvement in vital capacity across all categories over time.


CONCLUSIONS
It is not known whether these findings were the result of yoga poses, breathing techniques, relaxation, or other aspects of exercise in the subjects' life. The subjects' adherence to attending class was 99.96%. The large number of 287 subjects is considered to be a valid number for a study of this type. These findings are consistent with other research studies reporting the positive effect of yoga on the vital capacity of the lungs.
Platform Competition in Two-Sided Markets : The Case of Payment Networks

In this article, we construct a model to study competing payment networks, where networks offer differentiated products in terms of benefits to consumers and merchants. We study market equilibria for a variety of market structures: duopolistic competition and cartel, symmetric and asymmetric networks, and alternative assumptions about multihoming and consumer preferences. We find that competition unambiguously increases consumer and merchant welfare. We extend this analysis to competition among payment networks providing different payment instruments and find similar results. JEL Classifications: D43, G21, L13
SPARK: A New VANET-Based Smart Parking Scheme for Large Parking Lots

Searching for a vacant parking space in a congested area or a large parking lot and preventing auto theft are major concerns to our daily lives. In this paper, we propose a new smart parking scheme for large parking lots through vehicular communication. The proposed scheme can provide the drivers with real-time parking navigation service, intelligent antitheft protection, and friendly parking information dissemination. Performance analysis via extensive simulations demonstrates its efficiency and practicality. Keywords— Vehicular communications; smart parking; navigation; anti-theft; information dissemination; security & privacy
Correlation analysis of MQTT loss and delay according to QoS level

MQTT is an open protocol developed and released by IBM. To ensure the reliability of message transmission, MQTT supports three levels of QoS. In this paper, we analyze MQTT message transmission process which consists of real wired/wireless publish client, broker server and Subscribe client. By transmitting messages through 3 levels of QoS with various sizes of payloads, we have captured packets to analyze end-to-end delays and message loss.
Improved resolution from subpixel shifted pictures

In this paper we consider the problem of obtaining a picture with improved resolution from an ensemble of K spatially shifted low-resolution pictures. We show that it can be done and provide a procedure for its implementations. The framework and scheme utilized in the generalized multichannel sampling theorem of Papoulis and Brown was found to be an appropriate representation for our problem. The linear channels of this scheme correspond to the processes that produce the low-resolution pictures (by blur and shifts) and to the process of reconstruction. The total process is shown to consist of two distinct degradation-restoration pairs: blurring-deblurring and undersampling-merging. This paper discusses merging. Deblurring (deconvolution) can be done by any desired scheme independent of merging. It is shown that the procedure achieves the claims of super resolution schemes but, unlike many of them, is well posed and robust. This procedure holds for a selected ensemble so that K is not too large and no two of the pictures practially coincide. The number of multiplications per pixel of the improved picture can be reduced to O(K2). o ESJZ