Reading comprehension and its underlying components in second-language learners: A meta-analysis of studies comparing first- and second-language learners.. We report a systematic meta-analytic review of studies comparing reading comprehension and its underlying components (language comprehension, decoding, and phonological awareness) in first- and second-language learners. The review included 82 studies, and 576 effect sizes were calculated for reading comprehension and underlying components. Key findings were that, compared to first-language learners, second-language learners display a medium-sized deficit in reading comprehension (pooled effect size d = -0.62), a large deficit in language comprehension (pooled effect size d = -1.12), but only small differences in phonological awareness (pooled effect size d = -0.08) and decoding (pooled effect size d = -0.12). A moderator analysis showed that characteristics related to the type of reading comprehension test reliably explained the variation in the differences in reading comprehension between first- and second-language learners. For language comprehension, studies of samples from low socioeconomic backgrounds and samples where only the first language was used at home generated the largest group differences in favor of first-language learners. Test characteristics and study origin reliably contributed to the variations between the studies of language comprehension. For decoding, Canadian studies showed group differences in favor of second-language learners, whereas the opposite was the case for U.S. studies. Regarding implications, unless specific decoding problems are detected, interventions that aim to ameliorate reading comprehension problems among second-language learners should focus on language comprehension skills.

Question: What is the difference between first and second language learners?


Algorithms for Delta Compression and Remote File Synchronization. Delta compression and remote file synchronization techniques are concerned with efficient file transfer over a slow communication link in the case where the receiving party already has a similar file (or files). This problem arises naturally, e.g., when distributing updated versions of software over a network or synchronizing personal files between different accounts and devices. More generally, the problem is becoming increasingly common in many networkbased applications where files and content are widely replicated, frequently modified, and cut and reassembled in different contexts and packagings. In this chapter, we survey techniques, software tools, and applications for delta compression, remote file synchronization, and closely related problems. We first focus on delta compression, where the sender knows all the similar files that are held by the receiver. In the second part, we survey work on the related, but in many ways quite different, problem of remote file synchronization, where the sender does not have a copy of the files held by the receiver. Work supported by NSF CAREER Award NSF CCR-0093400 and by Intel Corporation.

Question: What is the difference between delta compression and remote file synchronization?


Understanding and Using Patterns in Software Development. Patterns have shown to be an effective means of capturing and communicating software design experience. However, there is more to patterns than software design patterns: We believe that patterns work for software development on several levels. In this paper we explore what we have come to understand as crucial aspects of the pattern concept, relate patterns to the different models built during software design, discuss pattern forms and how we think that patterns can form larger wholes like pattern handbooks.

Question: What is a pattern?


BC-PDS: Protecting Privacy and Self-Sovereignty through BlockChains for OpenPDS. In the Big Data era, personal metadata may will become a new type of corporate asset, however there have already been a growing public concern about user's privacy mined from metadata. In this paper we address the problem of implementing the self-sovereignty of personal metadata on the existing OpenPDS/SafeAnswers framework according to the Windhover Principle. In order to do that, we propose a new framework, called BlocakChain-based Personal Data Store (BCPDS), to realize two basic properties: notary and autonomy. This framework, firstly introduces the BlockChain as a notary, into OpenPDS/SafeAnswers for secure storage of personal meta-data instead of the original database. Next, we present an AutoNomybased Access Control (ANAC) to improve the SafeAnswers module, where ANAC is a new mechanism that enforces access based on the relationship among all authorized users and metadata's owner. In addition, we also propose General Access Structure (GAS) and threshold secret sharing scheme in BlockChain as an implementation method for our BC-PDS framework.

Question: How to protect privacy and self-sovereignty of personal metadata?


Cinnamon for diabetes mellitus.. BACKGROUND Diabetes mellitus is a chronic metabolic disorder that is associated with an increased risk of cardiovascular disease, retinopathy, nephropathy, neuropathy, sexual dysfunction and periodontal disease. Improvements in glycaemic control may help to reduce the risk of these complications. Several animal studies show that cinnamon may be effective in improving glycaemic control. While these effects have been explored in humans also, findings from these studies have not yet been systematically reviewed.   OBJECTIVES To evaluate the effects of cinnamon in patients with diabetes mellitus.   SEARCH METHODS Pertinent randomised controlled trials were identified through AARP Ageline, AMED, AMI, BioMed Central gateway, CAM on PubMed, CINAHL, Dissertations Abstracts International, EMBASE, Health Source Nursing/Academic edition, International Pharmaceutical Abstracts, MEDLINE, Natural medicines comprehensive database, The Cochrane Library and TRIP database. Clinical trial registers and the reference lists of included trials were searched also (all up to January 2012). Content experts and manufacturers of cinnamon extracts were also contacted.   SELECTION CRITERIA All randomised controlled trials comparing the effects of orally administered monopreparations of cinnamon (Cinnamomum spp.) to placebo, active medication or no treatment in persons with either type 1 or type 2 diabetes mellitus.   DATA COLLECTION AND ANALYSIS Two review authors independently selected trials, assessed risk of bias and trial quality, and extracted data. We contacted study authors for missing information.   MAIN RESULTS Ten prospective, parallel-group design, randomised controlled trials, involving a total of 577 participants with type 1 and type 2 diabetes mellitus, were identified. Risk of bias was high or unclear in all but two trials, which were assessed as having moderate risk of bias. Risk of bias in some domains was high in 50% of trials. Oral monoprepara

Question: What is the effect of cinnamon on diabetes mellitus?


Cannabidiol Claims and Misconceptions.. Once a widely ignored phytocannabinoid, cannabidiol now attracts great therapeutic interest, especially in epilepsy and cancer. As with many rising trends, various myths and misconceptions have accompanied this heightened public interest and intrigue. This forum article examines and attempts to clarify some areas of contention.

Question: What is the difference between cannabidiol and cannabidiol?


Note-Taking With Computers : Exploring Alternative Strategies for Improved Recall. Three experiments examined note-taking strategies and their relation to recall. In Experiment 1, participants were instructed either to take organized lecture notes or to try and transcribe the lecture, and they either took their notes by hand or typed them into a computer. Those instructed to transcribe the lecture using a computer showed the best recall on immediate tests, and the subsequent experiments focused on note-taking using computers. Experiment 2 showed that taking organized notes produced the best recall on delayed tests. In Experiment 3, however, when participants were given the opportunity to study their notes, those who had tried to transcribe the lecture showed better recall on delayed tests than those who had taken organized notes. Correlational analyses of data from all 3 experiments revealed that for those who took organized notes, working memory predicted note-quantity, which predicted recall on both immediate and delayed tests. For those who tried to transcribe the lecture, in contrast, only note-quantity was a consistent predictor of recall. These results suggest that individuals who have poor working memory (an ability traditionally thought to be important for note-taking) can still take effective notes if they use a note-taking strategy (transcribing using a computer) that can help level the playing field for students of diverse cognitive abilities.

Question: What is the difference between note-taking and note-taking with computers?


Open-World Knowledge Graph Completion. Knowledge Graphs (KGs) have been applied to many tasks including Web search, link prediction, recommendation, natural language processing, and entity linking. However, most KGs are far from complete and are growing at a rapid pace. To address these problems, Knowledge Graph Completion (KGC) has been proposed to improve KGs by filling in its missing connections. Unlike existing methods which hold a closed-world assumption, i.e., where KGs are fixed and new entities cannot be easily added, in the present work we relax this assumption and propose a new open-world KGC task. As a first attempt to solve this task we introduce an openworld KGC model called ConMask. This model learns embeddings of the entity's name and parts of its text-description to connect unseen entities to the KG. To mitigate the presence of noisy text descriptions, ConMask uses a relationshipdependent content masking to extract relevant snippets and then trains a fully convolutional neural network to fuse the extracted snippets with entities in the KG. Experiments on large data sets, both old and new, show that ConMask performs well in the open-world KGC task and even outperforms existing KGC models on the standard closed-world KGC task. Introduction Knowledge Graphs (KGs) are a special type of information network that represents knowledge using RDF-style triples 〈h, r, t〉, where h represents some head entity and r represents some relationship that connects h to some tail entity t. In this formalism a statement like "Springfield is the capital of Illinois" can be represented as 〈Springfield, capitalOf, Illinois〉. Recently, a variety of KGs, such as DBPedia (Lehmann et al. 2015), and ConceptNet (Speer, Chin, and Havasi 2017), have been curated in the service of fact checking (Shi and Weninger 2016), question answering (Lukovnikov et al. 2017), entity linking (Hachey et al. 2013), and for many other tasks (Nickel et al. 2016). Despite their usefulness and popularit

Question: What is the capital of Illinois?


