Building Efficient and Compact Data Structures for Simplicial Complexes

The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes. In this paper, we show how to optimally compress the Simplex Tree while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree (MxST) and the Simplex Array List (SAL). We analyze the compressed Simplex Tree, the Maximal Simplex Tree, and the Simplex Array List under various settings.Comment: An extended abstract appeared in the proceedings of SoCG 201

Creating the N-Form Corporation as a Managerial Competence

This paper discusses key properties of the N-form corporation or internal network forms of organizing from three mutually related perspectives: structure, knowledge flows and management processes. To operationalize knowledge flows, a key property of N-forms, the paper suggests a new measure, the H/V ratio, to empirically assess the configuration of knowledge flows. The argument is illustrated by a case study of a firm showing that top management's perception about having an internal network contradicts with reality as vertical knowledge flows appear to dominate the horizontal ones. The managerial competence required for creating internal networks aimed at knowledge creation and sharing will be discussed.internal networks;knowledge flows;N-form Corporation;Organizational forms;managerial competence

A Randomized Kernel-Based Secret Image Sharing Scheme

This paper proposes a ($k,n$)-threshold secret image sharing scheme that offers flexibility in terms of meeting contrasting demands such as information security and storage efficiency with the help of a randomized kernel (binary matrix) operation. A secret image is split into $n$ shares such that any $k$ or more shares ($k\leq n$) can be used to reconstruct the image. Each share has a size less than or at most equal to the size of the secret image. Security and share sizes are solely determined by the kernel of the scheme. The kernel operation is optimized in terms of the security and computational requirements. The storage overhead of the kernel can further be made independent of its size by efficiently storing it as a sparse matrix. Moreover, the scheme is free from any kind of single point of failure (SPOF).Comment: Accepted in IEEE International Workshop on Information Forensics and Security (WIFS) 201

A platform for discovering and sharing confidential ballistic crime data.

Criminal investigations generate large volumes of complex data that detectives have to analyse and understand. This data tends to be "siloed" within individual jurisdictions and re-using it in other investigations can be difficult. Investigations into trans-national crimes are hampered by the problem of discovering relevant data held by agencies in other countries and of sharing those data. Gun-crimes are one major type of incident that showcases this: guns are easily moved across borders and used in multiple crimes but finding that a weapon was used elsewhere in Europe is difficult. In this paper we report on the Odyssey Project, an EU-funded initiative to mine, manipulate and share data about weapons and crimes. The project demonstrates the automatic combining of data from disparate repositories for cross-correlation and automated analysis. The data arrive from different cultural/domains with multiple reference models using real-time data feeds and historical databases

The impact of market orientation on research-based spin off performance: emerging issues from an exploratory study

The paper addresses the relationship between Market Orientation (MO) and Research based spin offs' business performance, using a sample of 90 Italian RBSOs present in the Netval (Italian association for the valorisation of results from public research) database. The findings of the study may be useful for researchers and academics, advancing knowledge on Research based spin-offs (RBSOs) and the impact of MO on their performance, but also professionals from new high tech ventures and technology transfer offices may use these results to plan and design market-focused actions and support activities that will lead to improved business performance.The results could in fact indicate to entrepreneurs (or the entrepreneurial team) of this kind of firms which dimensions of MO deserve more attention in order to obtain a higher business performance

Compact groups in the UZC galaxy sample

Applying an automatic neighbour search algorithm to the 3D UZC galaxy catalogue (Falco 1999) we have identified 291 compact groups (CGs) with redshifts between 1000 and 10000 km/s. The sample is analysed to investigate whether Triplets display kinematical and morphological characteristics similar to higher order CGs (Multiplets). It is found that Triplets constitute low velocity dispersion structures, have a gas-rich galaxy population and are typically retrieved in sparse environments. Conversely Multiplets show higher velocity dispersion, include few gas-rich members and are generally embedded structures. Evidence hence emerges indicating that Triplets and Multiplets, though sharing a common scale, correspond to different galaxy systems. Triplets are typically field structures whilst Multiplets are mainly subclumps (either temporarily projected or collapsing) within larger structures. Simulations show that selection effects can only partially account for differences, but significant contamination of Triplets by field galaxy interlopers could eventually induce the observed dependences on multiplicity.Comment: 13 pages, 12 figures. The file is in latex (A & A style) format. The figures are in postscript. A & A accepte

Widening Access to Palliative Care for People with Learning Disabilities

This publication represents an important step towards greater partnership by sharing some of the thinking, good practice and resources that have been developed throughout learning disability and end of life care services in a form that will be accessible to all practitioners but especially those in a hospice setting. It includes sections on the definition and incidence of learning disability, healthcare for people with learning disability, as well as a glossary and an extensive section on resources

A Nice Labelling for Tree-Like Event Structures of Degree 3

We address the problem of finding nice labellings for event structures of degree 3. We develop a minimum theory by which we prove that the labelling number of an event structure of degree 3 is bounded by a linear function of the height. The main theorem we present in this paper states that event structures of degree 3 whose causality order is a tree have a nice labelling with 3 colors. Finally, we exemplify how to use this theorem to construct upper bounds for the labelling number of other event structures of degree 3

Creating the N-Form Corporation as a Managerial Competence

This paper discusses key properties of the N-form corporation or internal network forms of organizing from three mutually related perspectives: structure, knowledge flows and management processes. To operationalize knowledge flows, a key property of N-forms, the paper suggests a new measure, the H/V ratio, to empirically assess the configuration of knowledge flows. The argument is illustrated by a case study of a firm showing that top management's perception about having an internal network contradicts with reality as vertical knowledge flows appear to dominate the horizontal ones. The managerial competence required for creating internal networks aimed at knowledge creation and sharing will be discussed