SoroushVahidi/scidocs huggingface dataset:
A four-electrode low frequency impedance spectroscopy measurement system using the AD5933 measurement chip.
(2013)

This paper presents the design of a four electrode impedance measurement circuit dedicated to bioimpedance embedded applications. It extends the use of the AD5933 measurement chip to allow it to operate in a four electrode configuration in order to limit the effects of the parasitic impedances between the medium under test and the electrodes. The circuit has shown a good measurement accuracy on various test circuits. In association with a four microband electrode system it has been successfully used to characterize small physiological samples (50 μl) with conductivities ranging from 0.14 to 1.2 S m(-1). It can be used as an alternative bioimpedance measurement approach for embedded applications operating in the four electrode configuration.
Highlighting interventions and user differences: informing adaptive information visualization support
(2014)

There is increasing evidence that the effectiveness of information visualization techniques can be impacted by the particular needs and abilities of each user. This suggests that it is important to investigate information visualization systems that can dynamically adapt to each user. In this paper, we address the question of how to adapt. In particular, we present a study to evaluate a variety of visual prompts, called "interventions", that can be performed on a visualization to help users process it. Our results show that some of the tested interventions perform better than a condition in which no intervention is provided, both in terms of task performance as well as subjective user ratings. We also discuss findings on how intervention effectiveness is influenced by individual differences and task complexity.
A RFID case-based logistics resource management system for managing order-picking operations in warehouses
(2009)

In the supply chain, a warehouse is an essential component for linking the chain partners. It is necessary to allocate warehouse resources efficiently and effectively to enhance the productivity and reduce the operation costs of the warehouse. Therefore, warehouse management systems (WMSs) have been developed for handling warehouse resources and monitoring warehouse operations. However, it is difficult to update daily operations of inventory level, locations of forklifts and stock keeping units (SKUs) in realtime by using the bar-code-based or manual-based warehouse management systems. In this paper, RFID technology is adopted to facilitate the collection and sharing of data in a warehouse. Tests are performed for evaluating the reading performance of both the active and passive RFID apparatus. With the help of the testing results, the efficient radio frequency cover ranges of the readers are examined for formulating a radio frequency identification case-based logistics resource management system (R-LRMS). The capabilities of R-LRMS are demonstrated in GSL Limited. Three objectives are achieved: (i) a simplification of RFID adoption procedure, (ii) an improvement in the visibility of warehouse operations and (iii) an enhancement of the productivity of the warehouse. The successful case example proved the feasibility of R-LRMS in real working practice. 2008 Elsevier Ltd. All rights reserved.
Deep Representation Learning with Target Coding
(2015)

We consider the problem of learning deep representation when target labels are available. In this paper, we show that there exists intrinsic relationship between target coding and feature representation learning in deep networks. Specifically, we found that distributed binary code with error correcting capability is more capable of encouraging discriminative features, in comparison to the 1-of-K coding that is typically used in supervised deep learning. This new finding reveals additional benefit of using error-correcting code for deep model learning, apart from its well-known error correcting property. Extensive experiments are conducted on popular visual benchmark datasets.
A Framework for Smart Servicescape : A Case of Smart Home Service Experience
(2018)

The rapid development of IoT technology has accelerated the growth of smart services. Despite the proliferation of smart services, academic research is still in its early stage particularly in terms of service experience and service design. Concerning a service experience viewpoint, it is essential to consider the context and environment of smart services, namely “smart servicescape,” as this can influence users’ entire experience. Moreover, the smart servicescape will have different characteristics due to the convergence of online and offline connected environments. With this background, this study aimed to propose a framework for the smart servicescape by identifying new dimensions that reflect the characteristics of smart services. Accordingly, an initial analytic framework of service experience blueprint was established on the basis of the conventional servicescape and service blueprinting. Twenty movie clips on smart home services officially produced by ICT corporations were collected, were analyzed through grounded theory, and were classified according to the analytic framework. Through a series of qualitative analysis, the framework structure was improved to make it more suitable for the smart servicescape. Finally, this study proposed a framework for the smart servicescape derived from the smart home service experience blueprint. The values of this framework can be identified in two aspects: (1) by identifying new dimensions to reflect the characteristics of smart services such as Smart device, Datascape, and Connected scape; and (2) by suggesting the structure of the service experience blueprint infused with the perspective of service experience, which consists of service encounters and the servicescape.
Decision-Theoretic User Interface Generation
(2008)

