query: Embodiment of abstract concepts: good and bad in right- and left-handers.

positive: Does Language Shape Thought?: Mandarin and English Speakers' Conceptions of Time Does the language you speak affect how you think about the world? This question is taken up in three experiments. English and Mandarin talk about time differently--English predominantly talks about time as if it were horizontal, while Mandarin also commonly describes time as vertical. This difference between the two languages is reflected in the way their speakers think about time. In one study, Mandarin speakers tended to think about time vertically even when they were thinking for English (Mandarin speakers were faster to confirm that March comes earlier than April if they had just seen a vertical array of objects than if they had just seen a horizontal array, and the reverse was true for English speakers). Another study showed that the extent to which Mandarin-English bilinguals think about time vertically is related to how old they were when they first began to learn English. In another experiment native English speakers were taught to talk about time using vertical spatial terms in a way similar to Mandarin. On a subsequent test, this group of English speakers showed the same bias to think about time vertically as was observed with Mandarin speakers. It is concluded that (1) language is a powerful tool in shaping thought about abstract domains and (2) one's native language plays an important role in shaping habitual thought (e.g., how one tends to think about time) but does not entirely determine one's thinking in the strong Whorfian sense.

positive: Metaphoric structuring: understanding time through spatial metaphors The present paper evaluates the claim that abstract conceptual domains are structured through metaphorical mappings from domains grounded directly in experience. In particular, the paper asks whether the abstract domain of time gets its relational structure from the more concrete domain of space. Relational similarities between space and time are outlined along with several explanations of how these similarities may have arisen. Three experiments designed to distinguish between these explanations are described. The results indicate that (1) the domains of space and time do share conceptual structure, (2) spatial relational information is just as useful for thinking about time as temporal information, and (3) with frequent use, mappings between space and time come to be stored in the domain of time and so thinking about time does not necessarily require access to spatial schemas. These findings provide some of the first empirical evidence for Metaphoric Structuring. It appears that abstract domains such as time are indeed shaped by metaphorical mappings from more concrete and experiential domains such as space.

positive: Human simulations of vocabulary learning The work reported here experimentally investigates a striking generalization about vocabulary acquisition: Noun learning is superior to verb learning in the earliest moments of child language development. The dominant explanation of this phenomenon in the literature invokes differing conceptual requirements for items in these lexical categories: Verbs are cognitively more complex than nouns and so their acquisition must await certain mental developments in the infant. In the present work, we investigate an alternative hypothesis; namely, that it is the information requirements of verb learning, not the conceptual requirements, that crucially determine the acquisition order. Efficient verb learning requires access to structural features of the exposure language and thus cannot take place until a scaffolding of noun knowledge enables the acquisition of clause-level syntax. More generally, we experimentally investigate the hypothesis that vocabulary acquisition takes place via an incremental constraint-satisfaction procedure that bootstraps itself into successively more sophisticated linguistic representations which, in turn, enable new kinds of vocabulary learning. If the experimental subjects were young children, it would be difficult to distinguish between this information-centered hypothesis and the conceptual change hypothesis. Therefore the experimental "learners" are adults. The items to be "acquired" in the experiments were the 24 most frequent nouns and 24 most frequent verbs from a sample of maternal speech to 18-24-month-old infants. The various experiments ask about the kinds of information that will support identification of these words as they occur in mother-to-child discourse. Both the proportion correctly identified and the type of word that is identifiable changes significantly as a function of information type. We discuss these results as consistent with the incremental construction of a highly lexicalized grammar by cognitively and pragmatically sophisticated human infants, but inconsistent with a procedure in which lexical acquisition is independent of and antecedent to syntax acquisition.

positive: Why Nouns Are Learned before Verbs: Linguistic Relativity Versus Natural Partitioning. Technical Report No. 257. ABSTRACT There is overwhelming evidence that children's first words are primarily nouns even across languages. These data are interpreted as evidence of a "Natural Partitions Theory," one that holds that the concepts referred to by nouns are conceptually more basic than those referred to by verbs or prepositions. Analysis of data from cross-linguistic studies designed to eliminate Inonconceptual differences between words in a language that might account for the Larlier acquisition of nouns--such as the position of a word in the sentence, morphological transparency (the ease with which the root can be heard in various uses of the word), and patterns of language teaching strategies--leaves some version of the Natural Partitions hypothesis as the most reasonable view of early vocabulary acquisition. A cross-linguistic examination of a single sentence suggests that if objecthood is created by spatial relations among perceptual elements, then good concrete objects are particularly cohesive collections of percepts. These highly cohesive collections of perceptual information tend to be lexicalized as nouns by almost every language. Object concepts are given to language users by the world and can be learned one at a time, while predicate concepts form a system in each language., that, from a child's point of view, must be discovered. (HTE)

positive: FROM SIMPLE ASSOCIATIONS TO SYSTEMATIC REASONING : A Connectionist representation of rules , variables , and dynamic bindings using temporal synchrony Human agents draw a variety of inferences effortlessly, spontaneously, and with remarkable efficiency — as though these inferences are a reflex response of their cognitive apparatus. Furthermore, these inferences are drawn with reference to a large body of background knowledge. This remarkable human ability seems paradoxical given the results about the complexity of reasoning reported by researchers in artificial intelligence. It also poses a challenge for cognitive science and computational neuroscience: How can a system of simple and slow neuron-like elements represent a large body of systematic knowledge and perform a range of inferences with such speed? We describe a computational model that is a step toward addressing the cognitive science challenge and resolving the artificial intelligence paradox. We show how a connectionist network can encode millions of facts and rules involving n-ary predicates and variables, and perform a class of inferences in a few hundred msec. Efficient reasoning requires the rapid representation and propagation of dynamic bindings. Our model achieves this by i) representing dynamic bindings as the synchronous firing of appropriate nodes, ii) rules as interconnection patterns that direct the propagation of rhythmic activity, iii) and long-term facts as temporal pattern-matching sub-networks. The model is consistent with recent neurophysiological findings which suggest that synchronous activity occurs in the brain and may play a representational role in neural information processing. The model also makes specific predictions about the nature of reflexive reasoning that are psychologically significant. It identifies constraints on the form of rules that may participate in such reasoning and relates the capacity of the working memory underlying reflexive reasoning to biological parameters such as the lowest frequency at which nodes can sustain synchronous oscillations and the coarseness of synchronization.

negative: Zero-Shot Adaptive Transfer for Conversational Language Understanding Conversational agents such as Alexa and Google Assistant constantly need to increase their language understanding capabilities by adding new domains. A massive amount of labeled data is required for training each new domain. While domain adaptation approaches alleviate the annotation cost, prior approaches suffer from increased training time and suboptimal concept alignments. To tackle this, we introduce a novel Zero-Shot Adaptive Transfer method for slot tagging that utilizes the slot description for transferring reusable concepts across domains, and enjoys efficient training without any explicit concept alignments. Extensive experimentation over a dataset of 10 domains relevant to our commercial personal digital assistant shows that our model outperforms previous state-of-the-art systems by a large margin, and achieves an even higher improvement in the low data regime.

negative: Type Checking Type Classes We study the type inference problem for a system with type classes as in the functional programming language Haskell. Type classes are an extension of ML-style polymorphism with overloading. We generalize Milner's work on polymorphism by introducing a separate context constraining the type variables in a typing judgement. This lead to simple type inference systems and algorithms which closely resemble those for ML. In particular we present a new unification algorithm which is an extension of syntactic unification with constraint solving. The existence of principal types follows from an analysis of this unification algorithm.

negative: Gender violence: transgender experiences with violence and discrimination. There is a pervasive pattern of discrimination and prejudice against transgendered people within society. Both economic discrimination and experiencing violence could be the result of a larger social climate that severely sanctions people for not conforming to society's norms concerning gender; as such, both would be strongly associated with each other. Questionnaires were distributed to people either through events or through volunteers, and made available upon the World Wide Web. A sample of 402 cases was collected over the span of 12 months (April 1996-April 1997). We found that over half the people within this sample experienced some form of harassment or violence within their lifetime, with a quarter experiencing a violent incident. Further investigation found that experiencing economic discrimination because one is transgendered had the strongest association with experiencing a transgender related violent incident. Economic discrimination was related to transgendered people's experience with violence. Therefore, both hate crimes legislation and employment protections are needed for transgendered individuals.

