ppxscal/embedding_network huggingface dataset:
Bringing J2ME industry practice into the classroom
Authors: David A. Umphress, James H. Cross,  II, Jhilmil Jain, Nischita Meda, Larry A. Barowski
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

This paper describes efforts to use industry wireless software development practices in the classroom. Nokia's OK Java 2 Platform Micro Edition (J2ME) application certification program was chosen for use in a core set of wireless software engineering courses. The adaptation process included 1) modifying Nokia OK application standards for classroom use as examples of what is expected of industry-quality software; 2) incorporating Nokia OK software development tools into a student-friendly software development environment; and 3) implementing in-house Nokia OK certification procedures as a basis for assessing student projects and providing feedback.
Combining Multiple Weak Clusterings
Authors: Alexander Topchy, Anil K. Jain, William Punch
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

A data set can be clustered in many ways dependingon the clustering algorithm employed, parameter settingsused and other factors. Can multiple clusterings becombined so that the final partitioning of data providesbetter clustering? The answer depends on the quality ofclusterings to be combined as well as the properties of thefusion method. First, we introduce a unifiedrepresentation for multiple clusterings and formulate thecorresponding categorical clustering problem. As aresult, we show that the consensus function is related tothe classical intra-class variance criterion using thegeneralized mutual information definition. Second, weshow the efficacy of combining partitions generated byweak clustering algorithms that use data projections andrandom data splits. A simple explanatory model is offeredfor the behavior of combinations of such weak clusteringcomponents. We analyze the combination accuracy as afunction of parameters controlling the power andresolution of component partitions as well as the learningdynamics vs. the number of clusterings involved. Finally,some empirical studies compare the effectiveness ofseveral consensus functions.
An Environment for Evolutionary Prototyping Java Programs based on Abstract Interpretation
Authors: Hiroyuki Ozaki, Shingo Ban, Katsuhiko Gondow, Takuya Katayama
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

In this paper, we propose an environment for evolutionaryprototyping technique, which is a theoretical frameworkbased on abstract interpretation for Java programs. In general,it is difficult to execute a prototype in the intermediatestage of top-down development. This disadvantageprevents us to find bugs in the early stage of the development.The technique we propose here allows programmersto execute the prototype as a whole, even though it is partiallyimplemented. In the technique, an object is repeatedlychanged with interface changes. Our idea is to use anearlier runnable object instead of an unimplemented laterobject in runtime. The changes of objects are based on abstractinterpretation. However, it is necessary to realize themechanism for using the alternative object including the interfacechanges in Java. To solve this problem, we introduceproxy object, which is a mediator containing all interfaceand transform objects dynamically and automaticallyto keep execution going. Moreover, proxy objects can beautomatically generated by the dynamic proxy class API,which is one of Java reflection mechanism. As a result, ourenvironment would reduce the cost that programmers describecode for adjusting current objects.
OR/MS content and visibility in AACSB-accredited US business programs
Authors: M. David Albritton, Patrick R. McMullen, Lorraine R. Gardiner
Venue: Interfaces (2003)

In 1997, an INFORMS task force published the results of a study measuring the damage done to operations research/management science (OR/MS) content in business schools after the Association to Advance Collegiate Schools of Business (AACSB) removed OR/MS from its requirements in 1991. Their results were not encouraging. To investigate the current status of OR/MS, we conducted two related analyses to profile both the overall visibility of OR/MS in AACSB-accredited business schools and the content and delivery of existing MBA courses. Our results show small visibility (less than 10 percent) in terms of departments, programs, and concentrations. Approximately 40 percent of the schools studied, however, show one or more courses devoted to OR/MS. We found evidence of widespread use of computer modeling in MBA courses by both instructors and students. MBA students, however, appear to have low levels of involvement in constructing OR/MS applications and presenting their results. Finally, we found instructors" attitudinal responses regarding their MBA teaching experiences to be remarkably positive.
A Parallel Programming Methodology based on High Level Parallel Compositions (CPANs)
Authors: Manuel I. Capel Tuñón, Mario Rossainz López
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

