Miracle-dz/UniFAR-FTUs huggingface dataset:
Mathematical system theory and digital control

This paper is dedicated to the formal definition of a dynamical system controlled by a digital device. Starting from general considerations, we introduce the "natural" state space and turn then to its simplification using mathematical arguments. Finally we relate this state space to the common real space and show how the digital system theory proposed here encompasses the usual control theory.
Statistical analysis of the application of Wilcoxon and Mann-Whitney U test in medical research studies.

Although non-normal data are widespread in biomedical research, parametric tests unnecessarily, predominate in statistical analyses. Five biomedical journals were surveyed and for all studies which contain at least the unpaired t-test or the non-parametric Wilcoxon and Mann-Whitney U test investigated the relationship between the choice of a statistical test and other variables such as type of journal, sample size, randomization, sponsoring etc. The non-parametric Wilcoxon and Mann-Whitney U were used in 30% of the studies. In a multivariable logistic regression the type of journal, the test object, the scale of measurement and the statistical software were significant. The non-parametric test was more common in case of non-continuous data, in high-impact journals, in studies in humans, and when the statistical software is specified, in particular when SPSS was used.
A formula for determination of the roughness height for turbulent heat transfer between the land surface and the atmosphere over bare soil surfaces

Roughness height for heat transfer is a crucial parameter in estimation of heat transfer between the land surface and the atmosphere, especially when radiometric measurements are used. Although many empirical formulations have been proposed, the uncertainties associated with these formulations are shown to be large, especially over sparse canopies. In this contribution, a simple physically based formula is derived for the estimation of the roughness height for heat transfer for bare soil surfaces. The new formula is validated with measurements collected in a filed campaign in Xiaotangshan, near Beijing, China in 2002. The present model in further shown to be able to explain the diurnal variation in the roughness height for heat transfer. The turbulent heat fluxes estimated using radiometric measurements as inputs are markedly improved when this new formula is used.
Network Coding and Distributed Compression over Large Networks: Some Basic Principles

The fields of Network Coding and Distributed Compression have focused primarily on finding the capacity for families of problems defined by either a broad class of networks topologies (e.g., directed, acyclic networks) under a narrow class of demands (e.g., multicast), or a specific network topology (e.g. three-node networks) under different types of demands (e.g. Slepian-Wolf, Ahlswede-Korner). Given the difficulty of the general problem, it is not surprising that the collection of networks that have been fully solved to date is still very small. This work investigates several new approaches to bounding the achievable rate region for general network source coding problems - reducing a network to an equivalent network or collection of networks, investigating the effect of feedback on achievable rates, and characterizing the role of side information. We describe two approaches aimed at simplifying the capacity calculations in a large network. First, we prove the optimality of separation between network coding and channel coding for networks of point-to-point channels with a Byzantine adversary. Next, we give a strategy for calculating the capacity of an error-free network by decomposing that network into smaller networks. We show that this strategy is optimal for a large class of networks and give a bound for other cases. To date, the role of feedback in network source coding has received very little attention. We present several examples of networks that demonstrate that feedback can increases the set of achievable rates in both lossy and lossless network source coding settings. We derive general upper and lower bounds on the rate regions for networks with limited feedback that demonstrate a fundamental tradeoff between the forward rate and the feedback rate. For zero error source coding with limited feedback and decoder side information, we derive the exact tradeoff between the forward rate and the feedback rate for several classes of sources. A surprising result is that even zero rate feedback can reduce the optimal forward rate by an arbitrary factor. Side information can be used to reduce the rates required for reliable information. We precisely characterize the exact achievable region for multicast networks with side information at the sinks and find upper and lower bounds on the achievable rate region for other demand types.
Vision-Based Gesture Recognition Referring to Human Structure

This article proposed a new method which introduces human body structure into gesture recognition besides the traditional vision information. By establishing the target's skeleton model, the system could rule out background interference quickly from the real-time frames, then locate the target's joints accurately, and track the gestures automatically. This method applies a common monocular webcam for image input instead of expensive depth cameras or complex binocular cameras. It can build a vivid human model and simulate the target's gestures well. After a modified KNN classification which has self-learning ability, the relationships between these joints are analyzed, and the corresponding postures and movements are identified. This method avoids global scanning in each frame and simplifies the classification, thus the computation decreases sharply. The results show that the method has a good tolerance of complex background, it can solve the target missing well.
Survey on web mining techniques for Extraction of top k list

