ppxscal/embedding_network huggingface dataset:
Authority and convergence in collaborative learning
Authors: Teresa Hübscher-Younger, N. Hari Narayanan
Venue: Computers Education (2003)

Teachers and students have established social roles, norms and conventions when they encounter Computer-Supported Collaborative Learning (CSCL) systems in the classroom. Authority, a major force in the classroom, gives certain people, objects, representations or ideas the power to affect thought and behavior and influences communication and interaction. Effective computer-supported collaborative learning requires students and teachers to change how they understand and assign authority. This paper describes two studies in which students' ideas about authority led them to converge on what they viewed as authoritative representations and styles of representation too early, and the early convergence then hindered their learning. It also describes a third study that illustrates how changes to the CSCL system CAROUSEL (Collaborative Algorithm Representations Of Undergraduates for Self-Enhanced Learning) improved this situation, encouraging students to create representations that were unique, had different styles and emphasized different aspects of algorithms. Based on this research, methods to help students avoid premature convergence during collaborative learning are suggested.
Novel indexing method of relations between salient objects
Authors: R. Chbeir, Y. Amghar, A. Flory
Venue: Effective databases for text & document management (2003)

Since the last decade, images have been integrated into several application domains such as GIS, medicine, etc. This integration necessitates new managing methods particularly in image retrieval. Queries should be formulated using different types of features such as low-level features of images (histograms, color distribution, etc.), spatial and temporal relations between salient objects, semantic features, etc. In this chapter, we propose a novel method for identifying and indexing several types of relations between salient objects. Spatial relations are used here to show how our method can provide high expressive power to relations in comparison to the traditional methods.
Everything Is Alive
Authors: Craig Thompson
Venue: IEEE Internet Computing (2004)

Two hundred years ago, it would have been difficult to comprehend the changes the now-pervasive electrical grid would make in our lives. More recently, the PC revolution distributed computing to individual desktops and PDAs. But what if current technology trends are leading us directly toward a brave new world where these fantastical phenomena are real and even mundane?
Techniques for Transient Fault Sensitivity Analysis and Reduction in VLSI Circuits
Authors: Atul Maheshwari, Israel Koren, Wayne Burleson
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

Transient faults in VLSI circuits could lead to disastrous consequences. With technology scaling, circuits are becoming increasingly vulnerable to transient faults. This paper presents an accurate and efficient method to estimate fault-sensitivity of VLSI circuits. Using a binary counter and an RC5 encryption implementation as examples, this paper shows that by performing a limited amount of random simulations, fault sensitivity can be estimated accurately at a reasonably low computational cost. This method is then used to show that the combination of two circuit level techniques can make circuits more fault-tolerant than using these techniques individually.
Dynamics features Extraction for on-Line Signature verification
Authors: Flor Ramírez Rioja, Mariko Nakano Miyatake, Héctor Pérez Meana, Karina Toscano
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

Actually great inters to develop a robust on-line signatureverification system has been increased. In this field, threekinds of forgeries: random forgery, simple forgery andexpert forgery must consider. In this paper a dynamicfeatures extraction for an on-line signature verificationsystem is presented. The dynamic features are extracted fromauthentic and forged signatures witch relatively lowcomputational cost. In the proposed system, all kind offorgeries included expert forgeries are considered to detectas forged signatures. The computer simulation results showus a desirable performance of the proposed system.
Bounding Option Prices by Semidefinite Programming: A Cutting Plane Algorithm
Authors: Jun-ya Gotoh, Hiroshi Konno
Venue: Management Science (2002)

In a recent article, Bertsimas and Popescu showed that a tight upper bound on a Europeantype call option price, given the first n moments of the distribution of the underlying security price, can be obtained by solving an associated semidefinite programming problem (SDP). The purpose of this paper is to improve and extend their results. We will show that a tight lower bound can be calculated by solving another SDP. Also, we will show that these problems can be solved very quickly by a newly developed cutting plane algorithm when n is less than six or seven.
Dynamic Memory Management Design Methodology for Reduced Memory Footprint in Multimedia and Wireless Network Applications
Authors: David Atienza, Stylianos Mamagkakis, Francky Catthoor, Jose M. Mendias, Dimitris Soudris
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

New portable consumer embedded devices must execute multimedia and wireless network applications that demand extensive memory footprint. Moreover, they must heavily rely on Dynamic Memory (DM) due to the unpredictability of the input data (e.g. 3D streams features) and system behaviour (e.g. number of applications running concurrently defined by the user). Within this context, consistent design methodologies that can tackle ef.ciently the complex DM behaviour of these multimedia and network applications are in great need. In this paper, we present a new methodology that allows to design custom DM management mechanismswith a reduced memory footprint for such kind of dynamic applications. The experimental results in real case studies show that our methodology improves memory footprint 60% on average over current state-of-the-art DM managers.
Data mining of prenatal data
Authors: Linda Goodwin
Venue: ACM SIGBIO Newsletter (1998)