negative:
WeChecker: efficient and precise detection of privilege escalation vulnerabilities in Android apps Due to the rapid increase of Android apps and their wide usage to handle personal data, a precise and large-scaling checker is in need to validate the apps' permission flow before they are listed on the market. Several tools have been proposed to detect sensitive data leaks in Android apps. But these tools are not applicable to large-scale analysis since they fail to deal with the arbitrary execution orders of different event handlers smartly. Event handlers are invoked by the framework based on the system state, therefore we cannot pre-determine their order of execution. Besides, since all exported components can be invoked by an external app, the execution orders of these components are also arbitrary. A naive way to simulate these two types of arbitrary execution orders yields a permutation of all event handlers in an app. The time complexity is O(n!) where n is the number of event handlers in an app. This leads to a high analysis overhead when n is big. To give an illustration, CHEX [10] found 50.73 entry points of 44 unique class types in an app on average. In this paper we propose an improved static taint analysis to deal with the challenge brought by the arbitrary execution orders without sacrificing the high precision. Our analysis does not need to make permutations and achieves a polynomial time complexity. We also propose to unify the array and map access with object reference by propagating access paths to reduce the number of false positives due to field-insensitivity and over approximation of array access and map access.
 We implement a tool, WeChecker, to detect privilege escalation vulnerabilities [7] in Android apps. WeChecker achieves 96% precision and 96% recall in the state-of-the-art test suite DriodBench (for compairson, the precision and recall of FlowDroid [1] are 86% and 93%, respectively). The evaluation of WeChecker on real apps shows that it is efficient (average analysis time of each app: 29.985s) and fits for large-scale checking.

negative: Latent Fingerprint Matching: Fusion of Manually Marked and Derived Minutiae Matching unknown latent fingerprints lifted from crime scenes to full (rolled or plain) fingerprints in law enforcement databases is of critical importance for combating crime and fighting terrorism. Compared to good quality full fingerprints acquired using live-scan or inking methods during enrollment, latent fingerprints are often smudgy and blurred, capture only a small finger area, and have large nonlinear distortion. For this reason, features (minutiae and singular points) in latents are typically manually marked by trained latent examiners. However, this introduces an undesired interoperability problem between latent examiners and automatic fingerprint identification systems (AFIS); the features marked by examiners are not always compatible with those automatically extracted by AFIS, resulting in reduced matching accuracy. While the use of automatically extracted minutiae from latents can avoid interoperability problem, such minutiae tend to be very unreliable, because of the poor quality of latents. In this paper, we improve latent to full fingerprint matching accuracy by combining manually marked (ground truth) minutiae with automatically extracted minutiae. Experimental results on a public domain database, NIST SD27, demonstrate the effectiveness of the proposed algorithm.

negative: A New Feature for Automatic Speaker Verification Anti-Spoofing: Constant Q Cepstral Coefficients Efforts to develop new countermeasures in order to protect automatic speaker verification from spoofing have intensified over recent years. The ASVspoof 2015 initiative showed that there is great potential to detect spoofing attacks, but also that the detection of previously unforeseen spoofing attacks remains challenging. This paper argues that there is more to be gained from the study of features rather than classifiers and introduces a new feature for spoofing detection based on the constant Q transform, a perceptually-inspired time-frequency analysis tool popular in the study of music. Experimental results obtained using the standard ASVspoof 2015 database show that, when coupled with a standard Gaussian mixture model-based classifier, the proposed constant Q cepstral coefficients (CQCCs) outperform all previously reported results by a significant margin. In particular, those for a subset of unknown spoofing attacks (for which no matched training data was used) is 0.46%, a relative improvement of 72% over the best, previously reported results.

negative: Coco-Q: Learning in Stochastic Games with Side Payments Coco (“cooperative/competitive”) values are a solution concept for two-player normalform games with transferable utility, when binding agreements and side payments between players are possible. In this paper, we show that coco values can also be defined for stochastic games and can be learned using a simple variant of Q-learning that is provably convergent. We provide a set of examples showing how the strategies learned by the Coco-Q algorithm relate to those learned by existing multiagent Q-learning algorithms.

negative: The standard operating procedure of the DOE-JGI Microbial Genome Annotation Pipeline (MGAP v.4) The DOE-JGI Microbial Genome Annotation Pipeline performs structural and functional annotation of microbial genomes that are further included into the Integrated Microbial Genome comparative analysis system. MGAP is applied to assembled nucleotide sequence datasets that are provided via the IMG submission site. Dataset submission for annotation first requires project and associated metadata description in GOLD. The MGAP sequence data processing consists of feature prediction including identification of protein-coding genes, non-coding RNAs and regulatory RNA features, as well as CRISPR elements. Structural annotation is followed by assignment of protein product names and functions.

negative: Deep Learning with Sets and Point Clouds We study a simple notion of structural invariance that readily suggests a parameter-sharing scheme in deep neural networks. In particular, we define structure as a collection of relations, and derive graph convolution and recurrent neural networks as special cases. We study composition of basic structures in defining models that are invariant to more complex “product” structures such as graph of graphs, sets of images or sequence of sets. For demonstration, our experimental results are focused on the setting where the discrete structure of interest is a set. We present results on several novel and non-trivial problems on sets, including point-cloud classification, set outlier detection and semi-supervised learning using clustering information.

negative: Integration of Standardized and Non-Standardized Product Data Smart products adapt to environments, process contexts, users and other products. Standardized product data such as BMECat, eCl@ss, and EPC global formats are designed to support the exploitation of product data and therefore contribute to more efficient supply chains. Non-standardized product data mainly target soft benefits which targets the exploration of product data [Su04]. We present an extended product data model (SPDO) that integrates standardized and non-standardized product data. The SPDO model consists of five product information types that receive product data and, if available, associated explicit semantics. Explicit semantics are used for advanced services, such as compatibility testing or product bundling. Exemplified by the GS1 approach, we present how standardized product data is retrieved via RFID-based Electronic Product Codes (EPC) and stored in SPDO instantiations.

negative: Cognitive radio network security: A survey Recent advancements in wireless communication are creating a spectrum shortage problem on a daily basis. Recently, Cognitive Radio (CR), a novel technology, has attempted to minimize this problem by dynamically using the free spectrum in wireless communications and mobile computing. Cognitive radio networks (CRNs) can be formed using cognitive radios by extending the radio link features to network layer functions. The objective of CRN architecture is to improve the whole network operation to fulfil the user’s demands anytime and anywhere, through accessing CRNs in a more efficient way, rather than by just linking spectral efficiency. CRNs are more flexible and exposed to wireless networks compared with other traditional radio networks. Hence, there are many security threats to CRNs, more so than other traditional radio environments. The unique characteristics of CRNs make security more challenging. Several crucial issues have not yet been investigated in the area of security for CRNs. A typical public key infrastructure (PKI) scheme which achieves secure routing and other purposes in typical ad hoc networks is not enough to guarantee the security of CRNs under limited communication and computation resources. However, there has been increasing research attention on security threats caused specifically by CR techniques and special characteristics of CR in CRNs. Therefore, in this research, a survey of CRNs and their architectures and security issues has been carried out in a broad

negative: The possibility of predicting learning performance using features of note taking activities and instructions in a blended learning environment A formative assessment was introduced to a blended learning course in order to predict participant’s learning performance using measurements of their note taking activity and metrics of their attitudes. The lexical metrics were created by analyzing the contents of student’s notes from every class, and by measuring their characteristics. In the results of two types of regression analysis of these measurements, features of note taking activities were a significant source of information for predicting the scores of final exams. In regards to temporal changes in prediction performance during the course, the progress of learning and the typical changes in features of note taking activity were discussed. During the analyses, the effectiveness of the lecturer’s note taking instructions was also confirmed.

negative: Mining Social Science Publications for Survey Variables Research in Social Science is usually based on survey data where individual research questions relate to observable concepts (variables). However, due to a lack of standards for data citations a reliable identification of the variables used is often difficult. In this paper, we present a work-in-progress study that seeks to provide a solution to the variable detection task based on supervised machine learning algorithms, using a linguistic analysis pipeline to extract a rich feature set, including terminological concepts and similarity metric scores. Further, we present preliminary results on a small dataset that has been specifically designed for this task, yielding a significant increase in performance over the random baseline.

