Center Frequency and Bandwidth Controllable Microstrip Bandpass Filter Design Using Loop-Shaped Dual-Mode Resonator. A design approach for developing microwave bandpass filters (BPFs) with continuous control of the center frequency and bandwidth is presented. The proposed approach exploits a simple loop-shaped dual-mode resonator that is tapped and perturbed with varactor diodes to realize center frequency tunability and passband reconfigurabilty. The even- and odd-mode resonances of the resonator can be predominately controlled via the incorporated varactors, and the passband response reconfiguration is obtained with the proposed tunable external coupling mechanism, which resolves the return losses degradation attributed to conventional fixed external coupling mechanisms. The demonstrated approach leads to a relatively simple synthesis of the microwave BPF with an up to 33% center frequency tuning range, an excellent bandwidth tuning capability, as well as a high filter response reconfigurability, including an all-reject response.

Question: How to design a bandpass filter with a center frequency and bandwidth controllable?


Probabilistic Inductive Logic Programming. Probabilistic inductive logic programming aka. statistical relational learning addresses one of the central questions of artificial intelligence: the integration of probabilistic reasoning with machine learning and first order and relational logic representations. A rich variety of different formalisms and learning techniques have been developed. A unifying characterization of the underlying learning settings, however, is missing so far. In this chapter, we start from inductive logic programming and sketch how the inductive logic programming formalisms, settings and techniques can be extended to the statistical case. More precisely, we outline three classical settings for inductive logic programming, namely learning from entailment, learning from interpretations, and learning from proofs or traces, and show how they can be adapted to cover state-of-the-art statistical relational learning approaches.

Question: What is the unifying characterization of the underlying learning settings?


A High-Power $Ka$-Band (31–36 GHz) Solid-State Amplifier Based on Low-Loss Corporate Waveguide Combining. A method of using low-loss waveguide septum combiners is developed into a high-power -band (31-36 GHz) amplifier producing 50 W at 33 GHz (Ka-band) using 32 low-power (>2 W) solid-state amplifier modules. By using low-loss waveguide combining and a packaged monolithic microwave integrated circuit with a low-loss microstrip-to-waveguide launcher, the output loss is minimized, allowing for the overall power-combining efficiency to remain high, 80% (average insertion loss of combiner < 0.7 dB and average insertion loss of launcher <0.3 dB) over 31-36 GHz. In the past, lower power-combining efficiencies have limited the number of modules that can be combined at -band, and hence, have limited the power output. The approach demonstrated in this paper, with high power-combining efficiency, allows a very large number (32) of solid-state amplifier modules to be combined to produce high powers. Greater than 50 W was demonstrated with low power modules, but even higher powers 120 W are possible. The current approach is based on corporate combining, using low-loss waveguide septum combiners that provide isolation, maintaining the true graceful degradation of a modular solid-state amplifier system.

Question: How much power can be produced by 32 solid-state amplifier modules?


Large-scale matrix factorization with distributed stochastic gradient descent. We provide a novel algorithm to approximately factor large matrices with millions of rows, millions of columns, and billions of nonzero elements. Our approach rests on stochastic gradient descent (SGD), an iterative stochastic optimization algorithm. We first develop a novel "stratified" SGD variant (SSGD) that applies to general loss-minimization problems in which the loss function can be expressed as a weighted sum of "stratum losses." We establish sufficient conditions for convergence of SSGD using results from stochastic approximation theory and regenerative process theory. We then specialize SSGD to obtain a new matrix-factorization algorithm, called DSGD, that can be fully distributed and run on web-scale datasets using, e.g., MapReduce. DSGD can handle a wide variety of matrix factorizations. We describe the practical techniques used to optimize performance in our DSGD implementation. Experiments suggest that DSGD converges significantly faster and has better scalability properties than alternative algorithms.

Question: What is the difference between the Canadian Armed Forces and the Canadian Army?


Daily Fluctuations in Smartphone Use, Psychological Detachment, and Work Engagement: The Role of Workplace Telepressure. Today's work environment is shaped by the electronic age. Smartphones are important tools that allow employees to work anywhere and anytime. The aim of this diary study was to examine daily smartphone use after and during work and their association with psychological detachment (in the home domain) and work engagement (in the work domain), respectively. We explored whether workplace telepressure, which is a strong urge to respond to work-related messages and a preoccupation with quick response times, promotes smartphone use. Furthermore, we hypothesized that employees experiencing high workplace telepressure would have more trouble letting go of the workday during the evening and feel less engaged during their workday to the extent that they use their smartphone more intensively across domains. A total of 116 employees using their smartphones for work-related purposes completed diary questionnaires on five workdays (N = 476 data points) assessing their work-related smartphone use, psychological detachment after work, and engagement during work. Workplace telepressure was measured as a between-individual variable and only assessed at the beginning of the study, as well as relevant control variables such as participants' workload and segmentation preference (a preference for work and home domains to be as segmented as possible). Multilevel path analyses revealed that work-related smartphone use after work was negatively related to psychological detachment irrespective of employees' experienced workplace telepressure, and daily smartphone use during work was unrelated to work engagement. Supporting our hypothesis, employees who reported high telepressure experienced less work engagement on days that they used their smartphone more intensively during work. Altogether, intensive smartphone use after work hampers employees' psychological detachment, whe

Question: What is the difference between psychological detachment and psychological detachment?


Rethinking Conventional Collaborative Filtering for Recommending Daily Fashion Outfits. A conventional collaborative €ltering approach using a standard utility matrix fails to capture the aspect of matching clothing items when recommending daily fashion out€ts. Moreover, it is challenged by the new user cold-start problem. In this paper, we describe a novel approach for guiding users in selecting daily fashion out€ts, by providing out€t recommendations from a system consisting of an Internet of Œings wardrobe enabled with RFID technology and a corresponding mobile application. We show where a conventional collaborative €ltering approach comes short when recommending fashion out€ts, and how our novel approach—powered by machine learning algorithms—shows promising results in the domain of fashion recommendation. Evaluation of our novel approach using a real-world dataset demonstrates the system's e'ectiveness and its ability to provide daily out€t recommendations that are relevant to the users. A non-comparable evaluation of the conventional approach is also given.

Question: What is the difference between a conventional collaborative filtering approach and a novel approach?


Computer vision-based registration techniques for augmented reality. Augmented reality is a term used to describe systems in which computer-generated information is superimposed on top of the real world; for example, through the use of a see-through head-mounted display. A human user of such a system could still see and interact with the real world, but have valuable additional information, such as descriptions of important features or instructions for performing physical tasks, superimposed on the world. For example, the computer could identify objects and overlay them with graphic outlines, labels, and schematics. The graphics are registered to the real-world objects and appear to be "painted" onto those objects. Augmented reality systems can be used to make productivity aids for tasks such as inspection, manufacturing, and navigation. One of the most critical requirements for augmented reality is to recognize and locate real-world objects with respect to the person's head. Accurate registration is necessary in order to overlay graphics accurately on top of the real-world objects. At the Colorado School of Mines, we have developed a prototype augmented reality system that uses head-mounted cameras and computer vision techniques to accurately register the head to the scene. The current system locates and tracks a set of preplaced passive fiducial targets placed on the real-world objects. The system computes the pose of the objects and displays graphics overlays using a see-through head-mounted display. This paper describes the architecture of the system and outlines the computer vision techniques used.

Question: What is augmented reality?


