A high performance 76.5 GHz FMCW RADAR for advanced driving assistance system

Frequency modulated Continuous Wave (FMCW) is continuous wave RADAR widely used for Intelligent Adaptive Cruise Control (ACC) and Collision Warning System (CWS). The paper presents a design and simulation of millimeter wave FMCW RADAR. Paper introduces a mathematical modeling of a FMCW RADAR including its target model. Design of a 76.5 GHz FMCW RADAR & its target model by using Advanced Design System (ADS) software and target range & velocity at various conditions are employed in the simulated FMCW RADAR system to verify the operation of the system.


CANAuth - A Simple, Backward Compatible Broadcast Authentication Protocol for CAN bus

The Controller-Area Network (CAN) bus protocol [1] is a bus protocol invented in 1986 by Robert Bosch GmbH, originally intended for automotive use. By now, the bus can be found in devices ranging from cars and trucks, over lightning setups to industrial looms. Due to its nature, it is a system very much focused on safety, i.e., reliability. Unfortunately, there is no build-in way to enforce security, such as encryption or authentication. In this paper, we investigate the problems associated with implementing a backward compatible message authentication protocol on the CAN bus. We show which constraints such a protocol has to meet and why this eliminates, to the best of our knowledge, all the authentication protocols published so far. Furthermore, we present a message authentication protocol, CANAuth, that meets all of the requirements set forth and does not violate any constraint of the CAN bus. Keywords—CAN bus, embedded networks, broadcast authentication, symmetric cryptography


Finding social roles in Wikipedia

This paper investigates some of the social roles people play in the online community of Wikipedia. We start from qualitative comments posted on community oriented pages, wiki project memberships, and user talk pages in order to identify a sample of editors who represent four key roles: substantive experts, technical editors, vandal fighters, and social networkers. Patterns in edit histories and egocentric network visualizations suggest potential "structural signatures" that could be used as quantitative indicators of role adoption. Using simple metrics based on edit histories we compare two samples of Wikipedians: a collection of long term dedicated editors, and a cohort of editors from a one month window of new arrivals. According to these metrics, we find that the proportions of editor types in the new cohort are similar those observed in the sample of dedicated contributors. The number of new editors playing helpful roles in a single month's cohort nearly equal the number found in the dedicated sample. This suggests that informal socialization has the potential provide sufficient role related labor despite growth and change in Wikipedia. These results are preliminary, and we describe several ways that the method can be improved, including the expansion and refinement of role signatures and identification of other important social roles.


Active Magnetic Anomaly Detection Using Multiple Micro Aerial Vehicles

Magnetic anomaly detection (MAD) is an important problem in applications ranging from geological surveillance to military reconnaissance. MAD sensors detect local disturbances in the magnetic field, which can be used to detect the existence of and to estimate the position of buried, hidden, or submerged objects, such as ore deposits or mines. These sensors may experience false positive and false negative detections and, without prior knowledge of the targets, can only determine proximity to a target. The uncertainty in the sensors, coupled with a lack of knowledge of even the existence of targets, makes the estimation and control problems challenging. We utilize a hierarchical decomposition of the environment, coupled with an estimation algorithm based on random finite sets, to determine the number of and the locations of targets in the environment. The small team of robots follow the gradient of mutual information between the estimated set of targets and the future measurements, locally maximizing the rate of information gain. We present experimental results of a team of quadrotor micro aerial vehicles discovering and localizing an unknown number of permanent magnets.


Demand Side Management in Smart Grid Using Heuristic Optimization

Demand side management (DSM) is one of the important functions in a smart grid that allows customers to make informed decisions regarding their energy consumption, and helps the energy providers reduce the peak load demand and reshape the load profile. This results in increased sustainability of the smart grid, as well as reduced overall operational cost and carbon emission levels. Most of the existing demand side management strategies used in traditional energy management systems employ system specific techniques and algorithms. In addition, the existing strategies handle only a limited number of controllable loads of limited types. This paper presents a demand side management strategy based on load shifting technique for demand side management of future smart grids with a large number of devices of several types. The day-ahead load shifting technique proposed in this paper is mathematically formulated as a minimization problem. A heuristic-based Evolutionary Algorithm (EA) that easily adapts heuristics in the problem was developed for solving this minimization problem. Simulations were carried out on a smart grid which contains a variety of loads in three service areas, one with residential customers, another with commercial customers, and the third one with industrial customers. The simulation results show that the proposed demand side management strategy achieves substantial savings, while reducing the peak load demand of the smart grid.


Cookie Hijacking in the Wild : Security and Privacy Implications

The widespread demand for online privacy, also fueled by widely-publicized demonstrations of session hijacking attacks against popular websites, has spearheaded the increasing deployment of HTTPS. However, many websites still avoid ubiquitous encryption due to performance or compatibility issues. The prevailing approach in these cases is to force critical functionality and sensitive data access over encrypted connections, while allowing more innocuous functionality to be accessed over HTTP. In practice, this approach is prone to flaws that can expose sensitive information or functionality to third parties. In this work, we conduct an in-depth assessment of a diverse set of major websites and explore what functionality and information is exposed to attackers that have hijacked a user’s HTTP cookies. We identify a recurring pattern across websites with partially deployed HTTPS; service personalization inadvertently results in the exposure of private information. The separation of functionality across multiple cookies with different scopes and inter-dependencies further complicates matters, as imprecise access control renders restricted account functionality accessible to non-session cookies. Our cookie hijacking study reveals a number of severe flaws; attackers can obtain the user’s home and work address and visited websites from Google, Bing and Baidu expose the user’s complete search history, and Yahoo allows attackers to extract the contact list and send emails from the user’s account. Furthermore, e-commerce vendors such as Amazon and Ebay expose the user’s purchase history (partial and full respectively), and almost every website exposes the user’s name and email address. Ad networks like Doubleclick can also reveal pages the user has visited. To fully evaluate the practicality and extent of cookie hijacking, we explore multiple aspects of the online ecosystem, including mobile apps, browser security mechanisms, extensions and search bars. To estimate the extent of the threat, we run IRB-approved measurements on a subset of our university’s public wireless network for 30 days, and detect over 282K accounts exposing the cookies required for our hijacking attacks. We also explore how users can protect themselves and find that, while mechanisms such as the EFF’s HTTPS Everywhere extension can reduce the attack surface, HTTP cookies are still regularly exposed. The privacy implications of these attacks become even more alarming when considering how they can be used to deanonymize Tor users. Our measurements suggest that a significant portion of Tor users may currently be vulnerable to cookie hijacking.


Learning Profiles in Duplicate Question Detection

This paper presents the results of systematic and comparative experimentation with major types of methodologies for automatic duplicate question detection when these are applied to datasets of progressively larger sizes, thus allowing to study the learning profiles of this task under these different approaches and evaluate their merits. This study was made possible by resorting to the recent release for research purposes, by the Quora online question answering engine, of a new dataset with over 400,000 pairs labeled with respect to their elements being duplicate interrogative segments.


Neurobiology of Schizophrenia

With its hallucinations, delusions, thought disorder, and cognitive deficits, schizophrenia affects the most basic human processes of perception, emotion, and judgment. Evidence increasingly suggests that schizophrenia is a subtle disorder of brain development and plasticity. Genetic studies are beginning to identify proteins of candidate genetic risk factors for schizophrenia, including dysbindin, neuregulin 1, DAOA, COMT, and DISC1, and neurobiological studies of the normal and variant forms of these genes are now well justified. We suggest that DISC1 may offer especially valuable insights. Mechanistic studies of the properties of these candidate genes and their protein products should clarify the molecular, cellular, and systems-level pathogenesis of schizophrenia. This can help redefine the schizophrenia phenotype and shed light on the relationship between schizophrenia and other major psychiatric disorders. Understanding these basic pathologic processes may yield novel targets for the development of more effective treatments.


The design and implementation of microdrivers

Device drivers commonly execute in the kernel to achieve high performance and easy access to kernel services. However, this comes at the price of decreased reliability and increased programming difficulty. Driver programmers are unable to use user-mode development tools and must instead use cumbersome kernel tools. Faults in kernel drivers can cause the entire operating system to crash. User-mode drivers have long been seen as a solution to this problem, but suffer from either poor performance or new interfaces that require a rewrite of existing drivers.
 This paper introduces the Microdrivers architecture that achieves high performance and compatibility by leaving critical path code in the kernel and moving the rest of the driver code to a user-mode process. This allows data-handling operations critical to I/O performance to run at full speed, while management operations such as initialization and configuration run at reduced speed in user-level. To achieve compatibility, we present DriverSlicer, a tool that splits existing kernel drivers into a kernel-level component and a user-level component using a small number of programmer annotations. Experiments show that as much as 65% of driver code can be removed from the kernel without affecting common-case performance, and that only 1-6 percent of the code requires annotations.


XFI: Software Guards for System Address Spaces

XFI is a comprehensive protection system that offers both flexible access control and fundamental integrity guarantees, at any privilege level and even for legacy code in commodity systems. For this purpose, XFI combines static analysis with inline software guards and a two-stack execution model. We have implemented XFI for Windows on the x86 architecture using binary rewriting and a simple, stand-alone verifier; the implementation's correctness depends on the verifier, but not on the rewriter. We have applied XFI to software such as device drivers and multimedia codecs. The resulting modules function safely within both kernel and user-mode address spaces, with only modest enforcement overheads.