Within an environment of Parallel Objects, aapproach of Structured Parallel Programming and theparadigm of the Orientation to Objects, shows aprogramming method based on High Level ParallelCompositions or HLPCs (CPANs in Spanish) by meansof classes. The synchronous, asynchronouscommunication ways and asynchronous future of thepattern of Parallel Objects, the predefined patterns ofcommunication/interaction of the structured approach,the encapsulation and the abstraction of theOrientation to Objects, to provide reusability to thispatterns, together with a set of predefined restrictionsof synchronization among processes (maxpar, mutex,sync) are used. The implementation of the commonlyused communication patterns is explained, by means ofthe application of the method, which conform a libraryof susceptible classes of being used in applicationswithin the environment of programming of the C++and of the standard POSIX of programming withthreads.
A neural network, speech-based approach to literacy
Authors: John Fulcher, Russell Gluck, Marion Worthy, Kim Draisma, Wilma Vialle
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

An automatic word recognition system is described which assists orally proficient literacy inefficient people to become literate within a minimum possible timeframe. The system enables people with a strong oral tradition to impart their stories directly in text form, without the assistance of a learning facilitator, which is the current best practice for such people. This project stems from work with indigenous communities, but has far-reaching repercussions beyond this community sector, with the potential for benefit to mainstream literacy education (Gluck et.al., 1999). It should be emphasized that our system differs from virtually all other speech-to-text recognition systems in that users are not required to interact via written text (e.g. Kohonen, 1988); at the heart of the system is a neural network-based pattern recognizer which translates speech patterns into visual rather than textual cues. Results obtained to date using this system are reported.
Monitoring and diagnosis of a multistage manufacturing process using Bayesian networks
Authors: Eric Wolbrecht, Bruce D'ambrosio, Robert Paasch, Doug Kirby
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

The application of Bayesian networks for monitoring and diagnosis of a multistage manufacturing process is described. Bayesian network &ldquo;part models&rdquo; were designed to represent individual parts in-process. These were combined to form a &ldquo;process model,&rdquo; a Bayesian network model of the entire manufacturing process. An efficient procedure is designed for managing the &ldquo;process network.&rdquo; Simulated data is used to test the validity of diagnosis made from this method. In addition, a critical analysis of this method is given, including computation speed concerns, accuracy of results, and ease of implementation. Finally, a discussion on future research in the area is given.
Discretizing aerosol dynamics with B-splines
Authors: Adrian Sandu, Christian T. Borden
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

This paper presents a discretization technique for particle dynamics equation based on the B-spline interpolation of the solution. The method is developed in the general framework recently proposed by the authors. Numerical tests include the coagulation-growth of the exponential distribution and of a cosine hill in logarithmic coordinates.
Wallop: Designing Social Software for Co-Located Social Networks
Authors: Shelly Farnham, Sean Uberoi Kelly, Will Portnoy, Jordan L. K. Schwartz
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

Technology is increasingly being incorporated into people's day-to-day social relationships, particularly for people whose friendships occupy the center of their social lives. In the following paper we discuss a co-located social group's tendency to integrate planning andre-experiencing around social events with tools for persistent conversations. Through a questionnaire study we found that emails and mailing lists were used as much as phone conversations to plan social activities, and that said usage was positively correlated with measures of friendship satisfaction, sense of community, and percentage of time spent socializing. In response to our observations, we designed a sharing and communication application, Wallop, to enrich the co-located social group's planning and sharing around social events. Wallop provides both communication and social awareness tools, enabling users to build conversations in the context of shared content and browse their implicit social networks. Initial responses to Wallop from a focus group and limited deployment to test users have been positive.
Elementary teachers' use of computers
Authors: James M. Cooper
Venue:  (2003)

