SoroushVahidi/scidocs huggingface dataset:
Simulating crowd movement in agent-based model of large-scale flood
(2015)

Crowd movement during natural disasters and major accidents can affect the success of evacuation procedure. Thus to develop an effective evacuation plan, a wide-range of scenarios causing different routes and patterns of crowd movement should be considered. Recent researches in agent-based simulation have achieved techniques to simulate crowd movement in emergency scenarios at city scale. However simulating crowd movement at a macroscopic level for disasters which might affect several cities, like large-scale flood, is still a challenge. This paper addresses this issue and makes three contributions. First, the development of an agent-based layered model to simulate large-scale flood using GIS is demonstrated. Second, the simulation of crowd agents' movement on available roads is presented. Third, the preliminary experiments running on private Cloud server is reported. The experiments cover case studies illustrated the movement of crowd agents around Thailand while several parts of the country were inundated. The 2D animation depict the movement of crowd; and the simulation results show the status of the agents and the amount of individuals which required shelters. To simulate one day events, the simulator took 4-9 hours execution time depending on the severity of floods and available facilities.
Secure routing for internet of things: A survey
(2016)

The Internet of Things (IoT) could be described as the pervasive and global network which aids and provides a system for the monitoring and control of the physical world through the collection, processing and analysis of generated data by IoT sensor devices. It is projected that by 2020 the number of connected devices is estimated to grow exponentially to 50 billion. The main drivers for this growth are our everyday devices such as cars, refrigerators, fans, lights, mobile phones and other operational technologies including the manufacturing infrastructures which are now becoming connected systems across the world. It is apparent that security will pose a fundamental enabling factor for the successful deployment and use of most IoT applications and in particular secure routing among IoT sensor nodes thus, mechanisms need to be designed to provide secure routing communications for devices enabled by the IoT technology. This survey analyzes existing routing protocols and mechanisms to secure routing communications in IoT, as well as the open research issues. We further analyze how existing approaches ensure secure routing in IoT, their weaknesses, threats to secure routing in IoT and the open challenges and strategies for future research work for a better secure IoT routing.
Practical Identity-Based Encryption Without Random Oracles
(2006)

We present an Identity Based Encryption (IBE) system that is fully secure in the standard model and has several advantages over previous such systems – namely, computational efficiency, shorter public parameters, and a “tight” security reduction, albeit to a stronger assumption that depends on the number of private key generation queries made by the adversary. Our assumption is a variant of Boneh et al.’s decisional Bilinear Diffie-Hellman Exponent assumption, which has been used to construct efficient hierarchical IBE and broadcast encryption systems. The construction is remarkably simple. It also provides recipient anonymity automatically, providing a second (and more efficient) solution to the problem of achieving anonymous IBE without random oracles. Finally, our proof of CCA2 security, which has more in common with the security proof for the Cramer-Shoup encryption scheme than with security proofs for other IBE systems, may be of independent interest.
Empirical Evaluation of User Experience in two Adaptive Mobile Application Prototypes
(2003)

Today’s applications such as ubiquitous systems are more and more aware of user’s habits and the context of use. The features of products and the context of use will affect the human’s experiences and preferences about the use of device. Thus, user experience in user-product interaction has been regarded as an important research topic in the mobile application design area. The purpose of this paper is to clarify how user experience can be evaluated in adaptive mobile applications. The user experience evaluations were performed through interviews and observation while test users were using PDA-based adaptive mobile application prototypes. As a result, this paper presents the analysis of the test methods for further user experience evaluations. CR Categories: J.m [Computer Applications]: Miscellaneous; Experimentation; Human Factors
Changes in adult attachment styles in American college students over time: a meta-analysis.
(2014)

The current article examines changes over time in a commonly used measure of adult attachment style. A cross-temporal meta-analysis was conducted on 94 samples of American college students (total N = 25,243, between 1988 and 2011) who chose the most representative description of four possible attachment styles (Secure, Dismissing, Preoccupied, and Fearful) on the Relationship Questionnaire. The percentage of students with Secure attachment styles has decreased in recent years (1988: 48.98%; 2011: 41.62%), whereas the percentage of students with Insecure attachment styles (sum of Dismissing, Preoccupied, Fearful) has increased in recent years (1988: 51.02%; 2011: 58.38%). The percentage of students with Dismissing attachment styles has increased over time (1988: 11.93%; 2011: 18.62%), even after controlling for age, gender, race, and publication status. Positive views of others have declined across the same time period. We discuss possible implications and explanations for these changes.
Zero moment point-measurements from a human walker wearing robot feet as shoes
(2004)