Percutaneous left atrial appendage closure vs warfarin for atrial fibrillation: a randomized clinical trial.. IMPORTANCE While effective in preventing stroke in patients with atrial fibrillation (AF), warfarin is limited by a narrow therapeutic profile, a need for lifelong coagulation monitoring, and multiple drug and diet interactions.   OBJECTIVE To determine whether a local strategy of mechanical left atrial appendage (LAA) closure was noninferior to warfarin.   DESIGN, SETTING, AND PARTICIPANTS PROTECT AF was a multicenter, randomized (2:1), unblinded, Bayesian-designed study conducted at 59 hospitals of 707 patients with nonvalvular AF and at least 1 additional stroke risk factor (CHADS2 score ≥1). Enrollment occurred between February 2005 and June 2008 and included 4-year follow-up through October 2012. Noninferiority required a posterior probability greater than 97.5% and superiority a probability of 95% or greater; the noninferiority margin was a rate ratio of 2.0 comparing event rates between treatment groups.   INTERVENTIONS Left atrial appendage closure with the device (n = 463) or warfarin (n = 244; target international normalized ratio, 2-3).   MAIN OUTCOMES AND MEASURES A composite efficacy end point including stroke, systemic embolism, and cardiovascular/unexplained death, analyzed by intention-to-treat.   RESULTS At a mean (SD) follow-up of 3.8 (1.7) years (2621 patient-years), there were 39 events among 463 patients (8.4%) in the device group for a primary event rate of 2.3 events per 100 patient-years, compared with 34 events among 244 patients (13.9%) for a primary event rate of 3.8 events per 100 patient-years with warfarin (rate ratio, 0.60; 95% credible interval, 0.41-1.05), meeting prespecified criteria for both noninferiority (posterior probability, >99.9%) and superiority (posterior probability, 96.0%). Patients in the device group demonstrated lower rates of both cardiovascular mortality (1.0 events per 100 patient-years for the device grou

Question: What is the difference between a posterior probability and a posterior probability?


Deep Neural Networks for i-Vector Language Identification of Short Utterances in Cars. This paper is focused on the application of the Language Identification (LID) technology for intelligent vehicles. We cope with short sentences or words spoken in moving cars in four languages: English, Spanish, German, and Finnish. As the response time of the LID system is crucial for user acceptance in this particular task, speech signals of different durations with total average of 3.8s are analyzed. In this paper, the authors propose the use of Deep Neural Networks (DNN) to model effectively the i-vector space of languages. Both raw i-vectors and session variability compensated i-vectors are evaluated as input vectors to DNNs. The performance of the proposed DNN architecture is compared with both conventional GMM-UBM and i-vector/LDA systems considering the effect of durations of signals. It is shown that the signals with durations between 2 and 3s meet the requirements of this application, i.e., high accuracy and fast decision, in which the proposed DNN architecture outperforms GMM-UBM and i-vector/LDA systems by 37% and 28%, respectively.

Question: What is the difference between the i-vector and the LDA?


Image Processing using IP Core Generator through FPGA. Xilinx CORE Generator System generates and delivers parameterizable cores optimized for Xilinx FPGAs. CORE Generator is mainly used to create high density, high performance designs in Xilinx FPGAs in less time. The CORE Generator is included with the ISE WebPack and ISE Foundation software and comes with an extensive library of Xilinx LogiCORE IP. These include DSP functions, memories, storage elements, math functions and a variety of basic elements. Xilinx provides a flexible Block Memory Generator core to create compact, high-performance memories running at up to 450 MHz. Block Memory Generator provides single port and dual port block memory. These memory types differ in selection of operating modes.Matlab tool is used to convert the image that is being processed to .coe file format.

Question: How to convert image to.coe file format?


Fast Alternating LS Algorithms for High Order CANDECOMP/PARAFAC Tensor Factorizations. CANDECOMP/PARAFAC (CP) has found numerous applications in wide variety of areas such as in chemometrics, telecommunication, data mining, neuroscience, separated representations. For an order- N tensor, most CP algorithms can be computationally demanding due to computation of gradients which are related to products between tensor unfoldings and Khatri-Rao products of all factor matrices except one. These products have the largest workload in most CP algorithms. In this paper, we propose a fast method to deal with this issue. The method also reduces the extra memory requirements of CP algorithms. As a result, we can accelerate the standard alternating CP algorithms 20-30 times for order-5 and order-6 tensors, and even higher ratios can be obtained for higher order tensors (e.g., N ≥ 10). The proposed method is more efficient than the state-of-the-art ALS algorithm which operates two modes at a time (ALSo2) in the Eigenvector PLS toolbox, especially for tensors with order N ≥ 5 and high rank.

Question: What is the difference between CP and PLS?


The dark side of smartphone usage: Psychological traits, compulsive behavior and technostress. 0747-5632/$ see front matter 2013 Elsevier Ltd. All rights reserved. http://dx.doi.org/10.1016/j.chb.2013.10.047 ⇑ Corresponding author. Address: Department of Business Management, National Sun Yat-sen University, No. 70, Lianhai Rd., Gushan District, Kaohsiung City 804, Taiwan, Tel.: +886 7 525 2000x4627. E-mail address: ctchang@faculty.nsysu.edu.tw (C.-T. Chang). Yu-Kang Lee, Chun-Tuan Chang ⇑, You Lin, Zhao-Hong Cheng

Question: What is the dark side of smartphone usage?


ECG Biometric Recognition: A Comparative Analysis. The electrocardiogram (ECG) is an emerging biometric modality that has seen about 13 years of development in peer-reviewed literature, and as such deserves a systematic review and discussion of the associated methods and findings. In this paper, we review most of the techniques that have been applied to the use of the electrocardiogram for biometric recognition. In particular, we categorize the methodologies based on the features and the classification schemes. Finally, a comparative analysis of the authentication performance of a few of the ECG biometric systems is presented, using our inhouse database. The comparative study includes the cases where training and testing data come from the same and different sessions (days). The authentication results show that most of the algorithms that have been proposed for ECG-based biometrics perform well when the training and testing data come from the same session. However, when training and testing data come from different sessions, a performance degradation occurs. Multiple training sessions were incorporated to diminish the loss in performance. That notwithstanding, only a few of the proposed ECG recognition algorithms appear to be able to support performance improvement due to multiple training sessions. Only three of these algorithms produced equal error rates (EERs) in the single digits, including an EER of 5.5% using a method proposed by us.

Question: What is the ECG biometric recognition?


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

Question: What is smart beta?


Improved Plagiarism Detection Algorithm Based on Abstract Syntax Tree. Statements with conditionals are widely used in C, C++ and java, such as if and while statements and they are easy to plagiarize by adjusting the logical structure of the corresponding statements. However, the existing relative algorithms and tools cannot effectively detect code plagiarism of these statements. This paper puts forward an improved code plagiarism detection algorithm based on abstract syntax tree. The algorithm calculates the hash value for each node of the abstract syntax tree, and compares the hash values node by node. Based on this, it analyzes the if-statement plagiarism, as if-statements are representative in the statements with conditionals, and puts forward the corresponding detection schemes in order to detect plagiarism effectively. After that, with the results of many experiments, the algorithm is proved effective on detecting if-statement plagiarisms.

Question: How to detect plagiarism of if-statements?


Advanced 0.13um smart power technology from 7V to 70V. This paper presents BCD process integrating 7V to 70V power devices on 0.13um CMOS platform for various power management applications. BJT, Zener diode and Schottky diode are available and non-volatile memory is embedded as well. LDMOS shows best-in-class specific Ron (RSP) vs. BVDSS characteristics (i.e., 70V NMOS has RSP of 69mΩ-mm2 with BVDSS of 89V). Modular process scheme is used for flexibility to various requirements of applications.

Question: What is the BCD process?


The Improvisation Effect: A Case Study of User Improvisation and Its Effects on Information System Evolution. Few studies have examined interactions between IT change and organizational change during information systems evolution (ISE). We propose a dynamic model of ISE where change dynamics are captured in four dimensions: planned change, improvised change, organizational change and IT change. This inductively-generated model yields a rich account of ISE and its drivers by integrating the four change dimensions. The model shows how incremental adjustments in IT and organizational processes often grow into a profound change as users improvise. We demonstrate the value of the dynamic model by illustrating ISE processes in the context of two manufacturing organizations implementing the same system over a study period of five years. This paper makes its contribution by holistically characterizing improvisation in the context of IT and organizational change. Our ISE model moves research in organizational and IT change towards a common framing by showing how each affects the other's form, function and evolution.

Question: What is the improvisation effect?


Asymmetric Cryptography for Mobile Devices. This paper is meant to give the reader a general overview about the application of asymmetric cryptography in communication, particular in mobile devices. The basics principles of a cryptosystem are addressed, as well as the idea of symmetric and asymmetric cryptography. The functional principles of RSA encryption and the DiffieHellman key exchange scheme, as well as the general idea of digital signatures are shortly described. Furthermore some challenges and solution approaches for the application of asymmetric encryption in low power mobile devices are named. On completing, some the future developments in cryptography are shortly described.

Question: What is the difference between symmetric and asymmetric cryptography?


Seismic surveying with drone-mounted geophones. Seismic imaging is the primary technique for subsurface exploration. Traditional seismic imaging techniques rely heavily on manual labor to plant sensors, lay miles of cabling, and then recover the sensors. Often sites of resource or rescue interest may be difficult or hazardous to access. Thus, there is a substantial need for unmanned sensors that can be deployed by air and potentially in large numbers. This paper presents working prototypes of autonomous drones equipped with geophones (vibration sensors) that can fly to a site, land, listen for echoes and vibrations, store the information on-board, and subsequently return to home base. The design uses four geophone sensors (with spikes) in place of the landing gear. This provides a stable landing attitude, redundancy in sensing, and ensures the geophones are oriented perpendicular to the ground. The paper describes hardware experiments demonstrating the efficacy of this technique and a comparison with traditional manual techniques. The performance of the seismic drone was comparable to a well planted geophone, proving the drone mount system is a feasible alternative to traditional seismic sensors.

Question: How does a seismic drone work?


The Value Function Polytope in Reinforcement Learning. We establish geometric and topological properties of the space of value functions in finite stateaction Markov decision processes. Our main contribution is the characterization of the nature of its shape: a general polytope (Aigner et al., 2010). To demonstrate this result, we exhibit several properties of the structural relationship between policies and value functions including the line theorem, which shows that the value functions of policies constrained on all but one state describe a line segment. Finally, we use this novel perspective to introduce visualizations to enhance the understanding of the dynamics of reinforcement learning algorithms.

Question: What is the value function polytope?


Skip graphs. Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where elements are stored in separate nodes that may fail at any time. They are designed for use in searching peer-to-peer networks, and by providing the ability to perform queries based on key ordering, they improve on existing search tools that provide only hash table functionality. Unlike skip lists or other tree data structures, skip graphs are highly resilient, tolerating a large fraction of failed nodes without losing connectivity. In addition, constructing, inserting new elements into, searching a skip graph and detecting and repairing errors in the data structure introduced by node failures can be done using simple and straight-forward algorithms.

Question: What is a skip graph?


Cool English: a Grammatical Error Correction System Based on Large Learner Corpora. This paper presents a grammatical error correction (GEC) system that provides corrective feedback for essays. We apply the neural sequence-to-sequence model, which is frequently used in machine translation and text summarization, to this GEC task. The model is trained on EF-Cambridge Open Language Database (EFCAMDAT), a large learner corpus annotated with grammatical errors and corrections. Evaluation shows that our system achieves competitive performance on a number of publicly available testsets.

Question: What is a learner corpus?


Numerical methods for the Stokes and Navier-Stokes equations driven by threshold slip boundary conditions. In this article, we discuss the numerical solution of the Stokes and Navier-Stokes equations completed by nonlinear slip boundary conditions of friction type in two and three dimensions. To solve the Stokes system, we first reduce the related variational inequality into a saddle point-point problem for a well chosen augmented Lagrangian. To solve this saddle point problem we suggest an alternating direction method of multiplier together with finite element approximations. The solution of the Navier Stokes system combines finite element approximations, time discretization by operator splitting and augmented Lagrangian method. Numerical experiment results for two and three dimensional flow confirm the interest of these approaches.

Question: What is the difference between the Stokes and Navier-Stokes equations?


Hierarchical Control of Droop-Controlled AC and DC Microgrids—A General Approach Toward Standardization. AC and dc microgrids (MGs) are key elements for integrating renewable and distributed energy resources as well as distributed energy-storage systems. In the last several years, efforts toward the standardization of these MGs have been made. In this sense, this paper presents the hierarchical control derived from ISA-95 and electrical dispatching standards to endow smartness and flexibility to MGs. The hierarchical control proposed consists of three levels: 1) The primary control is based on the droop method, including an output-impedance virtual loop; 2) the secondary control allows the restoration of the deviations produced by the primary control; and 3) the tertiary control manages the power flow between the MG and the external electrical distribution system. Results from a hierarchical-controlled MG are provided to show the feasibility of the proposed approach.