Comparing inductive machine learning with neural nets and traditional statistical techniques for 'best' predictors of women at risk for PRETERM BIRTH. Preterm babies having higher mortality and morbidity outcomes and often cost in excess of $1 million in the first year of life. We're mining 10 years of prenatal data for possible patterns of preterm birth risk.
The &lsquo;Burnside Process&rsquo; Converges Slowly
Authors: Leslie Ann Goldberg, Mark Jerrum
Venue: Combinatorics, Probability and Computing (2002)

We consider the problem of sampling &lsquo;unlabelled structures&rsquo;, i.e., sampling combinatorial structures modulo a group of symmetries. The main tool which has been used for this sampling problem is Burnside&rsquo;s lemma. In situations where a significant proportion of the structures have no nontrivial symmetries, it is already fairly well understood how to apply this tool. More generally, it is possible to obtain nearly uniform samples by simulating a Markov chain that we call the Burnside process: this is a random walk on a bipartite graph which essentially implements Burnside&rsquo;s lemma. For this approach to be feasible, the Markov chain ought to be &lsquo;rapidly mixing&rsquo;, i.e., converge rapidly to equilibrium. The Burnside process was known to be rapidly mixing for some special groups, and it has even been implemented in some computational group theory algorithms. In this paper, we show that the Burnside process is not rapidly mixing in general. In particular, we construct an infinite family of permutation groups for which we show that the mixing time is exponential in the degree of the group.
The application of computers in writing classes
Authors: Yusuf M. Shudooh
Venue:  (2003)

The application of computers in writing classes is a relatively new paradigm in education. The adoption of computers in writing classes is gaining ground in many universities, especially in the United States. There were numerous issues that were addressed when conducting computer-assisted courses. However, there were not many studies conducted to assess students' reactions, perceptions, attitude and development in such courses. A qualitative quantitative study was designed at a large campus at a Midwestern University to highlight details about students' attitude and development by using multiple sources of data. Both qualitative and quantitative data were collected during the academic year 2002. Data sources include surveys and questionnaires, e-mail messages between the students and the instructor, students' visits and responses to the Blackboard-based course web-page, and students' portfolios that include all the students' acts of writing over a time span of an academic quarter. Qualitative data were analyzed using grounded theory principles. Content analysis was applied to find out the type of electronic and hard-copy response interaction between the students and the instructor and the students themselves. This study employed grounded theory that could reside within the constructivist belief system. As for quantitative data, a Repeated Measure Multivariate Analysis with ANOVA was applied to find out the statistical differences between the groups of this study that uses the same population. Eleven students who were enrolled in a Preparatory Composition course at the University College in a Midwestern University participate in this study. The study focused on the students' experience with this computer-assisted course as taught via Blackboard. To attain a deeper understanding of the students' learning experience in this course, the study looked at how students respond to the instructions delivered by the instructor through the &lsquo;Blackboard&rsquo; platform, the computer-assisted learning environment created by the instructor, the learning materials or feedbacks provided online or offline, the nature of interactions, sources of motivation, and the students' cognitive development throughout the course. The findings indicated that computer-assisted learning helps students become independent learners. They also indicated that students' individual differences and learning styles affected the students' performance in the course. Some of the findings aligned with other research studies. These include: (a) readiness of resources; (b) students' transition to the web-based learning; (c) course and time flexibility was a very positive aspect.
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Authors: S. D. Noble
Venue: Combinatorics, Probability and Computing (1998)

It is known that evaluating the Tutte polynomial, T(G; x, y), of a graph, G, is &num;P-hard at all but eight specific points and one specific curve of the (x, y)-plane. In contrast we show that if k is a fixed constant then for graphs of tree-width at most k there is an algorithm that will evaluate the polynomial at any point using only a linear number of multiplications and additions.
Mining co-location patterns from large spatial datasets
Authors: Shashi Shekhar, Dingzhu Du
Venue:  (2003)