The anthropomorphic biped robot Bip is equipped with sensors for measuring the ground/feet forces in order to localize the center of pressure (CoP) and zero moment point (ZMP). This paper focuses on experimental results regarding the evolution of the ground contact forces, obtained from a human walker wearing the robot feet as shoes. First, one determines the influence of heavy and rigid metallic shoes on the gait of the subject, during experiments carried out on flat ground. Second, the evolution of the contact forces is studied while walking on parallel planes with different elevations (stairs), then one addresses the case where the feet are supported by two nonparallel planes (uneven terrain). The corresponding analysis is founded on the concepts of virtual supporting surface and pseudo-CoP-ZMP introduced in a companion paper, discussing the theoretical aspects of CoP and ZMP (Sardain and Bessonnet, 2004). Beyond the academic contribution, the data analyzed in this paper could constitute an incitement to design truly anthropomorphic feet, for Bip as well as for other biped robots, because all the current robot feet are functionally rather poor.
Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms
(1996)

Find the secret to improve the quality of life by reading this evolutionary algorithms in theory and practice evolution strategies evolutionary programming genetic algorithms. This is a kind of book that you need now. Besides, it can be your favorite book to read after having this book. Do you ask why? Well, this is a book that has different characteristic with others. You may not need to know who the author is, how well-known the work is. As wise word, never judge the words from who speaks, but make the words as your good value to your life.
Quality Metrics in optical modulation analysis: EVM and its relation to Q-factor, OSNR, and BER
(2012)

The quality of optical signals is a very important parameter in optical communications. Several metrics are in common use, like optical signal-to-noise power ratio (OSNR), Q-factor, error vector magnitude (EVM) and bit error ratio (BER). A measured raw BER is not necessarily useful to predict the final BER after soft-decision forward error correction (FEC), if the statistics of the noise leading to errors is unknown. In this respect the EVM is superior, as it allows an estimation of the error statistics. We compare various metrics analytically, by simulation, and through experiments. We employ six quadrature amplitude modulation (QAM) formats at symbol rates of 20 GBd and 25 GBd. The signals were generated by a software-defined transmitter. We conclude that for optical channels with additive Gaussian noise the EVM metric is a reliable quality measure. For nondata-aided QAM reception, BER in the range 10-6...10-2 can be reliably estimated from measured EVM.
Deep Marching Cubes: Learning Explicit Surface Representations
(2018)

Existing learning based solutions to 3D surface prediction cannot be trained end-to-end as they operate on intermediate representations (e.g., TSDF) from which 3D surface meshes must be extracted in a post-processing step (e.g., via the marching cubes algorithm). In this paper, we investigate the problem of end-to-end 3D surface prediction. We first demonstrate that the marching cubes algorithm is not differentiable and propose an alternative differentiable formulation which we insert as a final layer into a 3D convolutional neural network. We further propose a set of loss functions which allow for training our model with sparse point supervision. Our experiments demonstrate that the model allows for predicting sub-voxel accurate 3D shapes of arbitrary topology. Additionally, it learns to complete shapes and to separate an object's inside from its outside even in the presence of sparse and incomplete ground truth. We investigate the benefits of our approach on the task of inferring shapes from 3D point clouds. Our model is flexible and can be combined with a variety of shape encoder and shape inference techniques.
Causal Generative Domain Adaptation Networks
(2018)

An essential problem in domain adaptation is to understand and make use of distribution changes across domains. For this purpose, we first propose a flexible Generative Domain Adaptation Network (G-DAN) with specific latent variables to capture changes in the generating process of features across domains. By explicitly modeling the changes, one can even generate data in new domains using the generating process with new values for the latent variables in G-DAN. In practice, the process to generate all features together may involve high-dimensional latent variables, requiring dealing with distributions in high dimensions and making it difficult to learn domain changes from few source domains. Interestingly, by further making use of the causal representation of joint distributions, we then decompose the joint distribution into separate modules, each of which involves different low-dimensional latent variables and can be learned separately, leading to a Causal G-DAN (CG-DAN). This improves both statistical and computational efficiency of the learning procedure. Finally, by matching the feature distribution in the target domain, we can recover the target-domain joint distribution and derive the learning machine for the target domain. We demonstrate the efficacy of both G-DAN and CG-DAN in domain generation and cross-domain prediction on both synthetic and real data experiments.
Migrating code with statistical machine translation
(2014)

