SoroushVahidi/scidocs huggingface dataset:
Arx : A DBMS with Semantically Secure Encryption Rishabh
(2017)

In recent years, encrypted databases have emerged as a promising direction that provides data confidentiality without sacrificing functionality: queries are executed on encrypted data. However, existing practical proposals rely on a set of weak encryption schemes that have been shown to leak sensitive data. In this paper, we propose Arx, a practical and functionally rich database system that encrypts the data only with semantically secure encryption schemes. We show that Arx supports real applications such as ShareLaTeX and a health data cloud provider with a modest performance overhead.
Design and Vlsi Implementation of Anti- Collision Enabled Robot Processor Using Rfid Technology
(2012)

RFID is a low power wireless emerging technology which has given rise to highly promising applications in real life. It can be employed for robot navigation. In multi-robot environment, when many robots are moving in the same workspace, there is a possibility of their physical collision with themselves as well as with physical objects. In the present work, we have proposed and developed a processor incorporating smart algorithm for avoiding such collisions with the help of RFID technology and implemented it by using VHDL. The design procedure and the simulated results are very useful in designing and implementing a practical RFID system. The RTL schematic view of the processor is achieved by successfully synthesizing the proposed design.
Text Steganography in SMS
(2007)

One of the services used in mobile phone is the short message service (SMS) which is widely used by the public in all parts of the world especially in Asia and Europe. This service enables people to write and exchange short messages via mobile phone. Due to the limited size of SMS, lack of a proper keyboard on the mobile phone and to improve the speed of typing, new abbreviations have been invented for different words and phrases which has lead to the invention of a new language called SMS-texting. One of the main issues in communication is information security and privacy. There are many methods for secret communication and many researchers are working on steganography. In steganography the data is hidden in a cover media such as picture or text. The present paper offers a new method for secret exchange of information through SMS by using and developing abbreviation text steganography with the use of the invented language of SMS-texting. This project has been implemented by J2ME (Java 2 Micro Edition) programming language and tested on a Nokia N71 mobile phone.
Synchronization and cell search algorithms in 3GPP long term evolution systems (FDD mode)
(2012)

In this paper initial downlink synchronization (sync) and cell identification algorithms for the 3rd generation partnership project (3GPP) long term evolution (LTE) systems are presented. The frequency division duplex (FDD) mode is used in the downlink radio frame structure. A user equipment digital receiver architecture is proposed. The orthogonality of signals in orthogonal frequency division multiplexing (OFDM) may be lost due to some impairments such as frequency, time, and phase offsets. Therefore, major parts of this research are involved in restoring the orthogonality at the user equipment (UE) by using some techniques to estimate the sync parameters, and to detect cell identity among candidate cells based on sync signals. A Farrow structure interpolator is used to compensate the fractional timing offset. Both inter site synchronous and inter site asynchronous networks are presented. Computer simulations are used to demonstrate the performance of the proposed schemes with multipath Rayleigh fading channel, frequency offsets, timing offsets, and additive white Gaussian noise (AWGN). Results show high probability of cell identification in a very short time 20 ms in both multi cell model scenarios, especially when multiple input multiple output (MIMO) technique, oversampling at the UE, and high order Farrow structure interpolator are used. Key-Words: 3GPP LTE, OFDM, MIMO, Frequency and Time Synchronization, Cell Search
Social norms and human cooperation
(2004)

The existence of social norms is one of the big unsolved problems in social cognitive science. Although no other concept is invoked more frequently in the social sciences, we still know little about how social norms are formed, the forces determining their content, and the cognitive and emotional requirements that enable a species to establish and enforce social norms. In recent years, there has been substantial progress, however, on how cooperation norms are enforced. Here we review evidence showing that sanctions are decisive for norm enforcement, and that they are largely driven by non-selfish motives. Moreover, the explicit study of sanctioning behavior provides instruments for measuring social norms and has also led to deeper insights into the proximate and ultimate forces behind human cooperation.
Circular Pulley Versus Variable Radius Pulley: Optimal Design Methodologies and Dynamic Characteristics Analysis
(2013)