CuriOS: Improving Reliability through Operating System Structure

An error that occurs in a microkernel operating system service can potentially result in state corruption and service failure. A simple restart of the failed service is not always the best solution for reliability. Blindly restarting a service which maintains client-related state such as session information results in the loss of this state and affects all clients that were using the service. CuriOS represents a novel OS design that uses lightweight distribution, isolation and persistence of OS service state to mitigate the problem of state loss during a restart. The design also significantly reduces error propagation within client-related state maintained by an OS service. This is achieved by encapsulating services in separate protection domains and granting access to client-related state only when required for request processing. Fault injection experiments show that it is possible to recover from between 87% and 100% of manifested errors in OS services such as the file system, network, timer and scheduler while maintaining low performance overheads.


CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs

This paper describes the C Intermediate Language: a highlevel representation along with a set of tools that permit easy analysis and source-to-source transformation of C programs. Compared to C, CIL has fewer constructs. It breaks down certain complicated constructs of C into simpler ones, and thus it works at a lower level than abstract-syntax trees. But CIL is also more high-level than typical intermediate languages (e.g., three-address code) designed for compilation. As a result, what we have is a representation that makes it easy to analyze and manipulate C programs, and emit them in a form that resembles the original source. Moreover, it comes with a front-end that translates to CIL not only ANSI C programs but also those using Microsoft C or GNU C extensions. We describe the structure of CIL with a focus on how it disambiguates those features of C that we found to be most confusing for program analysis and transformation. We also describe a whole-program merger based on structural type equality, allowing a complete project to be viewed as a single compilation unit. As a representative application of CIL, we show a transformation aimed at making code immune to stack-smashing attacks. We are currently using CIL as part of a system that analyzes and instruments C programs with run-time checks to ensure type safety. CIL has served us very well in this project, and we believe it can usefully be applied in other situations as well.


Thorough static analysis of device drivers

Bugs in kernel-level device drivers cause 85% of the system crashes in the Windows XP operating system [44]. One of the sources of these errors is the complexity of the Windows driver API itself: programmers must master a complex set of rules about how to use the driver API in order to create drivers that are good clients of the kernel. We have built a static analysis engine that finds API usage errors in C programs. The Static Driver Verifier tool (SDV) uses this engine to find kernel API usage errors in a driver. SDV includes models of the OS and the environment of the device driver, and over sixty API usage rules. SDV is intended to be used by driver developers "out of the box." Thus, it has stringent requirements: (1) complete automation with no input from the user; (2) a low rate of false errors. We discuss the techniques used in SDV to meet these requirements, and empirical results from running SDV on over one hundred Windows device drivers.


Why We Need New Evaluation Metrics for NLG

The majority of NLG evaluation relies on automatic metrics, such as BLEU. In this paper, we motivate the need for novel, systemand data-independent automatic evaluation methods: We investigate a wide range of metrics, including state-of-the-art word-based and novel grammar-based ones, and demonstrate that they only weakly reflect human judgements of system outputs as generated by data-driven, end-to-end NLG. We also show that metric performance is dataand system-specific. Nevertheless, our results also suggest that automatic metrics perform reliably at system-level and can support system development by finding cases where a system performs poorly.


Living in two homes-a Swedish national survey of wellbeing in 12 and 15 year olds with joint physical custody

BACKGROUND
The practice of joint physical custody, where children spend equal time in each parent's home after they separate, is increasing in many countries. It is particularly common in Sweden, where this custody arrangement applies to 30 per cent of children with separated parents. The aim of this study was to examine children's health-related quality of life after parental separation, by comparing children living with both parents in nuclear families to those living in joint physical custody and other forms of domestic arrangements.

METHODS
Data from a national Swedish classroom study of 164,580 children aged 12 and 15-years-old were analysed by two-level linear regression modelling. Z-scores were used to equalise scales for ten dimensions of wellbeing from the KIDSCREEN-52 and the KIDSCREEN-10 Index and analysed for children in joint physical custody in comparison with children living in nuclear families and mostly or only with one parent.

RESULTS
Living in a nuclear family was positively associated with almost all aspects of wellbeing in comparison to children with separated parents. Children in joint physical custody experienced more positive outcomes, in terms of subjective wellbeing, family life and peer relations, than children living mostly or only with one parent. For the 12-year-olds, beta coefficients for moods and emotions ranged from -0.20 to -0.33 and peer relations from -0.11 to -0.20 for children in joint physical custody and living mostly or only with one parent. The corresponding estimates for the 15-year-olds varied from -0.08 to -0.28 and from -0.03 to -0.13 on these subscales. The 15-year-olds in joint physical custody were more likely than the 12-year-olds to report similar wellbeing levels on most outcomes to the children in nuclear families.

CONCLUSIONS
Children who spent equal time living with both parents after a separation reported better wellbeing than children in predominantly single parent care. This was particularly true for the 15-year-olds, while the reported wellbeing of 12-years-olds was less satisfactory. There is a need for further studies that can account for the pre and post separation context of individual families and the wellbeing of younger age groups in joint physical custody.


Reaching Agreement in the Presence of Faults

The problem addressed here concerns a set of isolated processors, some unknown subset of which may be faulty, that communicate only by means of two-party messages. Each nonfaulty processor has a private value of information that must be communicated to each other nonfaulty processor. Nonfaulty processors always communicate honestly, whereas faulty processors may lie. The problem is to devise an algorithm in which processors communicate their own values and relay values received from others that allows each nonfaulty processor to infer a value for each other processor. The value inferred for a nonfaulty processor must be that processor's private value, and the value inferred for a faulty one must be consistent with the corresponding value inferred by each other nonfaulty processor.
It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number. It is also shown that if faulty processors can refuse to pass on information but cannot falsely relay information, the problem is solvable for arbitrary n ≥ m ≥ 0. This weaker assumption can be approximated in practice using cryptographic methods.


User privacy risk calculator

User privacy is becoming an issue on the Internet due to common data breaches and various security threats. Services tend to require private user data in order to provide more personalized content and users are typically unaware of potential risks to their privacy. This paper proposes a risk calculator based on a feedforward neural network that will provide users with an ability to calculate risks to their privacy. The proposed calculator is evaluated on a set of real world example scenarios. Furthermore, to give more insight into privacy issues, each estimated risk is explained by several real life scenarios that might happen if the observed parameters are obtained by an attacker. In turn, this should raise user awareness and knowledge about privacy issues on the Internet.


VALUE , RARENESS , COMPETITIVE ADVANTAGE , AND PERFORMANCE : A CONCEPTUAL-LEVEL EMPIRICAL INVESTIGATION OF THE RESOURCE-BASED VIEW OF THE FIRM

The resource-based view of the firm (RBV) hypothesizes that the exploitation of valuable, rare resources and capabilities contributes to a firm’s competitive advantage, which in turn contributes to its performance. Despite this notion, few empirical studies test these hypotheses at the conceptual level. In response to this gap, this study empirically examines the relationships between value, rareness, competitive advantage, and performance. The results suggest that value and rareness are related to competitive advantage, that competitive advantage is related to performance, and that competitive advantage mediates the rareness-performance relationship. These findings have important academic and practitioner implications which are then discussed. Copyright  2008 John Wiley & Sons, Ltd.


A Configurable 12–237 kS/s 12.8 mW Sparse-Approximation Engine for Mobile Data Aggregation of Compressively Sampled Physiological Signals

