Miracle-dz/UniFAR-FTUs huggingface dataset:
Optimization of Edge Server Selection Technique using Local Server and System Manager in content delivery network

Cloud Computing is a distributing computing technology which is used as pay per use basis. Now a day’s Cloud Computing is the most reputed topic due to its ability to offer guaranteed quality of service atmosphere, dynamic IT infrastructures, and conFigureurable software services. But many users could not satisfy on cloud services completely due to their uncovering security purpose for handling large numbers of data. Even the network becomes uncontrollable, when large numbers of user’s request to the server create network congestion and data losses vigorously. Content Delivery Network OR CDN is an eminent solution of this problem. Our objective is to create local and global server and connect the global server to system manager, which is worked over Content Delivery Network to deliver and direct the user request to the nearest global edge server except local server and establish the connection between them and transfer the respective content. For optimization of edge selection process and reduce the load over content delivery network we approach local server concept in this paper.
A Thread-based Two-stage Clustering Method of Microblog Topic Detection

Microblog is a novel individual publication model over Internet,making significantly more information open and interactive.Utilizing topic detection techniques to classify and organize microblog texts by topics can enable users access to the information interested to them under the dynamic environment.To deal with the short,semi-structured,context dependent microblog texts,we propose a thread-based two-stage clustering method.In the first phase,the temporal-author-topic(TAT) model is applied to clean the thread,namely to filter out the noisy microblog texts.In the second phrase,microblog texts with each thread are merged to form the thread texts for global topic detection.Experimental results show the approach achieves a good performance with a F-measure of 31.2%.
A New Approach to Automated Test Data Generation in Mutation Testing

Mutation testing is an effective software testing method,which generates mutants by applying mutation operators to simulate software defects systematically,and then a test suit is constructed to kill these mutants.It will improve the efficiency and effectiveness in mutation testing to generate test data to kill mutants automatically.The existing approaches generate test datum for killing a single mutant.According to the observation that the conditions of killing multiple same-location mutants are of similar,a new approach is proposed in this paper,which combines these same-location mutants′ conditions,then test datum which may kill more mutants is generated.A prototype is developed,on which experiments are carried out to validate the effectiveness of the proposed approach.
Performance analysis of call centers based on M/M/s/k+M queue with retrial and impatience

In order to analyze performance of a call center and statistic data of its automatic call distributor(ACD) in a scientific way, and considering these characters of a call center that a customer's arrival probably meets the busy signal and a customer probably leaves waiting queue due to impatience, a M/M/s/k+M queueing model with retrial and impatience is discussed and solved; an analytic solution and formulations of some measures of the model are given. At last, a numerical example and some conclusions are given, such as under the condition that each server of a system has the same load as that of another larger one, customers of the latter will be more satisfied.
3D modelling using Leap Motion - Focusing on homogeneous transforms

Leap Motion is a novel approach to human-machine interaction, which allows the computer to be controlled by hand and finger movement without the need of other equipment. It can track more than ten fingers with an accuracy of 0.01 mm, and introduces a new market for motion tracking applications and games available for personal computers. Creating a threedimensional (3D) modeling application using Leap Motion as the input device may make it easy for novice users to move and rotate objects in 3D virtual space. During the project, a prototype was developed to try out different strategies for moving and rotating 3D objects. The objective was not to create a fully functional 3D modeling application, but to create strategies for manipulating 3D objects using Leap Motion as the input interface. Four different strategies were implemented. A literature survey was done in advance of implementing the application in order to investigate what have been done previously, and take inspiration from similar applications to create the strategies in this project. A user test and a survey with 12 users was conducted to figure out if it is easy to use Leap Motion to accurately move and rotate 3D objects with the proposed strategies. The research concludes that it is difficult to find a strategy well suited for accurately rotating 3D objects using Leap Motion. Moving objects however is easy, but combining the actions (moving and rotating) make it more difficult to use for beginners. Users often experience fast fatigue, making the proposed strategies unsuitable for working for longer periods of time. Even though the controls were difficult to use, users found the controls easy to understand.
Likelihood Based Inference In Cointegrated Vector Autoregressive Models

Thank you very much for downloading likelihood based inference in cointegrated vector autoregressive models. Maybe you have knowledge that, people have look hundreds times for their chosen books like this likelihood based inference in cointegrated vector autoregressive models, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some malicious bugs inside their desktop computer.
POST CONSTRUCTION DIAGNOSIS OFREINFORCEMENT IN THE ELEMENTSOF HYDRO ELECTRIC PROJECT

