Miracle-dz/UniFAR-FTUs huggingface dataset:
Assemblage patterns of hymenoptera at different elevations of Gunung Datuk, Rembau / Noor Nasuha Abd Aziz … [et al.]

A study on abundance and diversity of Hymenoptera was conducted in Gunung Datuk, Rembau. Samplings were conducted from November 2014 to February 2015 using six Malaise traps. Three traps were placed at Site 1 at 700m height for high elevation and the remaining traps were placed at Site 2 at 200m height for low elevation. A total number of 221 Hymenopteran were collected which consist of nine families namely Ichneumonidae, Formicidae, Braconidae, Bethylidae, Evaniidae, Tiphiidae, Vespidae, Pompilidae and Apidae. In this study, 93 individuals were obtained from Site 1, comprising nine families and 43 morphospecies while 127 individuals were obtained from Site 2 with nine families and 45 morphospecies. Formicidae was the most dominant family collected from both sites with a total of 104 individuals while the least family recorded was Apidae with only one individual. Shannon’s Weiner Diversity Index (H’) showed Site 1 had the higher diversity value with H’ = 3.17 compared to Site 2 with value H’ = 3.12. For Evenness Index, Site 1 had higher value compared to Site 2 with E’ = 0.84 and E’ = 0.82 respectively. Moreover, for Margalef Richness Index, Site 1 recorded R’ = 9.24 while site two recorded R’ = 9.08 which concluded that Site 1 had higher species richness compared to Site 2. Paired t-test showed that both sites had no significant difference with p>0.05. Overall study showed that the diversity and abundance of Hymenoptera in Gunung Datuk were low since the value of H’ is less than 3.50
Elrond A Highly Scalable Public Blockchain via Adaptive State Sharding and Secure Proof of Stake

—The advent of secure public blockchains through Bitcoin and later Ethereum, has brought forth a notable degree of interest and capital inﬂux, providing the premise for a global wave of permissionless innovation. Despite lofty promises, creating a decentralized, secure and scalable public blockchain has proved to be a strenuous task. This paper proposes Elrond, a novel architecture which goes beyond state of the art by introducing a genuine state sharding scheme for practical scalability, eliminating energy and computational waste while ensuring distributed fairness through a Secure Proof of Stake (SPoS) consensus. Having a strong focus on security, Elrond’s network is built to ensure resistance to known security problems like Sybil attack, Nothing at Stake attack and others. In an ecosystem that strives for interconnectivity, our solution for smart contracts offers an EVM compliant engine to ensure interoperability by design. Preliminary simulations and testnet results reﬂect that Elrond exceeds Visa’s average throughput and achieves an improvement beyond three orders of magnitude or 1000x compared to the existing viable approaches, while drastically reducing the costs of bootstrapping and storage to ensure long term sustainability.
Data-Independence of Read, Write, and Control Structures in PRAM computations (cid:3)

We introduce the notions of control and communication structures in PRAM computations and relate them to the concept of data-independence. Our main result is to characterize di(cid:11)erences between unbounded fan-in parallelism AC k , bounded fan-in parallelism NC k , and the sequential classes DSPACE(log n) and LOGDCFL in terms of a PRAM's communication structure and instruction set. Our (cid:12)ndings give a concrete indication that in parallel computations writing is more powerful than reading. Further characterizations are given for parallel pointer machines and the semi-unbounded fan-in circuit classes SAC k . In particular, we obtain the (cid:12)rst characterizations of NC k and DSPACE(log n) in terms of PRAM's. Finally, we introduce Index-PRAM's which in some sense have \built-in data-independence. " We propose Index-PRAM's as a tool for the development of data-independent parallel algorithms. Index-PRAM's serve for studying the essential di(cid:11)erences between the above mentioned complexity classes with respect to the underlying instruction set used.
Data-independence of Read, Write, and Control Structures in Pram Computations List of Symbols _: Small Logical or ^: Small Logical and W : Big Logical or V : Big Logical And

