Search

In this paper, we present a system for automatic evaluation of the quality of a question paper. Question paper plays a major role in educational assessment. The quality of a question paper is crucial to fulfilling the purpose of the assessment. In many education sectors, question papers are prepared manually. A prior analysis of a question paper might help in finding the errors in the question paper, and better achieving the goals of the assessment. In this experiment, we focus on higher education in the technical domain. First, we conducted a student survey to identify the key factors that affect the quality of a question paper. The top factors we identified are question relevance, question difficulty, and time requirement. We explored the strategies to handle these factors and implemented them. We employ various concepts and techniques for the implementation. The system finally assigns a numerical quality score against these factors. The system is evaluated using a set of question papers collected from various sources. The experimental results show that the proposed system is quite promising.

Paper-based microfluidic devices are popular for their ability to automate multistep assays for chemical or biological sensing at a low cost, but the design of paper microfluidic networks has largely relied on experimental trial and error. A few mathematical models of flow through paper microfluidic devices have been developed and have succeeded in explaining experimental flow behavior. However, the reverse engineering problem of designing complex paper networks guided by appropriate mathematical models is largely unsolved. In this article, we demonstrate that a two-dimensional paper network (2DPN) designed to sequentially deliver three fluids to a test zone on the device can be computationally designed and experimentally implemented without experimental trial and error. This was accomplished by three new developments in modeling flow through paper networks: (i) coupling of the Richards equation of flow through porous media to the species transport equation, (ii) modeling flow through assemblies of multiple paper materials (test membrane and wicking pad), and (iii) incorporating limited-volume fluid sources. We demonstrate the application of this model in the optimal design of a paper-based signal-enhanced immunoassay for a malaria protein, PfHRP2. This work lays the foundation for the development of a computational design toolbox to aid in the design of paper microfluidic networks. ©

International audience; This paper focuses on the problem of the hierarchical multi‐label classification of research papers, which is the task of assigning the set of relevant labels for a paper from a hierarchy, using reduced amounts of labelled training data. Specifically, we study leveraging unlabelled data, which are usually plentiful and easy to collect, in addition to the few available labelled ones in a semi‐supervised learning framework for achieving better performance results. Thus, in this paper, we propose a semi‐supervised approach for the hierarchical multi‐label classification task of research papers based on the well‐known Co‐training algorithm, which exploit content and bibliographic coupling information as two distinct papers' views. In our approach, two hierarchical multi‐label classifiers, are learnt on different views of the labelled data, and iteratively select their most confident unlabelled samples, which are further added to the labelled set. The success of our suggested Co‐training‐based approach lies in two main components. The first is the use of two suggested selection criteria (i.e., Maximum Agreement and Labels Cardinality Consistency) that enforce selecting confident unlabelled samples. The second is the appliance of an oversampling method that rebalances the labels distribution of the initial labelled set, which reduces the reinforcement of the label imbalance issue during the Co‐training learning. The proposed approach is evaluated using a collection of scientific papers extracted from the ACM digital library. Performed experiments show the effectiveness of our approach with regards to several baseline methods.

Researchers from academia and the corporate-sector rely on scholarly digital libraries to access articles. Attackers take advantage of innocent users who consider the articles' files safe and thus open PDF-files with little concern. In addition, researchers consider scholarly libraries a reliable, trusted, and untainted corpus of papers. For these reasons, scholarly digital libraries are an attractive-target and inadvertently support the proliferation of cyber-attacks launched via malicious PDF-files. In this study, we present related vulnerabilities and malware distribution approaches that exploit the vulnerabilities of scholarly digital libraries. We evaluated over two-million scholarly papers in the CiteSeerX library and found the library to be contaminated with a surprisingly large number (0.3-2%) of malicious PDF documents (over 55% were crawled from the IPs of US-universities). We developed a two layered detection framework aimed at enhancing the detection of malicious PDF documents, Sec-Lib, which offers a security solution for large digital libraries. Sec-Lib includes a deterministic layer for detecting known malware, and a machine learning based layer for detecting unknown malware. Our evaluation showed that scholarly digital libraries can detect 96.9% of malware with Sec-Lib, while minimizing the number of PDF-files requiring labeling, and thus reducing the manual inspection efforts of security-experts by 98%.

One of the benefits of Internet of Vehicles (IoV) is improved traffic safety and efficiency, for example due to the capability to share vehicular messages in real-time. While most of the vehicular messages only need to be shared by nearby vehicles, some messages (e.g., announcement messages) may need to be more broadly distributed, for example to vehicles in a wider region. Finding a single trusted entity to store and distribute such messages can be challenging, and vehicles may not be inclined to participate (e.g., generation and distribution of announcement messages) unless they can benefit from such participation. In addition, achieving both security and privacy can be challenging. In this paper, we propose a blockchain based secure data sharing system to address the above challenges in an IoV setting. Specifically, in our system, announcement messages are stored using blockchain. To encourage/incentivize participation, vehicles that faithfully broadcast the announcement messages and/or contribute to the block generation will be rewarded by some cryptocurrency. Our system is also designed to be privacy-preserving and realizes both priori and posteriori countermeasures.