Compressive sensing (CS) is a promising technology for realizing low-power and cost-effective wireless sensor nodes (WSNs) in pervasive health systems for 24/7 health monitoring. Due to the high computational complexity (CC) of the reconstruction algorithms, software solutions cannot fulfill the energy efficiency needs for real-time processing. In this paper, we present a 12-237 kS/s 12.8 mW sparse-approximation (SA) engine chip that enables the energy-efficient data aggregation of compressively sampled physiological signals on mobile platforms. The SA engine chip integrated in 40 nm CMOS can support the simultaneous reconstruction of over 200 channels of physiological signals while consuming (1% of a smartphone's power budget. Such energyefficient reconstruction enables two-to-three times energy saving at the sensor nodes in a CS-based health monitoring system as compared to traditional Nyquist-based systems, while providing timely feedback and bringing signal intelligence closer to the user.


Dragonfly wing nodus: A one-way hinge contributing to the asymmetric wing deformation.

Dragonfly wings are highly specialized locomotor systems, which are formed by a combination of several structural components. The wing components, also known as structural elements, are responsible for the various aspects of the wing functionality. Considering the complex interactions between the wing components, modelling of the wings as a whole is only possible with inevitable huge oversimplifications. In order to overcome this difficulty, we have recently proposed a new approach to model individual components of complex wings comparatively. Here, we use this approach to study nodus, a structural element of dragonfly wings which has been less studied to date. Using a combination of several imaging techniques including scanning electron microscopy (SEM), wide-field fluorescence microscopy (WFM), confocal laser scanning microscopy (CLSM) and micro-computed tomography (micro-CT) scanning, we aim to characterize the spatial morphology and material composition of fore- and hindwing nodi of the dragonfly Brachythemis contaminata. The microscopy results show the presence of resilin in the nodi, which is expected to help the deformability of the wings. The computational results based on three-dimensional (3D) structural data suggest that the specific geometry of the nodus restrains its displacements when subjected to pressure on the ventral side. This effect, resulting from an interlocking mechanism, is expected to contribute to the dorso-ventral asymmetry of wing deformation and to provide a higher resistance to aerodynamic forces during the downstroke. Our results provide an important step towards better understanding of the structure-property-function relationship in dragonfly wings.

STATEMENT OF SIGNIFICANCE
In this study, we investigate the wing nodus, a specialized wing component in dragonflies. Using a combination of modern imaging techniques, we demonstrate the presence of resilin in the nodus, which is expected to facilitate the wing deformability in flight. The specific geometry of the nodus, however, seems to restrain its displacements when subjected to pressure on the ventral side. This effect, resulting from an interlocking mechanism, is suggested to contribute to dorso-ventral asymmetry of wing deformations and to provide a higher resistance to aerodynamic forces during the downstroke. Our results provide an important step towards better understanding of the structure-property-function relationship in dragonfly wings and might help to design more efficient wings for biomimetic micro-air vehicles.


Single-stage 6.78 MHz power-amplifier design using high-voltage GaN power ICs for wireless charging applications

Traditional power amplifiers for wireless power transfer require a low voltage dc power supply generated by a power adapter. This multi-stage power conversion solution reduces the overall efficiency. A single-stage “AC-RF” power amplifier architecture using a phase-modulated full-bridge topology and high voltage GaN Power ICs is proposed to directly generate 6.78 MHz wireless power from a rectified ac source. A 50W power amplifier is built and achieves 90% ac-to-coil efficiency, which reduces overall power loss by half, comparing to existing multi-stage solutions. The operating principle of a phase-shifted full bridge power amplifier is discussed, and analytical equations are provided for the passive filter network design. A coupled ZVS-tank scheme is also proposed to improve efficiency.


Batch Mode Active Learning for Regression With Expected Model Change

While active learning (AL) has been widely studied for classification problems, limited efforts have been done on AL for regression. In this paper, we introduce a new AL framework for regression, expected model change maximization (EMCM), which aims at choosing the unlabeled data instances that result in the maximum change of the current model once labeled. The model change is quantified as the difference between the current model parameters and the updated parameters after the inclusion of the newly selected examples. In light of the stochastic gradient descent learning rule, we approximate the change as the gradient of the loss function with respect to each single candidate instance. Under the EMCM framework, we propose novel AL algorithms for the linear and nonlinear regression models. In addition, by simulating the behavior of the sequential AL policy when applied for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> iterations, we further extend the algorithms to batch mode AL to simultaneously choose a set of <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> most informative instances at each query time. Extensive experimental results on both UCI and StatLib benchmark data sets have demonstrated that the proposed algorithms are highly effective and efficient.


End-to-End Sound Source Separation Conditioned On Instrument Labels

Can we perform an end-to-end sound source separation (SSS) with a variable number of sources using a deep learning model? This paper presents an extension of the WaveU-Net [1] model which allows end-to-end monaural source separation with a non-fixed number of sources. Furthermore, we propose multiplicative conditioning with instrument labels at the bottleneck of the Wave-U-Net and show its effect on the separation results. This approach can be further extended to other types of conditioning such as audio-visual SSS and score-informed SSS.


Applying Genre-Based Ontologies to Enterprise Architecture

This paper elaborates the approach of using ontologies as a conceptual base for enterprise architecture (EA) descriptions. The method focuses on recognising and modelling business critical information concepts, their content, and semantics used to operate the business. Communication genres and open and semi-structured information need interviews are used as a domain analysis method. Ontologies aim to explicate the results of domain analysis and to provide a common reference model for Business Information Architecture (BIA) descriptions. The results are generalised to model further aspects of EA.


Evaluation of LoRa receiver performance under co-technology interference

LoRa networks achieve a remarkably wide coverage as compared to that of the conventional wireless systems by employing the chirp spread spectrum (CSS). However, single-hop LoRa networks have limited penetration in indoor environments and cannot efficiently utilize the multiple-access dimensions arising from different spreading factors (SF) because the star topology is typically used for LoRa. On the other hand, a multi-hop LoRa network has the potential to realize extensive network coverage by utilizing packet relaying and improving the network capacity by utilizing different SFs. We evaluated the LoRa receiver performance under co-technology interference via simulation and experiments to realize these potentials. The results show that LoRa can survive interference from time-synchronized packets transmitted by multiple transmitters with an identical SF. Furthermore, we examined the orthogonality between different SFs by evaluating the required signal-to-interference ratio (SIR). Finally, we demonstrated the possibility of employing different SFs to construct the pipeline in a multi-hop relay network to increase network efficiency.


A decision model for evaluating third-party logistics providers using fuzzy analytic hierarchy process

As a consequence of an increasing trend toward the outsourcing of logistics activities, shippers have been faced with the inevitability of selecting an appropriate third-party logistics (3PL) provider. The selection process for the identification of a 3PL provider that best fits user requirements involves multiple criteria and alternatives and may be one of the most complex decisions facing logistics users. In this regard, this study proposes an evaluation framework and methodology for selecting a suitable 3PL provider and illustrates the process of evaluation and selection through a case study. It is expected that the results of this study will provide a practical reference for logistics managers who want to engage the best 3PL provider. Future research using different datasets is warranted to verify the generalizability of the findings.


A Short-Term Rainfall Prediction Model Using Multi-task Convolutional Neural Networks

Precipitation prediction, such as short-term rainfall prediction, is a very important problem in the field of meteorological service. In practice, most of recent studies focus on leveraging radar data or satellite images to make predictions. However, there is another scenario where a set of weather features are collected by various sensors at multiple observation sites. The observations of a site are sometimes incomplete but provide important clues for weather prediction at nearby sites, which are not fully exploited in existing work yet. To solve this problem, we propose a multi-task convolutional neural network model to automatically extract features from the time series measured at observation sites and leverage the correlation between the multiple sites for weather prediction via multi-tasking. To the best of our knowledge, this is the first attempt to use multi-task learning and deep learning techniques to predict short-term rainfall amount based on multi-site features. Specifically, we formulate the learning task as an end-to-end multi-site neural network model which allows to leverage the learned knowledge from one site to other correlated sites, and model the correlations between different sites. Extensive experiments show that the learned site correlations are insightful and the proposed model significantly outperforms a broad set of baseline models including the European Centre for Medium-range Weather Forecasts system (ECMWF).


Consumer Brand Engagement in Social Media : Conceptualization , Scale Development & Validation

Consumer Brand Engagement in Social Media: Conceptualization, Scale Development & Validation Abstract In the last three decades an influential research stream has emerged, which highlights the dynamics of focal consumer/brand relationships. Specifically, more recently the ‘consumer brand engagement’ (CBE) concept has been postulated to more comprehensively reflect the nature of consumers’ particular interactive brand relationships, relative to traditional concepts, including ‘involvement.’ However, despite the growing scholarly interest regarding the undertaking of marketing research addressing ‘engagement,’ studies have been predominantly exploratory in nature; thus generating a lack of empirical research in this area to date. By developing and validating a CBE scale in specific social media settings, we address this identified literature gap. Specifically, we conceptualize CBE as a consumer’s positively valenced brand-related cognitive, emotional and behavioral activity during or related to focal consumer/brand interactions. We derive three CBE dimensions, including cognitive processing, affection, and activation. Within three different social media contexts, we employ exploratory and confirmatory factor analyses to develop a reliable, 10-item CBE scale, which we proceed to validate within a nomological net of conceptual relationships and a rival model. The findings suggest that while consumer brand ‘involvement’ acts as a CBE antecedent, consumer ‘self-brand connection’ and ‘brand usage intent’ represent key CBE consequences; thus providing a platform for further research in this emerging area. We conclude with an overview of key managerial and scholarly implications arising from this research.


The efficiency frontier approach to economic evaluation of health-care interventions.

BACKGROUND
IQWiG commissioned an international panel of experts to develop methods for the assessment of the relation of benefits to costs in the German statutory health-care system.

PROPOSED METHODS
The panel recommended that IQWiG inform German decision makers of the net costs and value of additional benefits of an intervention in the context of relevant other interventions in that indication. To facilitate guidance regarding maximum reimbursement, this information is presented in an efficiency plot with costs on the horizontal axis and value of benefits on the vertical. The efficiency frontier links the interventions that are not dominated and provides guidance. A technology that places on the frontier or to the left is reasonably efficient, while one falling to the right requires further justification for reimbursement at that price. This information does not automatically give the maximum reimbursement, as other considerations may be relevant. Given that the estimates are for a specific indication, they do not address priority setting across the health-care system.

CONCLUSION
This approach informs decision makers about efficiency of interventions, conforms to the mandate and is consistent with basic economic principles. Empirical testing of its feasibility and usefulness is required.


Lane detection and tracking system based on the MSER algorithm, hough transform and kalman filter

We present a novel lane detection and tracking system using a fusion of Maximally Stable Extremal Regions (MSER) and Progressive Probabilistic Hough Transform (PPHT). First, MSER is applied to obtain a set of blobs including noisy pixels (e.g., trees, cars and traffic signs) and the candidate lane markings. A scanning refinement algorithm is then introduced to enhance the results of MSER and filter out noisy data. After that, to achieve the requirements of real-time systems, the PPHT is applied. Compared to Hough transform which returns the parameters ρ and Θ, PPHT returns two end-points of the detected line markings. To track lane markings, two kalman trackers are used to track both end-points. Several experiments are conducted in Ottawa roads to test the performance of our framework. The detection rate of the proposed system averages 92.7% and exceeds 84.9% in poor conditions.


IT capability and organizational performance: the roles of business process agility and environmental factors

School of Business Administration, Southwestern University of Finance and Economics, Sichuan, P. R. of China; Business School, Shantou University, Guangdong, P. R. of China; Information Technology Management, School of Business, University at Albany, Albany, NY, U.S.A; Department of Management, Hong Kong University of Science and Technology, Hong Kong, P.R. China; Department of Finance and Decision Sciences, School of Business, Hong Kong Baptist University, Hong Kong, P.R. China


Maximum Performance Computing with Dataflow Engines

Multidisciplinary dataflow computing is a powerful approach to scientific computing that has led to orders-of-magnitude performance improvements for a wide range of applications.


Crowdfunding : tapping the right crowd

The basic idea of crowdfunding is to raise external finance from a large audience (the “crowd”), where each individual provides a very small amount, instead of soliciting a small group of sophisticated investors. The paper develops a model that associates crowdfunding with pre-ordering and price discrimination, and studies the conditions under which crowdfunding is preferred to traditional forms of external funding. Compared to traditional funding, crowdfunding has the advantage of offering an enhanced experience to some consumers and, thereby, of allowing the entrepreneur to practice menu pricing and extract a larger share of the consumer surplus; the disadvantage is that the entrepreneur is constrained in his/her choice of prices by the amount of capital that he/she needs to raise: the larger this amount, the more prices have to be twisted so as to attract a large number of “crowdfunders” who pre-order, and the less profitable the menu pricing scheme.


Opportunistic Flooding in Low-Duty-Cycle Wireless Sensor Networks with Unreliable Links

Intended for network-wide dissemination of commands, configurations and code binaries, flooding has been investigated extensively in wireless networks. However, little work has yet been done on low-duty-cycle wireless sensor networks in which nodes stay asleep most of time and wake up asynchronously. In this type of network, a broadcasting packet is rarely received by multiple nodes simultaneously, a unique constraining feature that makes existing solutions unsuitable. Combined with unreliable links, flooding in low-duty-cycle networks is a new challenging issue.
 In this paper, we introduce Opportunistic Flooding, a novel design tailored for low-duty-cycle networks with unreliable wireless links and predetermined working schedules. The key idea is to make probabilistic forwarding decisions at a sender based on the delay distribution of next-hop nodes. Only opportunistically early packets are forwarded using links outside the energy optimal tree to reduce the flooding delay and redundancy in transmission. To improve performance further, we propose a forwarder selection method to alleviate the hidden terminal problem and a link-quality-based backoff method to resolve simultaneous forwarding operations. We evaluate Opportunistic Flooding with extensive simulation and a test-bed implementation consisting of 30 MicaZ nodes. Evaluation shows our design is close to the optimal performance achievable by oracle flooding designs. Compared with improved traditional flooding, our design achieves significantly shorter flooding delay while consuming only 20% ~ 60% of the transmission energy in various low-duty-cycle network settings.


How can machine learning help stock investment ?

The million-dollar question for stock investors is if the price of a stock will rise or not. The fluctuation of stock market is violent and there are many complicated financial indicators. Only people with extensive experience and knowledge can understand the meaning of the indicators, use them to make good prediction to get fortune. Most of other people can only rely on lucky to earn money from stock trading. Machine learning is an opportunity for ordinary people to gain steady fortune from stock market and also can help experts to dig out the most informative indicators and make better prediction.


Activities on Facebook Reveal the Depressive State of Users

BACKGROUND
As online social media have become prominent, much effort has been spent on identifying users with depressive symptoms in order to aim at early diagnosis, treatment, and even prevention by using various online social media. In this paper, we focused on Facebook to discern any correlations between the platform's features and users' depressive symptoms. This work may be helpful in trying to reach and detect large numbers of depressed individuals more easily.

OBJECTIVE
Our goal was to develop a Web application and identify depressive symptom-related features from users of Facebook, a popular social networking platform.

METHODS
55 Facebook users (male=40, female=15, mean age 24.43, SD 3.90) were recruited through advertisement fliers distributed to students in a large university in Korea. Using EmotionDiary, the Facebook application we developed, we evaluated depressive symptoms using the Center for Epidemiological Studies-Depression (CES-D) scale. We also provided tips and facts about depression to participants and measured their responses using EmotionDiary. To identify the Facebook features related to depression, correlation analyses were performed between CES-D and participants' responses to tips and facts or Facebook social features. Last, we interviewed depressed participants (CES-D≥25) to assess their depressive symptoms by a psychiatrist.

RESULTS
Facebook activities had predictive power in distinguishing depressed and nondepressed individuals. Participants' response to tips and facts, which can be explained by the number of app tips viewed and app points, had a positive correlation (P=.04 for both cases), whereas the number of friends and location tags had a negative correlation with the CES-D scale (P=.08 and P=.045 respectively). Furthermore, in finding group differences in Facebook social activities, app tips viewed and app points resulted in significant differences (P=.01 and P=.03 respectively) between probably depressed and nondepressed individuals.

CONCLUSIONS
Our results using EmotionDiary demonstrated that the more depressed one is, the more one will read tips and facts about depression. We also confirmed depressed individuals had significantly fewer interactions with others (eg, decreased number of friends and location tagging). Our app, EmotionDiary, can successfully evaluate depressive symptoms as well as provide useful tips and facts to users. These results open the door for examining Facebook activities to identify depressed individuals. We aim to conduct the experiment in multiple cultures as well.


KidCAD: digitally remixing toys through tangible tools

Children have great facility in the physical world, and can skillfully model in clay and draw expressive illustrations. Traditional digital modeling tools have focused on mouse, keyboard and stylus input. These tools may be complicated and difficult for young users to easily and quickly create exciting designs. We seek to bring physical interaction to digital modeling, to allow users to use existing physical objects as tangible building blocks for new designs. We introduce KidCAD a digital clay interface for children to remix toys. KidCAD allows children to imprint 2.5D shapes from physical objects into their digital models by deforming a malleable gel input device, deForm. Users can mashup existing objects, edit and sculpt or draw new designs on a 2.5D canvas using physical objects, hands and tools as well as 2D touch gestures. We report on a preliminary user study with 13 children, ages 7 to 10, which provides feedback for our design and helps guide future work in tangible modeling for children.


3D Human Body Reconstruction from a Single Image via Volumetric Regression

This paper proposes the use of an end-to-end Convolutional Neural Network for direct reconstruction of the 3D geometry of humans via volumetric regression. The proposed method does not require the fitting of a shape model and can be trained to work from a variety of input types, whether it be landmarks, images or segmentation masks. Additionally, non-visible parts, either self-occluded or otherwise, are still reconstructed, which is not the case with depth map regression. We present results that show that our method can handle both pose variation and detailed reconstruction given appropriate datasets for training.


Human hand modelling: kinematics, dynamics, applications

An overview of mathematical modelling of the human hand is given. We consider hand models from a specific background: rather than studying hands for surgical or similar goals, we target at providing a set of tools with which human grasping and manipulation capabilities can be studied, and hand functionality can be described. We do this by investigating the human hand at various levels: (1) at the level of kinematics, focussing on the movement of the bones of the hand, not taking corresponding forces into account; (2) at the musculotendon structure, i.e. by looking at the part of the hand generating the forces and thus inducing the motion; and (3) at the combination of the two, resulting in hand dynamics as well as the underlying neurocontrol. Our purpose is to not only provide the reader with an overview of current human hand modelling approaches but also to fill the gaps with recent results and data, thus allowing for an encompassing picture.


Accurate, Robust, and Flexible Real-time Hand Tracking

We present a new real-time hand tracking system based on a single depth camera. The system can accurately reconstruct complex hand poses across a variety of subjects. It also allows for robust tracking, rapidly recovering from any temporary failures. Most uniquely, our tracker is highly flexible, dramatically improving upon previous approaches which have focused on front-facing close-range scenarios. This flexibility opens up new possibilities for human-computer interaction with examples including tracking at distances from tens of centimeters through to several meters (for controlling the TV at a distance), supporting tracking using a moving depth camera (for mobile scenarios), and arbitrary camera placements (for VR headsets). These features are achieved through a new pipeline that combines a multi-layered discriminative reinitialization strategy for per-frame pose estimation, followed by a generative model-fitting stage. We provide extensive technical details and a detailed qualitative and quantitative analysis.


Real-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input

Real-time simultaneous tracking of hands manipulating and interacting with external objects has many potential applications in augmented reality, tangible computing, and wearable computing. However, due to difficult occlusions, fast motions, and uniform hand appearance, jointly tracking hand and object pose is more challenging than tracking either of the two separately. Many previous approaches resort to complex multi-camera setups to remedy the occlusion problem and often employ expensive segmentation and optimization steps which makes real-time tracking impossible. In this paper, we propose a real-time solution that uses a single commodity RGB-D camera. The core of our approach is a 3D articulated Gaussian mixture alignment strategy tailored to handobject tracking that allows fast pose optimization. The alignment energy uses novel regularizers to address occlusions and hand-object contacts. For added robustness, we guide the optimization with discriminative part classification of the hand and segmentation of the object. We conducted extensive experiments on several existing datasets and introduce a new annotated hand-object dataset. Quantitative and qualitative results show the key advantages of our method: speed, accuracy, and robustness.


Terminological ontology learning and population using latent Dirichlet allocation

The success of Semantic Web will heavily rely on the availability of formal ontologies to structure machine understanding data. However, there is still a lack of general methodologies for ontology automatic learning and population, i.e. the generation of domain ontologies from various kinds of resources by applying natural language processing and machine learning techniques In this paper, the authors present an ontology learning and population system that combines both statistical and semantic methodologies. Several experiments have been carried out, demonstrating the effectiveness of the proposed system. Keywords-Ontologies, Ontology Learning, Ontology Population, Latent Dirichlet Allocation


Evolutionary Competition in Platform Ecosystems

I competition has received scant attention in prior studies, which predominantly study interplatform competition. We develop a middle-range theory of how complementarity between input control and a platform extension’s modularization—by inducing evolution—influences its performance in a platform market. Primary and archival data spanning five years from 342 Firefox extensions show that such complementarity fosters performance by accelerating an extension’s perpetual evolution.


Cache in the air: exploiting content caching and delivery techniques for 5G systems

The demand for rich multimedia services over mobile networks has been soaring at a tremendous pace over recent years. However, due to the centralized architecture of current cellular networks, the wireless link capacity as well as the bandwidth of the radio access networks and the backhaul network cannot practically cope with the explosive growth in mobile traffic. Recently, we have observed the emergence of promising mobile content caching and delivery techniques, by which popular contents are cached in the intermediate servers (or middleboxes, gateways, or routers) so that demands from users for the same content can be accommodated easily without duplicate transmissions from remote servers; hence, redundant traffic can be significantly eliminated. In this article, we first study techniques related to caching in current mobile networks, and discuss potential techniques for caching in 5G mobile networks, including evolved packet core network caching and radio access network caching. A novel edge caching scheme based on the concept of content-centric networking or information-centric networking is proposed. Using trace-driven simulations, we evaluate the performance of the proposed scheme and validate the various advantages of the utilization of caching content in 5G mobile networks. Furthermore, we conclude the article by exploring new relevant opportunities and challenges.


The German Traffic Sign Recognition Benchmark: A multi-class classification competition

The “German Traffic Sign Recognition Benchmark” is a multi-category classification competition held at IJCNN 2011. Automatic recognition of traffic signs is required in advanced driver assistance systems and constitutes a challenging real-world computer vision and pattern recognition problem. A comprehensive, lifelike dataset of more than 50,000 traffic sign images has been collected. It reflects the strong variations in visual appearance of signs due to distance, illumination, weather conditions, partial occlusions, and rotations. The images are complemented by several precomputed feature sets to allow for applying machine learning algorithms without background knowledge in image processing. The dataset comprises 43 classes with unbalanced class frequencies. Participants have to classify two test sets of more than 12,500 images each. Here, the results on the first of these sets, which was used in the first evaluation stage of the two-fold challenge, are reported. The methods employed by the participants who achieved the best results are briefly described and compared to human traffic sign recognition performance and baseline results.


American Sign Language Translation through Sensory Glove ; SignSpeak

To make a communication bridge, a highly accurate, cost effective and an independent glove was designed for deaf/mute people to enable them to communicate. The glove translates the sign language gestures into speech according to the American Sign Language Standard. The glove contained flex and contact sensors to detect the movements of the fingers and bending of the palm. In addition an accelerometer was built in the glove to measure the acceleration produced by the changing positions of the hand. Principal Component Analysis (PCA) was used to train the glove into recognizing various gestures, and later classify the gestures into alphabets in real time. The glove then established a Bluetooth link with an Android phone, which was used to display the received letters and words and convert the text into speech. The glove was found to have an accuracy of 92%.


Extreme scale with full SQL language support in microsoft SQL Azure

Cloud SQL Server is an Internet scale relational database service which is currently used by Microsoft delivered services and also offered directly as a fully relational database service known as "SQL Azure". One of the principle design objectives in Cloud SQL Server was to provide true SQL support with full ACID transactions within controlled scale "consistency domains" and provide a relaxed degree of consistency across consistency domains that would be viable to clusters of 1,000's of nodes. In this paper, we describe the implementation of Cloud SQL Server with an emphasis on this core design principle.


Multiwave: Doppler Effect Based Gesture Recognition in Multiple Dimensions

We constructed an acoustic, gesture-based recognition system called Multiwave, which leverages the Doppler Effect to translate multidimensional movements into user interface commands. Our system only requires the use of two speakers and a microphone to be operational. Since these components are already built in to most end user systems, our design makes gesture-based input more accessible to a wider range of end users. By generating a known high frequency tone from multiple speakers and detecting movement using changes in the sound waves, we are able to calculate a Euclidean representation of hand velocity that is then used for more natural gesture recognition and thus, more meaningful interaction mappings. We present the results of a user study of Multiwave to evaluate recognition rates for different gestures and report accuracy rates comparable to or better than the current state of the art. We also report subjective user feedback and some lessons learned from our system that provide additional insight for future applications of multidimensional gesture recognition.


An inventory for measuring clinical anxiety: psychometric properties.

The development ofa 2 l-item self-report inventory for measuring the severity of anxiety in psychiatric populations is described. The initial item pool of 86 items was drawn from three preexisting scales: the Anxiety Checklist, the Physician's Desk Reference Checklist, and the Situational Anxiety Checklist. A series of analyses was used to reduce the item pool. The resulting Beck Anxiety Inventory (BAI) is a 21-item scale that showed high internal consistency (a = .92) and test-retest reliability over 1 week, r(81) = .75. The BAI discriminated anxious diagnostic groups (panic disorder, generalized anxiety disorder, etc.) from nonanxious diagnostic groups (major depression, dysthymic disorder, etc). In addition, the BAI was moderately correlated with the revised Hamilton Anxiety Rating Scale, r(150) = .51, and was only mildly correlated with the revised Hamilton Depression Rating Scale, r(l 53) = .25.


Manifold surface reconstruction of an environment from sparse Structure-from-Motion data

The majority of methods for the automatic surface reconstruction of an environment from an image sequence have two steps: Structure-from-Motion and dense stereo. From the computational standpoint, it would be interesting to avoid dense stereo and to generate a surface directly from the sparse cloud of 3D points and their visibility information provided by Structure-fromMotion. The previous attempts to solve this problem are currently very limited: the surface is non-manifold or has zero genus, the experiments are done on small scenes or objects using a few dozens of images. Our solution does not have these limitations. Furthermore, we experiment with hand-held or helmet-held catadioptric cameras moving in a city and generate 3D models such that the camera trajectory can be longer than one kilometer.


A coordinate gradient descent method for ℓ1-regularized convex minimization

In applications such as signal processing and statistics, many problems involve finding sparse solutions to under-determined linear systems of equations. These problems can be formulated as a structured nonsmooth optimization problems, i.e., the problem of minimizing `1-regularized linear least squares problems. In this paper, we propose a block coordinate gradient descent method (abbreviated as CGD) to solve the more general `1-regularized convex minimization problems, i.e., the problem of minimizing an `1-regularized convex smooth function. We establish a Q-linear convergence rate for our method when the coordinate block is chosen by a Gauss-Southwell-type rule to ensure sufficient descent. We propose efficient implementations of the CGD method and report numerical results for solving large-scale `1-regularized linear least squares problems arising in compressed sensing and image deconvolution as well as large-scale `1-regularized logistic regression problems for feature selection in data classification. Comparison with several state-of-the-art algorithms specifically designed for solving large-scale `1-regularized linear least squares or logistic regression problems suggests that an efficiently implemented CGD method may outperform these algorithms despite the fact that the CGD method is not specifically designed just to solve these special classes of problems.


Application of Computational Intelligence to Improve Education in Smart Cities

According to UNESCO, education is a fundamental human right and every nation's citizens should be granted universal access with equal quality to it. Because this goal is yet to be achieved in most countries, in particular in the developing and underdeveloped countries, it is extremely important to find more effective ways to improve education. This paper presents a model based on the application of computational intelligence (data mining and data science) that leads to the development of the student's knowledge profile and that can help educators in their decision making for best orienting their students. This model also tries to establish key performance indicators to monitor objectives' achievement within individual strategic planning assembled for each student. The model uses random forest for classification and prediction, graph description for data structure visualization and recommendation systems to present relevant information to stakeholders. The results presented were built based on the real dataset obtained from a Brazilian private k-9 (elementary school). The obtained results include correlations among key data, a model to predict student performance and recommendations that were generated for the stakeholders.


On self-aggrandizement and anger: a temporal analysis of narcissism and affective reactions to success and failure.

Narcissists are thought to display extreme affective reactions to positive and negative information about the self. Two experiments were conducted in which high- and low-narcissistic individuals, as defined by the Narcissistic Personality Inventory (NPI), completed a series of tasks in which they both succeeded and failed. After each task, participants made attributions for their performance and reported their moods. High-NPI participants responded with greater changes in anxiety, anger, and self-esteem. Low self-complexity was examined, but it neither mediated nor moderated affective responses. High-NPI participants tended to attribute initial success to ability, leading to more extreme anger responses and greater self-esteem reactivity to failure. A temporal sequence model linking self-attribution and emotion to narcissistic rage is discussed.


Optimal and Low-Complexity Algorithms for Dynamic Spectrum Access in Centralized Cognitive Radio Networks with Fading Channels

In this paper, we develop a centralized spectrum sensing and Dynamic Spectrum Access (DSA) scheme for secondary users (SUs) in a Cognitive Radio (CR) network. Assuming that the primary channel occupancy follows a Markovian evolution, the channel sensing problem is modeled as a Partially Observable Markov Decision Process (POMDP). We assume that each SU can sense only one channel at a time by using energy detection, and the sensing outcomes are then reported to a central unit, called the secondary system decision center (SSDC), that determines the channel sensing/accessing policies. We derive both the optimal channel assignment policy for secondary users to sense the primary channels, and the optimal channel access rule. Our proposed optimal sensing and accessing policies alleviate many shortcomings and limitations of existing proposals: (a) ours allows fully utilizing all available primary spectrum white spaces, (b) our model, and thus the proposed solution, exploits the temporal and spatial diversity across different primary channels, and (c) is based on realistic local sensing decisions rather than complete knowledge of primary signalling structure. As an alternative to the high complexity of the optimal channel sensing policy, a suboptimal sensing policy is obtained by using the Hungarian algorithm iteratively, which reduces the complexity of the channel assignment from an exponential to a polynomial order. We also propose a heuristic algorithm that reduces the complexity of the sensing policy further to a linear order. The simulation results show that the proposed algorithms achieve a near-optimal performance with a significant reduction in computational time.


Compact Design of a Hydraulic Driving Robot for Intraoperative MRI-Guided Bilateral Stereotactic Neurosurgery

In this letter, we present an intraoperative magnetic resonance imaging (MRI)-guided robot for bilateral stereotactic procedures. Its compact design enables robot's operation within the constrained space of standard imaging head coil. magnetic resonance (MR) safe and high-performance hydraulic transmissions are incorporated. A maximum stiffness coefficient of 24.35 N/mm can be achieved with transmission fluid preloaded at 2 bar. Sufficient targeting accuracy (average within ≤1.73 mm) has been demonstrated in a simulated needle insertion task of deep brain stimulation. A novel MR-based wireless tracking technique is adopted. It is capable of offering real-time and continuous (30–40 Hz) three-dimensional (3-D) localization of robotic instrument under the proper MR tracking sequence. It outperforms the conventional method of using low-contrast passive fiducials that can only be revealed in the MR image domain. Two wireless tracking units/markers are integrated with the robot, which are two miniaturized coil circuits in size of 1.5 × 5 × 0.2 mm3, fabricated on flexible thin films. A navigation test was performed under the standard MRI settings in order to visualize the 3-D localization of the robotic instrument. MRI compatibility test was also carried out to prove the minimal interference to MR images of the presented hydraulic robotic platform.


The Cricket location-support system

This paper presents the design, implementation, and evaluation of Cricket, a location-support system for in-building, mobile, location-dependent applications. It allows applications running on mobile and static nodes to learn their physical location by using listeners that hear and analyze information from beacons spread throughout the building. Cricket is the result of several design goals, including user privacy, decentralized administration, network heterogeneity, and low cost. Rather than explicitly tracking user location, Cricket helps devices learn where they are and lets them decide whom to advertise this information to; it does not rely on any centralized management or control and there is no explicit coordination between beacons; it provides information to devices regardless of their type of network connectivity; and each Cricket device is made from off-the-shelf components and costs less than U.S. $10. We describe the randomized algorithm used by beacons to transmit information, the use of concurrent radio and ultrasonic signals to infer distance, the listener inference algorithms to overcome multipath and interference, and practical beacon configuration and positioning techniques that improve accuracy. Our experience with Cricket shows that several location-dependent applications such as in-building active maps and device control can be developed with little effort or manual configuration.


Debunking the Myths of Influence Maximization: An In-Depth Benchmarking Study

Influence maximization (IM) on social networks is one of the most active areas of research in computer science. While various IM techniques proposed over the last decade have definitely enriched the field, unfortunately, experimental reports on existing techniques fall short in validity and integrity since many comparisons are not based on a common platform or merely discussed in theory. In this paper, we perform an in-depth benchmarking study of IM techniques on social networks. Specifically, we design a benchmarking platform, which enables us to evaluate and compare the existing techniques systematically and thoroughly under identical experimental conditions. Our benchmarking results analyze and diagnose the inherent deficiencies of the existing approaches and surface the open challenges in IM even after a decade of research. More fundamentally, we unearth and debunk a series of myths and establish that there is no single state-of-the-art technique in IM. At best, a technique is the state of the art in only one aspect.


A 5.8-Gb/s Adaptive Integrating Duobinary DFE Receiver for Multi-Drop Memory Interface

This paper describes a 5.8 Gb/s adaptive integrating duobinary decision-feedback equalizer (DFE) for use in next-generation multi-drop memory interface. The proposed receiver combines traditional interface techniques like the integrated signaling and the duobinary signaling, in which the duobinary signal is generated by current integration in the receiver. It can address issues such as input data dependence during integration, need for precursor equalization, high equalizer gain boosting, and sensitivity to high-frequency noise. The proposed receiver also alleviates DFE critical timing to provide gain in speed, and embed DFE taps in duobinary decoding to provide gain in power and area. The adaptation for adjusting the equalizer common-mode level, duobinary zero level, tap coefficient values, and timing recovery is incorporated. The proposed DFE receiver was fabricated in a 45 nm CMOS process, whose measurement results indicated that it worked at 5.8 Gb/s speed in a four-drop channel configuration with seven slave ICs, and the bathtub curve shows 36% open for  $10^{-10}$  bit error rate.


A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory

Since the definition of the busy beaver function by Rado in 1962, an interesting open question has been the smallest value of n for which BB(n) is independent of Zermelo–Fraenkel set theory with the axiom of choice (ZFC). Is this n approximately 10, or closer to 1 000 000, or is it even larger? In this paper, we show that it is at most 7910 by presenting an explicit description of a 7910-state Turing machine Z with one tape and a two-symbol alphabet that cannot be proved to run forever in ZFC (even though it presumably does), assuming ZFC is consistent. The machine is based on work of Harvey Friedman on independent statements involving order-invariant graphs. In doing so, we give the first known upper bound on the highest provable busy beaver number in ZFC. To create Z, we develop and use a higher-level language, Laconic, which is much more convenient than direct state manipulation. We also use Laconic to design two Turing machines, G and R, that halt if and only if there are counterexamples to Goldbach’s conjecture and the Riemann hypothesis, respectively.


Graph analytics using vertica relational database

Graph analytics is becoming increasingly popular, with a number of new applications and systems developed in the past few years. In this paper, we study Vertica relational database as a platform for graph analytics. We show that vertex-centric graph analysis can be translated to SQL queries, typically involving table scans and joins, and that modern column-oriented databases are very well suited to running such queries. Furthermore, we show how developers can trade memory footprint for significantly reduced I/O costs in Vertica. We present an experimental evaluation of the Vertica relational database system on a variety of graph analytics, including iterative analysis, a combination of graph and relational analyses, and more complex 1-hop neighborhood graph analytics, showing that it is competitive to two popular vertex-centric graph analytics systems, namely Giraph and GraphLab.


On the Reuse of Past Optimal Queries

Vijay V. Raghavan Hayri Sever The Center for Advanced Computer Studies The Department of Computer Science University of Southwestern Louisiana University of Southwestern Louisiana Lafayette, LA 70504, USA Lafayette, LA 70504, USA e-mail: raghavan@cacs.usl. edu Information Retrieval (IR) systems exploit user feedback by generating an optimal query with respect to a particular information need. Since obtaining an optimal query is an expensive process, the need for mechanisms to save and reuse past optimal queries for future queries is obvions. In this article, we propose the use of a query base, a set of persistent past optimal queries, and investigate similarity measures between queries. The query base can be used either to answer user queries or to formulate optimal queries. We justify the former case analytically and the latter case by experiment.


Learning to map between ontologies on the semantic web

Ontologies play a prominent role on the Semantic Web. They make possible the widespread publication of machine understandable data, opening myriad opportunities for automated information processing. However, because of the Semantic Web's distributed nature, data on it will inevitably come from many different ontologies. Information processing across ontologies is not possible without knowing the semantic mappings between their elements. Manually finding such mappings is tedious, error-prone, and clearly not possible at the Web scale. Hence, the development of tools to assist in the ontology mapping process is crucial to the success of the Semantic Web.We describe glue, a system that employs machine learning techniques to find such mappings. Given two ontologies, for each concept in one ontology glue finds the most similar concept in the other ontology. We give well-founded probabilistic definitions to several practical similarity measures, and show that glue can work with all of them. This is in contrast to most existing approaches, which deal with a single similarity measure. Another key feature of glue is that it uses multiple learning strategies, each of which exploits a different type of information either in the data instances or in the taxonomic structure of the ontologies. To further improve matching accuracy, we extend glue to incorporate commonsense knowledge and domain constraints into the matching process. For this purpose, we show that relaxation labeling, a well-known constraint optimization technique used in computer vision and other fields, can be adapted to work efficiently in our context. Our approach is thus distinguished in that it works with a variety of well-defined similarity notions and that it efficiently incorporates multiple types of knowledge. We describe a set of experiments on several real-world domains, and show that glue proposes highly accurate semantic mappings.


Determining Semantic Similarity among Entity Classes from Different Ontologies

Semantic similarity measures play an important role in information retrieval and information integration. Traditional approaches to modeling semantic similarity compute the semantic distance between definitions within a single ontology. This single ontology is either a domain-independent ontology or the result of the integration of existing ontologies. We present an approach to computing semantic similarity that relaxes the requirement of a single ontology and accounts for differences in the levels of explicitness and formalization of the different ontology specifications. A similarity function determines similar entity classes by using a matching process over synonym sets, semantic neighborhoods, and distinguishing features that are classified into parts, functions, and attributes. Experimental results with different ontologies indicate that the model gives good results when ontologies have complete and detailed representations of entity classes. While the combination of word matching and semantic neighborhood matching is adequate for detecting equivalent entity classes, feature matching allows us to discriminate among similar, but not necessarily equivalent, entity classes.


Issues in Stacked Generalization

Stacked generalization is a general method of using a high-level model to combine lowerlevel models to achieve greater predictive accuracy. In this paper we address two crucial issues which have been considered to be a `black art' in classi cation tasks ever since the introduction of stacked generalization in 1992 by Wolpert: the type of generalizer that is suitable to derive the higher-level model, and the kind of attributes that should be used as its input. We nd that best results are obtained when the higher-level model combines the con dence (and not just the predictions) of the lower-level ones. We demonstrate the e ectiveness of stacked generalization for combining three di erent types of learning algorithms for classi cation tasks. We also compare the performance of stacked generalization with majority vote and published results of arcing and bagging.


PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment

Researchers in the ontology-design field have developed the content for ontologies in many domain areas. Recently, ontologies have become increasingly common on the WorldWide Web where they provide semantics for annotations in Web pages. This distributed nature of ontology development has led to a large number of ontologies covering overlapping domains. In order for these ontologies to be reused, they first need to be merged or aligned to one another. The processes of ontology alignment and merging are usually handled manually and often constitute a large and tedious portion of the sharing process. We have developed and implemented PROMPT, an algorithm that provides a semi-automatic approach to ontology merging and alignment. PROMPT performs some tasks automatically and guides the user in performing other tasks for which his intervention is required. PROMPT also determines possible inconsistencies in the state of the ontology, which result from the user’s actions, and suggests ways to remedy these inconsistencies. PROMPT is based on an extremely general knowledge model and therefore can be applied across various platforms. Our formative evaluation showed that a human expert followed 90% of the suggestions that PROMPT generated and that 74% of the total knowledge-base operations invoked by the user were suggested by PROMPT. 1 Ontologies in AI and on the Web Ontologies today are available in many different forms: as artifacts of a tedious knowledge-engineering process, as information that was extracted automatically from informal electronic sources, or as simple “light-weight” ontologies that specify semantic relationships among resources available on the World-Wide Web (Brickley and Guha 1999). But what does a user do when he finds several ontologies that he would like to use but that do not conform to one another? The user must establish correspondences among the source ontologies, and to determine the set of overlapping concepts, concepts that are similar in meaning but have different names or structure, concepts that are unique to each of the sources. This work must be done regardless of whether the ultimate goal is to create a single coherent ontology that includes the information from all the sources ( merging) or if the sources must be made consistent and coherent with one another but kept separately ( alignment). Copyright © 2000, American Association for Artificial Intelligence ( www.aaai.org) . All rights reserved. Currently the work of mapping, merging, or aligning ontologies is performed mostly by hand, without any tools to automate the process fully or partially (Fridman Noy and Musen 1999).Our participation in the ontology-alignment effort within DARPA’s High-Performance KnowledgeBases project (Cohen et al. 1999) was a strong motivation for developing semi-automated specialized tools for ontology merging and alignment. Several teams developed ontologies in the domain of military planning, which then needed to be aligned to one another. We found the experience of manually aligning the ontologies to be an extremely tedious and time-consuming process. At the same time we noticed many steps in the process that could be automated, many points where a tool could make reasonable suggestions, and many conflicts and constraint violations for which a tool could check. We developed a formalism-independent algorithm for ontology merging and alignment—PROMPT (formerly SMART)—which automates the process as much as possible. Where an automatic decision is not possible, the algorithm guides the user to the places in the ontology where his intervention is necessary, suggests possible actions, and determines the conflicts in the ontology and proposes solutions for these conflicts. We implemented the algorithm in an interactive tool based on the Protégé-2000 knowledge-modeling environment (Fridman Noy et al. 2000). Protégé-2000 is an ontology-design and knowledgeacquisition tool with an OKBC-compatible (Chaudhri et al. 1998) knowledge model, which allows domain experts (and not necessarily knowledge engineers) to develop ontologies and perform knowledge acquisition. We have evaluated PROMPT, comparing its performance with the humanexpert performance and with the performance of another ontology-merging tool.


You are what you say: privacy risks of public mentions

In today's data-rich networked world, people express many aspects of their lives online. It is common to segregate different aspects in different places: you might write opinionated rants about movies in your blog under a pseudonym while participating in a forum or web site for scholarly discussion of medical ethics under your real name. However, it may be possible to link these separate identities, because the movies, journal articles, or authors you mention are from a sparse relation space whose properties (e.g., many items related to by only a few users) allow re-identification. This re-identification violates people's intentions to separate aspects of their life and can have negative consequences; it also may allow other privacy violations, such as obtaining a stronger identifier like name and address.This paper examines this general problem in a specific setting: re-identification of users from a public web movie forum in a private movie ratings dataset. We present three major results. First, we develop algorithms that can re-identify a large proportion of public users in a sparse relation space. Second, we evaluate whether private dataset owners can protect user privacy by hiding data; we show that this requires extensive and undesirable changes to the dataset, making it impractical. Third, we evaluate two methods for users in a public forum to protect their own privacy, suppression and misdirection. Suppression doesn't work here either. However, we show that a simple misdirection strategy works well: mention a few popular items that you haven't rated.


Richard Thaler and the Rise of Behavioral Economics

The emergence of behavioral economics is one of the most prominent conceptual developments in the social sciences in recent decades. The central figure in the field in its early years was Richard Thaler. In this article, I review and discuss his scientific contributions. JEL classification: B2, D9, G1


Development of a deep silicon phase Fresnel lens using Gray-scale lithography and deep reactive ion etching

We report the first fabrication and development of a deep phase Fresnel lens (PFL) in silicon through the use of gray-scale lithography and deep-reactive ion etching (DRIE). A Gaussian tail approximation is introduced as a method of predicting the height of photoresist gray levels given the relative amount of transmitted light through a gray-scale optical mask. Device mask design is accomplished through command-line scripting in a CAD tool to precisely define the millions of pixels required to generate the appropriate profile in photoresist. Etch selectivity during DRIE pattern transfer is accurately controlled to produce the desired scaling factor between the photoresist and silicon profiles. As a demonstration of this technology, a 1.6-mm diameter PFL is etched 43 /spl mu/m into silicon with each grating profile designed to focus 8.4 keV photons a distance of 118 m.


A Comparative Analysis of Enterprise Architecture Frameworks Based on EA Quality Attributes

Many Enterprise Architecture Frameworks (EAFs) are in use today to guide or serve as a model for the enterprise architecture development. Researchers offer general comparative information about EAF. However, there has been little work on the quality of Enterprise Architecture (EA). This study provides the characteristics of the five EAFs using comparative analysis based on Enterprise Architecture Quality Attributes (EAQAs). The attribute of EA quality was extracted from the EAFs and the definition of EAQA was defined from EA user viewpoint. The criteria for each quality attribute were developed to compare EAFs using four dimensional concepts. This paper compared several frameworks using the criteria to provide guidance in the selection of an EAF that meets the quality requirement of EA


Rational Choice Theory : Toward a Psychological , Social , and Material Contextualization of Human Choice Behavior

The main purpose of this paper is to provide a brief overview of the rational choice approach, followed by an identification of several of the major criticisms of RCT and its conceptual and empirical limitations. It goes on to present a few key initiatives to develop alternative, more realistic approaches which transcend some of the limitations of Rational Choice Theory (RCT). Finally, the article presents a few concluding reflections and a table comparing similarities and differences between the mainstream RCT and some of the initial components of an emerging choice theory. Our method has been to conduct a brief selective review of rational choice theoretical formulations and applications as well as a review of diverse critical literature in the social sciences where rational choice has been systematically criticized. We have focused on a number of leading contributors (among others, several Nobel Prize Recipients in economics, who have addressed rational choice issues). So this article makes no claim for completeness. The review maps a few key concepts and assumptions underpinning the conceptual model and empirical applications of RCT. It reviews also a range of critical arguments and evidence of limitations. It identifies selected emerging concepts and theoretical revisions and adaptations to choice theory and what they entail. The results obtained, based on our literature reviews and analyses, are the identification of several major limitations of RCT as well as selected modifications and adaptations of choice theory which overcome or promise to overcome some of the RCT limitations. Thus, the article with Table 1 in hand provides a point of departure for follow-up systematic reviews and more precise questions for future theory development. The criticisms and adaptations of RCT have contributed to greater realism, empirical relevance, and increased moral considerations. The developments entail, among other things: the now well-known cognitive limitations (“bounded rationality”) and, for instance, the role of satisficing rather than maximizing in decision-making to deal with cognitive T. Burns, E. Roszkowska 196 complexity and the uncertainties of multiple values; choice situations are re-contextualized with psychology, sociology, economic, and material conditions and factors which are taken into account explicitly and insightfully in empirical and theoretical work. Part of the contextualization concerns the place of multiple values, role and norm contradictions, and moral dilemmas in much choice behavior. In concluding, the article suggests that the adaptations and modifications made in choice theory have led to substantial fragmentation of choice theory and as of yet no integrated approach has appeared to simply displace RCT.


SASI: A New Ultralightweight RFID Authentication Protocol Providing Strong Authentication and Strong Integrity

As low-cost RFIDs become more and more popular, it is imperative to design ultralightweight RFID authentication protocols to resist all possible attacks and threats. However, all of the previous ultralightweight authentication schemes are vulnerable to various attacks. In this paper, we propose a new ultralightweight RFID authentication protocol that provides strong authentication and strong integrity protection of its transmission and of updated data. The protocol requires only simple bit-wise operations on the tag and can resist all the possible attacks. These features make it very attractive to low-cost RFIDs and very low-cost RFIDs.


Self-Supervised Generative Adversarial Networks

Conditional GANs are at the forefront of natural image synthesis. The main drawback of such models is the necessity for labelled data. In this work we exploit two popular unsupervised learning techniques, adversarial training and self-supervision, to close the gap between conditional and unconditional GANs. In particular, we allow the networks to collaborate on the task of representation learning, while being adversarial with respect to the classic GAN game. The role of self-supervision is to encourage the discriminator to learn meaningful feature representations which are not forgotten during training. We test empirically both the quality of the learned image representations, and the quality of the synthesized images. Under the same conditions, the self-supervised GAN attains a similar performance to stateof-the-art conditional counterparts. Finally, we show that this approach to fully unsupervised learning can be scaled to attain an FID of 33 on unconditional IMAGENET generation.


Digital Transformation in the Automotive Industry: towards a Generic Value Network

The emergence of digital innovations is accelerating and intervening existing business models by delivering opportunities for new services. Drawing on the automotive industry, leading trends like self-driving cars, connectivity and car sharing are creating new business models. These are simultaneously giving rise for innovative market entrants, which begin to transform the automotive industry. However, literature does not provide a generic value network of the automotive industry, including new market players. The paper aims to visualize the current automotive ecosystem, by evolving a generic value network using the e3-value method. We define different roles, which are operating in the automotive industry by analyzing 650 companies reported in the Crunchbase database and present the value streams within the ecosystem. To validate the proposed generic value network we conducted five preliminary interviews with experts from the automotive industry. Our results show the central role of mobility service platforms, emerging disruptive technology providers and the dissemination of industries, e.g., as OEMs collaborate with mobile payment providers. Scholars in this field can apply the developed generic value network for further research, while car manufacturers may apply the model to position themselves in their market and to identify possible disruptive actors or potential business opportunities.


Design of RYSEN: An Intrinsically Safe and Low-Power Three-Dimensional Overground Body Weight Support

Body weight support (BWS) systems are widely used in gait research and rehabilitation. This letter introduces a new three-dimensional overground BWS system, called the RYSEN. The RYSEN is designed to be intrinsically safe and low power consuming, while still performing at least as well as existing BWS systems regarding human–robot interaction. These features are mainly achieved by decoupling degrees of freedom between motors: slow/high-torque motors for vertical motion and fast/low-torque motors for horizontal motion. This letter explains the design and evaluates its performance on power consumption and safety. Power consumption is expressed in terms of the sum of the positive mechanical output power of all motor axes. Safety is defined as the difference between the mechanical power available for horizontal and vertical movements and the mechanical power that is needed to perform its task. The results of the RYSEN are compared to the performance of three similar systems: a gantry, the FLOAT, and a classic cable robot. The results show that the RYSEN and a gantry consume approximately the same amount of power. The amount is approximately half the power consumed by the next-best system. For the safety, the gantry is taken as the benchmark, because of its perfect decoupling of directions. The RYSEN has a surplus of 268 W and 126 W for horizontal and vertical movements, respectively. This is significantly lower than the next-best system, which has a surplus of 1088 W and 1967 W, respectively.


Interpretable and effective opinion spam detection via temporal patterns mining across websites

Millions of ratings and reviews on online review websites are influential over business revenues and customer experiences. However, spammers are posting fake reviews in order to gain financial benefits, at the cost of harming honest businesses and customers. Such fake reviews can be illegal and it is important to detect spamming attacks to eliminate unjust ratings and reviews. However, most of the current approaches can be incompetent as they can only utilize data from individual websites independently, or fail to detect more subtle attacks even they can fuse data from multiple sources. Further, the revealed evidence fails to explain the more complicated real world spamming attacks, hindering the detection processes that usually have human experts in the loop. We close this gap by introducing a novel framework that can jointly detect and explain the potential attacks. The framework mines both macroscopic level temporal sentimental patterns and microscopic level features from multiple review websites. We construct multiple sentimental time series to detect atomic dynamics, based on which we mine various cross-site sentimental temporal patterns that can explain various attacking scenarios. To further identify individual spams within the attacks with more evidence, we study and identify effective microscopic textual and behavioral features that are indicative of spams. We demonstrate via human annotations, that the simple and effective framework can spot a sizable collection of spams that have bypassed one of the current commercial anti-spam systems.


Aspect based sentiment analysis in social media with classifier ensembles

The analysis of user generated content on social media and the accurate specification of user opinions towards products and events is quite valuable to many applications. With the proliferation of Web 2.0 and the rapid growth of user-generated content on the web, approaches on aspect level sentiment analysis that yield fine grained information are of great interest. In this work, a classifier ensemble approach for aspect based sentiment analysis is presented. The approach is generic and utilizes latent dirichlet allocation to model a topic and to specify the main aspects that users address. Then, each comment is further analyzed and word dependencies that indicate the interactions between words and aspects are extracted. An ensemble classifier formulated by naive bayes, maximum entropy and support vector machines is designed to recognize the polarity of the user's comment towards each aspect. The evaluation results show sound improvement compared to individual classifiers and indicate that the ensemble system is scalable and accurate in analyzing user generated content and in specifying users' opinions and attitudes.


Bioaccumulation of nutrients and metals in sediment, water, and phoomdi from Loktak Lake (Ramsar site), northeast India: phytoremediation options and risk assessment.

In order to determine the potential of phoomdi to accumulate nutrients and metals, 11 dominant species belonging to 10 different families, sediment, and water were analyzed for a period of 2 years from the largest freshwater wetland of north-east India, Loktak (Ramsar site). Results revealed nutrient (TN and TP) and metal (Fe, Mn, Zn, and Cu) compartmentalization in the order phoomdi > sediment > water. Iron concentrations in water (0.37 ± 0.697 to 0.57 ± 1.010 mg L(-1)) and sediments (81.8 ± 0.45 to 253.1 ± 0.51 mg kg(-1)) show high metal discharge into the wetland. Metal accumulation in phoomdi ranged up to 212.3 ± 0.46-9461.4 ± 1.09 mg kg(-1) for Fe; 85.9 ± 0.31-3565.1 ± 0.87 mg kg(-1) for Mn; 9.6 ± 0.41-85.39 ± 0.58 mg kg(-1) for Zn; and 0.31 ± 0.04-9.2 ± 0.04 mg kg(-1) for Cu, respectively. High bioaccumulation factors (BAF) for metals (S. cucullata, 5.8 × 10(4) Fe, 3.9 × 10(4) Mn, and 1.7 × 10(4) Cu, and O. javanica, 4.9 × 10(3) Zn) and nutrients (S. polyrhiza, 9.7 × 10(2) TN, and Z. latifolia, 7.9 × 10(4) TP) revealed good accumulation in phoomdi compared to the wetland water column and indicate their potential to maintain a safe environment of Loktak. Further, the paper analyzed the health hazard of metals via phoomdi wild edible consumption, with the results confirming potential risk. Thus, the paper showed the need of in-depth monitoring and ample management strategies to ensure nutritional safety conditions of locals from the metals.


Me , myself , and lie : The role of self-awareness in deception

Deception has been studied extensively but still little is known about individual differences in deception ability. We investigated the relationship between self-awareness and deception ability. We enlisted novice actors to portray varying levels of deception. Forty-two undergraduates viewed the videotaped portrayals and rated the actors believability. Actors with high private self-awareness were more effective deceivers, suggesting that high self-monitors are more effective at deceiving. Self-awareness may lead to knowledge of another s mental state (i.e., Theory of Mind), which may improve an individual s deception ability. 2005 Elsevier Ltd. All rights reserved.


A Location-Sentiment-Aware Recommender System for Both Home-Town and Out-of-Town Users

Spatial item recommendation has become an important means to help people discover interesting locations, especially when people pay a visit to unfamiliar regions. Some current researches are focusing on modelling individual and collective geographical preferences for spatial item recommendation based on users' check-in records, but they fail to explore the phenomenon of user interest drift across geographical regions, i.e., users would show different interests when they travel to different regions. Besides, they ignore the influence of public comments for subsequent users' check-in behaviors. Specifically, it is intuitive that users would refuse to check in to a spatial item whose historical reviews seem negative overall, even though it might fit their interests. Therefore, it is necessary to recommend the right item to the right user at the right location. In this paper, we propose a latent probabilistic generative model called LSARS to mimic the decision-making process of users' check-in activities both in home-town and out-of-town scenarios by adapting to user interest drift and crowd sentiments, which can learn location-aware and sentiment-aware individual interests from the contents of spatial items and user reviews. Due to the sparsity of user activities in out-of-town regions, LSARS is further designed to incorporate the public preferences learned from local users' check-in behaviors. Finally, we deploy LSARS into two practical application scenes: spatial item recommendation and target user discovery. Extensive experiments on two large-scale location-based social networks (LBSNs) datasets show that LSARS achieves better performance than existing state-of-the-art methods.