We introduce the notions of control and communication structures in PRAM computations and relate them to the concept of data-independence. Our main result is to characterize di erences between unbounded fan-in parallelism AC k, bounded fan-in parallelism NC k, and the sequential classes DSPACE(logn) and LOGDCFL in terms of a PRAM's communication structure and instruction set. Our ndings give a concrete indication that in parallel computations writing is more powerful than reading. Further characterizations are given for parallel pointer machines and the semi-unbounded fanin circuit classes SAC k. In particular, we obtain the rst characterizations of NC k and DSPACE(logn) in terms of PRAM's. Finally, we introduce Index-PRAM's which in some sense have \built-in data-independence. " We propose Index-PRAM's as a tool for the development of data-independent parallel algorithms. Index-PRAM's serve for studying the essential di erences between the above mentioned complexity classes with respect to the underlying instruction set used.
Reply to comments on: Macroevolutionary patterns in Rhynchocephalia: is the tuatara (Sphenodon punctatus) a living fossil?

WE are interested to see the new analyses and contributions by Vaux et al. (2018) concerning Sphenodon, and whether it can be called a ‘living fossil’ or not. We will focus on the part of their paper that is critical of our contribution on rhynchocephalian morphological evolution (Herrera-Flores et al. 2017) and comment only briefly on the remainder. We consider first our definition of ‘living fossil’, and whether such a definition can be meaningful or not, then we consider the specific criticisms offered by Vaux et al. (2018) of the analyses in Herrera-Flores et al. (2017).
Reflections on “ Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes ”

A t-error-correcting code over a q-ary alphabet Fq is a set C ⊆ Fq such that for any received vector r ∈ Fq there is at most one vector c ∈ C that lies within a Hamming distance of t from r. The minimum distance of the code C is the minimum Hamming distance between any pair of distinct vectors c1, c2 ∈ C. In his seminal work introducing these concepts, Hamming pointed out that a code of minimum distance 2t+ 1 is a t-error-correcting code. It also pointed out the obvious fact that such a code is not a t′-error-correcting code for any t′ > t. We conclude that a code can correct half as many errors as its distance and no more. The mathematical correctness of the above statements are indisputable, yet the interpretation is quite debatable. If a message encoded with a t-error-correcting code ends up getting corrupted in t′ > t places, the decoder may simply throw it hands up in the air and cite the above paragraph. Or, in an alternate notion of decoding, called list decoding, proposed in the late 1950s by Elias [10] and Wozencraft [43], the decoder could try to output a list of codewords within distance t′ of the received vector. If t′ is not much larger than t and the errors are caused by a probabilistic (non-malicious) channel, then most likely this list would have only one element — the transmitted codeword. Even if the errors are caused by a malicious jammer, the list cannot contain too many codewords provided t′ is not too much larger than t. Thus, in either case, the receiver is in a better position to recover the transmitted codeword under the model of list decoding. List decoding was initiated mainly as a mathematical tool that allowed for a better understanding of some of the classical parameters of interest in information and coding theory. Elias [10] used this notion to get a better handle on the error-exponent in the strong forms of Shannon’s coding theorem. The notion also plays a dominant role in the Elias-Bassalygo [34, 4] upper bound on the rate of a code as a function of its relative distance. Through the decades the notion has continued to be investigated in a combinatorial context; and more recently has seen a spurt of algorithmic results. The paper being reflected on [23] was motivated by a gap between the combinatorial understanding of Reed-Solomon codes, and the known algorithmic performance. Below we summarize the combinatorial state of knowledge, and describe the main result of [23], and also use the opportunity to survey some of the rich body of algorithmic results on list decoding that have emerged in the recent past. We also muse upon some useful asymptotic perspectives that eased the way for some of this progress, and reflect on some possibilities for future work.
KMCP: accurate metagenomic profiling of both prokaryotic and viral populations by pseudo-mapping

