Query: Jack the Reader - A Machine Reading Framework

Relevant passages:
Complex Embeddings for Simple Link Prediction <=SEP=> In statistical relational learning, the link prediction problem is key to automatically understand the structure of large knowledge bases. As in previous studies, we propose to solve this problem through latent factorization. However, here we make use of complex valued embeddings. The composition of complex embeddings can handle a large variety of binary relations, among them symmetric and antisymmetric relations. Compared to state-of-the-art models such as Neural Tensor Network and Holographic Embeddings, our approach based on complex embeddings is arguably simpler, as it only uses the Hermitian dot product, the complex counterpart of the standard dot product between real vectors. Our approach is scalable to large datasets as it remains linear in both space and time, while consistently outperforming alternative approaches on standard link prediction benchmarks.1

SQuAD: 100, 000+ Questions for Machine Comprehension of Text <=SEP=> We present the Stanford Question Answering Dataset (SQuAD), a new reading comprehension dataset consisting of 100,000+ questions posed by crowdworkers on a set of Wikipedia articles, where the answer to each question is a segment of text from the corresponding reading passage. We analyze the dataset to understand the types of reasoning required to answer the questions, leaning heavily on dependency and constituency trees. We build a strong logistic regression model, which achieves an F1 score of 51.0%, a significant improvement over a simple baseline (20%). However, human performance (86.8%) is much higher, indicating that the dataset presents a good challenge problem for future research. The dataset is freely available at https://stanford-qa.com.

