Miracle-dz/UniFAR-FTUs huggingface dataset:
SAVASA-Standards-Based Approach to Video Archive Search and Analysis

Final Report Summary SAVASA (Standards Based Approach to Video Archive Search and Analysis) Executive Summary: This document is the Final Report of the SAVASA (Standards Based Approach to Video Archive Search and Analysis). SAVASA is supported by the SME-Security Research Call as part of the European Commission’s 7th Framework Programme and has 10 different partners, experts in the implementation, deployment and manipulation of multiple video surveillance systems. At its core, the project uses existing reference technologies from the ICT field that have overcome the barrier of CCTV system interoperability/compatibility, i.e. between container and compression formats. The project implements a prototype platform capable of demonstrating unified archive search and retrieval based on a Cloud infrastructure and provides a set of tailored video analytics and semantic tools, ready to be implemented within the current legal and ethical framework. This document provides along its different chapters, the information about the project context and objectives, main scientific and technological results, the potential impact, main dissemination activities and exploitation of results and the use of the of dissemination and foreground of the results created. Thus, the overall strategy for the dissemination of the project results and exploitation of the final prototype followed during the implementation of the project is reflected in the document. A list with the whole publications and dissemination activities is also included.
Human body and posture recognition system based on an improved thinning algorithm

This study presents a robust and reliable method of human posture recognition for visual surveillance systems. In order to recognise the human body, a recognition method is developed based on the skeleton of moving object. To obtain the skeleton of object, the authors describe some thinning algorithms for binary images, including one pass thinning algorithm, Zhang's thinning algorithm, Rosenfeld's thinning algorithm and a new thinning algorithm. Three performance measurements are chosen to evaluate these thinning algorithms. Comparing the performance results the authors found that the proposed thinning algorithm had managed to produce several improvements, including high thinness, connectivity, robustness to noise and low time consuming. Moreover, the skeleton obtained by the proposed thinning algorithm is one-pixel width and more smooth. Next, three different postures such as standing, bending and crawling will be estimated by using support vector machines as a classifier, which the histograms of horizontal and vertical projections are selected to define the feature. Finally, experimental results demonstrate that the human body and posture estimation algorithm have a robust and real-time performance, and is useful for the discrimination of human postures.
Adaptive PID Type Iterative Learning Control

In this paper, an adaptive PID-type iterative learning control scheme is proposed for tracking problem in repetitive systems with unknown parameters. In this scheme, we use a combination of an optimal PID-type iterative learning controller and progection like adgusting algorithm that is based on tracking error which decreases by iterations increment. Layapunov method is used for convergence analysis of the presented scheme, and convergence condition is obtained in term of algorithm step size range. the effectiveness of proposed technique is illustrated by simulation results. DOI: http://dx.doi. org/10.11591/ijece.v4i6. 6432
Ranking Algorithm RA-SVM for Domain Adaptation: A Review

Different new vertical domains are coming everyday so running a broad-based ranking model is no longer desirable as the domain are different and building a separate model for each domain is also not beneficial because there much time required for labeling the data and training the samples. In this paper we are handling the above problem by regularization based algorithm called as ranking adaptation SVM (RA-SVM), the algorithm is used to adapt existing ranking model of broad-based search engine to new domain. Here performance is still guaranteed and times taken to label the data training the samples are reduced. The algorithms only requires prediction from existing ranking model and do not require internal structure of it. Adapted ranking model concentrate on specific domain to achieve better results which are relevant to the search, further it reduces the searching cost also as the most appropriate search results are shown. Single ranking model is not good for training the search engine as the information retrieval is complicated, Domains are highly great, used in the global search engines and the data set is also large. So we can't generalize the information well for specific search intensions. That is why we are moving towards training the global ranking model for each specific domain for fetching the appropriate information from each respected domain for doing so we are using robust supervised classification algorithm. The parameters learned during the model adaptation and ranking SVM from global ranking model are capable retrieving the required information. Adapting the model is lot easier than building a unique ranking model for each domain.
Mass Media Use and Social Life Among Internet Users

The mass media use and social life of heavy, light, and nonusers of the Internet and personal computers are compared based on a fall 1998 survey of 3,993 nationally representative respondents age 18 and older. As in previous surveys, no significant or consistent evidence of time displacement of such media or social activities was found. Indeed, Internet users showed signs of more active social lives than non-users. These results reinforce the conclusion that personal computer/Internet use may have more in common with time-enhancing home appliances such as the telephone than they do with the time-displacing technology of television.
Space voltage vector-based new PWM method for large capacity three-level GTO inverter