negative: Polygonal boundary approximation for a 2D general sweep based on envelope and boolean operations This paper presents an algorithm that approximates (using polygons) the boundary of a general sweep for an arbitrary 2D curved object (possibly with holes). Based on set-theoretic properties of the general sweep, our algorithm generates the polygonal sweep boundary incrementally, where envelope approximations and union operations are repeatedly applied to intermediate boundaries of the sweep and consecutive instances of the moving object at sampled locations of the motion. For approximation, each instance of the object is polygonized along the motion, where the object may experience dynamic shape transformation with topological changes such as creating and /or destroying internal holes. The incremental nature of the proposed algorithm makes the boundary construction of a general sweep useful for applications in interactive shape design, collision detection, and mechanical part design. Our algorithm generates a precise approximation of the boundary of a general sweep with real-time performance in computing unsweeps, Minkowski sums and differences, and constant radius offsets. Some experimental results are also given in this paper.

negative: Multivariate lattices for encrypted image processing Images are inherently sensitive signals that require privacy-preserving solutions when processed in an untrusted environment, but their efficient encrypted processing is particularly challenging due to their structure and size. This work introduces a new cryptographic hard problem called m-RLWE (multivariate Ring Learning with Errors) extending RLWE. It gives support to lattice cryptosystems that allow for encrypted processing of multidimensional signals. We show an example cryptosystem and prove that it outperforms its RLWE counterpart in terms of security against basis-reduction attacks, efficiency and cipher expansion for encrypted image processing.

negative:
Epigenetics and depression: return of the repressed. INTRODUCTION
Epigenetics has recently emerged as a potential mechanism by which adverse environmental stimuli can result in persistent changes in gene expression. Epigenetic mechanisms function alongside the DNA sequence to modulate gene expression and ultimately influence protein production. The current review provides an introduction and overview of epigenetics with a particular focus on preclinical and clinical studies relevant to major depressive disorder (MDD).

METHODS
PubMed and Web of Science databases were interrogated from January 1995 up to December 2012 using combinations of search terms, including "epigenetic", "microRNA" and "DNA methylation" cross referenced with "depression", "early life stress" and "antidepressant".

RESULTS
There is an association between adverse environmental stimuli, such as early life stress, and epigenetic modification of gene expression. Epigenetic changes have been reported in humans with MDD and may serve as biomarkers to improve diagnosis. Antidepressant treatments appear to reverse or initiate compensatory epigenetic alterations that may be relevant to their mechanism of action.

LIMITATIONS
As a narrative review, the current report was interpretive and qualitative in nature.

CONCLUSION
Epigenetic modification of gene expression provides a mechanism for understanding the link between long-term effects of adverse life events and the changes in gene expression that are associated with depression. Although still a developing field, in the future, epigenetic modifications of gene expression may provide novel biomarkers to predict future susceptibility and/or onset of MDD, improve diagnosis, and aid in the development of epigenetics-based therapies for depression.

negative: Assessing attractiveness in online dating profiles Online dating systems play a prominent role in the social lives of millions of their users, but little research has considered how users perceive one another through their personal profiles. We examined how users perceive attractiveness in online dating profiles, which provide their first exposure to a potential partner. Participants rated whole profiles and profile components on such qualities as how attractive, extraverted, and genuine and trustworthy they appeared. As past research in the psychology of attraction would suggest, the attractiveness and other qualities of the photograph were the strongest predictors of whole profile attractiveness, but they were not alone: the free-text component also played an important role in predicting overall attractiveness. In turn, numerous other qualities predicted the attractiveness ratings of photos and free-text components, albeit in different ways for men and women. The fixed-choice elements of a profile, however, were unrelated to attractiveness.

negative: Survey of Authentication and Authorization for the Internet of Things The Internet of Things is currently getting significant interest from the scientific community. Academia and industry are both focused on moving ahead in attempts to enhance usability, maintainability, and security through standardization and development of best practices.We focus on security because of its impact as one of themost limiting factors to wider Internet ofThings adoption. Numerous research areas exist in the security domain, ranging from cryptography to network security to identitymanagement.This paper provides a survey of existing research applicable to the Internet of Things environment at the application layer in the areas of identity management, authentication, and authorization. We survey and analyze more than 200 articles, categorize them, and present current trends in the Internet of Things security domain.

negative: Measuring the perceived quality of an AR-based learning application: a multidimensional model Augmented reality (AR) technologies could enhance learning in several ways. The quality of an AR-based educational platform is a combination of key features that manifests in usability, usefulness, and enjoyment for the learner. In this paper, we present a multidimensional model to measure the quality of an AR-based application as perceived by students. The model is specified by a second-order factor (perceived quality) and three dimensions: ergonomic quality, learning quality, and hedonic quality. The purpose of this model is to embody previous research into a coherent framework for the evaluation of AR-based educational platforms and to provide guidance for researchers and practitioners. The model was empirically validated on a Chemistry learning scenario and the results confirm the importance of both the learning and hedonic quality. ARTICLE HISTORY Received 23 July 2014 Revised 2 December 2015 Accepted 9 December 2015

negative: Explainable Prediction of Medical Codes from Clinical Text Clinical notes are text documents that are created by clinicians for each patient encounter. They are typically accompanied by medical codes, which describe the diagnosis and treatment. Annotating these codes is labor intensive and error prone; furthermore, the connection between the codes and the text is not annotated, obscuring the reasons and details behind specific diagnoses and treatments. We present an attentional convolutional network that predicts medical codes from clinical text. Our method aggregates information across the document using a convolutional neural network, and uses an attention mechanism to select the most relevant segments for each of the thousands of possible codes. The method is accurate, achieving precision@8 of 0.71 and a Micro-F1 of 0.54, which are both better than the prior state of the art. Furthermore, through an interpretability evaluation by a physician, we show that the attention mechanism identifies meaningful explanations for each code assignment.

negative: Content-based approach for Vietnamese spam SMS filtering Short Message Service (SMS) spam is a serious problem in Vietnam because of the availability of very cheap prepaid SMS packages. There are some systems to detect and filter spam messages for English, most of which use machine learning techniques to analyze the content of messages and classify them. For Vietnamese, there is some research on spam email filtering but none focused on SMS. In this work, we propose the first system for filtering Vietnamese spam SMS. We first propose an appropriate preprocessing method since existing tools for Vietnamese preprocessing cannot give good accuracy on our dataset. We then experiment with vector representations and classifiers to find the best model for this problem. Our system achieves an accuracy of 94% when labelling spam messages while the misclassification rate of legitimate messages is relatively small, about only 0.4%. This is an encouraging result compared to that of English and can be served as a strong baseline for future development of Vietnamese SMS spam prevention systems.

negative: Predictive coding: a fresh view of inhibition in the retina. Interneurons exhibiting centre--surround antagonism within their receptive fields are commonly found in peripheral visual pathways. We propose that this organization enables the visual system to encode spatial detail in a manner that minimizes the deleterious effects of intrinsic noise, by exploiting the spatial correlation that exists within natural scenes. The antagonistic surround takes a weighted mean of the signals in neighbouring receptors to generate a statistical prediction of the signal at the centre. The predicted value is subtracted from the actual centre signal, thus minimizing the range of outputs transmitted by the centre. In this way the entire dynamic range of the interneuron can be devoted to encoding a small range of intensities, thus rendering fine detail detectable against intrinsic noise injected at later stages in processing. This predictive encoding scheme also reduces spatial redundancy, thereby enabling the array of interneurons to transmit a larger number of distinguishable images, taking into account the expected structure of the visual world. The profile of the required inhibitory field is derived from statistical estimation theory. This profile depends strongly upon the signal: noise ratio and weakly upon the extent of lateral spatial correlation. The receptive fields that are quantitatively predicted by the theory resemble those of X-type retinal ganglion cells and show that the inhibitory surround should become weaker and more diffuse at low intensities. The latter property is unequivocally demonstrated in the first-order interneurons of the fly's compound eye. The theory is extended to the time domain to account for the phasic responses of fly interneurons. These comparisons suggest that, in the early stages of processing, the visual system is concerned primarily with coding the visual image to protect against subsequent intrinsic noise, rather than with reconstructing the scene or extracting specific features from it. The treatment emphasizes that a neuron's dynamic range should be matched to both its receptive field and the statistical properties of the visual pattern expected within this field. Finally, the analysis is synthetic because it is an extension of the background suppression hypothesis (Barlow & Levick 1976), satisfies the redundancy reduction hypothesis (Barlow 1961 a, b) and is equivalent to deblurring under certain conditions (Ratliff 1965).

negative: A survey of Agent-Oriented Software Engineering Agent-Oriented Software Engineering is the one of the most recent contributions to the field of Software Engineering. It has several benefits compared to existing development approaches, in particular the ability to let agents represent high-level abstractions of active entities in a software system. This paper gives an overview of recent research and industrial applications of both general high-level methodologies and on more specific design methodologies for industry-strength software engineering.

