2000
Autores
Nunes, NJ; Cunha, JF;
Publicação
IEEE SOFTWARE
Abstract
Wisdom is a new software engineering method addressing the specific needs of small reams that develop and maintain interactive systems. Because Wisdom defines a process, notation, and project philosophy, it can smoothly be applied in small companies leveraging on their communication, speed, and flexibility.
2000
Autores
Borges, J; Levene, M;
Publicação
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
We propose a data mining model that captures the user navigation behaviour patterns. The user navigation sessions are modelled as a hypertext probabilistic grammar whose higher probability strings correspond to the user's preferred trails. An algorithm to efficiently mine such trails is given. We make use of the N gram model which assumes that the last N pages browsed affect the probability of the next page to be visited. The model is based on the theory of probabilistic grammars providing it with a sound theoretical foundation for future enhancements. Moreover, we propose the use of entropy as an estimator of the grammar's statistical properties. Extensive experiments were conducted and the results show that the algorithm runs in linear time, the grammar's entropy is a good estimator of the number of mined trails and the real data rules confirm the effectiveness of the model. © Springer-Verlag Berlin Heidelberg 2000.
2000
Autores
Borges, J; Levene, M;
Publicação
Electronic Commerce and Web Technologies - Lecture Notes in Computer Science
Abstract
2000
Autores
Borges, J; Levene, M;
Publicação
SIGKDD Explor. Newsl. - ACM SIGKDD Explorations Newsletter
Abstract
1999
Autores
Alves, JC; Ferreira, JC; Albuquerque, C; Oliveira, JF; Ferreira, JS; Matos, JS;
Publicação
7th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM '99), 21-23 April 1999, Napa, CA, USA
Abstract
The nesting problem consists of defining the cutting plan of a piece of raw material in smaller irregular shapes, and has applications in the apparel and footwear industries. Due to its NP-hard nature, the optimal solution can only be guaranteed by exhaustively trying all possible solutions and choosing the best one. Because this is impractical in real-life industrial problems, automatic approaches are based on optimization meta-heuristics that search for sub-optimal but good enough solutions. These optimization techniques rely on the construction and evaluation of several solutions, thus requiring heavy geometric manipulation of the irregular polygons that constitute the problem data. Efficient processing of this geometric information is thus necessary to make effective fully automatic approaches to nesting problems in industrial environments. This paper describes Fafner, an FPGA-based custom computing machine that is used to accelerate the geometric operations, that are in the core of heuristic solutions to the nesting problem. The system is used as an auxiliary processor attached to a low cost personal computer, and combines a custom programmable processor with an array of custom circuits for the processing of irregular polygons.
1999
Autores
Costa, MT; Ferreira, JS;
Publicação
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Abstract
The paper concerns a flexible flowline scheduling problem, which arises in the footwear industry. Flexibility of the line allows for manufacturing simultaneously more products in lower quantities, but it also increases the complexity of the task of balancing the line, specially because the mix of products changes everyday. A simulation model to deal with the flexible line is developed and several job sequencing rules and different part input criteria are implemented. The impact of each rule on the quality of the schedules is measured, namely, according to makespan, productivity and average machine utilisation. Computational results concerning a real application are also presented. SIMPLE++ is the simulation language used.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.