Spatial data mining is the process of discovering implicit, non-trivial, and potentially useful information from large spatial datasets. It encompasses a wide range of techniques for computing and analyzing geographic data. This thesis deals with a task of spatial data mining, namely co-location pattern discovery. Given a collection of boolean spatial features, the co-location pattern discovery process finds the subsets of features frequently located together in geographic space. For example, symbiotic plant species and predator-prey animal species are likely co-locations in Ecology datasets. The co-location rule discovery problem is different from the association rule discovery problem. Even though the boolean spatial features may be considered as item types, there is no natural notion of transactions. Transactioning spatial datasets can lead to incorrect estimation of the interest measures for many spatial co-location patterns with instances near transaction boundaries. This makes it difficult to use traditional interestingness measures, e.g. support, and traditional association rule mining algorithms, which are based on ideas like support based pruning and compression of transaction data. The first part of this thesis formalizes the notion of co-locations using user-specified spatial neighborhoods in place of transactions. It defines new interest measures based on the neighborhoods along with a model for interpreting the co-location rules. It provides a correct and complete algorithm for mining co-location rules. The second part of the thesis focuses on reducing computational costs by exploring alternative join strategies and new filtering methods. An experimental study has been conducted to evaluate the new methods. The use of prevalence-based pruning to gain computational efficiency makes it difficult to discover high-confidence, low-prevalence (HCLP) co-location rules, which are of interest in many application domains. The third part of the thesis focuses on the development of interest measures and algorithms to mine HCLP co-location rules in a computationally efficient manner. Lastly, co-location rules suffer from a well-known difficulty associated with unsupervised learning methods in the area of ascertaining validity of inferences. A comparison of interest measures for co-location patterns with traditional spatial statistical measures, e.g., cross K function, is made to provide an independent assessment of quality of patterns.
An integrated distributed systems management architecture
Authors: Michael A. Bauer, Pat J. Finnigan, James W. Hong, Jan K. Pachl, Toby J. Teorey
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

As distributed systems get larger and more complex, there is an urgent need to manage their components in order to ensure reliable and efficient operations. Managing distributed systems entails monitoring the activities of their components and controlling their behavior as needed. This paper examines the requirements of managing distributed systems and proposes an integrated management architecture. The proposed architecture can provide the support for the management of not only the network services and devices but also the systems services, resources and applications. We also show how some of the management tools developed in the CORDS project fit in this management architecture.
Lower bounds for weak sense of direction
Authors: Paolo Boldi, Sebastiano Vigna
Venue: Journal of Discrete Algorithms (2003)

A graph with n vertices and maximum degree Δ cannot be given weak sense of direction using less than Δ colours. It is known that n colours are always sufficient, but it has been conjectured that just Δ + 1 are really needed. On the contrary, we show that for sufficiently large n there are graphs requiring Δ + ω((n log log n)/log n) colours. Moreover, we prove that, in terms of the maximum degree, Ω(Δ√log log Δ) colours are necessary.
Emergent patterns of mate choice in human populations
Authors: Jorge Simão, Peter M. Todd
Venue: Artificial Life (2003)

We present a model of human mate choice that shows how realistic population-level patterns of assortative mating can self-organize and emerge from the behavior of individuals using simple mate search rules. In particular, we model plausible psychological mechanisms for mate search and choice in a realistic social ecology. Through individual interactions, patterns emerge that match those observed in typical human societies, particularly with regard to correlated quality levels within couples, distributions of the ages at which couples mate, and effects of skewed sex ratios on these mating age distributions.
Ultimate Linux box
Authors: Glenn Stone
Venue: Linux Journal (2003)

We load up the hottest new 64-bit architecture with the hottest new 3-D and storage hardware. 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
Global Analysis and Transformations in Preprocessed Languages
Authors: Diomidis Spinellis
Venue: IEEE Transactions on Software Engineering (2003)

Tool support for refactoring code written in mainstream languages such as C and C++ is currently lacking due to the complexity introduced by the mandatory preprocessing phase that forms part of the C/C++ compilation cycle. The defintion and use of macros complicates the notions of scope and of identifier boundaries. The concept of token equivalence classes can be used to bridge the gap between the language proper semantic analysis and the nonpreprocessed source code. The CScout toolchest uses the developed theory to analyze large interdependent program families. A Web-based interactive front end allows the precise realization of rename and remove refactorings on the original C source code. In addition, CScout can convert programs into a portable obfuscated format or store a complete and accurate representation of the code and its identifiers in a relational database.
On the Image Content of the Chilean Web
Authors: A. Jaimes, J. Ruiz-del-Solar, R. Verschae, D. Yaksic, R. Baeza-Yates, E. Davis, C. Castillo
Venue: Proceedings of the First Conference on Latin American Web Congress (2003)