negative: Raimond: Quantitative Data Extraction from Twitter to Describe Events Social media play a decisive role in communicating and spreading information during global events. In particular, real-time microblogging platforms such as Twitter have become prevalent. Researchers have used microblogging for a number of tasks, including past events analysis, predictions, and information retrieval. Nevertheless, little attention has been given to quantitative data extraction. In this paper, we address two questions: can we develop a mechanism to extract quantitative data from a collection of tweets, and can we use the salient findings to describe an event? To answer the first question, we introduce Raimond, a virtual text curator, specialized in quantitative data extraction from Twitter. To address the second question, we use our system on three events and evaluate its output using a crowdsourcing strategy. We demonstrate the e↵ectiveness of our approach with a number of real world examples.

negative: A novel ultra low power temperature sensor for UHF RFID tag chip A novel ultra low power temperature sensor for UHF RFID tag chip is presented. The sensor consists of a constant pulse generator, a temperature related oscillator, a counter and a bias. Conversion of temperature to digital output is fulfilled by counting the number of the clocks of the temperature related oscillator in a constant pulse period. The sensor uses time domain comparing, where high power consumption bandgap voltage references and traditional ADCs arc not needed. The sensor is realized in a standard 0.18 mum CMOS process, and the area is only 0.2 mm2. The accuracy of the temperature sensor is plusmn1degC after calibration. The power consumption of the sensor is only 0.9 muW.

negative: Digital Image Processing Image defects which could be caused by the digitization process or by faults in the imaging set-up (for example, bad lighting) can be corrected using Image Enhancement techniques. Once the image is in good condition, the Measurement Extraction operations can be used to obtain useful information from the image. Course Objectives “Introduction to Digital Image Processing” is two-day hands-on course that provide fundamental concepts and techniques for digital image processing and the software principles used in their practical implementation.

negative: Nonreciprocal Phase-Shift Composite Right/Left Handed Microstrip Lines Using Ferrite-Rod-Embedded Substrate Nonreciprocal phase-shift composite right/left handed transmission lines with small nonreciprocity in the amplitude of the transmission coefficients are proposed. The present structures are composed of a microstrip line periodically loaded with series capacitance and shunt inductance, and a ferrite rectangular rod is embedded in the dielectric substrate just below the center strip. The balanced composite right/left handed transmission line with nonreciprocal phase characteristics is designed. The numerical simulation results validate that the nonreciprocity in magnitude of the transmission coefficients is negligibly small whereas the nonreciprocity in the phase is still kept relatively large for the present configuration.

negative: A Dual-Band Dual-Circular-Polarization Antenna for Ka-Band Satellite Communications A novel Ka-band dual-band dual-circularly-polarized antenna array is presented in this letter. A dual-band antenna with left-hand circular polarization for the Ka-band downlink frequencies and right-hand circular polarization for the Ka-band uplink frequencies is realized with compact annular ring slots. By applying the sequential rotation technique, a 2 × 2 subarray with good performance is obtained. This letter describes the design process and presents simulation and measurement results.

negative: Evaluation of the Minstrel rate adaptation algorithm in IEEE 802.11g WLANs Rate adaptation varies the transmission rate of a wireless sender to match the wireless channel conditions, in order to achieve the best possible performance. It is a key component of IEEE 802.11 wireless networks. Minstrel is a popular rate adaptation algorithm due to its efficiency and availability in commonly used wireless drivers. However, despite its popularity, little work has been done on evaluating the performance of Minstrel or comparing it to the performance of fixed rates. In this paper, we conduct an experimental study that compares the performance of Minstrel against fixed rates in an IEEE 802.11g testbed. The experiment results show that whilst Minstrel performs reasonably well in static wireless channel conditions, in some cases the algorithm has difficulty selecting the optimal data rate in the presence of dynamic channel conditions. In addition, Minstrel performs well when the channel condition improves from bad quality to good quality. However, Minstrel has trouble selecting the optimal rate when the channel condition deteriorates from good quality to bad quality.

negative: Prediction of Hard Drive Failures via Rule Discovery from AutoSupport Data The ability to accurately predict an impending hard disk failure is important for reliable storage system design. The facility provided by most hard drive manufacturers, called S.M.A.R.T. (selfmonitoring, analysis and reporting technology), has been shown by current research to have poor predictive value. The problem of finding alternatives to S.M.A.R.T. for predicting disk failure is an area of active research. In this paper, we present a rule discovery methodology, and show that it is possible to construct decision support systems that can detect such failures using information recorded in the AutoSupport database. We demonstrate the effectiveness of our system by evaluating it on disks that were returned to NetApp from the field. Our evaluation shows that our system can be tuned either to have a high failure detection rate (i.e., classify a bad disk as bad) or to have a low false alarm rate (i.e., not classify a good disk as bad). Further, our rule-based classifier generates rules that are intuitive and easy to understand, unlike black box techniques.

negative: A new generation of microwave bandpass filters using multilayer ring resonators A new generation of compact microwave bandpass filters (BPF) is proposed. The filters are based on multilayer ring resonators (MRR) technique which is applicable to both narrow band and ultra-wideband (UWB) bandpass filters. This class of filters has very compact circuit size and simple structure for fabrication. Multiple attenuation poles exist and can be simply placed to the left or right of the passband. The dimensions of the filters can be designed to around 2 mm × 2 mm × 1 mm. Out of the five filters presented, two of them are fabricated and measured. Good agreement between the simulation and measurements confirmed the design approach.

negative: Decoding as Continuous Optimization in Neural Machine Translation In this work, we propose a novel decoding approach for neural machine translation (NMT) based on continuous optimisation. The resulting optimisation problem can then be tackled using a whole range of continuous optimisation algorithms which have been developed and used in the literature mainly for training. Our approach is general and can be applied to other sequence-to-sequence neural models as well. We make use of this powerful decoding approach to intersect an underlying NMT with a language model, to intersect left-to-right and right-to-left NMT models, and to decode with soft constraints involving coverage and fertility of the source sentence words. The experimental results show the promise of the proposed framework.


query: Universal upper and lower bounds on energy of spherical designs

positive: Necessary Conditions for Existence of Some Designs in Polynomial Metric Spaces Let M be a metric space with a finite diameter D and a finite normalized measure μM. Let the Hilbert space L2(M) of complex-valued functions be decomposed into a countable (whenM is infinite) or finite (with D+ 1 members whenM is finite) direct sum of mutually orthogonal subspaces L2(M) = V0 ⊕ V1 ⊕ · · · (V0 is the space of constant functions). We denote N = D + 1 ifM is finite and N = ∞ otherwise. In definition and description of the notion of polynomial metric spaces we follow [26, 27].

positive: On Maximal Spherical Codes I We investigate the possibilities for attaining two Levenshtein upper bounds for spherical codes. We find the distance distributions of all codes meeting these bounds. Then we show that the fourth Levenshtein bound can be attained in some very special cases only. We prove that no codes with an irrational maximal scalar product meet the third Levenshtein bound. So in dimensions 3 ≤ n ≤ 100 exactly seven codes are known to attain this bound and ten cases remain undecided. Moreover, the first two codes (in dimensions 5 and 6) are unique up to isometry. Nonexistence of maximal codes in all dimensions n with cardinalities between 2n+1 and 2n+ [7 √ n ] is shown as well. We prove nonexistence of several infinite families of maximal codes whose maximal scalar product is rational. The distance distributions of the only known nontrivial infinite family of maximal codes (due to Levenshtein) are given.

positive: Interpolation and approximation in L2(gamma) Assume a standard Brownian motion W = (Wt )t∈[0,1], a Borel function f : R → R such that f (W1) ∈ L2, and the standard Gaussian measure on the real line. We characterize that f belongs to the Besov space B 2,q ( ) := (L2( ), D1,2( )) ,q , obtained via the real interpolation method, by the behavior of aX(f (X1); ) := ‖f (W1)−P Xf (W1)‖L2 , where =(ti )ni=0 is a deterministic time net and P X : L2 → L2 the orthogonal projection onto a subspace of ‘discrete’stochastic integrals x0+ ∑n i=1 vi−1(Xti −Xti−1) with X being the Brownian motion or the geometric Brownian motion. By using Hermite polynomial expansions the problem is reduced to a deterministic one. The approximation numbers aX(f (X1); ) can be used to describe the L2-error in discrete time simulations of the martingale generated by f (W1) and (in stochastic finance) to describe the minimal quadratic hedging error of certain discretely adjusted portfolios. © 2006 Elsevier Inc. All rights reserved.