The hydro projects envisage various concrete structure viz. dam body, foundation galleries, inspection galleries, power house complex, headrace tunnel, tail race tunnel etc. which are constructed using concrete linings of different grades. Its durability is determined by various factors viz. aggressivity of surrounding water, temperatures fluctuations etc. If the water happens to be soft it is injurious to the useful life of concrete as it leads to leaching of lime. Leaching is a phenomenon that is caused by water migrating through the permeable concrete. The permeated water causes corrosion of reinforcement leading to weakening of structure. Once such phenomenon is observed in any such structures a vigilant periodic monitoring approach becomes mandatory. The suitable remedial measure to be adopted will depend on the observed degree of deterioration. In this paper effort has been made to diagnose degree of corrosion of reinforcement at different locations in the power house complex and dam foundation gallery of one of the projects in the state of Himachal Pradesh, India using Half Cell Potentiometer.
Research on Automatic Identification of Tibetan Function Word

Research on the Tibetan function word is essential to the research on words,sentences and semantics in the Tibetan information processing.The automatic idetification of Tibetan function word paves the way for further research on the Tibetan function word.This paper discusses the role and use of Tibetan function words,reveals the difficulties in automatic identification of Tibetan function word,and finaly proposes a method for the automatic identification of Tibetan function word.The experiment on 2 525sentences achieves an accuracy of 97.076 8%for this method.
Modeling of Value Chain for Big Data

Modeling of Value Chain for Big Data Sangwon Lee, Sungbum Park, Jumin Lee, Hyunsup Ahn, Yong Goo Choi Division of Information and Electronic Commerce (Institute of Convergence and Creativity), Wonkwang University Big Data Strategy Center, National Information Society Agency Department of E-Business, Kyung Hee Cyber University Department of Wirtschaftsinformatik, Technische Universität Braunschweig Department of Computer Information, Dong Seoul University
AUTOMATIC DEFINITION THE FIELD OF VIEW OF CAMERA OF UNMANNED AERIAL VEHICLE

Сьогодні дедалі більше застосовують легкі безпілотні літальні апарати для вирішення завдань дослідження території. Головним критерієм виконання завдання є точна прив’язка отриманих даних до місця знаходження. В статті запропоновано метод визначення координат зони бачення камери, основою для якого стало визначення зв’язку між координатами відповідних точок місцевості і знімку. Метою є розробка алгоритму визначення координат зони бачення камери та його тестування, на даних аерофотозйомки. У статті розглянуто методи стереометрії, проекційної геометрії, комп’ютерної графіки та цифрової обробки зображення, військової топографії, що використовують для роботи із цифровою камерою та цифровим фотознімком. Розроблено метод та алгоритм на його основі для автоматизованого визначення координат зони бачення камери безпілотного літального апарату. Проведено тестування на реальних даних. Отримані результати можуть мати подальше використання при розробленні програмного забезпечення для стеження за об’єктами з безпілотних літальних апаратів, складання фотопланів, карти висот, а також для стереоорієнтування безпілотного літального апарату у просторі без використання глобальних систем навігації.
Seguimiento automático de objetivos con drones mediante algoritmos de tracking

The main objective of this Final Degree Thesis is to take advantage of using mobile cameras instead of xed cameras for video-surveillance tasks like tracking. For that purpose, problems introduced by combining the capture conditions of mobile cameras with the challenges faced by tracking algorithms are modeled. Once the problems have been de ned, their e ect the results of state of the art tracking algorithms is evaluated through a toy-example strategy with a proposed synthetic dataset. After modeling the aforementioned e ects, two modi cations oriented to a reduction of the blurring in the sequences and a stabilization of the camera by using points of interest have been proposed. These proposals sought to alleviate the e ects of the detected problems. To check the desired e ects of the improvements, the system has been evaluated on the synthetic dataset, and once these improvements have been corroborated, a real dataset with sequences captured by an UAV has been generated in order to evaluate the proposal in a real environment. The obtained results allow to conclude that the objective proposed at the beginning of this thesis has been accomplished with satisfaction. Additionaly, it has been considered that this project could be the starting point for vision applications on capture devices aboard UAVs.
Mining User-Generated Content for Social Research and Other Applications

User-generated content is currently becoming a valuable means for sensing and measuring real world variables and parameters that are of interest to several actors in the society: politicians, government departments, security agencies, marketing researchers, service providers, etc. In response to this new scenario, large research efforts are being invested in the so-called “social media” phenomenon by a wide spectrum of institutions and organizations around the world, with many different objectives and a diverse scope of fields and disciplines. As a consequence, new technologies and applications are currently emerging on the grounds of human participation, interaction, and behavior on the Internet. The main objective of this chapter is to present a general overview of the most relevant applications of text mining and natural language processing technologies evolving and emerging around the Web 2.0 phenomenon (such as automatic categorization, document summarization, question answering, dialogue management, opinion mining, sentiment analysis, outlier identification, misbehavior detection, and social estimation and forecasting) along with the main challenges and new research opportunities that are directly and indirectly derived from them.
Big Data, jejich skladování a možnosti využití

