Article

Subject description in the Academic Metadata Format

January 2003

Authors:

University of Valencia

In this paper we deal with the problem of classification coding in a metadata format called AMF (Academic Metadata Format). AMF emphases the separate description of persons and institutions. AMF is encoded in XML. In general, subject classification representation using XML is still in an initial research status. We present here several alternatives that could be used to carry out this task.

ResearchGate has not been able to resolve any citations for this publication.

ResearchGate has not been able to resolve any references for this publication.

Article

Bi-Hamiltonian representation of Stackel systems

June 2009 · Physical Review E

Maciej Blaszak

It is shown that linear separation relations are fundamental objects for integration by quadratures of Stäckel-separable Liouville-integrable systems (the so-called Stäckel systems). These relations are further employed for the classification of Stäckel systems. Moreover, we prove that any Stäckel-separable Liouville-integrable system can be lifted to a bi-Hamiltonian system of ... [Show full abstract] Gel'fand-Zakharevich type. In conjunction with other known result this implies that the existence of bi-Hamiltonian representation of Liouville-integrable systems is a necessary condition for Stäckel separability.

Data

Full-text available

Supplemental Information 2

September 2016

Observed serum levels of C-reactive protein relative to rank and dominance certainty for males and females. Raw values of CRP. A and B depict effects for CRP for males and females, respectively. Separate lines represent different levels of dominance certainty.

View full-text

Article

Learning with Feature Partitions

March 1994

This report presents a new methodology of learning from examples, based on feature partitioning . Classification by Feature Partitioning (CFP) is a particular implementation of this technique, which is an inductive, incremental, and supervised learning method. Learning in CFP is accomplished by storing the objects separately in each feature dimension as disjoint partitions of values. A partition, ... [Show full abstract] a basic unit of representation which is initially a point in the feature dimension, is expanded through generalization. The CFP algorithm specializes a partition by subdividing it into two subpartitions. Theoretical (with respect to PAC--model) and empirical evaluation of the CFP is presented and compared with some other similar techniques.

Article

Understanding school refusal: A psychodynamic view

January 2000

J. Edwards

This article looks at the phenomenon of school refusal with a particular emphasis on cases where separation anxiety proves to be a feature either present in the child or projected from another family member and relocated in the child or young person. Classification is discussed and research quoted which indicates the different factors involved in the symptom. School refusal is here conceptualised ... [Show full abstract] within a psycho-dynamic framework with particular reference to attachment theory and to the importance of family dynamics. The author concludes that underlying factors to do with separation difficulties emerge at times of crisis or change, specifically those to do with changes of school, and that in most cases the symptom of refusal has been building up over years because of earlier failures to achieve adequate separation.

Conference Paper

Full-text available

Improved antidictionary based compression

February 2002

The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called "antifactors") never appear in the text. Let sb be an antifactor where b is its last bit. Every time s appears in the text we know that the next bit is b~ and hence omit its representation. Since building the set of all antifactors is space consuming at compression time, it ... [Show full abstract] is customary to limit the maximum length of antifactors considered up to a constant k. Larger k yields better compression of the text but requires more space at compression time. In this paper we introduce the notion of almost antifactors, which are strings that rarely appear in the text. More formally, almost antifactors are strings that, if we consider them as antifactors and separately code their occurrences as exceptions, the compression ratio improves. We show that almost antifactors permit improving compression with a limited amount of main memory to compress. Our experiments show that they obtain the same compression of the classical algorithm using only 30%-55% of its memory space.

View full-text

Article

Full-text available

Representable Lexicographic Products

February 2004 · Order

Alfio Giarlotta

A linear ordering is said to be representable if it can be order-embedded into the reals. Representable linear orderings have been characterized as those which are separable in the order topology and have at most countably many jumps. We use this characterization to study the representability of a lexicographic product of linear orderings. First we count the jumps in a lexicographic product in ... [Show full abstract] terms of the number of jumps in its factors. Then we relate the separability of a lexicographic product to properties of its factors, and derive a classification of representable lexicographic products.

View full-text

Conference Paper

On Combining Discretisation Parameters and Attribute Ranking for Selection of Decision Rules

July 2017 · Lecture Notes in Computer Science

