query: A survey about user requirements for biometric authentication on smartphones

positive: Handbook of Fingerprint Recognition label(s) Label Class c) b) a) 7.3 Integration Strategies 241 Combination strategy A combination strategy (also called combination scheme) is a technique used to combine the output of the individual classifiers. The most popular combination strategies at the abstract level are based on majority vote rules, which simply assign an input pattern to the most voted class (see Section 7.2). When two classifiers are combined, either a logical AND or a logical OR operator is typically used. When more than two classifiers are integrated, the AND/OR rules can be combined. For example, a biometric system may work on “fingerprint OR (face AND hand geometry)”; that is, it requires a user to present either a fingerprint or both face and hand geometry for recognition. Class set reduction, logistic regression, and Borda counts are the most commonly used approaches in combining classifiers based on the rank labels (Ho, Hull, and Srihari, 1994). In class set reduction, a subset of the classes is selected with the aim that the subset be as small as possible and still contain the true class. Multiple subsets from multiple modalities are typically combined using either a union or an intersection of the subsets. The logistic regression and Borda count methods are collectively called the class set reordering methods. The objective here is to derive a consensus ranking of the given classes such that the true class is ranked at the top. Rank labels are very useful for integration in an indexing/retrieval system. A biometric retrieval system typically outputs an ordered list of candidates (most likely matches). The top element of this ordered list is the most likely to be a correct match and the bottom of the list is the least likely match. The most popular combination schemes for combining confidence values from multiple modalities are sum, mean, median, product, minimum, and maximum rules. Kittler et al. (1998) have developed a theoretical framework in an attempt to understand the underlying mathematical basis of these popular schemes. Their experiments demonstrated that the sum or mean scheme typically performs very well in practice. A problem in using the sum rule is that the confidences (or scores) from different modalities should be normalized. This normalization typically involves mapping the confidence measures from different modalities into a common domain. For example, a biometric system may output a distance score (the lower the score, the more similar the patterns) whereas another may output a similarity score (the higher the score, the more similar the patterns) and thus the scores cannot be directly combined using the sum rule. In its simplest form, this normalization may only include inverting the sign of distance scores such that a higher score corresponds to a higher similarity. In a more complex form, the normalization may be non-linear which can be learned from training data by estimating distributions of confidence values from each modality. The scores are then translated and scaled to have zero mean, unit variance, and then remapped to a fixed interval of (0,1) using a hyperbolic tangent function. Note that it is tempting to parameterize the estimated distributions for normalization. However, such parameterization of distributions should be used with care, because the error rates of biometric systems are typically very small and a small error in estimating the tails of the distributions may result in a significant change in the error estimates (see Figure 7.3). Another common practice is to compute different scaling factors (weights) for each modality from training data, such that the accuracy of the combined classifier is maxi7 Multimodal Biometric Systems 242 mized. This weighted sum rule is expected to work better than the simple sum rule when the component classifiers have different strengths (i.e., different error rates). Figure 7.3. a) Genuine and impostor distributions for a fingerprint verification system (Jain et al., 2000) and a Normal approximation for the impostor distribution. Visually, the Normal approximation seems to be good, but causes significant decrease in performance compared to the non-parametric estimate as shown in the ROCs in b), where FMR is referred to as FAR (False Acceptance Rate) and (1-FNMR) as Genuine Acceptance Rate. ©Elsevier. Some schemes to combine multiple modalities in biometric systems have also been studied from a theoretical point of view. Through a theoretical analysis, Daugman (1999b) showed that if a strong biometric and a weak biometric are combined with an abstract level combination using either the AND or the OR voting rules, the performance of the combination will be worse than the better of the two individual biometrics. Hong, Jain, and Pankanti’s (1999) theoretical analysis that AND/OR voting strategies can improve performance only when certain conditions are satisfied confirmed Daugman’s findings. Their analysis further showed that a confidence level fusion is expected to significantly improve overall performance even in the case of combining a weak and a strong biometric. Kittler et al. (1998) introduced a sensitivity analysis to explain why the sum (or average) rule outperforms the other rules. They showed that the sum rule is less sensitive than the other similar rules (such as the “product” rule) to the error rates of individual classifiers in estimating posterior probabilities (confidence values). They claim that the sum rule is the most appropriate for combining different estimates of the same posterior probabilities (e.g., resulting from different classifier initializations). Prabhakar and Jain (2002) compared the sum and the product rules with the Neyman−Pearson combination scheme and showed that the product rule is worse than the sum rule when combining correlated features and both the sum rule and the product rules are inferior to the Neyman− Pearson combination scheme when combining weak and strong classifiers. 0 20 40 60 80 100 0 1 2 3 4 5 6 7 Normalized Matching Score Pe rc en ta ge ( % ) Imposter Genuine Nonparametric Imposter Distribution Normal Imposter Distribution Genuine Distribution 0 1 2 3 4 5 50 55 60 65 70 75 80 85 90 95 100 False Acceptance Rate (%) G en ui ne A cc ep ta nc e R at e (% ) Using Nonparametric Imposter Distribution Using Normal Imposter Distribution

positive: Unobtrusive User-Authentication on Mobile Phones Using Biometric Gait Recognition The need for more security on mobile devices is increasing with new functionalities and features made available. To improve the device security we propose gait recognition as a protection mechanism. Unlike previous work on gait recognition, which was based on the use of video sources, floor sensors or dedicated high-grade accelerometers, this paper reports the performance when the data is collected with a commercially available mobile device containing low-grade accelerometers. To be more specific, the used mobile device is the Google G1 phone containing the AK8976A embedded accelerometer sensor. The mobile device was placed at the hip on each volunteer to collect gait data. Preproccesing, cycle detection and recognition-analysis were applied to the acceleration signal. The performance of the system was evaluated having 51 volunteers and resulted in an equal error rate (EER) of 20%.

positive: Estimation of Planar Curves, Surfaces, and Nonplanar Space Curves Defined by Implicit Equations with Applications to Edge and Range Image Segmentation This paper addresses the problem of parametric representation and estimation of complex planar curves in 2-D, surfaces in 3-D and nonplanar space curves in 3-D. Curves and surfaces can be defined either parametrically or implicitly, and we use the latter representation. A planar curve is the set of zeros of a smooth function of two variables X-Y, a surface is the set of zeros of a smooth function of three variables X-~-Z, and a space curve is the intersection of two surfaces, which are the set of zeros of two linearly independent smooth functions of three variables X-!/-Z. For example, the surface of a complex object in 3D can be represented as a subset of a single implicit surface, with similar results for planar and space curves. We show how this unified representation can be used for object recognition, object position estimation, and segmentation of objects into meaningful subobjects, that is, the detection of “interest regions” that are more complex than high curvature regions and, hence, more useful as features for object recognition. Fitting implicit curves and surfaces to data would be ideally based on minimizing the mean square distance from the data points to the curve or surface. Since the distance from a point to a curve or surface cannot be computed exactly by direct methods, the approximate distance, which is a first-order approximation of the real distance, is introduced, generalizing and unifying previous results. We fit implicit curves and surfaces to data minimizing the approximate mean square distance, which is a nonlinear least squares problem. We show that in certain cases, this problem reduces to the generalized eigenvector fit, which is the minimization of the sum of squares of the values of the functions that define the curves or surfaces under a quadratic constraint function of the data. This fit is computationally reasonable to compute, is readily parallelizable, and, hence, is easily computed in real time. In general, the generalized eigenvector lb provides a very good initial estimate for the iterative minimization of the approximate mean square distance. Although we are primarily interested in the 2-D and 3-D cases, the methods developed herein are dimension independent. We show that in the case of algebraic curves and surfaces, i.e., those defined by sets of zeros of polynomials, the minimizers of the approximate mean square distance and the generalized eigenvector fit are invariant with respect to similarity transformations. Thus, the generalized eigenvector lit is independent of the choice of coordinate system, which is a very desirable property for object recognition, position estimation, and the stereo matching problem. Finally, as applications of the previous techniques, we illustrate the concept of “interest regions” Manuscript received April 13, 1988; revised April 30, 1991. This work was supported by an IBM Fellowship and NSF Grant IRI-8715774. The author was with the Laboratory for Engineering Man/Machine Systems, Department of Engineering, Brown University, Providence, RI 02912. He is now with the Exploratory Computer Vision Group, IBM T. J. Watson Research Center, Yorktown Heights, NY 10598. IEEE Log Number 9102093. for object recognition and describe a variable-order segmentation algorithm that applies to the three cases of interest.

positive: What Is Coefficient Alpha ? An Examination of Theory and Applications Psychological research involving scale construction has been hindered considerably by a widespread lack of understanding of coefficient alpha and reliability theory in general. A discussion of the assumptions and meaning of coefficient alpha is presented. This discussion is followed by a demonstration of the effects of test length and dimensionality on alpha by calculating the statistic for hypothetical tests with varying numbers of items, numbers of orthogonal dimensions, and average item intercorrelations. Recommendations for the proper use of coefficient alpha are offered.