Obsah bakalařske prace analyzuje praci s daty, a to konkretně s velkoobjemovými nestrukturalizovanými data, tedy Big Data. Prace je resersniho charakteru, a obsahuje informacni průzkum založený na dotaznicich a rozhovorech. Cilem je zhodnoceni a přibliženi tematu velkých dat, jejich skladovani, nastrojů pro jejich spravu a možnosti využiti ctenaři, jak z technologickeho, tak obchodniho pohledu. Cilem pro praktickou cast prace je realizace průzkumu. Prace je rozdělena do tři hlavnich casti. Prvni cast definuje pojem, podava užsi pohled do problematiky a věnuje se otevřeným a propojitelným datům. Druha cast se zabýva otazkou skladovani a možnostmi nasledneho využiti uskladněných dat, nastroji a technologiemi pro spravu a praci s Big Data. Dale zhodnoceni výhod a nevýhody a porovnani technologii Hadoop. Ve třeti casti je zveřejněn průzkum o problematice Big Data. Použivam metody dotazniků a rozhovorů pro ziskani informaci od studentů a odborniků z praxe. Dale popisuje soucasne trendy, problemy a nabizi řeseni z praxe.
A formal bridge between runtime assertion checking and static verification of inheritance (P. 147 - 162)

In object-oriented programming languages, the relationship that should hold between the specifications of a class and its superclass is called behavioural subtyping. In this paper we analyse the conditions that a behavioural subtype should meet during runtime assertion checking, that is, during dynamic verification. Our exploration relates such conditions for runtime assertion checking to the conditions that should be met in static verification of correctness under the principles of modular reasoning. As a result, we state and prove a theorem that connects dynamic and static verification of method calls in the presence of inheritance. The novelty of this theorem lies on the fact that the connection is an equivalence, where the implication from static to dynamic verification has been explored before but not the opposite one. This new exploration then poses that a hypothetical exhaustive testing through runtime assertion checking would be equivalent to the corresponding static verification of definite correctness, which adds solidity to runtime assertion checking. None but one of the runtime assertion checking tools that we know of can effectively detect all possible problems in class inheritance; the one exception is the tool used for Spec#, but their strategy relies on both specification inheritance and a rather substantial restriction on preconditions, requirements we could dispose of when taking our the-oretical results to a practical implementation.
A novel single-cycle optical source in the mid-infrared

In this thesis, I demonstrate the generation of single-optical-cycle pulses in the midinfrared, which are generated using adiabatic difference frequency in an aperiodically polled lithium niobate crystal. The input pulses were generated in amplified Ti:Sapphire laser system, the construction of which is covered in detail, along with complete characterization of the generated pulses. The generated pulses have a bandwidth spanning (1.8− 4.5μm), energy in excess of 1μJ at a 1kHz repetition rate, and are compressed to within 15% of their Fourier transform limited duration of 10fs, which is 1.1 optical cycles at their central wavelength of 2. 6μm, and represents a peak power well in excess of 100MW. Furthermore, intrinsic to the design of the system is the ability to shape both the spectral amplitude and phase of the generated pulses, which makes this source immediately suitable for applications requiring shaped pulses. Thesis Supervisor: Erich P. Ippen Title: Elihu Thomson Professor of Electrical Engineering Professor of Physics Thesis Supervisor: Franz X. Kaertner Title: Adjunct Professor of Electrical Engineering and Computer Science
Web service classification based on STC algorithm

The majority of web service classification mechanisms basically rely on manual classification,as well as semi-automatic classification precision rate and recall rate are not effective enough.The approach of web service classification based on suffix tree clustering is mainly studied.Our approach proposes a hierarchical tree structure to represent some clustering labels which exist partly hyponymy or synonymy relationship,and at the same time to make a secondary clustering of these labels based on suffix tree clustering.The automatic classification has been achieved by adapting documentation preprocessing and semantic similarity calculation.The experimental results show that the service automatic classification algorithm has a higher precision and recall;on the other hand it can extract abstract cluster labels based on WordNet to cope with rapidly increasing web service in the level of classification of abstracting hierarchy,it also improves the efficiency of large number of services classification.
CLOSED LOOP CONTROL OF HIGH STEP-UP DC/DC CONVERTER BASED ON COUPLED INDUCTOR AND SWITCHED-CAPACITOR