UIMA: an architectural approach to unstructured information processing in the corporate research environment <=SEP=> IBM Research has over 200 people working on Unstructured Information Management (UIM) technologies with a strong focus on Natural Language Processing (NLP). These researchers are engaged in activities ranging from natural language dialog, information retrieval, topic-tracking, named-entity detection, document classification and machine translation to bioinformatics and open-domain question answering. An analysis of these activities strongly suggested that improving the organization’s ability to quickly discover each other's results and rapidly combine different technologies and approaches would accelerate scientific advance. Furthermore, the ability to reuse and combine results through a common architecture and a robust software framework would accelerate the transfer of research results in NLP into IBM’s product platforms. Market analyses indicating a growing need to process unstructured information, specifically multilingual, natural language text, coupled with IBM Research’s investment in NLP, led to the development of middleware architecture for processing unstructured information dubbed UIMA. At the heart of UIMA are powerful search capabilities and a data-driven framework for the development, composition and distributed deployment of analysis engines. In this paper we give a general introduction to UIMA focusing on the design points of its analysis engine architecture and we discuss how UIMA is helping to accelerate research and technology transfer. 1 Motivation and Objectives We characterize a UIM application as a software system that analyzes large volumes of unstructured information while consulting structured information sources to discover, organize and present knowledge relevant to the application’s end-user. We define structured information as information whose intended meaning is unambiguous and explicitly represented in the structure or format of the data. The canonical example of structured information is a relational database table. We define unstructured information as information whose intended meaning is only loosely implied by its form. The canonical example is a natural language document; other examples include voice, audio, image and video. To appear in a special issue of the Journal of Natural Language Engineering 2004 2 Ferrucci and Lally Do Not Distirubte without written permission from authors Market indicators suggest a rapid increase in the use of text and voice analytics to a growing class of commercially viable applications (Roush 2003). National security interests are driving applications to involve an even broader set of UIM technologies including image and video analytics. Emerging and commercially important UIM application areas include life sciences, e-commerce, technical support, advanced search, and national and business intelligence. In six major labs spread out over the globe, IBM Research has over 200 people working on Unstructured Information Management (UIM) technologies with a primary focus on Natural Language Processing (NLP). These researchers are engaged in activities ranging from natural language dialog, information retrieval, topic-tracking, named-entity detection, document classification and machine translation to bioinformatics and open-domain question answering. Each group is developing different technical and engineering approaches to process unstructured information in pursuit of their specific research agenda in the UIM space. While IBM Research’s independent UIM technologies fare well in scientific venues, accelerated development of integrated, robust applications is becoming increasingly important to IBM’s commercial interests. Furthermore the rapid integration of different alogorthims and techniques is also a means to advance scientific results. For example, experiments in statistical name-entity detection or machine translation may benefit from using a deep parser as a feature generator. Facilitating the rapid integration of an independently produced deep parser with statistical algorithm implementations can accelerate the research cycle time as well as the time to product. Some of the challenges that face a large research organization in efficiently leveraging and integrating its (and third-party) UIM assets include: • Organizational Structure. IBM Research is largely organized in three to five person teams geographically dispersed among different labs throughout world. This structure makes it more difficult to jointly develop and reuse technologies. • Skills Alignment. There are inefficiencies in having PhDs trained and specialized in, for example, computational linguistics or statistical machine learning, develop and apply the requisite systems expertise to deliver their work into product architectures and/or make it easily usable by other researchers. To appear in a special issue of the Journal of Natural Language Engineering 2004 3 Ferrucci and Lally Do Not Distirubte without written permission from authors • Development Inefficiencies. Research results are delivered in a myriad of interfaces and technologies. Reuse and integration often requires too much effort dedicated to technical adaptation. Too often work is replicated. • Speed to product. Software Products introduce their own architectures, interfaces and implementation technologies. Technology transfer from the lab to the products often becomes a significant engineering or rewrite effort for researchers. A common framework and engineering discipline could help address the challenges listed above. The Unstructured Information Management Architecture (UIMA) project was initiated within IBM Research based on the premise that a common software architecture for developing, composing and delivering UIM technologies, if adopted by the organization, would facilitate technology reuse and integration, enable quicker scientific experimentation and speed the path to product. IBM’s Unstructured Information Management Architecture (UIMA) high-level objectives are two fold: 1) Accelerate scientific advances by enabling the rapid combination of UIM technologies (e.g., natural language processing, audio and video analysis, information retrieval, etc.). 2) Accelerate transfer of UIM technologies to product by providing an architecture and associated framework implementations that promote reuse and support flexible deployment options. 2 The Unstructured Information Management Architecture (UIMA) UIMA is a software architecture for developing UIM applications. The UIMA high-level architecture, illustrated in Figure 1, defines the roles, interfaces and communications of large-grained components essential for UIM applications. These include components capable of analyzing unstructured artifacts, integrating and accessing structured sources and storing, indexing and searching for artifacts based on discovered semantic content resulting from analyses. A primary design point for UIMA is that it should admit the implementation of middleware frameworks that provide a component-based infrastructure for developing UIM applications suitable for vastly different deployment environments. These should range from lightweight and embeddable implementations to highly scalable implementations that are meant to exploit clusters of machines and provide high throughput, high availability serviced-based offerings. While the primary focus of current UIMA framework implementations is squarely on natural language To appear in a special issue of the Journal of Natural Language Engineering 2004 4 Ferrucci and Lally Do Not Distirubte without written permission from authors UIM Application Analysis Collection Level Analysis Document, Collection & Metadata Store Knowledge Source Access Collection Processing Manager (CPM) Knowledge & Data Bases Unstructured Information (Text) Analysis Engines Crawlers Analysis Engine Directory Acquisition Unstructured Information Analysis Structured Information Access Semantic Search Engine Indices Indices Documents Collections Metadata Knowledge Source Adapter Directory Access

Freebase: A Shared Database of Structured General Human Knowledge <=SEP=> Freebase is a practical, scalable, graph-shaped database of structured general human knowledge, inspired by Semantic Web research and collaborative data communities such as the Wikipedia. Freebase allows public read and write access through an HTTP-based graph-query API for research, the creation and maintenance of structured data, and application building. Access is free and all data in Freebase has a very open (e.g. Creative Commons, GFDL) license.

TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehension <=SEP=> We present TriviaQA, a challenging reading comprehension dataset containing over 650K question-answer-evidence triples. TriviaQA includes 95K questionanswer pairs authored by trivia enthusiasts and independently gathered evidence documents, six per question on average, that provide high quality distant supervision for answering the questions. We show that, in comparison to other recently introduced large-scale datasets, TriviaQA (1) has relatively complex, compositional questions, (2) has considerable syntactic and lexical variability between questions and corresponding answer-evidence sentences, and (3) requires more cross sentence reasoning to find answers. We also present two baseline algorithms: a featurebased classifier and a state-of-the-art neural network, that performs well on SQuAD reading comprehension. Neither approach comes close to human performance (23% and 40% vs. 80%), suggesting that TriviaQA is a challenging testbed that is worth significant future study.1

Emotion recognition with multimodal features and temporal models <=SEP=> This paper presents our methods to the Audio-Video Based Emotion Recognition subtask in the 2017 Emotion Recognition in the Wild (EmotiW) Challenge. The task aims to predict one of the seven basic emotions for short video segments. We extract different features from audio and facial expression modalities. We also explore the temporal LSTM model with the input of frame facial features, which improves the performance of the non-temporal model. The fusion of different modality features and the temporal model lead us to achieve a 58.5% accuracy on the testing set, which shows the effectiveness of our methods.

Recommendation to Groups <=SEP=> Recommender systems have traditionally recommended items to individual users, but there has recently been a proliferation of recommenders that address their recommendations to groups of users. The shift of focus from an individual to a group makes more of a difference than one might at first expect. This chapter discusses the most important new issues that arise, organizing them in terms of four subtasks that can or must be dealt with by a group recommender: 1. acquiring information about the user’s preferences; 2. generating recommendations; 3. explaining recommendations; and 4. helping users to settle on a final decision. For each issue, we discuss how it has been dealt with in existing group recommender systems and what open questions call for further research.

The cyber threat landscape: Challenges and future research directions <=SEP=> Cyber threats are becoming more sophisticated with the blending of once distinct types of attack into more damaging forms. Increased variety and volume of attacks is inevitable given the desire of financially and criminally-motivated actors to obtain personal and confidential information, as highlighted in this paper. We describe how the Routine Activity Theory can be applied to mitigate these risks by reducing the opportunities for cyber crime to occur, making cyber crime more difficult to commit and by increasing the risks of detection and punishment associated with committing cyber crime. Potential research questions are also identified. a 2011 Elsevier Ltd. All rights reserved.

Genetics-Based Machine Learning for Rule Induction: State of the Art, Taxonomy, and Comparative Study <=SEP=> The classification problem can be addressed by numerous techniques and algorithms which belong to different paradigms of machine learning. In this paper, we are interested in evolutionary algorithms, the so-called genetics-based machine learning algorithms. In particular, we will focus on evolutionary approaches that evolve a set of rules, i.e., evolutionary rule-based systems, applied to classification tasks, in order to provide a state of the art in this field. This paper has a double aim: to present a taxonomy of the genetics-based machine learning approaches for rule induction, and to develop an empirical analysis both for standard classification and for classification with imbalanced data sets. We also include a comparative study of the genetics-based machine learning (GBML) methods with some classical non-evolutionary algorithms, in order to observe the suitability and high potential of the search performed by evolutionary algorithms and the behavior of the GBML algorithms in contrast to the classical approaches, in terms of classification accuracy.

