ppxscal/embedding_network huggingface dataset:
Supervised and Evolutionary Learning of Echo State Networks
Authors: Fei Jiang, Hugues Berry, Marc Schoenauer
Venue: Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X (2008)

A possible alternative to topology fine-tuning for Neural Network (NN) optimization is to use Echo State Networks (ESNs), recurrent NNs built upon a large reservoir of sparsely randomly connected neurons. The promises of ESNs have been fulfilled for supervised learning tasks, but unsupervised ones, e.g. control problems, require more flexible optimization methods --- such as Evolutionary Algorithms. This paper proposes to apply CMA-ES, the state-of-the-art method in evolutionary continuous parameter optimization, to the evolutionary learning of ESN parameters. First, a standard supervised learning problem is used to validate the approach and compare it to the standard one. But the flexibility of Evolutionary optimization allows us to optimize not only the outgoing weights but also, or alternatively, other ESN parameters, sometimes leading to improved results. The classical double pole balancing control problem is then used to demonstrate the feasibility of evolutionary (i.e. reinforcement) learning of ESNs. We show that the evolutionary ESN obtain results that are comparable with those of the best topology-learning methods.
Construction of Project-Based Virtual Learning Community
Authors: Xiaoli Zheng, Feng Wang
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

With the further reform of education in our country, new teaching models spring out centered on learning. To meet students' needs for autonomous and constructive learning, it's urgent that besides appropriate resources and contexts, teachers have a relevant learning environment attached to new teaching models to aid teaching in class and realize students' autonomous learning. This paper, take project-based learning for example, mainly starts with definitions of PBL and project-based virtual learning community (abbrev. PBVLC), and expounds components of PBVLC. In the light of constructive perspective for learning environment components and web-based cooperative learning, this paper systematically scaffolds the model of PBVLC and develops it with technologies of ASP and Access.
Introduction
Authors: Andreas Rausch, Ralf Reussner, Raffaela Mirandola, František Plášil
Venue: The Common Component Modeling Example: Comparing Software Component Models (2007)

Although the idea of a software component stems back to the end of the sixties, the component-based software engineering established itself to an dedicated research area during the end nineties. Nowadays, in particular the research in component models which is motivated by the verification and quality prediction of component-based systems forms such a large body of research with a plethora of specific and creative ideas that it is hard to keep the overview. Several conference and workshop series are dedicated to formal component models and their use in verification and quality prediction, such as FMCO, CBSE, FESCA, FACS and QoSA. The organisers of CoCoME came independently to the finding, that these component models are hard to compare, as each research group concentrate on different aspects of formal component modelling and quality prediction.
Anatomy of a Portable Digital Mediaprocessor
Authors: Deepu Talla, Ching-Yu Hung, Raj Talluri, Frank Brill, David Smith, David Brier, Bruce Xiong, Derek Huynh
Venue: IEEE Micro (2004)

Using a dual-core architecture integrated with several programmable coprocessors and dedicated functional blocks, the DM310 can provide high performance on imaging, video, and audio algorithms at low power and low system cost.
Peer support for computer integration during student teaching: using the electronic discussion board
Authors: Karen J. Everett
Venue:  (2007)

Twenty-six Childhood Education student teachers communicated with each other for ten weeks using WebCT. Their discussions focused on providing each other ideas and support for how to include computers in their instructional lessons during student teaching. The results suggested the important role that the discussion board played in the student teachers' experiences using computers. Seventy-seven percent of the student teachers found the help, ideas, and support they received from each other to be beneficial. A majority of the student teachers recommended that the electronic discussion board be continued for future student teachers. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Constructionist assessment with mobile software-based paper prototyping
Authors: Dean Mohamedally, Panayiotis Zaphiris
Venue: International Journal of Mobile Learning and Organisation (2008)

Low-fidelity prototyping is a Knowledge Elicitation technique in Human-Computer Interaction (HCI). However, empirical methods for low-fidelity prototyping have remained relatively static in development. We describe artefact-driven dynamic constructionism, allowing us to view the temporal evolution of design artefacts as measurable constructs within low-fidelity prototypes. Two mobile software tools are described, PROTEUS and PROTEUS EVALUATOR, using Social Constructionism. HCI class prototyping exercises with the tools are reported with 40 HCI Postgraduate students. Artefact-driven constructionist metrics are thus applied to low-fidelity prototyping pedagogy. Advantages and disadvantages of using such methods are demonstrated and explained.
Space/time multigrid for a fluid--structure-interaction problem
Authors: E. H. van Brummelen, K. G. van der Zee, R. de Borst
Venue: Applied Numerical Mathematics (2008)