positive: Biometric authentication on a mobile device: a study of user effort, error and task disruption We examine three biometric authentication modalities -- voice, face and gesture -- as well as password entry, on a mobile device, to explore the relative demands on user time, effort, error and task disruption. Our laboratory study provided observations of user actions, strategies, and reactions to the authentication methods. Face and voice biometrics conditions were faster than password entry. Speaking a PIN was the fastest for biometric sample entry, but short-term memory recall was better in the face verification condition. None of the authentication conditions were considered very usable. In conditions that combined two biometric entry methods, the time to acquire the biometric samples was shorter than if acquired separately but they were very unpopular and had high memory task error rates. These quantitative results demonstrate cognitive and motor differences between biometric authentication modalities, and inform policy decisions in selecting authentication methods.

negative: Is Smart Beta Really Smart ? BURTON G. MALKIEL is the Chemical Bank Chairman’s Professor Emeritus of Economics at Princeton University in Princeton, NJ. bmalkiel@princeton.edu There is a popular new investment strategy in portfolio management called smart beta. With a catchy title and a promise of improved portfolio performance, the strategy has already attracted hundreds of billions of dollars and is growing by leaps and bounds. Unfortunately, smart beta portfolios do not consistently outperform and when they do produce appealing results, they f lunk the risk test.

negative: Exploring the Regularity of Sparse Structure in Convolutional Neural Networks Sparsity helps reduce the computational complexity of deep neural networks by skipping zeros. Taking advantage of sparsity is listed as a high priority in next generation DNN accelerators such as TPU[1]. The structure of sparsity, i.e., the granularity of pruning, affects the efficiency of hardware accelerator design as well as the prediction accuracy. Coarse-grained pruning creates regular sparsity patterns, making it more amenable for hardware acceleration but more challenging to maintain the same accuracy. In this paper we quantitatively measure the trade-off between sparsity regularity and prediction accuracy, providing insights in how to maintain accuracy while having more a more structured sparsity pattern. Our experimental results show that coarse-grained pruning can achieve a sparsity ratio similar to unstructured pruning without loss of accuracy. Moreover, due to the index saving effect, coarse-grained pruning is able to obtain a better compression ratio than fine-grained sparsity at the same accuracy threshold. Based on the recent sparse convolutional neural network accelerator (SCNN), our experiments further demonstrate that coarse-grained sparsity saves∼ 2× the memory references compared to fine-grained sparsity. Since memory reference is more than two orders of magnitude more expensive than arithmetic operations, the regularity of sparse structure leads to more efficient hardware design.

negative: Feature hashing for large scale multitask learning Empirical evidence suggests that hashing is an effective strategy for dimensionality reduction and practical nonparametric estimation. In this paper we provide exponential tail bounds for feature hashing and show that the interaction between random subspaces is negligible with high probability. We demonstrate the feasibility of this approach with experimental results for a new use case --- multitask learning with hundreds of thousands of tasks.

negative: Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search We address item relocation problems in graphs in this paper. We assume items placed in vertices of an undirected graph with at most one item per vertex. Items can be moved across edges while various constraints depending on the type of relocation problem must be satisfied. We introduce a general problem formulation that encompasses known types of item relocation problems such as multi-agent path finding (MAPF) and token swapping (TSWAP). In this formulation we express two new types of relocation problems derived from token swapping that we call token rotation (TROT) and token permutation (TPERM). Our solving approach for item relocation combines satisfiability modulo theory (SMT) with conflict-based search (CBS). We interpret CBS in the SMT framework where we start with the basic model and refine the model with a collision resolution constraint whenever a collision between items occurs in the current solution. The key difference between the standard CBS and our SMT-based modification of CBS (SMT-CBS) is that the standard CBS branches the search to resolve the collision while in SMT-CBS we iteratively add a single disjunctive collision resolution constraint. Experimental evaluation on several benchmarks shows that the SMT-CBS algorithm significantly outperforms the standard CBS. We also compared SMT-CBS with a modification of the SAT-based MDD-SAT solver that uses an eager modeling of item relocation in which all potential collisions are eliminated by constrains in advance. Experiments show that lazy approach in SMT-CBS produce fewer constraint than MDD-SAT and also achieves faster solving run-times.

negative: Control of VSC connected to the grid through LCL-filter to achieve balanced currents Grid-connected voltage source converters (VSCs) are the heart of many applications with power quality concerns due to their reactive power controllability. However, the major drawback is their sensitivity to grid disturbances. Moreover, when VSCs are used in DG applications, voltage unbalance may be intolerant. The current protection may trip due to current unbalance or due to overcurrent. In this paper, a vector current controller for VSC connected to the grid through LCL-filter is developed with the main focus on producing symmetrical and balanced currents in case of unbalanced voltage dips. Implementing this controller helps the VSC system not to trip during voltage dips.

negative: Data Mining in Healthcare : Current Applications and Issues By The successful application of data mining in highly visible fields like e-business, marketing and retail have led to the popularity of its use in knowledge discovery in databases (KDD) in other industries and sectors. Among these sectors that are just discovering data mining are the fields of medicine and public health. This research paper provides a survey of current techniques of KDD, using data mining tools for healthcare and public health. It also discusses critical issues and challenges associated with data mining and healthcare in general. The research found a growing number of data mining applications, including analysis of health care centers for better health policy-making, detection of disease outbreaks and preventable hospital deaths, and detection of fraudulent insurance claims.

negative: Using the Kinect for detecting tremors: Challenges and opportunities The Kinect sensor is an attachment for the Xbox gaming console which allows players to interact with games through body movement. This paper explores the possibility of using the Kinect in a clinical setting for detection of Parkinson's, postural, flapping, titubation and voice tremors. All of the physical tremors were simulated and the ability of the Kinect to capture them was evaluated. The Kinect was also used to record voice data from real voice tremors patients. Physical and voice data were gathered from healthy persons for comparison. The results showed that the Kinect could reliably detect voice, postural and Parkinson's tremors. A very consistent graph could be obtained repeatedly for both Parkinson's and postural tremors. For voice tremors there was also a consistent pattern that differentiated a normal voice from one with a tremor. We have therefore proven that the Kinect can consistently record Parkinson's, postural and voice tremors.

negative: Automated Pyramid Scoring of Summaries using Distributional Semantics The pyramid method for content evaluation of automated summarizers produces scores that are shown to correlate well with manual scores used in educational assessment of students’ summaries. This motivates the development of a more accurate automated method to compute pyramid scores. Of three methods tested here, the one that performs best relies on latent semantics.

negative: Large eddy simulations of the HyShot II scramjet The present work is part of a broad effort toward predictive simulations of complex flows at high Reynolds numbers. The main objective of the Stanford PSAAP Center (Pre-dictive Science Academic Alliance Program) is to predict the reacting flow in the HyShot II scramjet experiment carried out in the HEG facility of the German Aerospace Agency DLR (cf. Laurence et al. 2011). Specifically, the objective is to predict the best-estimate of the flow, to estimate the uncertainties from a range of sources in this prediction, and, finally , to quantify the margin to engine unstart. Unstart occurs in supersonic internal flows when the flow becomes choked (e.g., due to excessive friction or heat addition), which initiates an unsteady unstart process that eventually leads to subsonic flow throughout. The unstart process involves a propagation of shock waves upstream in the combustor, the speed of which depends strongly on the amount of heat addition. The experiments by Laurence et al. (2011) indicate propagation velocities of 31 m/s at equivalence ratio (ER) of 0.5, 93 m/s at ER=0.7, and above 200 m/s at ER=1.1. For this problem with fixed mass flux of incoming air, the equivalence ratio is proportional to the fuel mass flux. The length of the HyShot combustor is about 300 mm; thus the unstart process takes about 10 ms at ER=0.5. The experiments were carried out in a shock tube with a test time of about 2.5 ms; thus the unstart process is significantly longer than the test time near the unstart boundary. For this reason, it is clear that shock tube experiments can not give a precise unstart bound. An alternative approach is to use a validated large eddy simulation (LES) method to explore and determine the unstart bound. This is the approach taken here, and the motivation of the work described in this brief. The complexity of the flow (turbulence, shocks, mixing, combustion) implies that a careful multi-stage validation plan is needed. Moreover, the available quantitative experimental data for the HyShot case is limited to measurements of pressure (mean and rms) and heat transfer (although these are highly uncertain) along two lines in the combustor. Therefore, validation on the HyShot problem alone is not sufficient. The first step in the validation is to compute a supersonic flat plate boundary layer as a basic check on the LES method and, specifically, the modeling of the friction and heat transfer at …

negative: Context-free Attacks Using Keyboard Acoustic Emanations The emanations of electronic and mechanical devices have raised serious privacy concerns. It proves possible for an attacker to recover the keystrokes by acoustic signal emanations. Most existing malicious applications adopt context-based approaches, which assume that the typed texts are potentially correlated. Those approaches often incur a high cost during the context learning stage, and can be limited by randomly typed contents (e.g., passwords). Also, context correlations can increase the risk of successive false recognition. We present a context-free and geometry-based approach to recover keystrokes. Using off-the-shelf smartphones to record acoustic emanations from keystrokes, this design estimates keystrokes' physical positions based on the Time Difference of Arrival (TDoA) method. We conduct extensive experiments and the results show that more than 72.2\% of keystrokes can be successfully recovered.

