Miracle-dz/UniFAR-FTUs huggingface dataset:
Scalable Computing: Practice and Experience

Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive research has been conducted about these formats in the context of performance optimization of the sparse matrix-vector multiplication algorithms, but memory efficient formats for storing sparse matrices are still under development, since the commonly used storage formats (like COO or CSR) are not sufficient. In this paper, we propose and evaluate new storage formats for sparse matrices that minimize the space complexity of information about matrix structure. The first one is based on arithmetic coding and the second one is based on binary tree format. We compare the space complexity of common storage formats and our new formats and prove that the latter are considerably more space efficient.
International Journal of Advanced Research in Computer Science and Software Engineering

— Text mining is nothing but the discovery of interesting knowledge in text documents. But there is a big challenging issue that how to guarantee the quality of discovered relevant features. And that are in the text documents for describing user preferences because of the large number of terms, patterns and noise. For text mining there are basically two types of approaches; one is term based approach and another is phrase based approach. But term based approach suffered with the problem of polysemy and synonymy. And phrase based approach suffered with low frequency occurrence. Disputant are use for categorization is one of the new application of text mining where document are arrange as per the different opponent.
Selection and sorting in the restore model

We consider the classical selection and sorting problems in a model where the initial permutation of the input has to be restored after completing the computation. While the requirement of the restoration is stringent compared to the classical versions of the problems, this model is more relaxed than a read-only memory where the input elements are not allowed to be moved within the input array. We first show that for a sequence of n integers, selection (finding the median or more generally the k-th smallest element for a given k) can be done in O(n) time using O(lg n) words1 of extra space in this model. In contrast, no linear-time selection algorithm is known which uses polylogarithmic space in the read-only memory model. For sorting n integers in this model, we first present an O(n lg n)-time algorithm using O(lg n) words of extra space. When the universe size U is polynomial in n, we give a faster O(n)-time algorithm (analogous to radix sort) which uses O(ne) words of extra space for an arbitrarily small constant e > 0. More generally, we show how to match the time bound of any word-RAM integer-sorting algorithms using O(ne) words of extra space. In sharp contrast, there is an Ω(n2/S)-time lower bound for integer sorting using O(S) bits of space in the read-only memory model. Extension of our results to arbitrary input types beyond integers is not possible: for "indivisible" input elements, we can prove the same Ω(n2/S) lower bound for sorting in our model. En route, we develop linear-time in-place algorithms to extract leading bits of the input array and to compress and decompress strings with low entropy; these techniques may be of independent interest.
Engineering the Evolution of Self-Organising Behaviours in Swarm Robotics : A Case Study

Evolutionary Robotics (ER) is a powerful approach for the automatic synthesis of robot controllers, as it requires little a priori knowledge about the problem to be solved in order to obtain good solutions. This is particularly true for collective and swarm robotics, in which the desired behaviour of the group is an indirect result of the control and communication rules followed by each individual. However, the experimenter must make several arbitrary choices in setting up the evolutionary process, in order to define the correct selective pressures that can lead to the desired results. In some cases, only a deep understanding of the obtained results can point to the critical aspects that constrain the system, which can be later modified in order to re-engineer the evolutionary process towards better solutions. In this paper, we discuss the problem of engineering the evolutionary machinery that can lead to the desired result in the swarm robotics context. We also present a case study about self-organising synchronisation in a swarm of robots, in which some arbitrarily chosen properties of the communication system hinder the scalability of the behaviour to large groups. We show that by modifying the communication system, artificial evolution can synthesise behaviours that properly scale with the group size.
DETECTION OF SLOPE MOVEMENT BY COMPARING POINT CLOUDS CREATED BY SFM SOFTWARE

