nils-herrmann/clean_scirepeval huggingface dataset:
Teenager ’ s Addiction to Smart Phones and Its Integrated Therapy Method

The fundamental cause of teenagers’ addiction to smart phone is due to stress arising from family and school. Smartphone can cause many problems including musculoskeletal symptom which can develop due to staying in one position for a long time. Furthermore, starring at a small screen for an extended time can cause decreased eye sight, along with amblyopia. Smart phone addiction causes depression and anxiety which will lead to severe mental problems. This will lead to problems associated to one’s social life and human network. Fundamental treatment of cognitive and emotional elements needed to become harmonized as a whole in order to increase the effectiveness of the treatment results. The therapy has been verified to cure the behavioral and emotional aspect related to depression, sense of control, and assimilation in school. From these integrated treatment approaches, this report compared the treatment’s upsides and downsides and also, assessed the possibility the integrated treatment process. We can presume that this report provided the opportunity and support for the creation of a fundamental treatment method that can help teenagers live a healthy life by overcoming addiction to smart phones.
A document level neural model integrated domain knowledge for chemical-induced disease relations

The effective combination of texts and knowledge may improve performances of natural language processing tasks. For the recognition of chemical-induced disease (CID) relations which may span sentence boundaries in an article, although existing CID systems explored the utilization for knowledge bases, the effects of different knowledge on the identification of a special CID haven’t been distinguished by these systems. Moreover, systems based on neural network only constructed sentence or mention level models. In this work, we proposed an effective document level neural model integrated domain knowledge to extract CID relations from biomedical articles. Basic semantic information of an article with respect to a special CID candidate pair was learned from the document level sub-network module. Furthermore, knowledge attention depending on the representation of the article was proposed to distinguish the influences of different knowledge on the special CID pair and then the final representation of knowledge was formed by aggregating weighed knowledge. Finally, the integrated representations of texts and knowledge were passed to a softmax classifier to perform the CID recognition. Experimental results on the chemical-disease relation corpus proposed by BioCreative V show that our proposed system integrated knowledge achieves a good overall performance compared with other state-of-the-art systems. Experimental analyses demonstrate that the introduced attention mechanism on domain knowledge plays a significant role in distinguishing influences of different knowledge on the judgment for a special CID relation.
Multi-view to Novel View: Synthesizing Novel Views With Self-learned Confidence

In this paper, we address the task of multi-view novel view synthesis, where we are interested in synthesizing a target image with an arbitrary camera pose from given source images. We propose an endto-end trainable framework that learns to exploit multiple viewpoints to synthesize a novel view without any 3D supervision. Specifically, our model consists of a flow prediction module and a pixel generation module to directly leverage information presented in source views as well as hallucinate missing pixels from statistical priors. To merge the predictions produced by the two modules given multi-view source images, we introduce a self-learned confidence aggregation mechanism. We evaluate our model on images rendered from 3D object models as well as real and synthesized scenes. We demonstrate that our model is able to achieve state-of-the-art results as well as progressively improve its predictions when more source images are available.
Research of security metric architecture for Next Generation Network

Constructing a security metric architecture in Next Generation Network is a critical part for network security assessment. In this paper, a three-dimensional security metric architecture model is given. In this model, four comprehensive metrics, which are vulnerability, threat, stability and survivability, are first presented. Then based on these four metrics, a hierarchical security metric architecture is devised, and instanced in a prototype system of NGN. Compared with qualitative metrics, the presented metrics are not only accurate, but also measurable and easy to collect based on the quantitative parameters. Since there is limited research result of the security metric architecture for NGN at present, this model can be referenced to a certain extent.
CACTUS - Clustering Categorical Data Using Summaries

Clustering is an important data mining problem. Most of the earlier work on clustering focussed on numeric attributes which have a natural ordering on their attribute values. Recently, clustering data with categorical attributes, whose attribute values do not have a natural ordering, has received some attention. However, previous algorithms do not give a formal description of the clusters they discover and some of them assume that the user post-processes the output of the algorithm to identify the final clusters. In this paper, we introduce a novel formalization of a cluster for categorical attributes by generalizing a definition of a cluster for numerical attributes. We then describe a very fast summarizationbased algorithm called CACTUS that discovers exactly such clusters in the data. CACTUS has two important characteristics. First, the algorithm requires only two scans of the dataset, and hence is very fast and scalable. Our experiments on a variety of datasets show that CACTUS outperforms previous work by a factor of 3 to 10. Second, CACTUS can find clusters in subsets of all attributes and can thus perform a subspace clustering of the data. This feature is important if clusters do not span all attributes, a likely scenario if the number of attributes is very large. In a thorough experimental evaluation, we study the performance of CACTUS on real and synthetic datasets.
The Agile Requirements Refinery: Applying SCRUM Principles to Software Product Management