Question: What is the hierarchical control of droop-controlled AC and DC microgrids?


CA-LSTM: Search Task Identification with Context Attention based LSTM. Search task identification aims to understand a user's information needs to improve search quality for applications such as query suggestion, personalized search, and advertisement retrieval. To properly identify the search task within long query sessions, it is important to partition these sessions into segments before further processing. In this paper, we present the first search session segmentation model that uses a long short-term memory (LSTM) network with an attention mechanism. This model considers sequential context knowledge, including temporal information, word and character, and essentially learns which parts of the input query sequence are relevant to the current segmentation task and determines the influence of these parts. This segmentation technique is also combined with an efficient clustering method using a novel query relevance metric for end-to-end search task identification. Using real-world datasets, we demonstrate that our segmentation technique improves task identification accuracy of existing clustering-based algorithms.

Question: What is the first large-scale Canadian peacekeeping mission?


Review of battery cell balancing techniques. A highly reliable and efficient battery management system (BMS) is crucial for applications that are powered by electrochemical power. Cell balancing is one of the most important features of a BMS. Cell balancing techniques help to distribute energy evenly among battery cells. Without cell balancing, a portion of the capacity or energy in the battery bank will be wasted, especially for long battery string which operates in frequent recycling condition. In this paper, some popular cell balancing techniques are described and categorized according to the way of processing redundant energy in battery cells.

Question: What is the difference between cell balancing and cell balancing techniques?


Criteria-Based Requirements Prioritization for Software Product Management. Meeting stakeholders requirements and expectations becomes one of the critical aspects on which any software organization in market-driven environment focus on, and pays a lot of efforts and expenses to maximize the satisfaction of their stakeholders. Therefore identifying the software product release contents becomes one of the critical decisions for software product success. Requirements prioritization refers to that activity through which product releases contents that maximize stakeholder satisfaction can be identified. This makes it one of the most important component of software requirement decision support in incremental software development [8]. This paper illustrates the Criteria-Based requirement prioritization approach for software product management. The technique proposed on this paper designed based on the Hierarchical Cumulative Voting (HCV) and Value-Oriented Prioritization (VOP) techniques. The proposed technique, Value-Oriented HCV (VOHCV) can select the best candidate requirements for each release based on the stakeholders input values for each requirement. These values reflect the importance of each requirement in terms of associated anticipated cost, technical risk, relative impact, market-related aspects and perceived value to the stakeholder. The VOHCV inherits the strengths of the HCV and VOP techniques. It also provides a mechanism that takes different stakeholders' aspects into account while selecting the best candidate release requirement, to maximize stakeholders' value and satisfaction [11].

Question: What is the difference between the criteria-based requirements prioritization and the value-oriented requirements prioritization?


Classifying sanctions and designing a conceptual sanctioning process model for socio-technical systems. We understand a socio-technical system (STS) as a cyber-physical system in which two or more autonomous parties interact via or about technical elements, including the parties' resources and actions. As information technology begins to pervade every corner of human life, STSs are becoming ever more common, and the challenge of governing STSs is becoming increasingly important. We advocate a normative basis for governance, wherein norms represent the standards of correct behaviour that each party in an STS expects from others. A major benefit of focussing on norms is that they provide a socially realistic view of interaction among autonomous parties that abstracts low-level implementation details. Overlaid on norms is the notion of a sanction as a negative or positive reaction to potentially any violation of or compliance with an expectation. Although norms have been well studied as regards governance for STSs, sanctions have not. Our understanding and usage of norms is inadequate for the purposes of governance unless we incorporate a comprehensive representation of sanctions. We address the aforementioned gap by proposing (i) a sanction typology that reflects the relevant features of sanctions, and (ii) a conceptual sanctioning process model providing a functional structure for sanctioning in STS. We demonstrate our contributions via a motivating scenario from the domain of renewable energy trading.

Question: What is a conceptual sanctioning process model?


The Concept of Flow. What constitutes a good life? Few questions are of more fundamental importance to a positive psychology. Flow research has yielded one answer, providing an understanding of experiences during which individuals are fully involved in the present moment. Viewed through the experiential lens of flow, a good life is one that is characterized by complete absorption in what one does. In this chapter, we describe the flow model of optimal experience and optimal development, explain how flow and related constructs have been measured, discuss recent work in this area, and identify some promising directions for future research.

Question: What is the concept of flow?


Subjective Evaluation of Latency and Packet Loss in a Cloud-Based Game. On-demand multimedia services are more popular than ever and continue to grow. Consumers can now stream music, movies, television, and video games at the push of a button. Such services typically require a minimum connection speed to support streaming. However, transient network effects such as packet loss and delay variation can play a crucial role in determining the user quality of experience (QoE) in streaming multimedia systems. This paper will seek to establish the subjective impact of negative network effects on the user experience of a popular cloud-based on-demand video game service.

Question: What is the impact of packet loss on the user experience of a cloud-based on-demand video game service?


Transparent Runtime Shadow Stack : Protection against malicious return address modifications. Exploitation of buffer overflow vulnerabilities constitutes a significant portion of security attacks in computer systems. One of the most common types of buffer overflow attacks is the hijacking of the program counter by overwriting function return addresses in the process' stack so as to redirect the program's control flow to some malicious code injected into the process' memory. Previous solutions to this problem are based either on hardware or the compiler. The former requires special hardware while the latter requires the source code of the software. In this paper we introduce the use of a T ransparent RUntime Shadow Stack (TRUSS) to protect against function return address modification. Our proposed scheme is built on top of DynamoRIO, a dynamic binary rewriting framework. DynamoRIO is implemented on both Windows and Linux. Hence, our scheme is able to protect applications on both operating systems. We have successfully tested our implementation on the SPECINT 2000 benchmark programs on both Windows and Linux, John Wilander's "Dynamic testbed for twenty buffer overflow attacks" as well as Microsoft Access, Powerpoint and Word 2002. This paper will discuss the implementation details of our scheme as well as provide a performance evaluation. The latter shows that TRUSS is able to operate with an average overhead of about 20% to 50% which we believe is acceptable.

Question: How to protect against malicious return address modifications?


β-VAE : L EARNING B ASIC. Learning an interpretable factorised representation of the independent data generative factors of the world without supervision is an important precursor for the development of artificial intelligence that is able to learn and reason in the same way that humans do. We introduce β-VAE, a new state-of-the-art framework for automated discovery of interpretable factorised latent representations from raw image data in a completely unsupervised manner. Our approach is a modification of the variational autoencoder (VAE) framework. We introduce an adjustable hyperparameter β that balances latent channel capacity and independence constraints with reconstruction accuracy. We demonstrate that β-VAE with appropriately tuned β > 1 qualitatively outperforms VAE (β = 1), as well as state of the art unsupervised (InfoGAN) and semi-supervised (DC-IGN) approaches to disentangled factor learning on a variety of datasets (celebA, faces and chairs). Furthermore, we devise a protocol to quantitatively compare the degree of disentanglement learnt by different models, and show that our approach also significantly outperforms all baselines quantitatively. Unlike InfoGAN, β-VAE is stable to train, makes few assumptions about the data and relies on tuning a single hyperparameter β, which can be directly optimised through a hyperparameter search using weakly labelled data or through heuristic visual inspection for purely unsupervised data.

Question: What is the difference between β-VAE and VAE?


