Miracle-dz/UniFAR-FTUs huggingface dataset:
ENERGY FUNCTION ALGORITHM FOR DETECTION OF OPENINGS IN INDOOR POINT CLOUDS

Abstract. As the use of building information model (BIM) for architectural heritage becomes more relevant, this paper explores different solutions to further automatize the modelling process. The scan-to-BIM process still requires manual intervention that is time consuming, subject to errors and user-dependent. In this paper, the main focus is the automated segmentation of windows. In the first part of our paper, we will review and compare several state-of-the-art methods for automatic detection and segmentation of openings in a point cloud. Based on the most pertinent aspects of those methods, a new algorithm focusing on indoor point clouds is proposed. After walls are already detected, they are converted in 2D binary images. Holes in those images correspond to openings. We submit each opening to an energy function with two terms: data and coherence. The data term depends on the shape of the opening. The coherence term considers the position of the opening in the scene. Those function let us determine if an opening in the point cloud is due to a window/door or an object obstructing the acquisition. In the third part we discuss the results obtained by applying the method to different datasets.
Measuring Information Quality in Collaborative Business Intelligence Networks

Collaborative business intelligence in the meaning of cross-company data sharing and analysis can be conducted by the use of collaborative business intelligence networks and a peer-to-peer-approach. Despite the pure technological possibility, difficulties exist due to different data schemes and the necessary semantic mappings of them leading to information loss. We propose methods and measures to quantify the information quality of those networks and show first results of a prototypical simulation regarding local and global measures. We further outline research for future work. Keywords-Collaborative business intelligence; information quality; quality measures; peer-to-peer networks.
Detection of single-threading properties in combinator notations

Lass, Dean Roger, "Detection of single-threading properties in combinator notations " (1991). Retrospective Theses and Dissertations. Paper 9543. This manuscrit has been reproduced from the microfilm master. UMI films the text directly &om the original or copy submitted. Thus, some thesis and dissertation copies are in typewriter face, while others may be fi'om aity type of computer printer. The quality of this reproduction is dependent upon the quality of the copy submitted. Broken or indistinct print, colored or poor quality illustrations and photographs, print bleedthrough, substandard margins, and inq)roper alignment can adversely affect reproduction. In the unlikely event that the author did not send UMI a complete manuscript and there are missing pages, these will be noted. Also, if unauthorized copyright material had to be removed, a note will indicate the deletion. sectioning the original, beginning at the upper left-hand comer and continuing from left to right in equal sections with small overlaps. Each original is also photographed in one exposure and is included in reduced form at the back of the book. Photographs included in the original manuscript have been reproduced xerographically in this copy. Higher quality 6" x 9" black and white photographic prints are available for any photographs or illustrations appearing in this copy for an additional charge. Contact UMI directly to order.
Automatic Image Annotation Menggunakan Metode Block Truncation dan K-Nearest Neighbor

Sistem temu kembali citra digital berbasis text sangat bergantung pada label dari gambar digital . D alam penelitian ini, diterapkan gabungan beberapa metode untuk pelabelan sebuah gambar secara otomatis, istilah yang sering digunakan adalah automatic image annotation, teknik ini digunakan untuk menghasilkan label pada gambar agar dapat melakukan pencarian dengan semantik yang diambil dari objek dalam gambar . Automatic image annotation dimulai dengan melakukan segmentasi terhadap gambar dan untuk setiap segmen gambar dilakukan ekstraksi fitur warna dan tekstur, fitur ini dinormalisasi dan disimpan kedalam basis data untuk data latih, data latih yang telah terkumpul dilatih menggunakan metode learning vector quantization. Bobot yang didapat dari hasil pelatihan digunakan untuk melakukan klasifikasi terhadap segmen gambar ke kosa kata hasil terjemahannya. Hasil dari penelitian ini adalah kesimpulan bahwa automatic image annotation dapat dicapai dengan gabungan metode yang diusulkan dan dapat memberi performa hasil anotasi yang bagus , dimana akurasi sistem adalah 73,26 % saat menggunakan K-NN dengan k = 5.
Throughput Analysis of Dense Multi-Antenna Downlink Cellular Networks With CSIT Errors

This letter investigates the throughput of a dense multi-antenna network in the presence of channel state information (CSI) errors at transmitter. The Gauss–Markov auto-regressive model is put forth to characterize CSI errors. We focus on a class of cases that the variance of CSI error is independent of serving distances between users and BSs. An original expression for area spectral efficiency (ASE) is derived with the tools of stochastic geometry. Based on the expectations of effective channel gains, a more tractable approximation for ASE is further obtained. With the help of the tractable approximation, we consider the optimization problem for ASE maximization with respect to the number of active users. We demonstrate that ASE scales linearly with the number of antennas when the number of antennas is larger than a certain value. The CSI errors determine the increasing slope.
Higher-order iterative learning control algorithm