negative: Learning Semantically Coherent and Reusable Kernels in Convolution Neural Nets for Sentence Classification The purpose of this work is to empirically study desirable properties such as semantic coherence, attention mechanism and kernel reusability in Convolution Neural Networks (CNNs) for learning sentence classification tasks. We propose to learn semantically coherent kernels using clustering scheme combined with Word2Vec representation and domain knowledge such as SentiWordNet. We also suggest a technique to visualize attention mechanism of CNNs. These ideas are useful for decision explanation purpose. Reusable property enables kernels learned on one problem to be used in another problem. This helps in efficient learning as only a few additional domain specific kernels may have to be learned. Experimental results demonstrate the usefulness of our approach. The performance of the proposed approach, which uses semantic and re-usability properties, is close to that of the state-of-the-art approaches on many real-world datasets.

negative: Marriage, honesty, and stability Many centralized two-sided markets form a matching between participants by running a stable marriage algorithm. It is a well-known fact that no matching mechanism based on a stable marriage algorithm can guarantee truthfulness as a dominant strategy for participants. However, as we will show in this paper, in a probabilistic setting where the preference lists of one side of the market are composed of only a constant (independent of the the size of the market) number of entries, each drawn from an arbitrary distribution, the number of participants that have more than one stable partner is vanishingly small. This proves (and generalizes) a conjecture of Roth and Peranson [23]. As a corollary of this result, we show that, with high probability, the truthful strategy is the best response for a given player when the other players are truthful. We also analyze equilibria of the deferred acceptance stable marriage game. We show that the game with complete information has an equilibrium in which a (1 - o(1)) fraction of the strategies are truthful in expectation. In the more realistic setting of a game of incomplete information, we will show that the set of truthful strategies form a (1 + o(1))-approximate Bayesian-Nash equilibrium. Our results have implications in many practical settings and were inspired by the work of Roth and Peranson [23] on the National Residency Matching Program.

negative: Alleviation of Interest flooding attacks using Token bucket with per interface fairness and Countermeasures in Named Data Networking Distributed Denial of Service (DDoS) attacks are an ongoing problem in today's Internet. In this paper we focus on DDoS attacks in Named Data Networking (NDN). NDN is a specific candidate for next-generation Internet architecture designs. In NDN locations are named instead of data, So NDN transforms data into a first-class entity and makes itself an attractive and practical approach to meet the needs for many applications. In a Named Data Networking (NDN), end users request data by sending Interest packets, and the network delivers Data packets upon request only, effectively eliminating many existing DDoS attacks. However, an NDN network faces a new type of DDoS attack, namely Interest packet flooding. In this paper we try to alleviate the Interest flooding using token bucket with per interface fairness algorithm and also we try to find countermeasures for Interest flooding attacks

negative: A personalized recommender system for pervasive social networks The current availability of interconnected portable devices, and the advent of the Web 2.0, raise the problem of supporting anywhere and anytime access to a huge amount of content, generated and shared by mobile users. On the one hand, users tend to be always connected for sharing experiences and conducting their social interactions with friends and acquaintances, through so-called Mobile Social Networks, further improving their social inclusion. On the other hand, the pervasiveness of communication infrastructures spreading data (cellular networks, direct device-to-device contacts, interactions with ambient devices as in the Internet-of-Things) makes compulsory the deployment of solutions able to filter off undesired information and to select what content should be addressed to which users, for both (i) better user experience, and (ii) resource saving of both devices and network. In this work, we propose a novel framework for pervasive social networks, called Pervasive PLIERS (p-PLIERS), able to discover and select, in a highly personalized way, contents of interest for single mobile users. p-PLIERS exploits the recently proposed PLIERS tag-based recommender system [2] as context a reasoning tool able to adapt recommendations to heterogeneous interest profiles of different users. p-PLIERS effectively operates also when limited knowledge about the network is maintained. It is implemented in a completely decentralized environment, in which new contents are continuously generated and diffused through the network, and it relies only on the exchange of single nodes’ knowledge during proximity contacts and through device-to-device communications. We evaluated p-PLIERS by simulating its behavior in three different scenarios: a big event (Expo 2015), a conference venue (ACM KDD’15), and a working day in the city of Helsinki. For each scenario, we used real or synthetic mobility traces and we extracted real datasets from Twitter interactions to characterize the generation and sharing of user contents.

negative: Recent Advancements in Retinal Vessel Segmentation Retinal vessel segmentation is a key step towards the accurate visualization, diagnosis, early treatment and surgery planning of ocular diseases. For the last two decades, a tremendous amount of research has been dedicated in developing automated methods for segmentation of blood vessels from retinal fundus images. Despite the fact, segmentation of retinal vessels still remains a challenging task due to the presence of abnormalities, varying size and shape of the vessels, non-uniform illumination and anatomical variability between subjects. In this paper, we carry out a systematic review of the most recent advancements in retinal vessel segmentation methods published in last five years. The objectives of this study are as follows: first, we discuss the most crucial preprocessing steps that are involved in accurate segmentation of vessels. Second, we review most recent state-of-the-art retinal vessel segmentation techniques which are classified into different categories based on their main principle. Third, we quantitatively analyse these methods in terms of its sensitivity, specificity, accuracy, area under the curve and discuss newly introduced performance metrics in current literature. Fourth, we discuss the advantages and limitations of the existing segmentation techniques. Finally, we provide an insight into active problems and possible future directions towards building successful computer-aided diagnostic system.

negative: Deep Learning with Low Precision by Half-Wave Gaussian Quantization The problem of quantizing the activations of a deep neural network is considered. An examination of the popular binary quantization approach shows that this consists of approximating a classical non-linearity, the hyperbolic tangent, by two functions: a piecewise constant sign function, which is used in feedforward network computations, and a piecewise linear hard tanh function, used in the backpropagation step during network learning. The problem of approximating the widely used ReLU non-linearity is then considered. An half-wave Gaussian quantizer (HWGQ) is proposed for forward approximation and shown to have efficient implementation, by exploiting the statistics of of network activations and batch normalization operations. To overcome the problem of gradient mismatch, due to the use of different forward and backward approximations, several piece-wise backward approximators are then investigated. The implementation of the resulting quantized network, denoted as HWGQ-Net, is shown to achieve much closer performance to full precision networks, such as AlexNet, ResNet, GoogLeNet and VGG-Net, than previously available low-precision networks, with 1-bit binary weights and 2-bit quantized activations.

negative: Resource Allocation Optimization for Device-to-Device Communication Underlaying Cellular Networks Device-to-Device (D2D) communication will become an important technology in future networks with the increase of the requirements of local communication services. The interference between cellular communication and D2D communication can be coordinated by proper power control and resource allocation. In this paper, we analyze the resource allocation methods for D2D communication underlaying cellular networks. A novel resource allocation method that D2D can reuse the resources of more than one cellular user is proposed. After that, we discuss the selection of the optimal resource allocation method from the proposed method and the conventional methods. Finally, the performance of different methods is evaluated through numerical simulation. The simulation results show that the proposed method is the optimal resource allocation method when the D2D pair locates at the most part of the cell area in both uplink and downlink. The proposed method can improve the sum throughput of cellular communication and D2D communication significantly.

negative:
Eleos: ExitLess OS Services for SGX Enclaves Intel Software Guard extensions (SGX) enable secure and trusted execution of user code in an isolated enclave to protect against a powerful adversary. Unfortunately, running I/O-intensive, memory-demanding server applications in enclaves leads to significant performance degradation. Such applications put a substantial load on the in-enclave system call and secure paging mechanisms, which turn out to be the main reason for the application slowdown. In addition to the high direct cost of thousands-of-cycles long SGX management instructions, these mechanisms incur the high indirect cost of enclave exits due to associated TLB flushes and processor state pollution.
 We tackle these performance issues in Eleos by enabling exit-less system calls and exit-less paging in enclaves. Eleos introduces a novel Secure User-managed Virtual Memory (SUVM) abstraction that implements application-level paging inside the enclave. SUVM eliminates the overheads of enclave exits due to paging, and enables new optimizations such as sub-page granularity of accesses.
 We thoroughly evaluate Eleos on a range of microbenchmarks and two real server applications, achieving notable system performance gains. memcached and a face verification server running in-enclave with Eleos, achieves up to 2.2× and 2.3× higher throughput respectively while working on datasets up to 5× larger than the enclave's secure physical memory.

negative: When sex is more than just sex: attachment orientations, sexual experience, and relationship quality. The authors explored the contribution of individual differences in attachment orientations to the experience of sexual intercourse and its association with relationship quality. In Study 1, 500 participants completed self-report scales of attachment orientations and sexual experience. The findings indicated that whereas attachment anxiety was associated with an ambivalent construal of sexual experience, attachment avoidance was associated with more aversive sexual feelings and cognitions. In Study 2, 41 couples reported on their attachment orientations and provided daily diary measures of sexual experiences and relationship interactions for a period of 42 days. Results showed that attachment anxiety amplified the effects of positive and negative sexual experiences on relationship interactions. In contrast, attachment avoidance inhibited the positive relational effect of having sex and the detrimental relational effects of negative sexual interactions. The authors discuss the possibility that attachment orientations are associated with different sex-related strategies and goals within romantic relationships.