Motivation The growing number of microbial reference genomes enables the improvement of metagenomic profiling accuracy but also imposes greater requirements on the indexing efficiency, database size, and runtime of taxonomic profilers. Additionally, most profilers focus mainly on bacterial, archaeal, and fungal populations, while less attention is paid to viral communities. Results We present KMCP, a novel k-mer-based metagenomic profiling tool that utilizes genome coverage information by splitting the reference genomes into chunks and then stores k-mers in a modified and optimized COBS index for fast alignment-free sequence searching. KMCP combines k-mer similarity and genome coverage information to reduce the false positive rate of k-mer-based taxonomic classification and profiling methods. Benchmarking results based on simulated and real data demonstrate that KMCP, despite a longer running time than all other methods, not only allows the accurate taxonomic profiling of prokaryotic and viral populations but also provides confident pathogen detection in clinical samples of low depth. Availability and Implementation The software is open-source under the MIT license and available at https://github.com/shenwei356/kmcp.
Estimasi Parameter Regresi Quantil Dengan Regresi Robust Least Trimmed Square (LTS) (Studi Kasus : Faktor -Faktor yang Mempengaruhi Penyebaran Penyakit Malaria di Indonesia)

Estimasi Metode OLS didasarkan pada distribusi normal, sehingga kurang tepat untuk menganalisis sejumlah data yang tidak simetris atau mengandung outlier. Oleh karena itu, dikembangkan regresi quantil yang tidak terpengaruh oleh adanya pencilan (outlier). Selain regresi quantil, regresi robust LTS juga dapat digunakan sebagai alternatif untuk menyelesaikan permasalahan data yang fluktuatif dan mengandung outlier. Penelitian ini membandingkan regresi quantil dengan regresi robust LTS pada kasus faktor-faktor yang mempengaruhi penyakit malaria di Indonesia. Diperoleh hasil bahwa dengan menggunakan metode OLS diperolehsebesar 0,681 dan regresi robust LTS sebesar 0,732 serta regresi quantil dengan = 0,95 sebesar 0,832. sehingga diperoleh model terbaik yang diperoleh model regresi quantil. Lebih lanjut diperoleh hasil bahwa faktor utama penyebab penyebaran penyakit malaria di Indonesia yaitu faktor rumah layak huni, faktor penduduk miskin dan faktor tenaga dokter.
Multihazard simulation for coastal flood mapping: Bathtub versus numerical modelling in an open estuary, Eastern Canada

Coastlines along the St. Lawrence Estuary and Gulf, Eastern Canada, are under increasing risk of flooding due to sea level rise and sea ice shrinking. Efficient and validated regional‐scale coastal flood mapping approaches that include storm surges and waves are hence required to better prepare for the increased hazard. This paper compares and validates two different flood mapping methods: numerical flood simulations using XBeach and bathtub mapping based on total water levels, forced with multihazard scenarios of compound wave and water level events. XBeach is validated with hydrodynamic measurements. Simulations of a historical storm event are performed and validated against observed flood data over a ~25 km long coastline using multiple fit metrics. XBeach and the bathtub method correctly predict flooded areas (66 and 78%, respectively), but the latter overpredicts the flood extent by 36%. XBeach is a slightly more robust flood mapping approach with a fit of 51% against 48% for the bathtub maps. Deeper floodwater by ~0.5 m is expected with the bathtub approach, and more buildings are vulnerable to a 100‐year flood level. For coastal management at regional‐scale, despite similar flood extents with both flood mapping approaches, results suggest that numerical simulation with XBeach outperforms bathtub flood mapping.
Communications of the Association for Information Systems Communications of the Association for Information Systems

Enterprise architecture (EA) is the definition and representation of a high-level view of an enterprise‘s business processes and IT systems, their interrelationships, and the extent to which these processes and systems are shared by different parts of the enterprise. EA aims to define a suitable operating platform to support an organisation‘s future goals and the roadmap for moving towards this vision. Despite significant practitioner interest in the domain, understanding the value of EA remains a challenge. Although many studies make EA benefit claims, the explanations of why and how EA leads to these benefits are fragmented, incomplete, and not grounded in theory. This article aims to address this knowledge gap by focusing on the question: How does EA lead to organisational benefits? Through a careful review of EA literature, the paper consolidates the fragmented knowledge on EA benefits and presents the EA Benefits Model (EABM). The EABM proposes that EA leads to organisational benefits through its impact on four benefit enablers: Organisational Alignment, Information Availability, Resource Portfolio Optimisation, and Resource Complementarity. The article concludes with a discussion of a number of potential avenues for future research, which could build on the findings of this study.
An Intraframe Coding by Modified DCT Transform using H. 264 Standard

