SoroushVahidi/scidocs huggingface dataset:
Macro process of knowledge management for continuous innovation
(2010)

Purpose The purpose of this research is to understand the mechanisms of knowledge management (KM) for innovation and provide an approach for enterprises to leverage KM activities into continuous innovation. Design/methodology/approach – By reviewing the literature from multidisciplinary fields, the concepts of knowledge, KM and innovation are investigated. The physical, human and technological perspectives of KM are distinguished with the identification of two core activities for innovation: knowledge creation and knowledge usage. Then an essential requirement for continuous innovation –an internalization phase is defined. The systems thinking and human-centred perspectives are adopted for providing a comprehensive understanding about the mechanisms of KM for innovation. Findings – A networking process of continuous innovation based on KM is proposed by incorporating the phase of internalization. According to the three perspectives of KM, three sources of organizational knowledge assets in innovation are identified. Then based on the two core activities of innovation, a meta-model and a macro process of KM are proposed to model the mechanisms of KM for continuous innovation. Then, in order to operationalize the KM mechanisms, a hierarchical model is constructed by integrating three sources of knowledge assets, the meta-model and the macro process into the process of continuous innovation. This model decomposes the complex relationships between knowledge and innovation into four layers. Practical implications – According to the lessons learned about KM practices in previous research, the three perspectives of KM should collaborate with each other for successful implementation of KM projects for innovation; and the hierarchical model provides a suitable architecture to implement systems of KM for innovation. Originality/value – The meta-model and macro process of KM explain how the next generation of KM can help the value creation and support the continuous innovation from the systems thinking perspective. The hierarchical model illustrates the complicate knowledge dynamics in the process of continuous innovation.
Repellent and Contact Toxicity of Alpinia officinarum Rhizome Extract against Lasioderma serricorne Adults
(2015)

The repellent and contact toxicities of Alpinia officinarum rhizome extract on Lasioderma serricorne adults, and its ability to protect stored wheat flour from L. serricorne adults infestation were investigated. The A. officinarum extract exhibited strong repellent and contact toxicities against L. serricorne adults. The toxicities enhanced significantly with the increasing treatment time and treatment dose. The mean percentage repellency value reached 91.3% at class V at the dose of 0.20 μL/cm2 after 48 h of exposure. The corrected mortality reached over 80.0% at the dose of 0.16 μL/cm2 after 48 h of exposure. The A. officinarum extract could significantly reduce L. serricorne infestation level against stored wheat flour. Particularly, the insect infestation was nil in wheat flour packaged with kraft paper bags coated with the A. officinarum extract at the dose of above 0.05 μL/cm2. The naturally occurring A. officinarum extract could be useful for integrated management of L. serricorne.
A regression-based radar-mote system for people counting
(2014)

People counting is key to a diverse set of sensing applications. In this paper, we design a mote-scale event-driven solution that uses a low-power pulsed radar to estimate the number of people within the ~10m radial range of the radar. In contrast to extant solutions, most of which use computer vision, our solution is light-weight and private. It also better tolerates the presence of obstacles that partially or fully impair line of sight; this is achieved by accounting for “small” indirect radio reflections via joint time-frequency domain features. The counter itself is realized using Support Vector Regression; the regression map is learned from a medium sized dataset of 0-~40 people in various indoor room settings. 10-fold cross validation of our counter yields a mean absolute error of 2.17 between the estimated count and the ground truth and a correlation coefficient of 0.97.We compare the performance of our solution with baseline counters.
Automatic Image Alignment and Stitching of Medical Images with Seam Blending
(2010)

This paper proposes an algorithm which automatically aligns and stitches the component medical images (fluoroscopic) with varying degrees of overlap into a single composite image. The alignment method is based on similarity measure between the component images. As applied here the technique is intensity based rather than feature based. It works well in domains where feature based methods have difficulty, yet more robust than traditional correlation. Component images are stitched together using the new triangular averaging based blending algorithm. The quality of the resultant image is tested for photometric inconsistencies and geometric misalignments. This method cannot correct rotational, scale and perspective artifacts. Keywords—Histogram Matching, Image Alignment, Image Stitching, Medical Imaging.
Formal verification of security protocol implementations: a survey
(2012)

Automated formal verification of security protocols has been mostly focused on analyzing high-level abstract models which, however, are significantly different from real protocol implementations written in programming languages. Recently, some researchers have started investigating techniques that bring automated formal proofs closer to real implementations. This paper surveys these attempts, focusing on approaches that target the application code that implements protocol logic, rather than the libraries that implement cryptography. According to these approaches, libraries are assumed to correctly implement some models. The aim is to derive formal proofs that, under this assumption, give assurance about the application code that implements the protocol logic. The two main approaches of model extraction and code generation are presented, along with the main techniques adopted for each approach.
Multiple-path testing for cross site scripting using genetic algorithms
(2016)

