Miracle-dz/UniFAR-FTUs huggingface dataset:
Emotional intelligence in a stupid world

Purpose – The purpose of this article is to review the five emotional intelligence (EI) competencies as originally outlined by Daniel Goleman but within the context of academic libraries. EI skills can be more important to have than intellectual ability in creating effective organizations. Academic librarians, particularly those in leadership positions, need to be mindful of EI competencies to avoid miscommunication when working with colleagues. Used skillfully, EI has the ability to build more cohesive and stronger collaborations inside and outside the library. EI is just as important for early career librarians as it is for those in senior management positions. Design/methodology/approach – This article reviews the five EI competencies as originally outlined by Daniel Goleman but within the context of academic libraries. It focuses on empathy to demonstrate how its application in libraries can facilitate teamwork, engender better cooperation and strengthen an organization’s culture. Findings – Most libr.
Getting Started with Business Analytics: Insightful Decision-Making

Assuming no prior knowledge or technical skills, Getting Started with Business Analytics: Insightful Decision-Making explores the contents, capabilities, and applications of business analytics. It bridges the worlds of business and statistics and describes business analytics from a non-commercial standpoint. The authors demystify the main concepts and terminologies and give many examples of real-world applications. The first part of the book introduces business data and recent technologies that have promoted fact-based decision-making. The authors look at how business intelligence differs from business analytics. They also discuss the main components of a business analytics application and the various requirements for integrating business with analytics. The second part presents the technologies underlying business analytics: data mining and data analytics. The book helps you understand the key concepts and ideas behind data mining and shows how data mining has expanded into data analytics when considering new types of data such as network and text data. The third part explores business analytics in depth, covering customer, social, and operational analytics. Each chapter in this part incorporates hands-on projects based on publicly available data. Helping you make sound decisions based on hard data, this self-contained guide provides an integrated framework of data mining in business analytics. It takes you on a journey through this data-rich world, showing you how to deploy business analytics solutions in your organization.
Implementation and Comparison of a Secure Lossless Image Encryption-then-Compression Algorithms

— Image Encryption is important in the field of information security. In some of the practical scenario images are needed to be encrypted prior to compression. Most of image encryption techniques have some performance issues, so there is a need to determine performance of each method. In this paper we implement and compare three image Encryption algorithms. The Encryption algorithms are Arnolds transform, Combination of different permutations and Random Permutation of Clusters of Prediction errors. In Arnolds transform method, shuffling of pixel positions is by iteratively performing a linear transformation. In Combinational Random Permutation method, encryption is achieved by considering the combination of bits, pixels and blocks permutations to reduce perceivable information. In Random Permutation of Clusters of Prediction errors method, encryption is achieved in prediction error domain. Arithmetic coding is used to achieve Compression. Comparative analysis is performed based on performance evaluation factors. Sequential Decompression and Decryption is performed.
Patent Retrieval in Chemistry Based on Semantically Tagged Named Entities

This paper reports on the work that has been conducted by Fraunhofer SCAI for Trec Chemistry (Trec-Chem) track 2009. The team of Fraunhofer SCAI participated in two tasks, namely Technology Survey and Prior Art Search. The core of the framework is an index of 1.2 million chemical patents provided as a data set by Trec. For the technology survey, three runs were submitted based on semantic dictionaries and noun phrases. For the prior art search task, several elds were introduced into the index that contained normalized noun phrases, biomedical as well as chemical entities. Altogether, 36 runs were submitted for this task that were based on automatic querying with tokens, noun phrases and entities along with dierent search strategies.
GINKGO, a program for non-standard multivariate fuzzy analysis

Many multivariate programs are expensive commercial packages or require expensive third party software. Other applications are freely available to academic researchers but are limited to one operating system. This paper presents GINKGO, a free easy-to-use multi-platform Java application mainly oriented towards to non-standard classification analysis. This orientation is pursued (1) by providing users with several similarity and dissimilarity measures, (2) by allowing the execution of several crisp or fuzzy prototype-based clustering methods on arbitrary distance matrices, and (3) by including standard and non-standard facilities for evaluating the quality of clusters. Along with the software presentation, two methodological improvements are also given, which are available in the program. First, the implementation of a new
Delay-aware Scheduling in Wireless Coding Networks: To Wait or Not to Wait

