ppxscal/embedding_network huggingface dataset:
Reflective practice, artificial intelligence, and engineering design: Common trends and interrelationships
Authors: W. P. S. Dias
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

Some historical and current trends in reflective practice (RP), artificial intelligence (AI), and engineering design (ED) are presented and compared. Human artistry, context, and connectionist approaches to knowledge are the common threads highlighted. ED is considered to be a type of RP and AI a part of RP. This is supported by an analysis of the transformation processes involved in each. AI and systems are presented as approaches for the formalization of RP at the technical and conceptual levels, respectively. Interconnectedness in a hierarchical fashion and purposeful process loops are defined as the key ingredients of a systems approach. AI techniques that could support a range of ED categories (case-based reasoning, decomposition, and transformation) are identified, as are the wider RP approaches that subsume those categories. The ED, AI, and RP categories are identified as spanning from routine to creative, connectionist to cognitivist, and intuitive to deliberate, respectively.
Minimum normal approximation error bandwidth selection for averaged derivatives
Authors: Y. Nishiyama
Venue: Mathematics and Computers in Simulation (2004)

Density-weighted averaged derivative estimator gives a computationally convenient consistent and asymptotically normally (CAN) distributed estimate of the parametric component of a semiparametric single index model. This model includes some important parametric models as special cases such as linear regression, Logit/Probit, Tobit and Box-Cox and other transformation models. This estimator involves a nonparametric kernel density estimate and thus it faces the problem of bandwidth selection. A reasonable way of bandwidth selection for point estimation is one minimizing the mean squared error. Alternatively, for the purposes of hypothesis testing and confidence interval estimation, we may like to choose it such that it minimizes the normal approximation error. The purpose of this paper is to propose a new bandwidth suitable for these purposes by minimizing the normal approximation error in the tail of exact distribution of the statistics using higher order asymptotic theory of Edgeworth expansion or bootstrap method.
Apache Cookbook
Authors: Rich Bowen, Ken Coar
Venue:  (2003)

The Apache Cookbook is a collection of problems, solutions, and practical examples for webmasters, web administrators, programmers, and everyone else who works with Apache. Instead of poking around mailing lists, online documentation, and other sources, you can rely on the Apache Cookbook for quick solutions to common problems, and then you can spend your time and energy where it matters most.
Extracting movement patterns using fuzzy and neurofuzzy approaches
Authors: M. Kate Beard
Venue:  (2003)

Several applications generate large volumes of data on movements including vehicle navigation, fleet management, wildlife tracking and in the near future cell phone tracking. Such applications require support to manage the growing volumes of movement data. Understanding how an object moves in space and time is fundamental to the development of an appropriate movement model of the object. Many objects are dynamic and their positions change with time. The ability to reason about the changing positions of moving objects over time thus becomes crucial. Explanations on movements of an object require descriptions of the patterns they exhibit over space and time. Every moving object exhibits a wide range of patterns some of which repeat but not exactly over space and time such as an animal foraging or a delivery truck moving about a city. Even though movement patterns are not exactly the same, they are not completely different. Moving objects may move on the same or nearly similar paths and visit the same locations over time. This thesis addresses the identification of repeat movement patterns from large volumes of data. These are represented as higher-level movement structures referred to as movement signatures. Movement signatures are defined as collections of patterns that objects demonstrate in their sequences of movements. Signatures have a spatial structure that includes dominant or frequently visited locations and paths and a spatio-temporal structure that associates a temporal pattern with the spatial patterns. This thesis demonstrates the extraction of movement signatures from sets of movement observations using fuzzy and Neuro-fuzzy methodologies. Identification of movement signatures and definition of their attributes provides summary level information for modeling and reasoning about moving objects.
The stepping stones project
Authors: Hilary Bentley, Dr Jenny Davies, Dr Jo Allan
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Widening participation in higher education institutions is bringing about major changes to the student profile. New universities, especially, have found that a higher proportion of students now come from non-traditional backgrounds. Since there is seen to be a correlation between increasing access to students from non-traditional backgrounds and higher drop-out rates [1] this trend presents problems in terms of achievement, progression and retention.Meeting the diverse needs of students will accelerate changes already underway to enhance teaching and learning in universities, but there are obstacles, particularly the reluctance to bring about changes to the curriculum design and delivery in case standards should become diluted.In line with results obtained nationally, statistical examination of our first-year database showed that students with a GNVQ background had an enhanced risk of non-completion. The learning styles and strategies adopted by students and the particular further education institution where they previously studied are also thought to be influential in determining a student's chance of success. It is therefore vital that changes to curriculum, delivery, assessment and support are underpinned by detailed knowledge of the approaches to learning adopted by our students, and those factors which enable and encourage students to adopt a deep approach to learning, since a student's approach to a given learning activitiy depends upon his or her perception of the requirements of the task [2].A longitudinal study is underway to investigate the influence of entrance qualification, feeder institution, learning styles and achievement at level one. The research aims to enable early detection of students at risk of being unsuccessful and to identify the factors within the further education environment that lead to successful learning in higher education. The poster will outline the underlying issues, the rationale and the approach being taken.
Integration of CASE into undergraduate education
Authors: Jeffrey J. Joyce
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

