Miracle-dz/UniFAR-FTUs huggingface dataset:
Prediction Accuracy Comparison Of Similarity Measures In Memory Based Collaborative Filtering Recommender Systems

At the core of recommender systems are the processes which make predictions, such as ratings for an item which a user may assign to it, and recommends the most preferred item based on these ratings back to the user. Numerous design and implementation issues exist in building such intelligent systems. The success of such systems, are highly dependent on predictive accuracy of the underlying methodologies on which recommender engine is built upon. In this paper we have explored various similarity measures and analyzed their effect on predictive accuracy when applied in building neighbourhood based collaborative filtering recommender systems. Keywords— collaborative filtering, data mining, prediction, recommender systems, similarity measures.
Resolution of linear entity and path geometries expressed via partially-geospatial natural language

When conveying geospatial information via natural language, people typically combine implicit, commonsense knowledge with explicitly-stated information. Usually, much of this is contextual and relies on establishing locations by relating them to other locations mentioned earlier in the conversation. Because people and objects move through the world, a common and useful kind of geospatial phrase is the path expression, which is formed by designating multiple locations as landmarks on the path and relating those landmarks to one another in sequence. These phrases often include nongeospatial information, and the paths often include linear entities. This thesis builds upon the work done for the GeoCoder spatial reasoning system, by addressing several of its limitations and extending its functionality. Technical Supervisor: Michael Cleary Title: Decision Systems Group Leader, Charles Stark Draper Laboratory Thesis Advisor: Boris Katz Title: Principal Research Scientist
Construction of low authority, nearly nonminimal LQG compensators for reduced-order control design

It has been observed numerically that suboptimal controller reduction methods tend to work well when applied to low authority LQG controllers. However, to date, a rigorous justification for this phenomena has not been established. This paper shows that for continuous-time stable systems, by proper choice of the structure of the design weights, the corresponding LQG compensator becomes nonminimal as the control authority is decreased. An example illustrates that the near nonminimality of the LQG compensator can result in near optimality of the corresponding controller obtained by suboptimal controller reduction.
Capacity and Outage Rate of OFDMA Cellular System with Fractional Frequency Reuse

Employing fractional frequency reuse (FFR) in OFDMA cellular systems is very attractive since it offers large capacity and single cell frequency reuse. However, its performance in practical environments, e.g. scheduling and arbitrary cell configurations, has not been well revealed. This paper analyzes the theoretical capacity and outage rate of an OFDMA cellular system employing FFR. Numerical examples show that FFR achieves higher capacity than the non-FFR equivalent when the outage rate is low.
A probabilistic deep learning model to distinguish cusps and cores in dwarf galaxies

Numerical simulations within a cold dark matter (DM) cosmology form halos whose density profiles have a steep inner slope (‘cusp’), yet observations of galaxies often point towards a flat central ‘core’. We develop a convolutional mixture density neural network model to derive a probability density function (PDF) of the inner density slopes of DM halos. We train the network on simulated dwarf galaxies from the NIHAO and AURIGA projects, which include both DM cusps and cores: line-of-sight velocities and 2D spatial distributions of their stars are used as inputs to obtain a PDF representing the probability of predicting a specific inner slope. The model recovers accurately the expected DM profiles: $\sim 82{{\%}}$ of the galaxies have a derived inner slope within ±0.1 of their true value, while $\sim 98{{\%}}$ within ±0.3. We apply our model to four Local Group dwarf spheroidal galaxies and find results consistent with those obtained with the Jeans modelling based code GravSphere: the Fornax dSph has a strong indication of possessing a central DM core, Carina and Sextans have cusps (although the latter with large uncertainties), while Sculptor shows a double peaked PDF indicating that a cusp is preferred, but a core can not be ruled out. Our results show that simulation-based inference with neural networks provide a innovative and complementary method for the determination of the inner matter density profiles in galaxies, which in turn can help constrain the properties of the elusive DM.
Comprehensive Algorithmic Review and Analysis of LDPC Codes