In this paper we perform a study of the image contents of the Chilean web (.cl domain) using automatic feature extraction, content-based analysis and face detection algorithms. In an automated process we examine all .cl websites and download a large number of the imagesavailable (approx. 83,000). Then we extract several visual features (color, texture, shape, etc.) and we perform face detection using novel algorithms. Using this process we semi-automatically characterize the image content of the web in Chile in terms of the detected faces and the visual features obtained automatically. We present statistics of use to anyone concerned with the image content of the web in Chile. Our study is the first one to use content-based tools to determine the image contents of the web.
An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines
Authors: Frederic Maire
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

The Support Vector Machine (SVM) solution correspondsto the centre of the largest sphere inscribed in versionspace. Alternative approaches like Bayesian PointMachines (BPM) and Analytic Centre Machines have suggestedthat the generalization performance can be furtherenhanced by considering other possible centres of versionspace like the centroid (centre of mass) or the analytic centre.We present an algorithm to compute exactly the centroidof higher dimensional polyhedra, then derive approximationalgorithms to build a new learning machine whoseperformance is comparable to BPM. We also show that forregular kernel matrices (Gaussian kernels for example), theSVM solution can be obtained by solving a linear system ofequalities.
Renewal process with fuzzy interarrival times and rewards
Authors: Ruiqing Zhao, Baoding Liu
Venue: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2003)

This paper considers a renewal process in which the interarrival times and rewards are characterized as fuzzy variables. A fuzzy elementary renewal theorem shows that the expected number of renewals per unit time is just the expected reciprocal of the interarrival time. Furthermore, the expected reward per unit time is provided by a fuzzy renewal reward theorem. Finally, a numerical example is presented for illustrating the theorems introduced in the paper.
Characteristic-function-based independent component analysis
Authors: Jan Eriksson, Visa Koivunen
Venue: Signal Processing (2003)

A novel characteristic-function-based method for blind separation of statistically independent source signals is proposed in the independent component analysis (ICA) framework. The definition of independence may be given in terms of factorization of joint characteristic function. Three criteria for ICA are derived based on this property. These criteria always exist and two of them have desirable large sample properties. An objective function for estimating the independence criteria directly from data is proposed. An efficient algorithm using Fourier coefficients is developed for minimizing the objective function. Simulation results demonstrate that the method performs reliably even in such situations where many widely used ICA methods may fail.
Non-Intrusive Debug Technique for Embedded Programming
Authors: Linda J. Moore, Angelica R. Moya
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Trace Debugging is a software diagnostic techniquefor embedded real-time systems.It is developed to giveembedded software developers the ability to trace theactivity of the processor even when it is operating out ofcache.This ability is lost on many high performanceprocessors and in real-time systems.Tools for debuggingreal-time systems are scarce [5, 13].This paperdescribes work that was performed on a new method oftrace debugging that can be used to aid in real-timedebugging of embedded software.The techniquedescribed uses non-intrusive measurements that aresupplemented with deductive algorithms.The techniquedeveloped in the study differs from traditional debuggersby utilizing the a-priori information that is available.Thestudy utilized a Motorola 68020 as a model of a highperformance processor, but the processes are applicableto many "high performance" processors.A software simulation was used to verify the results.The software simulates the microprocessor operation inboth internal data manipulation and external busoperation.The simulation results were used todemonstrate the efficiency of the trace debugger.Thetesting verifies feasibility and shows the efficiency oftrance debugging as a method to aid in the production ofembedded software.
Software engineering for large-scale multi-agent systems: SELMAS 2003: workshop report
Authors: Alessandro Garcia, José Sardinha, Carlos Lucena, Jaelson Castro, Júlio Leite, Ruy Milidiú, Alexander Romanovsky, Martin Griss, Rogério de Lemos, Anna Perini
Venue: ACM SIGSOFT Software Engineering Notes (2003)

This paper is intended to sum up the results of the Second International Workshop on Software Engineering for Large-Scale Multi-Agent Systems (SELMAS'03) held in Portland, Oregon, USA, May 3--4, 2003, as part of the International Conference on Software Engineering (ICSE'03). The main purpose of this workshop was to share and pool the collective experience of people, both academics and practitioners, who are actively working on software engineering for large-scale multi-agent systems. The call for papers elicited some 26 submissions, of which 19 papers were accepted for presentation. A selected set of the workshop papers and invited papers are to appear in the 2nd edition of the book Software Engineering for Large-Scale Multi-Agent Systems (LNCS, Springer, 2003). The workshop consisted of an opening presentation, several paper presentations organized into five sessions, and three panels. During the workshop we informally reviewed ongoing and previous work and debated a number of important issues. The SELMAS'03 Web page, including the papers and the electronic version of this report, can be found at <www.teccomm.les.inf.puc-rio.br/selmas2003>. We begin by presenting an overview of our goals and the workshop structure, and then focus on the workshop technical program.