This paper proposes movement detection method between point clouds created by SFM software, without setting any onsite georeferenced points. SfM software, like Smart3DCaputure, PhotoScan, and Pix4D, are convenient for non-professional operator of photogrammetry, because these systems require simply specification of sequence of photos and output point clouds with colour index which corresponds to the colour of original image pixel where the point is projected. SfM software can execute aerial triangulation and create dense point clouds fully automatically. This is useful when monitoring motion of unstable slopes, or loos rocks in slopes along roads or railroads. Most of existing method, however, uses mesh-based DSM for comparing point clouds before/after movement and it cannot be applied in such cases that part of slopes forms overhangs. And in some cases movement is smaller than precision of ground control points and registering two point clouds with GCP is not appropriate. Change detection method in this paper adopts CCICP (Classification and Combined ICP) algorithm for registering point clouds before / after movement. The CCICP algorithm is a type of ICP (Iterative Closest Points) which minimizes point-to-plane, and point-to-point distances, simultaneously, and also reject incorrect correspondences based on point classification by PCA (Principle Component Analysis). Precision test shows that CCICP method can register two point clouds up to the 1 pixel size order in original images. Ground control points set in site are useful for initial setting of two point clouds. If there are no GCPs in site of slopes, initial setting is achieved by measuring feature points as ground control points in the point clouds before movement, and creating point clouds after movement with these ground control points. When the motion is rigid transformation, in case that a loose Rock is moving in slope, motion including rotation can be analysed by executing CCICP for a loose rock and background slope independently.
E-Business Research Practice : Towards an Agenda

The hectic pace of advance in the late 1990s presented challenges and opportunities to management scholars and students. Suddenly they were faced with a living laboratory in which the subjects claimed that a wholly new set of rules had been invented for the ‘new economy. ’ Normally serious and critical observers found themselves caught up in the rhetoric engendered by rapidly rising equity prices and a wall of new investment in IT ventures. In response to demand pressures and faculty interests, Universities and Business Schools launched numerous new programmes in e-business and e-commerce. E-everything became fashionable.
Copy-Move Detection of Image Forgery by Using DWT and SIFT Methodologies: A Review

In the present digital world, digital images and videos are the main carrier of information. However, these sources of information can be easily tampered. And in most of the cases copymove image forgery is used to tamper the digital images. As a solution to problem we are going to propose a unique method for copy-move forgery detection which can sustained various pre-processing attacks using a combination of Discrete Wavelet Transform (DWT) and Scale Invariant Feature Transform (SIFT). In this process first DWT is applied on a given image to decompose it into four parts. Since LL part contains most of the information, we apply SIFT on LL part only to extract the key features and find a descriptor vector of these key features and then find similarities between various descriptors vector to conclude that there has been some copy-move tampering done to the given image.By using DWT with SIFT we are able to extract more numbers of key points that are matched and thus able to detect copy-move forgery more efficiently.
Contextualized End-to-End Neural Entity Linking.

We propose yet another entity linking model (YELM) which links words to entities instead of spans. This overcomes any difficulties associated with the selection of good candidate mention spans and makes the joint training of mention detection (MD) and entity disambiguation (ED) easily possible. Our model is based on BERT and produces contextualized word embeddings which are trained against a joint MD and ED objective. We achieve state-of-the-art results on several standard entity linking (EL) datasets.
Combined aerial and terrestrial images for complete 3D documentation of Singosari Temple based on Structure from Motion algorithm

Singosaritemple is one of cultural heritage building in East Java, Indonesia which was built in 1300s and restorated in 1934-1937. Because of its history and importance, complete documentation of this temple is required. Nowadays with the advent of low cost UAVs combining aerial photography with terrestrial photogrammetry gives more complete data for 3D documentation. This research aims to make complete 3D model of this landmark from aerial and terrestrial photographs with Structure from Motion algorithm. To establish correct scale, position, and orientation, the final 3D model was georeferenced with Ground Control Points in UTM 49S coordinate system. The result shows that all facades, floor, and upper structures can be modeled completely in 3D. In terms of 3D coordinate accuracy, the Root Mean Square Errors (RMSEs) are RMSEx=0,041 m; RMSEy=0,031 m; RMSEz=0,049 m which represent 0.071 m displacement in 3D space. In addition the mean difference of lenght measurements of the object is 0,057 m. With this accuracy, this method can be used to map the site up to 1:237 scale. Although the accuracy level is still in centimeters, the combined aerial and terrestrial photographs with Structure from Motion algorithm can provide complete and visually interesting 3D model.
Deformation of Nickel-Titanium (NiTi) rotary instruments in cyclic loading – in vitro study

Summary Introduction Separation of instruments in the root canal is one of the challenges in endodontic treatment. More specifically, nickel-titanium (NiTi) rotary instruments usually separate without previous deformation. The aim of this pilot study was to assess the effect of torsional stress on endodontic NiTi rotary instruments separation in simulated clinical conditions. Materials and methods Research was conducted on a sample of 20 human teeth in laboratory conditions. Experimental procedure consisted of determining canal curvatures for each root on digital radiographs and root canal treatment using endodontic NiTi rotary instruments. Out of 20 teeth (60 canals), two groups were formed with similar root canal curvatures (10 pairs of teeth) and instrumented using NiTi rotary instrument with or without torque control. Results Wilcoxon matched pair test showed no statistically significant difference in average number of instruments use with or without torque control (p>0.05). Conclusion Even though there is no statistical significance in instrument separation when instruments were used with or without torque, there is tendency to experience sudden fracture of instruments after work without torsional control even after only few uses in clinical work.
Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds

AES is the best known and most widely used block cipher. Its three versions (AES-128, AES-192, and AES-256) diﬀer in their key sizes (128 bits, 192 bits and 256 bits) and in their number of rounds (10, 12, and 14, respectively). In the case of AES-128, there is no known attack which is faster than the 2 128 complexity of exhaustive search. However, AES-192 and AES-256 were recently shown to be breakable by attacks which require 2 176 and 2 119 time, respectively. While these complexities are much faster than exhaustive search, they are completely non-practical, and do not seem to pose any real threat to the security of AES-based systems. In this paper we describe several attacks which can break with practical complexity variants of AES-256 whose number of rounds are comparable to that of AES-128. One of our attacks uses only two related keys and 2 39 time to recover the complete 256-bit key of a 9-round version of AES-256 (the best previous attack on this variant required 4 related keys and 2 120 time). Another attack can break a 10 round version of AES-256 in 2 45 time, but it uses a stronger type of related subkey attack (the best previous attack on this variant required 64 related keys and 2 172 time). While neither AES-128 nor AES-256 can be directly broken by these attacks, the fact that their hybrid (which combines the smaller number of rounds from AES-128 along with the larger key size from AES-256) can be broken with such a low complexity raises serious concern about the remaining safety margin oﬀered by the AES family of cryptosystems.
Secure Communication in BAN using Modified Fuzzy Vault Scheme

Wireless Body Sensor Network (WBSN) is an emerging technology in the area of telemedicine. It helps doctors to remotely monitor the health condition of patients. The success of usage of WBSNs for health care monitoring relies mainly on the security provided to the private information collected by the sensors. Security depends on key agreement scheme used. This paper aims at developing a fuzzy based key agreement scheme that uses ECG signal to protect the symmetric key to be exchanged. Here the correlation attack is overcome by using two different polynomial of different order due to which the integrity property of system is preserved. The effectiveness of the proposed scheme is to improve the performance of the system by overcoming correlation and collusion attacks. It also aims at minimizing False Acceptance Rate (FAR) and False Rejection Rate (FRR). General Terms Body Area Networks, secure communication, security, False Acceptance Rate (FAR) and False Rejection Rate (FRR).
Rearticulating Nature: Ecosystem Services in British Columbia and the UN Convention on Biological Diversity

This thesis applies mixed ethnographic methods at field sites in British Columbia and the United Nations to explore the spread and uptake of the “ecosystem services” idea in different institutions of environmental governance. I explore intensifying efforts by ecosystem services proponents to rearticulate the living environment in various ways and with various objectives around the concept. As the idea manifests in a wide array of different policies and practices, I attempt to characterize a process of ‘discursive refraction,’ and argue ecosystem services represents a kind of chimera, appearing differently to the disparate practitioners interpreting, responding to, and beginning to use it. Consequently, the idea takes on diverse forms and functions in those institutional settings where it appears. I conclude that the discourse of ecosystem services remains a locus of ongoing contestation, which significantly complicates the relationship between what its proponents intend for it, and its ideological, institutional, and ecological
Statistical Analysis of Microarray Data

Microarrays promise dynamic snapshots of cell activity, but microarray results are unfortunately not straightforward to interpret. This article aims to distill the most useful practical results from the vast body of literature availalable on microarray data analysis. Topics covered include: experimental design issues, normalization, quality control, exploratory analysis, and tests for differential expression. Special attention is paid to the peculiarities of low‐level analysis of Affymetrix chips, and the multiple testing problem in determining differential expression. The aim of this article is to provide useful answers to the most common practical issues in microarray data analysis. The main topics are pre‐processing (normalization), and detecting differential expression. Subsidiary topics include experimental design, and exploratory analysis. Further discussion is found at the author's web page (http://discover.nci.nih.gov→ Notes on Microarray Data Analysis).
On Finding Bicliques in Bipartite Graphs : a Novel Algorithm with Application to the Integration of Diverse Biological Data Types ∗