The paper describes research on filtering decision rules with continuous and discretised condition attributes while combining characteristics of these attributes returned from supervised discretisation with their ranking. Numbers of intervals required for partitioning of attributes values imposed their grouping into corresponding categories, and for each group separately ranking procedures with ... [Show full abstract] Relief algorithm were executed. Information about numbers of bins combined with ranking positions were next exploited for selection of rules induced within rough set approaches. Filtering rules was performed directly by their conditions, or by calculating defined measures based on attribute weights, returning shortened decision algorithms with at least the same or improved classification accuracy.

Conference Paper

Full-text available

Phase And Amplitude Coding Separation Based On The Injection‐Locked Single‐Mode VCSEL

August 2017

Information capacity of commercial channels can be doubled by a simultaneous independent phase and amplitude modulation without coherent detection. Separation of the phase and amplitude modulation has been demonstrated by the use of VCSEL.

View full-text

Article

Full-text available

A Comparison of an Oligopoly Game and the N-Person Iterated Prisoner's Dilemma

January 1999

We review and analyze a recently proposed model of an Oligopoly Game. From a theoretical investigation of the payoff scheme, we confirm that it cannot be a true representation of the N -Person Iterated Prisoner's Dilemma. From an empirical investigation of the model's parameters, we show which are crucial to the evolution of cooperation. We compare these results with a separate set of simulations ... [Show full abstract] of the abstract NIPD.

View full-text

Article

Full-text available

Factored Latent Analysis for far-field tracking data

July 2012

Chris Stauffer

This paper uses Factored Latent Analysis (FLA) to learn a factorized, segmental representation for observations of tracked objects over time. Factored Latent Analysis is latent class analysis in which the observation space is subdivided and each aspect of the original space is represented by a separate latent class model. One could simply treat these factors as completely independent and ignore ... [Show full abstract] their interdependencies or one could concatenate them together and attempt to learn latent class structure for the complete observation space. Alternatively, FLA allows the interdependencies to be exploited in estimating an effective model, which is also capable of representing a factored latent state. In this paper, FLA is used to learn a set of factored latent classes to represent different modalities of observations of tracked objects. Different characteristics of the state of tracked objects are each represented by separate latent class models, including normalized size, normalized speed, normalized direction, and position. This model also enables effective temporal segmentation of these sequences. This method is data-driven, unsupervised using only pairwise observation statistics. This data-driven and unsupervised activity classi- fication technique exhibits good performance in multiple challenging environments.

View full-text

Conference Paper

Decision fusion for writer discrimination

August 1997

In this work the performance improvement of a one-word-based writer discrimination system is described. This is achieved when decision fusion is employed to combine the classification results (decisions) from N words. Only the binary classification problem (discriminate between two persons) is examined. In the proposed approach the randomized Neyman-Pearson (N-P) test is applied. A special case ... [Show full abstract] of feature statistics is considered in order to fit the randomized N-P test and simultaneously achieve minimum classification error for each separate decision. Using only a few words the performance of the discrimination system is radically improved as far as the maximum classification error is concerned

Conference Paper

Full-text available

QoS-aware Mobile Middleware for Video Streaming

January 2005

State-of-the-art middleware and component technologies lack support for quality of service (QoS) management. Application developers, therefore, integrate QoS mechanisms into the application itself. In this paper, we propose a solution for how a mobile middleware can take on the responsibility for QoS management. We use a video streaming scenario to identify the QoS mechanisms that the middleware ... [Show full abstract] must manage on behalf of the application, and we demonstrate the feasibility of our solution within this scenario. The key concept of our work is the service plan that specifies the service and the QoS of components and compositions. Using service plans recursively, we model alternative application configurations such that a QoS-aware middleware platform can safely configure and dynamically reconfigure applications, based on user requirements and resource availability. In this paper, we show that service plans enables the separation of application design from QoS management, in a way that promote reuse of both functional code and QoS mechanisms.

View full-text

Subject description in the Academic Metadata Format

Abstract

No full-text available

Recommended publications

Bi-Hamiltonian representation of Stackel systems

Supplemental Information 2

Learning with Feature Partitions

Understanding school refusal: A psychodynamic view

Improved antidictionary based compression

Representable Lexicographic Products

On Combining Discretisation Parameters and Attribute Ranking for Selection of Decision Rules

Phase And Amplitude Coding Separation Based On The Injection‐Locked Single‐Mode VCSEL

A Comparison of an Oligopoly Game and the N-Person Iterated Prisoner's Dilemma

Factored Latent Analysis for far-field tracking data

Decision fusion for writer discrimination

QoS-aware Mobile Middleware for Video Streaming