In the era of mobile computing, developers often need to migrate code written for one platform in a programming language to another language for a different platform, e.g., from Java for Android to C# for Windows Phone. The migration process is often performed manually or semi-automatically, in which developers are required to manually define translation rules and API mappings. This paper presents semSMT, an automatic tool to migrate code written in Java to C#. semSMT utilizes statistical machine translation to automatically infer translation rules from existing migrated code, thus, requires no manual defining of rules. The video demonstration on semSMT can be found on YouTube at http://www.youtube.com/watch?v=aRSnl5-7vNo.
A Faster and More Realistic Flush+Reload Attack on AES
(2015)

Cloud’s unrivaled cost effectiveness and on the fly operation versatility is attractive to enterprise and personal users. However, the cloud inherits a dangerous behavior from virtualization systems that poses a serious security risk: resource sharing. This work exploits a shared resource optimization technique called memory deduplication to mount a powerful known-ciphertext only cache side-channel attack on a popular OpenSSL implementation of AES. In contrast to the other cross-VM cache attacks, our attack does not require synchronization with the target server and is fully asynchronous, working in a more realistic scenario with much weaker assumption. Also, our attack succeeds in just 15 seconds working across cores in the cross-VM setting. Our results show that there is strong information leakage through cache in virtualized systems and the memory deduplication should be approached with caution.
Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics
(2011)

Most instruments formalisms, concepts, and metrics for social networks analysis fail to capture their dynamics. Typical systems exhibit different scales of dynamics, ranging from the fine-grain dynamics of interactions (which recently led researchers to consider temporal versions of distance, connectivity, and related indicators), to the evolution of network properties over longer periods of time. This paper proposes a general approach to study that evolution for both atemporal and temporal indicators, based respectively on sequences of static graphs and sequences of time-varying graphs that cover successive time-windows. All the concepts and indicators, some of which are new, are expressed using a time-varying graph formalism recently proposed in [10].
Speech Synthesis for Mixed-Language Navigation Instructions
(2017)

Text-to-Speech (TTS) systems that can read navigation instructions are one of the most widely used speech interfaces today. Text in the navigation domain may contain named entities such as location names that are not in the language that the TTS database is recorded in. Moreover, named entities can be compound words where individual lexical items belong to different languages. These named entities may be transliterated into the script that the TTS system is trained on. This may result in incorrect pronunciation rules being used for such words. We describe experiments to extend our previous work in generating code-mixed speech to synthesize navigation instructions, with a mixed-lingual TTS system. We conduct subjective listening tests with two sets of users, one being students who are native speakers of an Indian language and very proficient in English, and the other being drivers with low English literacy, but familiarity with location names. We find that in both sets of users, there is a significant preference for our proposed system over a baseline system that synthesizes instructions in English.
Deep-learning: A potential method for tuberculosis detection using chest radiography
(2017)

Tuberculosis (TB) is a major health threat in the developing countries. Many patients die every year due to lack of treatment and error in diagnosis. Developing a computer-aided diagnosis (CAD) system for TB detection can help in early diagnosis and containing the disease. Most of the current CAD systems use handcrafted features, however, lately there is a shift towards deep-learning-based automatic feature extractors. In this paper, we present a potential method for tuberculosis detection using deep-learning which classifies CXR images into two categories, that is, normal and abnormal. We have used CNN architecture with 7 convolutional layers and 3 fully connected layers. The performance of three different optimizers has been compared. Out of these, Adam optimizer with an overall accuracy of 94.73% and validation accuracy of 82.09% performed best amongst them. All the results are obtained using Montgomery and Shenzhen datasets which are available in public domain.
MARKETING AND THE INTERNET : A RESEARCH REVIEW
(2002)

This paper reviews the research to-date on how the Internet is impacting marketing. It focuses mainly on academic research published in US journals, but includes selected material from other sources. It covers internet adoption and usage; online purchasing behavior; internet advertising; internet economics and pricing; channels and intermediaries and online marketing strategy. The final section gives overall conclusions and briefly lists some opportunities for future research. Contrary to earlier hype, the Internet does not change the fundamental principles of marketing. Nor has its impact to-date – e.g. on consumer behavior, advertising, pricing, channels, intermediaries, strategy and globalization – been anything like as dramatic as predicted. Nevertheless, it has already had some effect on all of these areas. For instance, it is emerging as a flexible, fast-growing advertising medium and as a significant direct channel in many markets (PCs, books, music, travel, and even cars). It has led to some reduction in average prices and in price dispersion. It is bringing into the mainstream previously exotic business models such as auctions, electronic markets, and brand communities. Most of its successes have come from established businesses with ‘bricks and clicks’ strategies which use the Internet to supplement existing activities but rarely to generate much direct revenue We expect its impact to increase steadily over the next ten years, as the technology improves, its availability and usage continue to grow, and businesses learn better how to use it within their wider marketing strategy. Earlier expectations about the Internet were so overblown that the reality was bound to disappoint. But by any normal standards, it is a fast-growing young medium with wide-ranging effects across the whole marketing spectrum.
Social-Aware Movie Recommendation via Multimodal Network Learning
(2018)