Web applications suffer from different security vulnerabilities that could be exploited by hackers to cause harm in a variety of ways. A number of approaches have been proposed to test for such vulnerabilities. However, some gaps are still to be addressed. In this paper, we address one of such gaps: the problem of automatically generating test data (i.e., possible attacks) to test for cross site scripting (XSS) type of vulnerability. The objective is to generate a set of test data to exercise candidate security-vulnerable paths in a given script. The desirable set of test data must be effective in the sense that it uncovers whether any path can indeed be exploited to launch an attack. We designed a genetic algorithm-based test data generator that uses a database of XSS attack patterns to generate possible attacks and assess whether the attack is successful. We considered different types of XSS vulnerability: stored, reflected and DOM based. We empirically validated our test data generator using case studies of Web applications developed using PHP and MySQL. Empirical results show that our test data generator is effective in generating, in one run, multiple test data to cover multiple target
Multi-task assignment for crowdsensing in mobile social networks
(2015)

Mobile crowdsensing is a new paradigm in which a crowd of mobile users exploit their carried smart devices to conduct complex computation and sensing tasks in mobile social networks (MSNs). In this paper, we focus on the task assignment problem in mobile crowdsensing. Unlike traditional task scheduling problems, the task assignment in mobile crowdsensing must follow the mobility model of users in MSNs. To solve this problem, we propose an oFfline Task Assignment (FTA) algorithm and an oNline Task Assignment (NTA) algorithm. Both FTA and NTA adopt a greedy task assignment strategy. Moreover, we prove that the FTA algorithm is an optimal offline task assignment algorithm, and give a competitive ratio of the NTA algorithm. In addition, we demonstrate the significant performance of our algorithms through extensive simulations, based on four real MSN traces and a synthetic MSN trace.
Preventing man-in-the-middle attack in Diffie-Hellman key exchange protocol
(2015)

The acceleration in developments in communication technology has led to a consequent increase in the vulnerability of data due to penetration attacks. These attacks often came from outside where non-qualified companies develop IT projects. Cryptography can offer high levels of security but has recently shown vulnerabilities such as the man-in-the-middle (MITM) attack in areas of key exchange protocols, especially in the Diffie-Hellman (DH) protocol. Firstly, this paper presents an overview of MITM attacks targeted at the DH protocol then discusses some of the shortcomings of current defenses. A proposed method to secure DH, which helps secure systems against MITM attacks, is then presented. This method involves the use of Geffe generation of binary sequences. The use of Geffe generator offers high levels of randomness. Data hashed and encrypted using this proposed method will be so difficult to intercept and decrypt without the appropriate keys. This offers high levels of security and helps prevent MITM attacks.
Information security behavior: Recognizing the influencers
(2017)

With the wide spread use of Internet, comes an increase in Information Security threats. To protect against these threats, technology alone have been found not enough as it can be misused by users and become vulnerable to various threats, thus, losing its usefulness. This is evident as users tend to use weak passwords, open email attachments without checking and do not set correct security settings. However, especially with the continuously evolving threat landscape, one cannot assume that users are always motivated to learn about Information Security and practice it. Actually, there are situations of an aware user who knows how to protect himself but, simply, chooses not to, because they do not care, usability problems or because they do not consider themselves as targets. Thus, understanding human security behavior is vital for ensuring an efficient Information Security environment that cannot depend on technology only. Although a number of psychological theories and models, such as Protection Motivation Theory and Technology Acceptance Model, were used in the literature to interpret these behaviors, they tend to assess users' intensions rather than actual behavior. The aim of this paper is to understand and assess these behaviors from a holistic view by finding the significant factors that influence them and how to best assist users to protect themselves. To accomplish this, a systematic literature review was conducted where relevant literature was sought in a number of academic digital databases. As a result, several key behavioral influencers were identified to be essential to consider when educating and directing users' security behavior. Further to that, a number of Information Security awareness approaches were proposed that may transform the user from being ill-informed into a security-minded user who is able to make an informed decision.
Near-optimal hybrid analog and digital precoding for downlink mmWave massive MIMO systems
(2015)