Pixel-Wise Attentional Gating for Scene Parsing. To achieve dynamic inference in pixel labeling tasks, we propose Pixel-wise Attentional Gating (PAG), which learns to selectively process a subset of spatial locations at each layer of a deep convolutional network. PAG is a generic, architecture-independent, problem-agnostic mechanism that can be readily "plugged in" to an existing model with fine-tuning. We utilize PAG in two ways: 1) learning spatially varying pooling fields that improve model performance without the extra computation cost associated with multi-scale pooling, and 2) learning a dynamic computation policy for each pixel to decrease total computation (FLOPs) while maintaining accuracy. We extensively evaluate PAG on a variety of per-pixel labeling tasks, including semantic segmentation, boundary detection, monocular depth and surface normal estimation. We demonstrate that PAG allows competitive or state-of-the-art performance on these tasks. Our experiments show that PAG learns dynamic spatial allocation of computation over the input image which provides better performance trade-offs compared to related approaches (e.g., truncating deep models or dynamically skipping whole layers). Generally, we observe PAG can reduce computation by 10% without noticeable loss in accuracy and performance degrades gracefully when imposing stronger computational constraints.

Question: How to reduce the computation of a deep convolutional network?


Congestion Control in Linux TCP. The TCP protocol is used by the majority of the network applications on the Internet. TCP performance is strongly influenced by its congestion control algorithms that limit the amount of transmitted traffic based on the estimated network capacity and utilization. Because the freely available Linux operating system has gained popularity especially in the network servers, its TCP implementation affects many of the network interactions carried out today. We describe the fundamentals of the Linux TCP design, concentrating on the congestion control algorithms. The Linux TCP implementation supports SACK, TCP timestamps, Explicit Congestion Notification, and techniques to undo congestion window adjustments after incorrect congestion notifications. In addition to features specified by IETF, Linux has implementation details beyond the specifications aimed to further improve its performance. We discuss these, and finally show the performance effects of Quick acknowledgements, Rate-halving, and the algorithms for correcting incorrect congestion window adjustments by comparing the performance of Linux TCP implementing these features to the performance achieved with an implementation that does not use the algorithms in question.

Question: What is the Linux TCP implementation?


Photo Aesthetics Ranking Network with Attributes and Content Adaptation. A Aesthetics & Attribute Database (AADB) Fusing Attributes and Content for Aesthetics Ranking Demo, code and model can be download through project webpage http://www.ics.uci.edu/~skong2/aesthetics.html References: [8] He, K., Zhang, X., Ren, S., Sun, J., ECCV, 2014 [15] Lu, X., Lin, Z., Jin, H., Yang, J., Wang, J., IEEE Trans. on Multimedia, 2015 [16] Lu, X., Lin, Z., Jin, H., Yang, J., Wang, J.Z., ACMMM, 2014 [17] Lu, X., Lin, Z., Shen, X., Mech, R., Wang, J.Z., ICCV, 2015 [23] Murray, N., Marchesotti, L., Perronnin, F., CVPR, 2012 Acknowledgements: This work was supported by Adobe gift fund, NSF grants DBI-1262547 and IIS1253538. Experimental Results We use Spearman's rho rank correlation ( ) to measure ranking performance . By thresholding the rating scores, we achieve state-of-the-art classification accuracy on AVA despite never training with a classification loss. We first train a simple model with Euclidean loss for numerical rating of photo aesthetics (a) fine-tuning with rank loss Based on the regression net, we apply rank loss to fine-tune the network

Question: What is the rank loss?


Modeling Ambiguity, Subjectivity, and Diverging Viewpoints in Opinion Question Answering Systems. Product review websites provide an incredible lens into the wide variety of opinions and experiences of different people, and play a critical role in helping users discover products that match their personal needs and preferences. To help address questions that can't easily be answered by reading others' reviews, some review websites also allow users to pose questions to the community via a question-answering (QA) system. As one would expect, just as opinions diverge among different reviewers, answers to such questions may also be subjective, opinionated, and divergent. This means that answering such questions automatically is quite different from traditional QA tasks, where it is assumed that a single 'correct' answer is available. While recent work introduced the idea of question-answering using product reviews, it did not account for two aspects that we consider in this paper: (1) Questions have multiple, often divergent, answers, and this full spectrum of answers should somehow be used to train the system, and (2) What makes a 'good' answer depends on the asker and the answerer, and these factors should be incorporated in order for the system to be more personalized. Here we build a new QA dataset with 800 thousand questions—and over 3.1 million answers—and show that explicitly accounting for personalization and ambiguity leads both to quantitatively better answers, but also a more nuanced view of the range of supporting, but subjective, opinions.

Question: What is the difference between a product review website and a question-answering system?


Classes of Multiagent Q-learning Dynamics with epsilon-greedy Exploration. Q-learning in single-agent environments is known to converge in the limit given sufficient exploration. The same algorithm has been applied, with some success, in multiagent environments, where traditional analysis techniques break down. Using established dynamical systems methods, we derive and study an idealization of Q-learning in 2-player 2-action repeated general-sum games. In particular, we address the discontinuous case of -greedy exploration and use it as a proxy for value-based algorithms to highlight a contrast with existing results in policy search. Analogously to previous results for gradient ascent algorithms, we provide a complete catalog of the convergence behavior of the -greedy Q-learning algorithm by introducing new subclasses of these games. We identify two subclasses of Prisoner's Dilemma-like games where the application of Q-learning with -greedy exploration results in higher-than-Nash average payoffs for some initial conditions.

Question: What is the difference between Q-learning and policy search?


Differential Privacy as a Mutual Information Constraint. Differential privacy is a precise mathematical constraint meant to ensure privacy of individual pieces of information in a database even while queries are being answered about the aggregate. Intuitively, one must come to terms with what differential privacy does and does not guarantee. For example, the definition prevents a strong adversary who knows all but one entry in the database from further inferring about the last one. This strong adversary assumption can be overlooked, resulting in misinterpretation of the privacy guarantee of differential privacy. Herein we give an equivalent definition of privacy using mutual information that makes plain some of the subtleties of differential privacy. The mutual-information differential privacy is in fact sandwiched between ε-differential privacy and (ε,δ)-differential privacy in terms of its strength. In contrast to previous works using unconditional mutual information, differential privacy is fundamentally related to conditional mutual information, accompanied by a maximization over the database distribution. The conceptual advantage of using mutual information, aside from yielding a simpler and more intuitive definition of differential privacy, is that its properties are well understood. Several properties of differential privacy are easily verified for the mutual information alternative, such as composition theorems.

Question: What is the difference between differential privacy and mutual information?


Effectiveness Evaluation of Rule Based Classifiers for the Classification of Iris Data Set. ISSN 2250 – 1061 | © 2011 Bonfring Abstract--In machine learning, classification refers to a step by step procedure for designating a given piece of input data into any one of the given categories. There are many classification problem occurs and need to be solved. Different types are classification algorithms like tree-based, rule-based, etc are widely used. This work studies the effectiveness of Rule-Based classifiers for classification by taking a sample data set from UCI machine learning repository using the open source machine learning tool. A comparison of different rulebased classifiers used in Data Mining and a practical guideline for selecting the most suited algorithm for a classification is presented and some empirical criteria for describing and evaluating the classifiers are given.

Question: What is the difference between classification and clustering?


Mass detection on mammogram images : A first assessment of deep learning techniques. Deep Learning approaches have gathered a lot of attention lately. In this work, we study their application to the breast cancer field, in particular for mass detection in mammograms. Several experiments were made on a real mammogram benchmark dataset. Deep Learning approaches were compared to other classification methodologies. It was concluded that, although useful, the implementation used does not outperform SVMs. Further study and adjustment of the method for this application is needed.

Question: What is a mammogram?


Finger Vein Recognition With Anatomy Structure Analysis. Finger vein recognition has received a lot of attention recently and is viewed as a promising biometric trait. In related methods, vein pattern-based methods explore intrinsic finger vein recognition, but their performance remains unsatisfactory owing to defective vein networks and weak matching. One important reason may be the neglect of deep analysis of the vein anatomy structure. By comprehensively exploring the anatomy structure and imaging characteristic of vein patterns, this paper proposes a novel finger vein recognition framework, including an anatomy structure analysis-based vein extraction algorithm and an integration matching strategy. Specifically, the vein pattern is extracted from the orientation map-guided curvature based on the valley- or half valley-shaped cross-sectional profile. In addition, the extracted vein pattern is further thinned and refined to obtain a reliable vein network. In addition to the vein network, the relatively clear vein branches in the image are mined from the vein pattern, referred to as the vein backbone. In matching, the vein backbone is used in vein network calibration to overcome finger displacements. The similarity of two calibrated vein networks is measured by the proposed elastic matching and further recomputed by integrating the overlap degree of corresponding vein backbones. Extensive experiments on two public finger vein databases verify the effectiveness of the proposed framework.

Question: What is the anatomy structure of a vein?


Civitas: The Smart City Middleware, from Sensors to Big Data. Software development for smart cities bring into light new concerns, such as how to deal with scalability, heterogeneity (sensors, actuators, high performance computing devices, etc.), geolocation information or privacy issues, among some. Traditional approaches to distributed systems fail to address these challenges, because they were mainly devoted to enterprise IT environments. This paper proposes a middleware framework, called Civitas, specially devoted to support the task of service development for the Smart City paradigm. This paper also analyzes the main drawbacks of traditional approaches to middleware service development and how these are overcome in the middleware framework proposed here.

Question: What is the middleware framework for smart cities?