With the rapid development of Internet movie industry social-aware movie recommendation systems (SMRs) have become a popular online web service that provide relevant movie recommendations to users. In this effort many existing movie recommendation approaches learn a user ranking model from user feedback with respect to the movie's content. Unfortunately this approach suffers from the sparsity problem inherent in SMR data. In the present work we address the sparsity problem by learning a multimodal network representation for ranking movie recommendations. We develop a heterogeneous SMR network for movie recommendation that exploits the textual description and movie-poster image of each movie as well as user ratings and social relationships. With this multimodal data we then present a heterogeneous information network learning framework called SMR-multimodal network representation learning (MNRL) for movie recommendation. To learn a ranking metric from the heterogeneous information network we also developed a multimodal neural network model. We evaluated this model on a large-scale dataset from a real world SMR Web site and we find that SMR-MNRL achieves better performance than other state-of-the-art solutions to the problem.
A hyper-heuristic evolutionary algorithm for automatically designing decision-tree algorithms
(2012)

Decision tree induction is one of the most employed methods to extract knowledge from data, since the representation of knowledge is very intuitive and easily understandable by humans. The most successful strategy for inducing decision trees, the greedy top-down approach, has been continuously improved by researchers over the years. This work, following recent breakthroughs in the automatic design of machine learning algorithms, proposes a hyper-heuristic evolutionary algorithm for automatically generating decision-tree induction algorithms, named HEAD-DT. We perform extensive experiments in 20 public data sets to assess the performance of HEAD-DT, and we compare it to traditional decision-tree algorithms such as C4.5 and CART. Results show that HEAD-DT can generate algorithms that significantly outperform C4.5 and CART regarding predictive accuracy and F-Measure.
On the tradeoff between privacy and utility in data publishing
(2009)

In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility of the data. It is important to consider the tradeoff between privacy and utility. In a paper that appeared in KDD 2008, Brickell and Shmatikov proposed an evaluation methodology by comparing privacy gain with utility gain resulted from anonymizing the data, and concluded that "even modest privacy gains require almost complete destruction of the data-mining utility". This conclusion seems to undermine existing work on data anonymization. In this paper, we analyze the fundamental characteristics of privacy and utility, and show that it is inappropriate to directly compare privacy with utility. We then observe that the privacy-utility tradeoff in data publishing is similar to the risk-return tradeoff in financial investment, and propose an integrated framework for considering privacy-utility tradeoff, borrowing concepts from the Modern Portfolio Theory for financial investment. Finally, we evaluate our methodology on the Adult dataset from the UCI machine learning repository. Our results clarify several common misconceptions about data utility and provide data publishers useful guidelines on choosing the right tradeoff between privacy and utility.
Wideband Tapered-Slot Antenna with Corrugated Edges for GPR Applications
(2003)

A novel Wideband tapered-slot antenna for GPR applications is proposed. A conventional approach to reduce unwanted interactions between the antenna and the ground surface requires extensive microwave absorbers treatment. For the same purpose we propose to use corrugations along the antenna edges. The corrugations improve directivity and wideband matching of the antenna with free space retaining also good radiation efficiency. Further improvement of the antenna performance has been achieved by patching the corrugated areas of the antenna with the resistance card strips. The elimination of the foam-type absorbers makes the antenna more robust and easier in fabrication.
Relational Learning of Pattern-Match Rules for Information Extraction
(1997)

Information extraction is a form of shallow text processing which locates a specified set of relevant items in natural language documents. Such systems can be useful, but require domain-specific knowledge and rules, and are time-consuming and difficult to build by hand, making infomation extraction a good testbed for the application of machine learning techniques to natural language processing. This paper presents a system, RAPIER, that takes pairs of documents and filled templates and induces pattern-match rules that directly extract fillers for the slots in the template. The learning algorithm incorporates techniques from several inductive logic programming systems and learns unbounded patterns that include constraints on the words and part-of-speech tags surrounding the filler. Encouraging results are presented on learning to extract information from computer job postings from the newsgroup misc. jobs. offered.