SoroushVahidi/scidocs huggingface dataset:
Survey of Event Correlation Techniques for Attack Detection in Early Warning Systems
(2008)

In the context of early warning systems for detecting Internet worms and other attacks, event correlation techniques are needed for two reasons. First, network attack detection is usually based on distributed sensors, e.g. intrusion detection systems. During attacks but even in normal operation, the generated amount of events is hard to handle in order to evaluate the current attack situation for a larger network. Thus, the concept of event or alert correlation has been introduced. This survey was motivated by recent work on early warning systems. We summarize and clarify the typical terminology used in this context and present a requirement analysis from an early warning system’s point of view. In the main part of this survey, we summarize and classify event correlation techniques as described in the literature.
Bayesian Optimization Using Domain Knowledge on the ATRIAS Biped
(2018)

Robotics controllers often consist of expert-designed heuristics, which can be hard to tune in higher dimensions. Simulation can aid in optimizing these controllers if parameters learned in simulation transfer to hardware. Unfortunately, this is often not the case in legged locomotion, necessitating learning directly on hardware. This motivates using data-efficient learning techniques like Bayesian Optimization (BO) to minimize collecting expensive data samples. BO is a black-box data-efficient optimization scheme, though its performance typically degrades in higher dimensions. We aim to overcome this problem by incorporating domain knowledge, with a focus on bipedal locomotion. In our previous work, we proposed a feature transformation that projected a 16-dimensional locomotion controller to a 1-dimensional space using knowledge of human walking. When optimizing a human-inspired neuromuscular controller in simulation, this feature transformation enhanced sample efficiency of BO over traditional BO with a Squared Exponential kernel. In this paper, we present a generalized feature transform applicable to non-humanoid robot morphologies and evaluate it on the ATRIAS bipedal robot, in both simulation and hardware. We present three different walking controllers and two are evaluated on the real robot. Our results show that this feature transform captures important aspects of walking and accelerates learning on hardware and simulation, as compared to traditional BO.
A double-tail sense amplifier for low-voltage SRAM in 28nm technology
(2016)

A double-tail sense amplifier (DTSA) is designed as a drop-in replacement for a conventional SRAM sense amplifier (SA), to enable a robust read operation at low voltages. A pre-amplification stage helps reduce the offset voltage of the sense amplifier by magnifying the input of the regeneration stage. The self-timed regenerative latch simplifies the timing logic so the DTSA can replace the SA with no area overhead. A test chip in 28nm technology achieves 56% error rate reduction at 0.44V. The proposed scheme achieves 50mV of VDDmin reduction compared to commercial SRAM with a faster timing option that demonstrates a smaller bitline swing.
Sampling cube: a framework for statistical olap over sampling data
(2008)

Sampling is a popular method of data collection when it is impossible or too costly to reach the entire population. For example, television show ratings in the United States are gathered from a sample of roughly 5,000 households. To use the results effectively, the samples are further partitioned in a multidimensional space based on multiple attribute values. This naturally leads to the desirability of OLAP (Online Analytical Processing) over sampling data. However, unlike traditional data, sampling data is inherently uncertain, i.e., not representing the full data in the population. Thus, it is desirable to return not only query results but also the confidence intervals indicating the reliability of the results. Moreover, a certain segment in a multidimensional space may contain none or too few samples. This requires some additional analysis to return trustable results.
 In this paper we propose a Sampling Cube framework, which efficiently calculates confidence intervals for any multidimensional query and uses the OLAP structure to group similar segments to increase sampling size when needed. Further, to handle high dimensional data, a Sampling Cube Shell method is proposed to effectively reduce the storage requirement while still preserving query result quality.
Diagnostic assessment of the borg MOEA for many-objective product family design problems
(2012)

