Miracle-dz/UniFAR-FTUs huggingface dataset:
Two Hybrid Methods of Volumetric Lighting

This thesis presents two new viable approaches to accelerating the visualization of light shafts from a point light source. A coarse representation of the three-dimensional scene is used to identify regions of space that are fully lit, fully in shadow and those that can not be determined from the coarse representation alone. The two methods then visualize the dierent regions as eciently as possibly. The first of the methods fully relies on sampling but ignores many of the evaluations required by previous sampling-based methods. The other method uses an analytical solution in the fully lit region, drastically reducing the required fillrate of the algorithm.
Web Enabled Teaching Aid for Non-orthographic Languages

In conjunction with the technological advancements of Telecomm unications and Information Technology and the outbreak of the World Wide Web (WWW), the production of educational software is undergoing a shift towards the shared resource paradigm. Recognizing the need expressed by people with special needs and special education teachers in enabling students to access such resources, this paper describes the design and the implementation of a Web-based, open system for the effective support of the teaching process of non-orthographic languages for people with special needs. There will be a discussion on user requirements, system specifications and characteristics as well as the system's architecture. Features that enable learner centered education and fulfill teachers' needs to prepare, organize and update the training material in a cost-effective manner and focus on content specification and other high level tasks, while developing courses, will also be mentioned, followed by reached conclusions and plans for future work.
SCHEDULING OF UPDATES IN DATA WAREHOUSES

A stream warehouse enables queries that seamlessly range from realtime alerting and diagnostics to lon g-term data mining. Continuously loading data from many different and uncontrolled sources into a real-time stream warehouse introduces a new consistency problem: users want re sults in as timely a fashion as possible, but “stab le” results often require lengthy synchronization delays. In this pap er we develop a theory of temporal consistency for stream warehouses that allows for multiple consistency lev els. We model the streaming warehouse update problem as a scheduling problem, where jobs correspond to processes that load new data into tables, and whose objec tive is to minimize data staleness over time.
An Intelligent Pico Cell Range Expansion Technique for Heterogeneous Wireless Networks

Background/Objectives: Due to high transmission power emitted by macro cell, very few users will be offloaded to nearby pico cell which leads to underutilization of pico cells in Heterogeneous Networks (HetNet). Method/Statistical Analysis: Cell Range Expansion (CRE) is a technique to virtually expand the coverage range of pico cell. With the help of CRE, user equipment will add a bias value to actual signal strength received from pico cell and thereby offload their traffic from macro cell to pico cell. But, at the same time adding bias value will lead to additional downlink interference which becomes severe for choosing higher bias value. Findings: Optimal bias value reduces the number of outage mobile stations but it depends on several factors which are hard to find such as the distribution of mobile stations over the cells, resource shared between pico and macro cells, mobility pattern and so on. In this paper, we are proposing a solution of Intelligent Pico Cell Range Expansion (IP-CRE) which calculates the effective bias value for each mobile station independently, by using a fuzzy logic inference system. Our proposed solution takes multiple attributes like signal strength of pico and macro cells, speed and direction of mobile stations, battery level and traffic requirements as input parameters and the output will be an effective bias value for each mobile station. We analyzed the effectiveness of the bias value by varying the number of connected Pico cell User Equipment (PUE) in the expansion region. Application/Improvements: Our observations from the simulation experiments demonstrate that the proposed scheme reduces the number of outage UE and increases the number of offloaded UE in Het Net.
Services Recommendation System based on Heterogeneous Network Analysis in Cloud Computing