negative: Hierarchical graph indexing Traffic analysis, in the context of Telecommunications or Internet and Web data, is crucial for large network operations. Data in such networks is often provided as large graphs with hundreds of millions of vertices and edges. We propose efficient techniques for managing such graphs at the storage level in order to facilitate its processing at the interface level(visualization). The methods are based on a hierarchical decomposition of the graph edge set that is inherited from a hierarchical decomposition of the vertex set. Real time navigation is provided by an efficient two level indexing schema called the gkd*-tree. The first level is a variation of a kd-tree index that partitions the edge set in a way that conforms to the hierarchical decomposition and the data distribution (the gkd-tree). The second level is a redundant R-tree that indexes the leaf pages of the gkd-tree. We provide computational results that illustrate the superiority of the gkd-tree against conventional indexes like the kd-tree and the R*-tree both in creation as well as query response times.

negative: Detection of copy-move image forgery based on discrete cosine transform Since powerful editing software is easily accessible, manipulation on images is expedient and easy without leaving any noticeable evidences. Hence, it turns out to be a challenging chore to authenticate the genuineness of images as it is impossible for human’s naked eye to distinguish between the tampered image and actual image. Among the most common methods extensively used to copy and paste regions within the same image in tampering image is the copy-move method. Discrete Cosine Transform (DCT) has the ability to detect tampered regions accurately. Nevertheless, in terms of precision (FP) and recall (FN), the block size of overlapping block influenced the performance. In this paper, the researchers implemented the copy-move image forgery detection using DCT coefficient. Firstly, by using the standard image conversion technique, RGB image is transformed into grayscale image. Consequently, grayscale image is segregated into overlying blocks of m × m pixels, m = 4.8. 2D DCT coefficients are calculated and reposition into a feature vector using zig-zag scanning in every block. Eventually, lexicographic sort is used to sort the feature vectors. Finally, the duplicated block is located by the Euclidean Distance. In order to gauge the performance of the copy-move detection techniques with various block sizes with respect to accuracy and storage, threshold D_similar = 0.1 and distance threshold (N)_d = 100 are used to implement the 10 input images in order. Consequently, 4 × 4 overlying block size had high false positive thus decreased the accuracy of forged detection in terms of accuracy. However, 8 × 8 overlying block accomplished more accurately for forged detection in terms of precision and recall as compared to 4 × 4 overlying block. In a nutshell, the result of the accuracy performance of different overlying block size are influenced by the diverse size of forged area, distance between two forged areas and threshold value used for the research.

negative: Analysis and validation of proteomic data generated by tandem mass spectrometry The analysis of the large amount of data generated in mass spectrometry–based proteomics experiments represents a significant challenge and is currently a bottleneck in many proteomics projects. In this review we discuss critical issues related to data processing and analysis in proteomics and describe available methods and tools. We place special emphasis on the elaboration of results that are supported by sound statistical arguments.

negative: A three-level, T-type, power electronics building block using Si-SiC hybrid switch for high-speed drives This paper presents the design and implementation of a 100 kW three-level T-type (3L-T2), single-phase power electronics building block (PEBB). The PEBB features switching power devices with associated gate drivers, DC-link capacitors and interconnection busbar. A hybrid switch (HyS), which includes a Si IGBT and a SiC MOSFET in parallel, forms the switching power device in the PEBB. An low-inductive multi-layer laminated busbar was designed to have symmetrical current commutation loops. A major contribution is that this is achieved while no three-level T-type power module was used. A loop inductance of 29 nH was achieved which is lower than the existing state-of-the-art three-level designs in literature. The fabricated prototype PEBB achieves a specific power density of 27.7 kW/kg and a volumetric power density of 308.61 W/in3. Single-phase operation of the PEBB has been demonstrated at the switching frequency of 28 kHz.

negative: Trends in camera based Automotive Driver Assistance Systems (ADAS) Advance Driver Assistance Systems (ADAS), once limited to high end luxury automobiles are fast becoming popular with Mid and entry level segments driven in part by legislation coming in to effect in the latter part of this decade. These systems require support for a wide variety of applications, from surround-view visual systems to safety critical vision applications (eg Pedestrian Detect, automatic braking etc). In this white paper we describe some of the existing and emerging trends and applications in each of these segments along with the requirements and motivations for each of these features. We also highlight TI's automotive class TDA2x device, a state of the art automotive grade device capable of handling complex ADAS applications within a low power and cost budget.

negative: Modeling and control active suspension system for a full car model The purpose of this paper is to investigate the performance of a full car model active suspension system using LQR controller. Dynamic model used in this study is a linear model. A linear model can capture basic performances of vehicle suspension such as body displacement, body acceleration, wheel displacement, wheel deflection, suspension travels, pitch and yawn. Performance of suspension system is determined by the ride comfort and vehicle handling. It can be measured by car body displacement and wheel displacement performance. Two types of road profiles are used as input for the system. Simulation is based on the mathematical model by using MATLAB/SIMULINK software. Results show that the performance of body displacement and wheel displacement can be improved by using Linear Quadratic Regulator control (LQR).

negative: Can soft biometric traits assist user recognition Biometrics is rapidly gaining acceptance as the technology that can meet the ever increasing need for security in critical applications. Biometric systems automatically recognize individuals based on their physiological and behavioral characteristics. Hence, the fundamental requirement of any biometric recognition system is a human trait having several desirable properties like universality, distinctiveness, permanence, collectability, acceptability, and resistance to circumvention. However, a human characteristic that possesses all these properties has not yet been identified. As a result, none of the existing biometric systems provide perfect recognition and there is a scope for improving the performance of these systems. Although characteristics like gender, ethnicity, age, height, weight and eye color are not unique and reliable, they provide some information about the user. We refer to these characteristics as “soft” biometric traits and argue that these traits can complement the identity information provided by the primary biometric identifiers like fingerprint and face. This paper presents the motivation for utilizing soft biometric information and analyzes how the soft biometric traits can be automatically extracted and incorporated in the decision making process of the primary biometric system. Preliminary experiments were conducted on a fingerprint database of 160 users by synthetically generating soft biometric traits like gender, ethnicity, and height based on known statistics. The results show that the use of additional soft biometric user information significantly improves ( ≈ 6%) the recognition performance of the fingerprint biometric system.

negative: Using Screen Brightness to Improve Security in Mobile Social Network Access In the today's mobile communications scenario, smartphones offer new capabilities to develop sophisticated applications that seem to make daily life easier and more convenient for users. Such applications, which may involve mobile ticketing, identification, access control operations, etc., are often accessible through social network aggregators, that assume a fundamental role in the federated identity management space. While this makes modern smartphones very powerful devices, it also makes them very attractive targets for spyware injection. This kind of malware is able to bypass classic authentication measures and steal user credentials even when a secure element is used, and can, therefore, perform unauthorized mobile access to social network services without the user's consent. Such an event allows stealing sensitive information or even a full identity theft. In this work, we address this issue by introducing BrightPass, a novel authentication mechanism based on screen brightness. BrightPass allows users to authenticate safely with a PIN-based confirmation in the presence of specific operations on sensitive data. We compare BrightPass with existing schemes, in order to show its usability and security within the social network arena. Furthermore, we empirically assess the security of BrightPass through experimentation. Our tests indicate that BrightPass protects the PIN code against automatic submissions carried out by malware while granting fast authentication phases and reduced error rates.

negative: Encountering stronger password requirements: user attitudes and behaviors Text-based passwords are still the most commonly used authentication mechanism in information systems. We took advantage of a unique opportunity presented by a significant change in the Carnegie Mellon University (CMU) computing services password policy that required users to change their passwords. Through our survey of 470 CMU computer users, we collected data about behaviors and practices related to the use and creation of passwords. We also captured users' opinions about the new, stronger policy requirements. Our analysis shows that, although most of the users were annoyed by the need to create a complex password, they believe that they are now more secure. Furthermore, we perform an entropy analysis and discuss how our findings relate to NIST recommendations for creating a password policy. We also examine how users answer specific questions related to their passwords. Our results can be helpful in designing better password policies that consider not only technical aspects of specific policy rules, but also users' behavior in response to those rules.

negative: Learning user-specific parameters in a multibiometric system Biometric systems that use a single biometric trait have to contend with noisy data, restricted degrees of freedom, failureto-enroll problems, spoof attacks, and unacceptable error rates. Multibiometric systems that use multiple traits of an individual for authentication, alleviate some of these problems while improving verification performance. We demonstrate that the performance of multibiometric systems can be further improved by learning user-specific parameters. Two types of parameters are considered here. (i) Thresholds that are used to decide if a matching score indicates a genuine user or an impostor, and (ii) weights that are used to indicate the importance of matching scores output by each biometric trait. User-specific thresholds are computed using the cumulative histogram of impostor matching scores corresponding to each user. The user-specific weights associated with each biometric are estimated by searching for that set of weights which minimizes the total verification error. The tests were conducted on a database of 50 users who provided fingerprint, face and hand geometry data, with 10 of these users providing data over a period of two months. We observed that user-specific thresholds improved system performance by ∼ 2%, while user-specific weights improved performance by ∼ 3%.