positive: On Maximal Codes in Polynominal Metric Spaces

positive: Nonexistence of Certain Spherical Designs of Odd Strengths and Cardinalities A sphericalτ -design onSn−1 is a finite set such that, for all polynomials f of degree at most τ , the average of over the set is equal to the average of f over the sphere Sn−1. In this paper we obtain some necessary conditions for the existence of designs of odd strengths and cardinalities. This gives nonexistence results in many cases. Asymptotically, we derive a bound which is better than the corresponding estimation ensured by the Delsarte– Goethals–Seidel bound. We consider in detail the strengths τ = 3 andτ = 5 and obtain further nonexistence results in these cases. When the nonexistence argument does not work, we obtain bounds on the minimum distance of such designs.

negative: Image Steganography based on a Parameterized Canny Edge Detection Algorithm Steganography is the science of hiding digital information in such a way that no one can suspect its existence. Unlike cryptography which may arouse suspicions, steganography is a stealthy method that enables data communication in total secrecy. Steganography has many requirements, the foremost one is irrecoverability which refers to how hard it is for someone apart from the original communicating parties to detect and recover the hidden data out of the secret communication. A good strategy to guaranteeirrecoverability is to cover the secret data not usinga trivial method based on a predictable algorithm, but using a specific random pattern based on a mathematical algorithm. This paper proposes an image steganography technique based on theCanny edge detection algorithm. It is designed to hide secret data into a digital image within the pixels that make up the boundaries of objects detected in the image. More specifically, bits of the secret data replace the three LSBs of every color channel of the pixels detected by the Canny edge detection algorithm as part of the edges in the carrier image. Besides, the algorithm is parameterized by three parameters: The size of the Gaussian filter, a low threshold value, and a high threshold value. These parameters can yield to different outputs for the same input image and secret data. As a result, discovering the inner-workings of the algorithm would be considerably ambiguous, misguiding steganalysts from the exact location of the covert data. Experiments showed a simulation tool codenamed GhostBit, meant to cover and uncover secret data using the proposed algorithm. As future work, examining how other image processing techniques such as brightness and contrast adjustment can be taken

negative: Comparative analysis of master-slave latches and flip-flops for high-performance and low-power systems In this paper, we propose a set of rules for consistent estimation of the real performance and power features of the flip-flop and master–slave latch structures. A new simulation and optimization approach is presented, targeting both highperformance and power budget issues. The analysis approach reveals the sources of performance and power-consumption bottlenecks in different design styles. Certain misleading parameters have been properly modified and weighted to reflect the real properties of the compared structures. Furthermore, the results of the comparison of representative master–slave latches and flipflops illustrate the advantages of our approach and the suitability of different design styles for high-performance and low-power applications.

negative: Dual-band microstrip antenna for WiMAX applications using complementary split ring resonators A new design of dual-band microstrip antenna is presented in this paper using metamaterial concept. By etching a metamaterial unit cells that have a resonance frequency of 5.3 GHz within the ground plane of a conventional patch resonates at 3.6 GHz, a dual resonance response is created to satisfy the requirement of covering the middle and upper bands of Wi-MAX.A detailed study of the placement of the unit cell is introduced and the most suitable one is chosen to be the place of our unit cell. Multi-unit cell concept is used for performance enhancement of the fabricated design to achieve a good matching with the simulated one.

negative: A Two-Level Investigation of Information Systems Outsourcing O UTSOURCING is the contracting of various systems to outside information systems (IS) vendors. Ever since the Eastman Kodak--IBM partnership was reported in 1989 [15], outsourcing has emerged and has been recognized as a key method of managing IS. In previous studies of outsourcing [4, 5, 12, 15, 17, 20], two gaps are noticeable. The first relates to the fact that requirements for outsourcing are not uniform, and managers have different approaches to the process. Yet most previous research studies have phrased their inquiries unidimensionally in terms of the extent or degree of outsourcing: either as a binary variable or as size of contract in terms of the percentage of total IS budget [5, 15]. Neither unidimensional gauge is sufficiently expressive; neither allows representation of diverse patterns of outsourcing. Second, even though the IS industry had not used the term “outsourcing” explicitly in the past, outsourcing is not a new concept and has existed for many years in one form or another. Even though firms have repetitively used outside vendors for years, researchers have neither considered prior relationships in their studies of IS outsourcing nor studied the intentions of client firms to continue the partnership with the outsourcing vendors in the future. In this study, IS outsourcing decisions are investigated at two levels. The first level deals with the initial outsourcing decision of client firms. The second level pertains to the intention to continue the relationships with current outsourcing vendors in the future. The following three research questions are explored at these two levels (in contrast to the singlelevel approach taken by most researchers): • What are the dimensions of outsourcing decisions? Two dimensions, extent of substitution by vendors and strategic impact of IS applications, are proposed in order to conceptualize the diverse types of outsourcing relationships between clients and vendors. Based on these two dimensions, four types of outsourcing relationships are proposed. • What are the determinants that affect the dimensions of outsourcing decisions at the first level? The concepts derived from incomplete contracts [2, 9] and transactions cost economics [23, 24] theory are used with information technology (IT) organizational contexts and processes as a foundation to study the determinants of the two dimensions of outsourcing decisions. Information Syst

negative: Design of Low Actuation Voltage RF MEMS Switch Low-loss microwave microelectromechanical systems (MEMS) shunt switches are reported that utilize highly compliant serpentine spring folded suspensions together with large area capacitive actuators to achieve low actuation voltages while maintaining sufficient off-state isolation. The RF MEMS switches were fabricated via a surface micromachining process using PI2545 Polyimide 1 as the sacrificial layer. The switch structure was composed of electroplated nickel and the serpentine folded suspensions had varying number of meanders from 1 to 5. DC measurements indicate actuation voltages as low as 9 V with an on-to-off capacitance ratio of 48. Power handling measurement results showed no ”selfbiasing” or failure of the MEMS switches for power levels up to 6.6W. RF measurements demonstrate an isolation of -26 dB at 40 GHz.

negative: Comparison of different methods to cancel offset capacitance in capacitive displacement sensors This paper presents a comparative study of the power consumption of two methods to cancel the offset capacitance in high-resolution capacitive displacement sensors. One method is applied based on correlated-double-sampling (CDS) technique and the other method is applied using oversampling technique. The analytical comparison predicts similar power consumption, if the same resolution for the same conversion time need to be reached. Experimental results with implementations of the two methods confirmed the analytical prediction.

negative: From IT Addiction to Discontinued Use: A Cognitive Dissonance Perspective One of the main topics discussed within the realm of the dark side of IT is addiction. IT addiction has been found to bring adverse consequences on users’ lives. In order to overcome the difficulties associated with IT addiction, interrupting and quitting addiction has become an important research agenda. Recent research findings have shown that IT addicts do not always feel guilty about their usage, and in many cases, they do not even perceive their usage as problematic. In this study, we draw on cognitive dissonance theory to theorize and propose a model showing that the degree of users’ cognitive dissonance can make a difference in their willingness to quit their IT addiction. We tested the model using data collected from 226 social network sites users. The analysis provided empirical support for our model and shed light on the mediation and moderation effects of cognitive dissonance in this process. 1