International audience; Despite predictions of the paperless office, global demand for printing and writing paper remains strong, and paper appears to be here to stay for some time. Not only firms, but also governments, libraries, and archives are in possession of large collections of legacy documents that still must be sorted and scanned. In this study, terahertz-based techniques are demonstrated to address several routine tasks related to the automated paper handling of unsorted legacy documents. Specifically, we demonstrate terahertz-based counting of the number of sheets in unconsolidated paper stacks, as well as locating stapled documents buried in paper stacks.

Logic Programming (LP) is considered to be relatively simple for non-programmers, and allows the developer to focus on developing facts and rules of a logical derivation, and not on algorithms. Secure multiparty computation (MPC) is a methodology that allows several parties to process private data collaboratively without revealing the data to any party. In this paper, we bring together the notions of MPC and LP, allowing users to write privacy-preserving applications in logic programming language.

Marked mix-nets were introduced by Pereira and Rivest as a mechanism to allow very efficient mixing that ensures privacy but at the cost of not guaranteeing integrity. This is useful in a number of e-voting schemes such as STAR-Vote and Selene. However, the proposed marked mix-net construction comes with no proof of security and, as we show in this paper, does not provide privacy even in the presence of a single corrupt authority. Fortunately, the attack that we present is easy to prevent and we show several possible ways to address it. Finally while the original marked mix-net paper worked with ElGamal, we identify conditions that the adopted encryption scheme should satisfy in order to be appropriate for a marked mix-net. This opens the possibility of building marked mix-nets based on intractability assumptions which are believed to hold in the presence of a quantum computer.

Internet of Things (IoT) devices are increasingly being found in civilian and military contexts, ranging from smart cities and smart grids to Internet-of-Medical-Things, Internet-of-Vehicles, Internet-of-Military-Things, Internet-of-Battlefield-Things, etc. In this paper, we survey articles presenting IoT security solutions published in English since January 2016. We make a number of observations, including the lack of publicly available IoT datasets that can be used by the research and practitioner communities. Given the potentially sensitive nature of IoT datasets, there is a need to develop a standard for sharing IoT datasets among the research and practitioner communities and other relevant stakeholders. Thus, we posit the potential for blockchain technology in facilitating secure sharing of IoT datasets (e.g., using blockchain to ensure the integrity of shared datasets) and securing IoT systems, before presenting two conceptual blockchain-based approaches. We then conclude this paper with nine potential research questions. Keywords: Blockchain, Blockchain security, Collaborative security, Internet-of-military things, IoT dataset, IoT self-healing, IoT security, Intrusion-prevention system, Predictive IoT security, Predictive security

© 2013 IEEE. With the rapid growth of scientific publications, it is hard for researchers to acquire appropriate papers that meet their expectations. Recommendation system for scientific articles is an essential technology to overcome this problem. In this paper, we propose a novel low-rank and sparse matrix factorization-based paper recommendation (LSMFPRec) method for authors. The proposed method seamlessly combines low-rank and sparse matrix factorization method with fine-grained paper and author affinity matrixes that are extracted from heterogeneous scientific network. Thus, it can effectively alleviate the sparsity and cold start problems that exist in traditional matrix factorization based collaborative filtering methods. Moreover, LSMFPRec can significantly reduce the error propagated from intermediate outputs. In addition, the proposed method essentially captures the low-rank and sparse characteristics that exist in scientific rating activities; therefore, it can generate more reasonable predicted ratings for influential and uninfluential papers. The effectiveness of the proposed LSMFPRec is demonstrated by the recommendation evaluation conducted on the AAN and CiteULike data sets.

Purpose Identifying the frontiers of a specific research field is one of the most basic tasks in bibliometrics and research published in leading conferences is crucial to the data mining research community, whereas few research studies have focused on it. The purpose of this study is to detect the intellectual structure of data mining based on conference papers. Design/methodology/approach This study takes the authoritative conference papers of the ranking 9 in the data mining field provided by Google Scholar Metrics as a sample. According to paper amount, this paper first detects the annual situation of the published documents and the distribution of the published conferences. Furthermore, from the research perspective of keywords, CiteSpace was used to dig into the conference papers to identify the frontiers of data mining, which focus on keywords term frequency, keywords betweenness centrality, keywords clustering and burst keywords. Findings Research showed that the research heat of data mining had experienced a linear upward trend during 2007 and 2016. The frontier identification based on the conference papers showed that there were five research hotspots in data mining, including clustering, classification, recommendation, social network analysis and community detection. The research contents embodied in the conference papers were also very rich. Originality/value This study detected the research frontier from leading data mining conference papers. Based on the keyword co-occurrence network, from four dimensions of keyword term frequency, betweeness centrality, clustering analysis and burst analysis, this paper identified and analyzed the research frontiers of data mining discipline from 2007 to 2016.