Delay-aware Scheduling in Wireless Coding Networks: To Wait or Not to Wait. (December 2010) Solairaja Ramasamy, B.Tech., College of Engineering, Guindy, Anna University, India Chair of Advisory Committee: Dr.Alex Sprintson Wireless technology has become an increasingly popular way to gain network access. Wireless networks are expected to provide efficient and reliable service and support a broad range of emerging applications, such as multimedia streaming and video conferencing. However, limited wireless spectrum together with interference and fading pose significant challenges for network designers. The novel technique of network coding has a significant potential for improving the throughput and reliability of wireless networks by taking advantage of the broadcast nature of wireless medium. Reverse carpooling is one of the main techniques used to realize the benefits of network coding in wireless networks. With reverse carpooling, two flows are traveling in opposite directions, sharing a common path. The network coding is performed in the intermediate (relay) nodes, which saves up to 50% of transmissions. In this thesis, we focus on the scheduling at the relay nodes in wireless networks with reverse carpooling. When two packets traveling in opposite directions are available at the relay node, the relay node combines them and broadcasts the resulting packet. This event is referred to as a coding opportunity. When only one packet is available, the relay node needs to decide whether to wait for future coding opportunities, or to transmit them without coding. Though the choice of holding packets exploits the positive aspects of network coding, without a proper policy in place that controls how long the packets should wait, it will have an adverse impact on delays
The C4MIP experimental protocol for CMIP6

Coordinated experimental design and implementation has become a cornerstone of global climate modelling. So- called Model Intercomparison Projects (MIPs) enable systematic and robust analysis of results across many models to identify common signals and understand model similarities and differences without being hindered by ad-hoc differences in model set-up or experimental boundary conditions. The activity known as the Coupled Model Intercomparison Project 25
Back to Back Connected Multilevel Converters: A Review

The new power converter topologies i.e multilevel converter is major breakthrough in power conditioning applications. The role of multilevel converters for AC-AC conversion when connected Back to Back is now proving an achievement of mile stone in the field of high power conversion. In view of this a comprehensive review of Back to Back connected multilevel converters is presented in this paper, which focus mainly on its topologies, control strategies and real time industrial applications. The aim of this review is to group and review the recent publications, in order to establish the current state of the art and trends of the Back to Back connected multilevel power converters (MPCs) to provide researchers meaningful information about
Elements of real-space imaging: a proposed taxonomy

Along with the marriage of motion pictures and computers has come an increasing interest in making images appear to have a greater degree of realness or presence, or `realspace imaging. '' Such topics as high-definition television, 3-D, fisheye lenses, surrogate travel, and `cyberspace'' reflect such interest. These topics are usually piled together and are unparsable, with the implicit assumptions that the more resolution, the more presence, and the more presence, the better. This paper proposes a taxonomy of the elements of real-space imaging. The taxonomy is organized around six sections: (1) monoscopic imaging, (2) stereoscopic imaging, (3) multiscopic imaging, (4) panoramics, (5) surrogate travel, and (6) real-time imaging.
Automatic verification of string manipulating programs

In this dissertation, we investigate the string verification problem: Given a program that manipulates strings, we want to verify assertions about string variables. We formalize the string verification problem as reachability analysis of string systems and demonstrate that the string analysis problem is undecidable in general. We present sound automata-based symbolic string analysis techniques for automatic verification of string manipulating programs. String analysis is a static analysis technique that determines the values that a string expression can take during program execution at a given program point. This information can be used to detect security vulnerabilities and program errors, and to verify that program inputs are sanitized properly. Most important Web application vulnerabilities, such as SQL Injection, Cross Site Scripting and Malicious File Execution, are due to inadequate manipulation of string variables. We use our automata-based string analysis techniques to detect and prevent such vulnerabilities in web applications. Our approach consists of three phases: Given an attack pattern, we first conduct a vulnerability analysis to identify if strings that match the attack pattern can reach security-sensitive functions. Next, we compute the vulnerability signature which characterizes all input strings that can exploit the discovered vulnerability. Given the vulnerability signature, we then construct sanitization statements that (1) check if a given input matches the vulnerability signature and (2) modify the input in a minimal way so that the modified input does not match the vulnerability signature. Our approach is capable of generating relational vulnerability signatures (and corresponding sanitization statements) for vulnerabilities that are due to more than one input. We extend our automata-based approach to analyze systems with both string and integer variables. We present a composite symbolic verification technique that combines string and size analyses with the goal of improving the precision of both. Our composite analysis automatically discovers the relationships among the integer variables and the lengths of the string variables. Finally, we present a relational string verification technique based on multi-track automata and abstraction. Our approach is capable of verifying properties that depend on relations among string variables. We have developed a tool called STRANGER that implements our automata-based symbolic string analysis approach. STRANGER can be used to find and eliminate string-related security vulnerabilities in PHP applications.
Research on Hardware I/O Passthrough in Computer Virtualization