The purpose of this quantitative study was to examine the ways elementary teachers use computer technology for instructional purposes and the factors that influence their use of computers. The population consisted of all 2000&ndash;2002 graduates from the elementary teacher preparation program at the Curry School of Education, University of Virginia. The research questions were: (a) In what ways are Curry School graduates using computers in their elementary classrooms? (b) What factors influence Curry graduates use of computers in their elementary classrooms? Data were gathered using a survey instrument. The instrument addressed the four factors that support teachers' use of computers: access and availability, preparation and training, leadership, and time. Descriptive and inferential statistics were employed in this study. Multiple regression analysis was used to test for relationships stated in the null hypotheses. Multiple correlations were computed and tested for significance. The response rate was 89 percent. The findings indicated that 84 percent of the teachers felt either well or very well prepared to integrate technology into curriculum, and that they were able to overcome the typical barriers to computer use in elementary classrooms. The teachers overwhelmingly indicated that computers have considerable potential for allowing students to discover or construct ideas for themselves. Nearly 80 percent of the teachers supported constructivist pedagogies when referring to computer use in elementary classrooms. Teacher preparation, teacher philosophy and grade level were identified as influential factors in the use of computers by the elementary teachers and the elementary students.
A New Genetic Programming Approach in Symbolic Regression
Authors: Xiong Shengwu, Wang Weiwu, Li Feng
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Genetic Programming (GP) has been applied to symbolic regression problem for a long time. The symbolic regression is to discover a function that can fit a finite set of sample data. These sample data can be guided by a simple function, which is continuous and smooth, but in a complex system, the sample data can be produced by a discontinuous or non-smooth function. When conventional GP is applied to such complex system's regression, it gets poor performance. This paper proposed a new GP representation and algorithm that can be applied to both continuous function's regression and discontinuous function's regression. The proposed approach is able to identify both the sub-functions and the discontinuity points simultaneously. The numerical experimental results show that the new GP is able to obtain higher success rate, higher convergence rate and better solutions than conventional GP in such complex system's regression.
Parameter estimation algorithms for computationally intensive spatial problems
Authors: Christopher Haydon Holloman
Venue:  (2002)

Due to modern advances in computing power, the use of increasingly complex statistical models has become practical. One class of large models that often relies on numerical techniques for parameter estimation is multi-resolution spatial models. Unfortunately, numerical maximization and sampling techniques used to estimate parameters in such complex models often explore the parameter space slowly, resulting in unreliable estimates. To combat this lack of reliability, several algorithms are introduced with the goals of improving the mixing of Markov chain Monte Carlo algorithms and improving exploration properties of genetic algorithm maximization techniques. We propose a multi-resolution genetic algorithm that incorporates elements of simulated tempering to allow efficient estimation of parameters via maximization in spatial models. This algorithm is also adapted to perform Markov chain Monte Carlo sampling from a posterior distribution in a Bayesian setting resulting in improved mixing and exploration of the posterior relative to ordinary MCMC sampling. We find that these two algorithms are efficient methods of estimating parameters in computationally intensive spatial problems. Parallel implementation of these algorithms is addressed. These methods are demonstrated on inverse problem examples from the field of groundwater hydrology.
Experimental simulation of an optical character recognition, speech output reading machine for the blind
Authors: Rob Savoie, Pat Erickson
Venue: Issue 24 (October 1978) (1978)

This paper describes a project to investigate an Optical Character Recognition Speech-Output Reading Machine for the blind. A standard minicomputer accepts optical images derived from the electronic camera of an Optacon Reading Aid and converts these images to character streams representing letters of recognized words. A second computer then converts the letter strings to spoken words.The system operates in real-time at reading rates over 150 words per minute with the electronic camera moved either manually or automatically.
Robust online appearance models for visual tracking
Authors: Allan D. Jepson
Venue:  (2003)

A framework for learning robust, adaptive appearance models to be used for motion-based tracking of natural objects is proposed. The approach involves a mixture of stable image structure, learned over long time courses, along with 2-frame transient motion information and an outlier process. This class of appearance models is shown to have low storage requirements and that the model parameters can be learned efficiently with an on-line variant of the expectation-maximization (EM) algorithm. Two implementations of appearance models based on the framework presented here are developed. The first is based on the filter responses from a steerable pyramid. This model is used in a motion-based tracking algorithm to provide robustness in the face of image outliers, such as those caused by occlusions. It also provides the ability to adapt to natural changes in appearance, such as those due to facial expressions or variations in 3D pose. The second implementation is based on a robust representation of the color of the target object. Experimental results on a variety of natural image sequences of people moving within cluttered environments are shown, both for the wavelet- and color-based appearance models individually and in combination with one another. A quantitative analysis of the performance of the tracker is provided for one of the test sequences.
Priority-based distribution trees for application-level multicast
Authors: Jürgen Vogel, Jörg Widmer, Dirk Farin, Martin Mauve, Wolfgang Effelsberg
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual priority for each packet-receiver pair. The multicast distribution tree is then constructed such that the higher the priority, the more direct the path from the sender to the packet's destination and the lower the resulting end-to-end delay. This algorithm can be used to realize application-level multicast for delay-sensitive applications such as networked computer games. However, optimizing the multicast tree with respect to the end-to-end delay comes at the cost of an increase in link stress - the more direct a path, the less likely it is that it can be integrated efficiently into an overlay distribution tree. Our algorithm takes this tradeoff into account and constructs efficient priority-based multicast trees. We demonstrate the performance and characteristics of the algorithm through simulation.
Experimental use of the portable common tool environment (PCTE) on a fine-grained data problem
Authors: Michael Caldwell, David Carney, Fred Long
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