Due to the increasing popularity of LDPC codes and its demand for future applications, first time in this paper, LDPC coding techniques have been systematically summarized and analyzed. The paper gives the comprehensive review of LDPC encoder, decoder and its architecture for simulation and implementation. The paper is specially intended for giving an insight of the algorithmic overview of the LDPC encoder, decoder and its architecture for research and practical purposes. The original belief propagation algorithm (BPA) , logarithmic model of BPA , and the other simplified form of the logarithmic sum product algorithms (SPA) has been elaborated and analyzed for medium and short length codes under AWGN channel
Online Learning Algorithms for Sequence Prediction, Importance Weighted Classification, and Active Learning

This thesis studies three problems in online learning. For all the problems the proposed solutions are simple yet non-trivial adaptations of existing online machine learning algorithms. For the task of sequential prediction, a modified multiplicative update algorithm that produces small and accurate models is proposed. This algorithm makes no assumption about the complexity of the source that produces the given sequence. For the task of online learning when examples have varying importances, the proposed algorithm is a version of gradient descent in continuous time. Finally, for the task of efficient online active learning, the implementation we provide makes use of many shortcuts. These include replacing a batch learning algorithm with an online one, as well as a creative use of the aforementioned continuous time gradient descent to compute the desirability of asking for the label of a given example. As this thesis shows, online machine learning algorithms can be easily adapted to many new problems.
A 6:1 image‐compression method using directional prediction for LCD overdrive

Abstract— An overdrive technology was developed and is widely used to diminish motion blur in LCDs. To store a previous frame in the overdrive operation in a limited‐sized memory, simple image‐compression techniques are required. By considering the strong correlation of nearby pixels in natural images, a new 6:1 color‐image‐compression method based on directional prediction is proposed. Different from the directional prediction of intra‐coding in H.264/AVC, the predictable direction is determined beforehand to minimize the computation complexity. A simple content‐adaptive quantization and bit‐streaming method, which preserves image details and is free from blocking artifacts, is also proposed. The experimental results show that our proposed method outperforms the vector quantization block truncation coding method with an average 3‐dB peak signal‐to‐noise ratio (PSNR) as well as the subjective quality in terms of blocking artifacts.
Potnia: una herramienta para directorios temáticos basada en Dublin Core y Topic Maps.

It shows the development of a data processing tool, called Potnia, inclusive of the standard proposed by the DCMI (Dublin Core Metadata Initiative) and the topic maps paradigm registered to ISO 13250:2003. The proposal is divided into six sections: rationale and objectives, scenario building methodology, integration of both markup languages using RDF (Resource Description Framework); improvements over a previous version, and conclusions.
Identifying Website Users by TLS Traffic Analysis: New Attacks and Effective Countermeasures

Websites commonly use HTTPS to protect their users' private data from network-based attackers. By combining public social network profiles with TLS traffic analysis, we present a new attack that reveals the precise identities of users accessing major websites. As a countermeasure, we propose a novel length-hiding scheme that leverages standard TLS padding to enforce website-specific privacy policies. We present several implementations of this scheme, notably a patch for GnuTLS that offers a rich length-hiding API and an Apache module that uses this API to enforce an anonymity policy for sensitive user files. Our implementations are the first to fully exercise the length-hiding features of TLS and our work uncovers hidden timing assumptions in recent formal proofs of these features. Compared to previous work, we offer the first countermeasure that is standards-based, provably secure, and experimentally effective, yet pragmatic, offering websites a precise trade-off between user privacy and bandwidth efficiency.
Designing Genetic Circuits for Memory and Communication

Author(s): Chen, David | Advisor(s): Arkin, Adam P | Abstract: The goal of synthetic biology is to allow the rapid design of organisms that can find diverse uses in environmental remediation, chemical production, or human health. Genetic engineering has traditionally been done by trial and error, but synthetic biology seeks to apply engineering principles and build complex circuits by rationally composing genetic parts together. We envision engineering microbes to form spatial communities for applications such as programmable tissues. We present novel circuit designs for memory and communication, which are basic building blocks for programming these behaviors. Our memory device uses molecular sequestration instead of cooperativity that was used in almost all previously built synthetic switches. In addition, our design allows predictable tuning of the switching boundaries and enables the rapid design of custom bistable switches that can function as a set-reset latch. We also present designs for contact-based communication by utilizing the recently discovered contact-dependent inhibition (CDI) system. Such a communication channel could allow programmed spatial features with micron-scale resolution, which can be advantageous compared to existing communication methods that rely on diffusible molecules. We present two strategies for harnessing the CDI system. In the first method, we fuse a small transcriptional activator to the protein that is delivered during CDI. In the second method, we exploit the known biology that the delivered domain can co-localize two other proteins. We use this co-localization effect to trigger an increase in activity from a split enzyme, and design an ultrasensitive response to the small number of molecules delivered during the CDI process. While we were not able to show control of gene expression in touching E. coli cells, we believe that our circuit designs can guide future engineering efforts.
Computational load in model physics of the parallel NCAR community climate model