The recently introduced Borg multiobjective evolutionary algorithm (MOEA) framework features auto-adaptive search that tailors itself to effectively explore different problem spaces. A key auto-adaptive feature of the Borg MOEA is the dynamic allocation of search across a suite of recombination and mutation operators. This study explores the application of the Borg MOEA on a real-world product family design problem: the severely constrained, ten objective General Aviation Aircraft (GAA) problem. The GAA problem represents a promising benchmark problem that strongly highlights the importance of using auto-adaptive search to discover how to exploit multiple recombination strategies cooperatively. The auto-adaptive behavior of the Borg MOEA is rigorously compared against its ancestor algorithm, the ε-MOEA, by employing global sensitivity analysis across each algorithm's feasible parameter ranges. This study provides the first Sobol' sensitivity analysis to determine the individual and interactive parameter sensitivities of MOEAs on a real-world many-objective problem.
Foundations of RDF⋆ and SPARQL⋆ (An Alternative Approach to Statement-Level Metadata in RDF)
(2017)

The standard approach to annotate statements in RDF with metadata has a number of shortcomings including data size blow-up and unnecessarily complicated queries. We propose an alternative approach that is based on nesting of RDF triples and of query patterns. The approach allows for a more compact representation of data and queries, and it is backwards compatible with the standard. In this paper we present the formal foundations of our proposal and of different approaches to implement it. More specifically, we formally capture the necessary extensions of the RDF data model and its query language SPARQL, and we define mappings based on which our extended notions can be converted back to ordinary RDF and SPARQL. Additionally, for such type of mappings we define two desirable properties, information preservation and query result equivalence, and we show that the introduced mappings possess these properties.
Learning to Decode for Future Success
(2017)

We introduce a general strategy for improving neural sequence generation by incorporating knowledge about the future. Our decoder combines a standard sequence decoder with a ‘soothsayer’ prediction function Q that estimates the outcome in the future of generating a word in the present. Our model draws on the same intuitions as reinforcement learning, but is both simpler and higher performing, avoiding known problems with the use of reinforcement learning in tasks with enormous search spaces like sequence generation. We demonstrate our model by incorporating Q functions that incrementally predict what the future BLEU or ROUGE score of the completed sequence will be, its future length, and the backwards probability of the source given the future target sequence. Experimental results show that future prediction yields improved performance in abstractive summarization and conversational response generation and the state-of-the-art in machine translation, while also enabling the decoder to generate outputs that have specific properties.
Aspect extraction for opinion mining with a deep convolutional neural network
(2016)

In this paper, we present the first deep learning approach to aspect extraction in opinion mining. Aspect extraction is a subtask of sentiment analysis that consists in identifying opinion targets in opinionated text, i.e., in detecting the specific aspects of a product or service the opinion holder is either praising or complaining about. We used a 7-layer deep convolutional neural network to tag each word in opinionated sentences as either aspect or non-aspect word. We also developed a set of linguistic patterns for the same purpose and combined them with the neural network. The resulting ensemble classifier, coupled with a word-embedding model for sentiment analysis, allowed our approach to obtain significantly better accuracy than state-of-the-art methods.
Design, fabrication and preliminary results of a novel anthropomorphic hand for humanoid robotics: RCH-1
(2004)

Among social infrastructure technologies, robot technology (RT) is expected to play an important role in solving the problems of both decrease of birth rate and increase of elderly people in the 21st century, specially but not only in Japan. In order to achieve this objective, the new generation of personal robots should be capable of a natural communication with humans by expressing human-like emotion. In this sense, human hands play a fundamental role in communication, because they have grasping, sensing and emotional expression ability. This paper presents the recent results of the collaboration between the Takanishi Lab of Waseda University, Tokyo, Japan, and the Arts Lab of Scuola Superiore Sant'Anna, Pisa, Italy, and ROBOCASA. In this paper, the development of a novel anthropomorphic hand for humanoid robotics RCH-1 (ROBOCASA Hand No.1) and its integration into a humanoid robotic platform, named WE-4RII (Waseda Eye No.4 Refined II) is presented.
Educational System for the Holy Quran and Its Sciences for Blind and Handicapped People Based on Google Speech API
(2014)

