ppxscal/embedding_network huggingface dataset:
mLearning for Kindergarten's Mathematics Teaching
Authors: Harri Ketamo
Venue: Proceedings IEEE International Workshop on Wireless and Mobile Technologies in Education (2002)

The aim of this study was to develop a geometry learning game for handheld devices that adapts to the user's behaviour. The learners in this study were six years old Finnish pre-school pupils. The adaptive system was very limited and the observed behaviour was defined to be very simple. Despite that, the developed software achieves good learning results among the tested pupils. The study shows that the learning effect is very promising with this kind of a handheld platform and simple adaptation system. This study gives good visions of what can be achieved with more complex behaviour adaptive systems in the field of eLearning.
Ternary Relationship Decomposition Strategies Based on Binary Imposition Rules
Authors: Il-Yeol Song, Trevor H. Jones
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

We review a set of rules identifying which combinations of ternary and binary relationships can be combined simultaneously in semantically related situations. We investigate the effect of these rules on decomposing ternary relationships to simpler, multiple binary relationships. We also discuss the relevance of these decomposition strategies to ER modeling. We show that if at least one 1:1 or 1:M binary constraint can be identified within the construct of the ternary itself, then any ternary relationship can be decomposed to a binary format. From this methodology we construct a heuristic-the Constrained Ternary Decomposition (CTD) rule.
Scalable Parallel Query Server for Decision Support Applications
Authors: Jen-Yao Chung
Venue: Proceedings of the Eleventh International Conference on Data Engineering (1995)

Decision-support applications require the ability to query against large amounts of detailed historical data. We are exploiting parallel technology to improve query response time through query decomposition, CPU and I/O parallelism, and client/server approach. IBM System/390 Parallel Query Server is built on advanced and low-cost CMOS microprocessors for decision-support applications. We discuss our design, implementation and performance of a scalable parallel query server.
Distributed Web Mining Using Bayesian Networks from Multiple Data Streams
Authors: R. Chen, Krishnamoorthy Sivakumar, Hillol Kargupta
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

We present a collective approach to mine Bayesian net-works from distributed heterogenous web-log data streams. In this approach we first learn a local Bayesian network at each site using the local data. Then each site identifies the observations that are most likely to be evidence of coupling between local and non-local variables and transmits asub-set of these observations to a central site. Another Bayesian network is learnt at the central site using the data transmittedfrom the local site. The local and central Bayesian networks are combined to obtain a collective Bayesian net-work, that models the entire data. We applied this techniqueto mine multiple data streams where data centralization is difficult because of large response time and scalability issues.Experimental results and theoretical justification that demonstrate the feasibility of our approach are presented.
Introducing New Multiple Expert Decision Combination Topologies: A Case Study using Recognition of Handwritten Characters
Authors: Ahmad Fuad Rezaur Rahman, Michael C. Fairhurst
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A new topology for classifying decision combinations of multiple experts in the framework of a multiple expert character recognition platform is introduced. It is demonstrated that many existing multiple expert configurations for character recognition can be categorised by using this method of defining classification strategies. It is also demonstrated that the design of multiple expert character recognition configurations can be streamlined by classifying these structures in terms of how the channels used for carrying information among different experts are interconnected irrespective of the algorithms used by cooperating experts and by the final decision combination expert. Case studies of actual multiple expert character recognition configurations have been investigated and it is shown how they can be categorised with respect to the decision combination topologies introduced in the paper.
Distributed Agent Architecture for Port Automation
Authors: Tom Thurston, Huosheng Hu
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

In the near future, container ports will no longer be able to expand into the surrounding land and will thus be unable to meet the storage requirements due to the boom in world trade. A solution to this problem is to increase the container throughput of the port by reducing the amount of time necessary to load and unload a ship. This paper presents distributed agent architecture to achieve this task. Under such architecture, an intelligent planning algorithmis continuously optimised by the dynamic and co-operative rescheduling of yard resources such as quay cranes and container vehicles.
Recognition of Characters in Plates of Private Brazilian Vehicles using Neural Networks
Authors: Aline Da Rocha Gesualdi, Marcelo Portes De Albuquerque, José Manoel de Seixas, Luis Pereira Calôba, Marcio Portes De Albuquerque
Venue: Proceedings of the 13th Brazilian Symposium on Computer Graphics and Image Processing (2000)