negative: Finger ECG signal for user authentication: Usability and performance Over the past few years, the evaluation of Electrocardio-graphic (ECG) signals as a prospective biometric modality has revealed promising results. Given the vital and continuous nature of this information source, ECG signals offer several advantages to the field of biometrics; yet, several challenges currently prevent the ECG from being adopted as a biometric modality in operational settings. These arise partially due to ECG signal's clinical tradition and intru-siveness, but also from the lack of evidence on the permanence of the ECG templates over time. The problem of in-trusiveness has been recently overcome with the “off-the-person” approach for capturing ECG signals. In this paper we provide an evaluation of the permanence of ECG signals collected at the fingers, with respect to the biometric authentication performance. Our experimental results on a small dataset suggest that further research is necessary to account for and understand sources of variability found in some subjects. Despite these limitations, “off-the-person” ECG appears to be a viable trait for multi-biometric or standalone biometrics, low user throughput, real-world scenarios.

negative: Feasibility Study on the Use of Biometrics in an Entitlement Scheme This report examines the feasibility of using biometrics as a means of establishing a unique identity, to support the proposed entitlement scheme under development by the United Kingdom Passport Service (UKPS) and Driver and Vehicle Licensing Agency (DVLA). Biometrics identification systems measure physiological and behavioural characteristics of a person, and use these measurements to reliably distinguish one person from another. The main examples considered in this study are fingerprint, iris and face image recognition. Biometric identification can assist in the issue of entitlement cards, passports, driving licences and other identity documents in two ways. On the initial issue of such documents, biometrics can be used to check that applicants are not erroneously issued documents using two different identity details; this is the main focus of this study. Secondly, when an entitlement card, passport or driving licence is being used, biometrics can help confirm that it is being used by the correct person. The purpose of the study is to assess the feasibility of fingerprint, iris and face recognition technologies for these applications, to identify unknowns and the risks associated with the use of biometrics in such a national identity scheme, and to make recommendations for how some of these risks might be addressed should such a scheme proceed. Biometric methods do not offer 100% certainty of authentication of individuals. The success of any deployment of a system using biometric methods depends, therefore, on many factors such as: the degree of the 'uniqueness' of the biometric measure, technical and social factors, user interfaces, and provision of secure backup systems for those situations and individual s where the biometric will not work effectively. The main findings of the study are: a In principle, fingerprint or iris recognition can provide the identification performance required for unique identification over the entire UK adult population. In the case of fingerprint recognition, the system would require the enrolment of at least four fingers, whereas for iris recognition both irises should be registered. However, the practicalities of deploying either iris or fingerprint recognition in such a scheme are far from straightforward. b Such a system would be a groundbreaking deployment for this kind of biometric application. Not only would it be one of the largest deployments to date, but aspects of its performance would be far more demanding than those of similarly sized systems; such existing systems are either not applied in the civil sector, or operate …

negative: Activity Recognition with Smartphone Sensors Second Exam Literature Review The ubiquity of smartphones together with their ever-growing computing, networking and sensing powers have been changing the landscape of people’s daily life. Among others, activity recoginition, which takes the raw sensor reading as inputs and predicts a user’s motion activity, has become an active research area in recent years. It is the core building block in many high-impact applications, ranging from health and fitness monitoring, personal biometric signature, urban computing, assistive technology and elder-care, to indoor localization and navigation, etc. This paper presents a comprehensive survey of the recent advances in activity recognition with smartphones’ sensors. We start with the basic concepts such as sensors, activity types, etc. We review the core data mining techniques behind the main stream activity recognition algorithms, analyze their major challenges and introduce a variety of real applications enabled by activity recognition. Professor: Dr. Hanghang Tong Signature: Date: 06-12-2014 Professor: Dr. Ping Ji Signature: Date: 06-12-2014 Professor: Dr. Ted Brown Signature: Date: 06-12-2014 Advisor: Dr. Hanghang Tong


query: Flexible and Fine-Grained Attribute-Based Data Storage in Cloud Computing

positive: Attribute-based encryption for fine-grained access control of encrypted data As more sensitive data is shared and stored by third-party sites on the Internet, there will be a need to encrypt data stored at these sites. One drawback of encrypting data, is that it can be selectively shared only at a coarse-grained level (i.e., giving another party your private key). We develop a new cryptosystem for fine-grained sharing of encrypted data that we call Key-Policy Attribute-Based Encryption (KP-ABE). In our cryptosystem, ciphertexts are labeled with sets of attributes and private keys are associated with access structures that control which ciphertexts a user is able to decrypt. We demonstrate the applicability of our construction to sharing of audit-log information and broadcast encryption. Our construction supports delegation of private keys which subsumesHierarchical Identity-Based Encryption (HIBE).

positive:
Provably secure ciphertext policy ABE In ciphertext policy attribute-based encryption (CP-ABE), every secret key is associated with a set of attributes, and every ciphertext is associated with an access structure on attributes. Decryption is enabled if and only if the user's attribute set satisfies the ciphertext access structure. This provides fine-grained access control on shared data in many practical settings, e.g., secure database and IP multicast.
 In this paper, we study CP-ABE schemes in which access structures are AND gates on positive and negative attributes. Our basic scheme is proven to be chosen plaintext (CPA) secure under the decisional bilinear Diffie-Hellman (DBDH) assumption. We then apply the Canetti-Halevi-Katz technique to obtain a chosen ciphertext (CCA) secure extension using one-time signatures. The security proof is a reduction to the DBDH assumption and the strong existential unforgeability of the signature primitive.
 In addition, we introduce hierarchical attributes to optimize our basic scheme - reducing both ciphertext size and encryption/decryption time while maintaining CPA security. We conclude with a discussion of practical applications of CP-ABE.

positive: Secure Overlay Cloud Storage with Access Control and Assured Deletion We can now outsource data backups off-site to third-party cloud storage services so as to reduce data management costs. However, we must provide security guarantees for the outsourced data, which is now maintained by third parties. We design and implement FADE, a secure overlay cloud storage system that achieves fine-grained, policy-based access control and file assured deletion. It associates outsourced files with file access policies, and assuredly deletes files to make them unrecoverable to anyone upon revocations of file access policies. To achieve such security goals, FADE is built upon a set of cryptographic key operations that are self-maintained by a quorum of key managers that are independent of third-party clouds. In particular, FADE acts as an overlay system that works seamlessly atop today's cloud storage services. We implement a proof-of-concept prototype of FADE atop Amazon S3, one of today's cloud storage services. We conduct extensive empirical studies, and demonstrate that FADE provides security protection for outsourced data, while introducing only minimal performance and monetary cost overhead. Our work provides insights of how to incorporate value-added security features into today's cloud storage services.

positive: Privacy-preserving personal health record using multi-authority attribute-based encryption with revocation Personal health record (PHR) service is an emerging model for health information exchange. In PHR systems, patient’s health records and information are maintained by the patient himself through the Web. In reality, PHRs are often outsourced to be stored at the third parties like cloud service providers. However, there have been serious privacy concerns about cloud service as it may expose user’s sensitive data like PHRs to those cloud service providers or unauthorized users. Using attribute-based encryption (ABE) to encrypt patient’s PHRs in cloud environment, secure and flexible access control can be achieved. Yet, problems like scalability in key management, fine-grained access control, and efficient user revocation remain to be addressed. In this paper, we propose a privacy-preserving PHR, which supports fine-grained access control and efficient revocation. To be specific, our scheme achieves the goals (1) scalable and fine-grained access control for PHRs by using multi-authority ABE scheme, and (2) efficient on-demand user/attribute revocation and dynamic policy update. In our scheme, we consider the situation that multiple data owners exist, and patient’s PHRs are encrypted and stored in semi-trust servers. The access structure in our scheme is expressive access tree structure, and the security of our scheme can be reduced to the standard decisional bilinear Diffie–Hellman assumption.

positive: Identity-based encryption with efficient revocation Identity-based encryption (IBE) is an exciting alternative to public-key encryption, as IBE eliminates the need for a Public Key Infrastructure (PKI). The senders using an IBE do not need to look up the public keys and the corresponding certificates of the receivers, the identities (e.g. emails or IP addresses) of the latter are sufficient to encrypt. Any setting, PKI- or identity-based, must provide a means to revoke users from the system. Efficient revocation is a well-studied problem in the traditional PKI setting. However in the setting of IBE, there has been little work on studying the revocation mechanisms. The most practical solution requires the senders to also use time periods when encrypting, and all the receivers (regardless of whether their keys have been compromised or not) to update their private keys regularly by contacting the trusted authority. We note that this solution does not scale well -- as the number of users increases, the work on key updates becomes a bottleneck. We propose an IBE scheme that significantly improves key-update efficiency on the side of the trusted party (from linear to logarithmic in the number of users), while staying efficient for the users. Our scheme builds on the ideas of the Fuzzy IBE primitive and binary tree data structure, and is provably secure.

negative:
Using Markov decision process in cognitive radio networks towards the optimal reward The Learning is an indispensable phase in the cognition cycle of cognitive radio network. It corresponds between the executed actions and the estimated rewards. Based on this phase, the agent learns from past experiences to improve his actions in the next interventions. In the literature, there are several methods that treat the artificial learning. Among them, we cite the reinforcement learning that look for the optimal policy, for ensuring the maximum reward.
 The present work exposes an approach, based on a model of reinforcement learning, namely Markov decision process, to maximize the sum of transfer rates of all secondary users. Such conception defines all notions relative to an environment with finite set of states, including: the agent, all states, the allowed actions with a given state, the obtained reward after the execution of an action and the optimal policy. After the implementation, we remark a correlation between the started policy and the optimal policy, and we improve the performances by referring to a previous work.