Human-centered robotics has received growing interest in low-impedance actuations. In particular, pneumatic artificial muscles (PAMs) provide compliance and high force-to-weight ratio, which allow for safe actuation. However, several performance drawbacks prevent PAMs from being more pervasive. Although many approaches have been proposed to overcome the low control bandwidth of PAMs, some limitations of PAMs, such as restricted workspace and torque capacity, remain to be addressed. This paper analyzes the characteristics and limitations of PAMs-driven joints and subsequently provides an optimization strategy for circular pulleys (CPs) in order to improve joint torque capacity over a large workspace. In addition to CPs, this paper proposes a design methodology to synthesize a pair of variable radius pulleys (VRPs) for further improvement. Simulation and experimental results show that newly synthesized VRPs significantly improve torque capacity in the enlarged workspace without loss of dynamic performance. Finally, the characteristics of CPs and VRPs are discussed in terms of physical human-robot interaction.
Privacy-Preserving Profile Matching for Proximity-Based Mobile Social Networking
(2013)

Proximity-based mobile social networking (PMSN) refers to the social interaction among physically proximate mobile users. The first step toward effective PMSN is for mobile users to choose whom to interact with. Profile matching refers to two users comparing their personal profiles and is promising for user selection in PMSN. It, however, conflicts with users' growing privacy concerns about disclosing their personal profiles to complete strangers. This paper tackles this open challenge by designing novel fine-grained private matching protocols. Our protocols enable two users to perform profile matching without disclosing any information about their profiles beyond the comparison result. In contrast to existing coarse-grained private matching schemes for PMSN, our protocols allow finer differentiation between PMSN users and can support a wide range of matching metrics at different privacy levels. The performance of our protocols is thoroughly analyzed and evaluated via real smartphone experiments.
A Survey of Machine Learning Techniques for Spam Filtering
(2012)

Email spam or junk e-mail (unwanted e-mail “usually of a commercial nature sent out in bulk”) is one of the major problems of the today's Internet, bringing financial damage to companies and annoying individual users. Among the approaches developed to stop spam, filtering is an important and popular one. Common uses for mail filters include organizing incoming email and removal of spam and computer viruses. A less common use is to inspect outgoing email at some companies to ensure that employees comply with appropriate laws. Users might also employ a mail filter to prioritize messages, and to sort them into folders based on subject matter or other criteria. Mail filters can be installed by the user, either as separate programs, or as part of their email program (email client). In email programs, users can make personal, "manual" filters that then automatically filter mail according to the chosen criteria. In this paper, we present a survey of the performance of five commonly used machine learning methods in spam filtering. Most email programs now also have an automatic spam filtering function.
Splitting Compounds by Semantic Analogy
(2015)

Compounding is a highly productive word-formation process in some languages that is often problematic for natural language processing applications. In this paper, we investigate whether distributional semantics in the form of word embeddings can enable a deeper, i.e., more knowledge-rich, processing of compounds than the standard string-based methods. We present an unsupervised approach that exploits regularities in the semantic vector space (based on analogies such as “bookshop is to shop as bookshelf is to shelf”) to produce compound analyses of high quality. A subsequent compound splitting algorithm based on these analyses is highly effective, particularly for ambiguous compounds. German to English machine translation experiments show that this semantic analogy-based compound splitter leads to better translations than a commonly used frequency-based method.
Polymorphic Encryption and Pseudonymisation for Personalised Healthcare
(2016)