There is a great need to provide educational environments for blind and handicapped people. There are many Islamic websites and applications dedicated to the educational services for the Holy Quran and Its Sciences (Quran Recitations, the interpretations, etc.) on the Internet. Unfortunately, blind and handicapped people could not use these services. These people cannot use the keyboard and the mouse. In addition, the ability to read and write is essential to benefit from these services. In this paper, we present an educational environment that allows these people to take full advantage of the scientific materials. This is done through the interaction with the system using voice commands by speaking directly without the need to write or to use the mouse. Google Speech API is used for the universal speech recognition after a preprocessing and post processing phases to improve the accuracy. For blind people, responses of these commands will be played back through the audio device instead of displaying the text to the screen. The text will be displayed on the screen to help other people make use of the system.
Web 3.0 Emerging
(2009)

While Web 3.0 technologies are difficult to define precisely, the outline of emerging applications has become clear over the past year. We can thus essentially view Web 3.0 as semantic Web technologies integrated into, or powering, large-scale Web applications. The base of Web 3.0 applications resides in the resource description framework (RDF) for providing a means to link data from multiple Web sites or databases. With the SPARQL query language, a SQL-like standard for querying RDF data, applications can use native graph-based RDF stores and extract RDF data from traditional databases.
Multiple Handshakes Security of TLS 1.3 Candidates
(2016)

The Transport Layer Security (TLS) protocol is by far the most widely deployed protocol for securing communications and the Internet Engineering Task Force (IETF) is currently developing TLS 1.3 as the next-generation TLS protocol. The TLS standard features multiple modes of handshake protocols and supports many combinational running of successive TLS handshakes over multiple connections. Although each handshake mode is now well-understood in isolation, their composition in TLS 1.2 remains problematic, and yet it is critical to obtain practical security guarantees for TLS. In this paper, we present the first formal treatment of multiple handshakes protocols of TLS 1.3 candidates. First, we introduce a multi-level&stage security model, an adaptation of the Bellare-Rogaway authenticated key exchange model, covering all kinds of compositional interactions between different TLS handshake modes and providing reasonably strong security guarantees. Next, we prove that candidate handshakes of TLS 1.3 draft meet our strong notion of multiple handshakes security. Our results confirm the soundness of TLS 1.3 security protection design. Such a multi-level&stage approach is convenient for analyzing the compositional design of the candidates with different session modes, as they establish dependencies of multiple sessions. We also identify the triple handshake attack of Bhargavan et al. on TLS 1.2 within our multiple handshakes security model. We show generically that the proposed fixes (RFC 7627) for TLS 1.2 offer good protection against multiple handshakes attacks.
Exploring Users' Attitudes and Intentions toward the Adoption of Cloud Computing in Saudi Arabia: an Empirical Investigation
(2014)

Over the past few years, cloud computing has evolve d as one of the major advances in the field of Information Technology (IT) utilizing third-party s ervices. Therefore, trust in cloud vendors as well as the determination of potential risks, such as privacy a nd security issues, are crucial for ensuring the su ccessful adoption of an appropriate cloud. Prior research ha ve ddressed the technical aspects of cloud-based environments, such as cloud virtualization, scalabi lity and security. Nevertheless, it is argued that the biggest obstacle of cloud computing is not technolo gical, rather it is perceptual or attitudinal. The adoption of cloud computing has been central to several scho larly research areas, particularly user acceptance. This study presents an extended Technology Acceptance Mo del (TAM), which integrates Trust (TR), Anxiety (ANX) and Perceived Risk (PR), to investigate users ’ attitudes and intentions toward the adoption of c l ud computing. The proposed model was empirically exami ned using the Structural Equation Model (SEM) to analyze data gathered by a survey of both IT profes sionals and end users. The results herein suggested that trust, anxiety and PR can be successfully integrate d within the TAMs. Trust has demonstrated to have a strong positive influence on Perceived Ease of Use (PEOU), but it had no significant effects on Perceived Use fuln ss (PU). Both anxiety and PR were found to have signif icant negative effects on PEOU and PU. In addition, Behavioral Intention (BI) to use the cloud can be p r dicted by trust, attitudes and PU, as PR was show n t have no significant effect on BI. The proposed model, including PR, trust and anxiety , has been demonstrated to be a true predictor of user intentions, toward t he use of cloud computing, within the context of Sa udi Arabia.
Software-Defined LANs for Interconnected Smart Environment
(2015)

