pinecone/core-2020-05-10-deduplication huggingface dataset:
Remainder subset awareness for feature subset selection

Feature subset selection has become more and more a common topic of research. This popularity is partly due to the growth in the number of features and application domains. It is of the greatest importance to take themost of every evaluation of the inducer, which is normally the more costly part. In this paper, a technique is proposed that takes into account the inducer evaluation both in the current subset and in the remainder subset (its complementary set) and is applicable to any sequential subset selection algorithm at a reasonable overhead in cost. Its feasibility is demonstrated on a series of benchmark data sets.Postprint (author’s final draft
Geometric Algebra Model of Distributed Representations

Formalism based on GA is an alternative to distributed representation models
developed so far --- Smolensky's tensor product, Holographic Reduced
Representations (HRR) and Binary Spatter Code (BSC). Convolutions are replaced
by geometric products, interpretable in terms of geometry which seems to be the
most natural language for visualization of higher concepts. This paper recalls
the main ideas behind the GA model and investigates recognition test results
using both inner product and a clipped version of matrix representation. The
influence of accidental blade equality on recognition is also studied. Finally,
the efficiency of the GA model is compared to that of previously developed
models.Comment: 30 pages, 19 figure
The cylindrical Fourier transform

In this paper we devise a so-called cylindrical Fourier transform within the Clifford analysis context. The idea is the following: for a fixed vector in the image space the level surfaces of the traditional Fourier kernel are planes perpendicular to that fixed vector. For this Fourier kernel we now substitute a new Clifford-Fourier kernel such that, again for a fixed vector in the image space, its phase is constant on co-axial cylinders w.r.t. that fixed vector. The point is that when restricting to dimension two this new cylindrical Fourier transform coincides with the earlier introduced Clifford-Fourier transform.We are now faced with the following situation: in dimension greater than two we have a first Clifford-Fourier transform with elegant properties but no kernel in closed form, and a second cylindrical one with a kernel in closed form but more complicated calculation formulae. In dimension two both transforms coincide. The paper concludes with the calculation of the cylindrical Fourier spectrum of an L2-basis consisting of generalized Clifford-Hermite functions
Hilbert transforms in Clifford analysis

The Hilbert transform on the real line has applications in many fields. In particular in one–dimensional signal processing, the Hilbert operator is used to extract global as well as instantaneous characteristics, such as frequency, amplitude and phase, from real signals. The multidimensional approach to the Hilbert transform usually is a tensorial one, considering the so-called Riesz transforms in each of the cartesian variables separately. In this paper we give an overview of generalized Hilbert transforms in Euclidean space, developed within the framework of Clifford analysis. Roughly speaking, this is a function theory of higher dimensional holomorphic functions, which is particularly suited for a treatment of multidimensional phenomena since all dimensions are encompassed at once as an intrinsic feature
Harnessing Different Dimensions of Space. The Built Environment in Auti-Biographies

An understanding of diversity is a key principle in the development of theories, tools and techniques of design for inclusion. Aiming at more accurate insight into the diversity of interactions of people with the designed environment, we explore other people's perspectives, in particular, those of people with autism spectrum disorders. Noticing their unique way of making sense of the world, our research questions the relevance of the meaning attributed to the built environment in our society.
In this paper, we investigate the way people with autism talk about space and the importance they attach to their physical environment, as reflected in stories and autobiographies of people with autism themselves--in short, auti-biographies. By analyzing their own descriptions, we try to gain more insight into an autistic way of thinking and acting in relation to the built environment. These insights make us question our own way of dealing with space in the challenge of inclusive design.status: publishe
Infrastructure asset management: the challenges and approaches

Infrastructure organisations such as airport, seaport, rail and road are operating in an increasingly challenging business environment as a result of globalisation, privatisation and deregulation. These organisations must ensure that their main resource i.e. their infrastructure assets are well managed in order to support their business operations. Brisbane Airport is used as a case study to understand the challenges faced in the management of infrastructure assets as well as the approaches used to overcome them. The findings can be useful in helping asset managers to identify the resources they should seek to manipulate in order to make improvement to their activities and contribute to the overall performance of their organisation.
Modelling Total Cost of Ownership of Rail Infrastructure for Outsourcing Maintenance Services

In the recent years, outsourcing maintenance services has become a part of the strategy for cost and risk management. Outsourcing reduces upfront investments in infrastructure, expertise and specialised maintenance facilities. However, decision on this need to take into account the total cost of ownership rather than the usual practice of procurement cost. The primary objective of this paper is to develop models for prediction of total cost of ownership and estimation of contract price for outsourcing maintenance services of rail infrastructure. Total cost of ownership model is developed considering procurement, maintenance, inspection and risks associated with operation of rail network. Contract price for outsourcing services is modelled considering million gross tonnes of traffic under specific design, operation and maintenance conditionsGriffith Sciences, Griffith School of EngineeringFull Tex
Growth and Decay in Life-Like Cellular Automata

We propose a four-way classification of two-dimensional semi-totalistic
cellular automata that is different than Wolfram's, based on two questions with
yes-or-no answers: do there exist patterns that eventually escape any finite
bounding box placed around them? And do there exist patterns that die out
completely? If both of these conditions are true, then a cellular automaton
rule is likely to support spaceships, small patterns that move and that form
the building blocks of many of the more complex patterns that are known for
Life. If one or both of these conditions is not true, then there may still be
phenomena of interest supported by the given cellular automaton rule, but we
will have to look harder for them. Although our classification is very crude,
we argue that it is more objective than Wolfram's (due to the greater ease of
determining a rigorous answer to these questions), more predictive (as we can
classify large groups of rules without observing them individually), and more
accurate in focusing attention on rules likely to support patterns with complex
behavior. We support these assertions by surveying a number of known cellular
automaton rules.Comment: 30 pages, 23 figure
The B36/S125 "2x2" Life-Like Cellular Automaton