For the trajectory-tracking control of dynamic systems with unidentified parameters, a higher-order iterative learning control method is presented in the paper. In contrast to other known methods, the proposed learning control scheme can utilise more than one past error history contained in the trajectories generated at prior iterations. A convergency proof is given and it is also shown that the convergence speed can be improved in comparison with conventional methods. Examples are provided to show effectiveness of the algorithm, and, via simulation, it is demonstrated that the method yields a good performance even in the presence of disturbances.
Who votes for new parties? Economic voting, political ideology and populist attitudes

Abstract Beginning with the economic crisis in 2008, a number of European societies witnessed the emergence of ‘new parties’. Most authors explain their electoral appeal by focusing on how the perceived state of the economy influences individuals’ voting decisions. This article determines the extent to which political attitudes can also explain voting for new political parties born in the heat of the economic crisis. Specifically, it explores the link between populist attitudes, in contrast to pluralist and elitist attitudes, and voting for two new political parties in Spain (Ciudadanos; Podemos), which are noticeably different in their ideological positions, programmatic proposals and populist discourses. The results show that stronger populist attitudes increase the likelihood of voting for new parties as dissimilar as Podemos and Ciudadanos. Overall, the findings suggest that voting for new parties cannot be understood as a mere economic response. Rather, political factors, and especially populist attitudes, matter too.
RESOURCES, TOOLS, REUSABILITY

The design and implementation of new applications in Natural Language Processing at low costs mostly depends upon the possibility of reusing existing components and resources. Despite the high concentration of research on reusables, the notion of reusability itself is a complex one and has not been well understood yet. In the following pages we will show that, although linguistic resources are a condition for the feasibility and viability of real applications, reusability is not a property that dictionaries and grammars acquire by virtue of standards. It will be shown, instead, that flexibily, modularity and easy portability of interfaces accessing such resources and programmes using them enable real reusability in different applications. Examples from some projects carried within the frame of the European programmes will be presented and discussed with respect to the components they embed and how these are made reusable.
INTERMEDIATE FABRICS: LOW-OVERHEAD COARSE-GRAINED VIRTUAL RECONFIGURABLE FABRICS TO ENABLE FAST PLACE AND ROUTE

of Thesis Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Master of Science INTERMEDIATE FABRICS: LOW-OVERHEAD COARSE-GRAINED VIRTUAL RECONFIGURABLE FABRICS TO ENABLE FAST PLACE AND ROUTE By Aaron Landy May 2013 Chair: Greg Stitt Major: Electrical and Computer Engineering Field-programmable gate arrays (FPGAs) have been widely shown to have significant performance and power advantages compared to microprocessors and graphics-processing units (GPUs), but remain a niche technology due in part to productivity challenges. Although such challenges have numerous causes, previous work has shown two significant contributing factors: 1) prohibitive place-and-route times preventing mainstream design methodologies, and 2) limited application portability preventing design reuse. Virtual reconfigurable architectures, referred to as intermediate fabrics (IFs), were recently introduced as a potential solution to these problems, providing 100x-1000x place-and-route speedup, while also enabling application portability across potentially any physical FPGA. However, one significant limitation of existing intermediate fabrics is area overhead incurred from virtualized interconnect resources. In this work, we approach this problem through complementary top-down and bottom-up approaches, seeking to reduce both the number and size of multiplexers that comprise the interconnect. First we perform design-space exploration of virtual interconnect architectures and introduce an optimized virtual interconnect that reduces area overhead by 48% to 54% compared to previous work, while also improving clock frequencies by 24% with a modest routability overhead of 16%. We also extend ”constant folding” used by traditional logic optimization to support
Personalization in the semantic web era: a glance ahead

The problem of information overload when browsing and searching the web becomes more and more crucial as the web keeps growing exponentially and personalization features as the most popular remedy for it. The evolution of personalization as we experience it in recent years has been dramatically influenced by web mining, a research area developing around three main axes: web content, web usage and web structure mining. Lately most research efforts have moved towards combining techniques from more than one domain to achieve extreme personalization in large and complicated web structures. The
Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem

The paper tackled one of the artificial intelligence algorithms which is Mosquito swarm algorithm as a nature inspired algorithms, to solve 0-1 knapsack an optimization problem through adaptation steps of a Mosquito swarm algorithm and the inspiration coming from the behavior of Mosquitoes, in addition to propose steps (update) for Chemical sensors, Heat sensors and location of Mosquito, to find an optimal solution in small search space and small computational requirements. A program is written in MATLAB 7.10 . language to simulate this algorithm with 0-1 knapsack problem. The experimental results in this research showed effective approach, easy implementation of algorithm to find optimal solution.
AN INTELLIGENT SPARSE VISUAL FEATURE DESCRIPTORS FOR CONTENT-BASED IMAGE RETRIEVAL