In this paper, we propose a solution to delegate the control and the management of the network connecting the many devices of a smart environment to a software entity, while keeping end-users in control of what is happening in their networks. For this, we rely on the logical manipulation of all connected devices through device abstraction and network programmability. Applying Software Defined Networking (SDN) principles, we propose a software-based solution that we call Software-Defined LANs in order to interconnect devices of smart environments according to the services the users are requesting or expecting.We define the adequate virtualization framework based on Virtual Objects and Communities of Virtual Objects. Using these virtual entities, we apply the SDN architectural principles to define a generic architecture that can be applied to any smart environment. Then we describe a prototype implementing these concepts in the home networking context, through a scenario in which users of two different homes can easily interconnect two private but shareable DLNA devices in a dedicated video-delivery SD-LAN. Finally we provide a discussion of the benefits and challenges of our approach regarding the generalization of SDN principles, autonomic features, Internet of Things scalability, security and privacy aspects enabled by SD-LANs intrinsic properties.
Named entity recognition on Indonesian Twitter posts using long short-term memory networks
(2017)

The task of Named-Entity Recognition (NER) can support the higher-level tasks such as question answering, text summarization, and information retrieval. This work views NER on Indonesian Twitter posts as a sequence labeling problem using supervised machine learning approach. The architecture used is Long Short-Term Memory Networks (LSTMs), with word embedding and POS tag as the model features. As the result, our model can give a performance with an F1 score of 77.08%.
Scrutinizing WPA2 Password Generating Algorithms in Wireless Routers
(2015)

A wireless router is a networking device that enables a user to set up a wireless connection to the Internet. A router can offer a secure channel by cryptographic means which provides authenticity and confidentiality. Nowadays, almost all routers use a secure channel by default that is based on Wi-Fi Protected Access II (WPA2). This is a security protocol which is believed not to be susceptible to practical key recovery attacks. However, the passwords should have sufficient entropy to avert bruteforce attacks. In this paper, we compose a strategy on how to reverse-engineer embedded routers. Furthermore, we describe a procedure that can instantly gather a complete wireless authentication trace which enables an offline password recovery attack. Finally, we present a number of use cases where we identify extremely weak password generating algorithms in various routers which are massively deployed in The Netherlands. The algorithms are used to generate the default WPA2 password. Such a password is loaded during device initialization and hardware reset. Users that did not explicitly change their wireless password are most likely vulnerable to practical attacks which can recover their password within minutes. A stolen password allows an adversary to abuse someone else’s internet connection, for instance compromising the firewall, making a fraudulent transaction or performing other criminal activities. Together with the Dutch National Cyber Security Centre we have initiated a responsible disclosure procedure. However, since these routers are also used by many other companies in various countries, our findings seem to relate an international industry wide security issue.
A Simplification-Translation-Restoration Framework for Cross-Domain SMT Applications
(2012)

Integration of domain specific knowledge into a general purpose statistical machine translation (SMT) system poses challenges due to insufficient bilingual corpora. In this paper we propose a simplification-translation-restoration (STR) framework for domain adaptation in SMT by simplifying domain specific segments of a text. For an in-domain text, we identify the critical segments and modify them to alleviate the data sparseness problem in the out-domain SMT system. After we receive the translation result, these critical segments are then restored according to the provided in-domain knowledge. We conduct experiments on an English-toChinese translation task in the medical domain and evaluate each step of the STR framework. The translation results show significant improvement of our approach over the out-domain and the naïve in-domain SMT systems. 用於跨領域統計式機器翻譯系統之簡化-翻譯-還原架構
A column approximate minimum degree ordering algorithm
(2004)