A novel pulse-width-modulation (PWM) method for a three-level inverter based on space voltage vectors is presented. This PWM method can minimize the harmonic components of the output voltage under the minimum pulse-width limitation gate turn-off thyristors (GTOs) and can also suppress the fluctuation of the neural point DC voltage. Experimental results demonstrate that the proposed PWM method is suitable for a large-capacity three-level GTO inverter applied to motor drives for steel rolling mills, railcars, etc.<<ETX>>
SCENE SAMPLING FOR THE CONCENTRIC MOSAICS TECHNIQUE

Sufficient sampling for scene representation is an important topic in image-Based Rendering (IBR). It determines both the rendered image quality and the quantity of image data that must he recorded. and it depends on the method hy which the image samples are taken. The Concentric Mosaics technique is one way to get image samples of a scene, to which the sampling theory of the plenoptic function is applied in this paper to determine the required number of image samples at the different lengths of the rotation beam. The general spectral filtering model of image based rendering techniques is analyzed based on the Concentric Mosaics technique to provide a frequency domain interpretation. Simulations on both a numerical design example for a typical scene and the illustration of the different rendered image qualities with different number of image samples per rotation circle are provided.
Importance and difficulties of comparing reliability criteria and the assessment of reliability

Due to the importance of reliable electricity supply and the evolutions in the electrical grid, it can be expected that the way in which we assess reliability need to be adapted. At this moment, reliability is commonly assessed deterministically based on an N-1 criterion, while risk-based reliability assessment is widely available in academic works and is used in other industries. However, because of the years of successful use as well as the straightforward and transparent character of the currently used deterministic approach based on an N-1 criterion, stakeholders of the power system are not eager to apply other approaches. Nevertheless, probabilistic assessment is better suited to take into account growing uncertainty and complexity, for instance due to the increased amount of renewable energy sources. Such approaches are well-known for a long time, but difficulties in computation, limitations on the availability of stochastic input data and difficulties in correctly weighing the benefits of using these approaches have prevented them from being used in practice. This paper indicates the need for a comparison between these probabilistic reliability assessments and the deterministic assessment that is currently used. Difficulties in comparing various approaches are shown illustratively through the reliability assessment of a basic test system. The focus of this example is on planning.
Fast time simulation technique using noniterative algorithm of transient stability analysis

Transient stability analysis has been performed by several approaches such as time simulation approach, direct Lyapunov energy method, and hybrid method mixing both. The time simulation approach is the most fundamental tool for the online TSA (transient stability analysis), since it is also required for the direct Lyapunov energy method. A lot of efforts have been devoted to the speed up of the transient stability simulation. New noniterative algorithms have been developed with the full consideration of the generator saliency to reduce the computation time. The computation speed of the polarized partitioning algorithm shows the possibility of the on-line application of TSA.
Search Engines to QAS: Explorative Analysis

Search engine is pedestal machine on two-dimensional logic and possibility hypothesis which are short of concept based i.e. fact based existent human understanding and advanced way of thinking and precision to formulate answers.QA (Question answering) system is hybrid machine with analysis ability to fetch data from diverse knowledge source assorted format and formulate a answer to user search query. Research domain in advanced Information retrieval is machine to prospect a information seeking engine (search engine advancement). formulate precise answer to user search question is aspire of QA system . current search engines are keyword base with sort of semantic incorporation (semantic search in Google) Enhancement in search engines is three tier, user question understanding (user model, context, intent), text/data-mining analytics with machine learning (Support vector machine(SVM),Artificial neural networks(ANN)),and adha Rank (bings algorithm) to formulate trainable machine to reduce search space and time.QA system is a semantic concept based framework which identifies the nucleus keywords and phrases incorporating meaning i.e. sense of word to phrase ,sense of phrase to sentence ,to corpus which abolish the disambiguation of NL(natural language) in search engines. A prototype design of Answer engine is proposed that performs concept map of user question . the semantic concept framework enhances the ability of reckoning in Answering system. GUI interface performs mapping of user question in concept group (ontology class i.e. Spatial ontology, domain ontology, task ontology, universal ontology). text analytics formulates extraction of Answer term, phrases from corpus or knowledge dataset (unstructured & structured) using n-gram. Machine learning algorithms facilitate intelligence in search corpus. Ranking algorithm presents information on relevance precision mapped to user search intent. AdaRank repetitively build ‘frail rankers’ on the foundation of re-weighted training data and lastly linearly join the feeble rankers for making ranking forecast. The training process of AdaRank is exactly enhancing the performance measure used. AdaRank significantly optimizes the base technologies BM25, Ranking SVM, and Rank Boost.QA system are future of search engine, expert systems, and rule based systems. Current paradigm information processing machines to intelligent information machine which perform time variant search on large dataset with higher precision to question. This paper a search analysis has been carried out on 20 research article on Advance IR technologies. The search analysis present in detailed study on three methodologies (question understanding, text analytics, machine learning and ranking algorithm) when optimized invent enhanced search machine, QA system. Search paper concludes that intelligence in information processing has evolved search engines, rule based machines, expert systems to hybrid reasoning machines-QA Systems.
Area Efficient Design Analysis of Carry Look Ahead Adder