Maintaining a balance of computational load over processors is a crucial issue in parallel computing. For efficient parallel implementation, complex codes such as climate models need to be analyzed for load imbalances. In the present study we focus on the load imbalances in the physics portion of the community climate model`s (CCM2) distributed-memory parallel implementation on the Intel Touchstone DELTA computer. We note that the major source of load imbalance is the diurnal variation in the computation of solar radiation. Convective weather patterns also cause some load imbalance. Land-ocean contrast is seen to have little effect on computational load in the present version of the model.
A Developed Algorithm of Apriori Based on Association Analysis

A method for mining frequent itemsets by evaluating their probability of supports based on association analysis is presented. This paper obtains the probability of every 1-itemset by scanning the database, then evaluates the probability of every 2-itemset, every 3-itemset, every k-itemset from the frequent 1-itemsets and gains all the candidate frequent itemsets. This paper also scans the database for verifying the support of the candidate frequent itemsets. Last, the frequent itemsets are mined. The method reduces a lot of time of scanning database and shortens the computation time of the algorithm.
Applying Educational Research: A Practical Guide

I. THE CONTRIBUTIONS OF EDUCATIONAL RESEARCH. 1. Using Research to Improve Educational Practice. II. THE RESEARCH LITERATURE ON EDUCATION. 2. Conducting a Review of the Research Literature. 3. Using Primary Sources to Search the Literature. 4. Reading Secondary Sources. III. QUANTITATIVE RESEARCH IN EDUCATION. 5. Reading Reports of Quantitative Research Studies. 6. Statistical Analysis of Research Data. 7. Descriptive and Causal-Comparative Research. 8. Correlational Research. 9. Experimental Research. IV. QUALITATIVE RESEARCH IN EDUCATION. 10. Case Studies in Qualitative Research. 11. Ethnographic Research. 12. Critical-Theory-Based Research. 13. Historical Research. V. APPLICATIONS OF RESEARCH METHODOLOGY. 14. Evaluation Research. 15. Action Research. Self-Check Test Answers. Appendix 1: Preliminary Sources that Index the Education Literature. Appendix 2: Clearinghouses and Support Components. Appendix 3: Publications Containing Secondary Source Reviews of the Education Literature. Appendix 4: Questions for Evaluating Quantitative Research. Appendix 5: Questions for Evaluating Qualitative Research. Glossary. Name Index. Subject Index.
PennAspect: A Two-Way Aspect Model Implementation

The two-way aspect model is a latent class statistical mixture model for performing soft clustering of cooccurrence data observations. It acts on data such as document/word pairs (words occurring in documents) or movie/people pairs (people see certain movies) to produce their joint distribution estimate. This document describes our software immplementation of the aspect model available under GNU Public License (included with the distribution). We call this package PennAspect. The distribution is packaged as Java source and class files. The software comes with no guarantees of any kind. We welcome user feedback and comments. To download PennAspect, visit: http://www.cis. upenn.edu/datamining/software_dist/ PennAspect/index.html. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-01-25. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/13 "! $#&%('*)+ ,-# . / 01! 2#&01#435' 6'872 93;: ? @BADCFEHG(I"JHK? AMLN=PO Q( ? @BLS=ZY []\ AM^BJM_? R`Q(acb8RNAed$GPfg=? hiVX@ jlk? min oqp(rsp? t? nvuxw(y ozwv{8|8k]}6~ ? nXtvk? n `wvp? tX{v{2t]iw 5] qq2  ? D SWBPqgxq69UDi i¢q£H6qB6¤¥2¢¤¢¦zW9 §U¢©Da¢ 9UDq]«¬Ba6xa«¬Ba¢9¦£M­ ®¥°±324©D¤¢a¢¦£M­ «PqNHq©Daa¢q£Dq5M2¥ μDa¢¶2¢¦£Mq· N ¢6£ D¥ ©D`  DHq©D9q£H`12? a¥-  a¢5o»WBa¥1⁄4 Hq©Daa¢¦£M­¦£ 1⁄4Hq©M9£U¢¥1⁄2xBa]9¶U¦212xqD"  a¢Po3⁄4xqD8qWa¥B¦£ 9¶U¦q¥1⁄2x¢ 1⁄4a¢UD©Dq8¢Dq aM? ¤B¦£UiD¦¤a¢¦μM©D¢¦B£ q¤¢¦i2¢· ? D¦41⁄4Hq©M9£U 1⁄4qa¢¦μxq ©1⁄4a4«¬NPa¢ ¦9M¦q9q£H¥2¢B£ «i¢M6Bx&9U1⁄4ql2¶BB¦BμD¦ ©D£ 1⁄4a4A&A&ÂAAv©MμD¦ AAE¦qq£M o3⁄4¦£Mq¦©MDz&( ¢C¢M"D¦¤a¢¦μM©1⁄4¢¦£x1⁄2`·lEEvzE¢D¦X `EBB­BWI I1⁄4I]I 5 qI I  ·i? M8D¦¤a¢¦μM©1⁄4¢¦£C¦] `EBB­Bz  ÐEz¶ B©Da¢qi£ -N OM¦qq· ? M9B«NS? a¢iq96( ¢E£D­©Ma¥£U¢q6B« B£HgEU¦£ AE·9E- ? 99©M`a «¬qz1⁄4μ B¥E5B£M q99£U¢q·]X91⁄42(£D¦E A]£M£ O xqzO1⁄4¶U¦¦zO H¢AEO 1B12PPC· q¦q· ©Mxq£D£l· z1⁄4©x1BD¥9£D¦£M­H12B«NSP2a¢ D¦¤`1BA]£M£ O xq`12£MD§s· H¢93⁄4· Oq×8OEU U2U¢USÝNU Þ3⁄4s aqasâAEU¢OEOÝNsBa UzaqOEU¦aCaWU¢aeHaqU3ÞScCU¢O2Þ"aqaleiazcCaeeÞSU¢U"aqOEeie3⁄4OBa¬azUNc6aÞSU azO iBi¢U U¢OEi¢U ixU¢i¤ðOEU i¥aqaxn"U¢aeUazUNÞWoiio3e]e3io3⁄4ooooz÷o u eiazUNUSU¢ÝSaeUazOEeU OEucuWeBÞSðEazU¥o
WebDAV: Next Generation Collaborative Web Authoring

From the Publisher: The definitive guide to WebDAV authoring, management, and publishing. Web-based Distributed Authoring and Versioning (WebDAV) is the IETF standard protocol for Web site authoring and wide area collaboration. WebDAV's document sharing and management services make it the ideal platform for Internet file and data management applications. This comprehensive book covers the WebDAV protocol from bits on the wire all the way to custom application design and implementation. Experienced WebDAV implementer Lisa Dusseault describes how WebDAV is supposed to behave but also illustrates that behavior with numerous examples and protocol traces from real clients and servers. The author covers each protocol feature, first explaining how it works and then illustrating its use in a live implementation. In each case, the author describes not only how the protocol was supposed to work, but how it actually does, with attention to the steps required to make a working implementation. This book delivers crucial details needed by application designers, software engineers, and information managers: Complete coverage of the protocol and popular implementations. Practical design rules for quickly designing and deploying any WebDAV-based application Real-world application case studies, including online calendaring and photo albums Two chapters on building custom WebDAV applications, including ready-to-run examples compatible with Internet Explorer Coverage of the new Versioning and Access Control standards
Threshold-based Clustering with Hard Regularization for Intrusion Detection Systems

Alkyl alkanoate derivatives of substituted piperazines are stabilizers for synthetic polymeric materials normally subject to deterioration caused by ultraviolet light. The compounds may be formed by reacting a substituted piperazine with an acrylate or reacting a substituted piperazine with an alpha -haloalkanoate. Polymeric compositions containing these stabilizers may also contain a hindered phenolic compound. A typical embodiment is n-octadecyl- beta -(15{7,15-diazadispiro[5,1,5,3]hexadecane}propionate.
A short tutorial of GPower

The purpose of this paper is to promote statistical power analysis in the behavioral sciences by introducing the easy to use GPower software. GPower is a free general power analysis program available in two essentially equivalent versions, one designed for Macintosh OS/OS X and the other for MS‐DOS/Windows platforms. Psychological research examples are presented to illustrate the various features of the GPower software. In particular, a priori, post‐hoc, and compromise power analyses for t‐tests, F‐tests, and χ2‐tests will be demonstrated. For all examples, the underlying statistical concepts as well as the implementation in GPower will be described. In the behavioral sciences, we routinely apply statistical tests, but control of statistical power cannot be taken for granted. However, neglecting statistical power—the probability of rejecting false null hypotheses—can have severe consequences. For example, without control of statistical power it is very difficult to interpret nonsignificant results. Statistical tests can produce nonsignificant results because (a) the null hypothesis (H0) holds and is retained correctly or (b) the alternative hypothesis (H1) holds but the test has not been powerful enough to detect the deviations from H0. Obviously, there is no reasonable way to decide between interpretations (a) and
The Latent Image

How can we describe a moving image, composed of thousands of successive images, as “an” image? I want to explore the possibility that the coherence of the image is premised on latency. A latent image is one which is captured in photographic film prior to development. It is by nature invisible. Similarly invisible latent states structure lenses, aperture ratios, compositing, grading and edits. Looking at the codec wars currently breaking out in preparation for HTML5, this talk investigates the relationships between the aesthetics and political economy of the image in the 21st century
Segmentation of welding arc images for purposes of welding diagnostics

Summary The paper concerns the research on diagnostics of a welding process. The estimation of the process state is being performed by means of the analysis of infrared images and images recorded within visible range of electromagnetic radiation. To carry out the image analysis it is necessary to cut out the area called region of interests (ROI). In case of welding which is the dynamical process this operation appeared complicated. The most important point of the operation is image segmentation. The author proposed and tested an algorithm of the definition of the ROI as well as verified numerous image segmentation methods.
Scalable MPLS multicast using label aggregation in Internet broadcasting systems

In previous years, the Internet using a conventional IP mechanism had a lot of problems such as slow packet forwarding, complex routing and inefficient usage of network resources. Multi-Protocol Label Switching (MPLS) is one of the mechanisms that are proposed to solve these problems. In addition, multicast is one of the big issues in the Internet society because it can efficiently support real-time multimedia traffic. Therefore, the next generation Internet will be a system which have an MPLS backbone and can support multicast. An MPLS multicast mechanism is considered under Internet broadcasting systems. Specially, the scalability problem of common problems in MPLS and multicast is solved using label aggregation. In the proposed algorithm, the Label Edge Router (LER) of edge router in MPLS has a new table containing information of each tree node. The table is called the multicast Tree Node Table. Extending the Constraint-based Routed Label Distribution Protocol (CR-LDP), the label allocation is performed by using this table. The scalability problem can be solved using this algorithm because it reduces label consumption. So, the MPLS multicast mechanism can be easily supported in a large Internet backbone network.
Batch Video Quality Metric (BVQM) User’s Manual

This handbook provides a user’s manual for the batch video quality metric (BVQM) tool. BVQM runs under the Windows XP® operating system. BVQM performs objective automated quality assessments of processed video clip batches (i.e., as output by a video system under test). BVQM reports video calibration and quality metric results such as: temporal registration, spatial registration, spatial scaling, valid region, gain/level offset, and objective video quality estimates. BVQM operates on original and processed video files only, and has no video capture capability. BVQM compares the original video clip to the processed video clip and reports quality estimates on a scale from zero to one. On this scale, zero means that no impairment is visible and one means that the video clip has reached the maximum impairment level (excursions beyond one are possible for extremely impaired video sequences).