In this paper, we analyze the intelligent subdesign of the simulated marking system through an in-depth study of it. This paper proposes a correlation analysis-based quantification of N-element sense values and a rationality enhancement-based scoring fitting algorithm for English essays. This paper also extracts word features, sentence features, and chapter structure features in essays to fit English composition scores. Since not all students can complete the essays according to the topic requirements, a triage scoring model is used to separate the normal essays from the low-scoring essays. Statistically, it was found that the essay scores also showed a certain normal distribution. The standard support vector regression algorithm is prone to data skewing problems, so this paper addresses this problem by using a rationality enhancement method that gives a corresponding penalty factor according to the distribution of the dataset. The results show that the English essay scoring fitting algorithm proposed in this paper can well improve the prediction accuracy of some data and solve the problem of skewed data where the scores show a normal distribution. This paper designs and implements an online mock examination system that incorporates an intelligent scoring system for essays, enabling it to meet the needs of teachers and students for online examinations and intelligent scoring.

When it comes to leaked credentials and credit card information, we observe the development and use of anti-fingerprinting browsers by malicious actors. These tools are carefully designed to evade detection, often by mimicking the browsing environment of the victim whose credentials were stolen. Even though these tools are popular in the underground markets, they have not received enough attention by researchers. In this paper, we report on the first evaluation of four underground, commercial, and research anti-fingerprinting browsers and highlight their high success rate in bypassing browser fingerprinting. Despite their success against well-known fingerprinting methods and libraries, we show that even slightest variation in the simulated fingerprint compared to the real ones can give away the presence of anti-fingerprinting tools. As a result, we provide techniques and fingerprint-based signatures that can be used to detect the current generation of anti-fingerprinting browsers.

Several applications can benefit from recording information about the places a mobile entity visits and the length of time it spends there (e.g., shoppers, employees, buses, movable equipment, autonomous robots, etc.). In this paper, we present our approach to recording spatio-temporal information in a secure and inviolable way using a Distributed Ledger Technology. So far in this work, we observe that, although sending data to the blockchain is a heavy process, there are ways that this transaction time does not disrupt the flow of new data such as adding these data to a queue. However, this makes the sending process overall longer. We intend to continue this study by testing different blockchain services and comparing their performances.

Machine learning (ML) has increasingly been adopted in safety-critical systems such as autonomous vehicles (AVs) and industrial robotics. In these domains, reliability and safety are important considerations, and hence it is critical to ensure the resilience of ML systems to faults and errors. On the other hand, soft errors are becoming more frequent in commodity computer systems due to the effects of technology scaling and reduced supply voltages. Further, traditional solutions for masking hardware faults such as Triple-Modular Redundancy (TMR) are prohibitively expensive in terms of their energy and performance overheads. Therefore, there is a compelling need to ensure the resilience of ML applications to soft errors on commodity hardware platforms.We first experimentally assess the resilience of safety-critical ML applications to soft errors. We demonstrate through fault injection experiments that even a single bit flip due to a soft error can lead to misclassification in Deep Neural Network (DNN) applications deployed in AVs, leading to safety violations. However, not all the errors in an DNN will result in serve consequences such as safety violations, and hence it is sufficient to protect the DNN from the ones that do. Unfortunately, finding all possible errors that result in safety violations is a very compute intensive task. We propose BinFI, a fault injection approach that efficiently injects critical faults that are highly likely to result in safety violations, based on the unique properties of DNNs. Finally, we propose Ranger, an approach to protect DNNs from critical faults with minimal performance overheads and no accuracy loss. We will conclude by presenting some of our ongoing work, and the future challenges in this area.

With the arrival of the Internet and social media, at the same time as masses of humans have benefitted from the full-size reassets of records available, there was an full-size boom with inside the upward push of cyber-crimes, mainly targeted closer to women. According to a 2019 file with inside the Economics Times, India has witnessed a 457% upward push in cybercrime with inside the 5 years span among 2011 and 2016. Most speculate that that is because of effect of social media inclusive of Facebook, Instagram and Twitter on our day by day lives. While those simply assist in growing a legitimate social network, advent of consumer debts in those websites normally desires simply an email-id. A actual lifestyles man or woman can create more than one fake IDs and for this reason impostors can effortlessly be made. Unlike the actual international state of affairs in which more than one policies and guidelines are imposed to become aware of oneself in a completely unique manner (as an instance at the same time as issuing one’s passport or driver’s license), with inside the digital international of social media, admission does now no longer require this kind of checks. In this paper, we study the one-of-a-kind debts of Instagram, specifically and try and verify an account as fake or actual the use of Machine Learning strategies specifically Logistic Regression and Random Forest Algorithm.

Paper-based devices are an excellent match for low-cost point-of-care testing (POCT) tools. Their user-friendliness, portability, and short time of analysis, coupled with ease of local manufacture make these devices the best option for inexpensive diagnostic testing tools. However, despite all their positive features, these low-cost diagnostic devices must present good performance indicators, such as sensitivity, specificity, and accuracy. We developed and validated a paper-based ELISA for toxoplasmosis diagnosis through the detection of Toxoplasma gondii immunoglobulin G (IgG) antibodies in 100 human serum samples. From among the different ways to define the cut-off value, we chose Youden's J index (cut-off = 21.73 A.U.), which presented a higher sensitivity value. Our paper-based assay presented a sensitivity of 0.96, a specificity of 0.87, and a gray zone comprising 16 samples (±15% of the cut-off value, with 3 false positive outputs). The accuracy of the test was estimated by using ROC curves (AUC = 0.97). We also created a macro in Microsoft Excel® to estimate the accuracy of the test (m-Accuracy) based on a non-parametric method, which evidenced a value = 0.88, which classifies our test as moderately to highly accurate. We also provide the m-Accuracy macro for download and the paper-based microplate designs for printing, in order to collaborate with the scientific community and facilitate further studies using this platform. The improvement of these diagnostic tools can bring this technology for those who need it, contributing to population health and well-being.