Although agile software development methods such as SCRUM and DSDM are gaining popularity, the consequences of applying agile principles to software product management have received little attention until now. In this paper, this gap is filled by the introduction of a method for the application of SCRUM principles to software product management. For this purpose, the 'agile requirements refinery' is presented, an extension to the SCRUM process that enables product managers to cope with large requirements in an agile development environment. A real-life case study is presented to illustrate how agile methods can be applied to software product management. The experiences of the case study company are provided as a set of lessons learned that will help others to apply agile principles to their software product management process.
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals

Data analysis applications typically aggregate data across manydimensions looking for anomalies or unusual patterns. The SQL aggregatefunctions and the GROUP BY operator produce zero-dimensional orone-dimensional aggregates. Applications need the N-dimensionalgeneralization of these operators. This paper defines that operator, calledthe data cube or simply cube. The cube operator generalizes the histogram,cross-tabulation, roll-up,drill-down, and sub-total constructs found in most report writers.The novelty is that cubes are relations. Consequently, the cubeoperator can be imbedded in more complex non-procedural dataanalysis programs. The cube operator treats each of the Naggregation attributes as a dimension of N-space. The aggregate ofa particular set of attribute values is a point in this space. Theset of points forms an N-dimensional cube. Super-aggregates arecomputed by aggregating the N-cube to lower dimensional spaces.This paper (1) explains the cube and roll-up operators, (2) showshow they fit in SQL, (3) explains how users can define new aggregatefunctions for cubes, and (4) discusses efficient techniques tocompute the cube. Many of these features are being added to the SQLStandard.
Internet of Things (IoT): A vision, architectural elements, and future directions

Ubiquitous sensing enabled by Wireless Sensor Network (WSN) technologies cuts across many areas of modern day living. This offers the ability to measure, infer and understand environmental indicators, from delicate ecologies and natural resources to urban environments. The proliferation of these devices in a communicating-actuating network creates the Internet of Things (IoT), wherein, sensors and actuators blend seamlessly with the environment around us, and the information is shared across platforms in order to develop a common operating picture (COP). Fuelled by the recent adaptation of a variety of enabling device technologies such as RFID tags and readers, near field communication (NFC) devices and embedded sensor and actuator nodes, the IoT has stepped out of its infancy and is the the next revolutionary technology in transforming the Internet into a fully integrated Future Internet. As we move from www (static pages web) to web2 (social networking web) to web3 (ubiquitous computing web), the need for data-on-demand using sophisticated intuitive queries increases significantly. This paper presents a cloud centric vision for worldwide implementation of Internet of Things. The key enabling technologies and application domains that are likely to drive IoT research in the near future are discussed. A cloud implementation using Aneka, which is based on interaction of private and public clouds is presented. We conclude our IoT vision by expanding on the need for convergence of WSN, the Internet and distributed computing directed at technological research community.
DoS and DDoS in Named Data Networking

With the growing realization that current Internet protocols are reaching the limits of their senescence, several on-going research efforts aim to design potential next-generation Internet architectures. Although they vary in maturity and scope, in order to avoid past pitfalls, these efforts seek to treat security and privacy as fundamental requirements. Resilience to Denial-of-Service (DoS) attacks that plague today's Internet is a major issue for any new architecture and deserves full attention. In this paper, we focus on DoS in Named Data Networking (NDN) - a specific candidate for next-generation Internet architecture designs. By naming data instead of its locations, NDN transforms data into a first-class entity and makes itself an attractive and viable approach to meet the needs for many current and emerging applications. It also incorporates some basic security features that mitigate classes of attacks that are commonly seen today. However, NDN's resilience to DoS attacks has not been analyzed to-date. This paper represents a first step towards assessment and possible mitigation of DoS in NDN. After identifying and analyzing several new types of attacks, it investigates their variations, effects and counter-measures. This paper also sheds some light on the debate about relative virtues of self-certifying, as opposed to human-readable, names in the context of content-centric networking.
Two hearts in three-quarter time : How to waltz the social media / viral marketing dance