A connectionist approach to dynamic resource management for virtualised network functions <=SEP=> Network Functions Virtualisation (NFV) continues to gain attention as a paradigm shift in the way telecommunications services are deployed and managed. By separating Network Functions (NFs) from traditional middleboxes, NFV is expected to lead to reduced CAPEX and OPEX, and to more agile services. However, one of the main challenges to achieving these objectives is on how physical resources can be efficiently, autonomously, and dynamically allocated to Virtualised Network Functions (VNFs) whose resource requirements ebb and flow. In this paper, we propose a Graph Neural Network (GNN)-based algorithm which exploits Virtual Network Function Forwarding Graph (VNF-FG) topology information to predict future resource requirements for each Virtual Network Function Component (VNFC). The topology information of each VNFC is derived from combining its past resource utilisation as well as the modelled effect on the same from VNFCs in its neighbourhood. Our proposal has been evaluated using a deployment of a virtualised IP Multimedia Subsystem (IMS), and real VoIP traffic traces, with results showing an average prediction accuracy of 90%. Moreover, compared to a scenario where resources are allocated manually and/or statically, our proposal reduces the average number of dropped calls by at least 27% and improves call setup latency by over 29%.

A Chopper Current-Feedback Instrumentation Amplifier With a 1 mHz $1/f$  Noise Corner and an AC-Coupled Ripple Reduction Loop <=SEP=> This paper presents a chopper instrumentation amplifier for interfacing precision thermistor bridges. For high CMRR and DC gain, the amplifier employs a three-stage current-feedback topology with nested-Miller compensation. By chopping both the input and intermediate stages of the amplifier, a 1 mHz 1/f noise corner was achieved at an input-referred noise power spectral density (PSD) of 15 nV/¿Hz. To reduce chopper ripple, the amplifier employs a continuous-time AC-coupled ripple reduction loop. Due to its continuous-time nature, the loop causes no noise folding to DC and hence offers improved noise performance over auto-zeroed amplifiers. The loop reduces chopper ripple by more than 60 dB, to levels below the amplifier's own input-referred noise. Furthermore, a maximum input referred offset of 5 ¿ V and a CMRR greater than 120 dB were measured at a supply current of 230 ¿A at 5 V.

Digitalism: The New Realism? <=SEP=> Today’s society is increasingly digitalised, with mobile smartphones being routinely carried and used by a significant percentage of the population. This provides an augmented experience for the individual that does not depend on their geographical separation with respect to their community of friends and other contacts. This changes the nature of relationships between people. Individuals may live in a “digital bubble”, close to others physically, but far away from them in their digital world. More specifically, digital images can be generated and shared with ever greater ease. Sometimes the digital image takes on an important part of the individual’s experience of reality. This paper explores examples of the phenomenon, within the context of the arts in particular and culture in general. We also consider the assortment of terms used in a variety of ways by researchers in different fields with regard to our ever more digital society, such as digitalism, digitality, digitalisation, digital culture, digital philosophy, etc. We survey these terms, exploring them from alternative viewpoints, including sociological and philosophical aspects, and attempt to pinpoint some of these terms more precisely, especially in a cultural and artistic context.

Strategic Business / IT Alignment using Goal Models <=SEP=> Since few years, enterprise information technologies (IT) are no more seen as a simple technological support for business strategies in the enterprise. Moreover, standalone IT departments are created in order to support evolution and growth of IT in the enterprise. Often, IT department defines a specific strategy describing vision, goals and objectives of IT development in the organization. However, to remain competitive, IT strategy and IT investment should be coherent with global enterprise strategies. The continuous process of preserving coherence between Business/IT strategies is widely known as strategic Business/IT alignment. Our work aims at discussing the relation between interview based Business IT alignement discovery and the Strategic Alignement Model proposed by Venkatraman. The paper proposes also modeling tools and engineering methodologies to support this alignment process.

On the use of X-vectors for Robust Speaker Recognition <=SEP=> Text-independent speaker verification (SV) is currently in the process of embracing DNN modeling in every stage of SV system. Slowly, the DNN-based approaches such as end-to-end modelling and systems based on DNN embeddings start to be competitive even in challenging and diverse channel conditions of recent NIST SREs. Domain adaptation and the need for a large amount of training data are still a challenge for current discriminative systems and (unlike with generative models), we see significant gains from data augmentation, simulation and other techniques designed to overcome lack of training data. We present an analysis of a SV system based on DNN embeddings (x-vectors) and focus on robustness across diverse data domains such as standard telephone and microphone conversations, both in clean, noisy and reverberant environments. We also evaluate the system on challenging far-field data created by re-transmitting a subset of NIST SRE 2008 and 2010 microphone interviews. We compare our results with the stateof-the-art i-vector system. In general, we were able to achieve better performance with the DNN-based systems, but most importantly, we have confirmed the robustness of such systems across multiple data domains.