Now a days finding proper information within less time is important need But one more problem is that very small percentage data available on web is meaningful and interpretable and lot of time needed to extract. There is need of system that deals with the method for extracting information from top k web pages which contains top k instances of interested topic. Examples include “the 10 tallest towers in the world”. In comparison with other structured information like web tables Information in top-k lists contains larger and richer information of higher quality, and interesting. Therefore top-k list are very valuable as it can help to develop open domain knowledge bases to applications such as search for truth answering. Here we have given survey of different systems used for extraction of top k list. Keywords— top k list, information extraction, top k web pages, structured information,
Dynamic Analysis of Android Malware

Expecting a shipment of 1 billion Android devices in 2017, cyber criminals have naturally extended their vicious activities towards Google’s mobile operating system: threat researchers are reporting an alarming increase of detected Android malware from 2012 to 2013. In order to have some control over the estimated 700 new Android applications that are being released every day, there is need for a form of automated analysis to quickly detect and isolate new malware instances. We present the TraceDroid Analysis Platform, a scalable, automated framework for dynamic analysis of Android applications to detect suspicious, possibly malicious apps using a comprehensive method tracing scheme dubbed TraceDroid. We provide means to aid further post-analysis on suspects to allow malware researchers to fully understand their behavior and ultimately label them as malicious or benign. Our framework can therefore aid and direct scarce analysis resources towards applications that have the greatest potential of being malicious. We show that TraceDroid is almost 50% faster than Android’s original profiler implementation while revealing much more detail about the app’s execution. This makes it a perfect tool not only for malware analysts, but also for app developers and reverse engineers. For a random set of 35 both benign and malicious samples, the stimulation engine of our TraceDroid Analysis Platform achieves an average code coverage of 33.6% which is even more than when they are stimulated manually (32.9%).
The Eifel TCP extension over GPRS RLC: effects of long radio blackouts

We present a GPRS simulation platform developed as a new module of the UCB/LBNL/VINT network simulator (ns-2). This platform provides the functionalities of the RLC/MAC layer of GPRS with the support of several mobile stations in a single cell. It enables us to evaluate end to end performance of TCP connections over GPRS. Simulations show that long delays caused by long radio blackouts could cause spurious retransmissions of TCP segments. We investigate the performance of the new Eifel TCP extension with respect to this problem.
Secure APIs and Protocols to Connect Enterprise Applications to Cloud Services

The is paper identifies the need for secure interoperability of application programming interfaces (APIs) and protocols for the connection of enterprise applications to cloud services, provides an overview of the researched literature that asserts the need for secure interoperability APIs and protocols, and outlines a potential solution for the use of secure APIs and protocols for the interoperation of enterprise applications and cloud services via the use of enabling technology such as service oriented architecture (SOA).
Mapping and Partitioning of Task Graphs Using Kernighan-Lin/Fiduccia- Mattheyses Algorithm

Hardware Software partitioning of a task graph refers to the mapping of task nodes to physical components such as processors, Application Specific Integrated Circuits, memory with an optimization of parameters involving execution time, physical area, cost of memory and other factors. This works evaluates the performance of iterative min-cut heuristic Fiduccia-Mattheyses for HW and SW partitioning. The results shows the algorithm can be very effective in giving the bi-partite partition.
MultiSearchBP: Environment for Search and Clustering of Business Process Models

This paper presents a Business Process Searching and Grouping Environment called MultiSearchBP. It is based on a three-level architecture comprising Presentation level, Business level (Structural Analysis, Indexing, Query, and Grouping) and Storage level. The search process is performed on a repository that contains 146 Business Process (BP) models. The indexing and query processes are similar to those of the vector space model used in information retrieval and the clustering process uses two clustering algorithms (Lingo and STC). MultiSearchBP uses a multimodal representation of BPs. It also presents an experimental evaluation process to consider the judgments of eight expert evaluators from a set of similarity scores obtained from previous manual comparisons made between the BP models stored in the repository. The measures used were graded precision and graded recall. The results show high accuracy. Keywords—Business processes, information retrieval, multimodal search, clustering.
Automatic Data Migration into the Cloud