Resources are provided mainly in the form of services in cloud computing. In the distribute environment of cloud computing, how to find the needed services efficiently and accurately is the most urgent problem in cloud computing. In cloud computing, services are the intermediary of cloud platform, services are connected by lots of service providers and requesters and construct the complex heterogeneous network. The traditional recommendation systems only consider the functional and non-functional requirements of services but ignore the links between providers and requesters of service, which result to the service position is not accurate. Focus on the problems, this study intends to model the relationship of the cloud services participants with the format of heterogeneous information network, which intend to mine the hidden relationships between services participants in the cloud computing environment. In theoretical research, we proposed a cloud service heterogeneous network extraction and automatic maintenance model, proposed a new service recommendation system based on heterogeneous service network ranking and clustering.
The Aspects of Modern Phraseology Modeling

This paper is devoted to the problems of presentation of phraseological units in contextual use, allowing to establish the most widespread phraseological transformations in English and Russian languages. It provides a systematization of these approaches to the study of idioms and offers an integrated modeling method of phraseological transformations based on the identification of syntactic, logico-semantic, motivational, structural, derivational and nominative models of phraseological transforms. A brief analyses is given to the description of all the stages in the formation of phraseological transforms: occasionalisms and neologisms. The main focus is on the need for revealing the most essential language processes found its reflection in the phraseological fund, which have not been investigated by researchers earlier.
Deploying Linked Open Vocabulary (LOV) to Enhance Library Linked Data

Since the advent of Linked Data (LD) as a method for building webs of data, there have been many attempts to apply and implement LD in various settings. Efforts have been made to convert bibliographic data in libraries into Linked Data, thereby generating Library Linked Data (LLD). However, when memory institutions have tried to link their data with external sources based on principles suggested by Tim Berners-Lee, identifying appropriate vocabularies for use in describing their bibliographic data has proved challenging. The objective of this paper is to discuss the potential role of Linked Open Vocabularies (LOV) in providing better access to various open datasets and facilitating effective linking. The paper will also examine the ways in which memory institutions can utilize LOV to enhance the quality of LLD and LLD-based ontology design.
Beamforming Based MIMO Processing with Closely Spaced Antennas

Beamforming Based MIMO Processing With Closely Spaced Antennas William Chou Master of Applied Science Graduate Department of Computer and Electrical Engineering University of Toronto 2011 When antennas are placed closely spaced together, the mutual coupling and spatial correlation effects undermine the advantages provided by multiple input and multiple output (MIMO) antennas. In this thesis, we compare and analyze the performance of digital beamforming, fixed radio frequency (RF) beamforming and element based patterning with closely spaced antenna systems. In the case where only one RF-chain is available, we have demonstrated performance improvements using RF beamforming-based MIMO processing instead of element-based MIMO processing with closely spaced metamaterial antennas. The result indicates that even without mutual coupling, antenna based MIMO processing is greatly impacted when moving from rich to correlated scattering environments. In the second half of the thesis, we investigate the switch and examine receiver combining (SEC) technique. We derive the switching rate of SEC and show that even though it has the same outage probability as traditional selection combining, it has a significantly lower switching rate.
Uplink acquisition of synchronization parameters in MC-CDMA systems

Most of the current synchronization schemes used for the forward/downlink MC-CDMA (multi-carrier code division multiple access) systems are not suitable for the reverse/uplink case. The technique proposed gives a new way to estimate the time-frequency synchronization parameters in an uplink MC-CDMA system, with the consideration that all the users reach the base station in an asynchronous mode. The proposed scheme combines the CDMA insertion mode for different spreading codes for all the users, and the SS-MC-MA (spread spectrum multi-carrier multiple access) mode as an insertion technique for the offset correction sequences. The insertion of pilots and offset correction sequences for each user are located at different carriers and obey to the non-overlapping principle with the rest of the user's position.
Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics

We are delighted to present you with this volume containing the papers accepted for presentation at the 12th Conference of the European Chapter of the Association for Computational Linguistics, held in Athens, Greece, from March 30th till April 3rd 2009. EACL 2009 received yet another record-breaking number of submissions, with 360 valid submissions against 264 for EACL 2006 and 181 for EACL 2003. Thanks to the new policy adopted by EACL regarding modes of presentation, we were nonetheless able to accept 100 papers (of which 2 were later withdrawn), achieving a healthy acceptance rate of 28% against only 20% in 2006 and 27% in 2003. Indeed, in 2009, the EACL conference will renew its format by having the main conference papers presented either as regular talks or as posters, with posters getting both a ten-minute quick-fire presentation in a thematic session and a one-hour discussion period in a traditional poster session. EACL 2009 will thus feature 41 posters and 57 talks, all with equal status in terms of quality and appearance in the proceedings. Not only does this move towards a balanced mix of traditional talks, quick-fire presentations and poster sessions allow us to maintain a reasonable acceptance rate, we also believe that it will increase interaction between researchers and contribute to a more lively scientific exchange. The increased number of submissions naturally comes with an increased reviewing load and we are greatly indebted to the 11 area chairs who recruited 449 reviewers and managed the reviewing process in their areas. Each paper submission was reviewed by three reviewers, who were furthermore encouraged to discuss any divergences they might have, and the papers in each area were ranked by the area chair. The final selection was made by the program co-chairs after an independent check of all reviews and discussions with the area chairs.
Programming Clojure

If you want to keep up with the significant changes in this important language, you need the second edition of Programming Clojure. Stu and Aaron describe the modifications to the numerics system in Clojure 1.3, explain new Clojure concepts such as Protocols and Datatypes, and teach you how to think in Clojure.Programming Clojure, 2nd Edition is a significant update to the classic book on the Clojure language. You'll get thorough coverage of all the new features of Clojure 1.3, and enjoy reorganized and rewritten chapters that reflect the significance of new Clojure concepts. Many code examples have been rewritten or replaced, and every page has been reevaluated in the light of Clojure 1.3. As Aaron and Stu show you how to build an application from scratch, you'll get a rich view into a complete Clojure workflow. And you'll get an invaluable education in thinking in Clojure as you work out solutions to the various parts of a problem. Clojure is becoming the language of choice for many who are moving to functional programming or dealing with the challenges of concurrency. Clojure offers: The simplicity of an elegantly designed language The power of Lisp The virtues of concurrency and functional style The reach of the JVM The speed of hand-written Java code It's the combination of these features that makes Clojure sparkle. Programming Clojure, 2nd Edition shows you how to think in Clojure, and to take advantage of these combined strengths to build powerful programs quickly. What You Need: Oracle JDK 6 A text editor
A User-Defined Gesture Set for Music Interaction in Immersive Virtual Environment

In recent years, hand-tracking technologies had been implemented in Virtual Reality application, allowing users to use natural hand gesture for interaction within the environment. However, little efforts have been conducted in understanding user's preference when they use their hands to interact with the VR world. In this paper, the result of a guessability test for hand gestures in order to operate musical tasks to support music interaction within immersive Virtual Environment. A total number of 750 gestures have been elicited from 15 participants for 50 selected tasks, including 10 musical tasks. Our result enables a smaller size of gesture set to be elicited from the users. The implications of this work can be relevant in hand gesture design, gesture interaction, and gestural interfaces design for music interaction, all of which are highlighted in this study.
F3 Algorithm for Association Rules

Frequent pattern mining or association rule mining has been very fascinating research topic. It gives association rules which are nothing else but relationships amongst data. These relationships play vital role to make decision in market based analysis, medical applications, banking and many other organizations. Amongst several algorithms provided for frequent pattern mining, time necessitated is always very important aspect to be considered. The breakthrough approach named F3 algorithm, finds frequent patterns by considering quantity of individual item in single transaction rather than item’s presence. Afterwards it finds supplementary appealing patterns from profit of items. This approach not only reduces the time for finding frequent patterns, but also endow with new effective pat-terns which act as a key to improve business utility.
Numerical implementation of time-dependent density functional theory for extended systems in extreme environments