User experiences and expectations of vibrotactile, thermal and squeeze feedback in interpersonal communication <=SEP=> Katja Suhonen Tampere University of Technology, Human-Centered Technology, P.O.Box 589, 33101 Tampere, Finland katja.suhonen@tut.fi Kaisa Väänänen-Vainio-Mattila Tampere University of Technology, Human-Centered Technology, P.O.Box 589, 33101 Tampere, Finland kaisa.vaananen-vainiomattila@tut.fi Kalle Mäkelä Tampere University of Technology, Department of Electronics, P.O.Box 692, 33101 Tampere, Finland kalle.makela@tut.fi

Differences in kinematics and electromyographic activity between men and women during the single-legged squat. <=SEP=> BACKGROUND
Numerous factors have been identified as potentially increasing the risk of anterior cruciate ligament injury in the female athlete. However, differences between the sexes in lower extremity coordination, particularly hip control, are only minimally understood.


HYPOTHESIS
There is no difference in kinematic or electromyographic data during the single-legged squat between men and women.


STUDY DESIGN
Descriptive comparison study.


METHODS
We kinematically and electromyographically analyzed the single-legged squat in 18 intercollegiate athletes (9 male, 9 female). Subjects performed five single-legged squats on their dominant leg, lowering themselves as far as possible and then returning to a standing position without losing balance.


RESULTS
Women demonstrated significantly more ankle dorsiflexion, ankle pronation, hip adduction, hip flexion, hip external rotation, and less trunk lateral flexion than men. These factors were associated with a decreased ability of the women to maintain a varus knee position during the squat as compared with the men. Analysis of all eight tested muscles demonstrated that women had greater muscle activation compared with men. When each muscle was analyzed separately, the rectus femoris muscle activation was found to be statistically greater in women in both the area under the linear envelope and maximal activation data.


CONCLUSIONS
Under a physiologic load in a position commonly assumed in sports, women tend to position their entire lower extremity and activate muscles in a manner that could increase strain on the anterior cruciate ligament.

Procedural Content Generation: Goals, Challenges and Actionable Steps <=SEP=> This chapter discusses the challenges and opportunities of procedural content generation (PCG) in games. It starts with defining three grand goals of PCG, namely multi-level multi-content PCG, PCG-based game design and generating complete games. The way these goals are defined, they are not feasible with current technology. Therefore we identify nine challenges for PCG research. Work towards meeting these challenges is likely to take us closer to realising the three grand goals. In order to help researchers get started, we also identify five actionable steps, which PCG researchers could get started working on immediately. 1998 ACM Subject Classification I.2.1 Applications and Expert Systems: Games

Time-to-Digital Converter Using a Tuned-Delay Line Evaluated in 28-, 40-, and 45-nm FPGAs <=SEP=> This paper proposes a bin-width tuning method for a field-programmable gate array (FPGA)-based delay line for a time-to-digital converter (TDC). Changing the hit transitions and sampling patterns of the carry chain considering delays of the sum and carry-out bins can improve the bin-width uniformity and thus measurement precision. The proposed sampling method was evaluated and compared with the ordinary tapped-delay-line (TDL) method in three different types of FPGAs: Kintex-7, Virtex-6, and Spartan-6. The linearity, equivalent bin width, and measurement precision improved for all the evaluated FPGAs by adopting the proposed method. The measurement precision obtained using the simple TDL architecture is comparable with other complex TDC architectures. In addition, the proposed method improves bin-width uniformity and measurement precision while maintaining the advantages of TDL TDCs, that is, fast conversion rate and small resource usage. Furthermore, the enhanced linearity of the delay line can also improve other carry-chain-based FPGA-TDCs.