This work considers the recognition of characters in plates of private Brazilian vehicles using neural networks. Initially it defines a standard for the image as a prerequisite for the pre-processing. Afterwards, the reduction of the dimensionality is made in order to make use of the network. For this the paper establishes a figure of merit Q characterizing, amongst some algorithms of character splitting, the best one. Q is based on normalized cross correlation of the desired character image and the one obtained. The pre-processing allowed image improvement, reducing the background noise and increasing the contrast by applying a non-linear function. In the last stage, the neural network recognizes each character of the plate. Preliminary results are shown.
A Formal Approach for Passive Testing of Protocol Data Portions
Authors: David Lee, Dongluo Chen, Ruibing Hao, Raymond E. Miller, Jianping Wu, Xia Yin
Venue: Proceedings of the 10th IEEE International Conference on Network Protocols (2002)

Passive testing is a process of detecting faults in a system under test by passively observing its input/output behaviors only without interrupting its normal operations, and proves to be a promising technique for network fault management. We study passive testing of data portions of network protocols and present two algorithms, using an Event-driven Extended Finite State Machine model. Experimental results on the Internet routing protocol OSPF are reported.
Applying Formal Methods to an Information Security Device: An Experience Report
Authors: James Kirby,  Jr., Myla Archer, Constance L. Heitmeyer
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

SCR (Software Cost Reduction) is a formal method for specifying and analyzing system requirements that has previously been applied to control systems. This paper describes a case study in which the SCR method was used to specify and analyze a different class of system, a cryptographic system called CD, which must satisfy a large set of security properties. The paper describes how a suite of tools supporting SCR a consistency checker, simulator, model checker, invariant generator, theorem prover, and validity checker were used to detect errors in the SCR specification of CD and to verify that the specification satisfies seven security properties. The paper also describes issues of concern to software developers about formal methods, e.g., ease of use, cost-effectiveness, scalability, how to translate a prose specification into a formal notation, and what process to follow in applying a formal method and discusses these issues based on our experience with CD. Also described are some unexpected results of our case study.
A Tool for On-line Visualization and Interactive Steering of Parallel HPC Applications
Authors: Sabine Rathmayer
Venue: Proceedings of the 11th International Symposium on Parallel Processing (1997)

Tools for parallel systems today range from specification over debugging to performance analysis and more. Typically, they help the programmers of parallel algorithms from the early development stages to a certain level of program optimization. However, in HPC (High Performance Computing) today the end-user of massively parallel CFD (Computational Fluid Dynamics)-programs has little or no support in his work. The scientific engineer who often runs his application on a parallel computer somewhere in the WAN (Wide Area Network) and visualizes the enormous amounts of simulation data on a graphical workstation in his LAN (Local Area Network) has needs which are by far not covered by state of the art visualization systems.The tool proposed here follows a strategy which differs completely from existing, batch-oriented, and strictly sequential methods of the working process in the application cycle of parallel HPC applications. It allows both on-line visualization and interactive program steering of massively parallel CFD-applications. The parameters of the mathematical model and the numerical methods build objects of a database which can be accessed by an object-oriented graphical user interface via visualization and modification operators. Experiences with this new tool concept VIPER (VIsualization of Parallel numerical simulation algorithms for Extended Research) applied on a real-world and industrial scientific application will be shown.
AINE: An Immunological Approach to Data Mining
Authors: Thomas Knight, Jon Timmis
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

An investigation has been undertaken to repeat previous work on an artificial immune system for data analysis called AINE (Artificial Immune Network).The previous work was limited to testing the algorithm on relatively small data sets. The aim of this investigation is two fold,firstly to corroborate the results presented in previous work and secondly, to test the algorithm on a larger and more complex data set. A new re-implementation of AINE is then described and differences in behaviour are identified and explained. It is argued that the behaviourseen in the new implementation is more accurate than that seen in previous work and an in-depth analysis of the algorithm structure is undertaken in order to confirm theseobservations. The algorithm is also tested on new data and the results of this are presented. Comparisons are draw with other similar techniques for data mining and it is argued that AINE is an effective data-mining algorithm.
Tele-Education Process Modelling Supported by The ODP Enterprise Viewpoint Language
Authors: Cees Volman, Val Jones, Marten van Sinderen, Ing Widya, Eddy Michiels
Venue: Proceedings of the 1st International Conference on Enterprise Distributed Object Computing (1997)