While object management systems such as PCTE have recently been proposed as useful repository systems for engineering environments, and particularly for "coarse-grained" data, there have been many questions about their capabilities to support the type of database operations typically called "fine-grained." This paper reports on a set of experiments performed on an implementation of PCTE. These experiments sought to examine the capability of the implementation to support the type of data storage and retrieval operations typical of fine-grained database applications.
Linux, Talon and astronomy
Authors: Tony Steidler-Dennison
Venue: Linux Journal (2004)

The software that controls research-grade telescopes can control your telescope too.
Multiagent Systems with Workflows
Authors: José M. Vidal, Paul Buhler, Christian Stahl
Venue: IEEE Internet Computing (2004)

Industry and researchers have two different visions for the future of Web services. Industry wants to capitalize on Web service technology to automate business processes via centralized workflow enactment. Researchers are interested in the dynamic composition of Web services. The authors show how these two visions are two points in a continuum and discuss a possible path for bridging the gap between them.
Basic principles for understanding evolutionary algorithms
Authors: Karsten Weicker, Nicole Weicker
Venue: Fundamenta Informaticae (2002)

Evolutionary algorithms are often successfully applied to hard optimization problems. However, besides rules of thumb and experience, trial and error is still the leading design technique for evolutionary algorithms. A profound theoretical foundation guiding those applications is Still missing. This article outlines a networked understanding of evolutionary algorithms. As a first Step towards that goal, it reviews and interrelates major theoretical results and working principles in order to give an extensive insight into the internal processing of evolutionary algorithms. This not only helps to understand success and failure of evolutionary algorithms in applications but, in addition, could lead to a theory-guided design process enrichening and relieving today's heuristic techniques.
Usability of mobile devices and intelligently adapting to a user's needs
Authors: Stephen Greene, Jason Finnegan
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Usability is defined in ISO 9241 (1998) as the extent to which a product can be used by specified users to achieve specified goals with effectiveness, efficiency and satisfaction. Usability in relation to mobile services i.e. services that run on Mobile Phones and PDAs must look at the mobile user and surmise what interfaces for mobile services are appreciated and anticipated by the user. This paper will cover the area of usability issues when developing Mobile services. It will look at the mobile users and will propose a system that will store and utilise users' context information to help a user carry out a task. It will formulate a structure that allows applications to learn the significance and interrelations of people, places, objects and documents. By knowing the significance and relationships between objects and data, applications can always provide the user with the most relevant data and build up a context for user interaction.
Computers for Communication, Not Calculation: Media as a Motivation and Context for Learning
Authors: Andrea Forte, Mark Guzdial
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 4 - Volume 4 (2004)

As the skills that constitute literacy evolve to accommodate digital media, computer scienceeducation finds itself in a sorry state. While students are more in need of computational skills than ever, computer science suffers dramatically low retention rates and a declining percentage of women and minorities. Studies of the problem point to the over-emphasis in computer science classes on abstraction over application, technical details instead of usability, and the stereotypical view of programmers as loners lacking creativity. In spring 2003, Georgia Institute of Technology trialed a new course, Introduction to Media Computation, which teaches programming and computation in the context of media creation and manipulation. Students implement PhotoShop-style filters and digital video special effects, splice sounds, and search Web pages. The course is open only to non-computer science andnon-engineering majors at Georgia Tech, such as liberal arts, management and architecture students. The course is supported through the use of a Web-based collaboration environment where students actively share and discuss their digital creations. The results have been dramatic. 120 students enrolled, 2/3 female, and only three students withdrew. By the end of the semester, the combined withdrawal, failure and D-grade rate had reached 11.5% -- compared to 42.9% in the traditional introductory computer science course. 60% of the students who took media computation reported that they would be interested in taking an advanced version of the course; only 6% reported that they would otherwise be interested intaking more computer science. Results of the trial indicate that media computation motivates and engages an audience that is poorly served by traditional computer science courses.