This paper provides a low power solution for Very Large Scale Integration. Power consumption of a circuit and its area occupied are major constraints for a VLSI designer. So in this paper we focused mainly on these two parameters by using different design methodologies such as Fully Automatic, Semi-custom and Fully Custom. Addition is basic operation in any system, but it requires more time as the number of bits are increased. So we use carry look ahead adder to reduce the processing time in circuits like processors or any other circuit. Design of CLA adder using semi-custom and fully custom approach can reduce the area and power consumption to a great extent.
Experimental Validation ofMiddleware-based QoSControl in802.11 Wireless Networks (Invited paper)

Duetotheshared mediumnature ofwireless networks, theuncertainties caused bycollisions andinterferences maketheQuality ofService (QoS)issue harder thanits wired counterpart. Manypublications havebeenfocused onnetwork andMAClayer design toaddress theQoSissue inwireless networks. However, themiddleware design has beenoverlooked ForQoSsupport, weneedtomaptheQoS requirement ofapplications toperformance metrics. Middleware istheplace wedosuchmapping. Inthis paper, weusepacket level priority tobridge theQoSrequirements andperformance. Through middleware priority adaptation, weaimtomakethepremiumtraffic meettheQoSrequirement.westudy theimpact ofmiddleware priority adaptation onQoSperformance, including bandwidth andendto-end delay, viaexperiments withmultimedia flows over IEEE802.11 environment. Ourevaluation isbased onexperiments inbothWLANandadhocnetwork environment. Ourinvestigation showsthat middleware adaptation isefficient inassisting toachieve QoSinmanyscenarios.
Pre-equalization for MIMO wireless channels with delay spread

We consider a downlink finite impulse response (FIR) multi-input multi-output (MIMO) wireless channel with L taps. A is shown that such a channel can be pre-equalized with an FIR MIMO transmit filter with only L taps, if the angle spread due to the different multipaths is sufficiently large at the transmitter. The filter taps are derived for the cases where the transmitter has perfect and partial channel knowledge, respectively. Finally, we present a pre-filter structure which converts the available frequency diversity into spatial diversity. The resulting spatial diversity can then be exploited using conventional receivers designed for frequency-flat fading channels.
Secure Multiparty Computation Protocol: Basic Building Blocks Methods

In a modern information-driven society, the everyday life of individuals and companies is full of cases where various kinds of private information is an important resource. While a cryptographer might think of PIN-codes and keys in this context, this type of secrets is not our main concern here. Secure Multiparty Computation (S MC) allows parties to compute the combine result of their individual data without revealing their data to others. S MC also allows parties with similar background to compute results upon their private data, minimizing the threat of disclosure. On S MC many eminent researchers give their protocols especially in modifier tokens to compute result. As the data involved in computation was encrypted, without revealing the data right result can be computed and privacy of the parties is maintained. In this paper, we survey the basic paradigms and notions of secure multiparty computation and discuss their relevance to the field of privacy-preserving data mining. In addition to reviewing definitions and constructions for secure multiparty computation, we discuss the issue of efficiency and demonstrate the difficulties involved in constructing highly efficient protocols. Finally, we discuss the relationship between secure multiparty computation and privacy-preserving data mining, and show which problems it solves and which problems it does not secure sum computation, researchers show their interest. The process involves encrypting data in a manner that it does not affect the result of the computation. Virtual parties are created by all organizations and encrypted data is distributed among them. Modifier tokens are generated along encryption which are assigned to virtual parties, and finally used in the computation. The computation function uses the acquired data and are responsible for generating the basic methods to be used for extraction of the given set of data.
A New Approach Based on Order Reduction Using Sub Image Formation in Minimizing the Computation Time for Image Compression