The relative success of alternative approaches to strategic information systems planning: an empirical analysis. Strategic information systems planning (SISP) is an exercise or ongoing activity that enables organisations to develop priorities for information systems development. It has been suggested that the 'SISP approach', a combination of method, process and implementation, is the most complete way of describing SISP activity. Based upon questionnaire responses from 267 IT Directors, four distinct approaches to SISP have been derived using cluster analysis. A comparison of these four approaches with five approaches of Earl, M.J., 1993. Experiences in SISP, MIS Quarterly, (March), 1–24, indicates that three bear strong similarities to the 'organisational', 'business-led', and 'administrative' approaches, whilst the fourth cluster is related to both Earl's 'method-driven' and 'technological' approaches. An analysis of the relationship between SISP approach and SISP success demonstrates that the 'organisational approach' is significantly more successful than the other three approaches. q 1999 Elsevier Science B.V. All rights reserved.

Question: What is the difference between the 'organisational', 'business-led', 'administrative', and 'technological' approaches to SISP?


Social Media for Opioid Addiction Epidemiology: Automatic Detection of Opioid Addicts from Twitter and Case Studies. Opioid (e.g., heroin and morphine) addiction has become one of the largest and deadliest epidemics in the United States. To combat such deadly epidemic, there is an urgent need for novel tools and methodologies to gain new insights into the behavioral processes of opioid abuse and addiction. The role of social media in biomedical knowledge mining has turned into increasingly significant in recent years. In this paper, we propose a novel framework named AutoDOA to automatically detect the opioid addicts from Twitter, which can potentially assist in sharpening our understanding toward the behavioral process of opioid abuse and addiction. In AutoDOA, to model the users and posted tweets as well as their rich relationships, a structured heterogeneous information network (HIN) is first constructed. Then meta-path based approach is used to formulate similarity measures over users and different similarities are aggregated using Laplacian scores. Based on HIN and the combined meta-path, to reduce the cost of acquiring labeled examples for supervised learning, a transductive classification model is built for automatic opioid addict detection. To the best of our knowledge, this is the first work to apply transductive classification in HIN into drug-addiction domain. Comprehensive experiments on real sample collections from Twitter are conducted to validate the effectiveness of our developed system AutoDOA in opioid addict detection by comparisons with other alternate methods. The results and case studies also demonstrate that knowledge from daily-life social media data mining could support a better practice of opioid addiction prevention and treatment.

Question: What is the role of social media in biomedical knowledge mining?


Memory reduction method for deep neural network training. Training deep neural networks requires a large amount of memory, making very deep neural networks difficult to fit on accelerator memories. In order to overcome this limitation, we present a method to reduce the amount of memory for training a deep neural network. The method enables to suppress memory increase during the backward pass, by reusing the memory regions allocated for the forward pass. Experimental results exhibit our method reduced the occupied memory size in training by 44.7% on VGGNet with no accuracy affection. Our method also enabled training speedup by increasing the mini batch size up to double.

Question: How to reduce memory for deep neural network training?


Overview: The Design, Adoption, and Analysis of a Visual Document Mining Tool for Investigative Journalists. For an investigative journalist, a large collection of documents obtained from a Freedom of Information Act request or a leak is both a blessing and a curse: such material may contain multiple newsworthy stories, but it can be difficult and time consuming to find relevant documents. Standard text search is useful, but even if the search target is known it may not be possible to formulate an effective query. In addition, summarization is an important non-search task. We present Overview, an application for the systematic analysis of large document collections based on document clustering, visualization, and tagging. This work contributes to the small set of design studies which evaluate a visualization system "in the wild", and we report on six case studies where Overview was voluntarily used by self-initiated journalists to produce published stories. We find that the frequently-used language of "exploring" a document collection is both too vague and too narrow to capture how journalists actually used our application. Our iterative process, including multiple rounds of deployment and observations of real world usage, led to a much more specific characterization of tasks. We analyze and justify the visual encoding and interaction techniques used in Overview's design with respect to our final task abstractions, and propose generalizable lessons for visualization design methodology.

Question: How to design a visual document mining tool for investigative journalists?


MODEL DIFFERENCES IN THE ECLIPSE MODELING FRAMEWORK. Increasingly, recording the various kinds of design-level structural evolution that a system undergoes throughout its entire life-cycle is gaining a fundamental importance and cannot be neglected in software modeling and development. In this respect, an interesting and useful operation between the designs of subsequent system versions is the difference management consisting in calculation, representation, and visualization. This work presents EMF Compare, an approach to model difference calculation and representation for the Eclipse modeling framework. Apart from leveraging the rank of model differences to that of first-class artifacts according to the "everything is a model" principle, the approach presents several properties which are discussed according to a conceptual framework.

Question: What is the difference between the eclipse modeling framework and the eclipse modeling framework?


A Q-band (40–45 GHz) 16-element phased-array transmitter in 0.18-μm SiGe BiCMOS technology. A 16-element phased-array transmitter based on 4-bit RF phase shifters is designed in 0.18-mum SiGe BiCMOS technology for Q-band applications. The phased-array shows 12.5plusmn1.5 dB of power gain per channel at 42.5 GHz for all phase states and the 3-dB gain bandwidth is 40-45.6 GHz. The input and output return loss is less than -10 dB at 37.5-50 GHz. The transmitter also results in les8.8deg of RMS phase error and les1.2 dB of RMS gain error for all phase states at 30-50 GHz. The maximum saturated output power is -2.5plusmn1.5 dBm per channel at 42.5 GHz. The RMS gain variation and RMS phase mismatch between all 16 channels is les0.5 dB and les4.5deg, respectively. The chip consumes 720 mA from a 5 V supply voltage and overall chip size is 2.6times3.2 mm2. To our knowledge, this is the first implementation of a 16-element phased array on a silicon chip with the RF phase shifting architecture at any frequency.

Question: What is the maximum saturated output power?


5GNOW: non-orthogonal, asynchronous waveforms for future mobile applications. This article provides some fundamental indications about wireless communications beyond LTE/LTE-A (5G), representing the key findings of the European research project 5GNOW. We start with identifying the drivers for making the transition to 5G networks. Just to name one, the advent of the Internet of Things and its integration with conventional human-initiated transmissions creates a need for a fundamental system redesign. Then we make clear that the strict paradigm of synchronism and orthogonality as applied in LTE prevents efficiency and scalability. We challenge this paradigm and propose new key PHY layer technology components such as a unified frame structure, multicarrier waveform design including a filtering functionality, sparse signal processing mechanisms, a robustness framework, and transmissions with very short latency. These components enable indeed an efficient and scalable air interface supporting the highly varying set of requirements originating from the 5G drivers.

Question: What is the difference between LTE and 5G?


A model for team-based access control (TMAC 2004). Role based access control (RBAC) has been proved to be effective for defining access control. However, in an environment where collaborative work is needed, additional features should be added on top of RBAC to accommodate the new requirements. In this paper we describe a team access control extension model called TMAC04 (Team-Based Access Control 2004), which is built on the well-known RBAC. The TMAC04 model efficiently represents teamwork in the real world. It allows certain users to join a team based on their existing roles in an organization within limited contexts and new permissions to perform the required work.

Question: What is a model for team-based access control?


An energy-efficient dual sampling SAR ADC with reduced capacitive DAC. This paper presents an energy-efficient SAR ADC which adopts reduced MSB cycling step with dual sampling of the analog signal. By sampling and holding the analog signal asymmetrically at both input sides of comparator, the MSB cycling step can be hidden by hold mode. Benefits from this technique, not only the total capacitance of DAC is reduced by half, but also the average switching energy is reduced by 68% compared with conventional SAR ADC. Moreover, switching energy distribution is more uniform over entire output code compared with previous works.

Question: What is SAR ADC?


The Tale of e-Government: A Review of the Stories that Have Been Told So Far and What is Yet to Come. Since its first appearance, the concept of eGovernment has evolved into a recognized means that has helped the public sector to increase its efficiency and effectiveness. A lot of research has therefore been done in this area to elaborate on the different aspects encompassing this concept. However, when looking at the existing e-Government literature, research mostly focuses on one specific aspect of e-Government and there are few generic publications that provide an overview of the diversity of this interdisciplinary research field over a longer term period. This study analyzes the abstracts of eight e-Government journals from 2000 to 2016 by means of a quantitative text mining analysis, backed by a qualitative Delphi approach. The article concludes with a discussion on the findings and implications as well as directions for future research.

Question: What is the difference between e-government and e-government?


Operability of Folded Microstrip Patch-Type Tag Antenna in the UHF RFID Bands Within 865-928 MHz. The emerging use of passive radio frequency identification (RFID) systems at ultra-high-frequency (UHF) spectrum requires application specific tag antenna designs for challenging applications. Many objects containing conductive material need novel tag antenna designs for reliable identification. The operability of folded microstrip patch-type tag antenna for objects containing conductive material is analyzed and tested within the UHF RFID bands used at the moment mainly in Europe and in North and South America. First the operability of the tag antenna design and the effects of conductive material are modeled with simulations based on finite element method (FEM). The performance of the tag antenna design affixed to a package containing metallic foil is verified with read range measurements. The results show that the antenna design is operable in both of the UHF RFID bands within 865-928 MHz

Question: What is the operability of the tag antenna design?