Compression is necessary for video coding, which introduces the fundamental of video image formation. The efficient, fast encoding, lossy and lossless technique are required for video coding for different application. Focus is concentrated on the lossless intra coding method in video image besides various video coding standards.The upcoming H.264 video compression standard promises a significant improvement over all previous video compression standards. In terms of coding efficiency, the new standard is expected to provide at least 2x compression improvement over the best previous standards and substantial perceptual quality improvements over both MPEG-2 and MPEG-4. A directional filtering transform (DFT) is proposed in this paper to better exploit correlations among samples in H.264 intraframe coding.
outputs Reference and Gestures in Dialogue Generation : Three Studies with Embodied Conversational Agents Conference Item

This paper reports on three studies into social presence cues which were carried out in the context of the NECA (Net-environment for Embodied Emotional Conversational Agents) project and the EPOCH network. The first study concerns the generation of referring expressions. We adopted an existing algorithm for generating referring expressions such that it could run according to an egocentric and a neutral strategy. In an evaluation study, we found that the two strategies were correlated with the perceived friendliness of the speaker. In the second and the third study, we evaluated the gestures that were generated by the NECA system. In this paper, we briefly summarize the most salient results of these two studies. They concern the effect of gestures on perceived quality of speech and information retention.
Model Estimation of the Effect of Wind-driven Flow and Freshwater Plumes on the Transport and Environmental History of Marine Invertebrates Larvae

This thesis investigates the physical processes that govern the transport and environmental history of marine invertebrates during their larval stage, focusing on the role of wind-driven flow and freshwater plumes. Additionally, this work examines how release location and swimming behavior modifies the path and environmental history of a larval particle. The research was conducted by using Regional Ocean Modeling System (ROMS) and a particle-tracking code to estimate the transport of larval-stage invertebrates and their environmental history over the larval duration period (particle paths) in parameters such as temperature, salinity and phytoplankton concentration. Results indicate that swimming particles are retained closer to shore and to their release location compared to passive particles (no swimming behavior). The freshwater plume affects alongshore dispersal of particles released to the south of the Columbia River during downwelling periods and weak upwelling periods, and particles released to the north of the river during downwelling periods. Furthermore, wind-driven circulation can influence the environmental exposure of larval stage marine invertebrates. Particles north of the Columbia River mouth saw greater variation in temperature and salinity, and higher phytoplankton concentration as upwelling index increased. As upwelling intensity increases, southern particles experience lower average temperature, higher salinity, and higher phytoplankton concentration conditions (however, lower phytoplankton concentrations than northern particles). This work suggests that wind-driven circulation and freshwater plumes can play an important role in the distribution and environmental history of larval stage marine invertebrates and this could influence their future persistence along the U.S. West Coast.
Using interval logics for temporal analysis of security protocols

This paper presents an approach to the analysis of real-time properties of security protocols, based on the use of Interval Logic with durations to express and reason about temporal phenomena. We focus on the analysis of availability, where time is known to play a significant role, illustrate how relevant timing requirements can be formulated and show how Interval Logic can be used to prove that a system can fulfil these requirements in the presence of attackers of a given strength. We link this logic-based approach to more operational approaches.
Melanoma detection with a deep learning model