Polymorphic encryption and Pseudonymisation, abbreviated as PEP, form a novel approach for the management of sensitive personal data, especially in health care. Traditional encryption is rather rigid: once encrypted, only one key can be used to decrypt the data. This rigidity is becoming an every greater problem in the context of big data analytics, where different parties who wish to investigate part of an encrypted data set all need the one key for decryption. Polymorphic encryption is a new cryptographic technique that solves these problems. Together with the associated technique of polymorphic pseudonymi-sation new security and privacy guarantees can be given which are essential in areas such as (personalised) healthcare, medical data collection via self-measurement apps, and more generally in privacy-friendly identity management and data analytics. The key ideas of polymorphic encryption are: 1. Directly after generation, data can be encrypted in a 'polymorphic' manner and stored at a (cloud) storage facility in such a way that the storage provider cannot get access. Crucially, there is no need to a priori fix who gets to see the data, so that the data can immediately be protected. For instance a PEP-enabled self-measurement device will store all its measurement data in polymorphically encrypted form in a back-end data base. 2. Later on it can be decided who can decrypt the data. This decision will be made on the basis of a policy, in which the data subject should play a key role. The user of the PEP-enabled device can, for instance, decide that doctors X, Y, Z may at some stage decrypt to use the data in their diagnosis, or medical researcher groups A, B, C may use it for their investigations, or third parties U, V, W may use it for additional services, etc. 3. This 'tweaking' of the encrypted data to make it decryptable by a specific party can be done in a blind manner. It will have to be done by a trusted party who knows how to tweak the ciphertext for whom. This PEP technology can provide the necessary security and privacy infrastructure for big data analytics. People can entrust their data in polymorphically encrypted form, and each time decide later to make (parts of) it available (de-cryptable) for specific parties, for specific analysis purposes. In this way users remain in control, and can monitor which of their data is used where by whom for which purposes. The …
Video Captioning by Adversarial LSTM
(2018)

In this paper, we propose a novel approach to video captioning based on adversarial learning and long short-term memory (LSTM). With this solution concept, we aim at compensating for the deficiencies of LSTM-based video captioning methods that generally show potential to effectively handle temporal nature of video data when generating captions but also typically suffer from exponential error accumulation. Specifically, we adopt a standard generative adversarial network (GAN) architecture, characterized by an interplay of two competing processes: a “generator” that generates textual sentences given the visual content of a video and a “discriminator” that controls the accuracy of the generated sentences. The discriminator acts as an “adversary” toward the generator, and with its controlling mechanism, it helps the generator to become more accurate. For the generator module, we take an existing video captioning concept using LSTM network. For the discriminator, we propose a novel realization specifically tuned for the video captioning problem and taking both the sentences and video features as input. This leads to our proposed LSTM–GAN system architecture, for which we show experimentally to significantly outperform the existing methods on standard public datasets.
Reader-Aware Multi-Document Summarization: An Enhanced Model and The First Dataset
(2017)

We investigate the problem of readeraware multi-document summarization (RA-MDS) and introduce a new dataset for this problem. To tackle RA-MDS, we extend a variational auto-encodes (VAEs) based MDS framework by jointly considering news documents and reader comments. To conduct evaluation for summarization performance, we prepare a new dataset. We describe the methods for data collection, aspect annotation, and summary writing as well as scrutinizing by experts. Experimental results show that reader comments can improve the summarization performance, which also demonstrates the usefulness of the proposed dataset. The annotated dataset for RA-MDS is available online1.
Bee Colony Optimization (BCO)
(2009)

Swarm Intelligence is the part of Artificial Intel ligence based on study of actions of individuals in various decentralized sys tems. The Bee Colony Optimization (BCO) metaheuristic has been introduce fairly recently as a new direction in the field of Swarm Intelligence. Artif icial bees represent agents, which collaboratively solve complex combinatorial optimiz ation problem. The chapter presents a classification and analysis of the resul ts achieved using Bee Colony Optimization (BCO) to model complex engineering and management processes. The primary goal of this chapter is to acquaint readers with the basic principles of Bee Colony Optimization, as well as to indicate potenti al BCO applications in engineering and management.
Big data needs approximate computing: technical perspective
(2014)