Over the decades, the immense growth has been reported in research publications due to continuous developments in science. To date, various approaches have been proposed that find similarity between research papers by applying different similarity measures collectively or individually based on the content of research papers. However, the contemporary schemes are not conceptualized enough to find related research papers in a coherent manner. This paper is aimed at finding related research papers by proposing a comprehensive and conceptualized model via building ontology named COReS: Content-based Ontology for Research Paper Similarity. The ontology is built by finding the explicit relationships (i.e., super-type sub-type, disjointedness, and overlapping) between state-of-the-art similarity techniques. This paper presents the applications of the COReS model in the form of a case study followed by an experiment. The case study uses InText citation-based and vector space-based similarity measures and relationships between these measures as defined in COReS. The experiment focuses on the computation of comprehensive similarity and other content-based similarity measures and rankings of research papers according to these measures. The obtained Spearman correlation coefficient results between ranks of research papers for different similarity measures and user study-based measure, justify the application of COReS for the computation of document similarity. The COReS is in the process of evaluation for ontological errors. In the future, COReS will be enriched to provide more knowledge to improve the process of comprehensive research paper similarity computation.

Paper-based digital microfluidic biochips (or P-DMFBs) are becoming highly impelling due to its low-cost and in-place fabrication of electrodes and control wiring on a single piece of paper having an inkjet printer and conductive ink. Despite enormous advantages, several complex design rules also subsist, such as avoidance of induced control interference, minimum separation among the control lines, and congestion-free wiring on a single layer, which is to be correlated leading toward overall feasibility of the design. Several cost raising issues, such as schedule length, control pin count, and wire length, must be considered for attaining a successful fluid-control codesign. Moreover, design gaps exist among the subtasks of the fluid level, control level, and fluid-control design as a whole, which undeniably impose expensive design cycles increasing overall cost. This article builds a machine learning-based model for the pin-constrained P-DMFBs to predict violation in control design beforehand and accordingly guides the fluid-control codesign to tackle important cost-driving issues while attaining congestion- and conflict-free wiring. This model effectively eliminates the design cycles producing a low-cost platform. The predictive model has been evaluated over a balanced data set. Several benchmarks for assessing the performance are studied.

BackgroundPeriodic demographic health surveillance and surveys are the main sources of health information in developing countries. Conducting a survey requires extensive use of paper-pen and manual work and lengthy processes to generate the required information. Despite the rise of popularity in using electronic data collection systems to alleviate the problems, sufficient evidence is not available to support the use of electronic data capture (EDC) tools in interviewer-administered data collection processes. ObjectiveThis study aimed to compare data quality parameters in the data collected using mobile electronic and standard paper-based data capture tools in one of the health and demographic surveillance sites in northwest Ethiopia. MethodsA randomized controlled crossover health care information technology evaluation was conducted from May 10, 2016, to June 3, 2016, in a demographic and surveillance site. A total of 12 interviewers, as 2 individuals (one of them with a tablet computer and the other with a paper-based questionnaire) in 6 groups were assigned in the 6 towns of the surveillance premises. Data collectors switched the data collection method based on computer-generated random order. Data were cleaned using a MySQL program and transferred to SPSS (IBM SPSS Statistics for Windows, Version 24.0) and R statistical software (R version 3.4.3, the R Foundation for Statistical Computing Platform) for analysis. Descriptive and mixed ordinal logistic analyses were employed. The qualitative interview audio record from the system users was transcribed, coded, categorized, and linked to the International Organization for Standardization 9241-part 10 dialogue principles for system usability. The usability of this open data kit–based system was assessed using quantitative System Usability Scale (SUS) and matching of qualitative data with the isometric dialogue principles. ResultsFrom the submitted 1246 complete records of questionnaires in each tool, 41.89% (522/1246) of the paper and pen data capture (PPDC) and 30.89% (385/1246) of the EDC tool questionnaires had one or more types of data quality errors. The overall error rates were 1.67% and 0.60% for PPDC and EDC, respectively. The chances of more errors on the PPDC tool were multiplied by 1.015 for each additional question in the interview compared with EDC. The SUS score of the data collectors was 85.6. In the qualitative data response mapping, EDC had more positive suitability of task responses with few error tolerance characteristics. ConclusionsEDC possessed significantly better data quality and efficiency compared with PPDC, explained with fewer errors, instant data submission, and easy handling. The EDC proved to be a usable data collection tool in the rural study setting. Implementation organization needs to consider consistent power source, decent internet connection, standby technical support, and security assurance for the mobile device users for planning full-fledged implementation and integration of the system in the surveillance site.

Game-based learning represents a promising alternative to teach computing in higher education. This paper presents “BDD Assemble!”, a paper-based game proposal for teaching Behavior Driven Development (BDD) competences. For this, the proposed game and the evaluation approach with software engineering students are described. As a result, a simple, interactive and colaborative game was provided, able to teach BDD concepts in a practical, competitive and fun way.