Millimeter wave (mmWave) massive MIMO can achieve orders of magnitude increase in spectral and energy efficiency, and it usually exploits the hybrid analog and digital precoding to overcome the serious signal attenuation induced by mmWave frequencies. However, most of hybrid precoding schemes focus on the full-array structure, which involves a high complexity. In this paper, we propose a near-optimal iterative hybrid precoding scheme based on the more realistic subarray structure with low complexity. We first decompose the complicated capacity optimization problem into a series of ones easier to be handled by considering each antenna array one by one. Then we optimize the achievable capacity of each antenna array from the first one to the last one by utilizing the idea of successive interference cancelation (SIC), which is realized in an iterative procedure that is easy to be parallelized. It is shown that the proposed hybrid precoding scheme can achieve better performance than other recently proposed hybrid precoding schemes, while it also enjoys an acceptable computational complexity.
Self-compassion increases self-improvement motivation.
(2012)

Can treating oneself with compassion after making a mistake increase self-improvement motivation? In four experiments, the authors examined the hypothesis that self-compassion motivates people to improve personal weaknesses, moral transgressions, and test performance. Participants in a self-compassion condition, compared to a self-esteem control condition and either no intervention or a positive distraction control condition, expressed greater incremental beliefs about a personal weakness (Experiment 1); reported greater motivation to make amends and avoid repeating a recent moral transgression (Experiment 2); spent more time studying for a difficult test following an initial failure (Experiment 3); exhibited a preference for upward social comparison after reflecting on a personal weakness (Experiment 4); and reported greater motivation to change the weakness (Experiment 4). These findings suggest that, somewhat paradoxically, taking an accepting approach to personal failure may make people more motivated to improve themselves.
Collaborative Joint Training With Multitask Recurrent Model for Speech and Speaker Recognition
(2017)

Automatic speech and speaker recognition are traditionally treated as two independent tasks and are studied separately. The human brain in contrast deciphers the linguistic content, and the speaker traits from the speech in a collaborative manner. This key observation motivates the work presented in this paper. A collaborative joint training approach based on multitask recurrent neural network models is proposed, where the output of one task is backpropagated to the other tasks. This is a general framework for learning collaborative tasks and fits well with the goal of joint learning of automatic speech and speaker recognition. Through a comprehensive study, it is shown that the multitask recurrent neural net models deliver improved performance on both automatic speech and speaker recognition tasks as compared to single-task systems. The strength of such multitask collaborative learning is analyzed, and the impact of various training configurations is investigated.
A Scalable Hierarchical Distributed Language Model
(2008)

Neural probabilistic language models (NPLMs) have been shown to be competitive with and occasionally superior to the widely-used n-gram language models. The main drawback of NPLMs is their extremely long training and testing times. Morin and Bengio have proposed a hierarchical language model built around a binary tree of words, which was two orders of magnitude faster than the nonhierarchical model it was based on. However, it performed considerably worse than its non-hierarchical counterpart in spite of using a word tree created using expert knowledge. We introduce a fast hierarchical language model along with a simple feature-based algorithm for automatic construction of word trees from the data. We then show that the resulting models can outperform non-hierarchical neural models as well as the best n-gram models.
Extensions of recurrent neural network language model
(2011)

We present several modifications of the original recurrent neural network language model (RNN LM).While this model has been shown to significantly outperform many competitive language modeling techniques in terms of accuracy, the remaining problem is the computational complexity. In this work, we show approaches that lead to more than 15 times speedup for both training and testing phases. Next, we show importance of using a backpropagation through time algorithm. An empirical comparison with feedforward networks is also provided. In the end, we discuss possibilities how to reduce the amount of parameters in the model. The resulting RNN model can thus be smaller, faster both during training and testing, and more accurate than the basic one.
Distributional Clustering of English Words
(1993)

We describe and experimentally evaluate a method for automatically clustering words according to their distribution in particular syntactic contexts. Deterministic annealing is used to find lowest distortion sets of clusters. As the annealing parameter increases, existing clusters become unstable and subdivide, yielding a hierarchical “soft” clustering of the data. Clusters are used as the basis for class models of word coocurrence, and the models evaluated with respect to held-out test data.
Characterization of liquid crystal polymer (LCP) material and transmission lines on LCP substrates from 30 to 110 GHz
(2004)