An Analysis of Time-Dependent Planning. This paper presents a framework for exploring issues in time-dependent planning: planning in which the time available to respond to predicted events varies, and the decision making required to formulate effective responses is complex. Our analysis of time-dependent planning suggests an approach based on a class of algorithms that we call anytime algorithms. Anytime algorithms can be interrupted at any point during computation to return a result whose utility is a function of computation time. We explore methods for solving time-dependent planning problems based on the properties of anytime algorithms. Time-dependent planning is concerned with determining how best to respond to predicted events when the time available to make such determinations varies from situation to situation. In order to program a robot to react appropriately over a range of situations, we have to understand how to design effective algorithms for time-dependent planning. In this paper, we will be concerned primarily with understanding the properties of such algorithms, and providing a precise characterization of time-dependent planning. The issues we are concerned with arise either because the number of events that the robot has to contend with varies, and, hence, the time allotted to deliberating about any one event varies, or the observations that allow us to predict events precede the events they herald by varying amounts of time. The range of planning problems in which such complications occur is quite broad. Almost any situation that involves tracking objects of differing velocities will involve time-dependent planning (e.g., vehicle monitoring [Lesser and Corkill, 1983; Durfee, 19871, signal processing [Chung et al., 19871, and juggling [Donner and Jameson, 19861). S t t i ua ions where a system has to dynamically reevaluate its options [Fox and Smith, 1985; Dean, 19871 or delay committing to specific options until critical information arrives [Fox a

Question: What is the difference between anytime and time-dependent planning?


White-box cryptography: practical protection on hostile hosts. Businesses often interact with users via web-browsers and applications on mobile devices, and host services on cloud servers they may not own. Such highly-exposed environments employ white-box cryptography (WBC) for security protection. WBC operates on a security model far different from the traditional black-box model. The modern business world includes large commercial segments in which end-users are directly exposed to business application software hosted on web browsers, mobile phones, web-connected tablets, and an increasing number of other devices: the `internet of things' (IoT). Software applications and their communication activities now dominate much of the commercial world, and there have been countless hacks on such software, and on devices hosting it, with targets as diverse as mobile phones, web browser applications, vehicles, and even refrigerators! The business advantages of deploying computational power near the user encourage software migration to exposed network end-points, but this increasing exposure provides an ever growing attack surface. Here, we discuss goals and challenges of white-box cryptography and emerging approaches in a continual attempt to stay at least one step ahead of the attackers. We list some WBC techniques, both traditional and recent, indicating how they might be incorporated into a WBC AES implementation.

Question: What is white-box cryptography?


A Survey: Smart agriculture IoT with cloud computing. IoT is a revolutionary technology that represents the future of computing and communications. Most of the people over all worlds depend on agriculture. Because of this reason smart IT technologies are needed to migrate with traditional agriculture methods. Using modern technologies can control the cost, maintenance and monitoring performance. Satellite and aerial imagery play a vital role in modern agriculture. Precision agriculture sensor monitoring network is used greatly to measure agri-related information like temperature, humidity, soil PH, soil nutrition levels, water level etc. so, with IoT farmers can remotely monitor their crop and equipment by phones and computers. In this paper, we surveyed some typical applications of Agriculture IoT Sensor Monitoring Network technologies using Cloud computing as the backbone. This survey is used to understand the different technologies and to build sustainable smart agriculture. Simple IoT agriculture model is addressed with a wireless network.

Question: What is the difference between IoT and cloud computing?


Deep Learning for Event-Driven Stock Prediction. Neural Tensor Network for Learning Event Embeddings Event Representation E = (O1, P, O2, T), where P is the action, O1 is the actor, O2 is the object and T is the timestamp (T is mainly used for aligning stock data with news data). For example, the event "Sep 3, 2013 Microsoft agrees to buy Nokia's mobile phone business for $7.2 billion." is modeled as: (Actor = Microsoft, Action = buy, Object = Nokia's mobile phone business, Time = Sep 3, 2013) Event Embedding

Question: What is the event embedding?


Vision based distance measurement system using single laser pointer design for underwater vehicle. As part of a continuous research and development of underwater robotics technology at ITB, a visionbased distance measurement system for an Unmanned Underwater vehicle (UUV) has been designed. The proposed system can be used to predict horizontal distance between underwater vehicle and wall in front of vehicle. At the same time, it can be used to predict vertical distance between vehicle and the surface below it as well. A camera and a single laser pointer are used to obtain data needed by our algorithm. The vision-based navigation consists of two main processes which are the detection of a laser spot using image processing and the calculation of the distance based on laser spot position on the image.

Question: How to measure distance between underwater vehicle and wall in front of it?


Survey on mining subjective data on the web. In the past years we have witnessed Sentiment Analysis and Opinion Mining becoming increasingly popular topics in Information Retrieval and Web data analysis. With the rapid growth of the user-generated content represented in blogs, wikis and Web forums, such an analysis became a useful tool for mining the Web, since it allowed us to capture sentiments and opinions at a large scale. Opinion retrieval has established itself as an important part of search engines. Ratings, opinion trends and representative opinions enrich the search experience of users when combined with traditional document retrieval, by revealing more insights about a subject. Opinion aggregation over product reviews can be very useful for product marketing and positioning, exposing the customers' attitude towards a product and its features along different dimensions, such as time, geographical location, and experience. Tracking how opinions or discussions evolve over time can help us identify interesting trends and patterns and better understand the ways that information is propagated in the Internet. In this study, we review the development of Sentiment Analysis and Opinion Mining during the last years, and also discuss the evolution of a relatively new research direction, namely, Contradiction Analysis. We give an overview of the proposed methods and recent advances in these areas, and we try to layout the future research directions in the field.

Question: What is the future of opinion mining?


A Computational Model of Graded Cueing: Robots Encouraging Behavior Change. Our work is motivated by the evidence that children with ASD are often behind in their development of imitative behavior, and that practicing through repeated interactions with a therapist can improve imitation abilities. Our model approximates those effects with a socially assistive robot in order to use technology to broaden access to ASD therapy. Our model of graded cueing informs how specific of feedback each participant needs based on their performance in previous rounds of imitation. What is Graded Cueing? Using Probabilistic Models to Make Up for Limited Data

Question: What is graded cueing?


Field and Torque Calculation and Transient Analysis in Variable Reluctance Machines. The variable reluctance machine (VRM), also known as the switched reluctance machine, is a class of electrical machines that exhibits many interesting characteristics. However, the satisfactory analytical formulation of its working equations (torque and voltage equations) in a saturated regime is not yet completely available for covering some of its operational aspects, such as the analysis of transient state. This paper provides such equations for the general case in which a VRM operates with a pronounced level of magnetic saturation. These equations together with help of lookup tables allow online access of the instant torque on the shaft as well as the flux linkage of a phase, since the computation times are reduced to a few microseconds, whereas in a numerical approach such as the finite-element method, would take a few minutes of CPU time, which is totally inappropriate for such investigations.

Question: What is the difference between a variable reluctance machine and a switched reluctance machine?


Systematic Risk in Supply Chain Networks. I production output is generally correlated with the state of the economy. Nonetheless, during times of economic downturn, some industries take the biggest hit, whereas at times of economic boom they reap most benefits. To provide insight into this phenomenon, we map supply networks of industries and firms and investigate how the supply network structure mediates the effect of economy on industry or firm sales. Previous research has shown that retail sales are correlated with the state of the economy. Since retailers source their products from other industries, the sales of their suppliers can also be correlated with the state of the economy. This correlation represents the source of systematic risk for an industry that propagates through a supply chain network. Specifically, we identify the following mechanisms that can affect the correlation between sales and the state of the economy in a supply chain network: propagation of systematic risk into production decisions, aggregation of orders from multiple customers in a supply chain network, and aggregation of orders over time. We find that the first effect does not amplify the correlation; however, the latter two intensify correlation and result in the amplification of correlation upstream in supply networks. We demonstrate three managerial implications of this phenomenon: implications for the cost of capital, for the risk-adjusted valuation of supply chain improvement projects, and for supplier selection and risk. Data, as supplemental material, are available at http://dx.doi.org/10.1287/mnsc.2015.2187.

Question: What is the correlation between the state of the economy and the sales of an industry?


Compact-Size Low-Profile Wideband Circularly Polarized Omnidirectional Patch Antenna With Reconfigurable Polarizations. A compact-size low-profile wideband circularly polarized (CP) omnidirectional antenna with reconfigurable polarizations is presented in this communication. This design is based on a low-profile omnidirectional CP antenna which consists of a vertically polarized microstrip patch antenna working in TM01/TM02 modes and sequentially bended slots etched on the ground plane for radiating horizontally polarized electric field. The combined radiation from both the microstrip patch and the slots leads to a CP omnidirectional radiation pattern. The polarization reconfigurability is realized by introducing PIN diodes on the slots. By electronically controlling the states of the PIN diodes, the effective orientation of the slots on ground plane can be changed dynamically and the polarization of antenna can be altered between left-hand circular polarization (LHCP) and right-hand circular polarization (RHCP). The proposed antenna exhibits a wide-operational bandwidth of 19.8% (2.09-2.55 GHz) with both axial ratio below 3 dB and return loss above 10 dB when radiates either LHCP or RHCP waves. Experimental results show good agreement with the simulation results. The present design has a compact size, a thickness of only 0.024λ and exhibits stable CP omnidirectional conical-beam radiation patterns within the entire operating frequency band with good circular polarization.

Question: What is the size of the antenna?


Ontologies for Cultural Heritage. In the cultural heritage domain information systems are increasingly deployed, digital representations of physical objects are produced in immense numbers and there is a strong political pressure on memory institutions to make their holdings accessible to the public in digital form. The sector splits into a set of disciplines with highly specialized fields. Due to the resulting diversity, one can hardly speak about a "domain" in the sense of "domain ontologies" [33]. On the other side, study and research of the past is highly interdisciplinary. Characteristically, archaeology employs a series of "auxiliary" disciplines, such as archaeometry, archaeomedicine, archaeobotany, archaeometallurgy, archaeoastronomy, etc., but also historical sources and social theories. Interoperability between various highly specialized systems, integrated information access and information integration increasingly becomes a demand to support research, professional heritage administration, preservation, public curiosity and education. Therefore the sector is characterized by a complex schema integration problem of associating complementary information from various dedicated systems, which can be efficiently addressed by formal ontologies [14,32,33]. There is a proliferation of specialized terminology, but terminology is less used as a means of agreement between experts than as an intellectual tool for hypothesis building based on discriminating phenomena. Automated classification is a long established discipline of archaeology, but few terminological systems are widely accepted. The sector is, however, more focused on establishing knowledge about facts and context in the past than about classes of things and the laws of their behavior. Respectively, the concatenation of related facts by co-reference [56] to particulars, such as things, people, places, periods is a major open issue. Knowledge Organisation Systems (KOS, [62]) describing people and places ar

Question: What is the difference between ontologies and terminologies?


Adaptive web search based on user profile constructed without any effort from users. Web search engines help users find useful information on the World Wide Web (WWW). However, when the same query is submitted by different users, typical search engines return the same result regardless of who submitted the query. Generally, each user has different information needs for his/her query. Therefore, the search result should be adapted to users with different information needs. In this paper, we first propose several approaches to adapting search results according to each user's need for relevant information without any user effort, and then verify the effectiveness of our proposed approaches. Experimental results show that search systems that adapt to each user's preferences can be achieved by constructing user profiles based on modified collaborative filtering with detailed analysis of user's browsing history in one day.

Question: What is the difference between a search engine and a web search engine?


An application of analytic hierarchy process ( AHP ) to investment portfolio selection in the banking sector of the Nigerian capital market. The importance of investment to the individual, a nation and the world economy cannot be over emphasized. Investment involves the sacrifice of immediate consumption to achieve greater consumption in the future. The Nigerian banking sector has made tremendous success in the recent past. All the banks that approached the capital market through public offers and right issues to raise their capital base recorded huge success. Investors in bank stocks have enjoyed high returns on investment, despite the slow growth in the nation's economy. However, the recent financial crisis that started in America, which has caused economy meltdown in many nations of the world and sudden fall in share prices, has brought about a higher risk than envisaged on investors, particularly those investing in bank stocks. This study underlines the importance of different criteria, factors and alternatives that are essential to successful investment decisions by applying the Analytic Hierarchy Process (AHP) in the selection of investment in bank stocks in the circumstances of financial crisis. The study provides recommendation on strategic investment decision options.

Question: What is the analytic hierarchy process?


Locational marginal pricing basics for restructured wholesale power markets. Although Locational Marginal Pricing (LMP) plays an important role in many restructured wholesale power markets, the detailed derivation of LMPs as actually used in industry practice is not readily available. This lack of transparency greatly hinders the efforts of researchers to evaluate the performance of these markets. In this paper, different AC and DC optimal power flow (OPF) models are presented to help understand the derivation of LMPs. As a byproduct of this analysis, the paper provides a rigorous explanation of the basic LMP and LMP-decomposition formulas (neglecting real power losses) presented without derivation in the business practice manuals of the U.S. Midwest Independent System Operator (MISO).

Question: What is the difference between AC and DC optimal power flow?


Context-Aware Time Series Anomaly Detection for Complex Systems. Systems with several components interacting to accomplish challenging tasks are ubiquitous; examples include large server clusters providing "cloud computing", manufacturing plants, automobiles, etc. Our relentless efforts to improve the capabilities of these systems inevitably increase their complexity as we add more components or introduce more dependencies between existing ones. To tackle this surge in distributed system complexity, system operators collect continuous monitoring data from various sources including hardware and software-based sensors. A large amount of this data is either in the form of time-series or contained in logs, e.g., operators' activity, system event, and error logs, etc. In this paper, we propose a framework for mining system operational intelligence from massive amount of monitoring data that combines the time series data with information extracted from text-based logs. Our work is aimed at systems where logs capture the context of a system's operations and the time-series data record the state of different components. This category includes a wide variety of systems including IT systems (compute clouds, web services' infrastructure, enterprise computing infrastructure, etc.) and complex physical systems such as manufacturing plants. We instantiate our framework for Hadoop. Our preliminary results using both real and synthetic datasets show that the proposed context-aware approach is more effective for detecting anomalies compared to a time series only approach.

Question: What is the context of a system?


Link prediction in bipartite graphs using internal links and weighted projection. Many real-world complex networks, like client-product or file-provider relations, have a bipartite nature and evolve during time. Predicting links that will appear in them is one of the main approach to understand their dynamics. Only few works address the bipartite case, though, despite its high practical interest and the specific challenges it raises. We define in this paper the notion of internal links in bipartite graphs and propose a link prediction method based on them. We describe the method and experimentally compare it to a basic collaborative filtering approach. We present results obtained for two typical practical cases. We reach the conclusion that our method performs very well, and that internal links play an important role in bipartite graphs and their dynamics.

Question: What is the difference between internal links and external links?


Automated Driving in Uncertain Environments: Planning With Interaction and Uncertain Maneuver Prediction. Automated driving requires decision making in dynamic and uncertain environments. The uncertainty from the prediction originates from the noisy sensor data and from the fact that the intention of human drivers cannot be directly measured. This problem is formulated as a partially observable Markov decision process (POMDP) with the intended route of the other vehicles as hidden variables. The solution of the POMDP is a policy determining the optimal acceleration of the ego vehicle along a preplanned path. Therefore, the policy is optimized for the most likely future scenarios resulting from an interactive, probabilistic motion model for the other vehicles. Considering possible future measurements of the surrounding cars allows the autonomous car to incorporate the estimated change in future prediction accuracy in the optimal policy. A compact representation results in a low-dimensional state-space. Thus, the problem can be solved online for varying road layouts and number of vehicles. This is done with a point-based solver in an anytime fashion on a continuous state-space. Our evaluation is threefold: At first, the convergence of the algorithm is evaluated and it is shown how the convergence can be improved with an additional search heuristic. Second, we show various planning scenarios to demonstrate how the introduction of different considered uncertainties results in more conservative planning. At the end, we show online simulations for the crossing of complex (unsignalized) intersections. We can demonstrate that our approach performs nearly as good as with full prior information about the intentions of the other vehicles and clearly outperforms reactive approaches.

Question: How to solve a partially observable Markov decision process?


Which NoSQL Database? A Performance Overview. NoSQL data stores are widely used to store and retrieve possibly large amounts of data, typically in a key-value format. There are many NoSQL types with different performances, and thus it is important to compare them in terms of performance and verify how the performance is related to the database type. In this paper, we evaluate five most popular NoSQL databases: Cassandra, HBase, MongoDB, OrientDB and Redis. We compare those databases in terms of query performance, based on reads and updates, taking into consideration the typical workloads, as represented by the Yahoo! Cloud Serving Benchmark. This comparison allows users to choose the most appropriate database according to the specific mechanisms and application needs. TYPE OF PAPER AND

Question: What is the difference between a NoSQL database and a relational database?


An Associative Classification Data Mining Approach for Detecting Phishing Websites. Phishing websites are fake websites that are created by dishonest people to mimic webpages of real websites. Victims of phishing attacks may expose their financial sensitive information to the attacker whom might use this information for financial and criminal activities. Various approaches have been proposed to detect phishing websites, among which, approaches that utilize data mining techniques had shown to be more effective. The main goal of data mining is to analyze a large set of data to identify unsuspected relation and extract understandable useful patterns. Associative Classification (AC) is a promising data mining approach that integrates association rule and classification to build classification models (classifiers). This paper, proposes a new AC algorithm called Phishing Associative Classification (PAC), for detecting phishing websites. PAC employed a novel methodology in construction the classifier which results in generating moderate size classifiers. The algorithm improved the effectiveness and efficiency of a known algorithm called MCAR, by introducing a new prediction procedure and adopting a different rule pruning procedure. The conducted experiments compared PAC with 4 well-known data mining algorithms, these are: covering algorithm (Prism), decision tree (C4.5), associative Classification (CBA) and MCAR. Experiments are performed on a dataset that consists of 1010 website. Each Website is represented using 17 features categorized into 4 sets. The features are extracted from the website contents and URL. The results on each features set show that PAC is either equivalent or more effective than the compared algorithms. When all features are considered, PAC outperformed the compared algorithms and correctly identified 99.31% of the tested websites. Furthermore, PAC produced less number of rules than MCAR, and therefore, is more efficient.

Question: What is phishing?


Designing a Tag-Based Statistical Math Word Problem Solver with Reasoning and Explanation. Background Since Big Data mainly aims to explore the correlation between surface features but not their underlying causality relationship, the Big Mechanism 2 program has been proposed by DARPA to find out "why" behind the "Big Data". However, the pre-requisite for it is that the machine can read each document and learn its associated knowledge, which is the task of Machine Reading (MR). Since a domain-independent MR system is complicated and difficult to build, the math word problem (MWP) [1] is frequently chosen as the first test case to study MR (as it usually uses less complicated syntax and requires less amount of domain knowledge). According to the framework for making the decision while there are several candidates, previous MWP algebra solvers can be classified into: (1) Rule-based approaches with logic inference [2-7], which apply rules to get the answer (via identifying entities, quantities, operations, etc.) with a logic inference engine. (2) Rule-based approaches without logic inference [8-13], which apply rules to get the answer without a logic inference engine. (3) Statistics-based approaches [14, 15], which use statistical models to identify entities, quantities, operations, and get the answer. To our knowledge, all the statistics-based approaches do not adopt logic inference. The main problem of the rule-based approaches mentioned above is that the coverage rate problem is serious, as rules with wide coverage are difficult and expensive to construct. Also, since they adopt Go/No-Go approach (unlike statistical approaches which can adopt a large Top-N to have high including rates), the error accumulation problem would be severe. On the other hand, the main problem of those approaches without adopting logic inference is that they usually need to implement a new handling procedure for each new type of problems (as the general logic inference mechanism is not adopt

Question: What is the main problem of the rule-based approaches mentioned above?


Global H∞ Consensus of Multi-Agent Systems with Lipschitz Nonlinear Dynamics. Abstract: This paper addresses the global consensus problems of a class of nonlinear multi-agent systems with Lipschitz nonlinearity and directed communication graphs, by using a distributed consensus protocol based on the relative states of neighboring agents. A two-step algorithm is presented to construct a protocol, under which a Lipschitz multi-agent system without disturbances can reach global consensus for a strongly connected directed communication graph. Another algorithm is then given to design a protocol which can achieve global consensus with a guaranteed H∞ performance for a Lipschitz multiagent system subject to external disturbances. The case with a leader-follower communication graph is also discussed. Finally, the effectiveness of the theoretical results is demonstrated through a network of single-link manipulators.

Question: What is the difference between a leader-follower communication graph and a strongly connected directed communication graph?


Validation of LiDAR point clouds for classification of high-value crops using geometric-and reflectance-based extraction algorithm. This study provides an experimental analysis of high-value crop classification using geometric and reflectance-based feature extraction algorithms which can be used to validate extensive classification. The main goal of this study is to identify the class based on the 3D reconstruction of small scale LiDAR scanner and RGB images. The reference used in this study was obtained from the initially classified classes of Mapua-Phil LiDAR2 Project. In validating high-value crops, the classification results were compared to the results obtained using the reference data. The validation procedures involve comparing the locations of previously classified crops and analyzing the crop cycle in the tested fields. The proposed methodology used to identify specific class based on the geometric feature alone are found to be acceptable with an average accuracy of 92.5% while the reflectance based classification alone provides an average accuracy of 90%.

Question: What is the validation of LiDAR point clouds for classification of high-value crops using geometric-and reflectance-based extraction algorithm?


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

Question: How to classify brain cancer using Artificial Neural Network?


Impedance-based fault location in transmission networks: theory and application. A number of impedance-based fault location algorithms have been developed for estimating the distance to faults in a transmission network. Each algorithm has specific input data requirements and makes certain assumptions that may or may not hold true in a particular fault location scenario. Without a detailed understanding of the principle of each fault-locating method, choosing the most suitable fault location algorithm can be a challenging task. This paper, therefore, presents the theory of one-ended (simple reactance, Takagi, modified Takagi, Eriksson, and Novosel et al.) and two-ended (synchronized, unsynchronized, and current-only) impedance-based fault location algorithms and demonstrates their application in locating real-world faults. The theory details the formulation and input data requirement of each fault-locating algorithm and evaluates the sensitivity of each to the following error sources: 1) load; 2) remote infeed; 3) fault resistance; 4) mutual coupling; 5) inaccurate line impedances; 6) DC offset and CT saturation; 7) three-terminal lines; and 8) tapped radial lines. From the theoretical analysis and field data testing, the following criteria are recommended for choosing the most suitable fault-locating algorithm: 1) data availability and 2) fault location application scenario. Another objective of this paper is to assess what additional information can be gleaned from waveforms recorded by intelligent electronic devices (IEDs) during a fault. Actual fault event data captured in utility networks is exploited to gain valuable feedback about the transmission network upstream from the IED device, and estimate the value of fault resistance.

Question: What is the difference between a fault location algorithm and a fault detection algorithm?


Intellectual capital ROI : a causal map of human capital antecedents and consequents. This report describes the results of a ground-breaking research study that measured the antecedents and consequents of effective human capital management. The research sample consisted of 76 senior executives from 25 companies in the financial services industry. The results of the study yielded a holistic causal map that integrated constructs from the fields of intellectual capital, knowledge management, human resources, organizational behaviour, information technology and accounting. The integration of both quantitative and qualitative measures in an overall conceptual model yielded several research implications. The resulting structural equation model allows participating organizations and researchers to gauge the effectiveness of an organization's human capital capabilities. This will allow practitioners and researchers to more efficiently allocate resources with regard to human capital management. The potential outcomes of the study are limitless, since a program of consistent re-evaluation can lead to the establishment of causal relationships between human capital management and economic and business results. Introduction Today's knowledge-based world consists of universal dynamic change and massive information bombardment. By the year 2010, the codified information base of the world is expected to `̀ double every 11 hours'' (Bontis, 1999, p. 435). Information storage capacities continue to expand enormously. In 1950, IBM's Rama C tape contained 4.4 megabytes and they were able to store as many as 50 of these tapes together. At that time, 220 megabytes represented the frontiers of information storage. Many of today's standard desktop computers are being sold with 40 gigabytes of hard disk space. It is sobering to remember that full motion video in uncompressed form requires 1 gigabyte per minute and that the 83 minutes of Snow White digitized in full colour amount to 15 teraby

Question: What is the largest amount of information that can be stored on a computer?


Leadership in Complex Organizations. This paper asks how complexity theory informs the role of leadership in organizations. Complexity theory is a science of complexly interacting systems; it explores the nature of interaction and adaptation in such systems and how they influence such things as emergence, innovation, and fitness. We argue that complexity theory focuses leadership efforts on behaviors that enable organizational effectiveness, as opposed to determining or guiding effectiveness. Complexity science broadens conceptualizations of leadership from perspectives that are heavily invested in psychology and social psychology (e.g., human relations models) to include processes for managing dynamic systems and interconnectivity. We develop a definition of organizational complexity and apply it to leadership science, discuss strategies for enabling complexity and effectiveness, and delve into the relationship between complexity theory and other currently important leadership theories. The paper concludes with a discussion of possible implications for research strategies in the social

Question: What is the relationship between complexity theory and leadership?


Network navigability in the social Internet of Things. The Internet of Things is expected to be overpopulated by a very large number of objects, with intensive interactions, heterogeneous communications and millions of services. Consequently, scalability issues will arise from the search of the right object that can provide the desired service. A new paradigm known as Social Internet of Things has been introduced and proposes the integration of social networking concepts into the Internet of Things. The underneath idea is that every object can look for the desired service using its friendships, in a distributed manner. However, in the resulting network, every object will still have to manage a large number of friends, slowing down the search of the services. In this work, we intend to address this issue by analyzing possible strategies to drive the objects to select the appropriate links for the benefit of overall network navigability.

Question: What is the social Internet of Things?


ConTagNet: Exploiting User Context for Image Tag Recommendation. In recent years, deep convolutional neural networks have shown great success in single-label image classification. However, images usually have multiple labels associated with them which may correspond to different objects or actions present in the image. In addition, a user assigns tags to a photo not merely based on the visual content but also the context in which the photo has been captured. Inspired by this, we propose a deep neural network which can predict multiple tags for an image based on the content as well as the context in which the image is captured. The proposed model can be trained end-to-end and solves a multi-label classification problem. We evaluate the model on a dataset of 1,965,232 images which is drawn from the YFCC100M dataset provided by the organizers of Yahoo-Flickr Grand Challenge. We observe a significant improvement in the prediction accuracy after integrating user-context and the proposed model performs very well in the Grand Challenge.

Question: What is the yahoo-flickr grand challenge?


Low- and high-anxious hypermobile Ehlers–Danlos syndrome patients: comparison of psychosocial and health variables. Despite the frequent co-ocurrence of hypermobile Ehler–Danlos syndrome (hEDS) and pathological anxiety, little is known about the psychosocial and health implications of such comorbidity. Our aim was to explore the association between high levels of anxiety and psychosocial (catastrophizing, kinesiophobia, somatosensory amplification, social support and functioning), health (pain, fatigue, BMI, tobacco/alcohol use, depression, diagnosis delay, general health), and sociodemographic factors in people with hEDS. In this cross-sectional study, 80 hEDS patients were divided into two groups according to self-reported anxiety levels: low and high. Psychosocial, sociodemographic and health variables were compared between the groups. Forty-one participants reported a high level of anxiety (51.2%). No differences were found in the sociodemographic variables between high-anxious and low-anxious patients. The percentage of participants with severe fatigue and high depressive symptomatology was significantly higher in the high-anxious group (80.5 vs 56.4; 26.8 vs 12.8%, respectively). High-anxious hEDS patients also showed significantly higher levels of pain catastrophizing, somatosensory amplification as well as a poorer social functioning and general health. Multivariate analyses showed that somatosensory amplification, pain catastrophizing and poor social functioning are variables that increase the probability of belonging to the high-anxious group. Despite limitations, this first study comparing high-anxious versus low-anxious hEDS patients with respect to health aspects, highlight the importance of considering the psychosocial factors (many susceptible to modification), to improve the adjustment to this chronic condition and provide support to those affected through a biopsychosocial approach.

Question: What is the difference between high-anxious and low-anxious hEDS patients?


Meta-Path-Based Ranking with Pseudo Relevance Feedback on Heterogeneous Graph for Citation Recommendation. The sheer volume of scholarly publications available online significantly challenges how scholars retrieve the new information available and locate the candidate reference papers. While classical text retrieval and pseudo relevance feedback (PRF) algorithms can assist scholars in accessing needed publications, in this study, we propose an innovative publication ranking method with PRF by leveraging a number of meta-paths on the heterogeneous bibliographic graph. Different meta-paths on the graph address different ranking hypotheses, whereas the pseudo-relevant papers (from the retrieval results) are used as the seed nodes on the graph. Meanwhile, unlike prior studies, we propose "restricted meta-path" facilitated by a new context-rich heterogeneous network extracted from full-text publication content along with citation context. By using learning-to-rank, we integrate 18 different meta-path-based ranking features to derive the final ranking scores for candidate cited papers. Experimental results with ACM full-text corpus show that meta-path-based ranking with PRF on the new graph significantly (p < 0.0001) outperforms text retrieval algorithms with text-based or PageRank-based PRF.

Question: How to rank the candidate papers?


A Fast Similarity Join Algorithm Using Graphics Processing Units. A similarity join operation A BOWTIEepsiv B takes two sets of points A, B and a value epsiv isin Ropf, and outputs pairs of points p isin A,q isin B, such that the distance D(p, q) les epsiv. Similarity joins find use in a variety of fields, such as clustering, text mining, and multimedia databases. A novel similarity join algorithm called LSS is presented that executes on a graphics processing unit (GPU), exploiting its parallelism and high data throughput. As GPUs only allow simple data operations such as the sorting and searching of arrays, LSS uses these two operations to cast a similarity join operation as a GPU sort-and-search problem. It first creates, on the fly, a set of space-filling curves on one of its input datasets, using a parallel GPU sort routine. Next, LSS processes each point p of the other dataset in parallel. For each p, it searches an interval of one of the space-filling curves guaranteed to contain all the pairs in which p participates. Using extensive theoretical and experimental analysis, LSS is shown to offer a good balance between time and work efficiency. Experimental results demonstrate that LSS is suitable for similarity joins in large high-dimensional datasets, and that it performs well when compared against two existing prominent similarity join methods.

Question: What is a fast similarity join algorithm?


Information overload: why some people seem to suffer more than others. We studied information overload among senior managers in an industrial company. We used the critical incident collection technique to gather specific examples of information overload and coping strategies. We then used textual interpretation and the affinity diagram technique to interpret the interviews and to categorize our respondents, the critical incidents they described, and the coping strategies they mentioned. Our results show that the extent to which people suffer from information overload is closely related to the strategies they use to deal with it.

Question: What is the critical incident collection technique?


Adaptive duplicate detection using learnable string similarity measures. The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied on generic or manually tuned distance metrics for estimating the similarity of potential duplicates. In this paper, we present a framework for improving duplicate detection using trainable measures of textual similarity. We propose to employ learnable text distance functions for each database field, and show that such measures are capable of adapting to the specific notion of similarity that is appropriate for the field's domain. We present two learnable text similarity measures suitable for this task: an extended variant of learnable string edit distance, and a novel vector-space based measure that employs a Support Vector Machine (SVM) for training. Experimental results on a range of datasets show that our framework can improve duplicate detection accuracy over traditional techniques.

Question: What is the difference between a learnable text distance function and a learnable string edit distance function?


Challenges and Best Practices for Mobile Application Development: Review Paper. Over the last ten years or so, mobile devices technology has changed significantly, with these devices and operating systems becoming more sophisticated. These developments have led to a huge variety of mobile applications designed for mobile operating systems. These mobile applications are typically harder to design and build because of several factors such as screen size and limited processing power and so forth. Therefore, it is important to clearly identify the characteristics of mobile application development and the issues and challenges related to it, as well as, the key features that characterize a great mobile application which make them valuable and useful. This paper has reviewed existing literature of the challenge and best practices of mobile application development. This study contributes towards a great understanding of the characteristics of mobile application development process, examines real challenges faced and explores the best practices that can be effectively applied to improve the development of mobile application.

Question: What is the best practice for mobile application development?


A surgical parallel continuum manipulator with a cable-driven grasper. In this paper, we present the design, construction, and control of a six-degree-of-freedom (DOF), 12 mm diameter, parallel continuum manipulator with a 2-DOF, cable-driven grasper. This work is a proof-of-concept first step towards miniaturization of this type of manipulator design to provide increased dexterity and stability in confined-space surgical applications, particularly for endoscopic procedures. Our robotic system consists of six superelastic NiTi (Nitinol) tubes in a standard Stewart-Gough configuration and an end effector with 180 degree motion of its two jaws. Two Kevlar cables pass through the centers of the tube legs to actuate the end effector. A computationally efficient inverse kinematics model provides low-level control inputs to ten independent linear actuators, which drive the Stewart-Gough platform and end-effector actuation cables. We demonstrate the performance and feasibility of this design by conducting open-loop range-of-motion tests for our system.

Question: What is a parallel continuum manipulator?


Monocyte and macrophage plasticity in tissue repair and regeneration.. Heterogeneity and high versatility are the characteristic features of the cells of monocyte-macrophage lineage. The mononuclear phagocyte system, derived from the bone marrow progenitor cells, is primarily composed of monocytes, macrophages, and dendritic cells. In regenerative tissues, a central role of monocyte-derived macrophages and paracrine factors secreted by these cells is indisputable. Macrophages are highly plastic cells. On the basis of environmental cues and molecular mediators, these cells differentiate to proinflammatory type I macrophage (M1) or anti-inflammatory or proreparative type II macrophage (M2) phenotypes and transdifferentiate into other cell types. Given a central role in tissue repair and regeneration, the review focuses on the heterogeneity of monocytes and macrophages with current known mechanisms of differentiation and plasticity, including microenvironmental cues and molecular mediators, such as noncoding RNAs.

Question: What is the heterogeneity of monocytes and macrophages?


Introduction to Algorithms. problems To understand the class of polynomial-time solvable proble ms, we must first have a formal notion of what a "problem" is. We define anbstract problemQ to be a binary relation on a set I of probleminstancesand a setS of problemsolutions. For example, an instance for SHORTEST-PATH is a triple consi sting of a graph and two vertices. A solution is a sequence of vertices in the g raph, with perhaps the empty sequence denoting that no path exists. The problem SHORTEST-PATH itself is the relation that associates each instance of a gra ph and two vertices with a shortest path in the graph that connects the two vertices. S ince shortest paths are not necessarily unique, a given problem instance may have mo r than one solution. This formulation of an abstract problem is more general than is required for our purposes. As we saw above, the theory of NP-completeness res tricts attention to decision problems : those having a yes/no solution. In this case, we can view an abstract decision problem as a function that maps the instan ce setI to the solution set {0, 1}. For example, a decision problem related to SHORTEST-PATH i s the problem PATH that we saw earlier. If i = 〈G,u, v,k〉 is an instance of the decision problem PATH, then PATH(i ) = 1 (yes) if a shortest path fromu to v has at mostk edges, and PATH (i ) = 0 (no) otherwise. Many abstract problems are not decision problems, but rather optimization problems , in which some value must be minimized or maximized. As we saw above, however, it is usual ly a simple matter to recast an optimization problem as a decision problem that is no harder. 1See Hopcroft and Ullman [156] or Lewis and Papadimitriou [20 4] for a thorough treatment of the Turing-machine model. 34.1 Polynomial time 973

Question: What is the shortest path between two vertices in a graph?


Beyond 'Caveman Communities': Hubs and Spokes for Graph Compression and Mining. Given a real world graph, how should we lay-out its edges? How can we compress it? These questions are closely related, and the typical approach so far is to find clique-like communities, like the `cavemen graph', and compress them. We show that the block-diagonal mental image of the `cavemen graph' is the wrong paradigm, in full agreement with earlier results that real world graphs have no good cuts. Instead, we propose to envision graphs as a collection of hubs connecting spokes, with super-hubs connecting the hubs, and so on, recursively. Based on the idea, we propose the Slash Burn method (burn the hubs, and slash the remaining graph into smaller connected components). Our view point has several advantages: (a) it avoids the `no good cuts' problem, (b) it gives better compression, and (c) it leads to faster execution times for matrix-vector operations, which are the back-bone of most graph processing tools. Experimental results show that our Slash Burn method consistently outperforms other methods on all datasets, giving good compression and faster running time.

Question: How should we lay-out the edges of a graph?


Reaching out: involving Users in Innovation Tasks through Social Media. Integrating social media into the innovation process can open up the potential for organizations to utilize the collective creativity of consumers from all over the world. The research in this paper sets out to identify how social media can facilitate innovation. By taking a Design Science Research approach this research presents the Social Media Innovation Method for matching innovation tasks with social media characteristics. This supports the selection of best suitable social media and can help organizations to achieve their innovation goals. At the core of the method is the honeycomb model which describes seven social media characteristics on three dimensions: audience, content and time. The method has been evaluated by using an approach called scenario walkthrough that is applied in a real-life spatial planning project. This research concludes that there is no one-size-fits-all answer to the question how social media can be of value for the innovation process. However, organizations that want to know how it can benefit their own innovation process can use the Social Media Innovation Method presented in this research as a way to provide an answer to that question, uniquely tailored to each innovation task for which social media is to be used.

Question: How can social media be used to facilitate innovation?


Leaf segmentation in plant phenotyping: a collation study. Image-based plant phenotyping is a growing application area of computer vision in agriculture. A key task is the segmentation of all individual leaves in images. Here we focus on the most common rosette model plants, Arabidopsis and young tobacco. Although leaves do share appearance and shape characteristics, the presence of occlusions and variability in leaf shape and pose, as well as imaging conditions, render this problem challenging. The aim of this paper is to compare several leaf segmentation solutions on a unique and first-of-its-kind dataset containing images from typical phenotyping experiments. In particular, we report and discuss methods and findings of a collection of submissions for the first Leaf Segmentation Challenge of the Computer Vision Problems in Plant Phenotyping workshop in 2014. Four methods are presented: three segment leaves by processing the distance transform in an unsupervised fashion, and the other via optimal template selection and Chamfer matching. Overall, we find that although separating plant from background can be accomplished with satisfactory accuracy ( $$>$$ > 90 % Dice score), individual leaf segmentation and counting remain challenging when leaves overlap. Additionally, accuracy is lower for younger leaves. We find also that variability in datasets does affect outcomes. Our findings motivate further investigations and development of specialized algorithms for this particular application, and that challenges of this form are ideally suited for advancing the state of the art. Data are publicly available (online at http://www.plant-phenotyping.org/datasets ) to support future challenges beyond segmentation within this application domain.

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


Thalamic relays and cortical functioning.. Studies on the visual thalamic relays, the lateral geniculate nucleus and pulvinar, provide three key properties that have dramatically changed the view that the thalamus serves as a simple relay to get information from subcortical sites to cortex. First, the retinal input, although a small minority (7%) in terms of numbers of synapses onto geniculate relay cells, dominates receptive field properties of these relay cells and strongly drives them; 93% of input thus is nonretinal and modulates the relay in dynamic and important ways related to behavioral state, including attention. We call the retinal input the driver input and the nonretinal, modulator input, and their unique morphological and functional differences allow us to recognize driver and modulator input to many other thalamic relays. Second, much of the modulation is related to control of a voltage-gated, low threshold Ca(2+) conductance that determines response properties of relay cells -burst or tonic - and this, among other things, affects the salience of information relayed. Third, the lateral geniculate nucleus and pulvinar (a massive but generally mysterious and ignored thalamic relay), are examples of two different types of relay: the LGN is a first order relay, transmitting information from a subcortical driver source (retina), while the pulvinar is mostly a higher order relay, transmitting information from a driver source emanating from layer 5 of one cortical area to another area. Higher order relays seem especially important to general corticocortical communication, and this view challenges the conventional dogma that such communication is based on direct corticocortical connections. In this sense, any new information reaching a cortical area, whether from a subcortical source or another cortical area, benefits from a thalamic relay. Other examples of first and higher order relays also exist, and generally higher order relays represent the majority of t

Question: What is the difference between a first order and a higher order relay?


New Generation Sensor Web Enablement. Many sensor networks have been deployed to monitor Earth's environment, and more will follow in the future. Environmental sensors have improved continuously by becoming smaller, cheaper, and more intelligent. Due to the large number of sensor manufacturers and differing accompanying protocols, integrating diverse sensors into observation systems is not straightforward. A coherent infrastructure is needed to treat sensors in an interoperable, platform-independent and uniform way. The concept of the Sensor Web reflects such a kind of infrastructure for sharing, finding, and accessing sensors and their data across different applications. It hides the heterogeneous sensor hardware and communication protocols from the applications built on top of it. The Sensor Web Enablement initiative of the Open Geospatial Consortium standardizes web service interfaces and data encodings which can be used as building blocks for a Sensor Web. This article illustrates and analyzes the recent developments of the new generation of the Sensor Web Enablement specification framework. Further, we relate the Sensor Web to other emerging concepts such as the Web of Things and point out challenges and resulting future work topics for research on Sensor Web Enablement.

Question: What is the new generation of the Sensor Web Enablement specification framework?


DDD: A New Ensemble Approach for Dealing with Concept Drift. Online learning algorithms often have to operate in the presence of concept drifts. A recent study revealed that different diversity levels in an ensemble of learning machines are required in order to maintain high generalization on both old and new concepts. Inspired by this study and based on a further study of diversity with different strategies to deal with drifts, we propose a new online ensemble learning approach called Diversity for Dealing with Drifts (DDD). DDD maintains ensembles with different diversity levels and is able to attain better accuracy than other approaches. Furthermore, it is very robust, outperforming other drift handling approaches in terms of accuracy when there are false positive drift detections. In all the experimental comparisons we have carried out, DDD always performed at least as well as other drift handling approaches under various conditions, with very few exceptions.

Question: What is the difference between the different diversity levels in an ensemble of learning machines?


Evaluation of Three Methods for MRI Brain Tumor Segmentation. Imaging plays a central role in the diagnosis and treatment planning of brain tumor. An accurate segmentation is critical, especially when the tumor morphological changes remain subtle, irregular and difficult to assess by clinical examination. Traditionally, segmentation is performed manually in clinical environment that is operator dependent and very tedious and time consuming labor intensive work. However, automated tumor segmentation in MRI brain tumor poses many challenges with regard to characteristics of an image. A comparison of three different semi-automated methods, viz., modified gradient magnitude region growing technique (MGRRGT), level set and a marker controlled watershed method is undertaken here for evaluating their relative performance in the segmentation of tumor. A study on 9 samples using MGRRGT reveals that all the errors are within 6 to 23% in comparison to other two methods.

Question: What is the difference between the three methods?


Traffic prediction in a bike-sharing system. Bike-sharing systems are widely deployed in many major cities, providing a convenient transportation mode for citizens' commutes. As the rents/returns of bikes at different stations in different periods are unbalanced, the bikes in a system need to be rebalanced frequently. Real-time monitoring cannot tackle this problem well as it takes too much time to reallocate the bikes after an imbalance has occurred. In this paper, we propose a hierarchical prediction model to predict the number of bikes that will be rent from/returned to each station cluster in a future period so that reallocation can be executed in advance. We first propose a bipartite clustering algorithm to cluster bike stations into groups, formulating a two-level hierarchy of stations. The total number of bikes that will be rent in a city is predicted by a Gradient Boosting Regression Tree (GBRT). Then a multi-similarity-based inference model is proposed to predict the rent proportion across clusters and the inter-cluster transition, based on which the number of bikes rent from/ returned to each cluster can be easily inferred. We evaluate our model on two bike-sharing systems in New York City (NYC) and Washington D.C. (D.C.) respectively, confirming our model's advantage beyond baseline approaches (0.03 reduction of error rate), especially for anomalous periods (0.18/0.23 reduction of error rate).

Question: How to predict the number of bikes that will be rent in a future period?


CIS-UltraCal: An open-source ultrasound calibration toolkit. We present an open-source MATLAB toolkit for ultrasound calibration. It has a convenient graphical user interface which sits on top of an extensive API. Calibration using three different phantoms is explicitly supported: the cross-wire phantom, the single-wall phantom, and the Hopkins phantom. Image processing of the Hopkins phantom is automated by making use of techniques from binary morphology, radon transform and RANSAC. Numerous calibration and termination parameters are exposed. It is also modular, allowing one to apply the system to original phantoms by writing a minimum of new code.

Question: What is an ultrasound calibration toolkit?


Computationally Efficient Bayesian Learning of Gaussian Process State Space Models. Gaussian processes allow for flexible specification of prior assumptions of unknown dynamics in state space models. We present a procedure for efficient Bayesian learning in Gaussian process state space models, where the representation is formed by projecting the problem onto a set of approximate eigenfunctions derived from the prior covariance structure. Learning under this family of models can be conducted using a carefully crafted particle MCMC algorithm. This scheme is computationally efficient and yet allows for a fully Bayesian treatment of the problem. Compared to conventional system identification tools or existing learning methods, we show competitive performance and reliable quantification of uncertainties in the model.

Question: How to learn a gaussian process model?


Discovering Diverse and Salient Threads in Document Collections. We propose a novel probabilistic technique for modeling and extracting salient structure from large document collections. As in clustering and topic modeling, our goal is to provide an organizing perspective into otherwise overwhelming amounts of information. We are particularly interested in revealing and exploiting relationships between documents. To this end, we focus on extracting diverse sets of threads—singlylinked, coherent chains of important documents. To illustrate, we extract research threads from citation graphs and construct timelines from news articles. Our method is highly scalable, running on a corpus of over 30 million words in about four minutes, more than 75 times faster than a dynamic topic model. Finally, the results from our model more closely resemble human news summaries according to several metrics and are also preferred by human judges.

Question: How to extract diverse and salient threads from document collections?


AN INTEGRATIVE MODEL OF ORGANIZATIONAL. Scholars in various disciplines have considered the causes, nature, and effects of trust. Prior approaches to studying trust are considered, Including characteristics of the tnistor, the trustee, and the role of risk. A definition of trust and a model of its antecedents and outcomes are presented, which integrate research from multiple disciplines and differentiate trust from similar constructs. Several research propositions based on the model are presented.

Question: What is a model of organizational trust?


Rethinking Centrality: The Role of Dynamical Processes in Social Network Analysis. Many popular measures used in social network analysis, including centrality, are based on the random walk. The random walk is a model of a stochastic process where a node interacts with one other node at a time. However, the random walk may not be appropriate for modeling social phenomena, including epidemics and information diffusion, in which one node may interact with many others at the same time, for example, by broadcasting the virus or information to its neighbors. To produce meaningful results, social network analysis algorithms have to take into account the nature of interactions between the nodes. In this paper we classify dynamical processes as conservative and non-conservative and relate them to well-known measures of centrality used in network analysis: PageRank and Alpha-Centrality. We demonstrate, by ranking users in online social networks used for broadcasting information, that non-conservative Alpha-Centrality generally leads to a better agreement with an empirical ranking scheme than the conservative PageRank.

Question: What is the difference between conservative and non-conservative centrality?


De-Conflated Semantic Representations. One major deficiency of most semantic representation techniques is that they usually model a word type as a single point in the semantic space, hence conflating all the meanings that the word can have. Addressing this issue by learning distinct representations for individual meanings of words has been the subject of several research studies in the past few years. However, the generated sense representations are either not linked to any sense inventory or are unreliable for infrequent word senses. We propose a technique that tackles these problems by de-conflating the representations of words based on the deep knowledge that can be derived from a semantic network. Our approach provides multiple advantages in comparison to the previous approaches, including its high coverage and the ability to generate accurate representations even for infrequent word senses. We carry out evaluations on six datasets across two semantic similarity tasks and report state-of-the-art results on most of them.

Question: What is the difference between de-conflated semantic representations and sense representations?


World of Warcraft and the impact of game culture and play in an undergraduate game design course. During the past two decades, digital games have become an increasingly popular source of study for academics, educational researchers and instructional designers. Much has been written about the potential of games for teaching and learning, both in the design of educational/serious games and the implementation of off-the-shelf games for learning. Yet relatively little research has been conducted about how game culture and the enmeshed practice of play may impact classroom dynamics. The purpose of this study is to present a case study about how the use of World of Warcraft (WoW) as a teaching tool and medium of play impacted class dynamics in an undergraduate university-level course for game design. Specifically, this study will address how WoW's game culture and the practice of play impacted (a) student-to-student dynamics and (b) class dynamics. The goal of this study is to explore some of the dynamics of play as a component of learning. 2010 Elsevier Ltd. All rights reserved.

Question: How does the game culture of WoW impact class dynamics?


On Analyzing User Topic-Specific Platform Preferences Across Multiple Social Media Sites. Topic modeling has traditionally been studied for single text collections and applied to social media data represented in the form of text documents. With the emergence of many social media platforms, users find themselves using different social media for posting content and for social interaction. While many topics may be shared across social media platforms, users typically show preferences of certain social media platform(s) over others for certain topics. Such platform preferences may even be found at the individual level. To model social media topics as well as platform preferences of users, we propose a new topic model known as MultiPlatform-LDA (MultiLDA). Instead of just merging all posts from different social media platforms into a single text collection, MultiLDA keeps one text collection for each social media platform but allowing these platforms to share a common set of topics. MultiLDA further learns the user-specific platform preferences for each topic. We evaluate MultiLDA against TwitterLDA, the state-of-the-art method for social media content modeling, on two aspects: (i) the effectiveness in modeling topics across social media platforms, and (ii) the ability to predict platform choices for each post. We conduct experiments on three real-world datasets from Twitter, Instagram and Tumblr sharing a set of common users. Our experiments results show that the MultiLDA outperforms in both topic modeling and platform choice prediction tasks. We also show empirically that among the three social media platforms, "Daily matters" and "Relationship matters" are dominant topics in Twitter, "Social gathering", "Outing" and "Fashion" are dominant topics in Instagram, and "Music", "Entertainment" and "Fashion" are dominant topics in Tumblr.

Question: How to model user topic-specific platform preferences across multiple social media sites?


A NoSQL Data Model for Scalable Big Data Workflow Execution. While big data workflows haven been proposed recently as the next-generation data-centric workflow paradigm to process and analyze data of ever increasing in scale, complexity, and rate of acquisition, a scalable distributed data model is still missing that abstracts and automates data distribution, parallelism, and scalable processing. In the meanwhile, although NoSQL has emerged as a new category of data models, they are optimized for storing and querying of large datasets, not for ad-hoc data analysis where data placement and data movement are necessary for optimized workflow execution. In this paper, we propose a NoSQL data model that: 1) supports high-performance MapReduce-style workflows that automate data partitioning and data-parallelism execution. In contrast to the traditional MapReduce framework, our MapReduce-style workflows are fully composable with other workflows enabling dataflow applications with a richer structure, 2) automates virtual machine provisioning and deprovisioning on demand according to the sizes of input datasets, 3) enables a flexible framework for workflow executors that take advantage of the proposed NoSQL data model to improve the performance of workflow execution. Our case studies and experiments show the competitive advantages of our proposed data model. The proposed NoSQL data model is implemented in a new release of DATAVIEW, one of the most usable big data workflow systems in the community.

Question: What is the difference between a NoSQL data model and a traditional MapReduce data model?


News via Voldemort: Parody accounts in topical discussions on Twitter. Parody accounts are prevalent on Twitter, offering irreverent interpretations of public figures, fictional characters, and more. These accounts post comments framed within the context of their fictional universes or stereotypes of their subjects, responding in-character to topical events. This article positions parody accounts as a ritualised social media practice, an extension of fan practices and irreverent internet culture. By providing a typology of parody accounts and analysing the topicality of selected parody accounts' tweets, the research examines how these accounts contribute to topical discussions. In-character framing of topical comments allows parody accounts to offer original interpretations of breaking news

Question: What is a parody account?


Hand Gesture Recognition using Computer Vision. The use of the gesture system in our daily life as a natural human-human interaction has inspired the researchers to simulate and utilize this gift in human-machine interaction which is appealing and can take place the bore interaction ones that existed such as television, radio, and various home appliances as well as virtual reality will worth and deserve its name. This kind of interaction ensures promising and satisfying outcomes if applied in systematic approach, and supports unadorned human hand when transferring the message to these devices which is easiest, comfort and desired rather than the communication that requires frills to deliver the message to such devices. With the rapid emergence of 3d applications and virtual environments in computer system the need for a new type of interaction device arises. This is because the traditional devices such as mouse, keyboard and joystick become inefficient and cumbersome within this virtual environments.in other words evolution of user interfaces shapes the change in the HumanComputer Interaction (HCI).Intuitive and naturalness characteristics of "Hand Gestures" in the HCI have been the driving force and motivation to develop an interaction device which can replace current unwieldy tools. A survey on the methods of analysing, modelling and recognizing hand gestures in the context of the HCI is provided in this paper.

Question: What is the difference between a mouse and a keyboard?