以容忍。还有一点让人印象深刻: 对于不同的程序,这些提升和能 耗降低并不需要使用不同的加速 器实现方式——它们通过相同的 近似加速器得到,那些加速器可 用于所有程序中所有类型的可近 似代码区。 除了文中描述的之外,通过让 近似计算引擎在明显低得多的电压 下运行,还能节约更多的能源。业 界增长的真正引擎——登纳德缩放 (Dennard scaling)——允许晶体 管减少尺寸,同时消耗更少的能源, 得到更高的性能。但是登纳德缩放 正趋近极限。设备的尺寸已经缩减 到了原子级别。而且,在不牺牲设 备可靠性的情况下,无法继续显著 降低电压。新技术会带来不错的能 耗性能,但由于需要利用冗余来补 偿它们的不可靠性,这一优势被抵 消了。因此,对于传统的交易系统 而言,未来的技术不大可能大幅提 升其能耗性能。然而,对于那些生 成近似结果的系统(比如作者描述 的系统),需要的冗余可能有所不 同且要简单得多。对于这些系统类 型,低电压运行是可行的。 未 来, 当 我 们 使 用 缩 小 的 CMOS 和后硅技术,利用海量计算 处理世上产生的海量数据时,近似 计算似乎是我们最有可能取得成功 的希望。下面的文章就是为实现此 目标所需开展的工作的一个很好的 例子。
Torus data center network with smart flow control enabled by hybrid optoelectronic routers [Invited]
(2015)

A torus-topology photonic data center network with smart flow control is presented, where optical packet switching (OPS), optical circuit switching (OCS), and virtual OCS (VOCS) schemes are all enabled on a unified hardware platform via the combination of hybrid optoelectronic routers (HOPR) and a centralized network controller. An upgraded HOPR is being developed with the goal of handling 100 Gbps optical packets with a high energy efficiency of 90 mW/Gbps and low latency of less than 100 ns. The architecture of HOPR and its enabling technologies are reviewed, including a label processor, optical switch, and optoelectronic shared buffer. We also explain the concept and operation mechanisms of both the data and control planes in the hybrid OPS/OCS/VOCS torus network. The performance of these three transmission modes is evaluated by numerical simulations for a network composed of 4096 HOPRs.
ANNarchy: a code generation approach to neural simulations on parallel hardware
(2015)

Many modern neural simulators focus on the simulation of networks of spiking neurons on parallel hardware. Another important framework in computational neuroscience, rate-coded neural networks, is mostly difficult or impossible to implement using these simulators. We present here the ANNarchy (Artificial Neural Networks architect) neural simulator, which allows to easily define and simulate rate-coded and spiking networks, as well as combinations of both. The interface in Python has been designed to be close to the PyNN interface, while the definition of neuron and synapse models can be specified using an equation-oriented mathematical description similar to the Brian neural simulator. This information is used to generate C++ code that will efficiently perform the simulation on the chosen parallel hardware (multi-core system or graphical processing unit). Several numerical methods are available to transform ordinary differential equations into an efficient C++code. We compare the parallel performance of the simulator to existing solutions.
How to Train Deep Variational Autoencoders and Probabilistic Ladder Networks
(2016)

Variational autoencoders are a powerful framework for unsupervised learning. However, previous work has been restricted to shallow models with one or two layers of fully factorized stochastic latent variables, limiting the flexibility of the latent representation. We propose three advances in training algorithms of variational autoencoders, for the first time allowing to train deep models of up to five stochastic layers, (1) using a structure similar to the Ladder network as the inference model, (2) warm-up period to support stochastic units staying active in early training, and (3) use of batch normalization. Using these improvements we show state-of-the-art log-likelihood results for generative modeling on several benchmark datasets.
Wide Residual Networks
(2016)

Deep residual networks were shown to be able to scale up to thousands of layers and still have improving performance. However, each fraction of a percent of improved accuracy costs nearly doubling the number of layers, and so training very deep residual networks has a problem of diminishing feature reuse, which makes these networks very slow to train. To tackle these problems, in this paper we conduct a detailed experimental study on the architecture of ResNet blocks, based on which we propose a novel architecture where we decrease depth and increase width of residual networks. We call the resulting network structures wide residual networks (WRNs) and show that these are far superior over their commonly used thin and very deep counterparts. For example, we demonstrate that even a simple 16-layer-deep wide residual network outperforms in accuracy and efficiency all previous deep residual networks, including thousand-layerdeep networks, achieving new state-of-the-art results on CIFAR, SVHN, COCO, and significant improvements on ImageNet. Our code and models are available at https: //github.com/szagoruyko/wide-residual-networks.
Deep learning in neural networks: An overview
(2015)