Technology is shaping our lives in a multitude of ways. This is fuelled by a technology infrastructure, both legacy and state of the art, composed of a heterogeneous group of hardware, software, services, and organisations. Such infrastructure faces a diverse range of challenges to its operations that include security, privacy, resilience, and quality of services. Among these, cybersecurity and privacy are taking the centre-stage, especially since the General Data Protection Regulation (GDPR) came into effect. Traditional security and privacy techniques are overstretched and adversarial actors have evolved to design exploitation techniques that circumvent protection. With the ever-increasing complexity of technology infrastructure, security and privacy-preservation specialists have started to look for adaptable and flexible protection methods that can evolve (potentially autonomously) as the adversarial actor changes its techniques. For this, Artificial Intelligence (AI), Machine Learning (ML), and Deep Learning (DL) were put forward as saviours. In this paper, we look at the promises of AI, ML, and DL stated in academic and industrial literature and evaluate how realistic they are. We also put forward potential challenges a DL based security and privacy protection system has to overcome. Finally, we conclude the paper with a discussion on what steps the DL and the security and privacy-preservation community have to take to ensure that DL is not just going to be hype, but an opportunity to build a secure, reliable, and trusted technology infrastructure on which we can rely on for so much in our lives.

The confluence of significant computational power and inexpensive sensors provides the opportunity to reliably collect large volumes of information from the world and extract humanly useful information resources. This paper reviews a coherent body of work over the last 20+ years focused on development of advanced bio-inspired computing techniques, and their applications primarily for human related data in behaviour and human centered computing. We close with a synthesis proposing an experiment analysis methodology combining these tools.

Exam paper generation is an indispensable part of teaching. Existing methods focus on the use of question extraction algorithms with labels for each question provided. Obviously, manual labeling is inefficient and cannot avoid label bias. Furthermore, the quality of the exam papers generated by the existing methods is not guaranteed. To address these problems, we propose a novel approach to generating exam papers based on prediction of exam performance. As such, we update the quality of the initially generated questions one by using dynamic programming, as well as in batches by using genetic algorithms. We performed the prediction task by using Deep Knowledge Tracing. Our approach considered the skill weight, difficulty, and distribution of exam scores. By comparisons, experimental results indicate that our approach performed better than the two baselines. Furthermore, it can generate exam papers with adaptive difficulties closely to the expected levels, and the related student exam scores will be guaranteed to be relatively reasonable distribution. In addition, our approach was evaluated in a real learning scenarios and shows advantages.

Authentication devices transform cheap paper into legitimate documents. They are the sensory, informational, and computational features that make up valuable papers like banknotes and passports, and they provide the confidence required in moments of exchange and passage. These devices – which include techniques like watermarks and specialized threads, proprietary substrates and inks, or RFID chips – are the product of security printing, an industry that continuously reinvents the possibilities of paper. Importantly, these components protect paper things from counterfeiting, allowing it to function as an original and authentic copy and to do the logistical work of connecting quotidian materials to global networks. The value of valuable papers is therefore not purely extrinsic, socially or discursively established, but is also performed through its intrinsic material qualities. These are the authentication devices that are read, assessed, and trusted as paper things are circulated, and they are what securely connects paper to infrastructures of mobility.

Paper recommendation is a research topic to provide users with personalized papers of interest. However, most existing approaches equally treat title and abstract as the input to learn the representation of a paper, ignoring their semantic relationship. In this paper, we regard the abstract as a sequence of sentences, and propose a two-level attentive neural network to capture: (1) the ability of each word within a sentence to reflect if it is semantically close to the words within the title. (2) the extent of each sentence in the abstract relative to the title, which is often a good summarization of the abstract document. Specifically, we propose a Long-Short Term Memory (LSTM) network with attention to learn the representation of sentences, and integrate a Gated Recurrent Unit (GRU) network with a memory network to learn the long-term sequential sentence patterns of interacted papers for both user and item (paper) modeling. We conduct extensive experiments on two real datasets, and show that our approach outperforms other state-of-the-art approaches in terms of accuracy.

To improve the accuracy of user implicit rating prediction, we combine the traditional latent factor model (LFM) and bidirectional gated recurrent unit neural network (BiGRU) model to propose a hybrid model that deeply mines the latent semantics in the unstructured content of the text and generates a more accurate rating matrix. First, we utilize the user’s historical behavior (favorites records) to build a user rating matrix and decompose the matrix to obtain the latent factor vectors of users and literature. We also apply the BERT model for word embedding of the research papers to obtain the sequence of word vectors. Then, we apply the BiGRU with the user attention mechanism to mine the research paper textual content and to generate the new literature latent feature vectors that are used to replace the original literature latent factor vectors decomposed from the rating matrix. Finally, a new rating matrix is generated to obtain users’ ratings of noninteractive research papers and to generate the recommendation list according to the user latent factor vector. We design experiments on the real datasets and verify that the research paper recommendation model is superior to traditional recommendation models in terms of precision, recall, F1-value, coverage, popularity and diversity.