This paper reports on the results (so far) of a three year project to integrate commercial CASE (Computer Aided Software Engineering) methodologies and tools into Computer Science undergraduate education at the University of British Columbia. We outline the main objectives of this initiative, choices made, implementation and difficulties encountered. We also offer some suggestions to CASE vendors for improving the chances of having their tools used successfully in educational programs.
A Memory Built-In Self-Repair for High Defect Densities Based on Error Polarities
Authors: M. Nicolaidis, N. Achouri, L. Anghel
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

This paper presents the architecture of a new memory Built-In Self-Repair approach targetingmemories affected by high defect densities (several orders of magnitude higher than in currenttechnologies). Such repair scheme is suitable for building memories in nano-technologies, which are subject to very high defect densities. The new approach allows combining two defected units to create a fault-free unit. For making this combination possible, the approach analyses the polarities of the errors produced by the faulty units of the memory, and combines units producing the same error polarities. The combination is done by means of functions that mask the errors of a particular polarity.
UbiData: ubiquitous mobile file service
Authors: Jinsuo Zhang, Abdelsalam (Sumi) Helal, Joachim Hammer
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

One of the most challenging objectives of mobile data management is the ubiquitous, any time, anywhere access. This objective is very difficult to meet due to several network and mobile device limitations. Optimistic data replication is a generally agreed upon approach to alleviating the difficulty of data access in the adverse mobile environment. However, the two currently most popular models, both Client/Server and Peer-to-Peer models, do not adequately meet the ubiquity objectives. In our views, mobile data management should adequately support access to any data source, from any mobile device. It should also eliminate user involvement by automating data selection, hoarding, and synchronization, regardless of the mobile device chosen by the user. In this paper, we present UbiData: an application-transparent, double-middleware architecture that addresses these challenges. UbiData supports access and update to data from heterogeneous sources (e.g. files belonging to different file systems). It provides for the automatic and device-independent selection, hoarding, and synchronization of data. We present the UbiData architecture and system component, and evaluate the effectiveness of UbiData's automatic data selection and hoarding mechanisms.
Attraction Rates, Robustness, and Discretization of Attractors
Authors: Lars Grüne
Venue: SIAM Journal on Numerical Analysis (2003)

We investigate necessary and sufficient conditions for the convergence of attractors of discrete time dynamical systems induced by numerical one-step approximations of ODEs to an attractor for the approximated ODE. We show that both the existence of uniform attraction rates (i.e., uniform speed of convergence toward the attractors) and uniform robustness with respect to perturbations of the numerical attractors are necessary and sufficient for this convergence property. In addition, we can conclude estimates for the rate of convergence in the Hausdorff metric.
Efficient Storage Scheme for Precalculated Wigner 3j, 6j and Gaunt Coefficients
Authors: J. Rasch, A. C. H. Yu
Venue: SIAM Journal on Scientific Computing (2003)

Efficient storage schemes are presented for storing Clebsch--Gordan, Wigner 3j and 6j symbols, as well as Gaunt coefficients, which are the integral over three spherical harmonics. Use is hereby made of the large number of symmetries which these symbols exhibit. Computer codes have been written and benchmarked against well-known published programs which usually use recursion relations for the evaluation. It is shown that our codes can be an order of magnitude or more faster in execution speed, maintaining full double precision accuracy.
Generalized hashing and parent-identifying codes
Authors: Noga Alon, Gérard Cohen, Michael Krivelevich, Simon Litsyn
Venue: Journal of Combinatorial Theory Series A (2003)