negative: Comparison of Internet addicts and non-addicts in Taiwanese high school This study investigated the difference between Internet addicts and non-addicts in Taiwanese high schools, and focused specifically on their Internet usage patterns, and gratification and communication pleasures. A total of 1708 valid data samples of high school adolescents were collected. Among this sample, 236 subjects (13.8%) were identified as addicts using the eight-item Internet addiction Diagnostic Questionnaire designed by Young [Internet addiction survey [Online]. Available: http://www.pitt.edu/_ksy/survey.htm]. The analytical results revealed that Internet addicts spent almost twice as many hours on line on average than the non-addicts. Notably, surfing with a social/entertainment motivation and gratification was positively correlated with Internet addiction. Furthermore, Internet addicts obtained markedly higher overall PIUST scores and scored higher than non-addicts on four subscales (tolerance; compulsive use and withdrawal; related problems, including family, school, health, and other problems; interpersonal and financial problems). While Internet addicts perceived the Internet to have significantly more negative influences on daily routines, school performance, teacher and parental relation than non-addicts, both Internet addicts and non-addicts viewed Internet use as enhancing peer relations. Moreover, students with personalities characterized by dependence, shyness, depression and low self-esteem had a high tendency to become addicted. 2004 Elsevier Ltd. All rights reserved.

negative: Scheduling in the Dark ( Improved Result ) We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when either the jobs all arrive at time zero, or when all the jobs are fully parallelizable, or when the scheduler has considerable knowledge about the jobs. This paper considers for the first time this problem without any of these three restrictions yet when our algorithm is given more resources than the adversary. We provide new upper and lower bound techniques applicable in this more difficult scenario. The results are of both theoretical and practical interest. In our model, a job can arrive at any arbitrary time and its execution characteristics can change through the life of the job from being anywhere from fully parallelizable to completely sequential. We assume that the scheduler has no knowledge about the jobs except for knowing when a job arrives and knowing when it completes. (This is why we say that the scheduler is completely in the dark.) Given all this, we prove that the scheduler algorithm Equi-partition, though simple, performs within a constant factor as well as the optimal scheduler as long as it is given at least twice as many processors. More over, we prove that if none of the jobs are ”strictly” fully parallelizable, then Equi-partition performs competitively with no extra processors. Author is supported by NSERC Canada.

negative: Optimal Lower Bounds on Regular Expression Size Using Communication Complexity The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2 in the worst case for infinite languages, and for finite languages it is n log n) and n , if the alphabet size grows with the number of states n of the given automaton. A new lower bound method based on communication complexity for regular expression size is developed to show that the required size is indeed n . For constant alphabet size the best lower bound known to date is Ω(n), even when allowing infinite languages and nondeterministic finite automata. As the technique developed here works equally well for deterministic finite automata over binary alphabets, the lower bound is improved to n .

negative: Quantifying the Security Posture of Containerized Mission Critical Systems Determining the security posture of containerized mission-critical systems is difficult given the vast number of parameters that determine a system's ability to withstand cyber-attacks. In many cases, technical audits can be performed to determine a system's security posture and to evaluate how well they are configured to protect against known cyber-threats. Properly configuring systems can lead to higher security, however, the configuration and auditing process can be time-consuming and error-prone. In addition, the results obtained from these audits can be difficult to summarize into one meaningful metric that accurately characterizes system's security posture as guided by customer needs. In this work, we propose an approach for computing a security-posture metric for containerized systems that supports operators during the sense-making process that follows traditional security audits. The results of this work can be used on a per-deployment case, taking into account what matters to operators of containerized mission-critical systems.

negative: An Anonymous Electronic Voting Protocol for Voting Over The Internet In this work we propose a secure electronic voting protocol that is suitable for large scale voting over the Internet. The protocol allows a voter to cast his or her ballot anonymously, by exchanging untraceable yet authentic messages. The protocol ensures that (i) only eligible voters are able to cast votes, (ii) a voter is able to cast only one vote, (iii) a voter is able to verify that his or her vote is counted in the final tally, (iv) nobody, other than the voter, is able to link a cast vote with a voter, and (v) if a voter decides not to cast a vote, nobody is able to cast a fraudulent vote in place of the voter. The protocol does not require the cooperation of all registered voters. Neither does it require the use of complex cryptographic techniques like threshold cryptosystems or anonymous channels for casting votes. This is in contrast to other voting protocols that have been proposed in the literature. The protocol uses three agents, other than the voters, for successful operation. However, we do not require any of these agents to be trusted. That is, the agents may be physically co-located or may collude with one another to try to commit a fraud. If a fraud is committed, it can be easily detected and proven, so that the vote can be declared null and void. Although we propose the protocol with electronic voting in mind, the protocol can be used in other applications that involve exchanging an untraceable yet authentic message. Examples of such applications are answering confidential questionnaire anonymously or anonymous financial transactions.

negative: Intelligent Heart Disease Prediction System Using Probabilistic Neural Network The diagnosis of diseases is a crucial and difficult job in medicine. The recognition of heart disease from diverse features or signs is a multi-layered problem that is not free from false assumptions and is frequently accompanied by hasty effects [1]. Thus an attempt to exploit knowledge and experience of several specialists and clinical screening data of patients composed in databases to assist the diagnosis procedure is regarded as a great challenge. The healthcare industry gathers enormous amounts of heart disease data that unfortunately, are not mined to determine concealed information for effective diagnosing [2]. In this paper, an efficient approach for the intelligent heart disease prediction based on Probabilistic Neural Network (PNN) technique is proposed. Initially, the data set containing 13 medical attributes were obtained from the Cleveland heart disease database. The dataset is clustered with the aid of k-means clustering algorithm. The PNN with radial basis function is trained using the selected data sets. The comparison between existing approaches and proposed approach with respect to accuracy of prediction, sensitivity and specificity is recorded in this paper. The results from experiments returned with diminishing fact that there is considerable improvement in classification and prediction. The proposed PNN works as promising tool for prediction of heart disease.

negative: Advances in data stream mining Mining data streams has been a focal point of research interest over the past decade. Hardware and software advances have contributed to the significance of this area of research by introducing faster than ever data generation. This rapidly generated data has been termed as data streams. Credit card transactions, Google searches, phone calls in a city, and many others\are typical data streams. In many important applications, it is inevitable to analyze this streaming data in real time. Traditional data mining techniques have fallen short in addressing the needs of data stream mining. Randomization, approximation, and adaptation have been used extensively in developing new techniques or adopting exiting ones to enable them to operate in a streaming environment. This paper reviews key milestones and state of the art in the data stream mining area. Future insights are also be presented. C © 2011 Wiley Periodicals, Inc.

negative: Requirements for Safe Robots : Measurements , Analysis and New Insights Physical human–robot interaction and cooperation has become a topic of increasing importance and of major focus in robotics research. An essential requirement of a robot designed for high mobility and direct interaction with human users or uncertain environments is that it must in no case pose a threat to the human. Until recently, quite a few attempts were made to investigate real-world threats via collision tests and use the outcome to considerably improve safety during physical human–robot interaction. In this paper, we give an overview of our systematic evaluation of safety in human–robot interaction, covering various aspects of the most significant injury mechanisms. In order to quantify the potential injury risk emanating from such a manipulator, impact tests with the DLR-Lightweight Robot III were carried out using standard automobile crash test facilities at the German Automobile Club (ADAC). Based on these tests, several industrial robots of different weight have been evaluated and the influence of the robot mass and velocity have been investigated. The evaluated non-constrained impacts would only partially capture the nature of human–robot safety. A possibly constrained environment and its effect on the resulting human injuries are discussed and evaluated from different perspectives. As well as such impact tests and simulations, we have analyzed the problem of the quasi-static constrained impact, which could pose a serious threat to the human even for low-inertia robots under certain circumstances. Finally, possible injuries relevant in robotics are summarized and systematically classified. KEY WORDS—Physical Human-Robot Interaction, Simulation, Flexible Arms, Mechanics, Design and Control, Force Control The International Journal of Robotics Research Vol. 00, No. 00, Xxxxxxxx 2009, pp. 000–000 DOI: 10.1177/0278364909343970 c The Author(s), 2009. Reprints and permissions: http://www.sagepub.co.uk/journalsPermissions.nav Figures 1–10, 12–18 appear in color online: http://ijr.sagepub.com

negative: Sego: Pervasive Trusted Metadata for Efficiently Verified Untrusted System Services Sego is a hypervisor-based system that gives strong privacy and integrity guarantees to trusted applications, even when the guest operating system is compromised or hostile. Sego verifies operating system services, like the file system, instead of replacing them. By associating trusted metadata with user data across all system devices, Sego verifies system services more efficiently than previous systems, especially services that depend on data contents. We extensively evaluate Sego's performance on real workloads and implement a kernel fault injector to validate Sego's file system-agnostic crash consistency and recovery protocol.

negative: A Data Driven Approach for Algebraic Loop Invariants We describe a new algorithm GUESS-AND-CHECK for computing algebraic equation invariants. These invariants are of the form ∧ifi(x1, . . . , xn) = 0, where each fi is a polynomial over the variables x1, . . . , xn of the program. Two novel features of our algorithm are:(1) it is data driven, that is, invariants are derived from data generated from concrete executions of the program, and (2) it is sound and complete, that is, the algorithm terminates with the correct invariant if it exists. The GUESS-AND-CHECK algorithm proceeds iteratively in two phases. The “guess” phase uses linear algebra techniques to efficiently derive a candidate invariant from data. This candidate invariant is subsequently validated in a “check” phase. If the check phase fails to validate the candidate invariant, then the proof of invalidity is used to generate more data and this is used to find better candidate invariants in a subsequent guess phase. Therefore, GUESS-AND-CHECK iteratively invokes the guess and check phases until it finds the desired invariant. In terms of implementation, off-the-shelf linear algebra solvers are used to implement the guess phase, and off-the-shelf decision procedures are used to implement the check phase. We have evaluated our technique on a number of benchmark programs from recent papers on invariant generation. Our results are encouraging – we are able to efficiently compute algebraic invariants in all cases.

