ppxscal/embedding_network huggingface dataset:
Student Note-Taking in Narrative-Centered Learning Environments: Individual Differences and Learning Effects
Authors: Scott W. Mcquiggan, Julius Goth, Eunyoung Ha, Jonathan P. Rowe, James C. Lester
Venue: Proceedings of the 9th international conference on Intelligent Tutoring Systems (2008)

Note-taking has a long history in educational settings. Previous research has shown that note-taking leads to improved learning and performance on assessment. It was therefore hypothesized that note-taking could play an important role in narrative-centered learning. To investigate this question, a note-taking facility was introduced into a narrative-centered learning environment. Students were able to use the facility to take and review notes while solving a science mystery. In this paper we explore the individual differences of note-takers and the notes they take. Finally, we use machine learning techniques to model the content of student notes to support future pedagogical adaptation in narrative-centered learning environments.
A Trilogy on Errors in the History of Computing
Authors: N. Metropolis, J. Worlton
Venue: IEEE Annals of the History of Computing (1980)

This article identifies published errors and misunderstandings in three areas of the history of computing and provides the results of research intended to correct these errors. The three areas addressed are: (1) awareness of the work of Charles Babbage among the originators of modern computers; (2) the origins of the stored-program concept; (3) the distinction between the MANIAC and the IAS machine. The conclusions reached are: (1) some of the originators of modern computers were indeed aware of the work of Babbage, but some were not; (2) the stored-program concept was an integral part of the EDVAC design, the result of the work of the ENIAC design team; (3) the term MANIAC was properly applied only to the computer designed and built at Los Alamos Scientific Laboratory, not to the IAS machine.
Topology-Preserving Discrete Deformable Model: Application to Multi-segmentation of Brain MRI
Authors: Sanae Miri, Nicolas Passat, Jean-Paul Armspach
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

Among the numerous 3D medical image segmentation methods proposed in the literature, very few have intended to provide topologically satisfying results, a fortiori for multiple object segmentation. In this paper, we present a method devoted to parallel segmentation of the main classes of cerebral tissues from 3D magnetic resonance imaging data. This method is based on a multi-class discrete deformable model strategy, starting from a topologically correct model, and guiding its evolution in a topology-preserving fashion. Validations on a commonly used cerebral image database provide promising results and justify the further development of a general methodological framework based on the concepts exposed in this preliminary work.
Fences and gates in cyberspace: Is the Internet becoming a threat to democracy?
Authors: Jens Hoff, Flemming Bjerke
Venue: Information Polity (2005)

Departing from the concept of media citizenship, a concept implying certain personal informational rights such as the rights to seek, receive and impart information and ideas through any medium without interference and regardless of frontiers (cf. WSIS (UN World Summit on Information Society) declaration on the Information Society), and seeing such rights as a fundamental dimension of democratic citizenship on equal footing with fundamental civil, political and social rights, this essay analyses the extent to which ICT/the Internet in its current form contributes to the realisation of such media citizenship. Through an analysis of recent developments within the copyright protection area and the software patent area, it is demonstrated that these developments constitute a serious undermining of the freedom to seek, receive and impart information on and through the Internet, and thus significantly confines and restricts media citizenship. Furthermore, these developments delegate significant legislative, executive and judicial power to a few international companies and industry organisations, and work to set up especially Microsoft as a decisive political authority in the information society.
Evaluation of a computer networking class in information technology
Authors: C. Richard G. Helps, J J. Ekstrom
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

Information Technology (IT) is a rapidly-developing discipline. IT instructors often design new courses to meet changing needs. There is also a need to evaluate courses once they have been designed and implemented. Evaluation of courses leads to improvements in the learning experiences for students and better understanding of the educational process and outcomes for course designers and instructors. Evaluation and improvement of quality is a requirement for programs accredited under ABET (and other accrediting bodies). A networking class in IT was selected for evaluation. Networking was selected because it is one of the core required topics in the IT curriculum. The course was compared to national standards for curriculum in the networking area. A single class was evaluated but methods were developed which can be applied to other courses in the IT discipline. The evaluation study included evaluation of the course content and the course structure. Student input was obtained through a survey instrument and the validity of the input was considered. Several questions were identified for this evaluation: Did the networking class meet student needs and expectations in terms of content and teaching approach; What are the students preferred learning styles; What coursework should a networking class include compared to what was actually taught; Did success in the earlier foundation class lead to success in the networking class; How well did students perform in this class relative to their performance in the IT major as a whole? Pursuing these questions involved data gathering from students as well as researching student records. Appropriate mechanisms were developed to protect student privacy. The evaluation of this class led to a number of useful insights and recommendations into technical class content, teaching and learning styles, and into the evaluation process. The methods of the study can be used for other courses and for other IT programs.
Special Feature: Impact of Schedule Estimation on Software Project Behavior
Authors: T. K. Abdel-Hamid
Venue: IEEE Software (1986)

