query: Two privacy-preserving approaches for data publishing with identity reservation

positive: Anonymizing sequential releases An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information separately. The availability of related releases sharpens the identification of individuals by a global quasi-identifier consisting of attributes from related releases. Since it is not an option to anonymize previously released data, the current release must be anonymized to ensure that a global quasi-identifier is not effective for identification. In this paper, we study the sequential anonymization problem under this assumption. A key question is how to anonymize the current release so that it cannot be linked to previous releases yet remains useful for its own release purpose. We introduce the lossy join, a negative property in relational database design, as a way to hide the join relationship among releases, and propose a scalable and practical solution.

positive: Protecting Respondents' Identities in Microdata Release ÐToday's globally networked society places great demand on the dissemination and sharing of information. While in the past released information was mostly in tabular and statistical form, many situations call today for the release of specific data (microdata). In order to protect the anonymity of the entities (called respondents) to which information refers, data holders often remove or encrypt explicit identifiers such as names, addresses, and phone numbers. Deidentifying data, however, provides no guarantee of anonymity. Released information often contains other data, such as race, birth date, sex, and ZIP code, that can be linked to publicly available information to reidentify respondents and inferring information that was not intended for disclosure. In this paper we address the problem of releasing microdata while safeguarding the anonymity of the respondents to which the data refer. The approach is based on the definition of k-anonymity. A table provides k-anonymity if attempts to link explicitly identifying information to its content map the information to at least k entities. We illustrate how k-anonymity can be provided without compromising the integrity (or truthfulness) of the information released by using generalization and suppression techniques. We introduce the concept of minimal generalization that captures the property of the release process not to distort the data more than needed to achieve k-anonymity, and present an algorithm for the computation of such a generalization. We also discuss possible preference policies to choose among different minimal

positive: Generalizing Data to Provide Anonymity when Disclosing Information (Abstract) The proliferation of information on the Internet and access to fast computers with large storage capacities has increased the volume of information collected and disseminated about individuals. The existence os these other data sources makes it much easier to re-identify individuals whose private information is released in data believed to be anonymous. At the same time, increasing demands are made on organizations to release individualized data rather than aggregate statistical information. Even when explicit identi ers, such as name and phone number, are removed or encrypted when releasing individualized data, other characteristic data, which we term quasi-identi ers, can exist which allow the data recipient to re-identify individuals to whom the data refer. In this paper, we provide a computational disclosure technique for releasing information from a private table such that the identity of any individual to whom the released data refer cannot be de nitively recognized. Our approach protects against linking to other data. It is based on the concepts of generalization, by which stored values can be replaced with semantically consistent and truthful but less precise alternatives, and of k-anonymity . A table is said to provide k-anonymity when the contained data do not allow the recipient to associate the released information to a set of individuals smaller than k. We introduce the notions of generalized table and of minimal generalization of a table with respect to a k-anonymity requirement. As an optimization problem, the objective is to minimally distort the data while providing adequate protection. We describe an algorithm that, given a table, e ciently computes a preferred minimal generalization to provide anonymity.

positive: Bottom-Up Generalization : A Data Mining Solution to Privacy Protection In recent years, privacy-preserving data mining has been studied extensively, because of the wide proliferation of sensitive information on the internet. This paper investigates data mining as a technique for masking data; therefore, termed data mining based privacy protection. This approach incorporates partially the requirement of a targeted data mining task into the process of masking data so that essential structure is preserved in the masked data. The following privacy problem is considered in this paper: a data holder wants to release a version of data for building classification models, but wants to protect against linking the released data to an external source for inferring sensitive information. An iterative bottom-up generalization is adapted from data mining to generalize the data. The generalized data remains useful to classification but becomes difficult to link to other sources. The generalization space is specified by a hierarchical structure of generalizations. A key is identifying the best generalization to climb up the hierarchy at each iteration.

positive:
M-invariance: towards privacy preserving re-publication of dynamic datasets The previous literature of privacy preserving data publication has focused on performing "one-time" releases. Specifically, none of the existing solutions supports re-publication of the microdata, after it has been updated with insertions <u>and</u> deletions. This is a serious drawback, because currently a publisher cannot provide researchers with the most recent dataset continuously.
 This paper remedies the drawback. First, we reveal the characteristics of the re-publication problem that invalidate the conventional approaches leveraging k-anonymity and l-diversity. Based on rigorous theoretical analysis, we develop a new generalization principle m-invariance that effectively limits the risk of privacy disclosure in re-publication. We accompany the principle with an algorithm, which computes privacy-guarded relations that permit retrieval of accurate aggregate information about the original microdata. Our theoretical results are confirmed by extensive experiments with real data.