This paper reports on applying the ODP enterprise viewpoint in the domain of tele-education. The work is conducted as part of a research activity that aims at designing a tele-education system to support planning, execution and evaluation of dynamic distributed educational processes. We explore the ODP enterprise viewpoint as a basis for communication and co-operation between educational scientists and ODP systems designers involved in the design process. Our application of the enterprise viewpoint involves four main steps. First, an educational language is proposed to describe educational processes in generic terms. Second, a set of appropriate enterprise language concepts is selected. Third, a relationship is established between the educational language and enterprise language concepts. Fourth, an educational process is modelled in terms of an entity-oriented model and a behavior-oriented model. It is hoped that the experience gained in this exercise will provide useful feedback to both the educational and ODP communities.
Distributed Virtual Worlds for Collaborative Work Based on Java RMI and VRML
Authors: Rolando Menchaca Mendez, Rolando Quintero Tellez
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

This paper shows the architecture for the construction of distributed virtual worlds based on Java RMI and VRML. We show an analysis of the advantages of this architecture over others schemes used to equip VRML with capacities of multiuser collaboration. Finally, we emphasize the future that an architecture such as this has for applications of collaborative work.
Regulation in Groupware: The Example of a Collaborative Drawing Tool for Young Children
Authors: Christine Ferraris, Christian Martel
Venue: Proceedings of the 6th International Workshop on Groupware (2000)

Groupware is defined by the union of production, communication and coordination spaces. These are supports for joint activities but they rarely allow the users to organise their activities or to define the conditions under which they are exercised. It is a question of being able to regulate joint activities. The regulation concerns the social aspects of collaborative work. We propose to take this social aspect into account in groupware by adding a new space to the three existing ones: the regulation space. A participation model is associated with this space. It describes the "arenas" (location) where the activity takes place, the "interactive scenarios" guiding the interactions and the actions of the participants, and the participants themselves. They are represented in the arenas by means of "actors", which are computer entities characterised by their roles, places and positions. We propose a reification of the participation model within a collaborative drawing software package that we have developed for educational purposes.
The non-homogeneous maintenance periods: a case study of software modifications
Authors: David Gefen, Scott L. Schneberger
Venue: Proceedings of the 1996 International Conference on Software Maintenance (1996)

Software maintenance is often described as the most costly activity relating to software. Understanding software modification distribution could therefore greatly benefit information system (IS) managers. Current models mostly depict this distribution as homogeneous with a decreasing rate of modifications over time. The in-depth case study reported in this paper challenges this view. A detailed analysis of software modification by type, combined with interviews, shows that in the state-of-the-art IS that was examined, there were three distinct periods during the initial 29-month period studied. In the first period, the software was stabilized within the framework of its original specifications. Software modifications during this period centered on corrective modification, similar to software testing. In the second period, the software was improved: new functions were added within the original framework. In the third period, the IS was expanded beyond its original specifications by adding many new applications.
Product Classification Integration for E-Commerce
Authors: Sonia Bergamaschi, Francesco Guerra, Maurizio Vincini
Venue: Proceedings of the 13th International Workshop on Database and Expert Systems Applications (2002)

A marketplace is the place where the demand and supply of buyers and vendors participating in a business process may meet. Therefore, electronic marketplaces are virtual communities in which buyers may meet proposals of several suppliers and make the best choice. In theelectronic commerce world, the comparison between different products is blocked due to the lack of standards (on the contrary, the proliferation of standards) describing and classifying them. Therefore, the need for B2B and B2C marketplaces is to reclassify products and goods according to different standardization models. This paper aims to face this problem by suggesting the use of a semi-automatic methodology to define a mapping among different e-commerce product classification standards. This methodology is an extension of the MOMIS-system, a mediator system developed within the Intelligent Integration of Information research area.
Latch Redundancy Removal Without Global Reset
Authors: Shaz Qadeer, Robert K. Brayton, Vigyan Singhal
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

For circuits where there may be latches with no reset line, we show how to replace some of them with combinational logic. All previous work in sequential optimization by latch removal assumes a designated initial state. Without this assumption, the design can power up in any state and earlier techniques are not applicable. We present an algorithm for identifying and replacing redundant latches by combinational logic such that no environment of the design can detect the change. The new design preserves the steady state behavior as well as all initializing sequences of the old design. We report experimental results on benchmark circuits and demonstrate savings in area without adverse impact on delay. Keywords: Finite state machine, global reset assumption, latch redundancy, safe replacement, delayed replacement, strongly connected components, core
A Rough Set Approach to Measuring Information Granules
Authors: James F. Peters, Zdzislaw Pawlak, Andrzej Skowron
Venue: Proceedings of the 26th International Computer Software and Applications Conference on Prolonging Software Life: Development and Redevelopment (2002)