negative: High Performance Transactions via Early Write Visibility In order to guarantee recoverable transaction execution, database systems permit a transaction’s writes to be observable only at the end of its execution. As a consequence, there is generally a delay between the time a transaction performs a write and the time later transactions are permitted to read it. This delayed write visibility can significantly impact the performance of serializable database systems by reducing concurrency among conflicting transactions. This paper makes the observation that delayed write visibility stems from the fact that database systems can arbitrarily abort transactions at any point during their execution. Accordingly, we make the case for database systems which only abort transactions under a restricted set of conditions, thereby enabling a new recoverability mechanism, early write visibility, which safely makes transactions’ writes visible prior to the end of their execution. We design a new serializable concurrency control protocol, piece-wise visibility (PWV), with the explicit goal of enabling early write visibility. We evaluate PWV against state-of-the-art serializable protocols and a highly optimized implementation of read committed, and find that PWV can outperform serializable protocols by an order of magnitude and read committed by 3X on high contention workloads.

negative: A Genetic NewGreedy Algorithm for Influence Maximization in Social Network A user may be influenced by the other users of a social network by sharing information. Influence maximization is one of the critical research topics aimed at knowing the current circumstances of a social network, such as the general mood of the society. The goal of this problem is to find a seed set which has a maximum influence with respect to a propagation model. For the influence maximization problem is NP-Hard, it is obvious that an exhausted search algorithm is not able to find the solution in a reasonable time. It is also obvious that a greedy algorithm may not find a solution that satisfies all the requirements. Hence, a high-performance algorithm for solving the influence maximization problem, which leverages the strength of the greedy method and the genetic algorithm (GA) is presented in this paper. Experimental results show that the proposed algorithm can provide a better result than simple GA by about 10% in terms of the quality.

negative: Hyperdimensional biosignal processing: A case study for EMG-based hand gesture recognition The mathematical properties of high-dimensional spaces seem remarkably suited for describing behaviors produces by brains. Brain-inspired hyperdimensional computing (HDC) explores the emulation of cognition by computing with hypervectors as an alternative to computing with numbers. Hypervectors are high-dimensional, holographic, and (pseudo)random with independent and identically distributed (i.i.d.) components. These features provide an opportunity for energy-efficient computing applied to cyberbiological and cybernetic systems. We describe the use of HDC in a smart prosthetic application, namely hand gesture recognition from a stream of Electromyography (EMG) signals. Our algorithm encodes a stream of analog EMG signals that are simultaneously generated from four channels to a single hypervector. The proposed encoding effectively captures spatial and temporal relations across and within the channels to represent a gesture. This HDC encoder achieves a high level of classification accuracy (97.8%) with only 1/3 the training data required by state-of-the-art SVM on the same task. HDC exhibits fast and accurate learning explicitly allowing online and continuous learning. We further enhance the encoder to adaptively mitigate the effect of gesture-timing uncertainties across different subjects endogenously; further, the encoder inherently maintains the same accuracy when there is up to 30% overlapping between two consecutive gestures in a classification window.

negative: Ambulance redeployment: An approximate dynamic programming approach Emergency medical service (EMS) providers are charged with the task of managing ambulances so that the time required to respond to emergency calls is minimized. One approach that may assist in reducing response times is ambulance redeployment, i.e., repositioning idle ambulances in real time. We formulate a simulation model of EMS operations to evaluate the performance of a given allocation policy and use this model in an approximate dynamic programming (ADP) context to compute high-quality redeployment policies. We find that the resulting ADP policies perform much better than sub-optimal static policies and marginally better than near-optimal static policies. Representative computational results for Edmonton, Alberta are included.

negative: Design of household appliances for a Dc-based nanogrid system: An induction heating cooktop study case Efficient energy management is becoming an important issue when designing any electrical system. Recently, a significant effort has been devoted to the design of optimized micro and nanogrids comprising residential area subsystems. One of these approaches consists on the design of a dc-based nanogrid optimized for the interoperation of electric loads, sources, and storage elements. Home appliances are one of the main loads in such dc-based nanogrids. In this paper, the design and optimization of an appliance for operation in a dc-based nanogrid is detailed. An induction heating cooktop appliance will be considered as a reference example, being some of the design considerations generalizable to other appliances. The main design aspects, including the inductor system, power converter, EMC filter, and control are considered. Finally, some simulation results of the expected converter performance are shown.

negative: PCS/W-CDMA dual-band MMIC power amplifier with a newly proposed linearizing bias circuit A personal communications service/wide-band code division multiple access (PCS/W-CDMA) dual-band monolithic microwave integrated circuit (MMIC) power amplifier with a single-chip MMIC and a single-path output matching network is demonstrated by adopting a newly proposed on-chip linearizer. The linearizer is composed of the base–emitter diode of an active bias transistor and a capacitor to provide an RF short at the base node of the active bias transistor. The linearizer enhances the linearity of the power amplifier effectively for both PCS and W-CDMA bands with no additional dc power consumption, and has negligible insertion power loss with almost no increase in die area. It improves the input 1-dB gain compression point by 18.5 (20) dB and phase distortion by 6.1 (12.42 ) at an output power of 28 (28) dBm for the PCS (W-CDMA) band while keeping the base bias voltage of the power amplifier as designed. A PCS and W-CDMA dual-band InGaP heterojunction bipolar transistor MMIC power amplifier with single input and output and no switch for band selection is embodied by implementing the linearizer and by designing the amplifier to have broad-band characteristics. The dual-band power amplifier exhibits an output power of 30 (28.5) dBm, power-added efficiency of 39.5% (36%), and adjacent channel power ratio of 46 ( 50) dBc at the output power of 28 (28) dBm under 3.4-V operation voltage for PCS (W-CDMA) applications.

negative: Table 1 : A Comparison between Lean Construction and Agile Project This paper briefly summarises the evolution of Agile Project Management (APM) and differentiates it from lean and agile production and ‘leagile’ construction. The significant benefits being realized through employment of APM within the information systems industry are stated. The characteristics of APM are explored, including: philosophy, organizational attitudes and practices, planning, execution and control and learning. Finally, APM is subjectively assessed as to its potential contribution to the pre-design, design and construction phases. In conclusion, it is assessed that APM offers considerable potential for application in predesign and design but that there are significant hurdles to its adoption in the actual construction phase. Should these be overcome, APM offers benefits well beyond any individual project.

negative: Punica granatum (pomegranate) and its potential for prevention and treatment of inflammation and cancer. The last 7 years have seen over seven times as many publications indexed by Medline dealing with pomegranate and Punica granatum than in all the years preceding them. Because of this, and the virtual explosion of interest in pomegranate as a medicinal and nutritional product that has followed, this review is accordingly launched. The pomegranate tree, Punica granatum, especially its fruit, possesses a vast ethnomedical history and represents a phytochemical reservoir of heuristic medicinal value. The tree/fruit can be divided into several anatomical compartments: (1) seed, (2) juice, (3) peel, (4) leaf, (5) flower, (6) bark, and (7) roots, each of which has interesting pharmacologic activity. Juice and peels, for example, possess potent antioxidant properties, while juice, peel and oil are all weakly estrogenic and heuristically of interest for the treatment of menopausal symptoms and sequellae. The use of juice, peel and oil have also been shown to possess anticancer activities, including interference with tumor cell proliferation, cell cycle, invasion and angiogenesis. These may be associated with plant based anti-inflammatory effects, The phytochemistry and pharmacological actions of all Punica granatum components suggest a wide range of clinical applications for the treatment and prevention of cancer, as well as other diseases where chronic inflammation is believed to play an essential etiologic role.

negative: Transfer learning using computational intelligence: A survey 26 27 28 29 30 31 32 33 34 35 36 37 38 Article history: Received 3 December 2014 Received in revised form 7 January 2015 Accepted 17 January 2015 Available online xxxx

negative: The development of a new test of agility for rugby league. Agility requires change of direction speed (CODS) and also perceptual and decision-making skills and reaction speed. The purpose of this study was to develop a reliable and valid agility test for rugby league, which stressed all those dimensions. Players from a subelite rugby league team were tested twice on a sport-specific reactive agility test (RAT) and CODS test. Data were analyzed for reliability. For validity results from the subelite groups, first test was compared with data from an elite group. The RAT required participants to run toward an unpredictable life-size video of an attacking opponent and react to that video by changing direction. The CODS test required the same movement patterns however direction changes were preplanned. The subelite group's mean time to complete the CODS test and RAT on their first test was 1.67 ± 0.15 and 1.98 ± 0.16 seconds, respectively, and 1.62 ± 0.14 and 1.91 ± 0.17 seconds, respectively, on their second test (results are ± σ). Statistical analyses revealed no significant difference in means (p < 0.05) and good correlation (intraclass correlation coefficient = 0.87 and 0.82, respectively). The elite group's mean time to complete the tests was 1.65 ± 0.09 and 1.79 ±0.12 seconds, respectively. Statistical analyses revealed a significant difference in mean RAT time between the elite group and the subelite group (p < 0.05). The RAT was reliable and valid. Performance differences on the RAT were attributed to differences in perceptual skills and/or reaction ability. Testing and training agility should therefore stress those dimensions of agility and not just CODS.