The integration of multiple genome-scale data sets is a huge algorithmic challenge for modern systems biology. In such settings, bipartite graphs are often useful in representing relationships across pairs of heterogeneous data types, with the interpretation of such relationships accomplished through an enumeration of maximal bicliques. Unfortunately, previously-known algorithms are highly inefficient and do not scale for this important task. In this paper, a fast and novel algorithm is described that finds all maximal bicliques in a bipartite graph. Unlike other techniques that have been proposed for this problem, the new method neither places undue restrictions on the input nor inflates the problem size. Efficiency is achieved by exploiting structure inherent in bipartite graphs, and by ensuring that biclique enumeration avoids duplication while pruning nonmaximal candidates. Experiments using gene expression data indicate that the new approach can be as much as two orders of magnitude faster than the best previous alternatives.
Investigating the Links between the Use of Internet, Value Co-Creation and Customer Satisfaction in the Banking Sector

Purpose: Because of the 2007’s financial crisis, the necessity of banks of (re)-building a strong dialogue with customers and improve their satisfaction is particularly felt. Marketing scholars respond to this challenge by encouraging value co-creation initiatives. The aim of this paper is to analyse the role of Internet banking in stimulating value co-creation processes and the consequent effects on customer satisfaction. Methodology: Based on a literature review on Internet banking, value co-creation and customer satisfaction in the banking sector, the links between these variables are theoretically outlined and it is constructed an empirical model able to test them. The model is validated through a factorial analysis. Findings: The results show how, by leveraging digital channels, real-time interactions and advanced advisory services can be implemented in order to stimulate clients to participate in the process and meet their own needs, thus affecting their satisfaction. Practical implication: To practitioners, the study provides suggestions how to improve customer satisfaction by offering opportunities for clients to access services and products through Internet Technologies and encouraging them to be increasingly active in the cocreation process. Originality and value: Although the literature on banking management is prolific of studies on Internet banking, value co-creation and customer satisfaction, these dimensions are often studied separately. This work provides a first useful input to investigate the links between these dimensions and to test them with an empirical analysis.
Does parallel repetition lower the error in computationally sound protocols?

Whether or not parallel repetition lowers the error has been a fundamental question in the theory of protocols, with applications in many different areas. It is well known that parallel repetition reduces the error at an exponential rate in interactive proofs and Arthur-Merlin games. It seems to have been taken for granted that the same is true in arguments, or other proofs where the soundness only holds with respect to computationally bounded parties. We show that this is not the case. Surprisingly, parallel repetition can actually fail in this setting. We present four-round protocols whose error does not decrease under parallel repetition. This holds for any (polynomial) number of repetitions. These protocols exploit non-malleable encryption and can be based on any trapdoor permutation. On the other hand we show that for three-round protocols the error does go down exponentially fast. The question of parallel error reduction is particularly important when the protocol is used in cryptographic settings like identification, and the error represents the probability that an intruder succeeds.
Player-Centred Game Design: Player Modelling and Adaptive Digital Games

We describe an approach to player-centred game design through adaptive game technologies [9]. The work presented is the result of on-going collaborative research between Media and Computing groups at the University of Ulster, and so we begin with a review of related literature from both areas before presenting our new ideas. In particular we focus on three areas of related research: understanding players, modelling players, and adaptive game technology. We argue that player modelling and adaptive technologies may be used alongside existing approaches to facilitate improved player-centred game design in order to provide a more appropriate level of challenge, smooth the learning curve, and enhance the gameplay experience for individual players regardless of gender, age and experience. However, adaptive game behaviour is a controversial topic within game research and development and so while we outline the potential of such technologies, we also address the most significant concerns.
Investigating the Dexterity of Multi-Finger Input for Mid-Air Text Entry

This paper investigates an emerging input method enabled by progress in hand tracking: input by free motion of fingers. The method is expressive, potentially fast, and usable across many settings as it does not insist on physical contact or visual feedback. Our goal is to inform the design of high-performance input methods by providing detailed analysis of the performance and anatomical characteristics of finger motion. We conducted an experiment using a commercially available sensor to report on the speed, accuracy, individuation, movement ranges, and individual differences of each finger. Findings show differences of up to 50% in movement times and provide indices quantifying the individuation of single fingers. We apply our findings to text entry by computational optimization of multi-finger gestures in mid-air. To this end, we define a novel objective function that considers performance, anatomical factors, and learnability. First investigations of one optimization case show entry rates of 22 words per minute (WPM). We conclude with a critical discussion of the limitations posed by human factors and performance characteristics of existing markerless hand trackers.