Desenvolupament d'un agent intel·ligent dins el marc de la competició TAC SCM

Aquest projecte està emmarcat dins el grup eXiT d’Intel•lig`encia Artificial del Departament d’Electrònica i Automàtica (EIA) de la Universitat de Girona. Pertany a l’àmbit de la Intel•ligència Artificial i, concretament, en l’apartat d’agents intel•ligents. En el nostre cas, tractarem el desenvolupament d’un agent intel•ligent en un entorn determinat, el de la gestió d’una cadena de producció. Amb l’objectiu de proporcionar un marc experimental on provar diferents tecnologies de suport a la gestió de la cadena de producció, la comunitat d’investigadors va proposar una competició internacional: la Trading Agent Competiton (TAC). En aquesta competició existeixen diferents modalitats. En particular, la Swedish Institution of Computer Science (SICS), juntament amb la Carnegie Mellon University de Pittsburg, Minnesotta, van proposar al 2003 un escenari de muntatge de PC’s basat en el proveïment de recursos, l’embalatge de PC’s i les ventes a clients. Aquesta modalitat és coneguda com a TAC-SCM (Supply Chain Management)

Computer Theorem Proving and HoTT

Theorem-proving is a one-player game. The history of computer programs being the players goes back to 1956 and the ‘LT’ LOGIC THEORY MACHINE of Newell, Shaw and Simon. In game-playing terms, the ‘initial position’ is the core set of axioms chosen for the particular logic and the ‘moves’ are the rules of inference. Now, the Univalent Foundations Program at IAS Princeton and the resulting ‘HoTT’ book on Homotopy Type Theory have demonstrated the success of a new kind of experimental mathematics using computer theorem proving.

Paged similarity queries

An important feature of a database management systems (DBMS) is its client/server architecture, where managing shared memory among the clients and the server is always an tough issue. However, similarity queries are specially sensitive to this kind of architecture, since the answer sizes vary widely. Usually, the answers of similarity query are fully processed to be sent in full to the user, who often is interested in just parts of the answer, e.g. just few elements closer or farther to the query reference. Compelling the DBMS to retrieve the full answer, further ignoring its majority is at least a waste of server processing power. Paging the answer is a technique that splits the answer onto several pages, following client requests. Despite the success of paging on traditional queries, little work has been done to support it in similarity queries. In this work, we present a technique that not only provides paging in similarity range or k-nearest neighbor queries, but also supports them in two variations: the forward similarity query and the backward similarity query. They return elements either increasingly farther of increasingly closer to the query reference. The reported experiments show that, depending on the proportion of the interesting part over the full answer, both techniques allow answering queries much faster than it is obtained in the non-paged way. (C) 2010 Elsevier Inc. All rights reserved.

Seamlessly integrating similarity queries in SQL

Modern database applications are increasingly employing database management systems (DBMS) to store multimedia and other complex data. To adequately support the queries required to retrieve these kinds of data, the DBMS need to answer similarity queries. However, the standard structured query language (SQL) does not provide effective support for such queries. This paper proposes an extension to SQL that seamlessly integrates syntactical constructions to express similarity predicates to the existing SQL syntax and describes the implementation of a similarity retrieval engine that allows posing similarity queries using the language extension in a relational DBM. The engine allows the evaluation of every aspect of the proposed extension, including the data definition language and data manipulation language statements, and employs metric access methods to accelerate the queries. Copyright (c) 2008 John Wiley & Sons, Ltd.

Protocols between programs and proofs

In this paper we describe a new protocol that we call the Curry-Howard protocol between a theory and the programs extracted from it. This protocol leads to the expansion of the theory and the production of more powerful programs. The methodology we use for automatically extracting “correct” programs from proofs is a development of the well-known Curry-Howard process. Program extraction has been developed by many authors, but our presentation is ultimately aimed at a practical, usable system and has a number of novel features. These include 1. a very simple and natural mimicking of ordinary mathematical practice and likewise the use of established computer programs when we obtain programs from formal proofs, and 2. a conceptual distinction between programs on the one hand, and proofs of theorems that yield programs on the other. An implementation of our methodology is the Fred system. As an example of our protocol we describe a constructive proof of the well-known theorem that every graph of even parity can be decomposed into a list of disjoint cycles. Given such a graph as input, the extracted program produces a list of the (non-trivial) disjoint cycles as promised.

Otimização da distância de extração de madeira com forwarder

The activities and management operations of wood harvesting do not have good computational tools available to help the forest technicians with the task of cost reduction. In many cases, machines of high investment are used in wood harvesting without adequate operation planning; consequently, the cost per hour of these machines, which is high, could be reduced. Using technological resources such as the Geographic Information Systems (GIS) integrated with the Global Positioning System (GPS), which are the basis of precision harvesting. In this research, a technological tool capable of calculating and optimizing the average skidding distance of the forwarder was developed. It was used in stands of different sizes and formats through mathematical techniques and available functionalities in the Geographic Information System GRASS. The developed tool, called optimized model, divides the stand in small parts in relation to shorter skidding distances. The main variable considered was the alignment of plantation. The model was tested in eucalypt stands located in the State of São Paulo. Sixteen stands were randomly selected: eight with a rectangular polygon form, and eight with irregular polygon form. The main variables were collected in these stands. Results showed that the optimized model developed, is efficient and flexible. It was possible to divide the stands in small parts resulting in smaller skidding medium distances. The stands with irregular form had shorter skidding medium distances than the rectangular stands.

The use of molecular spectra simulation for diagnostics of reactive flows

The C 2 * radical is used as a system probe tool to the reactive flow diagnostic, and it was chosen due to its large occurrence in plasma and combustion in aeronautics and aerospace applications. The rotational temperatures of C 2 * species were determined by the comparison between experimental and theoretical data. The simulation code was developed by the authors, using C++ language and the object oriented paradigm, and it includes a set of new tools that increase the efficacy of the C 2 * probe to determine the rotational temperature of the system. A brute force approach for the determination of spectral parameters was adopted in this version of the computer code. The statistical parameter c 2 was used as an objective criterion to determine the better match of experimental and synthesized spectra. The results showed that the program works even with low-quality experimental data, typically collected from in situ airborne compact apparatus. The technique was applied to flames of a Bunsen burner, and the rotational temperature of ca. 2100 K was calculated.

Argentina: recent dynamics in the software and IT services industry

Includes bibliography.

Preservação digital na gestão da informação: um modelo processual para as instituições de ensino superior

Pós-graduação em Ciência da Informação - FFC

Gerenciamento de transação e mecanismo de serialização baseado em Snapshot

Pós-graduação em Ciência da Computação - IBILCE

North Central Risk Management Education Center

The North Central Risk Management Education Center has been providing program coordination for extension risk management education in the North Central Region since 2001. During this time, nearly five million dollars has been awarded to public, private and non-profit entities to carry out producer-focused, results-based risk management education programs. The North Central Region includes Illinois, Indiana, Iowa, Kansas, Michigan, Minnesota, Missouri, Nebraska, Ohio, North Dakota, South Dakota and Wisconsin.

U.S. utilities' experiences with the implementation of energy efficiency programs

In the U.S., many electric utility companies are offering demand-side management (DSM) programs to their customers as ways to save money and energy. However, it is challenging to compare these programs between utility companies throughout the U.S. because of the variability of state energy policies. For example, some states in the U.S. have deregulated electricity markets and others do not. In addition, utility companies within a state differ depending on ownership and size. This study examines 12 utilities’ experiences with DSM programs and compares the programs’ annual energy savings results that the selected utilities reported to the Energy Information Administration (EIA). The 2009 EIA data suggests that DSM program effectiveness is not significantly affected by electricity market deregulation or utility ownership. However, DSM programs seem to generally be more effective when administered by utilities located in states with energy savings requirements and DSM program mandates.

Tailored instructional methods for students with diverse levels of computer knowledge and skills

The purpose of this online course is to ensure new nursing graduate students know how to use computer technologies required to complete academic and research activities. Powerful computers, high speed internet, digitalized resources and databases are widely available in educational institutes. New renovation and updates are being released at faster pace than ever. All these developments are necessary for a student to utilize computer programs and synthesize large amount of data in a limited time for any given academic research project. [See PDF for complete abstract]