negative: Diabetes Prediction by using Bacterial Foraging Optimization Algorithm And Artificial Neural Network Diagnosis of any diseases earlier is always preferable .diabetes is one such diseases.it reaches to the epidemic proportional in many developing countries and also reaching to industrialized nations. In this study, we investigate a programmable method to analyze diabetes diseases based on BFO and ANN.ANN is a powerful tool and solves the problems such as classification and prediction. Its performance is highly dependent on its architecture and weights. To gain high efficiency in ANN, an appropriate Architecture and learning Algorithm is preferable. The experiments on dataset occupied from undertaking repository to verify the potential of BFO algorithm and showed that BFO-ANN is more accurate than traditional ANN in terms of classification. General Terms-Artificial Neural Network, BacterialForaging Optimization Algorithm.

negative: Cross-Domain Ranking via Latent Space Learning We study the problem of cross-domain ranking, which addresses learning to rank objects from multiple interrelated domains. In many applications, we may have multiple interrelated domains, some of them with a large amount of training data and others with very little. We often wish to utilize the training data from all these related domains to help improve ranking performance. In this paper, we present a unified model: BayCDR for cross-domain ranking. BayCDR uses a latent space to measure the correlation between different domains, and learns the ranking functions from the interrelated domains via the latent space by a Bayesian model, where each ranking function is based on a weighted average model. An efficient learning algorithm based on variational inference and a generalization bound has been developed. To scale up to handle real large data, we also present a learning algorithm under the Map-Reduce programming model. Finally, we demonstrate the effectiveness and efficiency of BayCDR on large datasets.

negative: Morpho-syntactic Lexical Generalization for CCG Semantic Parsing In this paper, we demonstrate that significant performance gains can be achieved in CCG semantic parsing by introducing a linguistically motivated grammar induction scheme. We present a new morpho-syntactic factored lexicon that models systematic variations in morphology, syntax, and semantics across word classes. The grammar uses domain-independent facts about the English language to restrict the number of incorrect parses that must be considered, thereby enabling effective learning from less data. Experiments in benchmark domains match previous models with one quarter of the data and provide new state-of-the-art results with all available data, including up to 45% relative test-error reduction.

negative: Mitigation of Continuous and Pulsed Radio Interference with GNSS Antenna Arrays Dr. Andriy Konovaltsev received his engineer diploma and the Ph.D. degree in electrical engineering from Kharkov State Technical University of Radio Electronics, Ukraine in 1993 and 1996, correspondingly. He joined the Institute of Communications and Navigation of DLR in 2001. His research interests are in array processing for satellite navigation systems, signal processing algorithms for navigation receivers including synchronisation, multipath and radio interference mitigation.

negative: Facial Expression Recognition in Older Adults using Deep Machine Learning Facial Expression Recognition is still one of the challenging fields in pattern recognition and machine learning science. Despite efforts made in developing various methods for this topic, existing approaches lack generalizability and almost all studies focus on more traditional hand-crafted features extraction to characterize facial expressions. Moreover, effective classifiers to model the spatial and temporary patterns embedded in facial expressions ignore the effects of facial attributes, such as age, on expression recognition even though research indicates that facial expression manifestation varies with ages. Although there are large amount of benchmark datasets available for the recognition of facial expressions, only few datasets contains faces of older adults. Consequently the current scientific literature has not exhausted this topic. Recently, deep learning methods have been attracting more and more researchers due to their great success in various computer vision tasks, mainly because they avoid a process of feature definition and extraction which is often very difficult due to the wide variability of the facial expressions. Based on the deep learning theory, a neural network for facial expression recognition in older adults is constructed by combining a Stacked Denoising Auto-Encoder method to pre-train the network and a supervised training that provides a fine-tuning adjustment of the network. For the supervised classification layer, the -class softmax classifier was implemented, where is the number of expressions to be recognized. The performance are evaluated on two benchmark datasets (FACES and Lifespan), that are the only ones that contain facial expressions of the elderly. The achieved results show the superiority of the proposed deep learning approach compared to the conventional non-deep learning based facial expression recognition methods used in this context.

negative: Wasserstein Propagation for Semi-Supervised Learning Probability distributions and histograms are natural representations for product ratings, traffic measurements, and other data considered in many machine learning applications. Thus, this paper introduces a technique for graph-based semisupervised learning of histograms, derived from the theory of optimal transportation. Our method has several properties making it suitable for this application; in particular, its behavior can be characterized by the moments and shapes of the histograms at the labeled nodes. In addition, it can be used for histograms on non-standard domains like circles, revealing a strategy for manifold-valued semi-supervised learning. We also extend this technique to related problems such as smoothing distributions on graph nodes.

negative:
Incidence of adverse events and negligence in hospitalized patients. Results of the Harvard Medical Practice Study I. BACKGROUND
As part of an interdisciplinary study of medical injury and malpractice litigation, we estimated the incidence of adverse events, defined as injuries caused by medical management, and of the subgroup of such injuries that resulted from negligent or substandard care.

METHODS
We reviewed 30,121 randomly selected records from 51 randomly selected acute care, nonpsychiatric hospitals in New York State in 1984. We then developed population estimates of injuries and computed rates according to the age and sex of the patients as well as the specialties of the physicians.

RESULTS
Adverse events occurred in 3.7 percent of the hospitalizations (95 percent confidence interval, 3.2 to 4.2), and 27.6 percent of the adverse events were due to negligence (95 percent confidence interval, 22.5 to 32.6). Although 70.5 percent of the adverse events gave rise to disability lasting less than six months, 2.6 percent caused permanently disabling injuries and 13.6 percent led to death. The percentage of adverse events attributable to negligence increased in the categories of more severe injuries (Wald test chi 2 = 21.04, P less than 0.0001). Using weighted totals, we estimated that among the 2,671,863 patients discharged from New York hospitals in 1984 there were 98,609 adverse events and 27,179 adverse events involving negligence. Rates of adverse events rose with age (P less than 0.0001). The percentage of adverse events due to negligence was markedly higher among the elderly (P less than 0.01). There were significant differences in rates of adverse events among categories of clinical specialties (P less than 0.0001), but no differences in the percentage due to negligence.

CONCLUSIONS
There is a substantial amount of injury to patients from medical management, and many injuries are the result of substandard care.

negative: Automatic Question Generation using Discourse Cues In this paper, we present a system that automatically generates questions from natural language text using discourse connectives. We explore the usefulness of the discourse connectives for Question Generation (QG) that looks at the problem beyond sentence level. Our work divides the QG task into content selection and question formation. Content selection consists of finding the relevant part in text to frame question from while question formation involves sense disambiguation of the discourse connectives, identification of question type and applying syntactic transformations on the content. The system is evaluated manually for syntactic and semantic correctness.

negative: Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using Kapur's entropy The objective of image segmentation is to extract meaningful objects. A meaningful segmentation selects the proper threshold values to optimize a criterion using entropy. The conventional multilevel thresholding methods are efficient for bi-level thresholding. However, they are computationally expensive when extended to multilevel thresholding since they exhaustively search the optimal thresholds to optimize the objective functions. To overcome this problem, two successful swarm-intelligence-based global optimization algorithms, cuckoo search (CS) algorithm and wind driven optimization (WDO) for multilevel thresholding using Kapur’s entropy has been employed. For this purpose, best solution as fitness function is achieved through CS and WDO algorithm using Kapur’s entropy for optimal multilevel thresholding. A new approach of CS andWDO algorithm is used for selection of optimal threshold value. This algorithm is used to obtain the best solution or best fitness value from the initial random threshold values, and to evaluate the quality of a solution, correlation function is used. Experimental results have been examined on standard set of satellite images using various numbers of thresholds. The results based on Kapur’s entropy reveal that CS, ELR-CS and WDO method can be accurately and efficiently used in multilevel thresholding problem. 2013 Elsevier Ltd. All rights reserved.

negative: How Regulatory Fit Affects Value in Consumer Choices and Opinions Vol. XLIII (February 2006), 1–10 1 © 2006, American Marketing Association ISSN: 0022-2437 (print), 1547-7193 (electronic) *Tamar Avnet is Assistant Professor of Business, Rotman School of Management, University of Toronto (e-mail: tavnet@rotman.utoronto.ca). E. Tory Higgins is Professor of Psychology, Department of Psychology, and Professor of Management, Columbia School of Business, Columbia University (e-mail: tory@psych.columbia.edu). The research reported in this article was supported by a grant (No. 39429) from the National Institute of Mental Health to E. Tory Higgins. TAMAR AVNET and E. TORY HIGGINS*

negative: Improved Relation Extraction with Feature-Rich Compositional Embedding Models Compositional embedding models build a representation (or embedding) for a linguistic structure based on its component word embeddings. We propose a Feature-rich Compositional Embedding Model (FCM) for relation extraction that is expressive, generalizes to new domains, and is easy-to-implement. The key idea is to combine both (unlexicalized) handcrafted features with learned word embeddings. The model is able to directly tackle the difficulties met by traditional compositional embeddings models, such as handling arbitrary types of sentence annotations and utilizing global information for composition. We test the proposed model on two relation extraction tasks, and demonstrate that our model outperforms both previous compositional models and traditional feature rich models on the ACE 2005 relation extraction task, and the SemEval 2010 relation classification task. The combination of our model and a loglinear classifier with hand-crafted features gives state-of-the-art results. We made our implementation available for general use1.