EPPA: An Efficient and Privacy-Preserving Aggregation Scheme for Secure Smart Grid Communications. The concept of smart grid has emerged as a convergence of traditional power system engineering and information and communication technology. It is vital to the success of next generation of power grid, which is expected to be featuring reliable, efficient, flexible, clean, friendly, and secure characteristics. In this paper, we propose an efficient and privacy-preserving aggregation scheme, named EPPA, for smart grid communications. EPPA uses a superincreasing sequence to structure multidimensional data and encrypt the structured data by the homomorphic Paillier cryptosystem technique. For data communications from user to smart grid operation center, data aggregation is performed directly on ciphertext at local gateways without decryption, and the aggregation result of the original data can be obtained at the operation center. EPPA also adopts the batch verification technique to reduce authentication cost. Through extensive analysis, we demonstrate that EPPA resists various security threats and preserve user privacy, and has significantly less computation and communication overhead than existing competing approaches.

Question: What is the size of the smart grid?


Contrast-Guided Image Interpolation. In this paper a contrast-guided image interpolation method is proposed that incorporates contrast information into the image interpolation process. Given the image under interpolation, four binary contrast-guided decision maps (CDMs) are generated and used to guide the interpolation filtering through two sequential stages: 1) the 45° and 135° CDMs for interpolating the diagonal pixels and 2) the 0° and 90° CDMs for interpolating the row and column pixels. After applying edge detection to the input image, the generation of a CDM lies in evaluating those nearby non-edge pixels of each detected edge for re-classifying them possibly as edge pixels. This decision is realized by solving two generalized diffusion equations over the computed directional variation (DV) fields using a derived numerical approach to diffuse or spread the contrast boundaries or edges, respectively. The amount of diffusion or spreading is proportional to the amount of local contrast measured at each detected edge. The diffused DV fields are then thresholded for yielding the binary CDMs, respectively. Therefore, the decision bands with variable widths will be created on each CDM. The two CDMs generated in each stage will be exploited as the guidance maps to conduct the interpolation process: for each declared edge pixel on the CDM, a 1-D directional filtering will be applied to estimate its associated to-be-interpolated pixel along the direction as indicated by the respective CDM; otherwise, a 2-D directionless or isotropic filtering will be used instead to estimate the associated missing pixels for each declared non-edge pixel. Extensive simulation results have clearly shown that the proposed contrast-guided image interpolation is superior to other state-of-the-art edge-guided image interpolation methods. In addition, the computational complexity is relatively low when compared with existing methods; hence, it is fairly attractive for real-time image applicati

Question: What is contrast-guided image interpolation?


Personalized, interactive tag recommendation for flickr. We study the problem of personalized, interactive tag recommendation for Flickr: While a user enters/selects new tags for a particular picture, the system suggests related tags to her, based on the tags that she or other people have used in the past along with (some of) the tags already entered. The suggested tags are dynamically updated with every additional tag entered/selected. We describe a new algorithm, called Hybrid, which can be applied to this problem, and show that it outperforms previous algorithms. It has only a single tunable parameter, which we found to be very robust.  Apart from this new algorithm and its detailed analysis, our main contributions are (i) a clean methodology which leads to conservative performance estimates, (ii) showing how classical classification algorithms can be applied to this problem, (iii) introducing a new cost measure, which captures the effort of the whole tagging process, (iv) clearly identifying, when purely local schemes (using only a user's tagging history) can or cannot be improved by global schemes (using everybody's tagging history).

Question: What is the name of the algorithm?


Parallel Tracking and Mapping for Small AR Workspaces. This paper presents a method of estimating camera pose in an unknown scene. While this has previously been attempted by adapting SLAM algorithms developed for robotic exploration, we propose a system specifically designed to track a hand-held camera in a small AR workspace. We propose to split tracking and mapping into two separate tasks, processed in parallel threads on a dual-core computer: one thread deals with the task of robustly tracking erratic hand-held motion, while the other produces a 3D map of point features from previously observed video frames. This allows the use of computationally expensive batch optimisation techniques not usually associated with real-time operation: The result is a system that produces detailed maps with thousands of landmarks which can be tracked at frame-rate, with an accuracy and robustness rivalling that of state-of-the-art model-based systems.

Question: How to estimate camera pose in an unknown scene?


Automatic detection of discontinuities from 3D point clouds for the stability analysis of jointed rock masses. We describe an strategy for automatic detection of discontinuities in jointed rock masses from a 3D point cloud. The method consists on a sequence of processes for feature extraction and characterization of the discontinuities that use voxelization, robust detection of planes by sequential RANSAC and clustering. The results obtained by applying this methodology to the 3D point cloud are a set of discontinuity families, characterized by their dips and dip directions, and surface wedges. This geometric information is essential for a later stability analysis of the jointed rock mass. The ultimate aim of our investigation is the automatic extraction of discontinuity families for stability analysis of tunnels excavated in jointed rock masses.

Question: How to detect discontinuities in jointed rock masses?


Private memoirs of a smart meter. Household smart meters that measure power consumption in real-time at fine granularities are the foundation of a future smart electricity grid. However, the widespread deployment of smart meters has serious privacy implications since they inadvertently leak detailed information about household activities. In this paper, we show that even without a priori knowledge of household activities or prior training, it is possible to extract complex usage patterns from smart meter data using off-the-shelf statistical methods. Our analysis uses two months of data from three homes, which we instrumented to log aggregate household power consumption every second. With the data from our small-scale deployment, we demonstrate the potential for power consumption patterns to reveal a range of information, such as how many people are in the home, sleeping routines, eating routines, etc. We then sketch out the design of a privacy-enhancing smart meter architecture that allows an electric utility to achieve its net metering goals without compromising the privacy of its customers.

Question: How many people are in the home?


Scheduling for Reduced CPU Energy. The energy usage of computer systems is becoming more important, especially for battery operated systems. Displays, disks, and cpus, in that order, use the most energy. Reducing the energy used by displays and disks has been studied elsewhere; this paper considers a new method for reducing the energy used by the cpu. We introduce a new metric for cpu energy performance, millions-of-instructions-per-joule (MIPJ). We examine a class of methods to reduce MIPJ that are characterized by dynamic control of system clock speed by the operating system scheduler. Reducing clock speed alone does not reduce MIPJ, since to do the same work the system must run longer. However, a number of methods are available for reducing energy with reduced clock-speed, such as reducing the voltage [Chandrakasan et al 1992][Horowitz 1993] or using reversible [Younis and Knight 1993] or adiabatic logic [Athas et al 1994].  What are the right scheduling algorithms for taking advantage of reduced clock-speed, especially in the presence of applications demanding ever more instructions-per-second? We consider several methods for varying the clock speed dynamically under control of the operating system, and examine the performance of these methods against workstation traces. The primary result is that by adjusting the clock speed at a fine grain, substantial CPU energy can be saved with a limited impact on performance.

Question: What are the right scheduling algorithms for taking advantage of reduced clock-speed, especially in the presence of applications demanding ever more instructions-per-second?


A Modularization Method for Battery Equalizers Using Multiwinding Transformers. This paper proposes a modularized global architecture using multi-winding transformers for battery cell balancing. The global balancing for a series-connected battery string is achieved based on forward conversion in each battery module and based on flyback conversion among modules. The demagnetization of the multiwinding transformers is also simultaneously achieved by the flyback conversion among modules without the need of additional demagnetizing circuits. Moreover, all MOSFET switches are driven by two complementary pulse width modulation signals without the requirement of cell voltage sensors, and energy can be automatically and simultaneously delivered from any high voltage cells to any low voltage cells. Compared with existing equalizers requiring additional balancing circuits for battery modules, the proposed modularized equalizer shares one circuit for the balancing among cells and modules. The balancing performance of the proposed equalizer is perfectly verified through experimental results, and the maximum balancing efficiency is up to 91.3%. In summary, the proposed modularized equalizer has the advantages of easier modularization, simpler control, higher efficiency, smaller size, and lower cost, ensuring the battery system higher reliability and easier implementation.

Question: How does the proposed equalizer work?


Neural Ordinary Differential Equations. We introduce a new family of deep neural network models. Instead of specifying a discrete sequence of hidden layers, we parameterize the derivative of the hidden state using a neural network. The output of the network is computed using a blackbox differential equation solver. These continuous-depth models have constant memory cost, adapt their evaluation strategy to each input, and can explicitly trade numerical precision for speed. We demonstrate these properties in continuous-depth residual networks and continuous-time latent variable models. We also construct continuous normalizing flows, a generative model that can train by maximum likelihood, without partitioning or ordering the data dimensions. For training, we show how to scalably backpropagate through any ODE solver, without access to its internal operations. This allows end-to-end training of ODEs within larger models.

Question: What is a neural ordinary differential equation?


UMBC_EBIQUITY-CORE: Semantic Textual Similarity Systems. We describe three semantic text similarity systems developed for the *SEM 2013 STS shared task and the results of the corresponding three runs. All of them shared a word similarity feature that combined LSA word similarity and WordNet knowledge. The first, which achieved the best mean score of the 89 submitted runs, used a simple term alignment algorithm augmented with penalty terms. The other two runs, ranked second and fourth, used support vector regression models to combine larger sets of features.

Question: What is the best semantic text similarity system?


Enterprise systems implementation and accounting benefits. Purpose – The aim of this paper is to examine the accounting benefits involved in adopting enterprise systems, but also to comprehend the underlying causes that motivate their adoption. Design/methodology/approach – This paper presents evidence from a survey of 73 companies which implemented ES on the related benefits to their accounting information provision and practices. Findings – Empirical evidence confirms a number of benefits derived from the application of ES that focus on the following dimensions: organisation, operations, management and IT infrastructure. These benefits are related both to the reasons leading to the implementation of ES and to the relevant selection of ES modules. Originality/value – The corresponding results from this survey can then be used as a basis for establishing the best approach in order to fully exploit the potential of future ES applications in accounting practice.

