127 research outputs found
Stockbot: A Monitoring and Acting Software Agent for Stock Market
No full textStockbot is a software agent designed for the task of monitoring an electronic stock market in order to execute investor purchase or sale orders. Stockbot represents a tool for managing the dynamical complexity of electronic stock markets by establishing a virtual portfolio manager. Its main goal is to exhibit a behaviour which is a timely, continuous, dynamical response to changes in the market situations in accordance to the user profile and goals. The software agent maintains and dynamically updates a user model which records histories of previous user orders, patterns of user observed behaviour, and user preferences and goals. The software architecture integrates conventional and knowledge-based software technologies such as conditional and iterative planning, continuous conditions monitoring, robust failure management, inter-agent communication primitives and events networks. A Dynamical Query Language is used to describe stockbot behaviour
An Architecture for Evolutionary Adaptive Web Systems
No full textThis paper present an architecture based on evolutionary genetic algorithms for generating online adaptive services. Online adaptive systems provide flexible services to a mass of clients/users for maximising some system goals, they dynamically adapt the form and the content of the issued services while the population of clients evolve over time. The idea of online genetic algorithms (online GAs) is to use the online clients response behaviour as a fitness function in order to produce the next generation of services. The principle implemented in online GAs, "the application environment is the fitness", allow to model highly evolutionary domains where both services providers and clients change and evolve over time. The flexibility and the adaptive behaviour of this approach seems to be very relevant and promising for applications characterised by highly dynamical features such as in the web domain (online newspapers, e-markets, websites and advertising engines). Nevertheless the proposed technique has a more general aim for application environments characterised by a massive number of anonymous clients/users which require personalised services, such as in the case of many new IT applications
On blocking sets of inversive planes
No full textLet S be a blocking set in an inversive plane of order q. It was shown by Bruen
and Rothschild [1] that |S| >= 2q for q >= 9. We prove that if q is sufficiently large, C is a fixed
natural number and |S| = 2q + C, then roughly 2/3 of the circles of the plane meet S in one
point and 1/3 of the circles of the plane meet S in four points. The complete classification
of minimal blocking sets in inversive planes of order q <= 5 and the sizes of some examples
of minimal blocking sets in planes of order q <= 37 are given. Geometric properties of
some of these blocking sets are also studied
Constructions of small complete arcs with prescribed symmetry
No full textWe use arcs found by Storme and van Maldeghem
in their classification of primitive arcs in PG(2,q)
as seeds for constructing small complete arcs in these planes.
Our complete arcs are obtained by taking the union of
such a ``seed arc'' with some orbits of a subgroup of its stabilizer.
Using this approach we construct
five different complete 15-arcs fixed by Z_3 in PG(2,37),
a complete 20-arc fixed by S_3 in PG(2,61),
and two different complete 22-arcs fixed by D_5 in PG}(2,71).
In all three cases, the size of complete arcs constructed
in this paper is strictly smaller than the size of the smallest
complete arcs (in the respective plane) known so far
Classification of linear codes by preclassification
No full textWe consider the problem of computing the equivalence classes of a set of linear codes. We propose a technique that, exploiting an invariant simple to compute, allows to reduce the computational complexity of the classification process
The Pace code, the Mathieu group <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml1" display="inline" overflow="scroll" altimg="si1.gif"><mml:msub><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mn>12</mml:mn></mml:mrow></mml:msub></mml:math> and the small Witt design <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="mml2" display="inline" overflow="scroll" altimg="si2.gif"><mml:mi>S</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo>,</mml:mo><mml:mn>12</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>
No full textA ternary [66,10,36]3-code admitting the Mathieu group M12 as a group of automorphisms has recently been constructed by N. Pace, see Pace (2014). We give a construction of the Pace code in terms of M12 as well as a combinatorial description in terms of the small Witt design, the Steiner system S(5,6,12). We also present a proof that the Pace code does indeed have minimum distance 36
Minimal 1-saturating sets and complete caps in binary projective geometries
No full textConstructions of minimal 1-saturating sets and complete caps in binary projective spaces PG(v,2) are described. The complete classification of minimal 1-saturating sets and complete caps in small geometries is obtained
- …