Swarms of autonomous aircraft systems (SAAS) are used to accomplish missions that deal with sensitive and critical data. As such, these systems are subject to attacks among which clone attacks. Several clone attacks detection approaches either in stationary or mobile wireless sensor networks have been proposed. Unfortunately, the existing approaches are not suitable for swarms of autonomous aircraft systems because either they do not guarantee a fast enough detection (while most SAAS missions are real time missions, e.g. surveillance), or they depend on strong assumptions that are hard to achieve in practice (e.g. absence of nodes collusion, impossibility for an attacker to track a genuine node). In this paper, we present a novel clone attack detection approach specific to SAAS that solves several unaddressed issues and that makes it possible to improve the security and the privacy of the assets of the SAAS.

Virtual Reality (VR) and 360 film have caught the attention of audiences and content creators and emerged as a new media, however, the market penetration of VR and head mounted hardware has remained slow despite the availability of more affordable mobile options. This has resulted in some audiences turning to VR cinemas, festivals and out-of-home exhibitions. Creating affordable, scalable VR cinemas presents a number of challenges and many of the decisions taken in both developing and facilitating these curated exhibitions directly impact audience's reception of spatial audio soundtracks. This workshop position paper looks to discuss the potential issues and future solutions in the use of current synchronous exhibition applications, the competing formats, standardised Head Related Transfer Functions, headphone build/colourisation, and the on-boarding process.

DDoS attack detection using entropy-based features in network traffic has become a popular approach among researchers in the last five years. The use of traffic distribution features constructed using entropy measures has been proposed as a better approach to detect Distributed Denial of Service (DDoS) attacks compared to conventional volumetric methods, but it still lacks in the generality of detecting various intensity DDoS attacks accurately. In this paper, we focus on identifying effective entropy-based features to detect both high- and low-intensity DDoS attacks by exploring the effectiveness of entropy-based features in distinguishing the attack from normal traffic patterns. We hypothesise that using different entropy measures, window sizes, and entropy-based features may affect the accuracy of detecting DDoS attacks. This means that certain entropy measures, window sizes, and entropy-based features may reveal attack traffic amongst normal traffic better than the others. Our experimental results show that using Shannon, Tsallis and Zhou entropy measures can achieve a clearer distinction between DDoS attack traffic and normal traffic than Renyi entropy. In addition, the window size setting used in entropy construction has minimal influence in differentiating between DDoS attack traffic and normal traffic. The result of the effectiveness ranking shows that the commonly used features are less effective than other features extracted from traffic headers.

Most research modelling Bitcoin-style decentralised consensus protocols has assumed profit-motivated participants. Complementary to this analysis, we revisit the notion of attackers with an extrinsic motivation to disrupt the consensus process (Goldfinger attacks). We outline several routes for obtaining a majority of decision-making power in the consensus protocol (a hostile takeover). Our analysis suggests several fundamental differences between proof-of-work and proof-of-stake systems in the face of such an adversary.

Patent terminology relation extraction is of great significance to the construction of patent Knowledge graph. In order to solve the problem of long-distance dependency in traditional depth learning, a new method of patent terminology relation extraction is proposed, which combines attention mechanism and bi-directional LSTM model and with keyword strategy. Category keyword features in each sentence obtained by the improved TextRank with the patent text information vectorization added. BiLSTM neural work and attention mechanism are employed to extract the temporal information and sentence-level global feature information. Moreover, pooling layer is added to obtain the local features of the text. Finally, we fuse the global features and local features, and output the final classification results through the softmax classifier. The addition of category keywords improves the distinction of categories. Substantial experimental results demonstrate that the proposed model outperform the state-of-art neural model in patent terminology relation extraction.

Drug trafficking is a major worldwide problem. In this context, cocaine is one of the most commonly used drugs of abuse. In addition, street cocaine is commonly seized adulterated with pharmaceutic...

Paper and ink have been continually evolving since their invention. Conventional printing quality and cost is constantly improving, yet only few examples of commercial embedded electronics on paper exist. This is due to the fact that inks with optical and electronic properties do not suit conventional paper and are still challenging to print reliably. In this project, we aim to develop a new generic mass media "next generation" paper. We present the challenges and progress on book augmentation, using printing technologies such as screen printing and roll-to-roll fabrication. This first step aims to create an augmented book prototype via hybrid integration of optical sensors in its pages and by embedding energyefficient control and communication electronics in the cover. The system senses user interaction and, through wireless connectivity, presents the user with relevant, updated digital content on an adjunct device. The proposed fabrication sequence has been developed with close attention to the requirements of industrial scale-up.

We introduce a comprehensive benchmark for local features and robust estimation algorithms, focusing on the downstream task -- the accuracy of the reconstructed camera pose -- as our primary metric. Our pipeline's modular structure allows easy integration, configuration, and combination of different methods and heuristics. This is demonstrated by embedding dozens of popular algorithms and evaluating them, from seminal works to the cutting edge of machine learning research. We show that with proper settings, classical solutions may still outperform the perceived state of the art. Besides establishing the actual state of the art, the conducted experiments reveal unexpected properties of Structure from Motion (SfM) pipelines that can help improve their performance, for both algorithmic and learned methods. Data and code are online https://github.com/vcg-uvic/image-matching-benchmark, providing an easy-to-use and flexible framework for the benchmarking of local features and robust estimation methods, both alongside and against top-performing methods. This work provides a basis for the Image Matching Challenge https://vision.uvic.ca/image-matching-challenge., Comment: Added: KeyNet-SOSNet, AffNet-HardNet, TFeat, MKD from kornia

