Giving too much social support: social overload on social networking sites

As the number of messages and social relationships embedded in social networking sites (SNS) increases, the amount of social information demanding a reaction from individuals increases as well. We observe that, as a consequence, SNS users feel they are giving too much social support to other SNS users. Drawing on social support theory (SST), we call this negative association with SNS usage ‘social overload’ and develop a latent variable to measure it. We then identify the theoretical antecedents and consequences of social overload and evaluate the social overload model empirically using interviews with 12 and a survey of 571 Facebook users. The results show that extent of usage, number of friends, subjective social support norms, and type of relationship (online-only vs offline friends) are factors that directly contribute to social overload while age has only an indirect effect. The psychological and behavioral consequences of social overload include feelings of SNS exhaustion by users, low levels of user satisfaction, and a high intention to reduce or even stop using SNS. The resulting theoretical implications for SST and SNS acceptance research are discussed and practical implications for organizations, SNS providers, and SNS users are drawn.     

The complexity of intersecting finite automata having few final states

The problem of determining whether several finite automata accept a word in common is closely related to the well-studied membership problem in transformation monoids. We raise the issue of limiting the number of final states in the automata intersection problem. For automata with two final states, we show the problem to be \({\oplus}\)L-complete or NP-complete according to whether a nontrivial monoid other than a direct product of cyclic groups of order 2 is allowed in the automata. We further consider idempotent commutative automata and (Abelian, mainly) group automata with one, two, or three final states over a singleton or larger alphabet, elucidating (under the usual hypotheses on complexity classes) the complexity of the intersection nonemptiness and related problems in each case.     

Moving loads on flexible structures presented in the floating frame of reference formulation

The introduction of moving loads in the Floating Frame of Reference Formulation is presented. We derive the kinematics and governing equations of motion of a general flexible multibody system and their extension to moving loads. The equivalence of convective effects with Coriolis and centripetal forces is shown. These effects are measured numerically and their significance in moving loads traveling at high speed is confirmed. A method is presented to handle discontinuities when moving loads separate from the flexible structure. The method is extended from beam models to general flexible structures obtained by means of the Finite Element Method. An interpolation method for the deformation field of the modal representation of these bodies is introduced.The work is concluded by application of the method to modern mechanical problems in numerical simulations.     

Automatisches Sicherheitstesten

Moderne Testgeneratoren finden Schwachstellen in Eingabeschnittstellen von Programmen, indem sie in Sekunden tausende Eingaben zufällig erzeugen. Die Werkzeuge lassen sich leicht von jedermann einsetzen–zum Angriff oder zur Verteidigung.     

3D interactive topology optimization on hand-held devices

This educational paper describes the implementation aspects, user interface design considerations and workflow potential of the recently published TopOpt 3D App. The app solves the standard minimum compliance problem in 3D and allows the user to change design settings interactively at any point in time during the optimization. Apart from its educational nature, the app may point towards future ways of performing industrial design. Instead of the usual geometrize, then model and optimize approach, the geometry now automatically adapts to the varying boundary and loading conditions. The app is freely available for iOS at Apple’s App Store and at http://www.topopt.dtu.dk/TopOpt3D for Windows and OSX.     

Mixing matrix estimation using discriminative clustering for blind source separation

Mixing matrix estimation in instantaneous blind source separation (BSS) can be performed by exploiting the sparsity and disjoint orthogonality of source signals. As a result, approaches for estimating the unknown mixing process typically employ clustering algorithms on the mixtures in a parametric domain, where the signals can be sparsely represented. In this paper, we propose two algorithms to perform discriminative clustering of the mixture signals for estimating the mixing matrix. For the case of overdetermined BSS, we develop an algorithm to perform linear discriminant analysis based on similarity measures and combine it with K-hyperline clustering. Furthermore, we propose to perform discriminative clustering in a high-dimensional feature space obtained by an implicit mapping, using the kernel trick, for the case of underdetermined source separation. Using simulations on synthetic data, we demonstrate the improvements in mixing matrix estimation performance obtained using the proposed algorithms in comparison to other clustering methods. Finally we perform mixing matrix estimation from speech mixtures, by clustering single source points in the time-frequency domain, and show that the proposed algorithms achieve higher signal to interference ratio when compared to other baseline algorithms.     

Exploring the use of information visualization for digital libraries

This paper presents the findings from a study conducted to explore the current and future use of information visualization (IV) for digital libraries (DL). A series of query techniques and participatory design workshops were employed with the goal of actively involving users in identifying the key characteristics and applications of IV for DLs. The methodology employed, key findings and overall conclusions are presented and discussed.     

Generic visual analysis for multi- and hyperspectral image data

Multi- and hyperspectral imaging and data analysis has been investigated in the last decades in the context of various fields of application like remote sensing or microscopic spectroscopy. However, recent developments in sensor technology and a growing number of application areas require a more generic view on data analysis, that clearly expands the current, domain-specific approaches. In this context, we address the problem of interactive exploration of multi- and hyperspectral data, consisting of (semi-)automatic data analysis and scientific visualization in a comprehensive fashion. In this paper, we propose an approach that enables a generic interactive exploration and easy segmentation of multi- and hyperspectral data, based on characterizing spectra of an individual dataset, the so-called endmembers. Using the concepts of existing endmember extraction algorithms, we derive a visual analysis system, where the characteristic spectra initially identified serve as input to interactively tailor a problem-specific visual analysis by means of visual exploration. An optional outlier detection improves the robustness of the endmember detection and analysis. An adequate system feedback of the costly unmixing procedure for the spectral data with respect to the current set of endmembers is ensured by a novel technique for progressive unmixing and view update which is applied at user modification. The progressive unmixing is based on an efficient prediction scheme applied to previous unmixing results. We present a detailed evaluation of our system in terms of confocal Raman microscopy, common multispectral imaging and remote sensing.     

Spatial inverse query processing

Traditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database objects Q and a query predicate, return all objects which, if used as query objects with the predicate, contain Q in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We show how to apply this framework on a variety of inverse queries, using appropriate space pruning strategies. In particular, we propose solutions for inverse epsilon range queries, inverse k-nearest neighbor queries, and inverse skyline queries. Furthermore, we show how to relax the definition of inverse queries in order to ensure non-empty result sets. Our experiments show that our framework is significantly more efficient than naive approaches.     

Examining the dimensionality of genuine multipartite entanglement

Entanglement in high-dimensional many-body systems plays an increasingly vital role in the foundations and applications of quantum physics. In the present paper, we introduce a theoretical concept which allows to categorize multipartite states by the number of degrees of freedom being entangled. In this regard, we derive computable and experimentally friendly criteria for arbitrary multipartite qudit systems that enable to examine in how many degrees of freedom a mixed state is genuine multipartite entangled.