Question: What are the benefits of enterprise systems implementation?


Voting-based pose estimation for robotic assembly using a 3D sensor. We propose a voting-based pose estimation algorithm applicable to 3D sensors, which are fast replacing their 2D counterparts in many robotics, computer vision, and gaming applications. It was recently shown that a pair of oriented 3D points, which are points on the object surface with normals, in a voting framework enables fast and robust pose estimation. Although oriented surface points are discriminative for objects with sufficient curvature changes, they are not compact and discriminative enough for many industrial and real-world objects that are mostly planar. As edges play the key role in 2D registration, depth discontinuities are crucial in 3D. In this paper, we investigate and develop a family of pose estimation algorithms that better exploit this boundary information. In addition to oriented surface points, we use two other primitives: boundary points with directions and boundary line segments. Our experiments show that these carefully chosen primitives encode more information compactly and thereby provide higher accuracy for a wide class of industrial parts and enable faster computation. We demonstrate a practical robotic bin-picking system using the proposed algorithm and a 3D sensor.

Question: What is a voting-based pose estimation algorithm?


Training and operation of an integrated neuromorphic network based on metal-oxide memristors. Despite much progress in semiconductor integrated circuit technology, the extreme complexity of the human cerebral cortex, with its approximately 1014 synapses, makes the hardware implementation of neuromorphic networks with a comparable number of devices exceptionally challenging. To provide comparable complexity while operating much faster and with manageable power dissipation, networks based on circuits combining complementary metal-oxide-semiconductors (CMOSs) and adjustable two-terminal resistive devices (memristors) have been developed. In such circuits, the usual CMOS stack is augmented with one or several crossbar layers, with memristors at each crosspoint. There have recently been notable improvements in the fabrication of such memristive crossbars and their integration with CMOS circuits, including first demonstrations of their vertical integration. Separately, discrete memristors have been used as artificial synapses in neuromorphic networks. Very recently, such experiments have been extended to crossbar arrays of phase-change memristive devices. The adjustment of such devices, however, requires an additional transistor at each crosspoint, and hence these devices are much harder to scale than metal-oxide memristors, whose nonlinear current–voltage curves enable transistor-free operation. Here we report the experimental implementation of transistor-free metal-oxide memristor crossbars, with device variability sufficiently low to allow operation of integrated neural networks, in a simple network: a single-layer perceptron (an algorithm for linear classification). The network can be taught in situ using a coarse-grain variety of the delta rule algorithm to perform the perfect classification of 3 × 3-pixel black/white images into three classes (representing letters). This demonstration is an important step towards much larger and more complex memristive neuromorphic

Question: What is a single-layer perceptron?


Attacks on Copyright Marking Systems. In the last few years, a large number of schemes have been proposed for hiding copyright marks and other information in digital pictures, video, audio and other multimedia objects. We describe some contenders that have appeared in the research literature and in the field; we then present a number of attacks that enable the information hidden by them to be removed or otherwise rendered unusable. 1 Information Hiding Applications The last few years have seen rapidly growing interest in ways to hide information in other information. A number of factors contributed to this. Fears that copyright would be eroded by the ease with which digital media could be copied led people to study ways of embedding hidden copyright marks and serial numbers in audio and video; concern that privacy would be eroded led to work on electronic cash, anonymous remailers, digital elections and techniques for making mobile computer users harder for third parties to trace; and there remain the traditional 'military' concerns about hiding one's own traffic while making it hard for the opponent to do likewise. The first international workshop on information hiding [2] brought these communities together and a number of hiding schemes were presented there; more have been presented elsewhere. We formed the view that useful progress in steganography and copyright marking might come from trying to attack all these first generation schemes. In the related field of cryptology, progress was iterative: cryptographic algorithms were proposed, attacks on them were found, more algorithms were proposed, and so on. Eventually, theory emerged: fast correlation attacks on stream ciphers and differential and linear attacks on block ciphers, now help us understand the strength of cryptographic algorithms in much more detail than before. Similarly, many cryptographic protocols were proposed and almost all the early candidates were broken, leading to concepts of protocol robustne

Question: What is the difference between steganography and copyright marking?


A holistic approach to service survivability. We present SABER (Survivability Architecture: Block, Evade, React), a proposed survivability architecture that blocks, evades and reacts to a variety of attacks by using several security and survivability mechanisms in an automated and coordinated fashion. Contrary to the ad hoc manner in which contemporary survivable systems are built-using isolated, independent security mechanisms such as firewalls, intrusion detection systems and software sandboxes-SABER integrates several different technologies in an attempt to provide a unified framework for responding to the wide range of attacks malicious insiders and outsiders can launch.  This coordinated multi-layer approach will be capable of defending against attacks targeted at various levels of the network stack, such as congestion-based DoS attacks, software-based DoS or code-injection attacks, and others. Our fundamental insight is that while multiple lines of defense are useful, most conventional, uncoordinated approaches fail to exploit the full range of available responses to incidents. By coordinating the response, the ability to survive successful security breaches increases substantially.  We discuss the key components of SABER, how they will be integrated together, and how we can leverage on the promising results of the individual components to improve survivability in a variety of coordinated attack scenarios. SABER is currently in the prototyping stages, with several interesting open research topics.

Question: What is a holistic approach to service survivability?


Consistent Generative Query Networks. Stochastic video prediction is usually framed as an extrapolation problem where the goal is to sample a sequence of consecutive future image frames conditioned on a sequence of observed past frames. For the most part, algorithms for this task generate future video frames sequentially in an autoregressive fashion, which is slow and requires the input and output to be consecutive. We introduce a model that overcomes these drawbacks – it learns to generate a global latent representation from an arbitrary set of frames within a video. This representation can then be used to simultaneously and efficiently sample any number of temporally consistent frames at arbitrary time-points in the video. We apply our model to synthetic video prediction tasks and achieve results that are comparable to state-of-the-art video prediction models. In addition, we demonstrate the flexibility of our model by applying it to 3D scene reconstruction where we condition on location instead of time. To the best of our knowledge, our model is the first to provide flexible and coherent prediction on stochastic video datasets, as well as consistent 3D scene samples. Please check the project website https://bit.ly/2jX7Vyu to view scene reconstructions and videos produced by our model.

Question: What is the difference between a generative model and a discriminative model?


Recent Research in Cooperative Control of Multivehicle. This paper presents a survey of recent research in cooperative control of multivehicle systems, using a common mathematical framework to allow different methods to be described in a unified way. The survey has three primary parts: an overview of current applications of cooperative control, a summary of some of the key technical approaches that have been explored, and a description of some possible future directions for research. Specific technical areas that are discussed include formation control, cooperative tasking, spatiotemporal planning, and consensus. DOI: 10.1115/1.2766721

Question: What is the common mathematical framework?


SIGNet: Semantic Instance Aided Unsupervised 3D Geometry Perception. Unsupervised learning for visual perception of 3D geometry is of great interest to autonomous systems. Recent works on unsupervised learning have made considerable progress on geometry perception; however, they perform poorly on dynamic objects and scenarios with dark and noisy environments. In contrast, supervised learning algorithms, which are robust, require large labeled geometric dataset. This paper introduces SIGNet, a novel framework that provides robust geometry perception without requiring geometrically informative labels. Specifically, SIGNet integrates semantic information to make unsupervised robust geometric predictions for dynamic objects in low lighting and noisy environments. SIGNet is shown to improve upon the state-of-the-art unsupervised learning for geometry perception by 30% (in squared relative error for depth prediction). In particular, SIGNet improves the dynamic object class performance by 39% in depth prediction and 29% in flow prediction.

Question: What is the state of the art in unsupervised learning for geometry perception?


Demand forecasting with high dimensional data: The case of SKU retail sales forecasting with intra- and inter-category promotional information. In marketing analytics applications in OR, the modeler often faces the problem of selecting key variables from a large number of possibilities. For example, SKU level retail store sales are affected by inter and intra category effects which potentially need to be considered when deciding on promotional strategy and producing operational forecasts, but no research has put this well accepted concept into forecasting practice: an obvious obstacle is the ultra-high dimensionality of the variable space. This paper develops a four steps methodological framework to overcome the problem. It is illustrated by investigating the value of both intraand inter-category SKU level promotional information in improving forecast accuracy. The method consists of the identification of potentially influential categories, the building of the explanatory variable space, variable selection and model estimation by a multistage LASSO regression, and the use of a rolling scheme to generate forecasts. The success of this new method for dealing with high dimensionality is demonstrated by improvements in forecasting accuracy compared to alternative methods of simplifying the variable space. The empirical results show that models integrating more information perform significantly better than the baseline model when using the proposed methodology framework. In general, we can improve the forecasting accuracy by 14.3 percent over the model using only the SKU's own predictors. But of the improvements achieved, 88.1 percent of it comes from the intra-category information, and only 11.9 percent from the inter-category information. The substantive marketing results also have implications for promotional category management.

Question: How to deal with high dimensional data?