Based on the concept of explanation sheets, we present an approach to make spreadsheets easier to understand and thus easier to use and maintain. We identify the notion of explanation soundness and show that explanation sheets which conform to simple rules of formula coverage provide sound explanations. We also present a practical evaluation of explanation sheets based on samples drawn from widely used spreadsheet corpora and based on a small user study.In addition to supporting spreadsheet understanding and maintenance, our work on explanation sheets has also uncovered several general principles of explanation languages that can help guide the design of explanations for other programming and domain-specific languages., This work is partially supported by the National Science Foundation under the grant CCF-1717300. Work financed by European Regional Development Fund through the Operational Programme for Competitiveness and Internationalization COMPETE 2020 Programme and by National Funds through the Portuguese funding agency FCT project POCI-01-0145-FEDER-016718 and NOVA LINCS UID/CEC/04516/2013, and by FLAD project 233/2014.

Due to the increasing size of s (s), their design and optimization phases (i.e., ) grow increasingly complex. At design time, a large design space needs to be explored to find an implementation that fulfills all specifications and then optimizes metrics like energy, area, delay, reliability, etc. At run time, a large configuration space needs to be searched to find the best set of parameters (e.g., voltage/frequency) to further optimize the system. Both spaces are infeasible for exhaustive search typically leading to heuristic optimization algorithms that find some trade-off between design quality and computational overhead. ML can build powerful models that have successfully been employed in related domains. In this survey, we categorize how () may be used and is used for design-time and run-time optimization and exploration strategies of s. A meta-study of published techniques unveils areas in that are well-explored and underexplored with, as well as trends in the employed algorithms. We present a comprehensive categorization and summary of the state of the art on for. Finally, we summarize remaining challenges and promising open research directions.

The aim of this study was to examine the effects that reading on screens (using digital devices with different screen sizes) and on paper have on reading time and comprehension. The study group was...

The age of a relatively old document is one of the pending issues to be resolved in the field of forensic documentary examination. Although nowadays there are a variety of analytical methodologies focused in the analysis of inks for dating documents, the paper analysis has attained little attention. This work aims to develop two complementary approaches for estimating the age of documents based on paper analysis employing the pyrolysis technique coupled to gas chromatography with detection by mass spectrometry (Py-GC/MS): (i) a direct approach using the pyrolytic fingerprints and multivariate regression with artificially aged samples, and (ii) an indirect approach based on the identification of compounds characteristic of the document period. The direct approach has successfully allowed the age estimation of relatively old documents under police custody (up to 30 years of age) and the determination of a relation between the natural and the accelerated aging of paper under the used conditions. This approach is applicable to papers that have the same (or similar) composition and have been stored under comparable storage conditions. Additionally, the indirect approach is presented as an interesting perspective to ratify valuable information of the document age.

Blockchain technology has become almost as famous for incidents involving security breaches as for its innovative potential. We shed light on the prevalence and nature of these incidents through a database structured using the STIX format. Apart from OPSEC-related incidents, we find that the nature of many incidents is specific to blockchain technology. Two categories stand out: smart contracts, and techno-economic protocol incentives. For smart contracts, we propose to use recent advances in software testing to find flaws before deployment. For protocols, we propose the PRESTO framework that allows us to compare different protocols within a five-dimensional framework., 8 pages, 1 figure, accepted for presentation as a regular paper at IEEE Blockchain 2018 (Halifax, Canada)

The JEL classification system is a standard way of assigning key topics to economic articles to make them more easily retrievable in the bulk of nowadays massive literature. Usually the JEL (Journal of Economic Literature) is picked by the author(s) bearing the risk of suboptimal assignment. Using the database of the Collaborative Research Center from Humboldt-Universität zu Berlin we employ a new adaptive clustering technique to identify interpretable JEL (sub)clusters. The proposed Adaptive Weights Clustering (AWC) is available on http://www.quantlet.de/ and is based on the idea of locally weighting each point (document, abstract) in terms of cluster membership. Comparison with $$k$$ k -means or CLUTO reveals excellent performance of AWC.

Sensitivity analysis (SA) has been used to evaluate the behavior and quality of environmental models by estimating the contributions of potential uncertainty sources to quantities of interest (QoI) in the model output. Although there is an increasing literature on applying SA in environmental modeling, a pragmatic and specific framework for spatially distributed environmental models (SD-EMs) is lacking and remains a challenge. This article reviews the SA literature for the purposes of providing a step-by-step pragmatic framework to guide SA, with an emphasis on addressing potential uncertainty sources related to spatial datasets and the consequent impact on model predictive uncertainty in SD-EMs. The framework includes: identifying potential uncertainty sources; selecting appropriate SA methods and QoI in prediction according to SA purposes and SD-EM properties; propagating perturbations of the selected potential uncertainty sources by considering the spatial structure; and verifying the SA measures based on post-processing. The proposed framework was applied to a SWAT (Soil and Water Assessment Tool) application to demonstrate the sensitivities of the selected QoI to spatial inputs, including both raster and vector datasets - for example, DEM and meteorological information - and SWAT (sub)model parameters. The framework should benefit SA users not only in environmental modeling areas but in other modeling domains such as those embraced by geographical information system communities.