negative: Nanowire Ultraviolet Photodetectors and Optical Switches Nanowires and nanotubes may become important building blocks for nanoscale optoelectronics, since they can function as miniaturized devices as well as electrical interconnects. Nano-devices such as field-effect transistors, single-electron transistors, metal±semiconductor junctions, and intermolecular crossed junctions have been demonstrated. Many of these devices rely on binary switching, which is critical for important applications such as memory storage and logic circuits. Switching on the nanometer and molecular level has been predominantly achieved through proper electrical gating, as exemplified by nanotube transistors. However, no attention has been given to the photoconducting properties of nanowires despite the exciting possibilities for use in optoelectronic circuits. Here, we show the possibility of creating highly sensitive nanowire switches by exploring the photoconducting properties of individual semiconductor nanowires. The conductivity of the ZnO nanowires is extremely sensitive to ultraviolet light exposure. The light-induced conductivity increase allows us to reversibly switch the nanowires between aOFFo and aONo states, an optical gating phenomenon analogous to the commonly used electrical gating. The ZnO nanowires used in the experiments were grown by a vapor phase transport process developed in our lab. The diameters of these wires range from 50 to 300 nm. To characterize their photoconducting properties, the nanowires were dispersed directly on pre-fabricated gold electrodes. Alternatively, electron-beam lithography was used to fabricate gold electrodes on top of the nanowires. Field-emission scanning electron microscopy (FE-SEM) was used to image the ZnO nanowire devices. Electrical resistivity measurements were performed in a four-terminal configuration in air, nitrogen, or vacuum environments. Four-terminal measurements of individual ZnO nanowires indicate that they are highly insulating in the dark with a resistivity above 3.5 MX cm. When the nanowires are exposed to ultraviolet (UV)-light with wavelengths below 380 nm (handheld UV-lamp, 0.3 mW cm, 365 nm), the nanowire resistivity decreases by typically 4 to 6 orders of magnitude. Figure 1 compares the current±voltage (I±V) curves measured on a 60 nm nanowire in the dark and upon UV-light exposure. A larger photoresponse was detected at higher bias. We notice that the I±V curve for the UV-exposed nanowire exhibits nonlinear behavior. The same nonlinear I±V has been observed for both the wire-on-electrode and electrode-on-wire configurations. The four-terminal and two-terminal measurements show essentially identical resistivity values, which suggests that the Au/ZnO contacts may not contribute to the I±V nonlinearity. The exact reason for this nonlinearity remains unknown at this stage. The high sensitivity of the nanowire photoconductors can be seen in Figure 2, which shows the power dependence of the photoresponse. The third harmonic of a Nd:YAG laser was used as the UV light source. Neutral density filters were used to change the incident UV light power. It was found that the photoresponse (Ipc) can be expressed by a simple power law

negative: The Dual-State Theory of Prefrontal Cortex Dopamine Function with Relevance to Catechol-<ce:italic>O</ce:italic>-Methyltransferase Genotypes and Schizophrenia There is now general consensus that at least some of the cognitive deficits in schizophrenia are related to dysfunctions in the prefrontal cortex (PFC) dopamine (DA) system. At the cellular and synaptic level, the effects of DA in PFC via D1- and D2-class receptors are highly complex, often apparently opposing, and hence difficult to understand with regard to their functional implications. Biophysically realistic computational models have provided valuable insights into how the effects of DA on PFC neurons and synaptic currents as measured in vitro link up to the neural network and cognitive levels. They suggest the existence of two discrete dynamical regimes, a D1-dominated state characterized by a high energy barrier among different network patterns that favors robust online maintenance of information and a D2-dominated state characterized by a low energy barrier that is beneficial for flexible and fast switching among representational states. These predictions are consistent with a variety of electrophysiological, neuroimaging, and behavioral results in humans and nonhuman species. Moreover, these biophysically based models predict that imbalanced D1:D2 receptor activation causing extremely low or extremely high energy barriers among activity states could lead to the emergence of cognitive, positive, and negative symptoms observed in schizophrenia. Thus, combined experimental and computational approaches hold the promise of allowing a detailed mechanistic understanding of how DA alters information processing in normal and pathological conditions, thereby potentially providing new routes for the development of pharmacological treatments for schizophrenia.

negative: KEEPING YOUR HEADCOUNT WHEN ALL ABOUT YOU ARE LOSING THEIRS : DOWNSIZING , VOLUNTARY TURNOVER RATES , AND THE MODERATING ROLE OF HR PRACTICES Although both downsizing and voluntary turnover have been topics of great interest in the organizational literature, little research has addressed the possible relationship between the two. Using organization-level data from multiple industries, we first investigate whether downsizing predicts voluntary turnover rates. Second, to lend support to our causal model, we examine whether this relationship is mediated by aggregated levels of organizational commitment. Third, we test whether the downsizing-turnover rate relationship: (1) is mitigated by HR practices that tend to embed employees in the organization or convey procedural fairness; and (2) is strengthened by HR practices that enhance career development. Results support the hypothesized main, mediated, and moderated effects.

negative: A FRAMEWORK FOR DETERMINING CRITICAL SUCCESS FACTORS INFLUENCING CONSTRUCTION BUSINESS PERFORMANCE Recent reports by Latham (1994) and Egan (1998) have emphasized the need for the construction industry to increase its competitiveness, and have suggested the use of performance measurement as a tool for continuous improvement. Comprehensive measurement of a company’s performance and subsequent feedback to its managers is vital for business transformation. Measurement also enables businesses to be compared with each other on the basis of standardized information, allowing best practices to be identified and applied more widely. Historically, business performance has been determined principally through the use of financial performance criteria, but recently, it has been established that performance measurement needs to go beyond this. This paper reviews the various financial and non-financial factors that influence construction business. A methodology for defining the critical success factors relevant to construction businesses is further outlined. The critical success factors associated with construction business are also reviewed. Finally, it is concluded that more important than presenting a list of critical success factors (which are bound to change) is the need to have a holistic framework for identifying and implementing the required success factors.

negative: PAPILLON: expressive eyes for interactive characters PAPILLON is a technology for designing highly expressive animated eyes for interactive characters, robots and toys. Expressive eyes are essential in any form of face-to-face communication [2] and designing them has been a critical challenge in robotics, as well as in interactive character and toy development.

negative: Bias in Wikipedia While studies have shown that Wikipedia articles exhibit quality that is comparable to conventional encyclopedias, research still proves that Wikipedia, overall, is prone to many different types of Neutral Point of View (NPOV) violations that are explicitly or implicitly caused by bias from its editors. Related work focuses on political, cultural and gender bias. We are developing an approach for detecting both explicit and implicit bias in Wikipedia articles and observing its evolution over time. Our approach is based on different factors of bias, with the most important ones being language style, editors, and citations. In this paper we present the approach, methodology and a first analysis.

negative: Traffic lights detection and state estimation using Hidden Markov Models The detection of a traffic light on the road is important for the safety of persons who occupy a vehicle, in a normal vehicles or an autonomous land vehicle. In normal vehicle, a system that helps a driver to perceive the details of traffic signals, necessary to drive, could be critical in a delicate driving manoeuvre (i.e crossing an intersection of roads). Furthermore, traffic lights detection by an autonomous vehicle is a special case of perception, because it is important for the control that the autonomous vehicle must take. Multiples authors have used image processing as a base for achieving traffic light detection. However, the image processing presents a problem regarding conditions for capturing scenes, and therefore, the traffic light detection is affected. For this reason, this paper proposes a method that links the image processing with an estimation state routine formed by Hidden Markov Models (HMM). This method helps to determine the current state of the traffic light detected, based on the obtained states by image processing, aiming to obtain the best performance in the determination of the traffic light states. With the proposed method in this paper, we obtained 90.55% of accuracy in the detection of the traffic light state, versus a 78.54% obtained using solely image processing. The recognition of traffic lights using image processing still has a large dependence on the capture conditions of each frame from the video camera. In this context, the addition of a pre-processing stage before image processing could contribute to improve this aspect, and could provide a better results in determining the traffic light state.