Relational databases have been used for decades to store data. Using scale up, relational databases require a bigger and bigger server with more CPUs, more memory, and more disk storage to keep all the tables to support more concurrent users. However, big servers tend to be highly complex, proprietary, and disproportionately expensive, unlike the low-cost, commodity hardware. Therefore, it becomes important to store data efficiently and compute with massive amount of data, providing high scalability, providing high performance and availability at low costs. This leads to the invention of cloud databases, for instance NoSQL databases. NoSQL databases have many advantages such as reading and writing data quickly, supporting massive storage and low cost. The scaling approach in cloud databases is scale out, which is used to add multiple servers, and the data structure of storage is in the form of key-value pairs. However, it can be a challenge for enterprises to migrate existing relational databases to highly scalable NoSQL databases on clouds. In this thesis, we propose an automatic data migration model which will assist enterprises to migrate their relational databases efficiently and transparently to the cloud databases. We propose four migration methods to migrate data in four different ways. Each migration method is independent of the others and stores the migrated relational database in different formats in the cloud database. We design a system to implement the automatic data migration model. As a proof of concept, we successfully migrated a relational database from Microsoft SQL Server to a cloud database Amazon SimpleDB using four different migration methods. Furthermore, we have conducted extensive experiments on Amazon SimpleDB to evaluate the performance of our model in terms of computational time, storage cost, sharding and redundancy. Based on these experiments and detailed analysis of each migration method, our system allows enterprises to determine which method is suitable for their data migration. Furthermore, our experimental evaluation shows that our solution is promising and can migrate data from the relational databases to the cloud databases.
Component temperatures inversion for remote sensing pixel

A simple directional thermal infrared model is presented, and its inversion is discussed in detail. The information contents in data space and parameter space are defined, and the process of information transfer in inversion is studied. Based on this study, the authors made improvement to the cost function. The forward model and inversion method are validated with indoor directional measurement data. The results show that the model fits the measurement data very well, and their study on the information transfer in inversion is helpful to use the information of given observations in a more effective way.
Enabling Indoor Location-based Services Using Ultrasound

In the context of location, large amounts of information are available on the Internet to be accessed by people via different devices. However, at times people have to manually search and access it. If the space where location-based services are available can be identified by hand-held devices, people can be prompted with services available around them. This thesis explores the use of ultrasound as a communication medium to tag such spaces and access location-based services with the related information; and demonstrates the indoor implementation of the prototype of a location-based services enabling system for hand-held devices. This system allows users to search and access the available services in their surroundings through their hand-held devices. A beacon generator placed in the service location broadcasts a service code mappable to the services particular to that location encoded in an ultrasound signal. The hand-held device can identify this signal and prompt the user with available services. System design and architecture is demonstrated and the viability of the system is tested through a variety of environments and scenarios showing that potentially this has both a wide range of applications and can enhance the way people access locationbased services.
European spatial planning observatories and maps: merely spatial databases or also effective tools for planning?

Over the past decades, a large number of Spatial Planning Observatories (SPOs) have emerged in Europe in response to certain factors, such as the growing complexity of urban systems, the development of GIScience or European Union territorial policies. Previous studies have shown that SPOs have little effect when confronted with planning practice. It is believed that one of the main reasons is that the maps held by SPOs are not always focused on decision making; however, this argument has not yet been sufficiently proven. To address this problem and inspired by the doctrine of performance-based evaluation for spatial planning, we assess the performance for planning that a relevant number of European SPOs have according to their maps. The assessment takes into consideration two assumptions: (A) maps must be of continuing relevance to the situation as it evolves; (B) maps must help in defining operational decision situations for different focus groups (decision makers, planners, the public). We find that SPO maps could be excellent tools for planning, although an important number of improvements are still needed. In this sense, we discuss the potential role of SPO maps in addressing a collaborative dialogue between key planning agents in analysing urban dynamics, as well as in fostering new urban governance processes through the consideration of public participation.
Evolutionary structure of hidden Markov models for audio-visual Arabic speech recognition