This is like an abstract to a paper, but it is more abstract. In fact, it is the introduction to something which is a not paper. The global Covid-19 pandemic of 2020 represented an inflection point for our post-post-modern world, a moment where our old normal was dramatically arrested. We are now in a state of comprehensive flux as ‘new normals’ emerge, begin to solidify, and may evolve into an—as yet undetermined—futures. This not paper is a facet and exploration of that flux as it relates to publication and conference culture, video conferencing systems, and how we both conduct, and share, research. You should read the whole of this abstract, but then you should take a step inside the not paper, it lives on the web over here https://designresearch.works/thisisnotapaper/

In modern academic social network, it is very difficult for scholars to find academic papers consistent with their research direction. Time is a critical factor in paper recommendation. As time goes on, the impact of an academic paper would gradually fade. Likewise, the research interests of users may also change. Therefore, we propose a temporal perceptual neural collaborative filtering model that integrates the multi-dimensional features of papers. We conducted our experiments on the dataset from CiteULike, comparing the recommended results by using four time-decay functions and evaluating our model with multiple evaluation indicators. The satisfactory results show that our model is effective in filtering out the expired papers by considering the characteristics of papers and the changes of scholars' interests.

Automatically detecting the positions of key-points (e.g., facial key-points or finger key-points) in an image is an essential problem in many applications, such as driver's gaze detection and drowsiness detection in automated driving systems. With the recent advances of Deep Neural Networks (DNNs), Key-Points detection DNNs (KP-DNNs) have been increasingly employed for that purpose. Nevertheless, KP-DNN testing and validation have remained a challenging problem because KP-DNNs predict many independent key-points at the same time -- where each individual key-point may be critical in the targeted application -- and images can vary a great deal according to many factors. In this paper, we present an approach to automatically generate test data for KP-DNNs using many-objective search. In our experiments, focused on facial key-points detection DNNs developed for an industrial automotive application, we show that our approach can generate test suites to severely mispredict, on average, more than 93% of all key-points. In comparison, random search-based test data generation can only severely mispredict 41% of them. Many of these mispredictions, however, are not avoidable and should not therefore be considered failures. We also empirically compare state-of-the-art, many-objective search algorithms and their variants, tailored for test suite generation. Furthermore, we investigate and demonstrate how to learn specific conditions, based on image characteristics (e.g., head posture and skin color), that lead to severe mispredictions. Such conditions serve as a basis for risk analysis or DNN retraining., to appear in ISSTA 2021

Function-as-a-Service (FaaS) has raised a growing interest in how to "tame" serverless to enable domain-specific use cases such as data-intensive applications and machine learning (ML), to name a few. Recently, several systems have been implemented for training ML models. Certainly, these research articles are significant steps in the correct direction. However, they do not completely answer the nagging question of when serverless ML training can be more cost-effective compared to traditional "serverful" computing. To help in this task, we propose MLLess, a FaaS-based ML training prototype built atop IBM Cloud Functions. To boost cost-efficiency, MLLess implements two key optimizations: a significance filter and a scale-in auto-tuner, and leverages them to specialize model training to the FaaS model. Our results certify that MLLess can be 15X faster than serverful ML systems [24] at a lower cost for ML models (such as sparse logistic regression and matrix factorization) that exhibit fast convergence.

Even though AI/ML is of strategic importance for many companies, it is not easy to come up with an AI life cycle in a multi-cloud world that is being increasingly embraced. In this paper, we present our position on an AI strategy that is future proof and does not force vendor lock in.

Industrial archived process data represent a convenient source of information for data-driven models, such as artificial neural network (ANN), that can be used for safety and efficiency improvement like early or even predictive fault detection and diagnosis (FDD). Nonetheless, most of the data used for model generation are representative of the process nominal states and therefore are not enough for classification problems intended to determine abnormal process conditions. This work proposes the use of techniques to augment the original real data standards, dismissing the need for experiments that could jeopardize process safety. It uses the Monte Carlo technique to artificially increase the number of model inputs coupled to the nearest neighbor search (NNS) by geometric distances to consistently classify the generated patterns in normal or faulty statuses. Finally, a radial basis function neural network is trained with the augmented data. The methodology was validated by a study case in which 3381 pulp and paper industrial data points were expanded to monitor the formation of particles in a recovery boiler. Only 5.8% of the original process data were examples of faulty conditions, but the new expanded and balanced data collection leveraged the classification performance of the neural network, allowing its future use for monitoring purpose.

Bitcoin blockchain is growing big, yet its transaction capacity hit its limits in 2017. One solution heavily discussed within the bitcoin community is to let it grow faster by increasing size of the blocks. However, making transactions smaller instead of blocks bigger is more sustainable and also brings other additional benefits. In this paper, we focus on space wasted by non-cryptographic use of hashes and uncompressed numbers within transaction inputs. In our analyses, we show that transactions can be made approximately 16% smaller, depending on their complexity.