Liquid crystal polymer (LCP) is a material that has gained attention as a potential high-performance microwave substrate and packaging material. This investigation uses several methods to determine the electrical properties of LCP for millimeter-wave frequencies. Microstrip ring resonators and cavity resonators are measured in order to characterize the dielectric constant (/spl epsi//sub r/) and loss tangent (tan/spl delta/) of LCP above 30 GHz. The measured dielectric constant is shown to be steady near 3.16, and the loss tangent stays below 0.0049. In addition, various transmission lines are fabricated on different LCP substrate thicknesses and the loss characteristics are given in decibels per centimeter from 2 to 110 GHz. Peak transmission-line losses at 110 GHz vary between 0.88-2.55 dB/cm, depending on the line type and geometry. These results show, for the first time, that LCP has excellent dielectric properties for applications extending through millimeter-wave frequencies.
Efficient Multi-task Feature and Relationship Learning
(2017)

We consider a multitask learning problem, in which several predictors are learned jointly. Prior research has shown that learning the relations between tasks, and between the input features, together with the predictor, can lead to better generalization and interpretability, which proved to be useful for applications in many domains. In this paper, we consider a formulation of multitask learning that learns the relationships both between tasks and between features, represented through a task covariance and a feature covariance matrix, respectively. First, we demonstrate that existing methods proposed for this problem present an issue that may lead to ill-posed optimization. We then propose an alternative formulation, as well as an efficient algorithm to optimize it. Using ideas from optimization and graph theory, we propose an efficient coordinate-wise minimization algorithm that has a closed form solution for each block subproblem. Our experiments show that the proposed optimization method is orders of magnitude faster than its competitors. We also provide a nonlinear extension that is able to achieve better generalization than existing methods.
Sensor relocation in mobile sensor networks
(2005)

Recently there has been a great deal of research on using mobility in sensor networks to assist in the initial deployment of nodes. Mobile sensors are useful in this environment because they can move to locations that meet sensing coverage requirements. This paper explores the motion capability to relocate sensors to deal with sensor failure or respond to new events. We define the problem of sensor relocation and propose a two-phase sensor relocation solution: redundant sensors are first identified and then relocated to the target location. We propose a Grid-Quorum solution to quickly locate the closest redundant sensor with low message complexity, and propose to use cascaded movement to relocate the redundant sensor in a timely, efficient and balanced way. Simulation results verify that the proposed solution outperforms others in terms of relocation time, total energy consumption, and minimum remaining energy.
Distributed Optimization for Model Predictive Control of Linear Dynamic Networks With Control-Input and Output Constraints
(2011)

A linear dynamic network is a system of subsystems that approximates the dynamic model of large, geographically distributed systems such as the power grid and traffic networks. A favorite technique to operate such networks is distributed model predictive control (DMPC), which advocates the distribution of decision-making while handling constraints in a systematic way. This paper contributes to the state-of-the-art of DMPC of linear dynamic networks in two ways. First, it extends a baseline model by introducing constraints on the output of the subsystems and by letting subsystem dynamics to depend on the state besides the control signals of the subsystems in the neighborhood. With these extensions, constraints on queue lengths and delayed dynamic effects can be modeled in traffic networks. Second, this paper develops a distributed interior-point algorithm for solving DMPC optimization problems with a network of agents, one for each subsystem, which is shown to converge to an optimal solution. In a traffic network, this distributed algorithm permits the subsystem of an intersection to be reconfigured by only coordinating with the subsystems in its vicinity.
Semi-Global Matching: A Principled Derivation in Terms of Message Passing
(2014)

Semi-global matching, originally introduced in the context of dense stereo, is a very successful heuristic to minimize the energy of a pairwise multi-label Markov Random Field defined on a grid. We offer the first principled explanation of this empirically successful algorithm, and clarify its exact relation to belief propagation and tree-reweighted message passing. One outcome of this new connection is an uncertainty measure for the MAP label of a variable in a Markov Random Field.
Challenges and implications of using ultrasonic communications in intra-body area networks
(2012)

Body area networks (BANs) promise to enable revolutionary biomedical applications by wirelessly interconnecting devices implanted or worn by humans. However, BAN wireless communications based on radio-frequency (RF) electromagnetic waves suffer from poor propagation of signals in body tissues, which leads to high levels of attenuation. In addition, in-body transmissions are constrained to be low-power to prevent overheating of tissues and consequent death of cells. To address the limitations of RF propagation in the human body, we propose a paradigm shift by exploring the use of ultrasonic waves as the physical medium to wirelessly interconnect in-body implanted devices. Acoustic waves are the transmission technology of choice for underwater communications, since they are known to propagate better than their RF counterpart in media composed mainly of water. Similarly, we envision that ultrasound (e.g., acoustic waves at non-audible frequencies) will provide support for communications in the human body, which is composed for 65% of water. In this paper, we first assess the feasibility of using ultrasonic communications in intra-body BANs, i.e., in-body networks where the devices are biomedical sensors that communicate with an actuator/gateway device located inside the body. We discuss the fundamentals of ultrasonic propagation in tissues, and explore important tradeoffs, including the choice of a transmission frequency, transmission power, bandwidth, and transducer size. Then, we discuss future research challenges for ultrasonic networking of intra-body devices at the physical, medium access and network layers of the protocol stack.