negative: Evaluating Sketchiness as a Visual Variable for the Depiction of Qualitative Uncertainty We report on results of a series of user studies on the perception of four visual variables that are commonly used in the literature to depict uncertainty. To the best of our knowledge, we provide the first formal evaluation of the use of these variables to facilitate an easier reading of uncertainty in visualizations that rely on line graphical primitives. In addition to blur, dashing and grayscale, we investigate the use of `sketchiness' as a visual variable because it conveys visual impreciseness that may be associated with data quality. Inspired by work in non-photorealistic rendering and by the features of hand-drawn lines, we generate line trajectories that resemble hand-drawn strokes of various levels of proficiency-ranging from child to adult strokes-where the amount of perturbations in the line corresponds to the level of uncertainty in the data. Our results show that sketchiness is a viable alternative for the visualization of uncertainty in lines and is as intuitive as blur; although people subjectively prefer dashing style over blur, grayscale and sketchiness. We discuss advantages and limitations of each technique and conclude with design considerations on how to deploy these visual variables to effectively depict various levels of uncertainty for line marks.

negative: An Architecture for Local Energy Generation, Distribution, and Sharing The United States electricity grid faces significant problems resulting from fundamental design principles that limit its ability to handle the key energy challenges of the 21st century. We propose an innovative electric power architecture, rooted in lessons learned from the Internet and microgrids, which addresses these problems while interfacing gracefully into the current grid to allow for non-disruptive incremental adoption. Such a system, which we term a "Local" grid, is controlled by intelligent power switches (IPS), and can consist of loads, energy sources, and energy storage. The desired result of the proposed architecture is to produce a grid network designed for distributed renewable energy, prevalent energy storage, and stable autonomous systems. We will describe organizing principles of such a system that ensure well-behaved operation, such as requirements for communication and energy transfer protocols, regulation and control schemes, and market-based rules of operation.

negative: A Sequential Neural Encoder With Latent Structured Description for Modeling Sentences In this paper, we propose a sequential neural encoder with latent structured description SNELSD for modeling sentences. This model introduces latent chunk-level representations into conventional sequential neural encoders, i.e., recurrent neural networks with long short-term memory LSTM units, to consider the compositionality of languages in semantic modeling. An SNELSD model has a hierarchical structure that includes a detection layer and a description layer. The detection layer predicts the boundaries of latent word chunks in an input sentence and derives a chunk-level vector for each word. The description layer utilizes modified LSTM units to process these chunk-level vectors in a recurrent manner and produces sequential encoding outputs. These output vectors are further concatenated with word vectors or the outputs of a chain LSTM encoder to obtain the final sentence representation. All the model parameters are learned in an end-to-end manner without a dependency on additional text chunking or syntax parsing. A natural language inference task and a sentiment analysis task are adopted to evaluate the performance of our proposed model. The experimental results demonstrate the effectiveness of the proposed SNELSD model on exploring task-dependent chunking patterns during the semantic modeling of sentences. Furthermore, the proposed method achieves better performance than conventional chain LSTMs and tree-structured LSTMs on both tasks.

negative: Advanced Gate Drive Unit With Closed-Loop $di_{{C}}/dt$  Control This paper describes the design and the experimental investigation of a gate drive unit with closed-loop control of the collector current slope diC/dt for multichip insulated-gate bipolar transistors (IGBTs). Compared to a pure resistive gate drive, the proposed diC/dt control offers the ability to adjust the collector current slope freely which helps to find an optimized relation between switching losses and secure operation of the freewheeling diode for every type of IGBT. Based on the description of IGBT's switching behavior, the design and the realization of the gate drive are presented. The test setup and the comparison of switching tests with and without the proposed diC/dt control are discussed.

negative: 3-Dimensional Localization via RFID Tag Array In this paper, we propose 3DLoc, which performs 3-dimensional localization on the tagged objects by using the RFID tag arrays. 3DLoc deploys three arrays of RFID tags on three mutually orthogonal surfaces of each object. When performing 3D localization, 3DLoc continuously moves the RFID antenna and scans the tagged objects in a 2-dimensional space right in front of the tagged objects. It then estimates the object's 3D position according to the phases from the tag arrays. By referring to the fixed layout of the tag array, we use Angle of Arrival-based schemes to accurately estimate the tagged objects' orientation and 3D coordinates in the 3D space. To suppress the localization errors caused by the multipath effect, we use the linear relationship of the AoA parameters to remove the unexpected outliers from the estimated results. We have implemented a prototype system and evaluated the actual performance in the real complex environment. The experimental results show that 3DLoc achieves the mean accuracy of 10cm in free space and 15.3cm in the multipath environment for the tagged object.

negative: Inductive Learning of Answer Set Programs from Noisy Examples In recent years, non-monotonic Inductive Logic Programming has received growing interest. Specifically, several new learning frameworks and algorithms have been introduced for learning under the answer set semantics, allowing the learning of common-sense knowledge involving defaults and exceptions, which are essential aspects of human reasoning. In this paper, we present a noise-tolerant generalisation of the learning from answer sets framework. We evaluate our ILASP3 system, both on synthetic and on real datasets, represented in the new framework. In particular, we show that on many of the datasets ILASP3 achieves a higher accuracy than other ILP systems that have previously been applied to the datasets, including a recently proposed differentiable learning framework.

negative: On Formal and Cognitive Semantics for Semantic Computing Semantics is the meaning of symbols, notations, concepts, functions, and behaviors, as well as their relations that can be deduced onto a set of predefined entities and/or known concepts. Semantic computing is an emerging computational methodology that models and implements computational structures and behaviors at semantic or knowledge level beyond that of symbolic data. In semantic computing, formal semantics can be classified into the categories of to be, to have, and to do semantics. This paper presents a comprehensive survey of formal and cognitive semantics for semantic computing in the fields of computational linguistics, software science, computational intelligence, cognitive computing, and denotational mathematics. A set of novel formal semantics, such as deductive semantics, concept-algebra-based semantics, and visual semantics, is introduced that forms a theoretical and cognitive foundation for semantic computing. Applications of formal semantics in semantic computing are presented in case studies on semantic cognition of natural languages, semantic analyses of computing behaviors, behavioral semantics of human cognitive processes, and visual semantic algebra for image and visual object manipulations.

negative: GENDER RECOGNITION FROM FACES USING BANDLET TRANSFORMATION Gender Recognition is important in different commercial and law enforcement applications. In this paper we have proposed a gender recognition system through facial images. We have used a different technique that involves Bandlet Transform instead of previously used Wavelet Transform, which is a multi-resolution technique and more efficiently provides the edges of images, and then mean is combined to create the feature vectors of the images. To classify the images for gender, we have used fuzzy c mean clustering. Experimental results have shown that average 97.1% accuracy have been achieved using this technique when SUMS database was used and 93.3% was achieved when FERET database was used. Keywords----Bandlet, Gender Recognition, Fuzzy C-mean, Multi Resolution.

negative: Evolution of the internal fixation of long bone fractures. The scientific basis of biological internal fixation: choosing a new balance between stability and biology. The advent of 'biological internal fixation' is an important development in the surgical management of fractures. Locked nailing has demonstrated that flexible fixation without precise reduction results in reliable healing. While external fixators are mainly used today to provide temporary fixation in fractures after severe injury, the internal fixator offers flexible fixation, maintaining the advantages of the external fixator but allowing long-term treatment. The internal fixator resembles a plate but functions differently. It is based on pure splinting rather than compression. The resulting flexible stabilisation induces the formation of callus. With the use of locked threaded bolts, the application of the internal fixator foregoes the need of adaptation of the shape of the splint to that of the bone during surgery. Thus, it is possible to apply the internal fixator as a minimally invasive percutaneous osteosynthesis (MIPO). Minimal surgical trauma and flexible fixation allow prompt healing when the blood supply to bone is maintained or can be restored early. The scientific basis of the fixation and function of these new implants has been reviewed. The biomechanical aspects principally address the degree of instability which may be tolerated by fracture healing under different biological conditions. Fractures may heal spontaneously in spite of gross instability while minimal, even non-visible, instability may be deleterious for rigidly fixed small fracture gaps. The theory of strain offers an explanation for the maximum instability which will be tolerated and the minimal degree required for induction of callus formation. The biological aspects of damage to the blood supply, necrosis and temporary porosity explain the importance of avoiding extensive contact of the implant with bone. The phenomenon of bone loss and stress protection has a biological rather than a mechanical explanation. The same mechanism of necrosis-induced internal remodelling may explain the basic process of direct healing.

negative: A Survey on Clustering Algorithms for Wireless Sensor Networks A wireless sensor network (WSN)consisting of a large number of tiny sensors can be an effective tool for gathering data in diverse kinds of environments. The data collected by each sensor is communicated to the base station, which forwards the data to the end user. Clustering is introduced to WSNs because it has proven to be an effective approach to provide better data aggregation and scalability for large WSNs. Clustering also conserves the limited energy resources of the sensors. This paper synthesises existing clustering algorithms news's and highlights the challenges in clustering.

negative: 80ºC, 50-Gb/s Directly Modulated InGaAlAs BH-DFB Lasers Direct modulation at 50 Gb/s of 1.3-μm InGaAlAs DFB lasers operating at up to 80°C was experimentally demonstrated by using a ridge-shaped buried heterostructure.

negative: Platform-as-a-Service (PaaS): The Next Hype of Cloud Computing Cloud Computing is expected to become the driving force of information technology to revolutionize the future. Presently number of companies is trying to adopt this new technology either as service providers, enablers or vendors. In this way the cloud market is estimated be likely to emerge at a remarkable rate. Under the whole cloud umbrella, PaaS seems to have a relatively small market share. However, it is expected to offer much more as it is compared with its counterparts SaaS and IaaS. This paper is aimed to assess and analyze the future of PaaS technology. Year 2015 named as “the year of PaaS”. It means that PaaS technology has established strong roots and ready to hit the market with better technology services. This research will discuss future PaaS market trends, growth and business competitors. In the current dynamic era, several companies in the market are offering PaaS services. This research will also outline some of the top service providers (proprietary & open source) to discuss their current technology status and present a futuristic look into their services and business strategies. Analysis of the present and future PaaS technology infrastructure will also be a major discussion in this paper.

negative: Hybrid CMOS/memristor circuits This is a brief review of recent work on the prospective hybrid CMOS/memristor circuits. Such hybrids combine the flexibility, reliability and high functionality of the CMOS subsystem with very high density of nanoscale thin film resistance switching devices operating on different physical principles. Simulation and initial experimental results demonstrate that performance of CMOS/memristor circuits for several important applications is well beyond scaling limits of conventional VLSI paradigm.

negative: Automatic Face Image Quality Prediction Face image quality can be defined as a measure of the utility of a face image to automatic face recognition. In this work, we propose (and compare) two methods for automatic face image quality based on target face quality values from (i) human assessments of face image quality (matcherindependent), and (ii) quality values computed from similarity scores (matcher-dependent). A support vector regression model trained on face features extracted using a deep convolutional neural network (ConvNet) is used to predict the quality of a face image. The proposed methods are evaluated on two unconstrained face image databases, LFW and IJB-A, which both contain facial variations with multiple quality factors. Evaluation of the proposed automatic face image quality measures shows we are able to reduce the FNMR at 1% FMR by at least 13% for two face matchers (a COTS matcher and a ConvNet matcher) by using the proposed face quality to select subsets of face images and video frames for matching templates (i.e., multiple faces per subject) in the IJB-A protocol. To our knowledge, this is the first work to utilize human assessments of face image quality in designing a predictor of unconstrained face quality that is shown to be effective in cross-database evaluation.

negative: The Neural Architecture of the Language Comprehension Network: Converging Evidence from Lesion and Connectivity Analyses While traditional models of language comprehension have focused on the left posterior temporal cortex as the neurological basis for language comprehension, lesion and functional imaging studies indicate the involvement of an extensive network of cortical regions. However, the full extent of this network and the white matter pathways that contribute to it remain to be characterized. In an earlier voxel-based lesion-symptom mapping analysis of data from aphasic patients (Dronkers et al., 2004), several brain regions in the left hemisphere were found to be critical for language comprehension: the left posterior middle temporal gyrus, the anterior part of Brodmann's area 22 in the superior temporal gyrus (anterior STG/BA22), the posterior superior temporal sulcus (STS) extending into Brodmann's area 39 (STS/BA39), the orbital part of the inferior frontal gyrus (BA47), and the middle frontal gyrus (BA46). Here, we investigated the white matter pathways associated with these regions using diffusion tensor imaging from healthy subjects. We also used resting-state functional magnetic resonance imaging data to assess the functional connectivity profiles of these regions. Fiber tractography and functional connectivity analyses indicated that the left MTG, anterior STG/BA22, STS/BA39, and BA47 are part of a richly interconnected network that extends to additional frontal, parietal, and temporal regions in the two hemispheres. The inferior occipito-frontal fasciculus, the arcuate fasciculus, and the middle and inferior longitudinal fasciculi, as well as transcallosal projections via the tapetum were found to be the most prominent white matter pathways bridging the regions important for language comprehension. The left MTG showed a particularly extensive structural and functional connectivity pattern which is consistent with the severity of the impairments associated with MTG lesions and which suggests a central role for this region in language comprehension.

negative: Distribution of Eigenvalues for 2x2 MIMO Channel Capacity Based on Indoor Measurements Based on the non line-of-sight (NLOS) indoor measurements performed in the corridors on the third floor of the Electronics and Telecommunications Research Institute (ETRI) building in Daejeon city, Republic of Korea, we investigated the distribution of the eigenvalues of HH*, where H denotes a 2×2 multiple-input multiple-output (MIMO) channel matrix. Using the observation that the distribution of the measured eigenvalues matches well with the Gamma distribution, we propose a model of eigenvalues as Gamma distributed random variables that prominently feature both transmitting and receiving correlations. Using the model with positive integer k_i, i=1, 2, which is the shape parameter of a Gamma distribution, we derive the closed-form ergodic capacity of the 2×2 MIMO channel. Validation results show that the proposed model enables the evaluation of the outage and ergodic capacities of the correlated 2×2 MIMO channel in the NLOS indoor corridor environment.

negative: Speech recognition of Malayalam numbers Digit speech recognition is important in many applications such as automatic data entry, PIN entry, voice dialing telephone, automated banking system, etc. This paper presents speaker independent speech recognition system for Malayalam digits. The system employs Mel frequency cepstrum coefficient (MFCC) as feature for signal processing and Hidden Markov model (HMM) for recognition. The system is trained with 21 male and female voices in the age group of 20 to 40 years and there was 98.5% word recognition accuracy (94.8% sentence recognition accuracy) on a test set of continuous digit recognition task.

negative: Beyond Independent Relevance: Methods and Evaluation Metrics for Subtopic Retrieval We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics of a query topic. In such a problem, the utility of a document in a ranking is dependent on other documents in the ranking, violating the assumption of independent relevance which is assumed in most traditional retrieval methods. Subtopic retrieval poses challenges for evaluating performance, as well as for developing effective algorithms. We propose a framework for evaluating subtopic retrieval which generalizes the traditional precision and recall metrics by accounting for intrinsic topic difficulty as well as redundancy in documents. We propose and systematically evaluate several methods for performing subtopic retrieval using statistical language models and a maximal marginal relevance (MMR) ranking strategy. A mixture model combined with query likelihood relevance ranking is shown to modestly outperform a baseline relevance ranking on a data set used in the TREC interactive track.

negative: Kaleido: You Can Watch It But Cannot Record It Recently a number of systems have been developed to implement and improve the visual communication over screen-camera links. In this paper we study an opposite problem: how to prevent unauthorized users from videotaping a video played on a screen, such as in a theater, while do not affect the viewing experience of legitimate audiences. We propose and develop a light-weight hardware-free system, called Kaleido, that ensures these properties by taking advantage of the limited disparities between the screen-eye channel and the screen-camera channel. Kaleido does not require any extra hardware and is purely based on re-encoding the original video frame into multiple frames used for displaying. We extensively test our system Kaleido using a variety of smartphone cameras. Our experiments confirm that Kaleido preserves the high-quality screen-eye channel while reducing the secondary screen-camera channel quality significantly.

negative: A new design of XOR-XNOR gates for low power application XOR and XNOR gate plays an important role in digital systems including arithmetic and encryption circuits. This paper proposes a combination of XOR-XNOR gate using 6-transistors for low power applications. Comparison between a best existing XOR-XNOR have been done by simulating the proposed and other design using 65nm CMOS technology in Cadence environment. The simulation results demonstrate the delay, power consumption and power-delay product (PDP) at different supply voltages ranging from 0.6V to 1.2V. The results show that the proposed design has lower power dissipation and has a full voltage swing.

negative: Sensor Based PUF IoT Authentication Model for a Smart Home with Private Blockchain With ubiquitous adoption of connected sensors, actuators and smart devices are finding inroads into daily life. Internet of Things (IoT) authentication is rapidly transforming from classical cryptographic user-centric knowledge based approaches to device signature based automated methodologies to corroborate identity between claimant and a verifier. Physical Unclonable Function (PUF) based IoT authentication mechanisms are gaining widespread interest as users are required to access IoT devices in real time while also expecting execution of sensitive (even physical) IoT actions immediately. This paper, delineates combination of BlockChain and Sensor based PUF authentication mechanism for solving real-time but non-repudiable access to IoT devices in a Smart Home by utilizing a mining less consensus mechanism for the provision of immutable assurance to users' and IoT devices' transactions i.e. commands, status alerts, actions etc.

negative: Defending the morality of violent video games The effect of violent video games is among the most widely discussed topics in media studies, and for good reason. These games are immensely popular, but many seem morally objectionable. Critics attack them for a number of reasons ranging from their capacity to teach players weapons skills to their ability to directly cause violent actions. This essay shows that many of these criticisms are misguided. Theoretical and empirical arguments against violent video games often suffer from a number of significant shortcomings that make them ineffective. This essay argues that video games are defensible from the perspective of Kantian, Aristotelian, and utilitarian moral theories.

negative:
Education-specific Tag Recommendation in CQA Systems Systems for Community Question Answering (CQA) are well-known on the open web (e.g. Stack Overflow or Quora). They have been recently adopted also for use in educational domain (mostly in MOOCs) to mediate communication between students and teachers. As students are only novices in topics they learn about, they may need various scaffoldings to achieve effective question answering. In this work, we focus specifically on automatic recommendation of tags classifying students' questions. We propose a novel method that can automatically analyze a text of a question and suggest appropriate tags to an asker. The method takes specifics of educational domain into consideration by a two-step recommendation process in which tags reflecting course structure are recommended at first and consequently supplemented with additional related tags.
 Evaluation of the method on data from CS50 MOOC at Stack Exchange platform showed that the proposed method achieved higher performance in comparison with a baseline method (tag recommendation without taking educational specifics into account).

negative: Teaching a Machine to Read Maps With Deep Reinforcement Learning The ability to use a 2D map to navigate a complex 3D environment is quite remarkable, and even difficult for many humans. Localization and navigation is also an important problem in domains such as robotics, and has recently become a focus of the deep reinforcement learning community. In this paper we teach a reinforcement learning agent to read a map in order to find the shortest way out of a random maze it has never seen before. Our system combines several state-of-theart methods such as A3C and incorporates novel elements such as a recurrent localization cell. Our agent learns to localize itself based on 3D first person images and an approximate orientation angle. The agent generalizes well to bigger mazes, showing that it learned useful localization and naviga-

negative: PTBI: An efficient privacy-preserving biometric identification based on perturbed term in the cloud Biometric identification has played an important role in achieving user authentication. For efficiency and economic savings, biometric data owners are motivated to outsource the biometric data and identification tasks to a third party, which however introduces potential threats to user’s privacy. In this paper, we propose a new privacy-preserving biometric identification scheme which can release the database owner from heavy computation burden. In the proposed scheme, we design concrete biometric data encryption and matching algorithms, and introduce perturb terms in each biometric data. A thorough analysis indicates that our schemes are secure, and the ultimate scheme offers a high level of privacy protection. In addition, the performance evaluations via extensive simulations demonstrate our schemes’ efficiency. © 2017 Elsevier Inc. All rights reserved.

negative: Anatomisation with slicing: a new privacy preservation approach for multiple sensitive attributes An enormous quantity of personal health information is available in recent decades and tampering of any part of this information imposes a great risk to the health care field. Existing anonymization methods are only apt for single sensitive and low dimensional data to keep up with privacy specifically like generalization and bucketization. In this paper, an anonymization technique is proposed that is a combination of the benefits of anatomization, and enhanced slicing approach adhering to the principle of k-anonymity and l-diversity for the purpose of dealing with high dimensional data along with multiple sensitive data. The anatomization approach dissociates the correlation observed between the quasi identifier attributes and sensitive attributes (SA) and yields two separate tables with non-overlapping attributes. In the enhanced slicing algorithm, vertical partitioning does the grouping of the correlated SA in ST together and thereby minimizes the dimensionality by employing the advanced clustering algorithm. In order to get the optimal size of buckets, tuple partitioning is conducted by MFA. The experimental outcomes indicate that the proposed method can preserve privacy of data with numerous SA. The anatomization approach minimizes the loss of information and slicing algorithm helps in the preservation of correlation and utility which in turn results in reducing the data dimensionality and information loss. The advanced clustering algorithms prove its efficiency by minimizing the time and complexity. Furthermore, this work sticks to the principle of k-anonymity, l-diversity and thus avoids privacy threats like membership, identity and attributes disclosure.

negative: SecureML: A System for Scalable Privacy-Preserving Machine Learning Machine learning is widely used in practice to produce predictive models for applications such as image processing, speech and text recognition. These models are more accurate when trained on large amount of data collected from different sources. However, the massive data collection raises privacy concerns. In this paper, we present new and efficient protocols for privacy preserving machine learning for linear regression, logistic regression and neural network training using the stochastic gradient descent method. Our protocols fall in the two-server model where data owners distribute their private data among two non-colluding servers who train various models on the joint data using secure two-party computation (2PC). We develop new techniques to support secure arithmetic operations on shared decimal numbers, and propose MPC-friendly alternatives to non-linear functions such as sigmoid and softmax that are superior to prior work. We implement our system in C++. Our experiments validate that our protocols are several orders of magnitude faster than the state of the art implementations for privacy preserving linear and logistic regressions, and scale to millions of data samples with thousands of features. We also implement the first privacy preserving system for training neural networks.

negative: An Entity-Centric Approach for Privacy and Identity Management in Cloud Computing Entities (e.g., users, services) have to authenticate themselves to service providers (SPs) in order to use their services. An entity provides personally identifiable information (PII) that uniquely identifies it to an SP. In the traditional application-centric Identity Management (IDM) model, each application keeps trace of identities of the entities that use it. In cloud computing, entities may have multiple accounts associated with different SPs, or one SP. Sharing PIIs of the same entity across services along with associated attributes can lead to mapping of PIIs to the entity. We propose an entity-centric approach for IDM in the cloud. The approach is based on: (1) active bundles—each including a payload of PII, privacy policies and a virtual machine that enforces the policies and uses a set of protection mechanisms to protect themselves, (2) anonymous identification to mediate interactions between the entity and cloud services using entity’s privacy policies. The main characteristics of the approach are: it is independent of third party, gives minimum information to the SP and provides ability to use identity data on untrusted hosts.

negative: Random projection-based multiplicative data perturbation for privacy preserving distributed data mining This paper explores the possibility of using multiplicative random projection matrices for privacy preserving distributed data mining. It specifically considers the problem of computing statistical aggregates like the inner product matrix, correlation coefficient matrix, and Euclidean distance matrix from distributed privacy sensitive data possibly owned by multiple parties. This class of problems is directly related to many other data-mining problems such as clustering, principal component analysis, and classification. This paper makes primary contributions on two different grounds. First, it explores independent component analysis as a possible tool for breaching privacy in deterministic multiplicative perturbation-based models such as random orthogonal transformation and random rotation. Then, it proposes an approximate random projection-based technique to improve the level of privacy protection while still preserving certain statistical characteristics of the data. The paper presents extensive theoretical analysis and experimental results. Experiments demonstrate that the proposed technique is effective and can be successfully used for different types of privacy-preserving data mining applications.

negative: Differentially Private Empirical Risk Minimization Privacy-preserving machine learning algorithms are crucial for the increasingly common setting in which personal data, such as medical or financial records, are analyzed. We provide general techniques to produce privacy-preserving approximations of classifiers learned via (regularized) empirical risk minimization (ERM). These algorithms are private under the ε-differential privacy definition due to Dwork et al. (2006). First we apply the output perturbation ideas of Dwork et al. (2006), to ERM classification. Then we propose a new method, objective perturbation, for privacy-preserving machine learning algorithm design. This method entails perturbing the objective function before optimizing over classifiers. If the loss and regularizer satisfy certain convexity and differentiability criteria, we prove theoretical results showing that our algorithms preserve privacy, and provide generalization bounds for linear and nonlinear kernels. We further present a privacy-preserving technique for tuning the parameters in general machine learning algorithms, thereby providing end-to-end privacy guarantees for the training process. We apply these results to produce privacy-preserving analogues of regularized logistic regression and support vector machines. We obtain encouraging results from evaluating their performance on real demographic and benchmark data sets. Our results show that both theoretically and empirically, objective perturbation is superior to the previous state-of-the-art, output perturbation, in managing the inherent tradeoff between privacy and learning performance.

negative: SMC: A Practical Schema for Privacy-Preserved Data Sharing over Distributed Data Streams Data collection is required to be safe and efficient considering both data privacy and system performance. In this paper, we study a new problem: distributed data sharing with privacy-preserving requirements. Given a data demander requesting data from multiple distributed data providers, the objective is to enable the data demander to access the distributed data without knowing the privacy of any individual provider. The problem is challenged by two questions: how to transmit the data safely and accurately; and how to efficiently handle data streams? As the first study, we propose a practical method, Shadow Coding, to preserve the privacy in data transmission and ensure the recovery in data collection, which achieves privacy preserving computation in a data-recoverable, efficient, and scalable way. We also provide practical techniques to make Shadow Coding efficient and safe in data streams. Extensive experimental study on a large-scale real-life dataset offers insight into the performance of our schema. The proposed schema is also implemented as a pilot system in a city to collect distributed mobile phone data.


query: Feature Extraction and Image Processing

positive: A Computational Approach to Edge Detection This paper describes a computational approach to edge detection. The success of the approach depends on the definition of a comprehensive set of goals for the computation of edge points. These goals must be precise enough to delimit the desired behavior of the detector while making minimal assumptions about the form of the solution. We define detection and localization criteria for a class of edges, and present mathematical forms for these criteria as functionals on the operator impulse response. A third criterion is then added to ensure that the detector has only one response to a single edge. We use the criteria in numerical optimization to derive detectors for several common image features, including step edges. On specializing the analysis to step edges, we find that there is a natural uncertainty principle between detection and localization performance, which are the two main goals. With this principle we derive a single operator shape which is optimal at any scale. The optimal detector has a simple approximate implementation in which edges are marked at maxima in gradient magnitude of a Gaussian-smoothed image. We extend this simple detector using operators of several widths to cope with different signal-to-noise ratios in the image. We present a general method, called feature synthesis, for the fine-to-coarse integration of information from operators at different scales. Finally we show that step edge detector performance improves considerably as the operator point spread function is extended along the edge.

positive: Medical Image Analysis: Progress over Two Decades and the Challenges Ahead ÐThe analysis of medical images has been woven into the fabric of the Pattern Analysis and Machine Intelligence (PAMI) community since the earliest days of these Transactions. Initially, the efforts in this area were seen as applying pattern analysis and computer vision techniques to another interesting dataset. However, over the last two to three decades, the unique nature of the problems presented within this area of study have led to the development of a new discipline in its own right. Examples of these include: the types of image information that are acquired, the fully three-dimensional image data, the nonrigid nature of object motion and deformation, and the statistical variation of both the underlying normal and abnormal ground truth. In this paper, we look at progress in the field over the last 20 years and suggest some of the challenges that remain for the years to come. Index TermsÐMedical imaging, medical image analysis, computer vision, image segmentation, image registration, nonrigid motion, deformable contours, image-guided surgery.

positive: Dynamic Programming for Detecting, Tracking, and Matching Deformable Contours Abstruct-The problem of segmenting an image into separate regions and tracking them over time is one of the most significant problems in vision. Tenopoulos et al have proposed an approach to detect the contour regions of complex shapes, assuming a user selected initial contour not very far from the desired solution. We propose to further explore the information provided by the user’s selected points and applyan optimal method to detect contours which allows a segmentation of the image. The method is based on dynamic programming @P), and applies to a wide variety of shapes. It is exact and not iterative. We also consider a multiscale approach capable of speeding up the algorithm by a factor of 20, although at the expense of losing the guaranteed optimality characteristic. The problem of tracking and matching these contours is addressed. For tracking, the final contour obtained at one frame is sampled and used as initial points for the next frame. Then, the same DP process is applied. For matching, a novel strategy is proposed where the solution is a smooth displacement field in which unmatched regions are allowed while cross vectors are not. The algorithm is again based on DP and the optimal solution is guaranteed. We have demonstrated the algorithms on natural objects in a large spectrum of applications, including interactive segmentation and automatic tracking of the regions of interest in medical images.

positive: Dynamic programming algorithm optimization for spoken word recognition This paper reports on an optimum dynamic programming (DP) based time-normalization algorithm for spoken word recognition. First, a general principle of time-normalization i s given using timewarping function. Then, two time-normalized distance definitions, d e d symmetric and asymmetric forms, are derived from the principle. These two forms are compared with each other through theoretical discussions and experimental studies. The symmetric form algorithm superiority is established. A new technique, called slope constraint, is successfully introduced, in which the warping function slope is restricted so as to improve discrimination between words in different categories. The effective slope constraint characteristic is qualitatively analyzed, and the optimum slope constraint condition is determined through experiments. The optimized algorithm is then extensively subjected to experimentat comparison with various DP-algorithms, previously applied to spoken word recognition by different research groups. The experiment shows that the present algorithm gives no more than about twothirds errors, even compared to the best conventional algorithm. I

positive: Using Dynamic Programming for Solving Variational Problems in Vision Variational approaches have been proposed for solving many inverse problems in early vision, such as in the computation of optical flow, shape from shading, and energy-minimizing active contour models. In general however, variational approaches do not guarantee global optimality of the solution, require estimates of higher order derivatives of the discrete data, and do not allow direct and natural enforcement of constraints. In this paper we discuss dynamic programming as a novel approach to solving variational problems in vision. Dynamic programming ensures global optimality of the solution, it is numerically stable, and it allows for hard constraints to be enforced on the behavior of the solution within a natural and straightforward structure. As a specific example of the efficacy of the proposed approach, application of dynamic programming to the energy-minimizing active contours is described. The optimization problem is set up as a discrete multistage decision process and is solved by a " time-delayed " discrete dynamic programming algorithm. A parallel procedure is discussed that can result in savings in computational costs.

negative: Humour Research: State of Art Humour is a multi-disciplinary field of research. People have been working on humour in many fields of research like psychology, philosophy and linguistics, sociology and literature. Especially in the context of computer science (or Artificial Intelligence) humour research aims at modeling humour in a computationally tractable way. Having computational models of humour allows interface designers to have the computer generate and interpret humour when interacting with users. There are many situations in human-human interaction where humour plays an important role in keeping the conversation going. Making use of the so-called CASA paradigm (Computers Are Social Actors) we may expect that a similar role can be played in human-computer interaction. In this report we survey current humour research with the aim to identify useful theories that can be applied in the human-computer interaction context. We focus on the following subjects: humour theories, related humour research, linguistic aspects of humour, computational aspects of humour, applications and resources. 1 University of Twente, Center of Telematics and Information Technology, Technical Report CTIT-02-34, September 2002, 24 pp.

negative: 2.4 GHz micro-strip patch antenna array with suppressed sidelobes In this paper, we present the design and simulated results for a patch antenna array at 2.4 GHz. The antenna consists of one linear array with six series-fed patch antennas. In radar and smart-antenna applications it is very important to use antennas with high gain and low sidelobes in order to avoid the interference and to increase the gain of antenna array. The aim of this research is to design an antenna array that has suppressed sidelobes as much as possible in azimuth by using Kaiser-Bessel amplitude coefficients. Our designed antenna has a gain of 15.1 dB with an angular width of 14.6° at a frequency of 2.4 GHz. The measured 10 dB return loss bandwidth equals 18.7 MHz. Patch antenna array is analyzed using CST MICROWAVE STUDIO 2014.

negative: Distinguishing Between Natural and Computer-Generated Images Using Convolutional Neural Networks Distinguishing between natural images (NIs) and computer-generated (CG) images by naked human eyes is difficult. In this paper, we propose an effective method based on a convolutional neural network (CNN) for this fundamental image forensic problem. Having observed the rather limited performance of training existing CCNs from scratch or fine-tuning pre-trained network, we design and implement a new and appropriate network with two cascaded convolutional layers at the bottom of a CNN. Our network can be easily adjusted to accommodate different sizes of input image patches while maintaining a fixed depth, a stable structure of CNN, and a good forensic performance. Considering the complexity of training CNNs and the specific requirement of image forensics, we introduce the so-called local-to-global strategy in our proposed network. Our CNN derives a forensic decision on local patches, and a global decision on a full-sized image can be easily obtained via simple majority voting. This strategy can also be used to improve the performance of existing methods that are based on hand-crafted features. Experimental results show that our method outperforms existing methods, especially in a challenging forensic scenario with NIs and CG images of heterogeneous origins. Our method also has good robustness against typical post-processing operations, such as resizing and JPEG compression. Unlike previous attempts to use CNNs for image forensics, we try to understand what our CNN has learned about the differences between NIs and CG images with the aid of adequate and advanced visualization tools.

negative: Content-based retrieval of logo and trademarks in unconstrained color image databases using Color Edge Gradient Co-occurrence Histograms In this paper, we present an algorithm that extends the Color Edge Co-occurrence Histogram (CECH) object detection scheme on compound color objects, for the retrieval of logos and trademarks in unconstrained color image databases. We introduce more accurate information to the CECH, by virtue of incorporating color edge detection using vector order statistics. This produces a more accurate representation of edges in color images, as compared to the simple color pixel difference classification of edges seen with the CECH. Our proposed method is thus reliant on edge gradient information, and so we call it the Color Edge Gradient Co-occurrence Histogram (CEGCH). We also introduce a color quantization method based in the hue–saturation–value (HSV) color space, illustrating that it is a more suitable scheme of quantization for image retrieval, compared to the color quantization scheme introduced with the CECH. Experimental results demonstrate that the CEGCH and the HSV color quantization scheme is insensitive to scaling, rotation, and partial deformations, and outperforms the use of the CECH in image retrieval, with higher precision and recall. We also perform experiments on a closely related algorithm based on the Color Co-occurrence Histogram (CCH) and demonstrate that our algorithm is also superior in comparison, with higher precision and recall. 2009 Elsevier Inc. All rights reserved.

negative: Limiting privacy breaches in privacy preserving data mining There has been increasing interest in the problem of building accurate data mining models over aggregate data, while protecting privacy at the level of individual records. One approach for this problem is to randomize the values in individual records, and only disclose the randomized values. The model is then built over the randomized data, after first compensating for the randomization (at the aggregate level). This approach is potentially vulnerable to privacy breaches: based on the distribution of the data, one may be able to learn with high confidence that some of the randomized records satisfy a specified property, even though privacy is preserved on average.In this paper, we present a new formulation of privacy breaches, together with a methodology, "amplification", for limiting them. Unlike earlier approaches, amplification makes it is possible to guarantee limits on privacy breaches without any knowledge of the distribution of the original data. We instantiate this methodology for the problem of mining association rules, and modify the algorithm from [9] to limit privacy breaches without knowledge of the data distribution. Next, we address the problem that the amount of randomization required to avoid privacy breaches (when mining association rules) results in very long transactions. By using pseudorandom generators and carefully choosing seeds such that the desired items from the original transaction are present in the randomized transaction, we can send just the seed instead of the transaction, resulting in a dramatic drop in communication and storage cost. Finally, we define new information measures that take privacy breaches into account when quantifying the amount of privacy preserved by randomization.

negative: Minimum elastic bounding box algorithm for dimension detection of 3D objects: a case of airline baggage measurement Motivated by the interference of appendages in airline baggage dimension detection using three-dimensional (3D) point cloud, a minimum elastic bounding box (MEBB) algorithm for dimension detection of 3D objects is developed. The baggage dimension measurements using traditional bounding box method or shape fitting method can cause large measurements due to the interference of appendages. Starting from the idea of ‘enclosing’, an elastic bounding box model with the deformable surface is established. On the basis of using principal component analysis to obtain the main direction of the bounding box, the elastic rules for deformable surfaces are developed so as to produce a large elastic force when it comes into contact with the main body part and to produce a small elastic force when it comes into contact with the appendages part. The airline baggage measurement shows how to use MEBB for dimension detection, especially for the processing of isotropic density distribution, the elasticity computing and the adaptive adjustment of elasticity. Results on typical baggage samples, comparisons to other methods, and error distribution experiments with different algorithm parameters show that the authors’ method can reliably obtain the size of the main body part of the object under the interference of appendages.

negative: A systematic literature review: Information security culture Human behavior inside organizations is considered the main threat to organizations. Moreover, in information security the human element consider the most of weakest link in general. Therefore it is crucial to create an information security culture to protect the organization's assets from inside and to influence employees' security behavior. This paper focuses on identifying the definitions and frameworks for establishing and maintaining information security culture inside organizations. It presents work have been done to conduct a systematic literature review of papers published on information security culture from 2003 to 2016. The review identified 68 papers that focus on this area, 18 of which propose an information security culture framework. An analysis of these papers indicate there is a positive relationship between levels of knowledge and how employees behave. The level of knowledge significantly affects information security behavior and should be considered as a critical factor in the effectiveness of information security culture and in any further work that is carried out on information security culture. Therefore, there is a need for more studies to identity the security knowledge that needs to be incorporated into organizations and to find instances of best practice for building an information security culture within organizations.

negative: Sample Preparation on Micro-Electrode-Dot-Array Digital Microfluidic Biochips Sample preparation in digital microfluidics refers to the generation of droplets with target concentrations for onchip biochemical applications. In recent years, digital microfluidic biochips (DMFBs) have been adopted as a platform for sample preparation. However, there remain one major problem associated with sample preparation on a conventional DMFB. For conventional DMFBs, only a (1:1) mixing/splitting model can be used, leading to an increase in the number of fluidic operations required for sample preparation. To overcome the drawback, we adopt a next generation DMFB platform, referred to as micro-electrode-dot-array (MEDA), for sample preparation. We propose the first sample preparation method that exploits the MEDA-specific advantages of fine-grained control of droplet sizes and real-time droplet sensing. Experimental demonstration using a fabricated MEDA biochip and simulation results highlight the effectiveness of the proposed sample-preparation method.

negative: Ratio estimators in simple random sampling This study proposes ratio estimators by adapting the estimators type ofRay and Singh [J. Ind. Stat. Assoc. 19 (1981) 147] to traditional and the other ratio-type estimators in simple random sampling in literature. Theoretically, mean square error (MSE) equations of all proposed ratio estimators are obtained and compared with each other. By these comparisons the conditions, which make each proposed estimator more efficient than the others, are found. The theoretical results are supported by a numerical illustration. 2003 Elsevier Inc. All rights reserved.

negative: A Novel Approach for Brain Tumor Detection Using Support Vector Machine , K-Means and PCA Algorithm The conventional method of detection and classification of brain tumor is by human inspection with the use of medical resonant brain images. But it is impractical when large amounts of data is to be diagnosed and to be reproducible. And also the operator assisted classification leads to false predictions and may also lead to false diagnose. Medical Resonance images contain a noise caused by operator performance which can lead to serious inaccuracies classification. The use Support Vector Machine, Kmean and PCA shown great potential in this field. Principal Component Analysis gives fast and accurate tool for Feature Extraction of the tumors. Kmean is used for Image Segmentation. Support Vector Mahine with Training and Testing of Brain Tumor Images techniques is implemented for automated brain tumor classification.

negative: Self-tuning fuzzy PID controller for electro-hydraulic cylinder Hydraulic systems are widely used in industrial applications. This is due to its high speed of response with fast start, stop and speed reversal possible. The torque to inertia ratio is also large with resulting high acceleration capability. The nonlinear properties of hydraulic cylinder make the position tracking control design challenging. This paper presents the development and implementation of self-tuning fuzzy PID controller in controlling the position variation of electro-hydraulic actuator. The hydraulic system mathematical model is approximated using system identification technique. The simulation studies were done using Matlab Simulink environment. The output performance was compared with the design using pole-placement controller. The roots mean squared error for both techniques showed that self-tuning Fuzzy PID produced better result compared to using pole-placement controller.

negative: SNAP and SPAN: Towards Dynamic Spatial Ontology We propose a modular ontology of the dynamic features of reality. This amounts, on the one hand, to a purely spatial ontology supporting snapshot views of the world at successive instants of time and, on the other hand, to a purely spatiotemporal ontology of change and process. We argue that dynamic spatial ontology must combine these two distinct types of inventory of the entities and relationships in reality, and we provide characterizations of spatiotemporal reasoning in the light of the interconnections between them.

negative: MaxMax: A Graph-Based Soft Clustering Algorithm Applied to Word Sense Induction This paper introduces a linear time graph-based soft clustering algorithm. The algorithm applies a simple idea: given a graph, vertex pairs are assigned to the same cluster if either vertex has maximal affinity to the other. Clusters of varying size, shape, and density are found automatically making the algorithm suited to tasks such Word Sense Induction (WSI), where the number of classes is unknown and where class distributions may be skewed. The algorithm is applied to two WSI tasks, obtaining results comparable with those of systems adopting existing, state-of-the-art methods.

negative: A study of success and failure in product innovation: The case of the U.S. electronics industry This paper summarizes the first phase of the Stanford Innovation Project, a long-term study of U.S. industrial innovation. As part of this initial phase, begun in 1982, two surveys were conducted: 1) an open-ended survey of 158 new products in the electronics industry, followed by 2) a structured survey of 118 of the original products. Both surveys used a pairwise comparison methodology. Our research identified eight broad areas that appear to be important for new product success in a high-technology environment: 1) market knowledge gained through frequent and intense customer interaction, which leads to high benefit-to-cost products; 2) and 3) planning and coordination of the new product process, especially the R&D phase; 4) emphasis on marketing and sales; 5) management support for the product throughout the development and launch stages; 6) the contribution margin of the product; 7) early market entry; 8) proximity of the new product technologies and markets to the existing strengths of the developing unit. Based on these results, a preliminary model of the new product process is proposed in the concluding section. There is nothing more difficult to plan, more doubtful of success, nor more dangerous to manage than the creation of a new system. Niccolo Machiavelli.

negative: Fundamentals of Parameterized Complexity It's not surprisingly when entering this site to get the book. One of the popular books now is the fundamentals of parameterized complexity. You may be confused because you can't find the book in the book store around your city. Commonly, the popular book will be sold quickly. And when you have found the store to buy the book, it will be so hurt when you run out of it. This is why, searching for this popular book in this website will give you benefit. You will not run out of this book.

negative: Supporting Iterative Cohort Construction with Visual Temporal Queries Many researchers across diverse disciplines aim to analyze the behavior of cohorts whose behaviors are recorded in large event databases. However, extracting cohorts from databases is a difficult yet important step, often overlooked in many analytical solutions. This is especially true when researchers wish to restrict their cohorts to exhibit a particular temporal pattern of interest. In order to fill this gap, we designed COQUITO, a visual interface that assists users defining cohorts with temporal constraints. COQUITO was designed to be comprehensible to domain experts with no preknowledge of database queries and also to encourage exploration. We then demonstrate the utility of COQUITO via two case studies, involving medical and social media researchers.

negative:
Pseudo test collections for training and tuning microblog rankers Recent years have witnessed a persistent interest in generating pseudo test collections, both for training and evaluation purposes. We describe a method for generating queries and relevance judgments for microblog search in an unsupervised way. Our starting point is this intuition: tweets with a hashtag are relevant to the topic covered by the hashtag and hence to a suitable query derived from the hashtag. Our baseline method selects all commonly used hashtags, and all associated tweets as relevance judgments; we then generate a query from these tweets. Next, we generate a timestamp for each query, allowing us to use temporal information in the training process. We then enrich the generation process with knowledge derived from an editorial test collection for microblog search.
 We use our pseudo test collections in two ways. First, we tune parameters of a variety of well known retrieval methods on them. Correlations with parameter sweeps on an editorial test collection are high on average, with a large variance over retrieval algorithms. Second, we use the pseudo test collections as training sets in a learning to rank scenario. Performance close to training on an editorial test collection is achieved in many cases. Our results demonstrate the utility of tuning and training microblog search algorithms on automatically generated training material.

negative: Design and implementation of embedded Web server based on arm and Linux This paper achieves the design of an embedded Web server, which takes ARM920T-S3c2410s chip as its core and Linux as its operating system. This is because Linux can be reduced and transplanted. The method used to transplant Web server Boa on the embedded Linux platform is also discussed in detail, and through CGI technology functions of dynamic Web page is successfully realized. Relevant experiments show that after the Web server is embedded into the network video monitoring system, dynamic page interaction can be achieved between the Web server and the embedded system via the browser in the Windows environment.

negative: Simulation of Automotive Radar Target Lists using a Novel Approach of Object Representation The development of radar signal processing algorithms for target tracking and higher-level automotive applications is mainly done based on real radar data. A data basis has to be acquired during cost-expensive and time-consuming test runs. For a comparably simple application like the adaptive cruise control (ACC), the variety of significant traffic situations can sufficiently be covered by test runs. But for more advanced applications like intersection assistance, the effort for the acquisition of a representative set of radar data will be unbearable. In this paper, we propose a way of simulating radar target lists in a realistic but computationally undemanding way, which will allow to significantly reduce the amount of real radar data needed

negative: Computer-Aided Diagnosis of Mammographic Masses Using Scalable Image Retrieval Computer-aided diagnosis of masses in mammograms is important to the prevention of breast cancer. Many approaches tackle this problem through content-based image retrieval techniques. However, most of them fall short of scalability in the retrieval stage, and their diagnostic accuracy is, therefore, restricted. To overcome this drawback, we propose a scalable method for retrieval and diagnosis of mammographic masses. Specifically, for a query mammographic region of interest (ROI), scale-invariant feature transform (SIFT) features are extracted and searched in a vocabulary tree, which stores all the quantized features of previously diagnosed mammographic ROIs. In addition, to fully exert the discriminative power of SIFT features, contextual information in the vocabulary tree is employed to refine the weights of tree nodes. The retrieved ROIs are then used to determine whether the query ROI contains a mass. The presented method has excellent scalability due to the low spatial-temporal cost of vocabulary tree. Extensive experiments are conducted on a large dataset of 11 553 ROIs extracted from the digital database for screening mammography, which demonstrate the accuracy and scalability of our approach.

negative:
HOPE: Enabling Efficient Service Orchestration in Software-Defined Data Centers The functional scope of today's software-defined data centers (SDDC) has expanded to such an extent that servers face a growing amount of critical background operational tasks like load monitoring, logging, migration, and duplication, etc. These ancillary operations, which we refer to as management operations, often nibble the stringent data center power envelope and exert a tremendous amount of pressure on front-end user tasks. However, existing power capping, peak shaving, and time shifting mechanisms mainly focus on managing data center power demand at the "macro level" -- they do not distinguish ancillary background services from user tasks, and therefore often incur significant performance degradation and energy overhead.
 In this study we explore "micro-level" power management in SDDC: tuning a specific set of critical loads for the sake of overall system efficiency and performance. Specifically, we look at management operations that can often lead to resource contention and energy overhead in an IaaS SDDC. We assess the feasibility of this new power management paradigm by characterizing the resource and power impact of various management operations. We propose HOPE, a new system optimization framework for eliminating the potential efficiency bottleneck caused by the management operations in the SDDC. HOPE is implemented on a customized OpenStack cloud environment with heavily instrumented power infrastructure. We thoroughly validate HOPE models and optimization efficacy under various user workload scenarios. Our deployment experiences show that the proposed technique allows SDDC to reduce energy consumption by 19%, reduce management operation execution time by 25.4%, and in the meantime improve workload performance by 30%.

negative: E-commerce web page classification based on automatic content extraction Currently, There are many E-commerce websites around the internet world. These E-commerce websites can be categorized into many types which one of them is C2C (Customer to Customer) websites such as eBay and Amazon. The main objective of C2C websites is an online market place that everyone can buy or sell anything at any time. Since, there are a lot of products in the E-commerce websites and each product are classified into its category by human. It is very hard to define their categories in automatic manner when the data is very large. In this paper, we propose the method for classifying E-commerce web pages based on their product types. Firstly, we apply the proposed automatic content extraction to extract the contents of E-commerce web pages. Then, we apply the automatic key word extraction to select words from these extracted contents for generating the feature vectors that represent the E-commerce web pages. Finally, we apply the machine learning technique for classifying the E-commerce web pages based on their product types. The experimental results signify that our proposed method can classify the E-commerce web pages in automatic fashion.

negative: Improved churn prediction in telecommunication industry using data mining techniques

negative: Non-linear Feedback Neural Network for Solution of Quadratic Programming Problems This paper presents a recurrent neural circuit for solving quadratic programming problems. The objective is tominimize a quadratic cost function subject to linearconstraints. The proposed circuit employs non-linearfeedback, in the form of unipolar comparators, to introducetranscendental terms in the energy function ensuring fastconvergence to the solution. The proof of validity of the energy function is also provided. The hardware complexity of the proposed circuit comparesfavorably with other proposed circuits for the same task. PSPICE simulation results arepresented for a chosen optimization problem and are foundto agree with the algebraic solution.

negative: A Named Entity Recognition Shootout for German • CRF-based methods: • StanfordNER [4]: CRF + standard features • GermaNER [5]: CRF + distributional semantics, gazetteers, ... • Recurrent Neural Network: • BiLSTM + CRF [6] using characterand word embeddings using FastText • Wikipedia (contemporary encyclopedia) • Europeana (historic newspaper from 1703 to 1899) Conclusion & Future Contemporary corpora: minor improvements GermEval: 82.93 à 82.93 CoNLL: 82.99 à 84.73 Historic corpora: major improvements LFT: 69.62 à 73.44 ONB: 70.46 à 78.56 Same setup as Exp. 2 but with transfer learning and considering only the BiLSTM-based method

negative: Classification of Brain Cancer using Artificial Neural Network A Brain Cancer Detection and Classification System has been designed and developed. The system uses computer based procedures to detect tumor blocks or lesions and classify the type of tumor using Artificial Neural Network in MRI images of different patients with Astrocytoma type of brain tumors. The image processing techniques such as histogram equalization, image segmentation, image enhancement, morphological operations and feature extraction have been developed for detection of the brain tumor in the MRI images of the cancer affected patients. The extraction of texture features in the detected tumor has been achieved by using Gray Level Co-occurrence Matrix (GLCM). These features are compared with the stored features in the Knowledge Base. Finally a Neuro Fuzzy Classifier has been developed to recognize different types of brain cancers. The whole system has been tested in two phases firstly Learning/Training Phase and secondly Recognition/Testing Phase. The known MRI images of affected brain cancer patients obtained from Radiology Department of Tata Memorial Hospital (TMH) were used to train the system. The unknown samples of brain cancer affected MRI images are also obtained from TMH and were used to test the system. The system was found efficient in classification of these samples and responds any abnormality.

negative: Cotton Leaf Spot Diseases Detection Utilizing Feature Selection with Skew Divergence Method This research work exposes the novel approach of analysis at existing works based on machine vision system for the identification of the visual symptoms of Cotton crop diseases, from RGB images. Diseases regions of cotton crops are revealed in digital pictures, Which were amended and segmented. In this work Proposed Enhanced PSO feature selection method adopts Skew divergence method and user features like Edge,Color,Texture variances to extract the features. Set of features was extracted from each of them. The extracted feature was input to the SVM, Back propagation neural network (BPN),Fuzzy with Edge CYMK color feature and GA feature selection. Tests were performed to identify the best classification model. It has been hypothesized that from the given characteristics of the images, there should be a subset of features more informative of the image domain.To test this hypothesis, three classification models were assessed via crossvalidation. To Evaluate its efficiency of six types of diseases have been accurately classified like Bacterial Blight, Fusariumwilt, Leaf Blight, Root rot, Micro Nurient, Verticilium Wilt.The Experimental results obtained show that the robust feature vector set which is an Enhancement of a feature extraction method (EPSO) has been afforded the performance assessment of this system. Keywords— SVM, BPN, Fuzzy, CMYK and Edge Features, Genetic Algorithm, Cotton leaf data sets., Enhance Particle swarm optimization, Skew divergences features. I. Introduct ion Data mining is the process of extracting patterns from the data and to transform raw data into information.. It is commonly utilized in a broad range of profiling practices, such as marketing, surveillance, fraud detection, agriculture environment and scientific discovery. Among other things, the most prominent features of data mining techniques are clustering and predictive. The benefits of data mining are its capability to gain deeper perceptive of the patterns using current available exposure capabilities . In this work categorization of the cotton leaf diseases are done using data mining with image processing techniques. The main target is to identify the disease in the leaf spot of the cotton crops. In this regard, It is discussed that about 80 to 90 percentage disease on the Cotton crops are on its leaf spot [1]. Consequently areas of interest is that identifying the leaf of the cotton tree rather than whole cotton plant the cotton leaf is mostly suffered from diseases like fungus, virus, Foliar leaf spot of cotton, Alternaria leaf spot of cotton. The machine visualization system right now is usually contained on computer, digital camera and application software. Various kinds of algorithms are incorporated in the application software. Image processing analysis is one significant method that helps to segment the image into objects and background. One of the key steps in image analysis is feature detection.Plant disease reduces the production and quality of food, fiber and biofuel crops. Image processing has fascinated many researchers in the area of pattern recognition and technique combined with data mining are applied to trace out the leaf spots from the of plant leaves, which helps in diagnosing the cotton leaf spot diseases accurately The image processing techniques are extensively applied to agricultural science, and it has great perspective, especially in the plant protection field, which ultimately leads to crop management. Image analysis can be applied for the following purposes: 1. To detect diseased leaf, stem, fruit, root 2. To enumerate affected area by disease. 3. To find the boundaries of the affected area. A moreover leaf spot is a major component of the crops [2]. The diseases can be easily recognized with the help of the polluted vicinity of the crop. Usually the leaves will naturally going to focus the impure part in a clear way which can be easily identified. Generally by naked eyes we can easily identify the infected region. So we can say the transform in the crop color is the imperative feature for the notification. When the health of the crop is in good stage then the color of the crop is dissimilar but as soon as the crop is going to affected by some harming pathogens, the color transforms automatically. Crop diseases have turned into a dilemma because it may cause a diminution in productivity [3]. In this research work described that goal of identifying foliar diseases in cotton plantations. The primary goal of the developed system has been to identify the existence of pathogens in cotton fillers. Once a disease is identified it has to be automatically classified through further processing of the corresponding image. A survey conducted in one of south zone particular Tamil Nadu at Andhiyur district. During the investigation congregate from the farmers' side gathered the suggestion about the cotton crop diseases details. In this work organized about the Section 2. Literature survey, Section 3. Motivation, Problem Analysis, Section 4. Material and Methods, Section 5. Comparative studies, Section 6. Result and Discussion, Section 7. Conclusion and Acknowledgment, References. II. Literature Survey The proposed work describes about the diagnosis of cotton leaves using various approaches suggesting that the various implementation ways as illustrated and discussed below. Hui Li et al., in the year 2011 has been implemented the Web-Based Intelligent Diagnosis System for Cotton Diseases Control system the author proposed a BP neural network for his system. International Journal of Scientific Engineering and Technology (ISSN : 2277-1581) Volume No.3, Issue No.1 pp : 22-30 1 Jan 2014 IJSET@2014 Page 23 A research scheme was designed for the system test, in which 80 samples, including 8 main species of diseases, 10 samples in each sort were included. The result showed the rate of correctness that system could identify the symptom was 89.5% in average, and the average running time for a diagnosis was 900ms [4].Yan Cheng Zhang et al., ( 2007 ) proposed fuzzy feature selection approach fuzzy curves (FC) and fuzzy surfaces (FS) – to select features and classification of cotton disease levels. [5]. Syed A. Health et al., In this research work discussed about the automated system that can identify the pest and disease affecting parts such as cotton leaf, boll or flower. In this work proposed a CMYK based image cleaning technique to remove shadows, hands and other impurities from images. The outcomes are tested over a database consisting of 600 images to classify the presented image as a leaf, boll or flower [6]. Bernardes A. A. et al., ( 2011) proposed method for automatic classification of cotton diseases through feature extraction of leaf symptoms from digital images. Wavelet transform energy has been used for feature extraction while SVM has been used for classification. The image set of supposedly adulterated leaves was classified within one of the four other sub-classes, namely: MA, RA, AS, and NONE. Finally obtained were: 96.2% accuracy for the SA class, 97.1% accuracy for the MA class, 80% accuracy for the RA class, and 71.4% accuracy for the AS class [7]. Meunkaewjinda. A, et al., (2008). In his work the cotton leaf disease segmentation is performed using modified self organizing feature map with genetic algorithms for optimization and support vector machines for classification. Finally, the resulting segmented image is filtered by Gabor wavelet which allows the system to analyze leaf disease color features more efficiently [8]. Gulhane. V. A et al. (2011) This work described Self organizing feature map together with a back-propagation neural network is used to recognize the color of the image. Finally find out the classification of the cotton diseases [9]. Viraj A. Gulhane. e tal., (2012).This proposed work addresses about the disease analysis is possible for the cotton leaf disease recognition, the analysis of the various diseases present on the cotton leaves can be effectively detected in the early stage before it will injure the whole crops, initially we can be able to detect three types of diseases of the cotton leaves by the methodology of Eigen feature regularization and extraction technique. In this method 90% of detection of Red spot i.e. fungal disease is detected, it is most dangerous disease; it can highly affect the productivity of the cotton crop in more extent. And if it detects in early stage we can say that, we able to make better manufacture [10]. Qinghai He et al., (2013). In this paper the author described RGB color model, HIS color model, and YCbCr color model for extracting the injured image from cotton leaf images were developed.. The ratio of damage (γ) was chosen as feature to measure the degree of damage which caused by diseases or pests. In this work shows the comparison of the results obtained by implementing in different color models, the comparison of outcomes shows good accuracy in both color models and YCbCr color space is considered as the best color model for extracting the damaged image [11]. III. Motivation This research work address on solving various problems like boosting up the precision rates and diminish the error rates using the Proposed Enhanced PSO which make use of Skew divergences to calculate the features correctly from the image.This method increases the accuracy and reduce the information gap to farmers. Creating a complicated agricultural environment to support the farmers to easily identify the diseases and get control of it using the Pest Recommendation module.  Deployed the automatic disease classification processes using advanced Data mining and Image processing techniques.  Augment the profit and safety of the farmer’s life and diminish their burden.  Time consuming (less).  Enhance the economic status of our country. Problem Credentials  Ancient days crop disease identification process through the laboratory condition.  However, this requires continuou

negative: Road Extraction Using SVM and Image Segmentation In this paper, a unique approach for road extraction utilizing pixel spectral information for classification and image segmentation-derived object features was developed. In this approach, road extraction was performed in two steps. In the first step, support vector machine (SVM) was employed merely to classify the image into two groups of categories: a road group and a non-road group. For this classification, support vector machine (SVM) achieved higher accuracy than Gaussian maximum likelihood (GML). In the second step, the road group image was segmented into geometrically homogeneous objects using a region growing technique based on a similarity criterion, with higher weighting on shape factors over spectral criteria. A simple thresholding on the shape index and density features derived from these objects was performed to extract road features, which were further processed by thinning and vectorization to obtain road centerlines. The experiment showed the proposed approach worked well with images comprised by both rural and urban area features. Introduction Road information not only plays a central role in the transportation application, but also is an important data layer in Geographical Information Systems (GIS). Automated road extraction can save time and labor to a great degree in updating a road spatial database. Various road extraction approaches have been developed. Xiong (2001) grouped these methods into five categories: ridge finding, heuristic reasoning, dynamic programming, statistical inference, and map matching. In ridge finding, edge operators are performed on images to derive edge magnitude and direction, followed by a thresholding and thinning process to obtain ridge pixels (Nevatia and Babu, 1980; Treash and Amaratunga, 2000). Alternatively, gradient direction profile analysis can be performed to generate edge pixels (Gong and Wang, 1997). Ridge points are linked to produce the road segments. Heuristic reasoning is a knowledge-based method in which a series of pre-set rules on road characteristics such as shape index, the distance between image primitives, fragments trend, and contextual information are employed to detect and connect image primitives or antiparallel linear edges to road segments (McKeown, et al., 1985; Zhu and Yeh, 1986). In the dynamic programming method, roads are modeled with a set of mathematical equations on the derivatives of gray values and select characteristics of roads, such as smooth curves, homogeneous surface, narrow linear features, and relatively constant width. Dynamic programming is employed to solve the optimization problem Road Extraction Using SVM and Image Segmentation Mingjun Song and Daniel Civco (Gruen and Li, 1995). In the statistical inference method, linear features are modeled as a Markov point process or a geometric-stochastic model on the road width, direction, intensity and background intensity, and maximum a posteriori probability is used to estimate the road network (Barzohar and Cooper, 1996; Stoica, et al., 2000). In a map matching method, existing road maps are used as starting point to update the road network. In general, two steps are involved: first, a mapimage matching algorithm is employed to match the roads on the map to the image; second, new roads are searched based on the assumption that they are connected to existing roads (Stilla, 1995). Xiong’s classification on road extraction methods is only a generalization, and some other methods may combine different techniques. Active contour models, known as snakes, are also used in road extraction (Gruen and Li, 1997; Agouris, et al., 2001). A snake is a spline with minimized energy driven by internal spline and external image forces (Park, et al., 2001). In general, external image forces are represented by the gradient magnitude of an image, which attracts snakes to contours with strong edges. Internal forces are given by a continuity term and a curvature term expressed by the differences of adjacent snaxels, which are vertex nodes of the snake, with weights coming from training data, which control the shape and smoothness of the snakes. Through the optimization, the snake evolves from its initial position to desired position with minimized energy. Park and Kim (2001) used template matching to extract road segments in which a road template was formed around the road seed, and an adaptive least squares matching algorithm was used to detect a target window with similar transformation. This method assumes a small difference in brightness values between template and target windows. Most of these road extraction methods require some road seeds as starting points, which are in general provided by users, and road segments evolve under a certain model. Sometimes control points are needed to correct the evolution of roads (Zhao, et al., 2002). Further, these methods use black-and-white aerial photographs or the panchromatic band of high-resolution satellite images and therefore the geometric characteristics of roads alone play a critical role. Boggess (1993) used a classification method incorporating texture and neural networks to extract roads by classifying roads and other features from Landsat TM imagery, but obtained numerous false-inclusions. Roberts, et al. (2001) developed a spectral mixture library using hyperspectral images to extract roads, but the use of spectral information alone does not capture the spatial properties of these curvilinear features. P H OTO G R A M M E T R I C E N G I N E E R I N G & R E M OT E S E N S I N G December 2004 1 3 6 5 Center for Land use Education and Research, Department of Natural Resources Management and Engineering, The University of Connecticut U-4087, 1376 Storrs Road, Storrs, CT 06269-4087 (mingjun.song@uconn.edu, daniel.civco@ uconn.edu). Photogrammetric Engineering & Remote Sensing Vol. 70, No. 12, December 2004, pp. 1365–1371. 0099-1112/04/7012–1365/$3.00/0 © 2004 American Society for Photogrammetry and Remote Sensing LFX-536.qxd 11/9/04 16:13 Page 1365

negative: Real time Sign Language Recognition using PCA The Sign Language is a method of communication for deaf-dumb people. This paper presents the Sign Language Recognition system capable of recognizing 26 gestures from the Indian Sign Language by using MATLAB. The proposed system having four modules such as: pre-processing and hand segmentation, feature extraction, sign recognition and sign to text and voice conversion. Segmentation is done by using image processing. Different features are extracted such as Eigen values and Eigen vectors which are used in recognition. The Principle Component Analysis (PCA) algorithm was used for gesture recognition and recognized gesture is converted into text and voice format. The proposed system helps to minimize communication barrier between deaf-dumb people and normal people.

negative: Automatic Sublingual Vein Feature Extraction System The quintessence of the diagnosis in traditional Chinese medicine is syndrome differentiation and treatment. Syndrome differentiation consists of four methods: observing, hearing as well as smelling, asking, and touching. The examination of the observing is the most important procedure in the method of "tongue." In recent years, numerous medical studies have identified the close relations between sublingual veins and human organs. Therefore, sublingual pathological symptoms, as well as demographical information of patients, imply pathological changes in the organs, and early diagnosis is beneficial for early treatment. However, the diagnosis of sublingual pathological symptoms is usually influenced by the doctor's subjective interpretation, experience, and environmental factors. The results can easily be limited by subjective factors such as knowledge, experience, mentality, diagnostic techniques, color perception and interpretation. Different doctors may make different judgments on the same tongue, presenting less than desirable repeatability. Therefore, assisting doctors' diagnoses with scientific methods and standardizing the differentiating process to obtain reliable diagnoses and enhance the clinical applicability of Chinese medicine is an important issue. In its wake, this study aims to construct an Automatic Sublingual Vein Feature Extraction System based on image processing technologies to allow objective and quantified computer readings. The extraction of sublingual vein features mainly captures the back of the tongue and extract the sublingual vein area for feature expression analysis. Firstly, the patient's back of the tongue is photographed and color-graded to compensate for color distortion, and then the tongue-back area is extracted. This study extracts tongue-back imagery by analyzing the RGB color expression of the back of the tongue, lips, teeth and skin, translating it into the HSI color space easily perceived by the human eye, along with skin area removal, rectangle detection, teeth area removal, black area removal and control point detection. The captured tongue-back image goes through histogram equalization and hue shift to enhance color contrast. Sublingual veins are extracted through analyzing RGB color component shift, hues, saturation and brightness. Then the sublingual vein color information and positioning are used to differentiate hues, lengths and branches. Thinning analysis is used to determine the presence of varicose veins. At the same time, the surrounding features of sublingual veins, such as columnar vein, bubbly vein, petechiae and bloodshot, are extracted. The information regarding features and lingual vein conditions are integrated and analyzed for doctors' clinical reference. This study utilizes 199 lingual images for statistic testing and three lingual diagnostic experts in Chinese medicine for lingual reading. The accuracy for the extractions are: tongue back 86%, sublingual vein 80%, varicose veins 90%, branches 87%, and the accuracy rates for columnar veins and bubbly veins are 87%, 88% and 73% respectively.

negative: On HMM static hand gesture recognition A real time static isolated gesture recognition application using a Hidden Markov Model approach with features extracted from gestures' silhouettes is presented. Nine different hand poses with various degrees of rotation are considered. The system, both simple and effective, uses color images of the hands to be recognized directly from the camera and is capable of processing 23 frames per second on a Quad Core Intel Processor.

negative: AUTOMATIC BLOOD VESSEL SEGMENTATION IN COLOR IMAGES OF RETINA Automated image processing techniques have the ability to assist in the early detection of diabetic retinopathy disease which can be regarded as a manifestation of diabetes on the retina. Blood vessel segmentation is the basic foundation while developing retinal screening systems, since vessels serve as one of the main retinal landmark features. This paper proposes an automated method for identification of blood vessels in color images of the retina. For every image pixel, a feature vector is computed that utilizes properties of scale and orientation selective Gabor filters. The extracted features are then classified using generative Gaussian mixture model and discriminative support vector machines classifiers. Experimental results demonstrate that the area under the receiver operating characteristic (ROC) curve reached a value 0.974, which is highly comparable and, to some extent, higher than the previously reported ROCs that range from 0.787 to 0.961. Moreover, this method gives a sensitivity of 96.50% with a specificity of 97.10% for identification of blood vessels. Keywords– Retinal blood vessels, Gabor filters, support vector machines, vessel segmentation