Processors have evolved to improve performance for virtualized environments. But A commodity I/O device has no support for virtualization. A VMM can assign such a device to a single guest with direct, fast, but insecure access by the guest's native device driver. Discover one such I/O performance enhancement called device passthrough. With the technology, the guest operating system can use the hardware device as if it were a non-virtualized system. In this paper, we describe the innovation and present preliminary results how to improve performance of PCI devices using hardware support from Intel (VT-d) or AMD (IOMMU).
Analysis of the Water Level Fluctuation in Koyna-Warna Region, India

ABSTRACT Koyna region in India is known to be the largest case of the Reservoir Triggered Seismicity (RTS) in the world with Magnitude 6.3 (M 6.3) earthquake in 1967. The region is seismically active even after forty five years with occurrences of earthquakes up to M 5.0. The porous crustal rocks of Koyna – Warna region respond to changes in the prevailing stress / strain regime. These changes induce variations in the water level in bore wells before; during and after an earthquake and their study can help in understanding the earthquake genesis in the region. In this work the observed water levels in the bore wells have been analyzed and found the co-seismic water level changes in some wells. The earthquake on 14 th March 2005 with M 5.1 in Koyna – Warna region has been studied by using wavelet transformations and the results reveals the significant co-seismic changes in some of the bore wells. The Ukalu well has showed the maximum change in the water level since the epicenter is close to the well. The focal mechanism and the distance of the epicenter play important role in the variation of the water level fluctuations.
Automatic Application-Level Checkpointing for High Performance Computing Systems

For high-performance computational science, the changing nature of the computational infrastructure is leading to higher failure rates, so it is becoming more important for production systems to be fault-tolerant. Typically, on high performance computing systems (HPC), fault-tolerance is provided by a checkpoint and restart (CPR) mechanism. It is our belief that, neither of the two existing styles of CPR, system-level and application-level checkpointing, are well suited for the current and future generations of HPC systems. System-level checkpointing mechanisms (SLC), which are either implemented as part of the operating system or in a user space library, are very easy to use but are not available on all platforms, and developing one or porting one to a new platform is a very meticulous task. The developers of SLC do not "provided any guarantees" that their system will work with even slightly different versions of a platform's compiler, linker, or C library. Application-level checkpointing (ALC) mechanisms are implemented directly in the source code of the application, making the checkpointing code work anywhere the application can run. However, implementing ALC requires the application programmer to devote a "huge effort" to both program and debug the checkpointing routines. This dissertation proposes Automatic Application-Level Checkpointing (AALC) as a way to achieve the works everywhere flexibility of ALC with the ease of use associated with using SLC. There is a spectrum of solutions that could be described as AALC: the most appropriate solution for a particular domain depends on the application programmer's needs and on limitations imposed by the machine(s) he plans to run his code on. In this dissertation we will examine two points along that spectrum, two different approaches to AALC, logged execution and managed execution. We will show that each approach has overheads similar to a widely used and well supported SLC mechanism, and discuss how they were implemented and how they differ from each other. We will also discuss how AALC could be expanded to optimize checkpoint size and reduce the overhead of checkpointing.
2.5D local feature matching system

A 3D visual tracking system was developed to investigate pose corrected surface sample patches for creating pose invariant SIFT features. The system comprises of a binocular stereo vision system and computer controlled turntable, Figure 1a. Rangemaps and images were captured of the object situated on the turntable, these were then aligned using the ground truth of the turntable motion. The system can capture both 3D surface structure and 2D surface texture simultaneously, without suffering from texture alignment issues affecting Lidar systems, such as seen in FRGC 2.0 [1].
Tracking Information Flows in Interactive and Object-Oriented Programs