The basic iterative method for solving fluid-structure-interaction problems is a defect-correction process based on a partitioning of the underlying operator into a fluid part and a structural part. In the present work we establish for a prototypical model problem that this defect-correction process yields an excellent smoother for multigrid, on account of the relative compactness of the fluid part of the operator with respect to the structural part. We show that the defect-correction process in fact represents an asymptotically-perfect smoother, i.e., the effectiveness of the smoother increases as the mesh is refined. Consequently, on sufficiently fine meshes the fluid-structure-interaction problem can be solved to arbitrary accuracy by one iteration of the defect-correction process followed by a coarse-grid correction. Another important property of the defect-correction process is that it smoothens the error in space/time, so that the coarsening in the multigrid method can be applied in both space and time.
Demonstration of multi-agent potential fields in real-time strategy games
Authors: Johan Hagelbäck, Stefan J. Johansson
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

Bots for Real Time Strategy (RTS) games provide a rich challenge to implement. A bot controls a number of units that may have to navigate in a partially unknown environment, while at the same time search for enemies and coordinate attacks to fight them down. Potential fields is a technique originating from the area of robotics where it is used in controlling the navigation of robots in dynamic environments. Although attempts have been made to transfer the technology to the gaming sector, assumed problems with efficiency and high costs for implementation have made the industry reluctant to adopt it. Our demo shows the use of Multi-agent Potential Fields (MAPF) in an open source RTS game. We will demonstrate both the potential fields as such, and the coordination of the agents.
Support for Understanding GUI Programs by Visualizing Execution Traces Synchronized with Screen Transitions
Authors: Tatsuya Sato, Buntarou Shizuki, Jiro Tanaka
Venue: Proceedings of the 2008 The 16th IEEE International Conference on Program Comprehension (2008)

To support understanding a specific GUI functionality in a program, we propose a visualization technique that presents the correspondence between the screens before and after the operation, as well as the traces of the source code executed by the operation. The presented traces include the executed lines and the method calls, which are fundamental information for understanding the functionality. They are represented as highlights that are superimposed on the entire source code.
On Resource Profiling and Matching in an Agent-Based Virtual Organization
Authors: Grzegorz Frąckowiak, Maria Ganzha, Maciej Gawinecki, Marcin Paprzycki, Michał Szymczak, Myon-Woong Park, Yo-Sub Han
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In our work we are designing agent based support for workers in a virtual organization. In the system under development, all resources are to be ontologically demarcated and utilized through semantically- driven information processing techniques. This paper contains preliminary considerations concerning resource profiling and ontological matching methods which we intend to utilize within the system. Two applications that we are currently developing are used to illustrate the proposed approach.
Intersection Location Service for Vehicular Ad Hoc Networks with Cars in Manhattan Style Movement Patterns
Authors: Yao-Jen Chang, Shang-Yao Wu
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

For inter-vehicular communications that happen in metropolitan areas, moving cars travel on restricted directions along streets and make frequent stops over intersections. In this paper, we present Intersection Location Service (ILS), a distributed hashing-based location service algorithm that makes use of the features of street intersections and the Chord algorithm as the location query and fault tolerant mechanism. Performance comparisons of ILS with two well-known location service algorithms, Grid Location Service (GLS) and Hierarchical Location Service (HLS) are demonstrated in the ns-2 simulations of moving cars in various city environments. We have shown by means of simulation that ILS achieves good results in terms of query success ratios and remarkable scalability with respect to network size.
Image Denoising Using Neighbouring Contourlet Coefficients
Authors: Guangyi Chen, Wei-Ping Zhu
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

The denoising of a natural image corrupted by Gaussian white noise is a classical problem in image processing. In this paper, a new image denoising method is proposed by using the contourlet transform. The thresholding process employs a small neighbourhood for the current contourlet coefficient to be thresholded. This is because the contourlet coefficients are correlated, and large contourlet coefficients will normally have large coefficients at its neighbour locations. Experiments show that the proposed method is better than the standard contourlet denoising and the wavelet denoising.
Modeling Reuse on Case-Based Reasoning with Application to Breast Cancer Diagnosis
Authors: Carles Pous, Pablo Gay, Albert Pla, Joan Brunet, Judit Sanz, Teresa Ramon Cajal, Beatriz López
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