In this paper, we present an Audio-Visual Automatic Speech Recognition System that combines the acoustic and the visual data. The proposed algorithm here, for modelling the multimodal data, is a Hidden Markov Model (HMM) hybridised with the Genetic Algorithm (GA) to determine its optimal structure. This algorithm is combined with the Baum-Welch algorithm, which allows an effective re-estimation of the probabilities of the HMM. Our experiments show the improvement in the performance of the most promising audio-visual system, based on the combination of GA/HMM model compared to the traditional HMM.
TRANSFORMING INFORMATION LITERACY IN THE SCIENCES THROUGH THE LENS OF E-SCIENCE

In 2011, the ACRL Science & Technology Section (STS) completed its five-year review of the Information Literacy Standards for Science and Engineering/Technology. Predicated by the evolving nature of scholarship and research in the sciences, the reviewing task force strongly recommended that the standards be revised. This paper considers the broad recommendations of the task force, using the framework of e-Science – team-based, data-driven science – to address areas of necessary transformation in information literacy: an advanced team-based model that crosses disciplinary boundaries; a recognition that individuals and groups not only consume information, but also produce it; and stronger interplay between information literacy and complementary literacies. This paper also extrapolates beyond the sciences, referencing broader trends within higher education.
Coding Techniques for Error Correction and Rewriting in Flash Memories

Coding Techniques for Error Correction and Rewriting in Flash Memories. (August 2010) Shoeb Ahmed Mohammed, B.Tech., Indian Institute of Technology Roorkee Co–Chairs of Advisory Committee: Dr. Anxiao Jiang Dr. Scott L. Miller Flash memories have become the main type of non-volatile memories. They are widely used in mobile, embedded and mass-storage devices. Flash memories store data in floating-gate cells, where the amount of charge stored in cells – called cell levels – is used to represent data. To reduce the level of any cell, a whole cell block (about 10 cells) must be erased together and then reprogrammed. This operation, called block erasure, is very costly and brings significant challenges to cell programming and rewriting of data. To address these challenges, rank modulation and rewriting codes have been proposed for reliably storing and modifying data. However, for these new schemes, many problems still remain open. In this work, we study error-correcting rank-modulation codes and rewriting codes for flash memories. For the rank modulation scheme, we study a family of oneerror-correcting codes, and present efficient encoding and decoding algorithms. For rewriting, we study a family of linear write-once memory (WOM) codes, and present an effective algorithm for rewriting using the codes. We analyze the performance of our solutions for both schemes.
Information Searching and Search Models

Key terms related to information searching and search models are defined. A historic context is provided to illustrate the evolution of the four main digital environments that users interact with in their search process to offer readers background information regarding the transition from manual information systems to computer-based information retrieval (IR) systems, as well as the transition from intermediary searching to end-user searching. Emphasis is placed on the review of different levels of information searching from search tactics/moves, search strategies, and usage patterns, to search models and associated factors in relation to task, user knowledge structure, IR system design, and social-organization context. Search models are further classified into two types, with one type illustrating information search process (ISP) and the other type emphasizing the factors that influence the process. In addition, unsolved problems and future research are discussed and suggested
Towards Functional and Constructional Perspectives on Business Process Patterns

Contemporary organizations need to be more agile to keep up with the swiftly changing business environment. The Normalized Systems theory has proven to introduce this required agility within an organization, starting at the software level. However, in order to realize an agile enterprise, also business processes have to exhibit this evolvability. Currently, the relevance of Normalized Systems theory at the business process level has been demonstrated, however no equivalent to the software elements at the organizational level have been developed. Therefore, this paper investigates whether it is possible to base such elements on the available business process patterns in literature. After investigating the usefulness of the MIT Process Handbook with regard to this purpose, this paper emphasizes the importance of recognizing the so-called functional-constructional gap and identifies the need for developing modular and evolvable constructional business process design patterns to further extend Normalized Systems theory on the business level. Index Terms—Normalized Systems, business process patterns, analysis patterns, evolvability, MIT Process Handbook
A 2GHz quadrature hybrid implemented in CMOS technology

We have derived a lumped-element circuit from its coupled line counterpart for a 90/spl deg/, 3dB hybrid coupler. We discuss the uses, design, and characteristics of such circuits in CMOS technology. We show measured characteristics of an example 50/spl Omega/, 2GHz coupler with 65dB of image rejection, 18dB of directivity and a 4.7dB noise figure.