This paper proposes a high voltage gain dc/dc converter with coupled inductor cells and switched capacitor for renewable energy applications. It includes coupled inductor, switched capacitor and voltage multiplier cell. Switched capacitor charged during off period by using the energy stored in the coupled inductor. This will increase the performance of the converter. The operation principle and steady state analyses are discussed thoroughly. Simulation is done with 40V input voltage, 300W output power and 400V output voltage using MATLAB.
Practical Speech User Interface Design

Although speech is the most natural form of communication between humans, most people find using speech to communicate with machines anything but natural. Drawing from psychology, human-computer interaction, linguistics, and communication theory, Practical Speech User Interface Design provides a comprehensive yet concise survey of practical speech user interface (SUI) design. It offers practice-based and research-based guidance on how to design effective, efficient, and pleasant speech applications that people can really use. Focusing on the design of speech user interfaces for IVR applications, the book covers speech technologies including speech recognition and production, ten key concepts in human language and communication, and a survey of self-service technologies. The author, a leading human factors engineer with extensive experience in research, innovation and design of products with speech interfaces that are used worldwide, covers both high- and low-level decisions and includes Voice XML code examples. To help articulate the rationale behind various SUI design guidelines, he includes a number of detailed discussions of the applicable research. The techniques for designing usable SUIs are not obvious, and to be effective, must be informed by a combination of critically interpreted scientific research and leading design practices. The blend of scholarship and practical experience found in this book establishes research-based leading practices for the design of usable speech user interfaces for interactive voice response applications.
Gaussian mixture models for blended photometric redshifts

Future cosmological galaxy surveys such as the Large Synoptic Survey Telescope (LSST) will photometrically observe very large numbers of galaxies. Without spectroscopy, the redshifts required for the analysis of these data will need to be inferred using photometric redshift techniques that are scalable to large sample sizes. The high number density of sources will also mean that around half are blended. We present a Bayesian photometric redshift method for blended sources that uses Gaussian mixture models to learn the joint flux–redshift distribution from a set of unblended training galaxies, and Bayesian model comparison to infer the number of galaxies comprising a blended source. The use of Gaussian mixture models renders both of these applications computationally efficient and therefore suitable for upcoming galaxy surveys.
Leading- and next-to-leading-order semiclassical approximation to the first seven virial coefficients of spin-1/2 fermions across spatial dimensions

Following up on recent calculations, we investigate the leading-order semiclassical approximation to the virial coefficients of a two-species fermion system with a contact interaction. Using the analytic result for the second-order virial coefficient as a renormalization condition, we derive expressions for up to the seventh-order virial coefficient $\Delta b_7$. Our results, though approximate, furnish simple analytic formulas that relate $\Delta b_n$ to $\Delta b_2$ for arbitrary dimension, providing a glimpse into the behavior of the virial expansion across dimensions and coupling strengths. As an application, we calculate the pressure and Tan's contact of the 2D attractive Fermi gas.
Algorithmic Distortion of Informational Landscapes

The possible impact of algorithmic recommendation on the autonomy and free choice of Internet users is being increasingly discussed, especially in terms of the rendering of information and the structuring of interactions. This paper aims at reviewing and framing this issue along a double dichotomy. The first one addresses the discrepancy between users' intentions and actions (1) under some algorithmic influence and (2) without it. The second one distinguishes algorithmic biases on (1) prior information rearrangement and (2) posterior information arrangement. In all cases, we focus on and differentiate situations where algorithms empirically appear to expand the cognitive and social horizon of users, from those where they seem to limit that horizon. We additionally suggest that these biases may not be properly appraised without taking into account the underlying social processes which algorithms are building upon.
Partial Compilation of ASP Programs

Abstract Answer Set Programming (ASP) is a well-known declarative formalism in logic programming. Efficient implementations made it possible to apply ASP in many scenarios, ranging from deductive databases applications to the solution of hard combinatorial problems. State-of-the-art ASP systems are based on the traditional ground&solve approach and are general-purpose implementations, i.e., they are essentially built once for any kind of input program. In this paper, we propose an extended architecture for ASP systems, in which parts of the input program are compiled into an ad-hoc evaluation algorithm (i.e., we obtain a specific binary for a given program), and might not be subject to the grounding step. To this end, we identify a condition that allows the compilation of a sub-program, and present the related partial compilation technique. Importantly, we have implemented the new approach on top of a well-known ASP solver and conducted an experimental analysis on publicly-available benchmarks. Results show that our compilation-based approach improves on the state of the art in various scenarios, including cases in which the input program is stratified or the grounding blow-up makes the evaluation unpractical with traditional ASP systems.