Control structure design for complete chemical plants <=SEP=> Control structure design deals with the structural decisions of the control system, including what to control and how to pair the variables to form control loops. Although these are very important issues, these decisions are in most cases made in an ad hoc fashion, based on experience and engineering insight, without considering the details of each problem. In the paper, a systematic procedure for control structure design for complete chemical plants (plantwide control) is presented. It starts with carefully defining the operational and economic objectives, and the degrees of freedom available to fulfill them. Other issues, discussed in the paper, include inventory and production rate control, decentralized versus multivariable control, loss in performance by bottom-up design, and a definition of a the ‘‘complexity number’’ for the control system. # 2003 Elsevier Ltd. All rights reserved.

Reducing Uncertainty of Low-Sampling-Rate Trajectories <=SEP=> The increasing availability of GPS-embedded mobile devices has given rise to a new spectrum of location-based services, which have accumulated a huge collection of location trajectories. In practice, a large portion of these trajectories are of low-sampling-rate. For instance, the time interval between consecutive GPS points of some trajectories can be several minutes or even hours. With such a low sampling rate, most details of their movement are lost, which makes them difficult to process effectively. In this work, we investigate how to reduce the uncertainty in such kind of trajectories. Specifically, given a low-sampling-rate trajectory, we aim to infer its possible routes. The methodology adopted in our work is to take full advantage of the rich information extracted from the historical trajectories. We propose a systematic solution, History based Route Inference System (HRIS), which covers a series of novel algorithms that can derive the travel pattern from historical data and incorporate it into the route inference process. To validate the effectiveness of the system, we apply our solution to the map-matching problem which is an important application scenario of this work, and conduct extensive experiments on a real taxi trajectory dataset. The experiment results demonstrate that HRIS can achieve higher accuracy than the existing map-matching algorithms for low-sampling-rate trajectories.

Towards reliable traffic sign recognition <=SEP=> The demand for reliable traffic sign recognition (TSR) increases with the development of safety driven advanced driver assistance systems (ADAS). Emerging technologies like brake-by-wire or steer-by-wire pave the way for collision avoidance and threat identification systems. Obviously, decision making in such critical situations requires high reliability of the information base. Especially for comfort systems, we need to take into account that the user tends to trust the information provided by the ADAS [1]. In this paper, we present a robust system architecture for the reliable recognition of circular traffic signs. Our system employs complementing approaches for the different stages of current TSR systems. This introduces the application of local SIFT features for content-based traffic sign detection along with widely applied shape-based approaches. We further add a technique called contracting curve density (CCD) to refine the localization of the detected traffic sign candidates and therefore increase the performance of the subsequent classification module. Finally, the recognition stage based on SIFT and SURF descriptions of the candidates executed by a neural net provides a robust classification of structured image content like traffic signs. By applying these steps we compensate the weaknesses of the utilized approaches, and thus, improve the system's performance.

3-Dimensional Analysis on the GIDL Current of Body-tied Triple Gate FinFET <=SEP=> Triple gate FinFET is emerging as a promising candidate for the future CMOS device structures because of its immunity to short-channel effect. However, the suppression of GIDL is a significant challenge for its application. In this paper, we discuss the characteristics of GIDL on FinFET and extensively analyze the influence of the device technology on GIDL. The analysis is expected to give guidelines to the future development of triple gate FinFET

Perspectives on the Productivity Dilemma <=SEP=> Editor’s note The authors of this paper presented an All-academy session at the 2008 Academy of Management annual meeting in Anaheim, California. We were excited by the dynamic nature of the debate and felt that it related closely to critical issues in the areas of operations management, strategy, product development and international business. We thus invited the authors to write an article offering their individual and joint views on the productivity dilemma. We trust you will find it to be stimulating and thought provoking. We invite you to add your voice to the discussion by commenting on this article at the Operations and Supply Chain (OSM) Forum at http://www.journaloperationsmanagement.org/OSM.asp. – Kenneth K. Boyer and Morgan L. Swink