This article introduces an approach to measures of information granules based on rough set theory. Informally, an information granule is a representation of a multiset (or bag) of real-world objects that are somehow indistinguishable (e.g., water samples taken from the same source at approximately the same time), or similar (e.g., various renditions of Chopin's sonatas or various series of very high, tinkling trills common in the songs of winter wrens), or which cause the same functionality (e.g., unmanned helicopters, line-crawling robots). Examples of measures of information granules based on rough set theory are inclusion, closeness, size, and enclosure. All of these measures are based on rough inclusion. This paper is limited to aconsideration of measures of inclusion based on a straightforward extension of classical rough membership functions and closeness based on measurement of separation of equivalence classes in a partition of the universe containing information granules. Measurement of sensor-based information granules has been motivated by recent studies of sensor signals. Asensor signal is a non-empty, finite set of sample sensor signal values temporally ordered.Classification of sensor signals requires measurements of sample signal values over subintervals of time. The contribution of this article is the introduction of a rough set approach to measuring information granule inclusion and closeness.
Applications of Data Mining in Hydrology
Authors: Xu Liang, Yao Liang
Venue: Proceedings of the 2001 IEEE International Conference on Data Mining (2001)

Long-term range streamflow forecast plays an invaluable role in water resources planning andmanagement. In this study, the potential applicability and limitations of the time series forecasting approach using neural network with the multiresolution learning paradigm (NNMLP) are investigated. The predictedlongterm range streamflows using the NNMLP are compared with the observations. The results show that the time series forecasting approach of NNMLP has good predicting skill. The NNMLP requires only historicalstreamflow information. The time series forecasting approach of NNMLP has great potential for being used alone in regions with limited available information, and for being combined with other approaches to improve long-term range streamflow forecasts.
Mobile Information Agents for Processing under Information Overload: A Position Statement
Authors: Daniela Rus
Venue: 23rd International Computer Software and Applications Conference (1999)

Information in electronic form is proliferating rapidly in a variety of forms. We now have powerful search engines that can return pointers to millions of documents on any subject. How can we tap into this fortune, while avoiding information overload?
Java in Industrial Automation - A Virtual PLC
Authors: Mario Grabner, Gerhard Leonhartsberger, Alexander Leutgeb, Josef Altmann
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

Remote access of a Programmable Logical Control (PLC) is the prerequisite for an effective maintenance. We present an architecture for the development of tools supporting the installation, configuration, maintenance, supervision, and diagnosis of remote PLCs via the Internet. The developed architecture, called Virtual PLC, consists of a set of extensible components describing a real PLC. The Virtual PLC uses Java(tm) Technology to be platform independent. The Virtual PLC enables developers to rapidly implement tools for remote diagnosis, supervision and maintenance of a real PLC.
Identifying Key Attributes of Projects that Affect the Field Quality of Communication Software
Authors: Nahomi Kikuchi, Osamu Mizuno, Tohru Kikuno
Venue: 24th International Computer Software and Applications Conference (2000)

In this paper, we identify key attributes of projects in which the number of problem reports after release is remarkable in the communication software. After several interviews with software project managers, we derived candidate attributes of importance to the projects. To find out the most influential attributes of the projects, we conducted statistical analysis using a set of metrics data related to the candidate attributes and the number of problem reports after release. As a result, we successfully found that two metrics concerning the origin's quality and the changes in specification are useful to estimate the field quality.
Exploiting spatial regularity in irregular iterative applications
Authors: Antonio Lain, Prithviraj Banerjee
Venue: Proceedings of the 9th International Symposium on Parallel Processing (1995)

The increasing gap between the speed of microprocessors and memory subsystems makes it imperative to exploit locality of reference in sequential irregular applications. The parallelization of such applications requires special considerations. Current RTS (Run-Time Support) for irregular computations fails to exploit the fine grain regularity present in these applications, producing unnecessary time and memory overheads. PILAR (Parallel Irregular Library with Application of Regularity) is a new RTS for irregular computations that provides a variety of internal representations of communication patterns based on their regularity; allowing for the efficient support of a wide spectrum of regularity under a common framework. Experimental results on the IBM SP-1 and Intel Paragon demonstrate the validity of our approach.