In recent years, DFT-MD has been shown to be a useful computational tool for exploring the properties of WDM. These calculations achieve excellent agreement with shock compression experiments, which probe the thermodynamic parameters of the Hugoniot state. New X-ray Thomson Scattering diagnostics promise to deliver independent measurements of electronic density and temperature, as well as structural information in shocked systems. However, they require the development of new levels of theory for computing the associated observables within a DFT framework. The experimentally observable x-ray scattering cross section is related to the electronic density-density response function, which is obtainable using TDDFT - a formally exact extension of conventional DFT that describes electron dynamics and excited states. In order to develop a capability for modeling XRTS data and, more generally, to establish a predictive capability for rst principles simulations of matter in extreme conditions, real-time TDDFT with Ehrenfest dynamics has been implemented in an existing PAW code for DFT-MD calculations. The purpose of this report is to record implementation details and benchmarks as the project advances from software development to delivering novel scienti c results. Results range from tests that establish the accuracy, e ciency, and scalability of our implementation, to calculations thatmore » are veri ed against accepted results in the literature. Aside from the primary XRTS goal, we identify other more general areas where this new capability will be useful, including stopping power calculations and electron-ion equilibration. « less
Literature reviews for multi document summarization

Automatic text summarization is a wide research area. There are several ways in which one can characterize different approaches to text summarization: extractive and abstractive from single document or multi document, goal of text summarization (intent, focus and coverage), characteristic of text summarization (frequency-based, knowledge-based and discourse-based), level of processing (surface level, entities level and discourse level) and kind of information (lexicon, structure information and deep understanding). Recently, most researchers for automatic text summarization have transferred their efforts from single document summarization to multi document summarization but they have to be aware of the issues of redundancy, sentence ordering, fluency, etc. Therefore, in this paper, we compare techniques that have done for multi document summarization. Next, we describe evaluation method for automatic text summarization to weigh the quality and performance of system through manual and/or automatic system. In conclusion, we illustrate our future work for multi document summarization.
Appraising and Exploring Similarity Measurement Approaches in Recommendation Systems by means of Momentous

Nowadays, WWW is emerged very rapidly and it leads to creating internet as a significant place exchanging information over web. As a vast amount of data arising over web continuously, the information overloading problem arisen. It leads to difficulty in getting accurate information without ambiguity. So for the rescue, the Recommendation systems (RS) came. The RS carrying more significant in today's world. The basic principle of RS is based on similarity by which it suggests items that are closest to user interest. So various approaches are existing which are helpful for implementing RS. There are two major tasks like prediction of items and actual recommendation. Here, the task prediction is uses the concept of similarity for discovering most similar items. The major techniques like Content Based Filtering, Collaborative Filtering and Hybrid filtering employs various similarity measurement approaches. As recommendations generated based on similarity, the approaches are very vital. In this paper, the various similarity measurement techniques explored.
Specification and automatic verification of security guidelines for program certification

SECURE SOFTWARE CAN BE OBTAINED OUT OF TWO DISTINCT PROCESSES: SECURITY BY DESIGN, AND SECURITY BY CERTIFICATION. THE FORMER APPROACH HAS BEEN QUITE EXTENSIVELY FORMALIZED AS IT BUILDS UPON MODELS, WHICH ARE VERIFIED TO ENSURE SECURITY PROPERTIES ARE ATTAINED AND FROM WHICH SOFTWARE IS THEN DERIVED MANUALLY OR AUTOMATICALLY. IN CONTRAST, THE LATTER APPROACH HAS ALWAYS BEEN QUITE INFORMAL IN BOTH SPECIFYING SECURITY BEST PRACTICES AND VERIFYING THAT THE CODE PRODUCED CONFORMS TO THEM. IN THIS THESIS WORK, WE FOCUS ON THE LATTER APPROACH AND DESCRIBE HOW SECURITY GUIDELINES MIGHT BE CAPTURED BY SECURITY EXPERTS AND VERIFIED FORMALLY BY DEVELOPERS. OUR TECHNIQUE RELIES ON ABSTRACTING ACTIONS IN A PROGRAM BASED ON MODULARITY, AND ON COMBINING MODEL CHECKING TOGETHER WITH INFORMATION FLOW ANALYSIS. OUR GOAL IS TO FORMALIZE THE EXISTING BODY OF KNOWLEDGE IN SECURITY BEST PRACTICES USING FORMULAS IN THE MCL LANGUAGE AND TO CONDUCT FORMAL VERIFICATIONS OF THE CONFORMANCE OF PROGRAMS WITH SUCH SECURITY GUIDELINES. WE ALSO DISCUSS OUR FIRST RESULTS IN CREATING A METHODOLOGY FOR THE FORMALIZATION OF SECURITY GUIDELINES.
Background subtraction with a pan/tilt camera