negative: Touching the void: direct-touch interaction for intangible displays In this paper, we explore the challenges in applying and investigate methodologies to improve direct-touch interaction on intangible displays. Direct-touch interaction simplifies object manipulation, because it combines the input and display into a single integrated interface. While traditional tangible display-based direct-touch technology is commonplace, similar direct-touch interaction within an intangible display paradigm presents many challenges. Given the lack of tactile feedback, direct-touch interaction on an intangible display may show poor performance even on the simplest of target acquisition tasks. In order to study this problem, we have created a prototype of an intangible display. In the initial study, we collected user discrepancy data corresponding to the interpretation of 3D location of targets shown on our intangible display. The result showed that participants performed poorly in determining the z-coordinate of the targets and were imprecise in their execution of screen touches within the system. Thirty percent of positioning operations showed errors larger than 30mm from the actual surface. This finding triggered our interest to design a second study, in which we quantified task time in the presence of visual and audio feedback. The pseudo-shadow visual feedback was shown to be helpful both in improving user performance and satisfaction.

negative: Setting Lower Bounds on Truthfulness We present general techniques for proving inapproximability results for several paradigmatic truthful multidimensional mechanism design problems. In particular, we demonstrate the strength of our techniques by exhibiting a lower bound of 2 − 1 m for the scheduling problem with m unrelated machines (formulated as a mechanism design problem in the seminal paper of Nisan and Ronen on Algorithmic Mechanism Design). Our lower bound applies to truthful randomized mechanisms, regardless of any computational assumptions on the running time of these mechanisms. Moreover, it holds even for the wider class of truthfulness-in-expectation mechanisms. This lower bound nearly matches the known 1.58606 randomized truthful upper bound for the case of two machines (a non-truthful FPTAS exists). Recently, Daskalakis and Weinberg [17] show that there is a polynomial-time 2approximately optimal Bayesian mechanism for makespan minimization for unrelated machines. We complement this result by showing an appropriate lower bound of 1.25 for deterministic incentive compatible Bayesian mechanisms. We then show an application of our techniques to the workload-minimization problem in networks. We prove our lower bounds for this problem in the inter-domain routing setting presented by Feigenbaum, Papadimitriou, Sami, and Shenker. Finally, we discuss several notions of non-utilitarian fairness (Max-Min fairness, Min-Max fairness, and envy minimization) and show how our techniques can be used to prove lower bounds for these notions. No lower bounds for truthful mechanisms in multidimensional probabilistic settings were previously known.1 ∗Computer Science Department, Technion, Haifa, Israel. ahumu@yahoo.com. †School of Computer Science and Engineering, Hebrew University, Jerusalem, Israel. schapiram@huji.ac.il. The current paper supersedes "Setting Lower Bounds on Truthfulness" that appeared as an extended abstract in the Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA07), pages 1143-1152, 2007. The current version includes a new lower bound result for Bayesian Incentive compatible Mechanisms.

negative: Algorithms for Infinitely Many-Armed Bandits We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new selected arm which characterizes its probability of being a near-optimal arm. Our assumption is weaker than in previous works. We describe algorithms based on upper-confidence-bounds applied to a restricted set of randomly selected arms and provide upper-bounds on the resulting expected regret. We also derive a lower-bound which matches (up to a logarithmic factor) the upper-bound in some cases.

negative: A General Lower Bound on the Number of Examples Needed for Learning We prove a lower bound of ( ln + VCdim(C) ) on the number of random examples required for distribution-free learning of a concept class C, where VCdim(C) is the Vapnik-Chervonenkis dimension and and are the accuracy and con dence parameters. This improves the previous best lower bound of ( ln + VCdim(C)), and comes close to the known general upper bound of O( ln + VCdim(C) ln ) for consistent algorithms. We show that for many interesting concept classes, including kCNF and kDNF, our bound is actually tight to within a constant factor. A. Ehrenfeucht was supported by NSF grant MCS-8305245, D. Haussler by ONR grant N00014-86-K-0454, M. Kearns by ONR grant N00014-86-K-0454 and an A.T. & T. Bell Laboratories Scholarship, and L. Valiant by grants ONR-N00014-85-K-0445, NSF-DCR-8600379, DAAL03-86-K-0171 and by the SERC of the U.K. Part of this research was done while M. Kearns was visiting U.C. Santa Cruz.

negative: Almost Optimal Exploration in Multi-Armed Bandits We study the problem of exploration in stochastic Multi-Armed Bandits. Even in the simplest setting of identifying the best arm, there remains a logarithmic multiplicative gap between the known lower and upper bounds for the number of arm pulls required for the task. This extra logarithmic factor is quite meaningful in nowadays large-scale applications. We present two novel, parameterfree algorithms for identifying the best arm, in two di↵erent settings: given a target confidence and given a target budget of arm pulls, for which we prove upper bounds whose gap from the lower bound is only doublylogarithmic in the problem parameters. We corroborate our theoretical results with experiments demonstrating that our algorithm outperforms the state-of-the-art and scales better as the size of the problem increases.

negative: Beating the adaptive bandit with high probability We provide a principled way of proving Õ(√T) high-probability guarantees for partial-information (bandit) problems over arbitrary convex decision sets. First, we prove a regret guarantee for the full-information problem in terms of “local” norms, both for entropy and self-concordant barrier regularization, unifying these methods. Given one of such algorithms as a black-box, we can convert a bandit problem into a full-information problem using a sampling scheme. The main result states that a high-probability Õ(√T) bound holds whenever the black-box, the sampling scheme, and the estimates of missing information satisfy a number of conditions, which are relatively easy to check. At the heart of the method is a construction of linear upper bounds on confidence intervals. As applications of the main result, we provide the first known efficient algorithm for the sphere with an Õ(√T) high-probability bound. We also derive the result for the n-simplex, improving the O(√nT log(nT)) bound of Auer et al [3] by replacing the log T term with log log T and closing the gap to the lower bound of Ω(√nT). While Õ(√T) high-probability bounds should hold for general decision sets through our main result, construction of linear upper bounds depends on the particular geometry of the set; we believe that the sphere example already exhibits the necessary ingredients. The guarantees we obtain hold for adaptive adversaries (unlike the in-expectation results of [1]) and the algorithms are efficient, given that the linear upper bounds on confidence can be computed.

negative: Statistical limits of spiked tensor models We study the statistical limits of both detecting and estimating a rank-one deformation of a symmetric random Gaussian tensor. We establish upper and lower bounds on the critical signal-to-noise ratio, under a variety of priors for the planted vector: (i) a uniformly sampled unit vector, (ii) i.i.d. ±1 entries, and (iii) a sparse vector where a constant fraction ρ of entries are i.i.d. ±1 and the rest are zero. For each of these cases, our upper and lower bounds match up to a 1+o(1) factor as the order d of the tensor becomes large. For sparse signals (iii), our bounds are also asymptotically tight in the sparse limit ρ → 0 for any fixed d (including the d = 2 case of sparse PCA). Our upper bounds for (i) demonstrate a phenomenon reminiscent of the work of Baik, Ben Arous and Péché: an ‘eigenvalue’ of a perturbed tensor emerges from the bulk at a strictly lower signal-to-noise ratio than when the perturbation itself exceeds the bulk; we quantify the size of this effect. We also provide some general results for larger classes of priors. In particular, the large d asymptotics of the threshold location differs between problems with discrete priors versus continuous priors. Finally, for priors (i) and (ii) we carry out the replica prediction from statistical physics, which is conjectured to give the exact information-theoretic threshold for any fixed d. Of independent interest, we introduce a new improvement to the second moment method for contiguity, on which our lower bounds are based. Our technique conditions away from rare ‘bad’ events that depend on interactions between the signal and noise. This enables us to close √ 2-factor gaps present in several previous works.

negative: Small Spherical Antennas Using Arrays of Electromagnetically Coupled Planar Elements This letter presents the design, fabrication, and experimental characterization of small spherical antennas fabricated using arrays of non-interconnected planar conductor elements. The antennas are based upon spherical resonator structures with radiation Q-factors approaching $1.5\times$ the fundamental lower limit. The antennas are formed by coupling these resonators to an impedance-matched coplanar strip transmission line. Direct electrical connection between the feed and the antenna are made only to conductor elements coplanar with the transmission line, simplifying the fabrication process. The incident energy excites a collective resonant mode of the entire sphere (an electric dipole resonance), thereby inducing currents in each of the rings of the structure. The presence of the conductor elements outside of the feed plane is critical towards achieving the excellent bandwidth behavior observed here. The fabricated antennas have a normalized size $ka=0.54$ (where $k$ is the wavenumber and $a$ is the radius of the sphere) and exhibit high radiative efficiencies ($>$ 90%) and bandwidth performance near the fundamental limit for their size.