Mobile App Tagging. Mobile app tagging aims to assign a list of keywords indicating core functionalities, main contents, key features or concepts of a mobile app. Mobile app tags can be potentially useful for app ecosystem stakeholders or other parties to improve app search, browsing, categorization, and advertising, etc. However, most mainstream app markets, e.g., Google Play, Apple App Store, etc., currently do not explicitly support such tags for apps. To address this problem, we propose a novel auto mobile app tagging framework for annotating a given mobile app automatically, which is based on a search-based annotation paradigm powered by machine learning techniques. Specifically, given a novel query app without tags, our proposed framework (i) first explores online kernel learning techniques to retrieve a set of top-N similar apps that are semantically most similar to the query app from a large app repository; and (ii) then mines the text data of both the query app and the top-N similar apps to discover the most relevant tags for annotating the query app. To evaluate the efficacy of our proposed framework, we conduct an extensive set of experiments on a large real-world dataset crawled from Google Play. The encouraging results demonstrate that our technique is effective and promising.

Question: What is the name of the app?


IFCaaS: Information Flow Control as a Service for Cloud Security. With the maturity of service-oriented architecture (SOA) and Web technologies, web services have become critical components of Software as a Service (SaaS) applications in cloud ecosystem environments. Most SaaS applications leverage multi-tenant data stores as a back end to keep and process data with high agility. Although these technologies promise impressive benefits, they put SaaS applications at risk against novel as well as prevalent attack vectors. This security risk is further magnified by the loss of control and lack of security enforcement over sensitive data manipulated by SaaS applications. An effective solution is needed to fulfill several requirements originating in the dynamic and complex nature of such applications. Inspired by the rise of Security as a Service (SecaaS) model, this paper introduces "Information Flow Control as a Service (IFCaaS)". IFCaaS lays the foundation of cloud-delivered IFC-based security analysis and monitoring services. As an example of the adoption of the IFCaaS, this paper presents a novel framework that addresses the detection of information flow vulnerabilities in SaaS applications. Our initial experiments show that the framework is a viable solution to protect against data integrity and confidentiality violations leading to information leakage.

Question: What is the difference between IFCaaS and SecaaS?


Impact of Social Media on Social Anxiety: A Systematic Review. Introduction: Online social networking sites are being used all around the world. However, only recently researchers have started to investigate their relationship with mental health. Evidence coming from literature suggests that they have both advantages and disadvantages for individuals. The aim of this study is to critically review the existent research conducted on the relationship between online social networking and social anxiety. Method: According to PRISMA guidelines, comprehensive systematic searches of electronic databases were conducted (PsychInfo, Cochrane, PubMed, Scopus, Web of Science). Terms related to online social networking were combined with social anxiety terms. After identifying relevant papers, the relationship between social media networking and social anxiety as well as limitations of each study were presented. All of the papers included were cross-sectional, relying on self-report assessments. Conclusion: There are several papers published on the relationship between social media and social anxiety; however, more research needs to be done in order to clarify the influence of one variable over the other. Rigorous experimental studies need to be conducted with different time-point assessments, and bidirectionality should be investigated. Important mediators and moderators have to be considered in order to explain the relationship between social media networking and social anxiety.

Question: What is the relationship between social media and social anxiety?


Current sharing in three-phase LLC interleaved resonant converter. In this paper, a novel approach for multi-phase interleaved LLC resonant converter is presented. The proposed solution, based on the use of three LLC modules with star connection of transformer primary windings, allows a drastic reduction of the output current ripple and consequently of the output filter capacitor size. Differently from other multi-phase solutions, that are greatly susceptible to resonant components' tolerance causing current imbalance, the proposed topology exhibits an inherent current sharing capability. Moreover, a closed-loop phase-shift control is introduced to additionally compensate for current mismatch and completely balance the current supplied by each module. The benefit of such solution on the reduction of output current ripple and the phase-shift control interaction and effect on load-step variations are also investigated. Measurements on a prototype are added to simulations as validation of the assertions and proposals.

Question: What is the current sharing in three-phase LLC interleaved resonant converter?


Design and Describe REST API without Violating REST: A Petri Net Based Approach. As REST architectural style gains popularity in the web service community, there is a growing concern and debate on how to design Restful web services (REST API) in a proper way. We attribute this problem to lack of a standard model and language to describe a REST API that respects all the REST constraints. As a result, many web services that claim to be REST API are not hypermedia driven as prescribed by REST. This situation may lead to REST APIs that are not as scalable, extensible, and interoperable as promised by REST. To address this issue, this paper proposes REST Chart as a model and language to design and describe REST API without violating the REST constraints. REST Chart models a REST API as a special type of Colored Petri Net whose topology defines the REST API and whose token markings define the representational state space of user agents using that API. We demonstrate REST Chart with an example REST API. We also show how REST Chart can support efficient content negotiation and reuse hybrid representations to broaden design choices. Furthermore, we argue that the REST constraints, such as hypermedia driven and statelessness, can either be enforced naturally or checked automatically in REST Chart.

Question: How to design REST API without violating REST constraints?


1 . 2 Named Entity Recognition Task. In this report, we explore various methods that are applied to solve NER. In section 1, we introduce the named entity problem. In section 2, various named entity recognition methods are discussed in three three broad categories of machine learning paradigm and explore few learning techniques in them. In the first part, we discuss various supervised techniques. Subsequently we move to semi-supervised and unsupervised techniques. In the end we discuss about the method from deep learning to solve NER.

Question: What is named entity recognition?


A least-squares approach to anomaly detection in static and sequential data. We describe a probabilistic, nonparametric method for anomaly detection, based on a squared-loss objective function which has a simple analytical solution. The method emerges from extending recent work in nonparametric leastsquares classification to include a "none-of-the-above" class which models anomalies in terms of non-anamalous training data. The method shares the flexibility of other kernel-based anomaly detection methods, yet is typically much faster to train and test. It can also be used to distinguish between multiple inlier classes and anomalies. The probabilistic nature of the output makes it straightforward to apply even when test data has structural dependencies; we show how a hidden Markov model framework can be incorporated in order to identify anomalous subsequences in a test sequence. Empirical results on datasets from several domains show the method to have comparable discriminative performance to popular alternatives, but with a clear speed advantage.

Question: What is a least-squares approach to anomaly detection?


GaN HEMT based Doherty amplifier for 3.5-GHz WiMAX Applications. We have implemented a Doherty amplifier for 3.5-GHz World Interoperability for Microwave Access (WiMAX) applications using Eudyna 90-W (P3 dB) Gallium-Nitride (GaN) High Electron Mobility Transistor (HEMT) because of the poor efficiency of a standard class AB amplifier when the linearity performance is good. The load modulation performance of the GaN HEMT device for the Doherty operation is rather moderate but workable. The linearity is improved using the in-band error cancellation technique of the Doherty amplifier. The implemented Doherty amplifier has been designed at an average output power of 43 dBm, backed-off about 8 dB from the 51 dBm (P3 dB). For WiMAX signal with 28 MHz signal bandwidth, the measured drain efficiency of the amplifier is 27.8%, and the measured Relative Constellation Error (RCE) is -33.17 dB, while those of the comparable class AB amplifier are 19.42% and -24.26 dB, respectively, at the same average output power level.

Question: What is the average output power of the amplifier?


Language Models with Pre-Trained (GloVe) Word Embeddings. In this work we present a step-by-step implementation of training a Language Model (LM) , using Recurrent Neural Network (RNN) and pre-trained GloVe word embeddings, introduced by Pennigton et al. in [1]. The implementation is following the general idea of training RNNs for LM tasks presented in [2] , but is rather using Gated Recurrent Unit (GRU) [3] for a memory cell, and not the more commonly used LSTM [4]. The implementation presented is based on using keras1 [5].

Question: How to train a language model using pre-trained word embeddings?


Balun and power divider based on multilayer ring resonators (MRR). This paper presents novel super compact microwave power dividers and balun (balanced-to-unbalanced) circuits. The proposed devices are based on multilayer ring resonators (MRR) structure. These new microwave devices are highly compact and flexible in design that can operate within various desirable bandwidths from narrow-band to ultrawideband (UWB), hence performing as bandpass filters simultaneously along with their own functions. It is also possible to have arbitrary power divisions. By this technique, a balun can be simply converted to a power diver and vice versa. Sample circuits are designed and the scattering characteristics are provided using electromagnetic simulation software. The dimensions of the devices are 2.3 mm χ 2.3 mm χ 1.5 mm.

Question: What is a balun?


Prefrontal cortical function and anxiety: controlling attention to threat-related stimuli. Threat-related stimuli are strong competitors for attention, particularly in anxious individuals. We used functional magnetic resonance imaging (fMRI) with healthy human volunteers to study how the processing of threat-related distractors is controlled and whether this alters as anxiety levels increase. Our work builds upon prior analyses of the cognitive control functions of lateral prefrontal cortex (lateral PFC) and anterior cingulate cortex (ACC). We found that rostral ACC was strongly activated by infrequent threat-related distractors, consistent with a role for this area in responding to unexpected processing conflict caused by salient emotional stimuli. Participants with higher anxiety levels showed both less rostral ACC activity overall and reduced recruitment of lateral PFC as expectancy of threat-related distractors was established. This supports the proposal that anxiety is associated with reduced top-down control over threat-related distractors. Our results suggest distinct roles for rostral ACC and lateral PFC in governing the processing of task-irrelevant, threat-related stimuli, and indicate reduced recruitment of this circuitry in anxiety.

Question: How does anxiety affect the brain?