In the recent years, there has been an increasing interest on the use of case-based reasoning (CBR) in Medicine. CBR is characterized by four phases: retrieve, reuse, revise and retain. The first and last phases have received a lot of attention by the researchers, while the reuse phase is still in its infancy. The reuse phase involves a multi-facet problem which includes dealing with the closeness to the decision threshold used to determine similar cases, among other issues. In this paper, we propose a new reuse method whose decision variable is based on the similarity ratio. We have applied the method and tested in a breast cancer diagnosis database.
Requirements of the bureau of old-age and survivors insurance for electronic data processing equipment
Authors: Edward E. Stickell
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

The activities of the Division of Accounting Operations of the Bureau of Old-Age and Survivors Insurance have been referred to, upon occasion, as one of the biggest bookkeeping jobs in the world. Whether this condition is true or not depends on how it is measured. Certainly, by the yardstick of costs, it would not appear that the job is at all near the biggest. On the basis of comparisons similar to those made in business, the gross costs of operations represent only 1/2 of 1 percent of total gross income. Furthermore, the system shows no signs of becoming the biggest in terms of cost. In a ten year period, an approximately 50 percent increase in basic work loads has been absorbed with no significant or compensatory increase in personnel. It is felt, therefore, that if the job qualifies as being one of the biggest in volume, it also might qualify as one of the smallest in terms of proportionate costs. However, regardless of how it is measured, the job represents a real challenge to those who administer it and to those who would furnish it with suitable electronic paraphernalia. For these reasons, the following problems are presented with pleasure at the opportunity and with confidence in the know-how represented at this conference to solder together whatever combinations of wires, tubes, diodes and transistors that are found to be necessary in each case.
Attribute Grammars and Categorical Semantics
Authors: Shin-Ya Katsumata
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

We give a new formulation of attribute grammars (AG for short) called monoidal AGs in traced symmetric monoidal categories. Monoidal AGs subsume existing domain-theoretic, graph-theoretic and relational formulations of AGs. Using a 2-categorical aspect of monoidal AGs, we also show that every monoidal AG is equivalent to a synthesised one when the underlying category is closed, and that there is a sound and complete translation from local dependency graphs to relational AGs.
Domestic Heat Demand Prediction Using Neural Networks
Authors: Vincent Bakker, Albert Molderink, Johann L. Hurink, Gerard J. M. Smit
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

By combining a cluster of microCHP appliances, a virtual power plant can be formed. To use such a virtual power plant, a good heat demand prediction of individual households is needed since the heat demand determines the production capacity. In this paper we present the results of using neural networks techniques to predict the heat demand of individual households. This prediction is required to determine the electricity production capacity of the large fleet of microCHP appliances. All predictions are short-term (for one day) and use historical heat demand and weather influences as input.
Understanding privacy regulation in ubicomp interactions
Authors: Jaakko T. Lehikoinen, Juha Lehikoinen, Pertti Huuskonen
Venue: Personal and Ubiquitous Computing (2008)

Ubiquitous computing contains a huge promise for more intelligent services that are available anywhere and are able to dynamically adapt to the users' current context. However, what necessarily follows such an environment is the compromising of the users' privacy. We aim at analyzing this complex issue by applying and extending Altman's theoretical privacy framework, well known in social sciences, to privacy in ubicomp. Altman understands privacy as a two-way interactive process, which makes the approach promising in analyzing ubicomp where people, devices and the environment interact with each other. We point out similarities between the existing model and the features of ubicomp environment, and verify the results by applying and analyzing the resulting extended framework to typical ubicomp use cases. Based on the analysis, we argue that privacy in ubicomp can be modeled similarly to privacy in general by extending the model to cover such factors as mediation and non-human actors.
A Multiple-Control Fuzzy Vault
Authors: Marianne Hirschbichler, Colin Boyd, Wageeh Boles
Venue: Proceedings of the 2008 Sixth Annual Conference on Privacy, Security and Trust (2008)

We introduce multiple-control fuzzy vaults allowing generalized threshold, compartmented and multilevel access structure. The presented schemes enable many useful applications employing multiple users and/or multiple locking sets. Introducing the original single control fuzzy vault of Juels and Sudan we identify several similarities and differences between their vault and secret sharing schemes which influence how best to obtain working generalizations. We design multiple-control fuzzy vaults suggesting applications using biometric credentials as locking and unlocking values.Furthermore we assess the security of our obtained generalizations for insider/ outsider attacks and examine the access-complexity for legitimate vault owners.
Automatic Computational Discovery of Chemical Reaction Networks Using Genetic Programming
Authors: John R. Koza, William Mydlowec, Guido Lanza, Jessen Yu, Martin A. Keane
Venue: Computational Discovery of Scientific Knowledge: Introduction, Techniques, and Applications in Environmental and Life Sciences (2007)