The concept of viral marketing has been discussed in the literature for over 15 years, since Jeffrey Rayport first introduced the term in 1996. However, the more widespread use of social media has recently pushed this idea to a whole new level. We provide insight into the relationship between social media and viral marketing, and illustrate the six steps executives should take in order to dance the social media/viral marketing waltz. We define viral marketing as electronic word-of-mouth whereby some form of marketing message related to a company, brand, or product is transmitted in an exponentially growing wayâ€”often through the use of social media applications. We consider the three conditions that need to be fulfilled to create a viral marketing epidemic (i.e., giving the right message to the right messengers in the right environment) and present four different groups of social media viral marketing campaigns (nightmares, strokes-of-luck, homemade issues, and triumphs). We conclude Purchase Export Previous article Next article Check if you have access through your login credentials or your institution.
Resolving constraint conflicts

In this paper, we define constraint conflicts and examine properties that may aid in guiding their resolution. A constraint conflict is an inconsistency between the access control policy and the constraints specified to limit that policy. For example, a policy that permits a high integrity subject to access low integrity data is in conflict with a Biba integrity constraint. Constraint conflicts differ from typical policy conflicts in that constraints are never supposed to be violated. That is, a conflict with a constraint results in a policy compilation error, whereas policy conflicts are resolved at runtime. As we have found in the past, when constraint conflicts occur in a specification a variety of resolutions are both possible and practical. In this paper, we detail some key formal properties of constraint conflicts and show how these are useful in guiding conflict resolution. We use the SELinux example policy for Linux 2.4.19 as the source of our constraint conflicts and resolution examples. The formal properties are used to guide the selection of resolutions and provide a basis for a resolution language that we apply to resolve conflicts in the SELinux example policy.
Indexing and Query Processing Techniques in Spatio-Temporal Data

Indexing and query processing is an emerging research field in spatio temporal data. Most of the real-time applications such as location based services, fleet management, traffic prediction and radio frequency identification and sensor networks are based on spatiotemporal indexing and query processing. All the indexing and query processing applications is any one of the forms, such as spatio index access and supporting queries or spatio-temporal indexing method and support query or temporal dimension, while in spatial data it is considered as the second priority. In this paper, give the survey of the various uncertain indexing and query processing techniques. Most of the existing survey works on spatio-temporal are based on indexing methods and query processing, but presented separately. Both the indexing and querying are related, hence state of art of both the indexing and query processing techniques are considered together. This paper gives the details of spatio-temporal data classification, various types of indexing methods, query processing, application areas and research direction of spatio-temporal indexing and query
Statistical language modeling using the CMU-cambridge toolkit

The CMU Statistical Language Modeling toolkit was re leased in in order to facilitate the construction and testing of bigram and trigram language models It is currently in use in over academic government and industrial laboratories in over countries This paper presents a new version of the toolkit We outline the con ventional language modeling technology as implemented in the toolkit and describe the extra e ciency and func tionality that the new toolkit provides as compared to previous software for this task Finally we give an exam ple of the use of the toolkit in constructing and testing a simple language model
A Sublinear Additive Sieve for Finding Prime Numbers

Paul Pritchard University of Queensland, Australia greater bit complexity than Eratos~henes' sieve, even when they use the fastest known multiplication algorithm (that of Schonhiige and Strassen; see ). We present here a sublinear additive sieve algorithm. It is obtained by first transforming a linear multiplicative sieve algorithm developed by Mairson  so that only O(N/log log N) operations are required. We then show how multiplications can be avoided, giving an algorithm with an arithmetic complexity of O(N/log log N ) additions.
A literature survey on social engineering attacks: Phishing attack

Phishing is a network type attack where the attacker creates the fake of an existing webpage to fool an online user into elicit personal Information. The prime objective of this review is to do literature survey on social engineering attack: Phishing attack and techniques to detect attack. Phishing is the combination of social engineering and technical methods to convince the user to reveal their personal data. The paper discusses about the Phishing social engineering attack theoretically and their issues in the life of human Beings. Phishing is typically carried out by Email spoofing or instant messaging. It targets the user who has no knowledge about social engineering attacks, and internet security, like persons who do not take care of privacy of their accounts details such as Facebook, Gmail, credit banks accounts and other financial accounts. The paper discusses various types of Phishing attacks such as Tab-napping, spoofing emails, Trojan horse, hacking and how to prevent them. At the same time this paper also provides different techniques to detect these attacks so that they can be easily dealt with in case one of them occurs. The paper gives a thorough analysis of various Phishing attacks along with their advantages and disadvantages.
Practical Black-Box Attacks against Machine Learning