Applying the Waek Learning Framework to Understand and Improve C4.5 <=SEP=> There has long been a chasm between theoretical mod els of machine learning and practical machine learn ing algorithms For instance empirically successful algorithms such as C and backpropagation have not met the criteria of the PAC model and its vari ants Conversely the algorithms suggested by com putational learning theory are usually too limited in various ways to nd wide application The theoreti cal status of decision tree learning algorithms is a case in point while it has been proven that C and all reasonable variants of it fails to meet the PAC model criteria other recently proposed decision tree algo rithms that do have non trivial performance guaran tees unfortunately require membership queries Two recent developments have narrowed this gap between theory and practice not for the PAC model but for the related model known as weak learning or boosting First an algorithm called Adaboost was proposed that meets the formal criteria of the boosting model and is also competitive in practice Second the basic algorithms underlying the popular C and CART programs have also very recently been shown to meet the formal criteria of the boosting model Thus it seems plausible that the weak learning frame work may provide a setting for interaction between formal analysis and machine learning practice that is lacking in other theoretical models Our aim in this paper is to push this interaction further in light of these recent developments In par ticular we perform experiments suggested by the for mal results for Adaboost and C within the weak learning framework We concentrate on two particu larly intriguing issues First the theoretical boosting results for top down decision tree algorithms such as C suggest that a new splitting criterion may result in trees that are smaller and more accurate than those obtained using the usual information gain We con rm this suggestion experimentally Second a super cial interpretation of the theo retical results suggests that Adaboost should vastly outperform C This is not the case in practice and we argue through experimental results that the theory must be understood in terms of a measure of a boosting algorithm s behavior called its advantage sequence We compare the advantage sequences for C and Adaboost in a number of experiments We nd that these sequences have qualitatively dif ferent behavior that explains in large part the dis crepancies between empirical performance and the theoretical results Brie y we nd that although C and Adaboost are both boosting algorithms Adaboost creates successively harder ltered dis tributions while C creates successively easier ones in a sense that will be made precise

Sex similarities and differences in preferences for short-term mates: what, whether, and why. <=SEP=> Are there sex differences in criteria for sexual relationships? The answer depends on what question a researcher asks. Data suggest that, whereas the sexes differ in whether they will enter short-term sexual relationships, they are more similar in what they prioritize in partners for such relationships. However, additional data and context of other findings and theory suggest different underlying reasons. In Studies 1 and 2, men and women were given varying "mate budgets" to design short-term mates and were asked whether they would actually mate with constructed partners. Study 3 used a mate-screening paradigm. Whereas women have been found to prioritize status in long-term mates, they instead (like men) prioritize physical attractiveness much like an economic necessity in short-term mates. Both sexes also show evidence of favoring well-rounded long- and short-term mates when given the chance. In Studies 4 and 5, participants report reasons for having casual sex and what they find physically attractive. For women, results generally support a good genes account of short-term mating, as per strategic pluralism theory (S. W. Gangestad & J. A. Simpson, 2000). Discussion addresses broader theoretical implications for mate preference, and the link between method and theory in examining social decision processes.

Interpersonal connectedness: conceptualization and directions for a measurement instrument <=SEP=> Interpersonal connectedness is the sense of belonging based on the appraisal of having sufficient close social contacts. This feeling is regarded as one of the major outcomes of successful (mediated) social interaction and as such an important construct for HCI. However, the exact nature of this feeling, how to achieve it, and how to assess it remain unexplored to date. In the current paper we start the theoretical conceptualization of this phenomenon by exploring its basic origins in psychological literature and simultaneously formulate requirements for a measurement instrument to be developed in the service of exploring and testing CMC applications, in particular awareness technologies.