vi AUTHOR’S DECLARATION . viii PLAGIARISM UNDERTAKING . ix TABLE OF CONTENTS . x LIST OF FIGURES . xiv LIST OF TABLES . xvii LIST OF ABBREVIATIONS . xviii LIST OF PUBLICATIONS . xx Chapter 1 . 1
Let’s Distinguish Relative and Absolute Efficacy to Move Psychotherapy Research Forward

Objective: Background regarding a recent debate between Cuijpers et al. (2019a, b) and the authors (Munder et al. 2019) about the efficacy of psychotherapy for depression is given. Method: A main reason for the discrepancy in Cuijpers et al.'s and our conclusions is discussed. Results: In our view the discrepancy is due, among other things, to a blurred distinction between questions of relative and absolute efficacy of psychotherapy. Although the efficacy of psychotherapy vis-à-vis alternative treatments may be ambiguous, there can be little doubt about the benefits of psychotherapy relative to no treatment. Conclusion: We do not think that raising fundamental concerns about the value of psychotherapy is a service to the field. We argue that moving the field forward requires a focus on how psychotherapy works and how the access to psychotherapy can be increased.
SCHOOL LIBRARY VIDEO COMPANY PROFILE BERBASIS MULTIMEDIA DALAM UPAYA KONSTRUKSI CITRA PERPUSTAKAAN (STUDI ACTION RESEARCH PERPUSTAKAAN SMP N 21 SEMARANG)

Dalam penelitian ini membahas mengenai school library video company profile berbasis multimedia dalam upaya konstruksi citra perpustakaan. Penelitian ini bertujuan untuk mengetahui hasil dari penerapan pemutaran video company profile dalam membentuk citra perpustakaan di SMP N 21 Semarang. Metode yang digunakan dalam penelitian adalah action research dengan model spiral. Penelitian ini menggunakan pendekatan kualitatif untuk mengungkapkan hasilnya. Pengumpulan data dilakukan dengan metode observasi, wawancara, dan dokumen. Berdasarkan analisis data pada hasil wawancara terhadap informan, diketahui bahwa mereka memahami fakta yang terjadi di Perpustakaan SMP N 21 Semarang. Hal-hal yang sebelumnya tidak mereka ketahui, setelah pemutaran video company profile mereka berpendapat bahwa perpustakaan SMP N 21 Semarang bukan tempat yang sepi dan sunyi lagi. Perpustakaan adalah tempat yang seru dan asik untuk berkumpul dengan teman-teman dalam berdiskusi atau belajar bersama. Kebersihan dan kerapian juga sangat terlihat walaupun masih ada beberapa buku yang belum diletakkan kembali ke rak buku. Pustakawan juga ramah dalam melayani pemustaka yang membutuhkan bantuan. Pemutaran video company profile ini membuat pandangan, wawasan dan pemahaman baru yang positif terhadap hal yang tidak diketahui oleh pemustaka mengenai Perpustakaan SMP N 21 Semarang.
A New Approach for Industrial Diagnosis by Neuro-Fuzzy systems: Application to Manufacturing System

In this study we propose a strategy for the follow -up of the process behavior and detection of failur es. An approach of industrial diagnosis based on the statistical pattern recognition NeuroFuzzy being based on a digital representation and s ymbolic system of the forms is implemented. Within this framework, data-processin g i teractive software of simulation baptized NEFDI AG (NEuro Fuzzy DIAGnosis) version 1.0 is developed. This software devoted pr imarily to creation, training and test of a classif ication Neuro-Fuzzy system of industrial process failures. NEFDIAG can be represented like a special type of fuzzy perceptron, with three laye rs used to classify patterns and failures.The system selected is the workshop of SCIMAT clinke r , cement factory in Algeria.
Agent Organization and Request Propagation in the Knowledge Plane

In designing and building a network like the Internet, we continue to face the problems of scale and distribution. In particular, network management has become an increasingly difficult task, and network applications often need to maintain efficient connectivity graphs for various purposes. The knowledge plane was proposed as a new construct to improve network management and applications. In this proposal, I propose an application-independent mechanism to support the construction of applicationspecific connectivity graphs. Specifically, I propose to build a network knowledge plane and multiple sub-planes for different areas of network services. The network knowledge plane provides valuable knowledge about the Internet to the sub-planes, and each sub-plane constructs its own connectivity graph using network knowledge and knowledge in its own specific area. I focus on two key design issues: (1) a region-based architecture for agent organization; (2) knowledge dissemination and request propagation. Network management and applications benefit from the underlying network knowledge plane and sub-planes. To demonstrate the effectiveness of this mechanism, I conduct case studies in network management and security.
Proceedings of the 24th Australasian conference on Computer science