EHRs Connect Research and Practice: Where Predictive Modeling, Artificial Intelligence, and Clinical Decision Support Intersect. Objectives: Electronic health records (EHRs) are only a first step in capturing and utilizing healthrelated data—the challenge is turning that data into useful information. Furthermore, EHRs are increasingly likely to include data relating to patient outcomes, functionality such as clinical decision support, and genetic information as well, and, as such, can be seen as repositories of increasingly valuable information about patients' health conditions and responses to treatment over time. Methods: We describe a case study of 423 patients treated by Centerstone within Tennessee and Indiana in which we utilized electronic health record data to generate predictive algorithms of individual patient treatment response. Multiple models were constructed using predictor variables derived from clinical, financial and geographic data. Results: For the 423 patients, 101 deteriorated, 223 improved and in 99 there was no change in clinical condition. Based on modeling of various clinical indicators at baseline, the highest accuracy in predicting individual patient response ranged from 70% to 72% within the models tested. In terms of individual predictors, the Centerstone Assessment of Recovery Level—Adult (CARLA) baseline score was most significant in predicting outcome over time (odds ratio 4.1+2.27). Other variables with consistently significant impact on outcome included payer, diagnostic category, location and provision of case management services. Conclusions: This approach represents a promising avenue toward reducing the current gap between research and practice across healthcare, developing data-driven clinical decision support based on real-world populations, and serving as a component of embedded clinical artificial intelligences that ''learn'' over time. & 2012 Fellowship of Postgraduate Medicine. Published by Elsevier Ltd. All rights reserve

Question: What is the difference between a predictive model and a clinical decision support system?


A Convolutional Neural Network for Modelling Sentences. The ability to accurately represent sentences is central to language understanding. We describe a convolutional architecture dubbed the Dynamic Convolutional Neural Network (DCNN) that we adopt for the semantic modelling of sentences. The network uses Dynamic k-Max Pooling, a global pooling operation over linear sequences. The network handles input sentences of varying length and induces a feature graph over the sentence that is capable of explicitly capturing short and long-range relations. The network does not rely on a parse tree and is easily applicable to any language. We test the DCNN in four experiments: small scale binary and multi-class sentiment prediction, six-way question classification and Twitter sentiment prediction by distant supervision. The network achieves excellent performance in the first three tasks and a greater than 25% error reduction in the last task with respect to the strongest baseline.

Question: What is the dynamic convolutional neural network?


Large Scale Cloudlets Deployment for Efficient Mobile Cloud Computing. Interest in using Mobile Cloud Computing (MCC) for compute intensive mobile devices jobs such as multimedia applications has been growing. In fact, many new research efforts were invested to maximize the mobile intensive jobs offloading to the cloud within the cloud system coverage area. However, a large scale MCC deployment challenges and limitations are not considered. In this paper, a large scale Cloudlet-based MCC system deployment is introduced, aiming at reducing the power consumption and the network delay of multimedia applications while using MCC. The proposed deployment offers a large coverage area that can be used by mobile devices while they are moving from one location to another to reduce broadband communication needs. Practical experimental results and simulated results using show that using the proposed model reduces the power consumption of the mobile devices as well as reducing the communication latency when the mobile device requests a job to be performed remotely while satisfying the high quality of service requirements of mobile users.

Question: What is the size of the cloudlet deployment?


Adding nesting structure to words. We propose the model of nested words for representation of data with both a linear ordering and a hierarchically nested matching of items. Examples of data with such dual linear-hierarchical structure include executions of structured programs, annotated linguistic data, and HTML/XML documents. Nested words generalize both words and ordered trees, and allow both word and tree operations. We define nested word automata—finite-state acceptors for nested words, and show that the resulting class of regular languages of nested words has all the appealing theoretical properties that the classical regular word languages enjoys: deterministic nested word automata are as expressive as their nondeterministic counterparts; the class is closed under union, intersection, complementation, concatenation, Kleene-*, prefixes, and language homomorphisms; membership, emptiness, language inclusion, and language equivalence are all decidable; and definability in monadic second order logic corresponds exactly to finite-state recognizability. We also consider regular languages of infinite nested words and show that the closure properties, MSO-characterization, and decidability of decision problems carry over.  The linear encodings of nested words give the class of visibly pushdown languages of words, and this class lies between balanced languages and deterministic context-free languages. We argue that for algorithmic verification of structured programs, instead of viewing the program as a context-free language over words, one should view it as a regular language of nested words (or equivalently, a visibly pushdown language), and this would allow model checking of many properties (such as stack inspection, pre-post conditions) that are not expressible in existing specification logics.  We also study the relationship between ordered trees and nested words, and the corresponding automata: while the analysis complexity of nested word automata is the same as t

Question: What is the relationship between nested words and ordered trees?


Modeling Biological Processes for Reading Comprehension. Machine reading calls for programs that read and understand text, but most current work only attempts to extract facts from redundant web-scale corpora. In this paper, we focus on a new reading comprehension task that requires complex reasoning over a single document. The input is a paragraph describing a biological process, and the goal is to answer questions that require an understanding of the relations between entities and events in the process. To answer the questions, we first predict a rich structure representing the process in the paragraph. Then, we map the question to a formal query, which is executed against the predicted structure. We demonstrate that answering questions via predicted structures substantially improves accuracy over baselines that use shallower representations.

Question: What is the difference between a biological process and a biological process?


Adaptive control of systems in cascade with saturation. Some systems may be approximated as block cascades structures where each block of the cascade can be approximately feedback linearized. In such systems, the states of the lower subsystem blocks affect the dynamics of the upper subsystems. In generating an inverse for a given block, a subset of its lower subsystem states can be treated as virtual actuators in addition to actual direct actuation that may be available. The desired virtual actuator signal arising from the upper subsystem's inverse now appears as a command to the lower subsystem. This paper introduces an adaptive element that is capable of canceling modeling errors arising due to feedback linearization. It also introduces reference models that include a pseudocontrol hedging signal which protects the adaptive element from lower subsystem's dynamics.

Question: What is adaptive control of systems in cascade with saturation?


TrajAnalytics: A Web-Based Visual Analytics Software of Urban Trajectory. We present a web-based software, named TrajAnalytics, for the visual analytics of urban trajectory datasets. It allows users to interactively visualize and analyze the massive taxi trajectories over urban spaces. The software offers data management capability and enable various visual queries through a web interface. A set of visualization widgets and interaction functions are developed to promote easy user engagement. We implemented two prototypes with realworld datasets: (1) the origin/destination (OD) data of taxi trips collected in New York City; and (2) the taxi trajectory data collected in Porto City in Portugal. This open source software supports practitioners, researchers, and decision-makers in advancing transportation and urban studies in the new era of smart city.

Question: What is a web-based visual analytics software of urban trajectory?


Autocomplete hand-drawn animations. Hand-drawn animation is a major art form and communication medium, but can be challenging to produce. We present a system to help people create frame-by-frame animations through manual sketches. We design our interface to be minimalistic: it contains only a canvas and a few controls. When users draw on the canvas, our system silently analyzes all past sketches and predicts what might be drawn in the future across spatial locations and temporal frames. The interface also offers suggestions to beautify existing drawings. Our system can reduce manual workload and improve output quality without compromising natural drawing flow and control: users can accept, ignore, or modify such predictions visualized on the canvas by simple gestures. Our key idea is to extend the local similarity method in [Xing et al. 2014], which handles only low-level spatial repetitions such as hatches within a single frame, to a global similarity that can capture high-level structures across multiple frames such as dynamic objects. We evaluate our system through a preliminary user study and confirm that it can enhance both users' objective performance and subjective satisfaction.

Question: What is a hand-drawn animation?


AN AUTOMATIC SYSTEM FOR DETECTING AND COUNTING RBC AND WBC USING FUZZY LOGIC. Blood cell detection and counting is the initial process for detecting and diagnosing diseases. Several image processing algorithms are there for the blood cell classification and counting. The processed image helps to detect different blood related diseases. In all those algorithms several pre-processing steps are there for the process of detection and counting. Though all the algorithms give accurate results, the pre-processing steps are complex and time-consuming. This paper discusses about the RBC and WBC detection using fuzzy logic. Fuzzy logic toolbox software in MATLAB is used to develop the model on virtual platform.

Question: How to detect and count blood cells using fuzzy logic?


Data-driven 3D Voxel Patterns for object category recognition. Despite the great progress achieved in recognizing objects as 2D bounding boxes in images, it is still very challenging to detect occluded objects and estimate the 3D properties of multiple objects from a single image. In this paper, we propose a novel object representation, 3D Voxel Pattern (3DVP), that jointly encodes the key properties of objects including appearance, 3D shape, viewpoint, occlusion and truncation. We discover 3DVPs in a data-driven way, and train a bank of specialized detectors for a dictionary of 3DVPs. The 3DVP detectors are capable of detecting objects with specific visibility patterns and transferring the meta-data from the 3DVPs to the detected objects, such as 2D segmentation mask, 3D pose as well as occlusion or truncation boundaries. The transferred meta-data allows us to infer the occlusion relationship among objects, which in turn provides improved object recognition results. Experiments are conducted on the KITTI detection benchmark [17] and the outdoor-scene dataset [41]. We improve state-of-the-art results on car detection and pose estimation with notable margins (6% in difficult data of KITTI). We also verify the ability of our method in accurately segmenting objects from the background and localizing them in 3D.

Question: What is the 3D voxel pattern?