In recent years, deep artificial neural networks (including recurrent ones) have won numerous contests in pattern recognition and machine learning. This historical survey compactly summarizes relevant work, much of it from the previous millennium. Shallow and Deep Learners are distinguished by the depth of their credit assignment paths, which are chains of possibly learnable, causal links between actions and effects. I review deep supervised learning (also recapitulating the history of backpropagation), unsupervised learning, reinforcement learning & evolutionary computation, and indirect search for short programs encoding deep and large networks.
Video games do affect social outcomes: a meta-analytic review of the effects of violent and prosocial video game play.
(2014)

Whether video game play affects social behavior is a topic of debate. Many argue that aggression and helping are affected by video game play, whereas this stance is disputed by others. The present research provides a meta-analytical test of the idea that depending on their content, video games do affect social outcomes. Data from 98 independent studies with 36,965 participants revealed that for both violent video games and prosocial video games, there was a significant association with social outcomes. Whereas violent video games increase aggression and aggression-related variables and decrease prosocial outcomes, prosocial video games have the opposite effects. These effects were reliable across experimental, correlational, and longitudinal studies, indicating that video game exposure causally affects social outcomes and that there are both short- and long-term effects.
A Privacy Preservation Model for Facebook-Style Social Network Systems
(2009)

Recent years have seen unprecedented growth in the popularity of social network systems, with Facebook being an archetypical example. The access control paradigm behind the privacy preservation mechanism of Facebook is distinctly different from such existing access control paradigms as Discretionary Access Control, Role-Based Access Control, Capability Systems, and Trust Management Systems. This work takes a first step in deepening the understanding of this access control paradigm, by proposing an access control model that formalizes and generalizes the privacy preservation mechanism of Facebook. The model can be instantiated into a family of Facebook-style social network systems, each with a recognizably different access control mechanism, so that Facebook is but one instantiation of the model. We also demonstrate that the model can be instantiated to express policies that are not currently supported by Facebook but possess rich and natural social significance. This work thus delineates the design space of privacy preservation mechanisms for Facebook-style social network systems, and lays out a formal framework for policy analysis in these systems.
Adversarial machine learning
(2011)

In this paper (expanded from an invited talk at AISEC 2010), we discuss an emerging field of study: adversarial machine learning---the study of effective machine learning techniques against an adversarial opponent. In this paper, we: give a taxonomy for classifying attacks against online machine learning algorithms; discuss application-specific factors that limit an adversary's capabilities; introduce two models for modeling an adversary's capabilities; explore the limits of an adversary's knowledge about the algorithm, feature space, training, and input data; explore vulnerabilities in machine learning algorithms; discuss countermeasures against attacks; introduce the evasion challenge; and discuss privacy-preserving learning techniques.
Voxel-Based Morphometry—The Methods
(2000)

At its simplest, voxel-based morphometry (VBM) involves a voxel-wise comparison of the local concentration of gray matter between two groups of subjects. The procedure is relatively straightforward and involves spatially normalizing high-resolution images from all the subjects in the study into the same stereotactic space. This is followed by segmenting the gray matter from the spatially normalized images and smoothing the gray-matter segments. Voxel-wise parametric statistical tests which compare the smoothed gray-matter images from the two groups are performed. Corrections for multiple comparisons are made using the theory of Gaussian random fields. This paper describes the steps involved in VBM, with particular emphasis on segmenting gray matter from MR images with nonuniformity artifact. We provide evaluations of the assumptions that underpin the method, including the accuracy of the segmentation and the assumptions made about the statistical distribution of the data.