For decades, researchers have debated the pros and cons of adaptive user interfaces with enthusiastic AI practitioners often confronting skeptical HCI experts (Shneiderman & Maes, 1997). This paper summarizes the SUPPLE project’s six years of work analyzing the characteristics of successful adaptive interfaces and developing efficient algorithms for their automatic generation (Gajos & Weld, 2004; Gajos et al., 2005; Gajos & Weld, 2005; Gajos et al., 2006; Gajos, Wobbrock, & Weld, 2007; Gajos et al., 2008; Gajos, Wobbrock, & Weld, 2008). We conclude that personalized user interfaces, which are adapted to a person’s devices, tasks, preferences and abilities, can improve user satisfaction and performance. Further, we demonstrate that automatic generation of these interfaces is computationally feasible. We developed two systems which autonomously construct a broad range of personalized adaptive interfaces: 1) SUPPLE/ARNAULD uses decision-theoretic optimization to automatically generate user interfaces adapted to target device, usage patterns, and a learned model of user preferences, and 2) SUPPLE++ first performs a one-time assessment of a person’s motor abilities and then automatically generates user interfaces adapted to that user’s abilities. Our experiments show that these automatically generated interfaces significantly improve speed, accuracy and satisfaction of users with motor impairments compared to manufacturers’ defaults. We also provide the first characterization of the design space of adaptive interfaces and demonstrate how such interfaces can significantly improve the quality and efficiency of daily interactions for typical users.
Efficient High-Quality Volume Rendering of SPH Data
(2010)

High quality volume rendering of SPH data requires a complex order-dependent resampling of particle quantities along the view rays. In this paper we present an efficient approach to perform this task using a novel view-space discretization of the simulation domain. Our method draws upon recent work on GPU-based particle voxelization for the efficient resampling of particles into uniform grids. We propose a new technique that leverages a perspective grid to adaptively discretize the view-volume, giving rise to a continuous level-of-detail sampling structure and reducing memory requirements compared to a uniform grid. In combination with a level-of-detail representation of the particle set, the perspective grid allows effectively reducing the amount of primitives to be processed at run-time. We demonstrate the quality and performance of our method for the rendering of fluid and gas dynamics SPH simulations consisting of many millions of particles.
A survey of event detection techniques in online social networks
(2016)

The online social networks (OSNs) have become an important platform for detecting real-world event in recent years. These real-world events are detected by analyzing huge social-stream data available on different OSN platforms. Event detection has become significant because it contains substantial information which describes different scenarios during events or crisis. This information further helps to enable contextual decision making, regarding the event location, content and the temporal specifications. Several studies exist, which offers plethora of frameworks and tools for detecting and analyzing events used for applications like crisis management, monitoring and predicting events in different OSN platforms. In this paper, a survey is done for event detection techniques in OSN based on social text streams—newswire, web forums, emails, blogs and microblogs, for natural disasters, trending or emerging topics and public opinion-based events. The work done and the open problems are explicitly mentioned for each social stream. Further, this paper elucidates the list of event detection tools available for the researchers.
Bag of Tricks for Efficient Text Classification
(2017)

This paper explores a simple and efficient baseline for text classification. Our experiments show that our fast text classifier fastText is often on par with deep learning classifiers in terms of accuracy, and many orders of magnitude faster for training and evaluation. We can train fastText on more than one billion words in less than ten minutes using a standard multicore CPU, and classify half a million sentences among 312K classes in less than a minute.
A Matrix Decomposition based Webshell Detection Method
(2017)

WebShell is a web based network backdoor. With the help of WebShells, the hacker can take any control of the web services illegally. The current method of detecting WebShells is just matching the eigenvalues or detecting the produced flow or services, which is hard to find new kinds of WebShells. To solve these problems, this paper analyzes the different features of a page and proposes a novel matrix decomposition based WebShell detection algorithm. The algorithm is a supervised machine learning algorithm. By analyzing and learning features of known existing and non-existing WebShell pages, the algorithm can make predictions on the unknown pages. The experimental results show that, compared with traditional detection methods, this algorithm spends less time, has higher accuracy and recall rate, and can detect new kinds of WebShells with a certain probability, overcoming the shortcomings of the traditional feature matching based method, improving the accuracy and recalling rate of WebShell detection.
Webshell detection techniques in web applications
(2014)

With widely adoption of online services, malicious web sites have become a malignant tumor of the Internet. Through system vulnerabilities, attackers can upload malicious files (which are also called webshells) to web server to create a backdoor for hackers' further attacks. Therefore, finding and detecting webshell inside web application source code are crucial to secure websites. In this paper, we propose a novel method based on the optimal threshold values to identify files that contain malicious codes from web applications. Our detection system will scan and look for malicious codes inside each file of the web application, and automatically give a list of suspicious files and a detail log analysis table of each suspicious file for administrators to check further. The Experimental results show that our approach is applicable to identify webshell more efficient than some other approaches.
Countering kernel rootkits with lightweight hook protection
(2009)