Security challenges in software defined network and their solutions <=SEP=> The main purpose of Software Defined Networking (SDN) is to allow network engineers to respond quickly to changing network industrial requirements. This network technology focuses on making network as adaptable and active as virtual server. SDN is physical separation of Control plane from Data plane and control plane is centralized to manage underlying infrastructure. Hence, the SDN permit network administrator to adjust wide traffic flow from centralized control console without having to touch Switches and Routers, and can provide the services to wherever they are needed in the network. As in SDN the control plane is disassociated from underlying forwarding plane, however, susceptible to many security challenges like Denial of Service (DoS) attack, Distributed DoS (DDoS) attack, Volumetric attack. In this paper, we highlight some security challenges and evaluate some security solutions.

The Seventh PASCAL Recognizing Textual Entailment Challenge <=SEP=> This paper presents the Seventh Recognizing Textual Entailment (RTE-7) challenge. This year’s challenge replicated the exercise proposed in RTE-6, consisting of a Main Task, in which Textual Entailment is performed on a real corpus in the Update Summarization scenario; a Main subtask aimed at detecting novel information; and a KBP Validation Task, in which RTE systems had to validate the output of systems participating in the KBP Slot Filling Task. Thirteen teams participated in the Main Task (submitting 33 runs) and 5 in the Novelty Detection Subtask (submitting 13 runs). The KBP Validation Task was undertaken by 2 participants which submitted 5 runs. The ablation test experiment, introduced in RTE-5 to evaluate the impact of knowledge resources used by the systems participating in the Main Task and extended also to tools in RTE-6, was also repeated in RTE-7.

Mobile applications for weight management: theory-based content analysis. <=SEP=> BACKGROUND
The use of smartphone applications (apps) to assist with weight management is increasingly prevalent, but the quality of these apps is not well characterized.


PURPOSE
The goal of the study was to evaluate diet/nutrition and anthropometric tracking apps based on incorporation of features consistent with theories of behavior change.


METHODS
A comparative, descriptive assessment was conducted of the top-rated free apps in the Health and Fitness category available in the iTunes App Store. Health and Fitness apps (N=200) were evaluated using predetermined inclusion/exclusion criteria and categorized based on commonality in functionality, features, and developer description. Four researchers then evaluated the two most popular apps in each category using two instruments: one based on traditional behavioral theory (score range: 0-100) and the other on the Fogg Behavioral Model (score range: 0-6). Data collection and analysis occurred in November 2012.


RESULTS
Eligible apps (n=23) were divided into five categories: (1) diet tracking; (2) healthy cooking; (3) weight/anthropometric tracking; (4) grocery decision making; and (5) restaurant decision making. The mean behavioral theory score was 8.1 (SD=4.2); the mean persuasive technology score was 1.9 (SD=1.7). The top-rated app on both scales was Lose It! by Fitnow Inc.


CONCLUSIONS
All apps received low overall scores for inclusion of behavioral theory-based strategies.

Constructions from Dots and Lines <=SEP=> Marko A. Rodriguez is graph systems architect at AT&T Interactive. He can be reached at marko<at>markorodriguez.com. Peter Neubauer is chief operating officer of Neo Technology. He can be reached at peter.neubauer<at>neotechnology.com A graph is a data structure composed of dots (i.e., vertices) and lines (i.e., edges). The dots and lines of a graph can be organized into intricate arrangements. A graph’s ability to denote objects and their relationships to one another allows for a surprisingly large number of things to be modeled as graphs. From the dependencies that link software packages to the wood beams that provide the framing to a house, most anything has a corresponding graph representation. However, just because it is possible to represent something as a graph does not necessarily mean that its graph representation will be useful. If a modeler can leverage the plethora of tools and algorithms that store and process graphs, then such a mapping is worthwhile. This article explores the world of graphs in computing and exposes situations in which graphical models are beneficial.