These proceedings contain the papers accepted for presentation at the Twenty-Fourth Australasian Computer Science Conference (ACSC 2001), hosted by Bond University and Griftith University.Fifty-four papers were submitted to the conference after a global Call For Papers was issued in April 2000. Each complete paper was fully reviewed by at least three referees from an international program committee. A total of 29 papers were accepted for presentation. The distribution of papers is as follows (based on first author):Australian state - Number of papersAustralian Capital Territory - 1 New South Wales - 8 Queensland - 11 South Australia - 9 Victoria - 10 Western Australia - 4 Other country - Number of papersAustria - 1 Fiji - 1 Korea - 1 New Zealand - 2 Singapore - 2 United Kingdom - 1 United States of America - 3 TOTAL - 54Each year the Australian Computer Science Association awards the Distinguished Australian Ph.D. Dissertation in Computer Science for the best Ph.D. thesis completed in the previous year. The award for the best Ph.D. thesis completed in 1999 went to Dr. Michael Kolling from the University of Sydney for his thesis entitled "The design of an object-oriented environment and language for teaching". In 1996, the Association began presenting awards for the best student paper at ACSC. The student had to be the major author of the paper to be eligible. The prize for best student paper in 2001 is awarded to Mike Liddell from the University of Melbourne for the paper "'Length- Restricted Coding Based on Modified Probability Distributions", co-authored with his supervisor Assoc. Prof. Alistair Moffat. This award, and the award for the best Australian Ph.D. dissertation in 2000, will be presented at the conference.
ONLINE COLLABORATION FOR PROGRAMMING: Assessing Students’ Cognitive Abilities

This study is primarily focused on assessing the students’ logical thinking and cognitive levels in an online collaborative environment. The aim is to investigate whether the online collaboration has significant impact to the students’ cognitive abilities. The assessment of the logical thinking involved the use of the online Group Assessment Logical Thinking (GALT) test that has been conducted in two phases; before and after the online collaborative activities. The sample of respondents for this study is sixty first year Diploma in Computer Science students from Universiti Teknologi MARA (UiTM) Perlis, Malaysia where they were divided into fifteen collaborative groups. These collaborative groups were then engaged in a 3-hour session of collaborative activities via the Online Collaborative Learning System (OCLS). The results for this study has revealed that the online collaborative learning has significant impact to the students’ logical thinking levels with the increment of 21.7% high logical thinkers with p-value<0.05 (sig. 2-tailed). Meanwhile, the investigation of the students’ cognitive levels is being done by monitoring the students’ abilities to solve the given questions via OCLS. The questions have been previously constructed according to the Bloom’s taxonomy cognitive domain. The results have also revealed that the students at the early stage of learning programming are able to solve complex programming problems at the cognitive level Application and Analysis. There was also a strong correlation between students’ logical thinking skills with their abilities to solve problems in an online platform with r= 0.631, significant at 0.012.
An Efficient Sorting Algorithm by Computing Randomized Sorted Sub-Sequences Based on Dynamic Programming

SUMMARY A lot of sorting algorithms exist today which are based on different problem solving techniques and with different performance behaviors. Algorithms are judged by the running time and space complexity which they take to solve any specific problem. In this papers an efficient sorting algorithm has been introduced, this algorithm is based on dynamic programming technique which is used to solve the optimization problems and here to sort arrays with optimal merges. Algorithm uses a bottom-up approach to compute the pre-sorted sub-sequences of random lengths in a given array of numbers and then sorts the whole array after efficiently combining the identified subsequences by using dynamic programming technique. Overlapping sub-problems are identified while sorting the given array and dynamic programming keeps the track of all the overlapping sub-problems by memorizing the data in a tabular form which is the main theme of the mentioned technique. Running time of the algorithm is compared with the standard merge sort and the results are satisfying.
QUANTIFYING THE QUALITY OF INDOOR MAPS

Abstract. Indoor maps are required for multiple applications, such as, navigation, building maintenance and robotics. One of common methods for map generation is laser scanning. In such maps, not only geometry of the map is of interest, but also its quality. This study aims at developing methods for real-time generation of indoor maps using features extracted from pointclouds obtained by a robot with their simultaneous quality assessment. We investigate, how this quality can be quantified for feature-based maps. First, we introduce a method for modeling 2D maps into 3D models that enable their usage for localization. Second, we review and evaluate a number of algorithms that can enable us to address features in a map. Hence, we enable the generation of objects from a pointcloud that has been sensed. Finally, we study several aspects of the map quality and we formalize them into metrics that can be applied to quantify their quality.