Efforts to develop better estimation tools must address two issues: First, are more accurate tools necessarily better? Second, how can we measure a new estimation method's accuracy?
Existence and Stability of Periodic Solutions for Cohen-Grossberg Neural Networks with Less Restrictive Amplification
Authors: Haibin Li, Tianping Chen
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

The existence and global asymptotic stability of a large class of Cohen-Grossberg neural networks is discussed in this paper. Previous papers always assume that the amplification function has positive lower and upper bounds, which excludes a large class of functions. In our paper, it is only needed that the amplification function is positive. Also, the model discussed is general, the method used is direct and the conditions needed are weak.
Explicit Factorizations of Cyclotomic and Dickson Polynomials over Finite Fields
Authors: Robert W. Fitzgerald, Joseph L. Yucas
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

We give, over a finite field F q , explicit factorizations into a product of irreducible polynomials, of the cyclotomic polynomials of order 3·2 n , the Dickson polynomials of the first kind of order 3·2 n and the Dickson polynomials of the second kind of order 3·2 n ¿ 1.
Formalized Information-Theoretic Proofs of Privacy Using the HOL4 Theorem-Prover
Authors: Aaron R. Coble
Venue: Proceedings of the 8th international symposium on Privacy Enhancing Technologies (2008)

Below we present an information-theoretic method for proving the amount of information leaked by programs formalized using the HOL4 theorem-prover. The advantages of this approach are that the analysis is quantitative, and therefore capable of expressing partial leakage, and that proofs are performed using the HOL4 theorem-prover, and are therefore guaranteed to be logically and mathematically consistent with the formalization. The applicability of this methodology to proving privacy properties of Privacy Enhancing Technologies is demonstrated by proving the anonymity of the Dining Cryptographers protocol. To the best of the author's knowledge, this is the first machine-verified proof of privacy of the Dining Cryptographers protocol for an unbounded number of participants and a quantitative metric for privacy. 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
Evolvable Hardware: A Tool for Reverse Engineering of Biological Systems
Authors: Pauline C. Haddow
Venue: Proceedings of the 8th international conference on Evolvable Systems: From Biology to Hardware (2008)

Biological networks are examples of highly dynamic complex biological processes. As such, one might say that they represent some of the goals sought in evolvable hardware systems. Rather than studying such systems as a basis for newer or refined bio-inspired techniques, the goal of this paper is to present systems biology and in particularly biological networks as one potential "killer application" area for evolvable hardware. To this end, the paper highlights why such an application area can be beneficial to evolvable hardware. Further, the paper proposes artificial development, a newer bioinspired technique, as a technique suitable for such an application and highlights the issues to be addressed and challenges to be faced so as to achieve models of such processes. In addition, the paper discusses how hypothesis generated, from hardware simulations of the dynamics of the model, may be tuned by refined biological knowledge.
Non-uniform Distributions of Quantum Particles in Multi-swarm Optimization for Dynamic Tasks
Authors: Krzysztof Trojanowski
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

This paper presents research considering mixed multi-swarm optimization approach applied to dynamic environments. One of the versions of this approach, called mQSO is a subject of our special interest. The mQSO algorithm works with a set of particles divided into sub-swarms where every sub-swarm consists of two types of particles: classic and quantum ones. The research is focused on studying properties of the latter type. Two new distributions of new locations for the quantum particles are proposed: static and adaptive one. Both of them are based on an ¿-stable symmetric distribution. In opposite to already published methods of distribution of new locations the proposed methods allow the locations to be distributed over the entire search space. Obtained results show high efficiency of the mQSO approach equipped with the proposed two new methods.
8th French-speaking conference on knowledge discovery and management (EGC2008): conference report
Authors: Fabrice Guillet, Brigitte Trousse
Venue: ACM SIGKDD Explorations Newsletter (2008)