Sparse Gaussian elimination with partial pivoting computes the factorization <b>PAQ</b> = <b>LU</b> of a sparse matrix <b>A</b>, where the row ordering <b>P</b> is selected during factorization using standard partial pivoting with row interchanges. The goal is to select a column preordering, <b>Q</b>, based solely on the nonzero pattern of <b>A</b>, that limits the worst-case number of nonzeros in the factorization. The fill-in also depends on <b>P</b>, but <b>Q</b> is selected to reduce an upper bound on the fill-in for any subsequent choice of <b>P</b>. The choice of <b>Q</b> can have a dramatic impact on the number of nonzeros in <b>L</b> and <b>U</b>. One scheme for determining a good column ordering for <b>A</b> is to compute a symmetric ordering that reduces fill-in in the Cholesky factorization of <b>A<sup>T</sup>A</b>. A conventional minimum degree ordering algorithm would require the sparsity structure of <b>A<sup>T</sup>A</b> to be computed, which can be expensive both in terms of space and time since <b>A<sup>T</sup>A</b> may be much denser than <b>A</b>. An alternative is to compute <b>Q</b> directly from the sparsity structure of <b>A</b>; this strategy is used by MATLAB's COLMMD preordering algorithm. A new ordering algorithm, COLAMD, is presented. It is based on the same strategy but uses a better ordering heuristic. COLAMD is faster and computes better orderings, with fewer nonzeros in the factors of the matrix.
Simultaneous map building and localization for an autonomous mobile robot
(1991)

In this paper, we discuss a significant open problem in mobile robotics: simultaneous map building and localization, which we define as long-term globally referenced position estimation without a priori information. This problem is difficult because of the following paradox: to move precisely, a mobile robot must have an accurate environment map; however, to build an accurate map, the mobile robot’s sensing locations must be known precisely. In this way, simultaneous map building and localization can be seen to present a question of “which came first, the chicken or the egg?” (The map or the motion?) When using ultrasonic sensing, to overcome this issue we equip the vehicle with multiple servo-mounted sonar sensors, to provide a means in which a subset of environment features can be precisely learned from the robot’s initial location and subsequently tracked to provide precise positioning.
Stiffness analysis for a 3-PUU parallel kinematic machine
(2007)

This paper presents the stiffness characteristics of a three-prismatic-universal–universal (3-PUU) translational parallel kinematic machine (PKM). The stiffness matrix is derived intuitively based upon an alternative approach considering actuations and constraints, and the compliances subject to both actuators and legs are involved in the stiffness model. The stiffness performance of the manipulator is evaluated by utilizing the extremum stiffness values, and the influences of design parameters on the stiffness properties are presented, which will be valuable for the architecture design of a 3-PUU PKM. Moreover, the stiffness behavior of the PKM is investigated via the eigenscrew decomposition of the stiffness matrix, which provides a physical interpretation of the PKM stiffness and allows the identification of the stiffness center and compliant axis. 2007 Elsevier Ltd. All rights reserved.
Controllable Text Generation
(2017)

Generic generation and manipulation of text is challenging and has limited success compared to recent deep generative modeling in visual domain. This paper aims at generating plausible natural language sentences, whose attributes are dynamically controlled by learning disentangled latent representations with designated semantics. We propose a new neural generative model which combines variational auto-encoders and holistic attribute discriminators for effective imposition of semantic structures. With differentiable approximation to discrete text samples, explicit constraints on independent attribute controls, and efficient collaborative learning of generator and discriminators, our model learns highly interpretable representations from even only word annotations, and produces realistic sentences with desired attributes. Quantitative evaluation validates the accuracy of sentence and attribute generation.