negative: An Efficient Diagnosis System for Parkinson's Disease Using Kernel-Based Extreme Learning Machine with Subtractive Clustering Features Weighting Approach A novel hybrid method named SCFW-KELM, which integrates effective subtractive clustering features weighting and a fast classifier kernel-based extreme learning machine (KELM), has been introduced for the diagnosis of PD. In the proposed method, SCFW is used as a data preprocessing tool, which aims at decreasing the variance in features of the PD dataset, in order to further improve the diagnostic accuracy of the KELM classifier. The impact of the type of kernel functions on the performance of KELM has been investigated in detail. The efficiency and effectiveness of the proposed method have been rigorously evaluated against the PD dataset in terms of classification accuracy, sensitivity, specificity, area under the receiver operating characteristic (ROC) curve (AUC), f-measure, and kappa statistics value. Experimental results have demonstrated that the proposed SCFW-KELM significantly outperforms SVM-based, KNN-based, and ELM-based approaches and other methods in the literature and achieved highest classification results reported so far via 10-fold cross validation scheme, with the classification accuracy of 99.49%, the sensitivity of 100%, the specificity of 99.39%, AUC of 99.69%, the f-measure value of 0.9964, and kappa value of 0.9867. Promisingly, the proposed method might serve as a new candidate of powerful methods for the diagnosis of PD with excellent performance.

negative: Exploring Semantic Properties of Sentence Embeddings Neural vector representations are ubiquitous throughout all subfields of NLP. While word vectors have been studied in much detail, thus far only little light has been shed on the properties of sentence embeddings. In this paper, we assess to what extent prominent sentence embedding methods exhibit select semantic properties. We propose a framework that generate triplets of sentences to explore how changes in the syntactic structure or semantics of a given sentence affect the similarities obtained between their sentence embeddings.

negative: High Gain Wide-Band U-Shaped Patch Antennas With Modified Ground Planes A high gain wideband U-shaped patch antenna with two equal arms on poly tetra fluoro ethylene (PTFE) substrate is presented. An inverted U-shaped slot is introduced on the circular or square shaped ground plane just under the U-shaped patch. In this communication the effect of size and shape of the ground plane on impedance bandwidth is studied. Maximum impedance bandwidth of 86.79% (4.5–11.4 GHz) is obtained with circular shaped ground plane with diameter 36 mm. The highest gain achieved is 4.1 dBi. The simulated results are confirmed experimentally. The proposed antenna is simple in structure compared to the regular stacked or coplanar parasitic patch antennas. It is highly suitable for wireless communications.

negative: DAC-MACS: Effective Data Access Control for Multiauthority Cloud Storage Systems Data access control is an effective way to ensure data security in the cloud. However, due to data outsourcing and untrusted cloud servers, the data access control becomes a challenging issue in cloud storage systems. Existing access control schemes are no longer applicable to cloud storage systems, because they either produce multiple encrypted copies of the same data or require a fully trusted cloud server. Ciphertext-policy attribute-based encryption (CP-ABE) is a promising technique for access control of encrypted data. However, due to the inefficiency of decryption and revocation, existing CP-ABE schemes cannot be directly applied to construct a data access control scheme for multiauthority cloud storage systems, where users may hold attributes from multiple authorities. In this paper, we propose data access control for multiauthority cloud storage (DAC-MACS), an effective and secure data access control scheme with efficient decryption and revocation. Specifically, we construct a new multiauthority CP-ABE scheme with efficient decryption, and also design an efficient attribute revocation method that can achieve both forward security and backward security. We further propose an extensive data access control scheme (EDAC-MACS), which is secure under weaker security assumptions.

negative: Achieving Secure, Universal, and Fine-Grained Query Results Verification for Secure Search Scheme over Encrypted Cloud Data Secure search techniques over encrypted cloud data allow an authorized user to query data files of interest by submitting encrypted query keywords to the cloud server in a privacy-preserving manner. However, in practice, the returned query results may be incorrect or incomplete in the dishonest cloud environment. For example, the cloud server may intentionally omit some qualified results to save computational resources and communication overhead. Thus, a well-functioning secure query system should provide a query results verification mechanism that allows the data user to verify results. In this paper, we design a secure, easily integrated, and fine-grained query results verification mechanism, by which, given an encrypted query results set, the query user not only can verify the correctness of each data file in the set but also can further check how many or which qualified data files are not returned if the set is incomplete before decryption. The verification scheme is loose-coupling to concrete secure search techniques and can be very easily integrated into any secure query scheme. We achieve the goal by constructing secure verification object for encrypted cloud data. Furthermore, a short signature technique with extremely small storage cost is proposed to guarantee the authenticity of verification object and a verification object request technique is presented to allow the query user to securely obtain the desired verification object. Performance evaluation shows that the proposed schemes are practical and efficient.

negative: Implementing a Personal Health Record Cloud Platform Using Ciphertext-Policy Attribute-Based Encryption Work on designing and implementing a patient-centric, personal health record cloud platform based on open-source Indivo X system. We adopt cipher text-policy attribute-based encryption to provide privacy protection and fine-grained access control.

negative: Style Finder: Fine-Grained Clothing Style Detection and Retrieval With the rapid proliferation of smartphones and tablet computers, search has moved beyond text to other modalities like images and voice. For many applications like Fashion, visual search offers a compelling interface that can capture stylistic visual elements beyond color and pattern that cannot be as easily described using text. However, extracting and matching such attributes remains an extremely challenging task due to high variability and deformability of clothing items. In this paper, we propose a fine-grained learning model and multimedia retrieval framework to address this problem. First, an attribute vocabulary is constructed using human annotations obtained on a novel fine-grained clothing dataset. This vocabulary is then used to train a fine-grained visual recognition system for clothing styles. We report benchmark recognition and retrieval results on Women's Fashion Coat Dataset and illustrate potential mobile applications for attribute-based multimedia retrieval of clothing items and image annotation.

negative: BFC: High-performance distributed big-file cloud storage based on key-value store Nowadays, cloud-based storage services are rapidly growing and becoming an emerging trend in data storage field. There are many problems when designing an efficient storage engine for cloud-based systems with some requirements such as big-file processing, lightweight meta-data, low latency, parallel I/O, deduplication, distributed, high scalability. Key-value stores played an important role and showed many advantages when solving those problems. This paper presents about Big File Cloud (BFC) with its algorithms and architecture to handle most of problems in a big-file cloud storage system based on key-value store. It is done by proposing low-complicated, fixed-size meta-data design, which supports fast and highly-concurrent, distributed file I/O, several algorithms for resumable upload, download and simple data deduplication method for static data. This research applied the advantages of ZDB - an in-house key-value store which was optimized with auto-increment integer keys for solving big-file storage problems efficiently. The results can be used for building scalable distributed data cloud storage that support big-file with size up to several terabytes.

negative: A codebook-free and annotation-free approach for fine-grained image categorization Fine-grained categorization refers to the task of classifying objects that belong to the same basic-level class (e.g. different bird species) and share similar shape or visual appearances. Most of the state-of-the-art basic-level object classification algorithms have difficulties in this challenging problem. One reason for this can be attributed to the popular codebook-based image representation, often resulting in loss of subtle image information that are critical for fine-grained classification. Another way to address this problem is to introduce human annotations of object attributes or key points, a tedious process that is also difficult to generalize to new tasks. In this work, we propose a codebook-free and annotation-free approach for fine-grained image categorization. Instead of using vector-quantized codewords, we obtain an image representation by running a high throughput template matching process using a large number of randomly generated image templates. We then propose a novel bagging-based algorithm to build a final classifier by aggregating a set of discriminative yet largely uncorrelated classifiers. Experimental results show that our method outperforms state-of-the-art classification approaches on the Caltech-UCSD Birds dataset.

negative: P-MOD: Secure Privilege-Based Multilevel Organizational Data-Sharing in Cloud Computing Cloud computing has changed the way enterprises store, access and share data. Data is constantly being uploaded to the cloud and shared within an organization built on a hierarchy of many different individuals that are given certain data access privileges. With more data storage needs turning over to the cloud, finding a secure and efficient data access structure has become a major research issue. With different access privileges, individuals with more privileges (at higher levels of the hierarchy) are granted access to more sensitive data than those with fewer privileges (at lower levels of the hierarchy). In this paper, a Privilege-based Multilevel Organizational Data-sharing scheme (P-MOD) is proposed that incorporates a privilege-based access structure into an attribute-based encryption mechanism to handle these concerns. Each level of the privilege-based access structure is affiliated with an access policy that is uniquely defined by specific attributes. Data is then encrypted under each access policy at every level to grant access to specific data users based on their data access privileges. An individual ranked at a certain level can decrypt the ciphertext (at that specific level) if and only if that individual owns a correct set of attributes that can satisfy the access policy of that level. The user may also decrypt the ciphertexts at the lower levels with respect to the user’s level. Security analysis shows that P-MOD is secure against adaptively chosen plaintext attack assuming the DBDH assumption holds. The comprehensive performance analysis demonstrates that PMOD is more efficient in computational complexity and storage space than the existing schemes in secure data sharing within an organization.