Background: Skin cancer is one of the most common forms of cancer in the world and melanoma is the deadliest type of skin cancer. Both melanoma and melanocytic nevi begin in melanocytes (cells that produce melanin). However, melanocytic nevi are benign whereas melanoma is malignant. This work proposes a deep learning model for classification of these two lesions. Methods: In this analytic study, the database of HAM10000 (human against machine with 10000 training images) dermoscopy images, 1000 melanocytic nevi and 1000 melanoma images were employed, where in each category 900 images were selected randomly and were designated as the training set. The remaining 100 images in each category were considered as the test set. A deep learning convolutional neural network (CNN) was deployed with AlexNet (Krizhevsky et al., 2012) as a pretrained model. The network was trained with 1800 dermoscope images and subsequently was validated with 200 test images. The proposed method removes the need for cumbersome tasks of lesion segmentation and feature extraction. Instead, the CNN can automatically learn and extract useful features from the raw images. Therefore, no image preprocessing is required. Study was conducted at Shahid Beheshti University of Medical Sciences, Tehran, Iran from January to February, 2020. Results: The proposed model achieved an area under the receiver operating characteristic (ROC) curve of 0.98. Using a confidence score threshold of 0.5, a classification accuracy of 93%, sensitivity of 94%, and specificity of 92% was attained. The user can adjust the threshold to change the model performance according to preference. For example, if sensitivity is the main concern; i.e. false negative is to be avoided, then the threshold must be reduced to improve sensitivity at the cost of specificity. The ROC curve shows that to achieve sensitivity of 100%, specificity is decreased to 83%. Conclusion: The results show the strength of convolutional neural networks in melanoma detection in dermoscopy images. The proposed method can be deployed to help dermatologists in identifying melanoma. It can also be implemented for self diagnosis of photographs taken from skin lesions. This may facilitate early detection of melanoma, and hence substantially reduce the mortality chance of this dangerous malignancy. Abstract
Melanoma detection with a deep learning model

* :لوئسم هدنسیون ،نارهت ،کجنلو شناد راولب وج ، کشزپ مولع هاگشناد ی هش ی د تشهب ی ، کشزپ هدکشناد ی . نفلت : 021-22439941 E-mail: aliameri86@gmail.com فده و هنیمز : تسوپ ناطرس ی ک ی اش زا ی ع رت ی ن ناطرـس اـمونلام و اه (Melanoma) هدنـشک رت ی ن تـسوپ ناطرـس عوـن م ی سونلام لاخ . دشاب ی ت ی ک (Melanocytic nevi) اـسونلام زا ود رـه اـمونلام و ی ت لولـس) اه اه ي لوت ی د (هـنادگنر هدـننک ب ه م دوجو ی آ ی ،دن سونلام لاخ اما ی ت ی ک شوخ خ ی م خدب امونلام و ی م ا . دنتسه ی ن هلاقم ی ک لدـم ـی گدا ی ر ي مع ـی ق (Deep
Approximation Algorithms for Bipartite and Non-bipartite Matching in the Plane

In the approximate Euclidean min-cost perfect matching problem, we are a given a set V of 2n points in the plane, and a real number " > 0, and we want to pair up the points (into n pairs) so that the sum of the distances between the paired points is within a multiplicative factor of (1 + ") of the optimal. We present a Monte-Carlo algorithm that returns, with probability at least 1=2, a solution within (1 + ") of the optimal ; the running time of our algorithm is O((n=" 3) log 6 n). In the bipartite version of this problem, we are given a set R of n red points, a set B of n blue points in the plane, and a real number " > 0. We want to match each red point with a blue point so that the sum of the distances between paired points is within (1 + ") times that of an optimal matching. We present an algorithm for this problem that runs in O((n=") 3=2 log 5 n) time.
Computer Simulation Performance of Iterative Water-Filling Algorithm for ADSL2+ and VDSL Mixed System

Crosstalk is a major issue in modern ADSL and VDSL systems. Static spectrum management (SSM), the traditional way to guarantee spectrum compatibility, employs spectral masks which can be overly restrictive and result in poor performance. In this paper, fixed margin iterative water-filling algorithm is applied in downstream VDSL and ADSL2+ scenario when they are in the same binder. The algorithm can minimize the transmission power and at the same time the overall high-quality service is guaranteed for all the users of the same binder. The simulation results show that ADSL2+ can realize performance gains by up to 80% compared with SSM techniques or ADSL.
DENOISING AN IMAGE BY DENOISING ITS CURVATURE IMAGE By

In this article we show that when an image is corrupted by additive noise, its curvature image is less affected by it, i.e. the PSNR of the curvature image is larger. We conjecture that, given a denoising method, we may obtain better results by applying it to the curvature image and then reconstructing from it a clean image, rather than denoising the original image directly. Numerical experiments confirm this for several PDE-based and patch-based denoising algorithms. The improvements in the quality of the results bring us closer to the optimal bounds recently derived by Levin et al. [1, 2].