Kernel rootkits have posed serious security threats due to their stealthy manner. To hide their presence and activities, many rootkits hijack control flows by modifying control data or hooks in the kernel space. A critical step towards eliminating rootkits is to protect such hooks from being hijacked. However, it remains a challenge because there exist a large number of widely-scattered kernel hooks and many of them could be dynamically allocated from kernel heap and co-located together with other kernel data. In addition, there is a lack of flexible commodity hardware support, leading to the socalled protection granularity gap -- kernel hook protection requires byte-level granularity but commodity hardware only provides page level protection.
 To address the above challenges, in this paper, we present HookSafe, a hypervisor-based lightweight system that can protect thousands of kernel hooks in a guest OS from being hijacked. One key observation behind our approach is that a kernel hook, once initialized, may be frequently "read"-accessed, but rarely write"-accessed. As such, we can relocate those kernel hooks to a dedicated page-aligned memory space and then regulate accesses to them with hardware-based page-level protection. We have developed a prototype of HookSafe and used it to protect more than 5,900 kernel hooks in a Linux guest. Our experiments with nine real-world rootkits show that HookSafe can effectively defeat their attempts to hijack kernel hooks. We also show that HookSafe achieves such a large-scale protection with a small overhead (e.g., around 6% slowdown in performance benchmarks).
PERFORMANCE ANALYSIS OF CHAOTIC CHIRP SPREAD SPECTRUM SYSTEM IN MULTIPATH ENVIRONMENT
(2010)

Wireless channels often include multipath propagation, in which the signal has more than one path from the transmitter to the receiver. Atmospheric reflection or refraction, as well as reflection from the ground or from objects such as buildings may cause this phenomena. The aim of this research is to study the effects of multipath environment on the performance of a proposed chaotic chirp spread spectrum system (CCSSS). The benchmark performance of the proposed system is investigated in term of bit error rate (BER) under multipath environment. A Quadrature Phase Shift Keying (QPSK) modulation scheme and a matched filter based on adaptive threshold decision were used in this work. To assess the performance of this system, simulations were performed to compare the proposed system with the traditional frequency modulation differential chaotic shift keying (DCSK) spread spectrum system. The proposed system may be considered as a well qualified communication system in multipath environment.
From goals to components: a combined approach to self-management
(2008)

Autonomous or semi-autonomous systems are deployed in environments where contact with programmers or technicians is infrequent or undesirable. To operate reliably, such systems should be able to adapt to new circumstances on their own. This paper describes our combined approach for adaptable software architecture and task synthesis from high-level goals, which is based on a three-layer model. In the uppermost layer, reactive plans are generated from goals expressed in a temporal logic. The middle layer is responsible for plan execution and assembling a configuration of domain-specific software components, which reside in the lowest layer. Moreover, the middle layer is responsible for selecting alternative components when the current configuration is no longer viable for the circumstances that have arisen. The implementation demonstrates that the approach enables us to handle non-determinism in the environment and unexpected failures in software components.
Support Vector Machines and Kernel Methods: The New Generation of Learning Machines
(2002)

algorithms, utilize techniques from optimization, statistics, and functional analysis to achieve maximal generality, flexibility, and performance. These algorithms are different from earlier techniques used in machine learning in many respects: For example, they are explicitly based on a theoretical model of learning rather than on loose analogies with natural learning systems or other heuristics. They come with theoretical guarantees about their performance and have a modular design that makes it possible to separately implement and analyze their components. They are not affected by the problem of local minima because their training amounts to convex optimization. In the last decade, a sizable community of theoreticians and practitioners has formed around these methods, and a number of practical applications have been realized. Although the research is not concluded, already now kernel methods are considered the state of the art in several machine learning tasks. Their ease of use, theoretical appeal, and remarkable performance have made them the system of choice for many learning problems. Successful applications range from text categorization to handwriting recognition to classification of geneexpression data.
A survey on unmanned aerial vehicle collision avoidance systems
(2015)

Collision avoidance is a key factor in enabling the integration of unmanned aerial vehicle into real life use, whether it is in military or civil application. For a long time there have been a large number of works to address this problem; therefore a comparative summary of them would be desirable. This paper presents a survey on the major collision avoidance systems developed in up to date publications. Each collision avoidance system contains two main parts: sensing and detection, and collision avoidance. Based on their characteristics each part is divided into different categories; and those categories are explained, compared and discussed about advantages and disadvantages in this paper.
No-reference perceptual quality assessment of JPEG compressed images
(2002)