Machine learning (ML) models, e.g., deep neural networks (DNNs), are vulnerable to adversarial examples: malicious inputs modified to yield erroneous model outputs, while appearing unmodified to human observers. Potential attacks include having malicious content like malware identified as legitimate or controlling vehicle behavior. Yet, all existing adversarial example attacks require knowledge of either the model internals or its training data. We introduce the first practical demonstration of an attacker controlling a remotely hosted DNN with no such knowledge. Indeed, the only capability of our black-box adversary is to observe labels given by the DNN to chosen inputs. Our attack strategy consists in training a local model to substitute for the target DNN, using inputs synthetically generated by an adversary and labeled by the target DNN. We use the local substitute to craft adversarial examples, and find that they are misclassified by the targeted DNN. To perform a real-world and properly-blinded evaluation, we attack a DNN hosted by MetaMind, an online deep learning API. We find that their DNN misclassifies 84.24% of the adversarial examples crafted with our substitute. We demonstrate the general applicability of our strategy to many ML techniques by conducting the same attack against models hosted by Amazon and Google, using logistic regression substitutes. They yield adversarial examples misclassified by Amazon and Google at rates of 96.19% and 88.94%. We also find that this black-box attack strategy is capable of evading defense strategies previously found to make adversarial example crafting harder.
Fire and smoke detection using wavelet analysis and disorder characteristics

The fire and smoke monitoring systems are useful in different industry such as military, social security and economical. The recent methods for fire and smoke detection are used only motion and color characteristics thus many wrong alarms are happening and this is decrease the performance of the systems. This research presents a new method for fire and smoke detection through image processing. In this algorithm all objects in an image is considered and then check them to figure out which objects are smoke and fire. The color, motion and disorder are useful characteristics in fire and smoke detection algorithm. Smoke of fire will blur the whole or part of the images. Thus by processing of the video frames, different objects will detect. Due to evaluate the features of objects, the goal objects (fire and smoke) can be defined easily. Two-dimensional wavelet analysis is used in the presented method. The results of this research present the proposed features that can reduce the wrong alarms and increase the system performances.
-‐ 11 December 2013 SENSOR NETWORKS FOR MONITORING AND CONTROL OF WATER DISTRIBUTION SYSTEMS

Water distribution systems present a significant challenge for structural monitoring. They comprise a complex network of pipelines buried underground that are relatively inaccessible. Maintaining the integrity of these networks is vital for providing clean drinking water to the general public. There is a need for in-situ, on-line monitoring of water distribution systems in order to facilitate efficient management and operation. In particular, it is important to detect and localize pipe failures soon after they occur, and pre-emptively identify ‘hotspots’, or areas of the distribution network that are more likely to be susceptible to structural failure. These capabilities are vital for reducing the time taken to identify and repair failures and hence, mitigating impacts on water supply. WaterWiSe is a platform that manages and analyses data from a network of intelligent wireless sensor nodes, continuously monitoring hydraulic, acoustic and water quality parameters. WaterWiSe supports many applications including dynamic prediction of water demand and hydraulic state, online detection of events such as pipe bursts, and data mining for identification of longer-term trends. This paper describes the WaterWiSe@SG project in Singapore, focusing on the use of WaterWiSe as a tool for monitoring, detecting and predicting abnormal events that may be indicative of structural pipe failures, such as bursts or leaks.
Monocular SLAM as a Graph of Coalesced Observations

We present a monocular SLAM system that avoids inconsistency by coalescing observations into independent local coordinate frames, building a graph of the local frames, and optimizing the resulting graph. We choose coordinates that minimize the nonlinearity of the updates in the nodes, and suggest a heuristic measure of such nonlinearity, using it to guide our traversal of the graph. The system operates in real-time on sequences with several hundreds of landmarks while performing global graph optimization, yielding accurate and nearly consistent estimation relative to offline bundle adjustment, and considerably better consistency than EKF SLAM and FastSLAM.