Let C be a code of length n over an alphabet of q letters. For a pair of integers 2 ≤ t > u, C is (t,u)-hashing if for any two subsets T, U ⊂C, satisfying T ⊂ U, |T| = t, |U| = u, there is a coordinate 1 ≤ i ≤ n such that for any x ∈ T, y ∈ U - x, x and y differ in the ith coordinate. This definition, generalizing the standard notion of a t-hashing family, is motivated by an application in designing the so-called parent identifying codes, used in digital fingerprinting. In this paper, we provide lower and upper bounds on the best possible rate of (t, u)-hashing families for fixed t, u and growing n. We also describe an explicit construction of (t, u)-hashing families. The obtained lower bound on the rate of (t, u)-hashing families is applied to get a new lower bound on the rate of t-parent identifying codes.
Orion-RE: A Component-Based Software Reengineering Environment
Authors: Alexandre Alvaro, Daniel Lucrédio, Vinicius Cardoso Garcia, Antonio Francisco do Prado, Luis Carlos Trevelin, Eduardo Santana de Almeida
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Software reuse is the process of implementing or updatingsoftware systems using existing software assets, resultingin a software quality increase, productivity and reducingtime to market. One way to achieve reuse is throughsoftware reengineering. This papers presents Orion-RE, aComponent-Based Software Reengineering Environmentthat uses software reengineering and component-baseddevelopment techniques to rebuilt legacy systems, reusingtheir available documentation and knowledge embedded inthe code. Orion-RE integrates several tools: a softwaretransformation system, modeling/development tools, asoftware artifacts repository, and a middleware platform.A software process model drives the environment usagethrough the reverse engineering, to recover the systemdesign, and forward engineering, where the system isrebuilt using modern technologies, such as designpatterns, frameworks, CBD principles and middleware.
Codewitz: producing interactive elearning material for beginners in programming
Authors: Esa Kujansuu, Marko Kulmala
Venue: ACM SIGCSE Bulletin (2003)

The students of basic programming courses encounter often very serious learning problems. This is mostly due to the fact that even basic programming concepts and structures are abstract and need to be understood before a student can learn more practical issues. If these concepts remain hidden for the students they tend to drop out or finish the course with low marks when trying to learn more advanced concepts without the basic knowledge. To avoid the drop out problem there has to be an effective way to help the students with difficulties during the first steps of programming studies. It is a fact that there hardly ever exists any extra resource for these students. With interactive material the students can try by themselves to reach such level of skills to be able to learn more.Codewitz-project was set up to try to correct this problem in basic programming courses. The basic idea of the project is based upon the idea of sharing. There are three main goals in this project:Developing and producing interactive material for basic programming coursesImplementing a material bank for storing and sharing the resource with the project partnersCreating a functioning network of experts who deal with this problem every day.This demonstration will illustrate the idea of the material, the production process and the use of it. The project is open to any institution interested in taking part in the development work. The project website: http://www.codewitz.net.
Geometry of Interaction and linear combinatory algebras
Authors: Samson Abramsky, Esfandiar Haghverdi, Philip Scott
Venue: Mathematical Structures in Computer Science (2002)

We present an axiomatic framework for Girard's Geometry of Interaction based on the notion of linear combinatory algebra. We give a general construction on traced monoidal categories, with certain additional structure, that is sufficient to capture the exponentials of Linear Logic, which produces such algebras (and hence also ordinary combinatory algebras). We illustrate the construction on six standard examples, representing both the &lsquo;particle-style&rsquo; as well as the &lsquo;wave-style&rsquo; Geometry of Interaction.
Fast multipattern search algorithms for intrusion detection
Authors: Josué Kuri, Gonzalo Navarro, Ludovic Mé
Venue: Fundamenta Informaticae (2002)

We present new search algorithms to detect the occurrences of any pattern from a given pattern set in a text, allowing in the occurrences a limited number of spurious text characters among those of the pattern. This is a common requirement in intrusion detection applications. Our algorithms exploit the ability to represent the search state of one or more patterns in the bits of a single machine word and update all the search states in a single operation. We show analytically and experimentally that the algorithms are able of fast searching for large sets of patterns allowing a wide number of spurious characters, yielding in our machine about a 75-fold improvement over the classical dynamic programming algorithm.
A high fidelity reconstruction of ancient Egypt: the temple of Kalabsha
Authors: Veronica Sundstedt, Alan Chalmers, Philippe Martinez
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

Accurate light simulation is of highest importance in archaeological reconstructions when you want to investigate how a site might have looked like in the past. Failure to use the highest fidelity means there is a very real danger of misrepresenting the past. This sketch describes the high fidelity reconstruction and realistic lighting simulation of an ancient Egyptian temple.
Echo-cardiography on the Web: design and set-up of a virtual community of experts
Authors: Enrico Frumento, Enrico Bianchin, Lorenzo Guerriero
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Nowadays digital ultrasound-cardiovascular devices are able to send out directly digital images and films (still and loop modes). Thanks to the large adoption of such devices, the echocardiographic world is facing new ways of exchanging images and collaborate. What we present in this paper is a Digital Echo-Lab System composed by a web site, supporting and coordinating the work of specialists and a teleconsulting desktop application for second opinion (CAROLIN), designed around echo-cardiography needs. The web solution is suitable for echocardiography because stored loops have dimensions, which are compatible (in terms of Mbytes) with present Internet bandwidth limitations. The web site is integrated with a largely adopted Peer-2-Peer telemedicine teleconsultation tool (CAROLIN) allowing it to act as a bridge between CAROLIN's world and on-line web information sharing (suitable for students or virtual communities). We will also discuss the modeling process adopted to catch real users' needs: in most cases users do not have clear visions of how such technologies could improve their work and also developers do not know details of physicians work, that is why we need a precise modeling process.
Automatic Generation of High-Quality Building Models from Lidar Data
Authors: Franz Rottensteiner
Venue: IEEE Computer Graphics and Applications (2003)