Image compression is the process to remove the redundant information from the image so that only essential information can be stored to reduce the storage size and transmission time. Advancement in still image compression becomes essential for various applications like medical imaging and multimedia applications. The task of image compression generally refers to deriving a near approximated compressed image for the given input image. Methods for tackling this problem have to do a delicate balancing act of suppressing the unwanted effects in visualizing without losing features of interest. Different techniques were already proposed in this area which is not sufficient to maintain good quality of the compressed image without sacrificing the compression ratio. Thus, new image compression algorithm based on order reduction using sub-image formation is proposed for lossy compression scheme. Obviously, the tradeoff between compression ratio and picture quality is an important issue in image compression. The importance of running time of compression was further investigated as this process can be used in high speed data transmission applications. The simulation process is carried out determining the computation time using MATLAB. The algorithm tested for still images of different size too.
Merkle Tree Traversal Techniques

5 Chapter 1: Introduction 6 Chapter 2: The Basics 8 2.1 Hash and One–Way Functions 8 2.1. 1 One Way Functions 8 2.1. 2 Hash functions 9 2.2 Digital Signatures 9 2.2.1 The Definition 9 2.2.2 One Time Digital Signatures 10 2.3 The Original Merkle Digital Signature 10 2.3.
Dynamics Verification Experiment of the Stewart Parallel Manipulator

As the basis of dynamic analysis and driving force calculation, dynamic models and dynamic parameters are important issues in mechanical design and control. In this paper, a dynamics verification experiment, which covers both dynamic models and dynamic parameters as a whole, is carried out on the typical Stewart parallel manipulator. First, the complete dynamic model of the Stewart manipulator is derived, considering the force sensors. The Newton-Euler method with clear physical meaning is adopted to facilitate understanding and parameter definitions. The dynamic parameters are deduced based on the established three-dimensional virtual prototype and adjusted with actual measurements. The recorded trajectory, instead of the theory trajectory, is adopted to calculate the theoretical limb forces. The practical limb forces are measured using pull pressure sensors. Finally, the dynamic model and identified parameters are verified by comparing the limb forces obtained using the above two approaches. Experiment results show that theoretical and practical limb forces coincide well, with a small maximum RMS (root mean square) error of 1.516N and forces ranging from 10N to 40N. Additionally, the established dynamics verification algorithm, which involves dynamic modelling, a parameter identification approach and a data analysis method, are generic and practical, and can be flexibly applied to the dynamic analysis of other parallel manipulators.
The role of parametrization in the multimedia authoring process

The development of multimedia presentations has become increasingly popular among professionals of different areas such as designers, publishers, executives, etc. A great deal of authoring systems are mostly focused on the final product: the presentation, providing many tools to help in its elaboration. This targeting causes most of the systems, to a certain extend, to leave behind the authoring process and, therefore, the author himself, with no adequate support for the design of his/her presentation, rendering the authoring task harder if not complicated at least. This problem is even more acute knowing that most users of authoring tools are professionals from areas such as the arts, film industry, education, medicine, etc., with little or no experience in programming. It is this lack of concern with authors and the authoring process that has led us to develop a new authoring paradigm totally focused on the author. Many aspects of the authoring and design process have been studied. A new phase has been identified, namely, the presentation parametrization.
The HARPY speech recognition system

Abstract : The Harpy connected speech recognition system is the result of an attempt to understand the relative importance of various design choices of two earlier speech recognition systems developed at Carnegie-Mellon University: The Hearsay-1 system and the Dragon system. Knowledge is represented in the Hearsay- 1 system as procedures and in the Dragon system as a Markov network with a- priori transition probabilities between states. Systematic performance analysis of various design choices of these two systems resulted in the HARPY system, in which knowledge is represented as a finite state transition network but without the a-priori transition probabilities. Harpy searches only a few 'best' syntactic (and acoustic) paths in parallel to determine the optimal path, and uses segmentation to effectively reduce the utterance length, thereby reducing the number of state probability updates that must be done. Several new heuristics have been added to the HARPY system to improve its performance and speed: detection of common sub-nets and collapsing them to reduce overall network size and complexity, eliminating the need for doing an acoustic match for all phonemic types at every time sample, and semi-automatic techniques for learning the lexical representations (that are needed for a steady-state system of this type) and the phonemic templates from training data, thus automatically accounting for the commonly occurring intra-word coarticulation and juncture phenomena. Inter-word phenomena are handled by the use of juncture rules which are applied at network generation time, thereby eliminating the need for repetitive and time consuming application of phonological rules during the recognition phase.