In this paper, we provide a report about the 8th French-speaking conference on Knowledge Discovery and Management (EGC'2008) [1] held in Sophia Antipolis, France, from January 29th to February 1st, 2008. Since 2001, this annual conference has been supported by the French-speaking association (EGC Association) which aims at promoting Data Mining and Knowledge Management for both research issues and applications in companies. EGC2008 may be summarized in some key figures: 130 submitted papers, 40 accepted long papers (33% selection ratio) published in a special issue of a review and completed with 30 short papers, 15 posters, and 8 software demonstrations; 9 joined workshops and 2 tutorials; 4 keynote talks; a best paper contest rewarded by 2 prizes of 1500 euros each; and 250 participants from 14 countries. The 9th EGC conference will be held in Strasbourg, France, in January 27-30, 2009 [2].
Exploiting organisational information for service coordination in multiagent systems
Authors: Alberto Fernández, Sascha Ossowski
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1 (2008)

Service-Oriented Computing and Agent Technology are nowadays two of the most active research fields in distributed and open systems. However, when trying to bridge the two worlds, it becomes apparent that the interaction-centric approach of multiagent systems may affect the way services are modelled and enacted, and vice versa. We claim that organisational models that underlie multiagent interactions are crucial in order to take advantage of this interrelation. In this paper we present an approach for modelling organisational structures in service-oriented multiagent systems, and show how it affects semantic service descriptions. We also present approaches to service matchmaking as well as to service composition, capable of exploiting organisational information in service descriptions. In both cases, we prove experimentally the validity of our approach.
Optimizing coverage in a K-covered and connected sensor network using genetic algorithms
Authors: Kasim Sinan Yildirim, Tahir Emre Kalayci, Aybars Uǧur
Venue: Proceedings of the 9th WSEAS International Conference on Evolutionary Computing (2008)

Sensing coverage of a sensor network characterizes how well an area is monitored or tracked by sensors. Connectivity is an important requirement that shows how nodes in a sensor network can effectively communicate. Some hotspot areas in the network are more important than other areas and need to be covered by more sensors. We are interested in an initial deployment strategy that maximizes the coverage area of wireless sensor network while preserving connectivity between nodes provided that all given hotspot regions are covered by at least k sensors. We propose a genetic algorithm based solution to find an optimal sensor node distribution. Experimental results are presented to evaluate our algorithm.
Learning Subclasses of Pure Pattern Languages
Authors: P. J. Abisha, D. G. Thomas, Sindhu J. Kumaar
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

Pattern language learning algorithms within the inductive inference model and query learning setting have been of great interest. In this paper, we study the problem of learning pure pattern languages using queries and examples.
VirtuOz Interactive Agents
Authors: Aurélie Cousseau
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

VirtuOz is a software company that develops and sells an interactive agent technology capable of efficiently collaborating with clients' customer service departments in order to provide its users with an innovative, immediate, assistance service based on artificial intelligence.
Semantic Composition of Lecture Subparts for a Personalized e-Learning
Authors: Naouel Karam, Serge Linckels, Christoph Meinel
Venue: Proceedings of the 4th European conference on The Semantic Web: Research and Applications (2007)

In this paper we propose an algorithm for personalized learning based on a user's query and a repository of lecture subparts --i.e., learning objects-- both are described in a subset of OWL-DL. It works in two steps. First, it retrieves lecture subparts that cover as much as possible the user's query. The solution is based on the concept covering problem for which we present a modified algorithm. Second, an appropriate sequence of lecture subparts is generated. Indeed, the different lecture subparts are only reachable when a given prerequisite is fulfilled, i.e., the learner must have a minimal background knowledge to be able to assimilate the requested learning object. Therefore, our algorithm takes into account the user's knowledge to generate a personalized lecture composition and suggests a flow of learning objects to the user.
Text plagiarism detection method based on path patterns
Authors: Chun Kit See, Kuok-Shoong Wong, Wei Lee Woon
Venue: International Journal of Business Intelligence and Data Mining (2008)

This paper extends the forward method plagiarism detection in finding the percentage of similarity between documents. We have developed an algorithm to quantify the similarity based on path patterns, and the method employed is simple, as it involves only ordinary mathematics, thus simplifying application programming and speed up processing time. The method simply converts words into steps, which walks on a mesh, using a new proposed hash function. The hash function guarantees that the number of steps for each different word is unique and thus the walk pattern on a mesh is unique. Hence, a plagiarised version document will display a unique pattern on a mesh that is similar to the original document. This extended paper presents the algorithm in detail, and results are compared with an available online plagiarism detection tool.
Na$_{N}^{+}$ (N &les;12) clusters fragmentation channels: A conceptual DFT approach
Authors: Gregorio Guzmán-Ramírez, Agustín Segovia-Ríos, Jorge Sierra-Arellano, Juvencio Robles
Venue: Journal of Computational Methods in Sciences and Engineering (2007)

In this paper we study the small Na$_{N}^{+}$ (N &les; 12) cationic clusters fragmentation channels, with all electronic calculations performed at the B3LYP/6-311G+(d,p) DFT level of theory. For these cluster sizes, we obtain for all neutral, cationic, bi-cationic and anionic species the optimized geometries, total energies and electronic properties such as the adiabatic ionization potentials, electron affinities and global hardnesses. Furthermore, we propose the novel concept of global hardness change, &Delta; &eta;, within the conceptual DFT formalism, based on the maximum hardness principle of Chattaraj, Lee, and Parr. Thereafter we compute for all possible fragmentation channels the involved energetics, &Delta;E, and the global hardness change, &Delta;&eta;, both methods are shown to be in agreement with available experimental findings for all but one case. We show that hardness and the global hardness change are good DFT descriptors to assess the preferred fragmentation channels, where formation of the hardest fragments seems to be the driving force.
OpenMP 3.0 --- A Preview of the Upcoming Standard
Authors: Larry Meadows
Venue: Proceedings of the 3rd international conference on High Performance Computing and Communications (2007)

The OpenMP 3.0 standard should be released for public comment by the time of this conference. OpenMP 3.0 is the first major upgrade of the OpenMP standard since the merger of the C and Fortran standards in OpenMP 2.5. This talk will give an overview of the new features in the OpenMP standard and show how they help to extend the range of problems for which OpenMP is suitable.Even with multi-core, the number of hardware cores in an SMP node is likely to be relatively small for the next few years. Further, a number of users want to use OpenMP, but need to scale to more cores than fit in a node, and do not want to mix OpenMP and MPI. Intel supports a production quality OpenMP implementation for clusters that provides a way out. This talk will briefly introduce Intel Cluster OpenMP, provide an overview of the tools available for writing programs, and show some performance data.
Reliability experience on the OARAC
Authors: Robert W. House
Venue: Papers and discussions presented at the Dec. 8-10, 1953, eastern joint AIEE-IRE computer conference: information processing systems---reliability and requirements (1953)

The OARAC (Office of Air Research Automatic Computer) was delivered to the Aeronautical Research Laboratory at Wright Air Development Center in February 1953. After physical installation it required about two weeks for electrical installation and checking. Consequently, good computing time began the latter part of April.
DIBHR: Depth Image-Based Haptic Rendering
Authors: Jongeun Cha, Mohamad Eid, Abdulmotaleb Saddik
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This paper presents Depth Image-Based Haptic Rendering (DIBHR), a haptic rendering algorithm that enables users to haptically explore 3D video media based on depth image-based representation (DIBR). The algorithm computes the shortest proxy (god-object) path along which the proxy goes into the local distance minimum to the goal (haptic interaction point) constrained on surface in order to obtain correct friction force when the friction cone algorithm is applied. This algorithm is based on the god-object [3] concept and adopted the neighborhood search algorithm [5][6]. The experiments compare DIBHR with two previous algorithms [5][6] as per computation time and smoothness of resultant force rendering. The results show slower computation time yet within 1 millisecond and smoother force with friction.
Supporting Evolution in Model-Based Product Line Engineering
Authors: Deepak Dhungana, Thomas Neumayer, Paul Grunbacher, Rick Rabiser
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Software maintenance and evolution are among the most challenging and cost-intensive activities in software engineering. This is not different for software product lines due to their complexity and long life-span. New customer requirements, technology changes and internal enhancements lead to the continuous evolution of a product line's reusable assets. Due to the size of product lines, single stakeholders or teams can only maintain a small part of a system which poses additional challenges for evolution. This paper presents an approach supporting product line evolution by organizing variability models of large-scale product lines as a set of interrelated model fragments defining the variability of particular parts of the system. The approach allows semi-automatic merging of fragments into complete variability models. We also provide tool support to automatically detect changes that would make models and the architecture inconsistent. Furthermore, our approach supports the co-evolution of variability models and their respective meta-models. We illustrate the approach with examples from an ongoing industry collaboration.
Towards Verification of Model Transformations Via Goal-Directed Certification
Authors: Gabor Karsai, Anantha Narayanan
Venue: Model-Driven Development of Reliable Automotive Services: Second Automotive Software Workshop, ASWSD 2006, San Diego, CA, USA, March 15-17, 2006, Revised Selected Papers (2006)

Embedded software is widely used in automotive applications, often in critical situations where reliability of the system is extremely important. Such systems often use model based development approaches. Model transformation is an important step in such scenarios. This includes generating code from models, transforming design models into analysis models, or transforming a model between variants of a formalism (such as variants of Statecharts). It becomes important to verify that the transformation was correct, and the transformed model or code preserved the semantics of the design model. In this paper, we will look at a technique called "goal-directed certification" that provides a pragmatic solution to the verification problem. We will see how we can use concepts of bisimulation to verify whether a certain transformation instance preserved certain properties. We will then extend this idea using weak bisimulation and semantic anchoring, to a more general class of transformations.