The B36/S125 (or "2x2") cellular automaton is one that takes place on a 2D
square lattice much like Conway's Game of Life. Although it exhibits high-level
behaviour that is similar to Life, such as chaotic but eventually stable
evolution and the existence of a natural diagonal glider, the individual
objects that the rule contains generally look very different from their Life
counterparts. In this article, a history of notable discoveries in the 2x2 rule
is provided, and the fundamental patterns of the automaton are described. Some
theoretical results are derived along the way, including a proof that the speed
limits for diagonal and orthogonal spaceships in this rule are c/3 and c/2,
respectively. A Margolus block cellular automaton that 2x2 emulates is
investigated, and in particular a family of oscillators made up entirely of 2 x
2 blocks are analyzed and used to show that there exist oscillators with period
2^m(2^k - 1) for any integers m,k \geq 1.Comment: 18 pages, 19 figure
Statistical disclosure control in tabular data

Data disseminated by National Statistical Agencies (NSAs) can be classified\ud
as either microdata or tabular data. Tabular data is obtained from microdata by\ud
crossing one or more categorical variables. Although cell tables provide aggregated\ud
information, they also need to be protected. This chapter is a short introduction to\ud
tabular data protection. It contains three main sections. The first one shows the different\ud
types of tables that can be obtained, and how they are modeled. The second\ud
describes the practical rules for detection of sensitive cells that are used by NSAs.\ud
Finally, an overview of protection methods is provided, with a particular focus on\ud
two of them: “cell suppression problem” and “controlled tabular adjustment”.Postprint (published version
A manufacturing foundation ontology for product life cycle interoperability

This paper was presented at the International Conference on Interoperability for Enterprise Software and Applications, I-ESA 2010, Coventry University, UK. The definitive publisher version of this paper is available at: https://link.springer.com/chapter/10.1007%2F978-1-84996-257-5_14This paper presents the idea of a proposed Manufacturing Foundation Ontology (MFO) aimed at acting as a basis for the Product Life Cycle (PLC) interoperability. MFO is aimed to have the provision for introducing interoperability not only across departments but across organization as well. The proposed idea shows the development of a MFO in several layers and various levels in those layers. The foundation ontology will act as a basis for building Interoperable knowledge bases or ‘World Models’ from a library of formally defined concepts in a heavy weight ontology. A MFO must be flexible enough to allow organizations to be able to model their own domains with the flexibility to use the terms they want. Rules and axioms governing each and every concept add rigour to the semantics of the MFO and restrict the use of concepts to facilitate interoperability with a minimum effect on flexibility to model
Gap analysis of ontology mapping tools and techniques

This paper was presented at Interoperability for Enterprise Software and Applications, I-ESA 2010, Coventry University, UK. The definitive publisher version of this paper is available at: https://doi.org/10.1007/978-1-84996-257-5_28Mapping between ontologies provides a way to overcome any dissimilarities in the terminologies used in two ontologies. Some tools and techniques to map ontologies are available with some semi-automatic mapping capabilities. These tools are employed to join the similar concepts in two ontologies and overcome the possible mismatches.Several types of mismatches have been identified by researchers and certain overlaps can easily be seen in their description. Analysis of the mapping tools and techniques through a mismatches framework reveals that most of the tools and techniques just target the explication side of the concepts in ontologies and a very few of them opt for the conceptualization mismatches. Research therefore needs to be done in the area of detecting and overcoming conceptualization mismatches that may occur during the process of mapping. The automation and reliability of these tools are important because they directly affect the interoperatbility between different knowledge sources
Reframing online shopping through innovative and organic user-oriented design

The structure and form of the Web is defined by specific design elements; its protocols, the scope of acceptable file formats and the capability of clients. These elements are intentionally minimal constraints but nonetheless structure what can be achieved “through” the Web. With the increasingly standardised abilities of Web clients and wider application of accessible design principles increasingly emphasis shifts from the problem of creating and developing monolithic software systems towards concern for the integration and configuration of existing systems to meet specific social and cultural needs. The free availability of, for example, open source content management systems and blogging applications has increased the ability for individuals and closely geographically constrained highly specialised interest groups to more rapidly represent and express themselves through the Web. Importantly, the abilities provided by pre-built existing systems enables greater focus on reflecting and capturing the peculiar cultural sentiments of special interests
Evaluation de la conscience chez les patients en coma et en états apparentés par stimulation magnétique transcrânienne combinée à l'électroencéphalographie

Thanks to advances in medical care, an increased number of patients recover from coma. However, some remain in vegetative/unresponsive wakefulness syndrome or in a minimally conscious state. Detection of awareness in severely brain-injured patients is challenging because it relies on behavioral assessments, which can be affected by motor, sensory and cognitive impairments of the patients. Other means of evaluation are needed to improve the accuracy of the diagnosis in this challenging population. We will here review the different altered states of consciousness occurring after severe brain damage, and explain the difficulties associated with behavioral assessment of consciousness. We will then describe a non-invasive technique, transcranial magnetic stimulation combined with high-density electroencephalography (TMS-EEG), which has allowed us to detect the presence or absence of consciousness in different physiological, pathological and pharmacological states. Some potential underlying mechanisms of the loss of consciousness will then be discussed. In conclusion, TMS-EEG is highly promising in identifying markers of consciousness at the individual level and might be of great value for clinicians in the assessment of consciousness
Computing small pivot-minors.

A graph G contains a graph H as a pivot-minor if H can be obtained from G by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in the study of rank-width. However, so far, pivot-minors have only been studied from a structural perspective. We initiate a systematic study into their complexity aspects. We first prove that the PIVOT-MINOR problem, which asks if a given graph G contains a given graph H as a pivot-minor, is NP-complete. If H is not part of the input, we denote the problem by H-PIVOT-MINOR. We give a certifying polynomial-time algorithm for H -PIVOT-MINOR for every graph H with |V(H)|≤4|V(H)|≤4 except when H∈{K4,C3+P1,4P1}H∈{K4,C3+P1,4P1}, via a structural characterization of H-pivot-minor-free graphs in terms of a set FHFH of minimal forbidden induced subgraphs
Connected vertex cover for (sP1+P5)-free graphs.

The Connected Vertex Cover problem is to decide if a graph G has a vertex cover of size at most k that induces a connected subgraph of G. This is a well-studied problem, known to be NP-complete for restricted graph classes, and, in particular, for H-free graphs if H is not a linear forest. On the other hand, the problem is known to be polynomial-time solvable for   sP2 -free graphs for any integer   s≥1 . We prove that it is also polynomial-time solvable for   (sP1+P5) -free graphs for every integer   s≥ 0
OpenCL Actors - Adding Data Parallelism to Actor-based Programming with
  CAF

The actor model of computation has been designed for a seamless support of
concurrency and distribution. However, it remains unspecific about data
parallel program flows, while available processing power of modern many core
hardware such as graphics processing units (GPUs) or coprocessors increases the
relevance of data parallelism for general-purpose computation.
  In this work, we introduce OpenCL-enabled actors to the C++ Actor Framework
(CAF). This offers a high level interface for accessing any OpenCL device
without leaving the actor paradigm. The new type of actor is integrated into
the runtime environment of CAF and gives rise to transparent message passing in
distributed systems on heterogeneous hardware. Following the actor logic in
CAF, OpenCL kernels can be composed while encapsulated in C++ actors, hence
operate in a multi-stage fashion on data resident at the GPU. Developers are
thus enabled to build complex data parallel programs from primitives without
leaving the actor paradigm, nor sacrificing performance. Our evaluations on
commodity GPUs, an Nvidia TESLA, and an Intel PHI reveal the expected linear
scaling behavior when offloading larger workloads. For sub-second duties, the
efficiency of offloading was found to largely differ between devices. Moreover,
our findings indicate a negligible overhead over programming with the native
OpenCL API.Comment: 28 page
Privacy Risk Assessment: From Art to Science, By Metrics

Privacy risk assessments aim to analyze and quantify the privacy risks
associated with new systems. As such, they are critically important in ensuring
that adequate privacy protections are built in. However, current methods to
quantify privacy risk rely heavily on experienced analysts picking the
"correct" risk level on e.g. a five-point scale. In this paper, we argue that a
more scientific quantification of privacy risk increases accuracy and
reliability and can thus make it easier to build privacy-friendly systems. We
discuss how the impact and likelihood of privacy violations can be decomposed
and quantified, and stress the importance of meaningful metrics and units of
measurement. We suggest a method of quantifying and representing privacy risk
that considers a collection of factors as well as a variety of contexts and
attacker models. We conclude by identifying some of the major research
questions to take this approach further in a variety of application scenarios
Analysing Soccer Games with Clustering and Conceptors

We present a new approach for identifying situations and behaviours, which we
call "moves", from soccer games in the 2D simulation league. Being able to
identify key situations and behaviours are useful capabilities for analysing
soccer matches, anticipating opponent behaviours to aid selection of
appropriate tactics, and also as a prerequisite for automatic learning of
behaviours and policies. To support a wide set of strategies, our goal is to
identify situations from data, in an unsupervised way without making use of
pre-defined soccer specific concepts such as "pass" or "dribble". The recurrent
neural networks we use in our approach act as a high-dimensional projection of
the recent history of a situation on the field. Similar situations, i.e., with
similar histories, are found by clustering of network states. The same networks
are also used to learn so-called conceptors, that are lower-dimensional
manifolds that describe trajectories through a high-dimensional state space
that enable situation-specific predictions from the same neural network. With
the proposed approach, we can segment games into sequences of situations that
are learnt in an unsupervised way, and learn conceptors that are useful for the
prediction of the near future of the respective situation.Comment: To appear in RoboCup 2017: Robot World Cup XXI; Springer, 201
Hierarchical Attribute-based Signatures. 17th International Conference, CANS 2018, Naples, Italy, September 30 – October 3, 2018

Attribute-based Signatures (ABS) are a powerful tool allowing users with attributes\ud
issued by authorities to sign messages while also proving that their attributes satisfy\ud
some policy. ABS schemes provide a \ud
exible and privacy-preserving approach to authentication\ud
since the signer's identity and attributes remain hidden within the anonymity set\ud
of users sharing policy-conform attributes. Current ABS schemes exhibit some limitations\ud
when it comes to the management and issue of attributes. In this paper we address the lack\ud
of support for hierarchical attribute management, a property that is prevalent in traditional\ud
PKIs where certification authorities are organised into hierarchies and signatures are verified\ud
along roots of trust.\ud
Hierarchical Attribute-based Signatures (HABS) introduced in this work support delegation\ud
of attributes along paths from the top-level authority down to the users while also ensuring\ud
that signatures produced by these users do not leak their delegation paths, thus extending\ud
the original privacy guarantees of ABS schemes. Our generic HABS construction also ensures\ud
unforgeability of signatures in the presence of collusion attacks and contains an extended\ud
traceability property allowing a dedicated tracing authority to identify the signer and reveal\ud
its attribute delegation paths. We include a public verification procedure for the accountability\ud
of the tracing authority.\ud
We anticipate that HABS will be useful for privacy-preserving authentication in applications\ud
requiring hierarchical delegation of attribute-issuing rights and where knowledge of delegation\ud
paths might leak information about signers and their attributes, e.g., in intelligent\ud
transport systems where vehicles may require certain attributes to authenticate themselves\ud
to the infrastructure but remain untrackable by the latter
Maintaining Diversity in Robot Swarms with Distributed Embodied Evolution

In this paper, we investigate how behavioral diversity can be maintained in evolving robot swarms by using distributed Embodied Evolution. In these approaches, each robot in the swarm runs a separate evolutionary algorithm, and populations on each robot are built through local communication when robots meet; therefore, genome survival results not only from fitness-based selection but also from spatial spread. To better understand how diversity is maintained in distributed EE, we propose a postanalysis diversity measure, that we take from two perspectives, global diversity (over the swarm), and local diversity (on each robot), on two swarm robotic tasks (navigation and item collection), with different intensities of selection pressure, and compare the results of distributed EE to a centralized case. We conclude that distributed evolution intrinsically maintains a larger behavioral diversity when compared to centralized evolution, which allows for the search algorithm to reach higher performances, especially in the more challenging collection task
Generating Magnetic Resonance Spectroscopy Imaging Data of Brain Tumours from Linear, Non-Linear and Deep Learning Models.

Magnetic Resonance Spectroscopy (MRS) provides valuable information to help with the identification and understanding of brain tumors, yet MRS is not a widely available medical imaging modality. Aiming to counter this issue, this research draws on the advancements  in  machine  learning  techniques  in  other  fields  for  the  generation  of  artificial  data. The generated methods were tested through the evaluation of their output against that of a real-world labelled MRS brain tumor data-set. Furthermore the resultant output from the generative techniques were each used to train separate traditional classifiers which were tested on a subset of the real MRS brain tumor dataset. The results suggest that there exist methods capable of producing accurate, ground truth based MRS voxels. These findings indicate that through generative techniques, large datasets can be made available for training deep, learning models for the use in brain tumor diagnosis