This thesis improves the current state of the art on information-flow control of interactive and object-oriented programs, respectively. Given a policy which specifies which information flows are permitted in a program, the objective here is to ensure that only flows satisfying the policy can occur. The challenge is to develop a sane policy and an automated, permissive enforcement mechanism for said policy. For interactive programs, we give a progress-sensitive noninterference (PSNI) policy which takes into account the confidentiality level of the presence of messages. We show that the finer granularity obtained through presence levels makes PSNI parallel compositional, and we give a proven-sound, static, flow-sensitive type-based enforcement of PSNI. We show that for deterministic interactive programs, it suffices to consider simple stream-based attackers. We develop in this setting a progress-bounded noninterference (PBNI) which bounds the leak through progress observations to a logarithm of the number of observable inputs to the program. We combine a static, flow-sensitive type-based enforcement for a progress-insensitive noninterference policy and a output-buffering program transformation to a hybrid enforcement of PBNI for a language inspired by JavaScript. The enforcement tracks flows through hithero untreaded language constructs, such as event propagation, event hierarchies and event handler switching. For object-oriented programs, we present a static, flow-sensitive type system for tracking flows through lazy static class initializations with persistent failures, a language construct in languages such as Java and C#, untreated by tools such as Jif. We show how a class initialization status can be utilized as a covert channel for moving 1 bit of information, and show that the type system enforces a termination-insensitive notion of noninterference.
On quality of service in mobile wireless networks

This paper addresses the choices that need to be made in the design of a quality of service (QoS) framework for mobile and wireless networks. An uncontrollably time varying environment, arising due to physical processes such as fading as well as systematic processes such as handoffs, is an inalienable characteristic of these networks. Therefore, the laissez faire model of purely reactive applications adapting to a black-box network does not work well for multimedia applications in the presence of wireless and mobility. However, as we empirically show, the other extreme of applying rigid quality of service models borrowed from the wired networks, with correspondingly complex network mechanisms, is also a bad idea because of the often adverse interaction between higher layer protocols with mechanisms such as rerouting and MAC control. We advocate that mobile network and wireless link layer mechanisms should be kept simple and stupid, though not oblivious of QoS, and that applications should be made more sophisticated with QoS renegotiation and adaptation capabilities. The paper describes the necessary support required in various layers of mobile wireless networks, and advocates specific solutions based on empirical validations.
Learning-based approach for license plate recognition

Presents a learning-based approach for the construction of a license-plate recognition system. The system consists of three modules. They are, respectively, the car detection module, the license-plate segmentation module and the recognition module. The car detection module detects a car in a given image sequence obtained from a camera with a simple color-based approach. The segmentation module extracts the license plate in the detected car image using neural networks as filters for analyzing the color and texture properties of the license plate. The recognition module then reads the characters on the detected license plate with a support vector machine (SVM)-based character recognizer. The system has been tested with 1000 video sequences obtained from toll-gates, parking lots, etc., and has shown the following performances on average: car detection rate 100%, segmentation rate 97.5%, and character recognition rate about 97.2%.
Performance Study of Different Medical Images Based on Morphology in Noisy Environment

Identification of Medical images is done using their regional structures. Edge detection is a basic element in the area of image processing and computer vision particularly for feature extraction. Edge detection simplifies the amount of data to be processed with modifying the structural properties of the image. Edge is a boundary between the foreground and background. Medical image edge detection concentrates on object recognition of human organs but involves noise along with shadows and boundaries. Several diagnostic tools used to detect the disease are CT, MRI, PET, US and DICOM. In this paper performance of CT and DICOM images are evaluated in noisy environment using morphology and edge detection algorithms. A comparision of different edge detecting methods using different noises is performed and evaluated based on parameters like correlation coefficient and PSNR. The results judge the ability of operators in presence of noise.
Dimensional Density and Clustering in Scatterplots

Scatterplots matrix is still one of the most popular and widely used approaches to explore multi-dimensional datasets with the advantages of simplicity and clarity. However, this technique is suffering from some shortages. It will result in clutter when displaying large complex datasets, because the data points overlap each other. In addition, it's difficult to convey more information except the distributions between two dimensions. This paper improves and extends the current scatterplots to address these shortcomings. a) It glances at the scatterplots matrix and emphasize its single unit by overview + detail. b) It uses clustering algorithm to divide all the points in a scatterplots into several groups to avoid confusion. c) Bar axis instead of line axis is used to illustrate the density on each dimension, conveying more information. d) Histogram is another approach to express the same data feature with bar axis. e) Several interaction techniques are adopted to adjust the visualization. Finally, some scenarios are created to argue that this approach is available and effective. This approach is helpful in visualizing