This article presents a method for the automated generation of 3D building models from directly observed point clouds generated by Lidar. Building regions are detected automatically, and then a curvature-based segmentation technique detects roofs. These roof planes are grouped to create polyhedral building models. In this grouping process, the shapes of the roof plane boundaries are determined, and the whole model is improved by an overall adjustment using all available sensor information and, if possible, geometric constraints. The article describes the existing modules and those still in the implementation phase, and discusses the issue of integrating aerial images into the reconstruction process to increase the geometric quality of the reconstructed models.
Advanced AI Search Techniques in Modern Digital Circuit Synthesis
Authors: Lech Jóźwiak
Venue: Artificial Intelligence Review (2003)

Progress in microelectronic technology is extremely fast and it is outstripping the designers' abilities to make use of the created opportunities. Development and application of new more suitable design methods and tools is therefore very important for the modern system industry. This paper shows the importance of the AI search techniques for the circuits and systems design space exploration, explains what sorts of search techniques are useful for this aim, and discusses the place, role and way of use of these techniques in circuit and system design. In particular, the paper explains the importance and usage of the heuristic search techniques for the automatic construction and selection of the most promising solutions to the circuit synthesis problems. The discussion and conclusions of the paper are illustrated with examples of three effective and efficient search algorithms, and experimental results from their application to two important circuit synthesis problems. The knowledge presented in the paper combines numerous valuable concepts of modern system engineering and artificial intelligence, and forms a base for further research and application of the AI search techniques to design of complex circuits and systems.
Special issue: Modalities in type theory
Authors: Matt Fairtlough, Michael Mendler, Eugenio Moggi
Venue: Mathematical Structures in Computer Science (2001)

This special issue reports on some recent advances in the area of intuitionistic modal type theories and their application to Computer Science. It collects a selection of papers presented at the Logic in Computer Science (LICS'99) satellite workshop on Intuitionistic Modal Logics and Applications (IMLA'99) held at Trento, Italy in July 1999. All of the contributors to this one day workshop, which was widely attended, were invited to submit a full and revised version of their papers to this special issue of MSCS. The selection was based on a second round of peer reviewing.
Integrating the Synchronous Dataflow Model with UML
Authors: Peter Green, Salah Essa
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

UML has attracted significant interest as a system description language. However, some aspects of embedded system behavior are difficult to model in UML. In particular, applications with significant dataflow components are not well represented. This paper considers how the synchronous dataflow model can be integrated with UML to provide behavioral descriptions,in an object oriented context, for system elements that perform stream processing. The integration of the SDF model with the UML state machine model is also discussed.
Interpolation by new B-splines on a four directional mesh of the plane
Authors: O. Nouisser, D. Sbibih
Venue: Journal of Computational and Applied Mathematics (2004)

In this paper we construct new simple and composed B-splines on the uniform four directional mesh of the plane, in order to improve the approximation order of B-splines studied in Sablounière (in: Program on Spline Functions and the Theory of Wavelets, Proceedings and Lecture Notes, Vol. 17, University of Montreal, 1998, pp. 67-78). If φ is such a simple B-spline, we first determine the space P(φ) of polynomials with maximal total degree included in S(φ) = {Σα∈Z2 c(α)φ(. - α), c(α) ∈ R}, and we prove some results concerning the linear independence of the family B(φ) = {φ(.-α), α ∈ Z2}. Next, we show that the cardinal interpolation with φ is correct and we study in S(φ) a Lagrange interpolation problem. Finally, we define composed B-splines by repeated convolution of φ with the characteristic functions of a square or a lozenge, and we give some of their properties.
On the problems of smoothing and near-interpolation
Authors: Scott N. Kersey
Venue: Mathematics of Computation (2003)

In the first part of this paper we apply a saddle point theorem from convex analysis to show that various constrained minimization problems are equivalent to the problem of smoothing by spline functions. In particular, we show that near-interpolants are smoothing splines with weights that arise as Lagrange multipliers corresponding to the constraints in the problem of near-interpolation. In the second part of this paper we apply certain fixed point iterations to compute these weights. A similar iteration is applied to the computation of the smoothing parameter in the problem of smoothing.