The concentrations of substances participating in networks of chemical reactions are often modeled by non-linear continuous-time differential equations. Recent work has demonstrated that genetic programming is capable of automatically creating complex networks (such as analog electrical circuits and controllers) whose behavior is modeled by linear and non-linear continuous-time differential equations and whose behavior matches prespecified output values. This chapter demonstrates that it is possible to automatically induce (reverse engineer) a network of chemical reactions from observed time-domain data. Genetic programming starts with observed time-domain concentrations of substances and automatically creates both the topology of the network of chemical reactions and the rates of each reaction of a network such that the behavior of the automatically created network matches the observed time-domain data. Specifically, genetic programming automatically created a network of four chemical reactions that consume glycerol and fatty acid as input, use ATP as a cofactor, and produce diacyl-glycerol as the final product. The network was created from 270 data points. The topology and sizing of the entire network was automatically created using the time-domain concentration values of diacyl-glycerol (the final product). The automatically created network contains three key topological features, including an internal feedback loop, a bifurcation point where one substance is distributed to two different reactions, and an accumulation point where one substance is accumulated from two sources.
Expert Programmer versus Parallelizing Compiler: A Comparative Study of Two Approaches for Distributed Shared Memory
Authors: M. F. P. O'Boyle, J. M. Bull
Venue: Scientific Programming (1996)

This article critically examines current parallel programming practice and optimizing compiler development. The general strategies employed by compiler and programmer to optimize a Fortran program are described, and then illustrated for a specific case by applying them to a well-known scientific program, TRED2, using the KSR-1 as the target architecture. Extensive measurement is applied to the resulting versions of the program, which are compared with a version produced by a commercial optimizing compiler, KAP. The compiler strategy significantly outperforms KAP and does not fall far short of the performance achieved by the programmer. Following the experimental section each approach is critiqued by the other. Perceived flaws, advantages, and common ground are outlined, with an eye to improving both schemes.
Plenary lecture II: switching of predation on prey species in the presence of predator interference
Authors: Balswaroop Bhatt
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

The present study deals with a prey- predator model where the prey can freely move within two habitats and the predator can switch to the habitat with most abundant species. The predation has been studied in the presence of predator interference. The stability analysis has been carried out for non zero equilibrium values. Conversion rate of the prey to predator has been taken as a bifurcation parameter and for select data sets, bifurcation points have been found. Interestingly, contrary to the earlier work, all the three types of situations, namely - no bifurcation, single and multiple bifurcations exist.
coreBIST: A Cellular Automata Based Core for Self Testing System-on-Chips
Authors: Rupsa Chakraborty, Dipanwita Roy Chowdhury
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

In this paper, a cellular automata based Built-in self-test (BIST) core design for a self testing System-on-Chip (SoC) is proposed. The objective of the core is to generate pseudo-random test patterns that are injected into the various IP cores within an SoC. The corresponding output patterns are compacted and analyzed for correctness, during the test mode of the SoC. The BIST core was tested on some synthetic SoCs built by integrating ISCAS 85 benchmark circuits. Considerable reduction in the total test time and area is noticed, compared to the corresponding non-BISTEDed SoCs.
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks
Authors: Orhan Dagdeviren, Kayhan Erciyes
Venue: Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science (2007)

We propose a three layer software architecture for shared resource management in mobile ad hoc networks(MANETs). At the lowest layer, the Merging Clustering Algorithm(MCA)[11] partitions the MANET into a number of balanced clusters periodically. At the second layer, the Backbone Formation Algorithm(BFA) provides a virtual ring using the clusterheads found by MCA. Finally, an example resource management protocol which is a modified and scaled version of the Ricart-Agrawala algorithm implemented using the virtual ring structure is presented with the performance results.
Universal Video Adaptation Model for Contents Delivery in Ubiquitous Computing
Authors: Yongik Yoon, Svetlana Kim, Jongwoo Lee
Venue: Proceedings of the 8th Asia-Pacific conference on Computer-Human Interaction (2008)

A video personalization system is designed and implemented an incorporating usage environment to dynamically generate a personalized video summary. The personalization systems adopt and deliver media contents to each user. The video content delivery chain poses today many challenges. There are an increasing terminal diversity, a network heterogeneity and a pressure to satisfy the user preferences. The situation encourages the need for the customized contents in order to provide the user in the best possible experience. In this paper, we address the problem of video customization. For the customized content, we suggest the UVA(Universal Video Adaptation) model that uses the video content description in MPEG-7 standard and MPEG-21 multimedia framework.