Human observers can easily assess the quality of a distorted image without examining the original image as a reference. By contrast, designing objective No-Reference (NR) quality measurement algorithms is a very difficult task. Currently, NR quality assessment is feasible only when prior knowledge about the types of image distortion is available. This research aims to develop NR quality measurement algorithms for JPEG compressed images. First, we established a JPEG image database and subjective experiments were conducted on the database. We show that Peak Signalto-Noise Ratio (PSNR), which requires the reference images, is a poor indicator of subjective quality. Therefore, tuning an NR measurement model towards PSNR is not an appropriate approach in designing NR quality metrics. Furthermore, we propose a computational and memory efficient NR quality assessment model for JPEG images. Subjective test results are used to train the model, which achieves good quality prediction performance. A Matlab implementation of the proposed method is available at http://anchovy.ece.ute xas.edu/ ̃zwang/research/nr jpeg quality/index.html .
“Unexpected Item in the Bagging Area”: Anomaly Detection in X-Ray Security Images
(2019)

The role of anomaly detection in X-ray security imaging, as a supplement to targeted threat detection, is described, and a taxonomy of anomaly types in this domain is presented. Algorithms are described for detecting appearance anomalies of shape, texture, and density, and semantic anomalies of object category presence. The anomalies are detected on the basis of representations extracted from a convolutional neural network pre-trained to identify object categories in photographs, from the final pooling layer for appearance anomalies, and from the logit layer for semantic anomalies. The distribution of representations in normal data is modeled using high-dimensional, full-covariance, Gaussians, and anomalies are scored according to their likelihood relative to those models. The algorithms are tested on X-ray parcel images using stream-of-commerce data as the normal class, and parcels with firearms present the examples of anomalies to be detected. Despite the representations being learned for photographic images and the varied contents of stream-of-commerce parcels, the system, trained on stream-of-commerce images only, is able to detect 90% of firearms as anomalies, while raising false alarms on 18% of stream-of-commerce.
Aiding in the Treatment of Low Back Pain by a Fuzzy Linguistic Web System
(2014)

Low back pain affects a large proportion of the adult population at some point in their lives and has a major economic and social impact. To soften this impact, one possible solution is to make use of recommender systems, which have already been introduced in several health fields. In this paper, we present TPLUFIB-WEB, a novel fuzzy linguistic Web system that uses a recommender system to provide personalized exercises to patients with low back pain problems and to offer recommendations for their prevention. This system may be useful to reduce the economic impact of low back pain, help professionals to assist patients, and inform users on low back pain prevention measures. A strong part of TPLUFIB-WEB is that it satisfies the Web quality standards proposed by the Health On the Net Foundation (HON), Official College of Physicians of Barcelona, and Health Quality Agency of the Andalusian Regional Government, endorsing the health information provided and warranting the trust of users.
Revisiting Batch Normalization For Practical Domain Adaptation
(2017)

Deep neural networks (DNN) have shown unprecedented success in various computer vision applications such as image classification and object detection. However, it is still a common annoyance during the training phase, that one has to prepare at least thousands of labeled images to fine-tune a network to a specific domain. Recent study (Tommasi et al. 2015) shows that a DNN has strong dependency towards the training dataset, and the learned features cannot be easily transferred to a different but relevant task without finetuning. In this paper, we propose a simple yet powerful remedy, called Adaptive Batch Normalization (AdaBN) to increase the generalization ability of a DNN. By modulating the statistics in all Batch Normalization layers across the network, our approach achieves deep adaptation effect for domain adaptation tasks. In contrary to other deep learning domain adaptation methods, our method does not require additional components, and is parameter-free. It archives stateof-the-art performance despite its surprising simplicity. Furthermore, we demonstrate that our method is complementary with other existing methods. Combining AdaBN with existing domain adaptation treatments may further improve model performance.
Diffusion of innovations in service organizations: systematic review and recommendations.
(2004)

This article summarizes an extensive literature review addressing the question, How can we spread and sustain innovations in health service delivery and organization? It considers both content (defining and measuring the diffusion of innovation in organizations) and process (reviewing the literature in a systematic and reproducible way). This article discusses (1) a parsimonious and evidence-based model for considering the diffusion of innovations in health service organizations, (2) clear knowledge gaps where further research should be focused, and (3) a robust and transferable methodology for systematically reviewing health service policy and management. Both the model and the method should be tested more widely in a range of contexts.