Background subtraction is a common approach in computer vision to detect moving objects in video sequences taken with a static camera. Some background subtraction algorithms have been extended to support a pan/tilt camera but they are required to provide a background mosaic for motion estimation purposes. This thesis describes a system that avoids this requirement by separating the motion estimation system and background subtraction system into two separate modules. The first module performs motion compensation by employing a feature based image registration method and the RANSAC algorithm. The second module detects moving objects in rectified image frames using a background subtraction algorithm designed for a static camera. Three background subtraction algorithms were extended in the course of this project: mixture of Gaussians, non-parametric kernel density estimation and codebook. This thesis demonstrates the usefulness of separating of motion estimation from the background subtraction system as it allows us to extend any background subtraction algorithm designed for a static camera to support a pan/tilt camera. The detection results are presented for both indoor and outdoor video sequences taken with a pan/tilt camera.
Processing temporal aggregates in parallel

Temporal databases maintain past, present and future data. TSQL2 is a query language designed for temporal databases. In TSQL2, the GROUP BY clause has the temporal grouping property. In temporal grouping, the time line of each attribute value is partitioned into several sections, and aggregate functions are computed for each time partition. This paper describes two approaches to parallelising an algorithm for computing temporal aggregates. The two approaches have been implemented on an SGI PowerChallenge SMP parallel system. The experimental results show that the performance of the two approaches depends on data skew ratio and the number of processors used in the computation.
Resource discovery and fair intelligent admission control over scalable Internet

The Internet currently supports a best-effort connectivity service. There has been an increasing demand for the Internet to support Quality of Service (QoS) to satisfy stringent service requirements from many emerging networking applications and yet to utilize the network resources efficiently. However, it has been found that even with augmented QoS architecture, the Internet cannot achieve the desired QoS and furthermore, there are concerns about the scalability of any available QoS solutions. If the network is not provisioned adequately, the Internet is not capable to handle congestion condition. This is because the Internet is unaware of its internal network QoS states therefore it is not possible to provide QoS when the network state changes dynamically. This thesis addresses the following question: Is it possible to deliver the applications with QoS in the Internet fairly and efficiently while keeping scalability? In this dissertation we answer this question affirmatively by proposing an innovative service architecture: the Resource Discovery (RD) and Fair Intelligent Admission Control (FIAC) over scalable Internet. The main contributions of this dissertation are as follows: 1. To detect the network QoS state, we propose the Resource Discovery (RD) framework to provide network QoS state dynamically. The Resource Discovery (RD) adopts feedback loop mechanism to collect the network QoS state and reports to the Fair Intelligent Admission Control module, so that FIAC is capable to take resource control efficiently and fairly. 2. To facilitate network resource management and flow admission control, two scalable Fair Intelligent Admission Control architectures are designed and analyzed on two levels: per-class level and per-flow level. Per-class FIAC handles the aggregate admission control for certain pre-defined aggregate. Per-flow FIAC handles the flow admission control in terms of fairness within the class. 3. To further improve its scalability, the Edge-Aware Resource Discovery and Fair